Valid HTML 4.0! Valid CSS!
%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.183",
%%%     date            = "05 December 2024",
%%%     time            = "07:20:07 MST",
%%%     filename        = "compsurv.bib",
%%%     address         = "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",
%%%     URL             = "https://www.math.utah.edu/~beebe",
%%%     checksum        = "56982 106931 497277 5031638",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography, BibTeX, Computing Surveys",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a COMPLETE bibliography of ACM
%%%                        Computing Surveys (known just as Computing
%%%                        Surveys until volume 3 in 1971), covering
%%%                        all volumes from 1969 to date.
%%%
%%%                        Volume 28, number 4es, and Volume 30,
%%%                        number 3es, are electronic supplements that
%%%                        are only available online at World-Wide Web
%%%                        URLs given in the entries.  The articles in
%%%                        the first supplement are listed in the
%%%                        table of contents of volume 28, number 4,
%%%                        but do not appear in the issue itself.  The
%%%                        last article in Volume 28, number 4es is
%%%                        missing from that table of contents.
%%%
%%%                        The journal ISSN changed from 0010-4892 to
%%%                        0360-0300 at the June 1983 issue, for no
%%%                        obvious reason: the journal title remained
%%%                        unchanged.
%%%
%%%                        At version 1.183, the COMPLETE year coverage
%%%                        looked like this:
%%%
%%%                             1969 (  17)    1988 (  17)    2007 (  12)
%%%                             1970 (  18)    1989 (  22)    2008 (  19)
%%%                             1971 (   9)    1990 (  22)    2009 (  20)
%%%                             1972 (  12)    1991 (  23)    2010 (  15)
%%%                             1973 (   9)    1992 (  23)    2011 (  31)
%%%                             1974 (  14)    1993 (  19)    2012 (  38)
%%%                             1975 (  15)    1994 (  17)    2013 (  92)
%%%                             1976 (  17)    1995 (  92)    2014 (  29)
%%%                             1977 (  27)    1996 ( 336)    2015 (  71)
%%%                             1978 (  38)    1997 (  19)    2016 (  91)
%%%                             1979 (  41)    1998 (  43)    2017 (  94)
%%%                             1980 (  29)    1999 (  87)    2018 ( 108)
%%%                             1981 (  30)    2000 (  55)    2019 ( 151)
%%%                             1982 (  28)    2001 (  12)    2020 ( 133)
%%%                             1983 (  27)    2002 (  14)    2021 ( 157)
%%%                             1984 (  19)    2003 (  13)    2022 ( 109)
%%%                             1985 (  22)    2004 (  12)    2023 ( 322)
%%%                             1986 (  20)    2005 (  11)    2024 ( 319)
%%%                             1987 (  20)    2006 (  13)    2025 (  79)
%%%
%%%                             Article:       3150
%%%                             Book:             2
%%%
%%%                             Total entries: 3152
%%%
%%%                        The bibliography also includes entries for
%%%                        all editorial comments, and for Surveyor's
%%%                        Forum letters.  Articles and letters that
%%%                        comment on them are cross-referenced in both
%%%                        directions, so that citation of one of them
%%%                        will automatically include the others.  A
%%%                        small number of additional entries from
%%%                        outside ACM Computing Surveys are included to
%%%                        satisfy cross references.
%%%
%%%                        The initial draft of this bibliography was
%%%                        extracted from the ACM Computing Archive CD
%%%                        ROM for the 1980s, with manual corrections
%%%                        and additions.  Major additions were then
%%%                        obtained from the huge Computer Science
%%%                        bibliography archive on ftp.ira.uka.de.  The
%%%                        remaining entries were added by hand, and all
%%%                        entries were rechecked against the original
%%%                        journal issues, which resulted in numerous
%%%                        corrections.  Math Review MRclass and
%%%                        MRnumber values were supplied from a search
%%%                        of the American Mathematical Society's
%%%                        MathSciNet database for six entries, the
%%%                        only ones covered there.  At version 1.36
%%%                        [18-Dec-1996], search results from the
%%%                        Compendex databases (1970--1996) were used
%%%                        to check and augment the bibliographic
%%%                        data.
%%%
%%%                        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.
%%%
%%%                        The ACM maintains Web pages with journal
%%%                        tables of contents for 1985--date at
%%%
%%%                            http://www.acm.org/pubs/toc
%%%
%%%                        The Web pages for Computing Surveys are at
%%%
%%%                            http://www.acm.org/pubs/contents/journals/surveys/
%%%                            http://portal.acm.org/browse_dl.cfm?idx=J204
%%%                            https://dl.acm.org/loi/csur
%%%
%%%                        That data has been automatically converted to
%%%                        BibTeX form, corrected for spelling and page
%%%                        number errors, and merged into this file.
%%%
%%%                        ACM copyrights explicitly permit abstracting
%%%                        with credit, so article abstracts, keywords,
%%%                        and subject classifications have been
%%%                        included in this bibliography wherever
%%%                        available.  Article reviews have been
%%%                        omitted, until their copyright status has
%%%                        been clarified.
%%%
%%%                        bibsource keys in the bibliography entries
%%%                        below indicate the entry originally came
%%%                        from the computer science bibliography
%%%                        archive, even though it has likely since
%%%                        been corrected and updated.
%%%
%%%                        URL keys in the bibliography point to
%%%                        World Wide Web locations of additional
%%%                        information about the entry.
%%%
%%%                        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 tags were automatically
%%%                        generated by software developed for the
%%%                        BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted by
%%%                        journal, and then by publication order, with
%%%                        the help of ``bibsort -byvolume''.  The
%%%                        bibsort utility is available from
%%%                        ftp://ftp.math.utah.edu/pub/tex/bib/bibsort-x.y.*,
%%%                        where x.y is a version number.
%%%
%%%                        Fields within entries have been put into a
%%%                        consistent order by the biborder utility
%%%                        [ftp://ftp.math.utah.edu/pub/tex/bib/biborder-x.y.*].
%%%                        and the entire bibliography has been
%%%                        processed by the bibclean syntax checker and
%%%                        prettyprinter,
%%%                        [ftp://ftp.math.utah.edu/pub/tex/bib/bibclean-x.y.*],
%%%                        and by bibcheck
%%%                        [ftp://ftp.math.utah.edu/pub/tex/bib/bibcheck-x.y.*].
%%%
%%%                        Numerous heuristic checks on the validity
%%%                        of the bibliography files have been made
%%%                        using software developed by the author for
%%%                        maintenance of the TeX Users Group and
%%%                        BibNet bibliography collections.
%%%
%%%                        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{"\input bibnames.sty "
 # "\input path.sty "
 # "\hyphenation{
                Les-lie
                Pren-tice
                Rich-ard
                Schlotz-hauer
                Spring-er
                } "
 # "\ifx \undefined \circled \def \circled #1{(#1)}          \fi"
 # "\ifx \undefined \mathbb  \def \mathbb  #1{{\bf #1}}      \fi"
 # "\ifx \undefined \reg     \def \reg       {\circled{R}}   \fi"
 # "\ifx \undefined \TM      \def \TM        {${}^{\sc TM}$} \fi"
}

%%% ====================================================================
%%% 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,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|https://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:
@String{j-COMP-SURV             = "ACM Computing Surveys"}

%%% ====================================================================
%%% Publisher abbreviations:
@String{pub-MIT                 = "MIT Press"}

@String{pub-MIT:adr             = "Cambridge, MA, USA"}

@String{pub-SUCSLI              = "Stanford University Center for the Study of
                                  Language and Information"}

@String{pub-SUCSLI:adr          = "Stanford, CA, USA"}

%%% ====================================================================
%%% Bibliography entries: The book entries at the end of this file are
%%% cross-referenced from earlier article entries.
@Article{Finerman:1969:EN,
  author =       "Aaron Finerman",
  title =        "An Editorial Note",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "1",
  pages =        "1--1",
  month =        mar,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356540.356541",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:12:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dorn:1969:EPa,
  author =       "William S. Dorn",
  title =        "{Editor}'s Preview\ldots{}",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "1",
  pages =        "2--5",
  month =        mar,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356540.356542",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:12:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rosen:1969:ECH,
  author =       "Saul Rosen",
  title =        "Electronic Computers: a Historical Survey",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "1",
  pages =        "7--36",
  month =        mar,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356540.356543",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:12:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The first large scale electronic computers were built
                 in connection with university projects sponsored by
                 government military and research organizations. Many
                 established companies, as well as new companies,
                 entered the computer field during the first generation,
                 1947--1959, in which the vacuum tube was almost
                 universally used as the active component in the
                 implementation of computer logic. The second generation
                 was characterized by the transistorized computers that
                 began to appear in 1959. Some of the computers built
                 then and since are considered super computers; they
                 attempt to go to the limit of current technology in
                 terms of size, speed, and logical complexity. From 1965
                 onward, most new computers belong to a third
                 generation, which features integrated circuit
                 technology and multiprocessor multiprogramming
                 systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer history; electronic computers; magnetic drum
                 computers; super computers; time-sharing;
                 transistorized computers; university computer projects;
                 vacuum tube computers",
}

@Article{Rosin:1969:SMS,
  author =       "Robert F. Rosin",
  title =        "Supervisory and Monitor Systems",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "1",
  pages =        "37--54",
  month =        mar,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356540.356544",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:12:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Glass:1969:EDC,
  author =       "R. L. Glass",
  title =        "An Elementary Discussion of Compiler\slash Interpreter
                 Writing",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "1",
  pages =        "55--77",
  month =        mar,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356540.356545",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:12:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dorn:1969:EPb,
  author =       "William S. Dorn",
  title =        "{Editor}'s Preview \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "2",
  pages =        "81--84",
  month =        jun,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356546.356547",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:12:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hoffman:1969:CPS,
  author =       "Lance J. Hoffman",
  title =        "Computers and Privacy: a Survey",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "2",
  pages =        "85--103",
  month =        jun,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356546.356548",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:12:45 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  annote =       "Survey, discussion, and large Bibliography.",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{McKinney:1969:SAT,
  author =       "J. M. McKinney",
  title =        "A Survey of Analytical Time-Sharing Models",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "2",
  pages =        "105--116",
  month =        jun,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356546.356549",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:12:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dodd:1969:EDM,
  author =       "George G. Dodd",
  title =        "Elements of Data Management Systems",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "2",
  pages =        "117--133",
  month =        jun,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356546.356550",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:12:45 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  annote =       "definitions and examples of various file org.
                 methods.",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dorn:1969:EPc,
  author =       "William S. Dorn",
  title =        "{Editor}'s Preview \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "3",
  pages =        "135--138",
  month =        sep,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356551.356552",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wilkes:1969:GIM,
  author =       "M. V. Wilkes",
  title =        "The Growth of Interest in Microprogramming: a
                 Literature Survey",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "3",
  pages =        "139--145",
  month =        sep,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356551.356553",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rosenfeld:1969:PPC,
  author =       "Azriel Rosenfeld",
  title =        "Picture Processing by Computer",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "3",
  pages =        "147--176",
  month =        sep,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356551.356554",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dorn:1969:EPd,
  author =       "William S. Dorn",
  title =        "{Editor}'s Postview \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "3",
  pages =        "177--177",
  month =        sep,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356551.356555",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dorn:1969:EPe,
  author =       "William S. Dorn",
  title =        "{Editor}'s Preview \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "4",
  pages =        "179--182",
  month =        dec,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356556.356557",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:33 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kent:1969:ALM,
  author =       "William Kent",
  title =        "Assembler-Language Macroprogramming: a Tutorial
                 Oriented Toward the {IBM 360}",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "4",
  pages =        "183--196",
  month =        dec,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356556.356558",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:33 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Christoph:1970:LEA,Kent:1970:LEA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rosin:1969:CCM,
  author =       "Robert F. Rosin",
  title =        "Contemporary Concepts of Microprogramming and
                 Emulation",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "4",
  pages =        "197--212",
  month =        dec,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356556.356559",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:33 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Rosin:1970:ECC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Aron:1969:ISP,
  author =       "J. D. Aron",
  title =        "Information Systems in Perspective",
  journal =      j-COMP-SURV,
  volume =       "1",
  number =       "4",
  pages =        "213--236",
  month =        dec,
  year =         "1969",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356556.356560",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:33 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  annote =       "Introduction to the present and future capabilities of
                 management information systems in the context of file
                 handling, system design, and management use.",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dorn:1970:EPa,
  author =       "William S. Dorn",
  title =        "{Editor}'s Preview \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "1",
  pages =        "1--3",
  month =        mar,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356561.356562",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dolotta:1970:FST,
  author =       "T. A. Dolotta",
  title =        "Functional Specifications for Typewriter-Like
                 Time-Sharing Terminals",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "1",
  pages =        "5--31",
  month =        mar,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356561.356563",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Beech:1970:SVP,
  author =       "David Beech",
  title =        "A Structural View of {PL/I}",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "1",
  pages =        "33--64",
  month =        mar,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356561.356564",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cohen:1970:LSF,
  author =       "Doron J. Cohen and C. C. Gotlieb",
  title =        "A List Structure Form of Grammars for Syntactic
                 Analysis",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "1",
  pages =        "65--82",
  month =        mar,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356561.356565",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:13:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dorn:1970:EPb,
  author =       "William S. Dorn",
  title =        "{Editor}'s Preview \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "2",
  pages =        "83--87",
  month =        jun,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356566.356567",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sedelow:1970:CHF,
  author =       "Sally Yeates Sedelow",
  title =        "The Computer in the Humanities and Fine Arts",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "2",
  pages =        "89--110",
  month =        jun,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356566.356568",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hellerman:1970:TAS,
  author =       "H. Hellerman and H. J. {Smith, Jr.}",
  title =        "Throughput Analysis of Some Idealized Input, Output,
                 and Compute Overlap Configurations",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "2",
  pages =        "111--118",
  month =        jun,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356566.356569",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chapin:1970:FAS,
  author =       "Ned Chapin",
  title =        "Flowcharting With the {ANSI Standard}: a Tutorial",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "2",
  pages =        "119--146",
  month =        jun,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356566.356570",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dorn:1970:EPc,
  author =       "William S. Dorn",
  title =        "{Editor}'s Preview \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "3",
  pages =        "147--152",
  month =        sep,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356571.356572",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:25 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1970:VM,
  author =       "Peter J. Denning",
  title =        "Virtual Memory",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "3",
  pages =        "153--189",
  month =        sep,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356571.356573",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:25 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{MacDougall:1970:CSS,
  author =       "M. H. MacDougall",
  title =        "Computer System Simulation: an Introduction",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "3",
  pages =        "191--209",
  month =        sep,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356571.356574",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:25 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Smith:1970:DCI,
  author =       "Cecil L. Smith",
  title =        "Digital Control of Industrial Processes",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "3",
  pages =        "211--241",
  month =        sep,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356571.356575",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:25 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dorn:1970:EPd,
  author =       "William S. Dorn",
  title =        "{Editor}'s Postview \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "3",
  pages =        "243--243",
  month =        sep,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356571.356576",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:25 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Christoph:1970:LEA,
  author =       "Albert C. Christoph",
  title =        "Letter to the {Editor}: {``Assembler-Language
                 Macroprogramming: A Tutorial Oriented Toward the IBM
                 360''}",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "3",
  pages =        "243--244",
  month =        sep,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356571.356577",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:25 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Kent:1969:ALM,Kent:1970:LEA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kent:1970:LEA,
  author =       "William Kent",
  title =        "Letter to the {Editor}: {``Assembler-Language
                 Macroprogramming: A Tutorial Oriented Toward the IBM
                 360''}",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "3",
  pages =        "244--244",
  month =        sep,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356571.356578",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:25 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Kent:1969:ALM,Christoph:1970:LEA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rosin:1970:ECC,
  author =       "Robert F. Rosin",
  title =        "Erratum: {``Contemporary Concepts of Microprogramming
                 and Emulation''}",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "3",
  pages =        "244--244",
  month =        sep,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356571.356579",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:14:25 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Rosin:1969:CCM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Knuth:1970:NFC,
  author =       "Donald E. Knuth",
  title =        "{Von Neumann}'s First Computer Program",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "4",
  pages =        "247--260",
  month =        dec,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356580.356581",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:15:01 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Reprinted in \cite{Aspray:1987:PJN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Smith:1970:SIG,
  author =       "Lyle B. Smith",
  title =        "A Survey of Interactive Graphical Systems for
                 Mathematics",
  journal =      j-COMP-SURV,
  volume =       "2",
  number =       "4",
  pages =        "261--301",
  month =        dec,
  year =         "1970",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356580.356582",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:15:01 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Williams:1971:SDS,
  author =       "Robin Williams",
  title =        "A Survey of Data Structures for Computer Graphics
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "3",
  number =       "1",
  pages =        "1--21",
  month =        mar,
  year =         "1971",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356583.356584",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:15:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This is a survey of a data structures and their use in
                 computer graphics systems. First, the reasons for using
                 data structures are given. Then the sequential, random,
                 and list organizations are discussed, and it is shown
                 how they may be used to build complex data structures.
                 Representative samples of languages specifically
                 designed for creating and manipulating data structures
                 are described next. Finally some typical computer
                 graphics systems and their data structures are
                 described. It is also pointed out that much work
                 remains to be done to develop a satisfactory
                 theoretical foundation for designing data structures.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Foster:1971:UTS,
  author =       "Caxton C. Foster",
  title =        "An Unclever Time-Sharing System",
  journal =      j-COMP-SURV,
  volume =       "3",
  number =       "1",
  pages =        "23--48",
  month =        mar,
  year =         "1971",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356583.356585",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:15:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This paper describes the internal structure of a
                 time-sharing system in some detail. This system is
                 dedicated to providing remote access, and has a simple
                 file structure. It is intended for use in a university
                 type environment where there are many short jobs that
                 will profit from one- or two-second turnaround. Despite
                 its simplicity, this system can serve as a useful
                 introduction to the problems encountered by the
                 designers of any time-sharing system. Included are a
                 discussion of the command language, the hardware
                 organization toward which the design is oriented, the
                 general internal organization, the command sequences,
                 the CPU scheduler, handling of interrupts, the
                 assignment of core space, execution and control of the
                 user's program, backup storage management, and the
                 handling of errors.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Price:1971:TLT,
  author =       "C. E. Price",
  title =        "Table Lookup Techniques",
  journal =      j-COMP-SURV,
  volume =       "3",
  number =       "2",
  pages =        "49--64",
  month =        jun,
  year =         "1971",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356586.356587",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:15:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Consideration is given to the basic methodology for
                 table searching in computer programming. Only static
                 tables are treated, but references are made to
                 techniques for handling dynamic tables. Methods
                 described are: sequential search, merge search, binary
                 search, estimated entry, and direct entry. The
                 rationale of key transformation is discussed, with some
                 consideration of methods of ``hash addressing.'' A
                 general guide to technique selection is given in
                 conclusion.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "binary search; hashing; search techniques; table
                 lookup techniques",
}

@Article{Coffman:1971:SD,
  author =       "E. G. Coffman and M. J. Elphick and A. Shoshani",
  title =        "System Deadlocks",
  journal =      j-COMP-SURV,
  volume =       "3",
  number =       "2",
  pages =        "67--78",
  month =        jun,
  year =         "1971",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356586.356588",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:15:20 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A problem of increasing importance in the design of
                 large multiprogramming systems is the, so-called,
                 deadlock or deadly-embrace problem. In this article we
                 survey the work that has been done on the treatment of
                 deadlocks from both the theoretical and practical
                 points of view.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lucas:1971:PEM,
  author =       "Henry C. {Lucas, Jr.}",
  title =        "Performance Evaluation and Monitoring",
  journal =      j-COMP-SURV,
  volume =       "3",
  number =       "3",
  pages =        "79--91",
  month =        sep,
  year =         "1971",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356589.356590",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:15:31 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1971.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Three major purposes for evaluating the hardware and
                 software performance of computer systems--selection
                 evaluation, performance projection, and performance
                 monitoring--are described. Eight techniques that have
                 been used or suggested for evaluating performance are
                 discussed. Each of these techniques is rated on its
                 suitability for the three purposes of evaluation.
                 Recommendations are made on the most appropriate
                 technique for each evaluation purpose. These
                 suggestions include the development of a comprehensive
                 set of synthetic programs on an industry-wide basis for
                 selection evaluation purposes. Simulation is
                 recommended as the most suitable technique for
                 performance projection. Finally, a number of hardware
                 and software monitors are available for performance
                 monitoring.",
  acknowledgement = ack-nhfb,
  annote =       "Three major purposes for evaluating the hardware and
                 software performance of computer systems - selection
                 evaluation, performance projection, and performance
                 monitoring - are described. Eight techniques that have
                 been used or suggested for evaluating performance are
                 discussed.",
  country =      "USA",
  date =         "09/01/80",
  descriptors =  "Performance evaluation; simulation; monitoring;
                 performance projection; computer selection; benchmark;
                 test tool",
  enum =         "2009",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  language =     "English",
  references =   "59",
}

@Article{vanDam:1971:LTE,
  author =       "Andries {van Dam} and David E. Rice",
  title =        "On-line Text Editing: a Survey",
  journal =      j-COMP-SURV,
  volume =       "3",
  number =       "3",
  pages =        "93--114",
  month =        sep,
  year =         "1971",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356589.356591",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:15:31 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This paper is a survey of current methods for the
                 on-line creation and editing of computer programs and
                 of ordinary manuscripts text. The characteristics of
                 on-line editing systems are examined and examples of
                 various implementations are described in three
                 categories: program editors, text editors, and
                 terminals with local editing facilities.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ledgard:1971:TML,
  author =       "Henry F. Ledgard",
  title =        "Ten Mini-Languages: a Study of Topical Issues in
                 Programming Languages",
  journal =      j-COMP-SURV,
  volume =       "3",
  number =       "3",
  pages =        "115--146",
  month =        sep,
  year =         "1971",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356589.356592",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:15:31 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The proliferation of programming languages has raised
                 many issues of language design, definition, and
                 implementation. This paper presents a series of ten
                 mini-languages, each of which exposes salient features
                 found in existing programming languages. The value of
                 the mini-languages lies in their brevity of description
                 and the isolation of important linguistic features: in
                 particular, the notions of assignment, transfer of
                 control, functions, parameter passing, type checking,
                 data structures, string manipulation, and input/output.
                 The mini-languages may serve a variety of uses:
                 notably, as a pedagogical tool for teaching programming
                 languages, as a subject of study for the design of
                 programming languages, and as a set of test cases for
                 methods of language implementation or formal
                 definition.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Martin:1971:S,
  author =       "W. A. Martin",
  title =        "Sorting",
  journal =      j-COMP-SURV,
  volume =       "3",
  number =       "4",
  pages =        "147--174",
  month =        dec,
  year =         "1971",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356593.356594",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:15:51 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The bibliography appearing at the end of this article
                 lists 37 sorting algorithms and 100 books and papers on
                 sorting published in the last 20 years. The basic ideas
                 presented here have been abstracted from this body of
                 work, and the best algorithms known are given as
                 examples. As the algorithms are explained, references
                 to related algorithms and mathematical or experimental
                 analyses are given. Suggestions are then made for
                 choosing the algorithm best suited to a given
                 situation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1971:TGC,
  author =       "Peter J. Denning",
  title =        "Third Generation Computer Systems",
  journal =      j-COMP-SURV,
  volume =       "3",
  number =       "4",
  pages =        "175--216",
  month =        dec,
  year =         "1971",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356593.356595",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:15:51 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The common features of third generation operating
                 systems are surveyed from a general view, with emphasis
                 on the common abstractions that constitute at least the
                 basis for a ``theory'' of operating systems. Properties
                 of specific systems are not discussed except where
                 examples are useful. The technical aspects of issues
                 and concepts are stressed, the nontechnical aspects
                 mentioned only briefly. A perfunctory knowledge of
                 third generation systems is presumed.",
  acknowledgement = ack-nhfb,
  annote =       "An operating systems approach to storage management,
                 good illustration of deadlock, extensive
                 bibliography.",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1972:NPD,
  author =       "Peter J. Denning",
  title =        "A Note on Paging Drum Efficiency",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "1",
  pages =        "1--3",
  month =        mar,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356596.356597",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:09 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  annote =       "Do not assume uniform distribution over sector
                 queues.",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wegner:1972:VDL,
  author =       "Peter Wegner",
  title =        "The {Vienna Definition Language}",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "1",
  pages =        "5--63",
  month =        mar,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356596.356598",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:09 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Schucany:1972:SSP,
  author =       "W. R. Schucany and Paul D. Minton and B. Stanley
                 {Shannon, Jr.}",
  title =        "A Survey of Statistical Packages",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "2",
  pages =        "65--79",
  month =        jun,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356599.356600",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:19 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article presents a survey of the existing
                 packages of computer programs that are being used for
                 the statistical analysis of data. The basic
                 capabilities of a general-purpose package are listed
                 and discussed briefly. The various types of statistical
                 packages are classified into five general categories,
                 and a description of each category is given. Brief
                 abstracts and summary descriptions of 37 packages are
                 presented, as well as a list of 18 additional packages
                 and 17 related references. 17 refs.",
  acknowledgement = ack-nhfb,
  classification = "723; 922",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data processing; statistical methods; statistical
                 package",
}

@Article{Nievergelt:1972:WMC,
  author =       "J. Nievergelt and J. C. Farrar",
  title =        "What Machines Can and Cannot Do",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "2",
  pages =        "81--96",
  month =        jun,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356599.356601",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Elspas:1972:ATP,
  author =       "Bernard Elspas and Karl N. Levitt and Richard J.
                 Waldinger and Abraham Waksman",
  title =        "An Assessment of Techniques for Proving Program
                 Correctness",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "2",
  pages =        "97--147",
  month =        jun,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356599.356602",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:19 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The purpose of this paper is to point out the
                 significant quantity of work in progress on techniques
                 that will enable programmers to prove their programs
                 correct. This work has included: investigations in the
                 theory of program schemas or abstract programs;
                 development of the art of the informal or manual proof
                 of correctness; and development of mechanical or
                 semi-mechanical approaches to proving correctness. At
                 present, these mechanical approaches rely upon the
                 availability of powerful theorem-provers, development
                 of which is being actively pursued. All of these
                 technical areas are here surveyed in detail, and
                 recommendations are made concerning the direction of
                 future research toward producing a semi-mechanical
                 program verifier.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computers; program schema; theorem-proving",
  xxnote =       "There is a page 147 in each of numbers 2 and 3 of
                 volume 4.",
}

@Article{Weiss:1972:A,
  author =       "Eric A. Weiss",
  title =        "An Appreciation",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "3",
  pages =        "147--147",
  month =        sep,
  year =         "1972",
  CODEN =        "CMSVAN",
  ISSN =         "0010-4892",
  bibdate =      "Fri Sep 30 00:31:17 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  xxnote =       "There is a page 147 in each of numbers 2 and 3 of
                 volume 4.",
}

@Article{Presser:1972:LL,
  author =       "Leon Presser and John R. White",
  title =        "Linkers and Loaders",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "3",
  pages =        "149--167",
  month =        sep,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356603.356605",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:35 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This is a paper on the linking and loading stages of
                 the language transformation process. First, loaders are
                 classified and discussed. Next, the linking process is
                 treated in terms of the various times at which it may
                 occur (i.e., binding to logical space). Finally, the
                 linking and loading functions are explained in detail
                 through a careful examination of their implementation
                 in the IBM System\slash 360. Examples are presented,
                 and a number of possible system trade-offs are pointed
                 out.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "binary loaders; computer operating systems; linking
                 loaders; relocating loaders",
}

@Article{Hoare:1972:I,
  author =       "C. A. R. Hoare and D. C. S. Allison",
  title =        "Incomputability",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "3",
  pages =        "169--178",
  month =        sep,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356603.356606",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:35 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Russell's logical paradox, formulated in terms of
                 English adjectives, is considered as a convenient
                 starting point for this discussion of incomputability.
                 It is shown to be impossible, under a wide variety of
                 circumstances, to program a function which will
                 determine whether another function written in the same
                 programming language will terminate. The theory of
                 types is introduced in an attempt to evade the paradox.
                 Finally, it is shown that any language containing
                 conditionals and recursive function definitions, which
                 is powerful enough to program its own interpreter,
                 cannot be used to program its own terminates
                 function.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer metatheory --- Formal Logic; computer
                 programming languages; incomputability; logical
                 paradox; recursion",
}

@Article{Holt:1972:SDP,
  author =       "Richard C. Holt",
  title =        "Some Deadlock Properties of Computer Systems",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "3",
  pages =        "179--196",
  month =        sep,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356603.356607",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:35 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Several examples of deadlock occurring in present day
                 computer systems are given. Next, there is a discussion
                 of the strategies which can be used to deal with the
                 deadlock problem. A theory of computer systems is
                 developed so that the terms ``process'' and
                 ``deadlock'' can be defined. ``Reusable resources'' are
                 introduced to model objects that are shared among
                 processes, and ``consumable resources'' are introduced
                 to model signals or messages passed among processes.
                 Then a simple graph model of computer systems is
                 developed, and its deadlock properties are
                 investigated. This graph model unifies a number of
                 previous results, leads to efficient deadlock detection
                 and prevention algorithms, and is useful for teaching
                 purposes.",
  acknowledgement = ack-nhfb,
  annote =       "Abstract of thesis, survey and solutions.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer operating systems",
}

@Article{Stutzman:1972:DCC,
  author =       "Byron W. Stutzman",
  title =        "Data Communication Control Procedures",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "4",
  pages =        "197--220",
  month =        dec,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356608.356609",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:47 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This paper is a tutorial on the methods used to
                 control the transmission of digital information on data
                 communication links. Simple models of data
                 communication systems are introduced and terminology
                 for describing their functions and operation is
                 established. Various graphical methods of representing
                 communication control procedures are discussed and used
                 to describe significant features of communication
                 control procedures in detail.",
  acknowledgement = ack-nhfb,
  classification = "718; 722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computers; data processing --- Data Handling; data
                 transmission",
}

@Article{Barnes:1972:PVA,
  author =       "Bruce H. Barnes",
  title =        "A Programmer's View of Automata",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "4",
  pages =        "221--239",
  month =        dec,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356608.356610",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:47 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The purpose of this discussion is to introduce the
                 Computer Scientist to the concepts, definitions,
                 notation and ideas of finite automata theory and to
                 suggest how these ideas might relate to some of the
                 other fields of Computer Science. Since understanding
                 of the basic concepts is the purpose of this
                 discussion, emphasis will be placed on definitions and
                 examples than on theorems and proofs.",
  acknowledgement = ack-nhfb,
  classification = "721",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "automata theory; deterministic automation",
}

@Article{Willoughby:1972:SMF,
  author =       "Theodore C. Willoughby",
  title =        "Staffing the {MIS} Function",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "4",
  pages =        "241--259",
  month =        dec,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356608.356611",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:47 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This tutorial describes MIS (Business Data Processing)
                 staffing problems. Aspects included are job
                 descriptions, recruitment, selection and turnover. The
                 job descriptions described are traditional, trait
                 analysis and task analysis. The recruiting section
                 includes both inside and outside sources. Selection is
                 discussed in terms of satisfactoriness and
                 satisfaction. The more popular tests are described.",
  acknowledgement = ack-nhfb,
  annote =       "Discussion of the value of human assets.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data processing, business; managerial information
                 system (MIS)",
}

@Article{Organick:1973:EP,
  author =       "Elliott I. Organick",
  title =        "Editorial Policy \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "5",
  number =       "1",
  pages =        "1--3",
  month =        mar,
  year =         "1973",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356612.356613",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Horning:1973:PS,
  author =       "J. J. Horning and B. Randell",
  title =        "Process Structuring",
  journal =      j-COMP-SURV,
  volume =       "5",
  number =       "1",
  pages =        "5--30",
  month =        mar,
  year =         "1973",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356612.356614",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Baer:1973:SST,
  author =       "J. L. Baer",
  title =        "A Survey of Some Theoretical Aspects of
                 Multiprocessing",
  journal =      j-COMP-SURV,
  volume =       "5",
  number =       "1",
  pages =        "31--80",
  month =        mar,
  year =         "1973",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356612.356615",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:16:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rosenfeld:1973:PPP,
  author =       "Azriel Rosenfeld",
  title =        "Progress in Picture Processing: 1969--71",
  journal =      j-COMP-SURV,
  volume =       "5",
  number =       "2",
  pages =        "81--108",
  month =        jun,
  year =         "1973",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356616.356617",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:17:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pooch:1973:SIT,
  author =       "Udo W. Pooch and Al Nieder",
  title =        "A Survey of Indexing Techniques for Sparse Matrices",
  journal =      j-COMP-SURV,
  volume =       "5",
  number =       "2",
  pages =        "109--133",
  month =        jun,
  year =         "1973",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356616.356618",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:17:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{White:1973:SRC,
  author =       "William W. White",
  title =        "A Status Report on Computing Algorithms for
                 Mathematical Programming",
  journal =      j-COMP-SURV,
  volume =       "5",
  number =       "3",
  pages =        "135--166",
  month =        sep,
  year =         "1973",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356619.356620",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:17:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Couger:1973:EBS,
  author =       "J. Daniel Couger",
  title =        "Evolution of Business System Analysis Techniques",
  journal =      j-COMP-SURV,
  volume =       "5",
  number =       "3",
  pages =        "167--198",
  month =        sep,
  year =         "1973",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356619.356621",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:17:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Timmreck:1973:CSM,
  author =       "E. M. Timmreck",
  title =        "Computer Selection Methodology",
  journal =      j-COMP-SURV,
  volume =       "5",
  number =       "4",
  pages =        "200--222",
  month =        dec,
  year =         "1973",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356622.356623",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:17:30 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{BrinchHansen:1973:CPC,
  author =       "Per {Brinch Hansen}",
  title =        "Concurrent Programming Concepts",
  journal =      j-COMP-SURV,
  volume =       "5",
  number =       "4",
  pages =        "223--245",
  month =        dec,
  year =         "1973",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356622.356624",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:17:30 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sutherland:1974:CTH,
  author =       "Ivan E. Sutherland and Robert F. Sproull and Robert A.
                 Schumacker",
  title =        "A Characterization of Ten Hidden-Surface Algorithms",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "1",
  pages =        "1--55",
  month =        mar,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356625.356626",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:17:39 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.75.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  annote =       "A classic paper; describes all the major hidden
                 surface algorithms of the time, and gives a
                 classification scheme.",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "parallel processing; survey; visible surfaces",
}

@Article{Freeman:1974:CPL,
  author =       "Herbert Freeman",
  title =        "Computer Processing of Line-Drawing Images",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "1",
  pages =        "57--97",
  month =        mar,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356625.356627",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:17:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Aho:1974:LP,
  author =       "A. V. Aho and S. C. Johnson",
  title =        "{LR} Parsing",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "2",
  pages =        "99--124",
  month =        jun,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356628.356629",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:17:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "The LR syntax analysis method is a useful and
                 versatile technique for parsing deterministic
                 context-free languages in compiling applications. This
                 paper provides an informal exposition of LR parsing
                 techniques emphasizing the mechanical generation of
                 efficient LR parsers for context-free grammars.
                 Particular attention is given to extending the parser
                 generation techniques to apply to ambiguous grammars.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "ambiguous grammars; compilers; context-free languages;
                 grammars; LR grammars; parsers",
}

@Article{Pooch:1974:TDT,
  author =       "Udo W. Pooch",
  title =        "Translation of Decision Tables",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "2",
  pages =        "125--151",
  month =        jun,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356628.356630",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:17:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Pooch:1974:CTD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bobrow:1974:NPL,
  author =       "Daniel G. Bobrow and Bertram Raphael",
  title =        "New Programming Languages for Artificial Intelligence
                 Research",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "3",
  pages =        "153--174",
  month =        sep,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356631.356632",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:09 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Severance:1974:ISM,
  author =       "Dennis G. Severance",
  title =        "Identifier Search Mechanisms: a Survey and Generalized
                 Model",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "3",
  pages =        "175--194",
  month =        sep,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356631.356633",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:09 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  annote =       "Evaluation model is core memory oriented.",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nievergelt:1974:BST,
  author =       "J. Nievergelt",
  title =        "Binary Search Trees and File Organisation",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "3",
  pages =        "195--207",
  month =        sep,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356631.356634",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:09 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1974:GEO,
  author =       "Peter J. Denning",
  title =        "{Guest Editor}'s Overview \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "4",
  pages =        "209--211",
  month =        dec,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356635.356636",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Brown:1974:PDS,
  author =       "P. J. Brown",
  title =        "Programming and Documenting Software Projects",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "4",
  pages =        "213--220",
  month =        dec,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356635.356637",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yohe:1974:OPP,
  author =       "J. M. Yohe",
  title =        "An Overview of Programming Practices",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "4",
  pages =        "221--245",
  month =        dec,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356635.356638",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wirth:1974:CWS,
  author =       "Niklaus Wirth",
  title =        "On the Composition of Well-Structured Programs",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "4",
  pages =        "247--259",
  month =        dec,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356635.356639",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:24 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recently, the subject of programming methods,
                 generally applicable rules and patterns of development,
                 has received considerable attention. ``Structured
                 programming'' is the formulation of programs as
                 hierarchical, nested structures of statements and
                 objects of computation. The author gives brief examples
                 of structured programs, shows the essence of this
                 approach, discusses its relationship with program
                 verification, and comments on the role of structured
                 languages.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming; programming methods",
}

@Article{Knuth:1974:SPG,
  author =       "Donald E. Knuth",
  title =        "Structured Programming with {\tt go to} Statements",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "4",
  pages =        "261--301",
  month =        dec,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356635.356640",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:24 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Reprinted with revisions in {\sl Current Trends in
                 Programming Methodology}, Raymond T. Yeh, ed., {\bf 1}
                 (Englewood Cliffs, NJ: Prentice-Hall, 1977), 140--194;
                 {\sl Classics in Software Engineering}, Edward Nash
                 Yourdon, ed.\ (New York: Yourdon Press, 1979),
                 259--321. Reprinted with ``final'' revisions in
                 \cite[pp. 17--89]{Knuth:1992:LP}.",
  abstract =     "This study focuses largely on two issues: (a) improved
                 syntax for iterations and error exits, making it
                 possible to write a larger class of programs clearly
                 and efficiently without ``go to'' statements; (b) a
                 methodology of program design, beginning with readable
                 and correct, but possibly inefficient programs that are
                 systematically transformed in necessary into efficient
                 and correct, but possibly less readable code. The
                 discussion brings out opposing points of view about
                 whether or not ``go to'' statements should be
                 abolished; some merit is found on both sides of this
                 question. Finally, an attempt is made to define the
                 true nature of structured programming, and to recommend
                 fruitful directions for further study.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming; structured programming",
}

@Article{Kernighan:1974:PSE,
  author =       "Brian W. Kernighan and P. J. Plauger",
  title =        "Programming Style: {Examples} and Counterexamples",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "4",
  pages =        "303--319",
  month =        dec,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356635.356641",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:24 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This paper is a survey of some aspects of programming
                 style, primarily expression and structure, showing by
                 example what happens when principles of style are
                 violated, and what can be done to improve programs. The
                 examples are all taken verbatim from programming
                 textbooks.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming; programming methods,
                 control-flow structures; programming style; structured
                 programming",
}

@Article{Pooch:1974:CTD,
  author =       "Udo W. Pooch",
  title =        "Corrigendum: {``Translation of Decision Tables''}",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "4",
  pages =        "321--321",
  month =        dec,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356635.356642",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Pooch:1974:TDT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Organick:1975:EO,
  author =       "Elliott I. Organick",
  title =        "{Editor}'s Overview",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "1",
  pages =        "1--1",
  month =        mar,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356643.356644",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:53 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Maurer:1975:HTM,
  author =       "W. D. Maurer and T. G. Lewis",
  title =        "Hash Table Methods",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "1",
  pages =        "5--19",
  month =        mar,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356643.356645",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:53 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This is a survey of hash table methods, chiefly
                 intended for programmers and students of programming
                 who are encountering the subject for the first time.
                 The better-known methods of calculating hash addresses
                 and of handling collisions and bucket overflow are
                 presented and compared. It is shown that under certain
                 conditions we can guarantee that no two items belonging
                 to a certain class will have the same hash code, thus
                 providing an improvement over the usual notion of a
                 hash code as a randomizing technique. Several
                 alternatives to hashing are discussed, and suggestions
                 are made for further research and further
                 development.",
  acknowledgement = ack-nhfb,
  annote =       "Short review of key-to-address transformation,
                 collision handling, and other access techniques.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming",
}

@Article{Presser:1975:MC,
  author =       "Leon Presser",
  title =        "Multiprogramming Coordination",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "1",
  pages =        "21--44",
  month =        mar,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356643.356646",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:53 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Presser:1975:CMC}.",
  abstract =     "This paper commences with an overview of
                 multiprogrammed operating systems that uncovers an
                 architecture consisting of cooperating, but competing
                 processes working in parallel. This is followed by a
                 formal treatment of processes, and an analysis of the
                 fundamental coordination needs of concomitant
                 processes. The analysis leads to a set of two
                 coordination primitives originally defined by E. W.
                 Dijkstra. In the rest of the paper, an evolutionary
                 series of examples of increasing coordination
                 complexity is formulated and solved. As the various
                 examples are discussed, cumulative extensions to the
                 original set of coordination primitives are justified
                 and formally defined.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems programming",
}

@Article{Mooers:1975:CSC,
  author =       "Calvin N. Mooers",
  title =        "Computer Software and Copyright",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "1",
  pages =        "45--72",
  month =        mar,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356643.356647",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:18:53 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Boyse:1975:SMC,
  author =       "John W. Boyse and David R. Warn",
  title =        "A Straightforward Model for Computer Performance
                 Prediction",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "2",
  pages =        "73--93",
  month =        jun,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356648.356649",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:06 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Both simulation and analytic models of computer
                 systems can be very useful for predicting the
                 performance of proposed new systems or proposed changes
                 to existing systems. Many potential users of models are
                 reluctant to use them because of the complexity of many
                 such models. This tutorial paper leads the reader
                 through the development and use of an easily understood
                 analytic model. This is then placed in context with a
                 class of similar analytic models. In spite of the
                 simplicity of these models they have proved useful and
                 quite accurate in predicting performance (utilization,
                 throughput, and response) using only the most basic
                 system data as input. These parameters can either be
                 estimates or measurements from a running system. The
                 model equations and assumptions are defined, and a
                 detailed case study is presented as an example of their
                 use.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems, digital",
}

@Article{Cotton:1975:MMC,
  author =       "Ira W. Cotton",
  title =        "Microeconomics and the Market for Computer Services",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "2",
  pages =        "95--111",
  month =        jun,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356648.356650",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:06 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Huang:1975:APT,
  author =       "J. C. Huang",
  title =        "An Approach to Program Testing",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "3",
  pages =        "113--128",
  month =        sep,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356651.356652",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kimbleton:1975:CCN,
  author =       "Stephen R. Kimbleton and G. Michael Schneider",
  title =        "Computer Communication Networks: {Approaches},
                 Objectives, and Performance Considerations",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "3",
  pages =        "129--173",
  month =        sep,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356651.356653",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:13 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Effective network utilization requires an
                 understanding of network functional components and
                 their interactions. Describing these issues is the
                 objective of this paper. To do this, the three basic
                 network sharing alternatives are first identified. For
                 those two which involve host\slash host communication,
                 the basic traffic types are discussed. The
                 communications alternatives are then detailed and a
                 hypothesis is advanced that the ``packet-switched''
                 networks provide the most appropriate technology for
                 supporting multimodal traffic between hosts.
                 Consequently, a careful examination of the functional
                 components of the packet switch is provided. This
                 provides a basis for describing factors which must be
                 considered in implementing a packet-switched
                 subnetwork. Additional issues which should be
                 considered when several hosts and, perhaps, the
                 communications subnetwork are under the control of a
                 single administrative organization are then discussed.
                 The paper concludes with a description of three
                 networking examples and an identification of areas for
                 future research.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computers",
  xxnote =       "There is a page 173 in each of numbers 3 and 4 of
                 volume 4.",
}

@Article{Organick:1975:EPU,
  author =       "Elliott I. Organick",
  title =        "Editorial Policy Update",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "4",
  pages =        "173--173",
  month =        dec,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356654.356655",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  xxnote =       "There is a page 173 in each of numbers 3 and 4 of
                 volume 4.",
}

@Article{Patil:1975:GEN,
  author =       "Suhas S. Patil",
  title =        "{Guest Editor}'s Note \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "4",
  pages =        "175--175",
  month =        dec,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356654.356656",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Keller:1975:LAP,
  author =       "Robert M. Keller",
  title =        "Look-Ahead Processors",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "4",
  pages =        "177--195",
  month =        dec,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356654.356657",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:22 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Methods of achieving look-ahead in processing units
                 are discussed. An optimality criterion is proposed, and
                 several schemes are compared against the optimum under
                 varying assumptions. These schemes include existing and
                 proposed machine organizations, and theoretical
                 treatments not mentioned before in this context. The
                 problems of eliminating associative searches in the
                 processor control and the handling of loop-forming
                 decisions are also considered. The inherent limitations
                 of such processors are discussed. Finally, a number of
                 enhancements to look-ahead processors is qualitatively
                 surveyed.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer architecture; computer operating systems",
}

@Article{Anderson:1975:CIS,
  author =       "George A. Anderson and E. Douglas Jensen",
  title =        "Computer Interconnection Structures: {Taxonomy},
                 Characteristics, and Examples",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "4",
  pages =        "197--213",
  month =        dec,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356654.356658",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:22 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A taxonomy, or naming scheme, for systems of
                 interconnected computer is presented. It is an attempt
                 to provide an implementation-independent method by
                 which to identify designs, and a common context in
                 which to discuss them. The taxonomy is based on
                 interprocessor message handling and hardware
                 interconnection topology, and distinguishes ten basic
                 multiple-computer architectures. Various relevant
                 attributes are identified and discussed, and examples
                 of actual designs are given for each architecture.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer architecture",
}

@Article{Thurber:1975:APP,
  author =       "Kenneth J. Thurber and Leon D. Wald",
  title =        "Associative and Parallel Processors",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "4",
  pages =        "215--255",
  month =        dec,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356654.356659",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:22 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This tutorial survey of the area of parallel and
                 associative processors covers the main design tradeoffs
                 and major architectures of SIMD (Single Instruction
                 Stream Multiple Data Stream) systems. Summaries of
                 ILLIAC IV, STARAN, OMEN, and PEPE, the major SIMD
                 processors, are included.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer operating systems",
}

@Article{Organick:1975:EN,
  author =       "Elliott I. Organick",
  title =        "{Editor}'s Note",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "4",
  pages =        "257--257",
  month =        dec,
  year =         "1975",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356654.356660",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Presser:1975:CMC,
  author =       "Leon Presser",
  title =        "Corrigendum: {``Multiprogramming Coordination''}",
  journal =      j-COMP-SURV,
  volume =       "7",
  number =       "4",
  pages =        "257--257",
  month =        dec,
  year =         "1975",
  CODEN =        "CMSVAN",
  ISSN =         "0010-4892",
  bibdate =      "Thu Dec 28 16:51:57 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Presser:1975:MC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sibley:1976:GEI,
  author =       "E. H. Sibley",
  title =        "{Guest Editor}'s Introduction: {The} Development of
                 Data-Base Technology",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "1",
  pages =        "1--5",
  month =        mar,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356662.356663",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:43 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fry:1976:EDB,
  author =       "James P. Fry and Edgar H. Sibley",
  title =        "Evolution of Data-Base Management Systems",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "1",
  pages =        "7--42",
  month =        mar,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356662.356664",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:43 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The history and definitions common to data-base
                 technology are outlined. The objectives of data-base
                 management systems are given, important concepts
                 discussed, terminology defined and the development of
                 data-base systems methodology traced. An example is
                 presented along with trends and issues.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data base management; data processing",
}

@Article{Chamberlin:1976:RDB,
  author =       "Donald D. Chamberlin",
  title =        "Relational Data-Base Management Systems",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "1",
  pages =        "43--66",
  month =        mar,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356662.356665",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:43 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Reprinted in A. R. Hurson, L. L. Miller, and S. H.
                 Pakzad, Parallel Architectures for Database Systems,
                 IEEE Computer Society Press, Washington, DC, 1989.",
  abstract =     "The essential concepts of the relational data model
                 are defined, and normalization, relational languages
                 based on the model, as well as advantages and
                 implementations of relational systems are discussed.",
  acknowledgement = ack-nhfb,
  annote =       "Introductory paper.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data base management; data processing",
}

@Article{Taylor:1976:CDB,
  author =       "Robert W. Taylor and Randall L. Frank",
  title =        "{CODASYL} Data-Base Management Systems",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "1",
  pages =        "67--103",
  month =        mar,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356662.356666",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:43 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Presentation of the concepts, notation, and data-base
                 languages that were defined by the CODASYL Data
                 Description Language and Programming Language
                 Committees. Data structure diagram notation is
                 explained, and sample data-base definition is developed
                 along with several sample programs. Advanced features
                 of the languages are discussed, together with examples
                 of their use. An extensive bibliography is included.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data base management; data processing",
}

@Article{Tsichritzis:1976:HDB,
  author =       "D. C. Tsichritzis and F. H. Lochovsky",
  title =        "Hierarchical Data-Base Management: a Survey",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "1",
  pages =        "105--123",
  month =        mar,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356662.356667",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:43 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This survey discusses the facilities provided by
                 hierarchical data-base management systems. The systems
                 are based on the hierarchical data model which is
                 defined as a special case of the network data model.
                 Different methods used to access hierarchically
                 organized data are outlined. Constructs and examples of
                 programming languages are presented to illustrate the
                 features of hierarchical systems. This is followed by a
                 discussion of techniques for implementing such systems.
                 Finally, a brief comparison is made between the
                 hierarchical, the network, and the relational
                 systems.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data base management; data processing",
}

@Article{Michaels:1976:CRC,
  author =       "Ann S. Michaels and Benjamin Mittman and C. Robert
                 Carlson",
  title =        "A Comparison of the Relational and {CODASYL}
                 Approaches to Data-Base Management",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "1",
  pages =        "125--151",
  month =        mar,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356662.356668",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:19:43 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Data definition, manipulation, protection, and
                 independence, and system performance are important
                 factors when studying and evaluating data-base
                 management systems to be used in shared data-base
                 environments. The relational and CODASYL Data Base Task
                 Group approaches, which have been widely discussed and
                 debated, are compared and contrasted from these points
                 of view. It is concluded that since data-base
                 management systems are to serve the needs of widely
                 diverse communities of users, no single approach to
                 data-base management seems either desirable or likely
                 to emerge as dominant in the near future.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data base management; data processing",
}

@Article{Organick:1976:EO,
  author =       "Elliott I. Organick",
  title =        "Editorial Overview",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "2",
  pages =        "153--153",
  month =        jun,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356669.356670",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:05 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tanenbaum:1976:TA,
  author =       "Andrew S. Tanenbaum",
  title =        "A Tutorial on {Algol 68}",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "2",
  pages =        "155--190",
  month =        jun,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356669.356671",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:05 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Tanenbaum:1977:CTA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Marcotty:1976:SFD,
  author =       "Michael Marcotty and Henry F. Ledgard and Gregor V.
                 Bochmann",
  title =        "A Sampler of Formal Definitions",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "2",
  pages =        "191--276",
  month =        jun,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356669.356672",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:05 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Donahue:1977:SFC,Marcotty:1977:SFC,Marcotty:1977:CSF}.",
  abstract =     "Four well-known formal definition techniques are
                 presented: W-grammars, Production Systems with an
                 axiomatic approach to semantics, the Vienna Definition
                 Language, and Attribute Grammars. Each technique is
                 described tutorially and examples are given; then each
                 technique is applied to define the same small
                 programming language. These definitions provide a
                 usable basis for a critical discussion of the relative
                 clarity of the different methods. This leads to a
                 review of some of the debatable issues of formal
                 definition. Among these issues are the advantages, if
                 any, to the use of an underlying machine model, the
                 precise nature of a valid program, the relative merits
                 of generative and analytic definitions, and the place
                 of implementation-defined features in the definition.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming languages",
}

@Article{Reddi:1976:CFC,
  author =       "S. S. Reddi and E. A. Feustel",
  title =        "A Conceptual Framework for Computer Architecture",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "2",
  pages =        "277--300",
  month =        jun,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356669.356673",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:05 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yeh:1976:GEa,
  author =       "Raymond T. Yeh",
  title =        "Guest Editorial \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "3",
  pages =        "301--303",
  month =        sep,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356674.356675",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Special Issue on Reliable Software: Part I: Software
                 Validation",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fosdick:1976:DFA,
  author =       "Lloyd D. Fosdick and Leon J. Osterweil",
  title =        "Data Flow Analysis in Software Reliability",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "3",
  pages =        "305--330",
  month =        sep,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356674.356676",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:22 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The ways that the methods of data flow analysis can be
                 applied to improve software reliability are described.
                 There is also a review of the basic terminology from
                 graph theory and from data flow analysis in global
                 program optimization. The notation of regular
                 expressions is used to describe actions on data for
                 sets of paths. These expressions provide the basis of a
                 classification scheme for data flow which represents
                 patterns of data flow along paths within subprograms
                 and along paths which cross subprogram boundaries. Fast
                 algorithms, originally introduced for global
                 optimization, are described and it is shown how they
                 can be used to implement the classification scheme. It
                 is then shown how these same algorithms can also be
                 used to detect the presence of data flow anomalies
                 which are symptomatic of programming errors. Finally,
                 some characteristics of and experience with DAVE, a
                 data flow analysis system embodying some of these
                 ideas, are described.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming; computer software reliability;
                 data flow analysis",
}

@Article{Hantler:1976:IPC,
  author =       "Sidney L. Hantler and James C. King",
  title =        "An Introduction to Proving the Correctness of
                 Programs",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "3",
  pages =        "331--353",
  month =        sep,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356674.356677",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yeh:1976:GEb,
  author =       "Raymond T. Yeh",
  title =        "Guest Editorial \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "4",
  pages =        "355--357",
  month =        dec,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356678.356679",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:35 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Special Issue on Reliable Software: Part II:
                 Fault-Tolerant Software",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1976:FTO,
  author =       "Peter J. Denning",
  title =        "Fault Tolerant Operating Systems",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "4",
  pages =        "359--389",
  month =        dec,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356678.356680",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:35 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Levin:1977:SFA,Iliffe:1977:SFE,Dennis:1977:SFE,Denning:1977:SFE}.",
  abstract =     "Four related architectural principles are developed
                 which can guide the construction of error-tolerant
                 operating systems. The fundamental principle, system
                 closure, specifies that no action is permissible unless
                 explicitly authorized. The capability based machine is
                 the most efficient known embodiment of this principle.
                 System closure implies a second principle, resource
                 control, that prevents processes from exchanging
                 information via residual values left in physical
                 resource units. These two principles enable a third,
                 decision verification by failure-independent processes.
                 These principles enable prompt error detection and
                 cost-effective recovery. Implementations of these
                 principles are given for process management, interrupts
                 and traps, store access through capabilities, protected
                 procedure entry, and tagged architecture.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer operating systems; computer systems, digital
                 --- Fault Tolerant Capability",
}

@Article{Hecht:1976:FTS,
  author =       "H. Hecht",
  title =        "Fault-Tolerant Software for Real-Time Applications",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "4",
  pages =        "391--407",
  month =        dec,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356678.356681",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:35 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Redundancy in fault-tolerant software requires
                 programs that are deliberately different from the
                 original ones which they are intended to back up. Error
                 detection and rollback provisions must be as
                 independent as possible of the software segments which
                 they protect. The recovery block concept pioneered by
                 B. Randell meets these requirements. Skeleton routines
                 are presented that illustrate the application of the
                 recovery block to real-time programs, particularly
                 those dealing with navigation and attitude control. The
                 concept is seen to be compatible with certain ad hoc
                 fault-tolerance techniques that are currently employed.
                 A technique for reliability analysis of the resulting
                 software system is developed.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming; computer systems, digital ---
                 Fault Tolerant Capability",
}

@Article{Linden:1976:OSS,
  author =       "Theodore A. Linden",
  title =        "Operating System Structures to Support Security and
                 Reliable Software",
  journal =      j-COMP-SURV,
  volume =       "8",
  number =       "4",
  pages =        "409--445",
  month =        dec,
  year =         "1976",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356678.356682",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:35 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Iliffe:1977:SFE,Dennis:1977:SFE,Denning:1977:SFE}.",
  abstract =     "This survey focuses on two system structuring concepts
                 that support security: small protection domains and
                 extended-type objects. These two concepts are
                 especially promising because they also support reliable
                 software by encouraging and enforcing highly modular
                 software structures. Small protection domains allow
                 each subunit or module of a program to be executed in a
                 restricted environment that can prevent unanticipated
                 or undesirable actions by that module. Extended-type
                 objects provide a vehicle for data abstraction by
                 allowing objects of new types to be manipulated in
                 terms of operations that are natural for these objects.
                 This provides a way to extend system protection
                 features so that protection can be enforced in terms of
                 applications-oriented operations on objects. This
                 survey also explains one approach toward implementing
                 these concepts thoroughly and efficiently based on the
                 concept of capabilities incorporated into the
                 addressing structure of the computer.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer operating systems; data processing ---
                 Security of Data",
}

@Article{Feng:1977:GEO,
  author =       "Tse-Yun Feng",
  title =        "Guest Editorial: an Overview of Parallel Processors
                 and Processing",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356683.356684",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:54 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yau:1977:APA,
  author =       "S. S. Yau and H. S. Fung",
  title =        "Associative Processor Architecture --- a Survey",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "1",
  pages =        "3--27",
  month =        mar,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356683.356685",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:54 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A survey of the architecture of various associative
                 processors is presented with emphasis on their
                 characteristics, categorization, and implementation,
                 and especially on recent developments. Based on their
                 architecture, associative processors are classified
                 into four categories, namely fully parallel,
                 bit-serial, word-serial and block-oriented. The fully
                 parallel associative processors are divided into two
                 classes, word-organized and distributed logic
                 associative processors.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer architecture; computer operating systems",
}

@Article{Kuck:1977:SPM,
  author =       "David J. Kuck",
  title =        "A Survey of Parallel Machine Organization and
                 Programming",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "1",
  pages =        "29--59",
  month =        mar,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356683.356686",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:54 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Parallelism is defined in a broad sense, on the bit
                 level, operation level, and algorithm level. A number
                 of abstract and practical questions are discussed.
                 First, fast techniques for evaluating arithmetic
                 expressions and linear recurrences are treated. Next,
                 whole programs are discussed, and some experimental
                 results are presented. Finally, various aspects of
                 machine organization are discussed, including
                 processors, memories, and alignment networks.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems programming; computer systems,
                 digital",
}

@Article{Ramamoorthy:1977:PA,
  author =       "C. V. Ramamoorthy and H. F. Li",
  title =        "Pipeline Architecture",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "1",
  pages =        "61--102",
  month =        mar,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356683.356687",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:54 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Ramamoorthy:1978:CPA}.",
  abstract =     "This paper reviews the many theoretical considerations
                 and problems behind pipelining, surveying and comparing
                 various representative pipeline machines that operate
                 in either sequential or vector pipeline mode, the
                 practical solutions adopted, and the tradeoffs
                 involved. The performance of a simple pipe, the
                 physical speed limitation, and the control structures
                 for penalty-incurring events are analyzed separately.
                 The problems faced by the system designers are tackled,
                 including buffering, busing structure branching, and
                 interrupt handling. Aspects of sequential and vector
                 processing are studied. Fundamental advantages of
                 vector processing are unveiled, and additional
                 requirements (costs) are discussed to establish a
                 criterion for the tradeoff between sequential and
                 vector pipeline processing. Finally, two recent
                 machines (the Cray-1 and the Amdahl 470 V/6 systems)
                 are presented to demonstrate how complex pipeline
                 techniques can be used and how simple but advantageous
                 pipeline concepts can be exploited.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer architecture",
}

@Article{Enslow:1977:MOS,
  author =       "Philip H. {Enslow, Jr.}",
  title =        "Multiprocessor Organization --- a Survey",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "1",
  pages =        "103--129",
  month =        mar,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356683.356688",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:20:54 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Multiprocessors are defined as a subclass of MIMD
                 (Multiple Instruction Stream, Multiple Data Stream)
                 multiple-computer systems in which the processors have
                 common access to primary memory and the input\slash
                 output channels and there is a single operating system
                 controlling the entire complex. It is possible to
                 characterize the hardware organization by the nature of
                 the system utilized to interconnect the primary
                 functional units --- processors, memory, and
                 input\slash output channels. The three basic
                 interconnection systems discussed are: (1) time-shared
                 buses; (2) crossbar switch matrix; and (3) multibus,
                 multiport memories. Three organizations for
                 multiprocessor operating systems are also discussed:
                 (1) master-slave; (2) separate executive for each
                 processor; and (3) symmetric treatment of all
                 processors.",
  acknowledgement = ack-nhfb,
  classification = "722",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems, digital",
}

@Article{Denning:1977:ATIa,
  author =       "Peter J. Denning",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "2",
  pages =        "131--131",
  month =        jun,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356689.356690",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1977:EP,
  author =       "Peter J. Denning",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "2",
  pages =        "133--135",
  month =        jun,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356689.356691",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sedgewick:1977:PGM,
  author =       "Robert Sedgewick",
  title =        "Permutation Generation Methods",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "2",
  pages =        "137--164",
  month =        jun,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356689.356692",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Sedgewick:1977:CPG,Parsons:1977:SFF,MacCallum:1977:SFF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Levin:1977:SFA,
  author =       "Roy Levin and Peter J. Denning",
  title =        "Surveyor's Forum: an Amplification on {Hydra}'s
                 Capabilities",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "2",
  pages =        "165--165",
  month =        jun,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356689.356693",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Denning:1976:FTO}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Donahue:1977:SFC,
  author =       "James Donahue",
  title =        "Surveyor's Forum: a Criticism of Sampler",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "2",
  pages =        "166--167",
  month =        jun,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356689.356695",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Marcotty:1976:SFD,Marcotty:1977:SFC,Marcotty:1977:CSF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Marcotty:1977:SFC,
  author =       "Michael Marcotty and Henry F. Ledgard",
  title =        "Surveyor's Forum: a Criticism of Sampler",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "2",
  pages =        "167--168",
  month =        jun,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356689.356696",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Marcotty:1976:SFD,Donahue:1977:SFC,Marcotty:1977:CSF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Marcotty:1977:CSF,
  author =       "Michael Marcotty and Henry F. Ledgard and Gregor V.
                 Bochmann",
  title =        "Corrigendum: {``A Sampler of Formal Definitions''}",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "2",
  pages =        "168--168",
  month =        jun,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356689.356697",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Marcotty:1976:SFD,Donahue:1977:SFC,Marcotty:1977:SFC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1977:ATIb,
  author =       "Peter J. Denning",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "3",
  pages =        "171--172",
  month =        sep,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356698.356699",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:35 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gonzalez:1977:DPS,
  author =       "Mario J. {Gonzalez, Jr.}",
  title =        "Deterministic Processor Scheduling",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "3",
  pages =        "173--204",
  month =        sep,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356698.356700",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:35 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The deterministic scheduling of jobs in uniprocessor,
                 multiprocessor, and job-shop environments is surveyed.
                 The survey begins with a brief introduction to the
                 representation of task or job sets, followed by a
                 discussion of classification categories. These
                 categories include number of processors, task
                 interruptibility, job periodicity, deadlines, and
                 number of resources. Results are given for
                 single-processor schedules in job-shop and
                 multiprogramming environments, flow-shop schedules, and
                 multiprocessor schedules. They are stated in terms of
                 optimal constructive algorithms and suboptimal
                 heuristics. In most cases the latter are stated in
                 terms of performance bounds related to optimal results.
                 Annotations for most of the references are provided in
                 the form of a table classifying the referenced studies
                 in terms of various parameters. 54 refs.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems programming",
}

@Article{Lipsky:1977:AQN,
  author =       "Lester Lipsky and J. D. Church",
  title =        "Applications of a Queueing Network Model for a
                 Computer System",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "3",
  pages =        "205--221",
  month =        sep,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356698.356701",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:35 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Phister:1978:SFP,Lipsky:1978:SFP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Peterson:1977:PN,
  author =       "James L. Peterson",
  title =        "{Petri} Nets",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "3",
  pages =        "223--252",
  month =        sep,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356698.356702",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:35 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Genrich:1978:SFN,Peterson:1978:SFN}.",
  abstract =     "The basic concepts and uses of Petri nets are
                 surveyed. The structure of Petri nets, their markings
                 and execution, several examples of Petri net models of
                 computer hardware and software, and research into the
                 analysis of Petri nets are presented, as are the use of
                 the reachability tree and the decidability and
                 complexity of some Petri net problems. Petri net
                 languages, models of computation related to Petri nets,
                 and some extensions and subclasses of the Petri net
                 model are also briefly discussed.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer metatheory",
}

@Article{Iliffe:1977:SFE,
  author =       "J. K. Iliffe",
  title =        "Surveyor's Forum: an Error Recovery",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "3",
  pages =        "253--254",
  month =        sep,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356698.356703",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:35 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Denning:1976:FTO,Linden:1976:OSS,Dennis:1977:SFE,Denning:1977:SFE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dennis:1977:SFE,
  author =       "Jack B. Dennis",
  title =        "Surveyor's Forum: An Error Recovery",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "3",
  pages =        "254--254",
  month =        sep,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356698.356704",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:35 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Denning:1976:FTO,Linden:1976:OSS,Iliffe:1977:SFE,Denning:1977:SFE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1977:SFE,
  author =       "Peter J. Denning",
  title =        "Surveyor's Forum: an Error Recovery",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "3",
  pages =        "254--255",
  month =        sep,
  year =         "1977",
  CODEN =        "CMSVAN",
  ISSN =         "0010-4892",
  bibdate =      "Fri Sep 30 00:28:11 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Denning:1976:FTO,Linden:1976:OSS,Iliffe:1977:SFE,Dennis:1977:SFE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tanenbaum:1977:CTA,
  author =       "Andrew S. Tanenbaum",
  title =        "Corrigenda: {``A Tutorial on Algol 68''}",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "3",
  pages =        "255--256",
  month =        sep,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356698.356706",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:21:35 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Tanenbaum:1976:TA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1977:AIL,
  author =       "Peter J. Denning",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "4",
  pages =        "257--257",
  month =        dec,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356707.356708",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Severance:1977:PAS,
  author =       "D. G. Severance and J. V. Carlis",
  title =        "A Practical Approach to Selecting Record Access
                 Paths",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "4",
  pages =        "259--272",
  month =        dec,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356707.356709",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:04 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The process of selecting an efficient data-base design
                 is considered. It is suggested that all record storage
                 and retrieval structures of practical interest are
                 motivated by the accessing characteristics of secondary
                 storage. This architecture of secondary memory is
                 therefore analyzed in some detail. Three classes of
                 data retrieval problems are identified, and alternative
                 file structures and record search algorithms for these
                 problems are analyzed and compared. Finally, a method
                 for constructing reasonable database organizations is
                 presented: it is shown that through a series of design
                 decisions based upon application priorities, types of
                 retrieval, speed of response, and intensity of update,
                 it is possible to gather general specifications quickly
                 for a simple and efficient database organization.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data base systems",
}

@Article{Taggart:1977:SIR,
  author =       "William M. {Taggart, Jr.} and Marvin O. Tharp",
  title =        "A Survey of Information Requirements Analysis
                 Techniques",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "4",
  pages =        "273--290",
  month =        dec,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356707.356710",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:04 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This survey covers a variety of approaches to the
                 determination of information needs suggested during the
                 past decade. The presentation has two objectives: (1)
                 to review available information analysis methods with a
                 detailed look at several approaches; and (2) to suggest
                 research directions to improve the usefulness of these
                 methods.",
  acknowledgement = ack-nhfb,
  classification = "901; 912",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "information science; management science",
}

@Article{Weide:1977:SAT,
  author =       "Bruce Weide",
  title =        "A Survey of Analysis Techniques for Discrete
                 Algorithms",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "4",
  pages =        "291--313",
  month =        dec,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356707.356711",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Gaschnig:1978:SFE,Weide:1978:SFE,Bender:1979:SFR,Weide:1979:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sedgewick:1977:CPG,
  author =       "Robert Sedgewick",
  title =        "Corrigenda: {``Permutation Generation Methods''}",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "4",
  pages =        "314--314",
  month =        dec,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356707.356712",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Sedgewick:1977:PGM,Parsons:1977:SFF,MacCallum:1977:SFF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Parsons:1977:SFF,
  author =       "Thomas W. Parsons",
  title =        "Surveyor's Forum: a Forgotten Generation of
                 Permutations",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "4",
  pages =        "315--315",
  month =        dec,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356707.356713",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Sedgewick:1977:PGM,Sedgewick:1977:CPG,MacCallum:1977:SFF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{MacCallum:1977:SFF,
  author =       "I. R. MacCallum",
  title =        "Surveyor's Forum: a Forgotten Generation of
                 Permutations",
  journal =      j-COMP-SURV,
  volume =       "9",
  number =       "4",
  pages =        "316--317",
  month =        dec,
  year =         "1977",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356707.356714",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Sedgewick:1977:PGM,Sedgewick:1977:CPG,Parsons:1977:SFF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1978:ATIa,
  author =       "Peter J. Denning",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356715.356716",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fitzsimmons:1978:RES,
  author =       "Ann Fitzsimmons and Tom Love",
  title =        "A Review and Evaluation of Software Science",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "1",
  pages =        "3--18",
  month =        mar,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356715.356717",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:22 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Moranda:1978:SFS,Baker:1978:SFS,Fitzsimmons:1978:SFS,Fenichel:1979:SFH,Zweben:1979:SFH}.",
  abstract =     "Review of the theory, called ``Software science'' and
                 the evidence supporting it. A brief description of a
                 related theory, called ``software physics'', is
                 included.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming; software science",
}

@Article{King:1978:CBA,
  author =       "John Leslie King and Edward L. Schrems",
  title =        "Cost-Benefit Analysis in Information Systems
                 Development and Operation",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "1",
  pages =        "19--34",
  month =        mar,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356715.356718",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:22 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Introduction and review of elements of cost-benefit
                 analysis as applied to computerized information
                 systems, and discussion of the major problems to be
                 avoided.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data processing; information science --- Information
                 Use",
}

@Article{Sandewall:1978:PIE,
  author =       "Erik Sandewall",
  title =        "Programming in an Interactive Environment: the ``{{\sc
                 Lisp}}'' Experience",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "1",
  pages =        "35--71",
  month =        mar,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356715.356719",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:22 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Stallman:1978:SFS,Sandewall:1978:SFS}.",
  abstract =     "LISP systems have been used for highly interactive
                 programming for more than a decade. During that time,
                 special properties of the LISP language (such as
                 program\slash data equivalence) have enabled a certain
                 style of interactive programming to develop,
                 characterized by powerful interactive support for the
                 programmer, nonstandard program structures, and
                 nonstandard program development methods. A summary is
                 given of the LISP style of interactive programming for
                 readers outside the LISP community, describes those
                 properties of LISP systems that were essential for the
                 development of this style, and discusses some current
                 and not yet resolved issues.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming",
}

@Article{Srodawa:1978:PEM,
  author =       "Ronald J. Srodawa",
  title =        "Positive Experiences with a Multiprocessing System",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "1",
  pages =        "73--82",
  month =        mar,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356715.356720",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Phister:1978:SFP,
  author =       "Montgomery {Phister, Jr.}",
  title =        "Surveyor's Forum: {Putting} Costs Through
                 Effectively",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "1",
  pages =        "83--83",
  month =        mar,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356715.356721",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Lipsky:1977:AQN,Lipsky:1978:SFP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lipsky:1978:SFP,
  author =       "Lester Lipsky and James D. Church",
  title =        "Surveyor's Forum: {Putting} Costs Through Effectively:
                 {Author}'s Reply",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "1",
  pages =        "83--84",
  month =        mar,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356715.356722",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Lipsky:1977:AQN,Phister:1978:SFP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Genrich:1978:SFN,
  author =       "H. J. Genrich and P. S. Thiagarajan",
  title =        "Surveyor's Forum: {Net} Progress",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "1",
  pages =        "84--85",
  month =        mar,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356715.356723",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Peterson:1977:PN,Peterson:1978:SFN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Peterson:1978:SFN,
  author =       "James Peterson",
  title =        "Surveyor's Forum: {Net} Progress: {Author}'s Reply",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "1",
  pages =        "85--85",
  month =        mar,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356715.356724",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Peterson:1977:PN,Genrich:1978:SFN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1978:ATIb,
  author =       "Peter J. Denning",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "2",
  pages =        "87--87",
  month =        jun,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356725.356726",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1978:EP,
  author =       "Peter J. Denning",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "2",
  pages =        "89--92",
  month =        jun,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356725.356727",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Davis:1978:SBU,
  author =       "N. C. Davis and S. E. Goodman",
  title =        "The {Soviet Bloc}'s Unified System of Computers",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "2",
  pages =        "93--122",
  month =        jun,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356725.356728",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:52 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "During the past ten years the Soviet Bloc has
                 designed, developed, and put into production a series
                 of upward-compatible third-generation computers known
                 as the Unified System or Ryad. This family is
                 effectively a reverse engineering of the IBM S/360
                 system. Although backward by current Western and
                 Japanese standards, the Unified System is of
                 considerable technological, political, and economic
                 importance. A comprehensive survey and analysis of the
                 Ryad project is presented.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems, digital",
}

@Article{Randell:1978:RIC,
  author =       "B. Randell and P. A. Lee and P. C. Treleaven",
  title =        "Reliability Issues in Computing System Design",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "2",
  pages =        "123--165",
  month =        jun,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356725.356729",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:52 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The various problems involved in achieving very high
                 reliability from complex computing systems are
                 surveyed, and the relationship between system
                 structuring techniques and techniques of fault
                 tolerance are discussed. Topics covered include: (1)
                 protective redundancy in hardware and software; (2) the
                 use of atomic actions to structure the activity of a
                 system to limit information flow; (3) error detection
                 techniques; (4) strategies for locating and dealing
                 with faults and for assessing the damage they have
                 caused; and (5) forward and backward error recovery
                 techniques, based on the concepts of recovery line,
                 commitment, exception, and compensation. Three specific
                 systems the JPL-STARt, the Bell Laboratories ESS No. 1A
                 processor, and the PLURIBUS are described in detail and
                 compared.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming --- Reliability; computer
                 systems, digital",
}

@Article{Verhofstad:1978:RTD,
  author =       "Joost S. M. Verhofstad",
  title =        "Recovery Techniques for Database Systems",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "2",
  pages =        "167--195",
  month =        jun,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356725.356730",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:52 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A survey of techniques and tools used in filing
                 systems, database systems, and operating systems for
                 recovery, backing out, restart, the maintenance of
                 consistency, and for the provision of crash resistance
                 is given. A particular view on the use of recovery
                 technique in a database system and a categorization of
                 different kinds of recovery and recovery techniques and
                 basic principles are presented. The purposes for which
                 these recovery techniques can be used are described.
                 Each recovery technique is illustrated by examples of
                 its application in existing systems described in the
                 literature.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data base systems, dblit reliability recovery db",
}

@Article{Zelkowitz:1978:PSE,
  author =       "Marvin V. Zelkowitz",
  title =        "Perspectives in Software Engineering",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "2",
  pages =        "197--216",
  month =        jun,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356725.356731",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Wendel:1979:SFR,Zelkowitz:1979:SFR,Alberts:1979:SFQ,Zelkowitz:1979:SFQ}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Relles:1978:SFD,
  author =       "Nathan Relles",
  title =        "Surveyor's Forum: {Devising} the Rhetoric of
                 Rhetorical Devices",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "2",
  pages =        "217--217",
  month =        jun,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356725.356732",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:22:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Graham:1978:GEO,
  author =       "G. Scott Graham",
  title =        "{Guest Editor}'s Overview\ldots Queuing Network Models
                 of Computer System Performance",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "3",
  pages =        "219--224",
  month =        sep,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356733.356734",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:13 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  annote =       "Special Issue: Queuing Network Models of Computer
                 System Performance",
  descriptors =  "Queueing Network; Performance Evaluation; computer
                 performance",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1978:OAQ,
  author =       "Peter J. Denning and Jeffrey P. Buzen",
  title =        "The Operational Analysis of Queueing Network Models",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "3",
  pages =        "225--261",
  month =        sep,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356733.356735",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:13 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Bard:1979:SFS,Buzen:1979:SFS}.",
  abstract =     "Queueing network models have proved to be cost
                 effective tools for analyzing modern computer systems.
                 This tutorial paper presents basic results using the
                 operational approach, a framework which allows the
                 analyst to test whether each assumption is met in a
                 given system. The nature of queueing network models and
                 their applications for calculating and prediction
                 performance quantities are described. The basic
                 performance quantities --- such as utilizations, mean
                 queue lengths, and mean response times --- are defined,
                 and operational relationships among them are derived.
                 Following this, the concept of job flow balance is
                 introduced and used to study asymptotic throughputs and
                 response times. The concepts of state transition
                 balance, one-step behavior, and homogeneity are then
                 used to relate the proportions of time that each system
                 state is occupied to the parameters of job demand and
                 to device characteristics. Efficient methods for
                 computing basic performance quantities are also
                 described. Finally the concept of decomposition is used
                 to simplify analyses by replacing subsystems with
                 equivalent devices.",
  acknowledgement = ack-nhfb,
  annote =       "The early sections describe the nature of queueing
                 network models and their applications for calculating
                 and predicting performance quantities. The basic
                 performance quantities- such as utilizations, mean
                 queue lengths, and mean response times- are defined and
                 operational relationships among them are derived.
                 Following this, the concept of job flow balance is
                 introduced and used to study asymptotic throughputs and
                 response times.",
  classification = "722; 723",
  country =      "USA",
  date =         "10/12/79",
  descriptors =  "Survey; reference; Queueing network; operational
                 analysis",
  enum =         "757",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems, digital; queueing networks",
  language =     "English",
  references =   "72",
}

@Article{Rose:1978:MPQ,
  author =       "Clifford A. Rose",
  title =        "A Measurement Procedure for Queueing Network Models of
                 Computer Systems",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "3",
  pages =        "263--280",
  month =        sep,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356733.356736",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:13 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A procedure is described for obtaining input parameter
                 values and output performance measures for a popular
                 class of queueing network models. The procedure makes
                 use of current measurement monitors as much as
                 possible. The two basic approaches to monitoring
                 computer systems (event trace and sampling) and the
                 three types of monitors (hardware, software, and
                 hybrid) are surveyed. Also surveyed are measurement
                 tools for the analytical modeling of several current
                 families of computer systems. Examples of model
                 validations and performance predictions are discussed
                 in detail to illustrate the measurement procedures and
                 the class of models.",
  acknowledgement = ack-nhfb,
  annote =       "(VBI-000913)",
  classification = "722; 723",
  country =      "USA",
  date =         "01/07/93",
  descriptors =  "Queueing network",
  enum =         "11044",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems, digital; queueing network models",
  language =     "English",
  references =   "0",
}

@Article{Chandy:1978:AMA,
  author =       "K. Mani Chandy and Charles H. Sauer",
  title =        "Approximate Methods for Analyzing Queueing Network
                 Models of Computing Systems",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "3",
  pages =        "281--317",
  month =        sep,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356733.356737",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:13 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The two primary issues in choosing a computing system
                 model are credibility of the model and cost of
                 developing and solving the model. It is the contention
                 of this paper that queueing network models with
                 credible assumptions can be solved approximately to
                 provide credible performance estimates at low cost.
                 This contention is supported by examples of approximate
                 solutions of queueing at low cost. This contention is
                 supported by examples of approximate solutions of
                 queueing network models. Two major approaches to
                 approximate solution, aggregation (decomposition) and
                 diffusion, are discussed.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems, digital; queueing network models",
}

@Article{Buzen:1978:QNM,
  author =       "Jeffrey P. Buzen",
  title =        "A Queueing Network Model of {MVS}",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "3",
  pages =        "319--331",
  month =        sep,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356733.356738",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:13 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The major resource allocation mechanisms used by the
                 MVS operating system are described, and a queueing
                 network model that represents these mechanisms is
                 presented. The model incorporates a number of
                 refinements that have not been reported previously: the
                 use of shared domains, the explicit representation of
                 separate queues for each domain, and the treatment of
                 domain migration.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer operating systems; queueing network models",
}

@Article{Bard:1978:VPP,
  author =       "Y. Bard",
  title =        "The {VM\slash 370} Performance Predictor",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "3",
  pages =        "333--342",
  month =        sep,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356733.356739",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:13 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1978.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A tool for helping system engineers configure VM\slash
                 370 systems is described. It consists of a data
                 reduction package that produces a workload
                 characterization from VM\slash 370 Monitor data, and an
                 analytic model that accepts the workload
                 characterization as an input, and provides estimated
                 performance measures as outputs. The tool is easy to
                 use and routinely achieves accuracy levels within 5
                 percent for utilizations and 30 percent for response
                 times.",
  acknowledgement = ack-nhfb,
  annote =       "(VBI-000916)",
  classification = "722; 723",
  country =      "USA",
  date =         "01/07/93",
  descriptors =  "PERFORMANCE PREDICTION",
  enum =         "9228",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems, digital",
  language =     "English",
  references =   "0",
}

@Article{Wong:1978:QNM,
  author =       "J. W. Wong",
  title =        "Queueing Network Modeling of Computer Communication
                 Networks",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "3",
  pages =        "343--351",
  month =        sep,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356733.356740",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:13 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The application of queueing network models to the
                 performance analysis of message-switched (or
                 packet-switched) communication networks is surveyed.
                 The main topics covered are the analysis of end-to-end
                 delay and the analysis of buffer management schemes. A
                 brief discussion on flow control is also included. A
                 queueing network model is developed for a simple
                 user-resource network. The mean response time of a host
                 computer in this network is illustrated by a numerical
                 example.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer networks; queueing network models",
}

@Article{Muntz:1978:QNC,
  author =       "Richard R. Muntz",
  title =        "Queueing Networks: a Critique of the State of the Art
                 and Directions for the Future",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "3",
  pages =        "353--359",
  month =        sep,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356733.356741",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Buzen:1979:SFP,Muntz:1979:SFP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gaschnig:1978:SFE,
  author =       "John Gaschnig",
  title =        "Surveyor's Forum: {Experimental} Analysis Discretely
                 Done",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "3",
  pages =        "361--361",
  month =        sep,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356733.356742",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Weide:1977:SAT,Weide:1978:SFE,Bender:1979:SFR,Weide:1979:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Weide:1978:SFE,
  author =       "Bruce W. Weide",
  title =        "Surveyor's Forum: {Experimental} Analysis Discretely
                 Done: {Author}'s Reply",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "3",
  pages =        "361--362",
  month =        sep,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356733.356743",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Weide:1977:SAT,Gaschnig:1978:SFE,Bender:1979:SFR,Weide:1979:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1978:ATIc,
  author =       "Peter J. Denning",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "363--364",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356745",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Special Issue: Graphics Standards",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Newman:1978:RET,
  author =       "William M. Newman and Andries van Dam",
  title =        "Recent Efforts Towards Graphics Standardization",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "365--380",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356746",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "standards",
}

@Article{Michener:1978:FOC,
  author =       "James C. Michener and Andries {van Dam}",
  title =        "Functional Overview of the {Core System} with
                 Glossary",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "381--387",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356747",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Core System was developed by the ACM\slash
                 SIGGRAPH Graphics Standards Planning Committee to
                 promote application program portability and
                 device-independence. The Core System defines graphics
                 software capabilities that support a wide variety of
                 applications. The functional capabilities of the Core
                 System are summarized. Grouping of functions into
                 levels of implementation is motivated and described. A
                 glossary is given of terms that are used in this
                 article and the companion articles on the Core System
                 in this issue.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer graphics; computer programming, Core;
                 standards",
}

@Article{Bergeron:1978:GPU,
  author =       "R. Daniel Bergeron and Peter R. Bono and James D.
                 Foley",
  title =        "Graphics Programming Using the {Core System}",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "389--443",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356748",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.78.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Ths principal concepts of interactive graphics
                 programming using the Core Graphics System are
                 presented. The Core System is a subroutine package
                 which provides with extensive examples facilities for
                 creating arbitrary views of two-and three-dimensional
                 objects and for supporting interaction between the
                 application program and its user.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming; Core; standards, computer
                 graphics",
}

@Article{Michener:1978:SMI,
  author =       "James C. Michener and James D. Foley",
  title =        "Some Major Issues in the Design of the {Core Graphics
                 System}",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "445--463",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356749",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Graphics/imager/imager.78.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Design issues of the Core System, a proposed standard
                 graphics programming system, are presented. Alternative
                 resolutions for each issue are set forth, together with
                 their motivating arguments. In each case, the
                 alternative that was selected is made clear. The issues
                 presented here were chosen because they must be
                 considered in the design of any interactive graphics
                 package and because they help in understanding the
                 design of the Core System.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming; Core; standards, computer
                 graphics",
}

@Article{Carlbom:1978:PGP,
  author =       "Ingrid Carlbom and Joseph Paciorek",
  title =        "Planar Geometric Projections and Viewing
                 Transformations",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "465--502",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356750",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Christiaen:1979:SFP,Carlbom:1979:SFP,Carlbom:1979:CGP}.",
  abstract =     "In computer graphics one is often concerned with
                 representing three-dimensional objects on a
                 two-dimensional display surface. The choice of such a
                 representation depends on several factors, including
                 the purpose for which the representation is intended,
                 the visual effects that are desired, and the shape of
                 the object. This paper describes how two-dimensional
                 views can be obtained using planar geometric
                 projections such as perspective and parallel
                 projections. It discusses how these projections can be
                 generated from a three-dimensional representation of an
                 object in a manner suitable for computer graphics
                 systems. In particular, it shows how these projections
                 can be generated using the viewing transformations of
                 the Core Graphics System. The factors that affect the
                 choice of projection are also discussed, and some
                 guidelines for making such a choice are given.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer graphics",
}

@Article{Moranda:1978:SFS,
  author =       "Paul B. Moranda",
  title =        "Surveyor's Forum: {Is} Software Science Hard?",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "503--504",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356751",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Fitzsimmons:1978:RES,Baker:1978:SFS,Fitzsimmons:1978:SFS,Fenichel:1979:SFH,Zweben:1979:SFH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Baker:1978:SFS,
  author =       "T. P. Baker",
  title =        "Surveyor's Forum: {Is} Software Science Hard?",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "504--504",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356752",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Fitzsimmons:1978:RES,Moranda:1978:SFS,Fitzsimmons:1978:SFS,Fenichel:1979:SFH,Zweben:1979:SFH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fitzsimmons:1978:SFS,
  author =       "Ann Fitzsimmons and Tom Love",
  title =        "Surveyor's Forum: {Is} Software Science Hard?",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "504--505",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356753",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Fitzsimmons:1978:RES,Moranda:1978:SFS,Baker:1978:SFS,Fenichel:1979:SFH,Zweben:1979:SFH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Stallman:1978:SFS,
  author =       "Richard M. Stallman",
  title =        "Surveyor's Forum: {Structured} Editing with a {Lisp}",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "505--507",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356754",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Sandewall:1978:PIE,Sandewall:1978:SFS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sandewall:1978:SFS,
  author =       "Erik Sandewall",
  title =        "Surveyor's Forum: {Structured} Editing with a {{\sc
                 Lisp}}",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "507--508",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356755",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Sandewall:1978:PIE,Stallman:1978:SFS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ramamoorthy:1978:CPA,
  author =       "C. V. Ramamoorthy and H. F. Li",
  title =        "Corrigenda: {``Pipeline Architecture''}",
  journal =      j-COMP-SURV,
  volume =       "10",
  number =       "4",
  pages =        "508--508",
  month =        dec,
  year =         "1978",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356744.356756",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:23:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Ramamoorthy:1977:PA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1979:AIL,
  author =       "Peter J. Denning",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "1--1",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356758",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bernard:1979:MIC,
  author =       "Dan Bernard",
  title =        "Management Issues in Cooperative Computing",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "3--17",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356759",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Badler:1979:DRH,
  author =       "Norman I. Badler and Stephen W. Smoliar",
  title =        "Digital Representations of Human Movement",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "19--38",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356760",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Buck-Lew:1979:SFD}.",
  abstract =     "The general issue of movement representation is
                 approached from two point of view: notation systems
                 designed for recording movement and animation systems
                 designed for the display of movement. The
                 interpretation of one particular notation system,
                 Labanotation, is examined to extract a set of
                 ``primitive movement concepts'' which can be used to
                 animate a realistic human body on a graphics display.
                 The body is represented computationally as a network of
                 special-purpose processors --- one processor situated
                 at each joint of the body --- each with an instruction
                 set designed around the movement concepts derived from
                 Labanotation. Movement is achieved by simulating the
                 behavior of these processors as they interpret their
                 respective programs.",
  acknowledgement = ack-nhfb,
  classification = "461; 723; 901",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer graphics; human engineering; kinesiology;
                 Labanotation, Applications",
}

@Article{Dasgupta:1979:OMS,
  author =       "Subrata Dasgupta",
  title =        "The Organization of Microprogram Stores",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "39--65",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356761",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A central issued in microprogramming is the
                 organization of the control store, the memory from
                 which a microprogram is executed. The structure of this
                 store has a major influence on the economy (in both
                 time and memory space) of the target machine
                 implementation, on the overall complexity of the host
                 machine organization, and on its microprogrammability.
                 Some aspects of control store architectures are
                 surveyed, including the organization of
                 microinstruction words, and the effects of different
                 timing schemes on the complexity of both control store
                 and host machine organizations. Some recent algorithms
                 for optimizing the width and length of control stores
                 are reviewed.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer architecture",
}

@Article{Bender:1979:SFR,
  author =       "Edward A. Bender",
  title =        "Surveyor's Forum: a Recurrent Problem",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "67--68",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356762",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Weide:1977:SAT,Weide:1978:SFE,Weide:1979:SFR,Gaschnig:1978:SFE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Weide:1979:SFR,
  author =       "Bruce W. Weide",
  title =        "Surveyor's Forum: a Recurrent Problem",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "68--68",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356763",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Weide:1977:SAT,Weide:1978:SFE,Gaschnig:1978:SFE,Bender:1979:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wendel:1979:SFR,
  author =       "Irving K. Wendel",
  title =        "Surveyor's Forum: {The} Real Costs of Software",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "68--68",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356764",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Zelkowitz:1978:PSE,Zelkowitz:1979:SFR,Alberts:1979:SFQ,Zelkowitz:1979:SFQ}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zelkowitz:1979:SFR,
  author =       "Marvin Zelkowitz",
  title =        "Surveyor's Forum: {The} Real Costs of Software",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "69--69",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356765",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Zelkowitz:1978:PSE,Wendel:1979:SFR,Alberts:1979:SFQ,Zelkowitz:1979:SFQ}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bard:1979:SFS,
  author =       "Yonathan Bard",
  title =        "Surveyor's Forum: {Stochastic} or Operational?",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "69--70",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356766",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Denning:1978:OAQ,Buzen:1979:SFS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Buzen:1979:SFS,
  author =       "Jeffrey P. Buzen and Peter J. Denning",
  title =        "Surveyor's Forum: {Stochastic} or Operational?",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "70--70",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356767",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Denning:1978:OAQ,Bard:1979:SFS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Buzen:1979:SFP,
  author =       "Jeffrey P. Buzen",
  title =        "Surveyor's Forum: a Predictable Problem",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "71--72",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356768",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Muntz:1978:QNC,Muntz:1979:SFP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1979:SFP,
  author =       "Richard R. Muntz",
  title =        "Surveyor's Forum: a Predictable Problem",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "1",
  pages =        "72--72",
  month =        mar,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356757.356769",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Muntz:1978:QNC,Buzen:1979:SFP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1979:AILa,
  author =       "Adele Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "2",
  pages =        "73--74",
  month =        jun,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356770.356771",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:49 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1979:EP,
  author =       "Adele Goldberg",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "2",
  pages =        "75--78",
  month =        jun,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356770.356772",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:49 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cohen:1979:NDA,
  author =       "Jacques Cohen",
  title =        "Non-De\-ter\-min\-is\-tic Algorithms",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "2",
  pages =        "79--94",
  month =        jun,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356770.356773",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:49 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Wilson:1980:SFD,Cohen:1980:SFD}.",
  abstract =     "Primitive commands representing the concepts of
                 choice, failure, and success are used to describe
                 non-deterministic algorithms for solving a variety of
                 problems. First, the role of the primitives is
                 explained in a manner appealing to the reader's
                 intuition. Then, a solution to the classical 8-queens
                 problem is presented as a non-deterministic program,
                 and its implementation is described. Two examples
                 follow, showing the usefulness of the primitives in
                 computer-aided problem solving: the first is a simple
                 question-answering program; the other is a parser for a
                 context-sensitive language. Finally, a brief survey of
                 current and related work is presented which includes:
                 additional desirable primitives, implementation,
                 correctness, efficiency, and theoretical
                 implications.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "non-deterministic, computer programming",
}

@Article{Molina:1979:SRD,
  author =       "Francisco Walter Molina",
  title =        "A Survey of Resource Directive Decomposition in
                 Mathematical Programming",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "2",
  pages =        "95--104",
  month =        jun,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356770.356774",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:49 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Resource-directive decomposition methods of
                 mathematical programming problems have attracted
                 considerable attention in recent years. A review of the
                 specialized literature is presented, and the features
                 and drawbacks of the most representative
                 resource-directive methods are analyzed. To give an
                 appropriate chronological and technical perspective,
                 early general methods, such as the ones of
                 Dantzig-Wolfe and Benders, are also included in the
                 survey.",
  acknowledgement = ack-nhfb,
  classification = "921",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "mathematical programming",
}

@Article{McKell:1979:CCR,
  author =       "Lynn J. McKell and James V. Hansen and Lester E.
                 Heitger",
  title =        "Charging for Computing Resources",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "2",
  pages =        "105--120",
  month =        jun,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356770.356775",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:49 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Modern computer configurations are often designed to
                 share a host of resources among many users who may be
                 simultaneously competing for their utilization. A
                 substantive issue in computer management focuses on how
                 to effectively allocate computing resources and
                 subsequently charge for them in this competing
                 environment. The issue is generally made more complex
                 by the dependencies in resource availability stemming
                 from the hardware configuration. This paper surveys
                 significant charging mechanisms which have been
                 proposed. The paper does not discuss specific
                 commercial software available to implement charging
                 approaches, but rather is written as a basic survey for
                 readers with an interest in both computers and
                 management science.",
  acknowledgement = ack-nhfb,
  classification = "723; 912",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computers; management science",
}

@Article{Comer:1979:UBT,
  author =       "Douglas Comer",
  title =        "Ubiquitous {B}-Tree",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "2",
  pages =        "121--137",
  month =        jun,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356770.356776",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:49 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Comer:1979:SFT}.",
  abstract =     "B-trees have become, de facto, a standard for file
                 organization. File indexes of users, dedicated database
                 systems, and general-purpose access methods have all
                 been proposed and implemented using B-trees. This paper
                 reviews B-trees and shows why they have been so
                 successful. It discusses the major variations of the
                 B-tree, especially the B** plus -tree, contrasting the
                 relative merits and costs of each implementation. It
                 illustrates a general purpose access method which uses
                 a B-tree.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "b-trees; data processing",
}

@Article{Nagy:1979:GDP,
  author =       "George Nagy and Sharad Wagle",
  title =        "Geographic Data Processing",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "2",
  pages =        "139--181",
  month =        jun,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356770.356777",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:24:49 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/79.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This survey attempts to provide a unified framework
                 for the constituent elements of geographical data
                 processing systems. External aspects of such systems,
                 as perceived by potential users, are discussed with
                 regard to extent, coordinate system and base map, range
                 of applications, input\slash output mechanisms,
                 computer configuration, command and interaction,
                 documentation, and administration. The internal
                 aspects, which would concern the system designer, are
                 analyzed in terms of the type of spatial variables
                 involved and of their interrelationship with respect to
                 common operations. This point of view is shown to lead
                 to a workable classification of two-dimensional
                 geometric algorithms and data structures. To provide
                 concrete examples, ten representative geographic data
                 processing systems, ranging from automated cartography
                 to interactive decision support, are described. Some
                 comparisons are drawn between geographical data
                 processing systems and their conventional
                 business-oriented counterparts.",
  acknowledgement = ack-nhfb,
  classification = "405; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data processing; geography and programming support;
                 maps and mapping --- Computer Application,
                 Applications",
}

@Article{Goldberg:1979:AILb,
  author =       "Adele Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "3",
  pages =        "183--183",
  month =        sep,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356778.356779",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kim:1979:RDS,
  author =       "Won Kim",
  title =        "Relational Database Systems",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "3",
  pages =        "187--211",
  month =        sep,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356778.356780",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Fernandez:1980:SFR,Kim:1980:SFR,Friesen:1980:SFR}.",
  abstract =     "This paper first surveys all the relational database
                 systems which have been reported, highlighting their
                 most noteworthy features and concepts. It then surveys
                 and classifies proposals for implementing each of the
                 requisite functional components of a hypothetical,
                 comprehensive relational database system. It concludes
                 with some general observations about user responses to
                 relational systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "cellular associative processor; concurrency control;
                 distributed database; integrity assertions; integrity
                 control; natural language interface; recovery from
                 crashes; relational algebra; relational calculus;
                 relational database; relational interface optimization;
                 relational model of data; selective access control;
                 snapshots; user views",
}

@Article{Dale:1979:DMS,
  author =       "A. G. Dale",
  title =        "Database Management Systems Development in the
                 {USSR}",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "3",
  pages =        "213--226",
  month =        sep,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356778.356781",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1979:DS,
  author =       "Dorothy E. Denning and Peter J. Denning",
  title =        "Data Security",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "3",
  pages =        "227--249",
  month =        sep,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356778.356782",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mohanty:1979:MMQ,
  author =       "Siba N. Mohanty",
  title =        "Models and Measurements for Quality Assessment of
                 Software",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "3",
  pages =        "251--275",
  month =        sep,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356778.356783",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:12 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Dunn:1980:SFW,Mohanty:1980:SFW}.",
  acknowledgement = ack-nhfb,
  annote =       "Several software quality assessment methods which span
                 the software life cycle are discussed. The quality of a
                 system design can be estimated by measuring the system
                 entropy function or the system work function. The
                 quality improvement due to reconfiguration can be
                 determined by calculating system entropy loading
                 measures. Software science and Zipf's law are shown to
                 be useful for estimating program length and
                 implementation time.",
  country =      "USA",
  date =         "11/10/79",
  descriptors =  "Software; design; software engineering; reliability;
                 measurement; model; fundamentals in statistics;
                 performance evaluation",
  enum =         "2189",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  language =     "English",
  references =   "65",
}

@Article{Fenichel:1979:SFH,
  author =       "Robert Fenichel",
  title =        "Surveyor's Forum: {Heads I} Win, Tails You Lose",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "3",
  pages =        "277--277",
  month =        sep,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356778.356784",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Fitzsimmons:1978:RES,Moranda:1978:SFS,Baker:1978:SFS,Fitzsimmons:1978:SFS,Zweben:1979:SFH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zweben:1979:SFH,
  author =       "Stuart H. Zweben",
  title =        "Surveyor's Forum: {Heads I} Win, Tails You Lose",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "3",
  pages =        "277--278",
  month =        sep,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356778.356785",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Fitzsimmons:1978:RES,Moranda:1978:SFS,Baker:1978:SFS,Fitzsimmons:1978:SFS,Fenichel:1979:SFH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Christiaen:1979:SFP,
  author =       "H. Christiaen",
  title =        "Surveyor's Forum: {Projecting} Problems",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "3",
  pages =        "278--279",
  month =        sep,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356778.356786",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Carlbom:1978:PGP,Carlbom:1979:SFP,Carlbom:1979:CGP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Carlbom:1979:SFP,
  author =       "Ingrid Carlbom",
  title =        "Surveyor's Forum: {Projecting} Problems",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "3",
  pages =        "279--280",
  month =        sep,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356778.356787",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Carlbom:1978:PGP,Christiaen:1979:SFP,Carlbom:1979:CGP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Carlbom:1979:CGP,
  author =       "Ingrid Carlbom and Joseph Paciorek",
  title =        "Corrigenda: {``Geometric Projection and Viewing
                 Transformations''}",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "3",
  pages =        "280--280",
  month =        sep,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356778.356788",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Carlbom:1978:PGP,Christiaen:1979:SFP,Carlbom:1979:SFP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1979:AILc,
  author =       "Adele J. Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "281--281",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356790",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Special Issue: Cryptology",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1979:EOS,
  author =       "Peter J. Denning",
  title =        "{Editor}'s Overview --- Special Section on Data
                 Encryption",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "283--283",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356791",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lempel:1979:CT,
  author =       "Abraham Lempel",
  title =        "Cryptology in Transition",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "285--303",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356792",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Simmons:1979:SAE,
  author =       "Gustavus J. Simmons",
  title =        "Symmetric and Asymmetric Encryption",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "305--330",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356793",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Popek:1979:ESC,
  author =       "Gerald J. Popek and Charles S. Kline",
  title =        "Encryption and Secure Computer Networks",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "331--356",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356794",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bright:1979:QRN,
  author =       "Herbert S. Bright and Richard L. Enison",
  title =        "Quasi-Random Number Sequences from a Long-Period {TLP}
                 Generator with Remarks on Application to Cryptography",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "357--370",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356795",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sockut:1979:DRP,
  author =       "Gary H. Sockut and Robert P. Goldberg",
  title =        "Database Reorganization --- Principles and Practice",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "371--395",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356796",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Also published in/as: US Department of Commerce,
                 National Bureau of Standards, Washington DC, Spec.
                 Publ. 500-47, April 1979.",
  abstract =     "Database reorganization can be defined as changing
                 some aspect of the way in which a database is arranged
                 logically and/or physically. An example is changing
                 from a one-to-one to a one-to-many relationship.
                 Reorganization is a necessary function in a database
                 system. This paper introduces the basic concepts of
                 reorganization, including why it is performed. Many
                 types of reorganization are described and classified
                 into logical/physical levels. Then pragmatic issues
                 such as reorganization strategies, a survey of several
                 commercial reorganization facilities, case studies, and
                 database administration considerations are covered.
                 Finally, several research efforts are surveyed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database; database management; file maintenance;
                 reorganization; restructuring",
}

@Article{Bentley:1979:DSR,
  author =       "Jon Louis Bentley and Jerome H. Friedman",
  title =        "Data Structures for Range Searching",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "397--409",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356797",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "cells; k-d trees; k-ranges; multidimensional binary
                 search trees; orthogonal range queries; projection",
}

@Article{Alberts:1979:SFQ,
  author =       "David S. Alberts",
  title =        "Surveyor's Forum: a Question of Transition",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "411--411",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356798",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Zelkowitz:1978:PSE,Wendel:1979:SFR,Zelkowitz:1979:SFQ,Zelkowitz:1979:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zelkowitz:1979:SFQ,
  author =       "Marvin V. Zelkowitz",
  title =        "Surveyor's Forum: a Question of Transition",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "411--412",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356799",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Zelkowitz:1978:PSE,Alberts:1979:SFQ,Wendel:1979:SFR,Zelkowitz:1979:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Comer:1979:SFT,
  author =       "Douglas Comer",
  title =        "Surveyor's Forum: {The} Tree Branches",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "412--412",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356800",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Comer:1979:UBT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Buck-Lew:1979:SFD,
  author =       "Maylun Buck-Lew",
  title =        "Surveyor's Forum: a Dance Prelude",
  journal =      j-COMP-SURV,
  volume =       "11",
  number =       "4",
  pages =        "412--413",
  month =        dec,
  year =         "1979",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356789.356801",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:25:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Badler:1979:DRH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1980:AILa,
  author =       "Adele J. Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356802.356803",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:26:29 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Maryanski:1980:BDS,
  author =       "Fred J. Maryanski",
  title =        "Backend Database Systems",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "1",
  pages =        "3--25",
  month =        mar,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356802.356804",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:26:29 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  annote =       "Tutorial examines basic structure, their potential
                 benefits and drawbacks and the problems facing
                 developers of such systems. Several prototype systems
                 are described: XDMS, IDMS backend, GE MADMAN, Kansas
                 State University systems.",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ellis:1980:OIS,
  author =       "Clarence A. Ellis and Gary J. Nutt",
  title =        "Office Information Systems and Computer Science",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "1",
  pages =        "27--60",
  month =        mar,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356802.356805",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:26:29 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  annote =       "Office information systems are defined as entities
                 within a distributed environment.",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kling:1980:SAC,
  author =       "Rob Kling",
  title =        "Social Analyses of Computing: {Theoretical}
                 Perspectives in Recent Empirical Research",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "1",
  pages =        "61--110",
  month =        mar,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356802.356806",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:26:29 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fernandez:1980:SFR,
  author =       "E. B. Fernandez",
  title =        "Surveyor's Forum: {Related} Information",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "1",
  pages =        "111--112",
  month =        mar,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356802.356807",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:26:29 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Kim:1979:RDS,Kim:1980:SFR,Friesen:1980:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kim:1980:SFR,
  author =       "Won Kim",
  title =        "Surveyor's Forum: {Related} Information",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "1",
  pages =        "112--112",
  month =        mar,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356802.356808",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:26:29 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Kim:1979:RDS,Fernandez:1980:SFR,Friesen:1980:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Friesen:1980:SFR,
  author =       "Oris D. Friesen",
  title =        "Surveyor's Forum: {Related} Information",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "1",
  pages =        "112--113",
  month =        mar,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356802.356809",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:26:29 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Kim:1979:RDS,Fernandez:1980:SFR,Kim:1980:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1980:AILb,
  author =       "Adele J. Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "2",
  pages =        "115--116",
  month =        jun,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356810.356811",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1980:EP,
  author =       "Adele J. Goldberg",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "2",
  pages =        "117--120",
  month =        jun,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356810.356812",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jones:1980:EUM,
  author =       "Anita K. Jones and Peter Schwarz",
  title =        "Experience Using Multiprocessor Systems --- a Status
                 Report",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "2",
  pages =        "121--165",
  month =        jun,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356810.356813",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wong:1980:MEH,
  author =       "C. K. Wong",
  title =        "Minimizing Expected Head Movement in One-Dimensional
                 and Two-Dimensional Mass Storage Systems",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "2",
  pages =        "167--178",
  month =        jun,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356810.356814",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:10 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Teorey:1980:LRA,
  author =       "Toby J. Teorey and James P. Fry",
  title =        "The Logical Record Access Approach to Database
                 Design",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "2",
  pages =        "179--211",
  month =        jun,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356810.356815",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Teorey:1980:CLR}.",
  abstract =     "Database management systems have evolved to the point
                 of general acceptance and wide application; however a
                 major problem still facing the user is the effective
                 utilization of these systems. Important to achieving
                 effective database usability and responsiveness is the
                 design of the database. This paper presents a practical
                 stepwise database design methodology that derives a
                 DBMS-processable database structure from a set of user
                 information and processing requirements. Although the
                 methodology emphasizes the logical design step, the
                 activities of requirements analysis and physical design
                 are also addressed. The methodology is illustrated with
                 a detailed example. Performance trade-offs among
                 multiple users of a single integrated database are
                 considered, and the relationship between short-term
                 design and design for flexibility to changing
                 requirements is discussed. Many steps in the database
                 design process can be assisted with proper use of
                 computer modeling techniques and other tools, such as
                 requirements analysis software. The example design
                 problem and its solution steps serve to point out when
                 and where current technology can be effectively used.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "analytical models; database administrator; database
                 design; database management systems; performance
                 evaluation; requirements analysis",
}

@Article{Erman:1980:HIS,
  author =       "Lee D. Erman and Frederick Hayes-Roth and Victor R.
                 Lesser and D. Raj Reddy",
  title =        "The {Hearsay-II} Speech-Understanding System:
                 Integrating Knowledge to Resolve Uncertainty",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "2",
  pages =        "213--253",
  month =        jun,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356810.356816",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dunn:1980:SFW,
  author =       "Stanley Dunn",
  title =        "Surveyor's Forum: {Working} on Interpretations",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "2",
  pages =        "255--255",
  month =        jun,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356810.356817",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Mohanty:1979:MMQ,Mohanty:1980:SFW}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mohanty:1980:SFW,
  author =       "Siba Mohanty",
  title =        "Surveyor's Forum: {Working} on Interpretations",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "2",
  pages =        "256--256",
  month =        jun,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356810.356818",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Mohanty:1979:MMQ,Dunn:1980:SFW}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1980:AILc,
  author =       "Adele J. Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "3",
  pages =        "257--258",
  month =        sep,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356819.356820",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Habib:1980:SSM,
  author =       "Stanley Habib",
  title =        "Special Section on Microprogramming",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "3",
  pages =        "259--259",
  month =        sep,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356819.356821",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Landskov:1980:LMC,
  author =       "David Landskov and Scott Davidson and Bruce Shriver
                 and Patrick W. Mallett",
  title =        "Local Microcode Compaction Techniques",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "3",
  pages =        "261--294",
  month =        sep,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356819.356822",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dasgupta:1980:SAH,
  author =       "Subrata Dasgupta",
  title =        "Some Aspects of High-Level Microprogramming",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "3",
  pages =        "295--323",
  month =        sep,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356819.356823",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Clark:1980:EML,
  author =       "Wesley A. Clark",
  title =        "From Electron Mobility to Logical Structure: a View of
                 Integrated Circuits",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "3",
  pages =        "325--356",
  month =        sep,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356819.356824",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wilson:1980:SFD,
  author =       "Walter Wilson",
  title =        "Surveyor's Forum: {Determining} a Search",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "3",
  pages =        "357--358",
  month =        sep,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356819.356825",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Cohen:1979:NDA,Cohen:1980:SFD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cohen:1980:SFD,
  author =       "Jacques Cohen",
  title =        "Surveyor's Forum: {Determining} a Search",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "3",
  pages =        "358--358",
  month =        sep,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356819.356826",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:27:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Cohen:1979:NDA,Wilson:1980:SFD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1980:AILd,
  author =       "Adele J. Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "4",
  pages =        "359--360",
  month =        dec,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356827.356828",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wetherell:1980:PLR,
  author =       "C. S. Wetherell",
  title =        "Probabilistic Languages: a Review and Some Open
                 Questions",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "4",
  pages =        "361--379",
  month =        dec,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356827.356829",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hall:1980:ASM,
  author =       "Patrick A. V. Hall and Geoff R. Dowling",
  title =        "Approximate String Matching",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "4",
  pages =        "381--402",
  month =        dec,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356827.356830",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bird:1980:TTR,
  author =       "R. S. Bird",
  title =        "Tabulation Techniques for Recursive Programs",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "4",
  pages =        "403--417",
  month =        dec,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356827.356831",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Richter:1981:SFR,Bird:1981:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lueker:1980:STS,
  author =       "George S. Lueker",
  title =        "Some Techniques for Solving Recurrences",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "4",
  pages =        "419--436",
  month =        dec,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356827.356832",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Keenan:1981:SFG,Lueker:1981:SFG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Requicha:1980:RRS,
  author =       "Aristides A. G. Requicha",
  title =        "Representations for Rigid Solids: {Theory}, Methods,
                 and Systems",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "4",
  pages =        "437--464",
  month =        dec,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356827.356833",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Steinberg:1981:SFU,Requicha:1981:SFU}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "general references surveys and Methodologies; Modeling
                 geometric design/modeling and shape modeling and
                 Algorithmic Aspects solids representation; Techniques",
}

@Article{Teorey:1980:CLR,
  author =       "Toby J. Teorey and James P. Fry",
  title =        "Corrigenda: {``The Logical Record Access Approach to
                 Database Design''}",
  journal =      j-COMP-SURV,
  volume =       "12",
  number =       "4",
  pages =        "465--465",
  month =        dec,
  year =         "1980",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356827.356834",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Teorey:1980:LRA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Moran:1981:GEI,
  author =       "Thomas P. Moran",
  title =        "{Guest Editor}'s Introduction: an Applied Psychology
                 of the User",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "1",
  pages =        "1--11",
  month =        mar,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356835.356836",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Special Issue: The Psychology of Human-Computer
                 Interaction. See also
                 \cite{Floyd:1981:SFA,Moran:1981:SFA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Reisner:1981:HFS,
  author =       "Phyllis Reisner",
  title =        "Human Factors Studies of Database Query Languages: a
                 Survey and Assessment",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "1",
  pages =        "13--31",
  month =        mar,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356835.356837",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Empirical studies have been undertaken to measure the
                 ease-of-use of a query language, compare two or more
                 such languages for ease-of-use, study controversial
                 issues in query language design, and provide feedback
                 to designers for improving a language. Some primitive
                 attempts at constructing abstract models related to
                 query languages also exist. This paper discusses some
                 of the techniques that have been used and results
                 obtained. A primary goal is to show the reader
                 unfamiliar with behavioral research what the results do
                 and do not mean.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "behavioral science; data models; database systems;
                 evaluation of ease-of-use; human factors; improving
                 language design; procedurality; query languages;
                 syntax",
}

@Article{Embley:1981:BAT,
  author =       "David W. Embley and George Nagy",
  title =        "Behavioral Aspects of Text Editors",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "1",
  pages =        "33--70",
  month =        mar,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356835.356838",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Leverett:1981:SFI,Embley:1981:SFI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rouse:1981:HCI,
  author =       "William B. Rouse",
  title =        "Human-Computer Interaction in the Control of Dynamic
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "1",
  pages =        "71--99",
  month =        mar,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356835.356839",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Modes of human-computer interaction in the control of
                 dynamic systems are discussed, and the problem of
                 allocating tasks between human and computer considered.
                 Models of human performance in a variety of tasks
                 associated with the control of dynamic systems are
                 reviewed. These models are evaluated in the context of
                 a design example involving human-computer interaction
                 in aircraft operations. Other examples include power
                 plants, chemical plants, and ships.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "aircraft; control; dynamic systems; human-computer
                 interaction; mathematical models; system design; task
                 analysis",
}

@Article{Sheil:1981:PSP,
  author =       "B. A. Sheil",
  title =        "The Psychological Study of Programming",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "1",
  pages =        "101--120",
  month =        mar,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356835.356840",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mayer:1981:PHN,
  author =       "Richard E. Mayer",
  title =        "The Psychology of How Novices Learn Computer
                 Programming",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "1",
  pages =        "121--141",
  month =        mar,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356835.356841",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:28:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1981:AILa,
  author =       "Adele Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "2",
  pages =        "143--144",
  month =        jun,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356842.356843",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:03 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1981:EP,
  author =       "Adele Goldberg",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "2",
  pages =        "145--148",
  month =        jun,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356842.356844",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:03 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kohler:1981:STS,
  author =       "Walter H. Kohler",
  title =        "A Survey of Techniques for Synchronization and
                 Recovery in Decentralized Computer Systems",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "2",
  pages =        "149--183",
  month =        jun,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356842.356845",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:03 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Reed:1982:SFR,Kohler:1982:SFR}.",
  abstract =     "Two related and fundamental problems in designing
                 decentralized systems which support an object model of
                 computation are introduced, and proposed solution
                 techniques are surveyed. The first problem is
                 synchronizing access to shared objects while allowing a
                 high degree of concurrency. The second is the recovery
                 of objects in spite of user errors, application errors,
                 or partial system failure. The synchronization problem
                 is a generalization of the concurrency control problem
                 which arises in database and transaction-processing
                 systems. Concurrency control methods which use locking,
                 timestamps, circulating permit, tickets, conflict
                 analysis, and reservations are presented and compared.
                 The proposed approach to solving the recovery problem
                 is based on a software structuring abstraction called
                 the atomic action, a type of generalized transaction.
                 Requirements and techniques for implementing atomic
                 actions in a decentralized environment are discussed.",
  acknowledgement = ack-nhfb,
  annote =       "The concurrency problem is described, as is its
                 statement, in terms of the notion of a serial
                 linearized schedule of atomic actions (transactions).
                 The role of atomic actions in recovery. A survey is
                 given of the techniques used for providing concurrency
                 control and recovery. The concurrency controls
                 discussed are locking, time-stamps, conflict analysis,
                 and a notion called `reservations'. `Ticketing' and its
                 use in distributed systems is also described briefly.",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems, digital",
}

@Article{Bernstein:1981:CCD,
  author =       "Philip A. Bernstein and Nathan Goodman",
  title =        "Concurrency Control in Distributed Database Systems",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "2",
  pages =        "185--221",
  month =        jun,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356842.356846",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:03 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Also published in/as: Auerbach Annual 1980,
                 North-Holland 1981. See also
                 \cite{Bender:1982:SFT,Gifford:1982:SFT,Bernstein:1982:SFT}.",
  abstract =     "The state of the art in distributed database
                 concurrency control is presented. The heart of our
                 analysis is a decomposition of the concurrency control
                 problem into two major subproblems: read-write and
                 write-write synchronization. A series of
                 synchronization techniques is described for solving
                 each subproblem and show how to combine these
                 techniques into algorithms for solving the entire
                 concurrency control problem. Such algorithms are called
                 ``concurrency control methods''. 48 principal methods
                 are described including all practical algorithms that
                 have appeared in the literature plus several new
                 ones.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data base systems",
}

@Article{Gray:1981:RMS,
  author =       "Jim Gray and Paul McJones and Mike Blasgen and Bruce
                 Lindsay and Raymond Lorie and Tom Price and Franco
                 Putzolu and Irving Traiger",
  title =        "The {Recovery Manager} of the {System R Database
                 Manager}",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "2",
  pages =        "223--242",
  month =        jun,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356842.356847",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:03 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The recovery subsystem of an experimental data
                 management system is described and evaluated. The
                 transaction concept allows application programs to
                 commit, abort, or partially undo their effects. The
                 DO-UNDO-REDO protocol allows new recoverable types and
                 operations to be added to the recovery system.
                 Application programs can record data in the transaction
                 log to facilitate application-specific recovery.
                 Transaction undo and redo are based on records kept in
                 a transaction log. The checkpoint mechanism is based on
                 differential files (shadows). The recovery log is
                 recorded on disk rather than tape.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data base systems",
}

@Article{Bird:1981:SFR,
  author =       "R. S. Bird",
  title =        "Surveyor's Forum: a Recurring Bug",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "2",
  pages =        "243--243",
  month =        jun,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356842.356848",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:03 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Bird:1980:TTR,Richter:1981:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Richter:1981:SFR,
  author =       "Helmut Richter",
  title =        "Surveyor's Forum: a Recurring Bug",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "2",
  pages =        "243--243",
  month =        jun,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356842.356849",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:03 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Bird:1980:TTR,Bird:1981:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1981:AILb,
  author =       "Adele Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "3",
  pages =        "245--245",
  month =        sep,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356850.356851",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:28 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Landwehr:1981:FMC,
  author =       "Carl E. Landwehr",
  title =        "Formal Models for Computer Security",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "3",
  pages =        "247--278",
  month =        sep,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356850.356852",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:28 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This paper reviews the need for formal security
                 models, describes the structure and operation of
                 military security controls, considers how automation
                 has affected security problems, surveys models that
                 have been proposed and applied to date, and suggests
                 possible directions for future models.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer security; computer systems, digital; data
                 processing",
}

@Article{Cheheyl:1981:VS,
  author =       "Maureen Harris Cheheyl and Morrie Gasser and George A.
                 Huff and Jonathan K. Millen",
  title =        "Verifying Security",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "3",
  pages =        "279--339",
  month =        sep,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356850.356853",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:28 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Four automated specification and verification
                 environments are surveyed and compared: HDM, FDM,
                 Gypsy, and AFFIRM. The emphasis of the comparison is on
                 the way these systems could be used to prove security
                 properties of an operating system design.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer operating systems --- Design; data
                 processing; security verification",
}

@Article{Cohen:1981:GCL,
  author =       "Jacques Cohen",
  title =        "Garbage Collection of Linked Data Structures",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "3",
  pages =        "341--367",
  month =        sep,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356850.356854",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:28 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A concise and unified view of the numerous existing
                 algorithms for performing garbage collection of linked
                 data structures is presented. The emphasis is on
                 garbage collection proper, rather than on storage
                 allocation. First, the classical garbage collection
                 algorithms are reviewed, and their marking and
                 collecting phases, with and without compacting, are
                 discussed. Algorithms describing these phases are
                 classified according to the type of cells to be
                 collected: those for collecting single-sized cells are
                 simpler than those for varisized cells. Recently
                 proposed algorithms are presented and compared with the
                 classical ones. Special topics in garbage collection
                 are also covered. A bibliography with topical
                 annotations is included.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming --- Subroutines; data processing;
                 garbage collection",
}

@Article{Requicha:1981:SFU,
  author =       "Aristides A. G. Requicha",
  title =        "Surveyor's Forum: an Update on {SynthaVision}",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "3",
  pages =        "369--369",
  month =        sep,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356850.356855",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:28 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Requicha:1980:RRS,Steinberg:1981:SFU}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Steinberg:1981:SFU,
  author =       "Herbert A. Steinberg",
  title =        "Surveyor's Forum: an Update on {SynthaVision}",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "3",
  pages =        "369--369",
  month =        sep,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356850.356856",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:28 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Requicha:1980:RRS,Requicha:1981:SFU}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Keenan:1981:SFG,
  author =       "Douglas J. Keenan",
  title =        "Surveyor's Forum: Generating Solutions",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "3",
  pages =        "370--370",
  month =        sep,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356850.356857",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:28 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Lueker:1980:STS,Lueker:1981:SFG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lueker:1981:SFG,
  author =       "George S. Lueker",
  title =        "Surveyor's Forum: Generating Solutions",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "3",
  pages =        "370--370",
  month =        sep,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356850.356858",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:28 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Lueker:1980:STS,Keenan:1981:SFG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1981:AILc,
  author =       "Adele Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "4",
  pages =        "371--372",
  month =        dec,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356859.356860",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ahuja:1981:IM,
  author =       "Narendra Ahuja and B. J. Schachter",
  title =        "Image Models",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "4",
  pages =        "373--397",
  month =        dec,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356859.356861",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Sharma:1983:SFI,Ahuja:1983:SFI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Srihari:1981:RTD,
  author =       "Sargur N. Srihari",
  title =        "Representation of Three-Dimensional Digital Images",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "4",
  pages =        "399--424",
  month =        dec,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356859.356862",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "I35 digital images and I35 3-D digital images",
}

@Article{Frank:1981:TDC,
  author =       "Edward H. Frank and Robert F. Sproull",
  title =        "Testing and Debugging Custom Integrated Circuits",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "4",
  pages =        "425--451",
  month =        dec,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356859.356863",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tanenbaum:1981:NP,
  author =       "Andrew S. Tanenbaum",
  title =        "Network Protocols",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "4",
  pages =        "453--489",
  month =        dec,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356859.356864",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Floyd:1981:SFA,
  author =       "Christiane Floyd and Reinhard Keil and Erhard
                 Nullmeier",
  title =        "Surveyor's Forum: Augmentation or Dehumanization?",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "4",
  pages =        "491--492",
  month =        dec,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356859.356865",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Moran:1981:GEI,Moran:1981:SFA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Moran:1981:SFA,
  author =       "Thomas P. Moran",
  title =        "Surveyor's Forum: {Augmentation} or Dehumanization?",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "4",
  pages =        "492--493",
  month =        dec,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356859.356866",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Moran:1981:GEI,Floyd:1981:SFA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Leverett:1981:SFI,
  author =       "Bruce Leverett",
  title =        "Surveyor's Forum: {Interpreting} Experimental Data",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "4",
  pages =        "493--494",
  month =        dec,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356859.356867",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Embley:1981:BAT,Embley:1981:SFI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Embley:1981:SFI,
  author =       "David W. Embley and George Nagy",
  title =        "Surveyor's Forum: {Interpreting} Experimental Data",
  journal =      j-COMP-SURV,
  volume =       "13",
  number =       "4",
  pages =        "494--494",
  month =        dec,
  year =         "1981",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356859.356868",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:29:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Embley:1981:BAT,Leverett:1981:SFI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1982:AILa,
  author =       "Adele Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356869.356870",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Brady:1982:CAI,
  author =       "Michael Brady",
  title =        "Computational Approaches to Image Understanding",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "1",
  pages =        "3--71",
  month =        mar,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356869.356871",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:24 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recent theoretical developments in image understanding
                 are surveyed. Among the issues discussed are edge
                 finding, region finding, texture, shape from shading,
                 shape from texture, shape from contour, and the
                 representations of surfaces and objects. Much of the
                 work described was developed in the DARPA Image
                 Understanding project.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "I35 image understanding, image processing",
}

@Article{Feuer:1982:CPL,
  author =       "Alan R. Feuer and Narain H. Gehani",
  title =        "Comparison of the Programming Languages {C} and
                 {Pascal}",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "1",
  pages =        "73--92",
  month =        mar,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356869.356872",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:24 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Peterson:1982:SFI,Feuer:1982:SFI}.",
  abstract =     "The languages C and PASCAL are growing in popularity,
                 particularly among programmers of small computers. The
                 two languages are summarized and compared, including
                 their design philosophies, their handling of data
                 types, the programming facilities they provide, the
                 impact of these facilities on the quality of programs,
                 and how useful the facilities are for programming in a
                 variety of application domains.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming languages",
}

@Article{Treleaven:1982:DDD,
  author =       "Philip C. Treleaven and David R. Brownbridge and
                 Richard P. Hopkins",
  title =        "Data-Driven and Demand-Driven Computer Architecture",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "1",
  pages =        "93--143",
  month =        mar,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356869.356873",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:24 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Novel data-driven and demand-driven computer
                 architectures are under development in a large number
                 of laboratories in the United States, Japan, and
                 Europe. The concepts and relationships that exist both
                 within and between the two areas of research are
                 identified by examining data-driven and demand-driven
                 architecture at three levels: computation organization,
                 (stored) program organizations, and machine
                 organization. Finally, a survey of various novel
                 computer architectures under development is given.",
  acknowledgement = ack-nhfb,
  annote =       "The aim of this paper is to identify the concepts and
                 relationships that exist both within and between the
                 two areas of research of data-driven and demand-driven
                 architectures.",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer architecture",
}

@Article{Reed:1982:SFR,
  author =       "David P. Reed",
  title =        "Surveyor's Forum: {Recovering} an Error",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "1",
  pages =        "145--146",
  month =        mar,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356869.356874",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Kohler:1981:STS,Kohler:1982:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kohler:1982:SFR,
  author =       "Walter H. Kohler",
  title =        "Surveyor's Forum: {Recovering} an Error",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "1",
  pages =        "146--147",
  month =        mar,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356869.356875",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Kohler:1981:STS,Reed:1982:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1982:AILb,
  author =       "Adele J. Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "2",
  pages =        "149--150",
  month =        jun,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356876.356877",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1982:EP,
  author =       "Adele J. Goldberg",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "2",
  pages =        "151--157",
  month =        jun,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356876.356878",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Adrion:1982:VVT,
  author =       "W. Richards Adrion and Martha A. Branstad and John C.
                 Cherniavsky",
  title =        "Validation, Verification, and Testing of Computer
                 Software",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "2",
  pages =        "159--192",
  month =        jun,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356876.356879",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:43 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Current verification, validation, and testing
                 approaches are surveyed, and their strengths,
                 weaknesses, and life-cycle usage are discussed. In
                 conjunction with these, the paper describes automated
                 tools used to implement validation, verification, and
                 testing. In the discussion of new research thrusts,
                 emphasis is given to the continued need to develop a
                 stronger theoretical basis for testing and the need to
                 employ combinations of tools and techniques that may
                 vary over each application.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer software",
}

@Article{Howden:1982:VSP,
  author =       "William E. Howden",
  title =        "Validation of Scientific Programs",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "2",
  pages =        "193--227",
  month =        jun,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356876.356880",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:43 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A comprehensive approach to the validation of computer
                 programs which concentrates on the use of informal
                 validation methods, such as testing and static analysis
                 is described. Although many of the methods are general
                 and can be applied to any software system, the emphasis
                 is on the validation of individual scientific
                 subroutines. Most of the examples are in FORTRAN and
                 some of the described techniques are closely related to
                 features of the FORTRAN language. Methods for detecting
                 programming errors are described, the validation of
                 specifications and design, as well as their use in
                 generating test data are discussed.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming",
}

@Article{Dunlop:1982:CAF,
  author =       "Douglas D. Dunlop and Victor R. Basili",
  title =        "A Comparative Analysis of Functional Correctness",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "2",
  pages =        "229--244",
  month =        jun,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356876.356881",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:43 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The functional correctness technique is presented and
                 discussed. It is also explained that the underlying
                 theory has an implication for the derivation of loop
                 invariants. The functional verification conditions
                 concerning program loops are then shown to be a
                 specialization of the commonly used inductive assertion
                 verification conditions. Next, the functional technique
                 is compared and contrasted with subgoal induction.
                 Finally, the difficulty of proving initialized loop
                 programs is examined in light of both the inductive
                 assertion and functional correctness theories.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming",
}

@Article{Allen:1982:IDD,
  author =       "Frank W. Allen and Mary E. S. Loomis and Michael V.
                 Mannino",
  title =        "The Integrated {Dictionary\slash Directory System}",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "2",
  pages =        "245--286",
  month =        jun,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356876.356882",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:43 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The concept of an integrated Dictionary\slash
                 Directory (D/D) System is discussed in detail, and the
                 state of current systems in both the centralized and
                 distributed database environments is surveyed. For the
                 centralized database environment, three aspects are
                 emphasized: (1) the software interfaces between the D/D
                 System and the other software packages, (2) the convert
                 functions of the D/D System, and (3) the environmental
                 dependency between the D/D System and a Database
                 Management System (DBMS). For the distributed database
                 environment, the article elucidates the necessary
                 extensions to the centralized D/D, the additional
                 software interfaces required, and the use of the D/D as
                 a distributed database. An example of a commercial D/D
                 System that is integrated with a distributed DBMS is
                 presented.",
  acknowledgement = ack-nhfb,
  annote =       "A comprehensive survey of dictionary\slash directory
                 system features with examples from commercial systems",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data base systems",
}

@Article{Dowdy:1982:CMF,
  author =       "Lawrence W. Dowdy and Derrell V. Foster",
  title =        "Comparative Models of the File Assignment Problem",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "2",
  pages =        "287--313",
  month =        jun,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356876.356883",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:43 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Kollias:1983:SFF,Dowdy:1983:SFF}.",
  abstract =     "The optimal distribution of files among storage nodes
                 is a major problem in computer system optimization.
                 Differing design goals, varying system assumptions, and
                 contrasting solution techniques yield a disparity of
                 optimal file assignments. This paper views the
                 differing file assignment models in a uniform manner.
                 Relative advantages and weaknesses of the various
                 models become immediately apparent. This perspective
                 exposes the further research which is necessary in
                 order to provide a truly satisfactory solution of the
                 file assignment problem.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems, digital; distributed file systems",
}

@Article{Bender:1982:SFT,
  author =       "Heinz Bender",
  title =        "Surveyor's Forum: {Technical} Transactions",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "2",
  pages =        "315--316",
  month =        jun,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356876.356884",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Bernstein:1981:CCD,Gifford:1982:SFT,Bernstein:1982:SFT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gifford:1982:SFT,
  author =       "David Gifford",
  title =        "Surveyor's Forum: {Technical} Transactions",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "2",
  pages =        "316--316",
  month =        jun,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356876.356885",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Bernstein:1981:CCD,Bender:1982:SFT,Bernstein:1982:SFT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bernstein:1982:SFT,
  author =       "Philip Bernstein and Nathan Goodman",
  title =        "Surveyor's Forum: {Technical} Transactions",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "2",
  pages =        "317--318",
  month =        jun,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356876.356886",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:30:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Bernstein:1981:CCD,Bender:1982:SFT,Gifford:1982:SFT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1982:AILc,
  author =       "Adele J. Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "3",
  pages =        "319--320",
  month =        sep,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356887.356888",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Meyrowitz:1982:IESa,
  author =       "Norman Meyrowitz and Andries {Van Dam}",
  title =        "Interactive Editing Systems: {Part I}",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "3",
  pages =        "321--352",
  month =        sep,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356887.356889",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:12 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Computer-based interactive editing systems, which
                 allow users to change the state of targets such as
                 manuscripts and programs are examined. User and system
                 views of the editing process are provided, a historical
                 perspective is presented, and the functional
                 capabilities of editors are discussed, with emphasis on
                 user-level rather than implementation-level
                 considerations. References are given at the end of Part
                 II.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer software; interactive editing",
}

@Article{Meyrowitz:1982:IESb,
  author =       "Norman Meyrowitz and Andries {van Dam}",
  title =        "Interactive Editing Systems: {Part II}",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "3",
  pages =        "353--415",
  month =        sep,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356887.356890",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:12 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The state of the art of computer-based interactive
                 editing systems is surveyed. Numerous examples are
                 presented of systems in both the academic and
                 commercial arenas, covering line editors, screen
                 editors, interactive editor\slash formatters, structure
                 editors, syntax-directed editors, and commercial
                 word-processing editors. Pertinent issues in the field
                 are discussed, some observations about the future of
                 interactive editing are presented.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer software; interactive editing",
}

@Article{Furuta:1982:DFS,
  author =       "Richard Furuta and Jeffrey Scofield and Alan Shaw",
  title =        "Document Formatting Systems: {Survey}, Concepts, and
                 Issues",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "3",
  pages =        "417--472",
  month =        sep,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356887.356891",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:12 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Formatting systems are concerned with the physical
                 layout of a document for hard-and soft-copy media. This
                 paper characterize the formatting problem and its
                 relation to other aspects of document processing,
                 describes and evaluates several representative and
                 seminal systems, and discusses some issues and problems
                 relevant to future systems. The emphasis is on topics
                 related to the specification of document formats; these
                 include the underlying document and processing models,
                 functions performed by a formatter, the formatting
                 language and user interface, variety of document
                 objects, the integration of formatters with other
                 document processing tasks, and implementation
                 questions.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data processing",
}

@Article{Smith:1982:CM,
  author =       "Alan Jay Smith",
  title =        "Cache Memories",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "3",
  pages =        "473--530",
  month =        sep,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356887.356892",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:12 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The various aspects of cache memories are explained,
                 and the design features and trade-offs are discussed in
                 some detail. A large number of original, trace-driven
                 simulation results are presented. Consideration is
                 given to practical implementation questions as well as
                 to more abstract design issues. Specific aspects of
                 cache memories that are investigated include: the cache
                 fetch algorithm (demand versus prefetch), the placement
                 and replacement algorithms, line size, store-through
                 versus copy-back updating of main memory, cold-start
                 versus warm-start miss ratios, multicache consistency,
                 the effect of input\slash output through the cache, the
                 behavior of split data\slash instruction caches, and
                 cache size.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "cache memories; computer systems, digital; memory
                 structures",
}

@Article{Goldberg:1982:AILd,
  author =       "Adele J. Goldberg",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "4",
  pages =        "531--532",
  month =        dec,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356893.356894",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Marsland:1982:PSS,
  author =       "T. A. Marsland and M. Campbell",
  title =        "Parallel Search of Strongly Ordered Game Trees",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "4",
  pages =        "533--551",
  month =        dec,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356893.356895",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:39 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Over the past decade major enhancements to the
                 alpha-beta algorithm have been developed by people
                 building game-playing programs, and many of these
                 methods are surveyed and compared here. Contemporary
                 methods for searching chess game trees in parallel,
                 using an arbitrary number of independent processors are
                 studied. To make efficient use of these processors, one
                 must have a clear understanding of the basic properties
                 of the trees actually transversed when alpha-beta
                 cutoffs occur. This paper provides such insights and
                 concludes with a brief description of the author's
                 refinement to a standard parallel search algorithm for
                 this problem. 33 refs.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming",
}

@Article{Barnard:1982:CS,
  author =       "Stephen T. Barnard and Martin A. Fischler",
  title =        "Computational Stereo",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "4",
  pages =        "553--572",
  month =        dec,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356893.356896",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:39 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Computational stereo is broadly defined as the
                 recovery of the three-dimensional characteristics of a
                 scene from multiple images taken from different points
                 of view. First, each of the functional components of
                 the computational stereo paradigm --- image
                 acquisition, camera modeling, feature acquisition,
                 image matching, depth determination, and interpolation
                 --- is identified and discussed. Then, the criteria
                 that are important for evaluating the effectiveness of
                 various computational stereo techniques are presented.
                 Finally a representative sampling of computational
                 stereo research is provided.",
  acknowledgement = ack-nhfb,
  classification = "723; 741",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "pattern recognition; vision",
}

@Article{Ganapathi:1982:RCC,
  author =       "Mahadevan Ganapathi and Charles N. Fischer and John L.
                 Hennessy",
  title =        "Retargetable Compiler Code Generation",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "4",
  pages =        "573--592",
  month =        dec,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356893.356897",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:39 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Wulf:1983:SFR,Ganapathi:1983:SFRa,Fraser:1983:SFR,Ganapathi:1983:SFRb}.",
  abstract =     "A classification of automated retargetable code
                 generation techniques and a survey of the work on these
                 techniques is presented. Retargetable code generation
                 research is classified into three categories:
                 interpretive code generation, pattern-matched code
                 generation, and table-driven code generation.
                 Interpretive code generation approaches generate code
                 for a virtual machine and then expand into real target
                 code. Pattern-matched code generation approaches
                 separate the machine description from the code
                 generation algorithm. Table-driven code generation
                 approaches employ a formal machine description and use
                 a code-generator generator to produce code generators
                 automatically. An analysis of these techniques and a
                 critique of automatic code generation algorithms are
                 presented.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming languages",
}

@Article{Moret:1982:DTD,
  author =       "Bernard M. E. Moret",
  title =        "Decision Trees and Diagrams",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "4",
  pages =        "593--623",
  month =        dec,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356893.356898",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:39 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Decision trees and diagrams (also known as sequential
                 evaluation procedures) have widespread applications in
                 databases, decision table programming, concrete
                 complexity theory, switching theory, pattern
                 recognition, and taxonomy --- in short, wherever
                 discrete functions must be evaluated sequentially. In
                 this tutorial survey a common framework of definitions
                 and notation is established, the contributions of the
                 main fields of application are reviewed, recent results
                 and extensions are presented, and areas of ongoing and
                 future research are discussed.",
  acknowledgement = ack-nhfb,
  classification = "921; 922",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "I35 decision trees, decision theory and analysis;
                 mathematical techniques --- Trees",
}

@Article{Peterson:1982:SFI,
  author =       "James L. Peterson",
  title =        "Surveyor's Forum: {Idiomatic} Programming",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "4",
  pages =        "625--625",
  month =        dec,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356893.356899",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Feuer:1982:CPL,Feuer:1982:SFI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Feuer:1982:SFI,
  author =       "Alan R. Feuer and Narain H. Gehani",
  title =        "Surveyor's Forum: {Idiomatic} Programming",
  journal =      j-COMP-SURV,
  volume =       "14",
  number =       "4",
  pages =        "625--626",
  month =        dec,
  year =         "1982",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356893.356900",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:31:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Feuer:1982:CPL,Peterson:1982:SFI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1983:AILa,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356901.356902",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:32:05 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Andrews:1983:CNC,
  author =       "Gregory R. Andrews and Fred B. Schneider",
  title =        "Concepts and Notations for Concurrent Programming",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "1",
  pages =        "3--43",
  month =        mar,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356901.356903",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:32:05 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Atkins:1983:SFN,Andrews:1983:SFN,Andrews:1983:CCN}.",
  abstract =     "This paper identifies the major concepts of concurrent
                 programming and describes some of the more important
                 language notations for writing concurrent programs. The
                 roles of processes, communication, and synchronization
                 are discussed. Language notations for expressing
                 concurrent execution and for specifying process
                 interaction are surveyed. Synchronization primitives
                 based on shared variables and on message passing are
                 described. Finally, three general classes of concurrent
                 programming languages are identified and compared.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming",
}

@Article{March:1983:TSD,
  author =       "Salvatore T. March",
  title =        "Techniques for Structuring Database Records",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "1",
  pages =        "45--79",
  month =        mar,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356901.356904",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:32:05 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Structuring database records by considering data item
                 usage can yield substantial efficiencies in the
                 operating cost of database systems. However, since the
                 number of possible physical record structures for
                 database of practical significance is enormous, and
                 their evaluation is extremely complex, determining
                 efficient record structures by full enumeration is
                 generally infeasible. This paper discusses the
                 techniques of mathematical clustering, iterative
                 grouping refinement, mathematical programming, and
                 hierarchic aggregation, which can be used to quickly
                 determine efficient record structures for large, shared
                 databases.",
  acknowledgement = ack-nhfb,
  annote =       "First segmentation, then clustering (dedicated vs.
                 paged, Seq. vs. sec. indexes (partial and all)),
                 hierarchical aggregation.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database systems",
}

@Article{Kollias:1983:SFF,
  author =       "J. (Yiannis) G. Kollias and Michalis Hatzopoulos",
  title =        "Surveyor's Forum: {The} File Assignment Problem",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "1",
  pages =        "81--82",
  month =        mar,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356901.356905",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:32:05 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Dowdy:1982:CMF,Dowdy:1983:SFF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dowdy:1983:SFF,
  author =       "Lawrence W. Dowdy and Derrell V. Foster",
  title =        "Surveyor's Forum: {The} File Assignment Problem",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "1",
  pages =        "82--82",
  month =        mar,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356901.356906",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:32:05 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Dowdy:1982:CMF,Kollias:1983:SFF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sharma:1983:SFI,
  author =       "Govind Sharma",
  title =        "Surveyor's Forum: {Image} Models",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "1",
  pages =        "83--84",
  month =        mar,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356901.356907",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:32:05 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Ahuja:1981:IM,Ahuja:1983:SFI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ahuja:1983:SFI,
  author =       "Narendra Ahuja and B. J. Schachter",
  title =        "Surveyor's Forum: {Image} Models",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "1",
  pages =        "84--84",
  month =        mar,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356901.356908",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:32:05 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Ahuja:1981:IM,Sharma:1983:SFI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

%%% ====================================================================
%%% NB: The ISSN changed from 0010-4892 to 0360-0300 at the June 1983
%%% issue, for no obvious reason: the journal title is exactly the same.
%%% ====================================================================
@Article{Wasserman:1983:AILb,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "2",
  pages =        "85--86",
  month =        jun,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356909.356910",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1983:EP,
  author =       "Anthony I. Wasserman",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "2",
  pages =        "87--94",
  month =        jun,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356909.356911",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Broomell:1983:CCH,
  author =       "George Broomell and J. Robert Heath",
  title =        "Classification Categories and Historical Development
                 of Circuit Switching Topologies",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "2",
  pages =        "95--133",
  month =        jun,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356909.356912",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:27 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1983.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A broad tutorial survey is given of the various
                 topologies available for use in circuit switching
                 systems for tightly coupled parallel\slash distributed
                 computer systems. Terminology and issues of circuit
                 switching as related to parallel\slash distributed
                 processing are first discussed. Circuit switching
                 networks are then classified according to connection
                 capability, topological geometry, and basis of
                 development. Topological relationships of specific
                 networks are addressed.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  country =      "USA",
  date =         "01/11/83",
  descriptors =  "Switching; circuit switching; survey",
  enum =         "416",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer systems, digital",
  language =     "English",
  references =   "0",
}

@Article{Voydock:1983:SMH,
  author =       "Victor L. Voydock and Stephen T. Kent",
  title =        "Security Mechanisms in High-Level Network Protocols",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "2",
  pages =        "135--171",
  month =        jun,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356909.356913",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:27 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The implications of adding security mechanisms to
                 high-level network protocols operating in an
                 open-system environment are analyzed. First the threats
                 to security that may arise in such an environment are
                 described, and then a set of goals for communications
                 security measures is established. This is followed by a
                 brief description of the two basic approaches to
                 communications security, link-oriented measures and
                 end-to-end measures, which concludes that end-to-end
                 measures are more appropriate in an open-system
                 environment. Next, relevant properties of data
                 encryption --- the fundamental technique on which all
                 communications security mechanisms are based --- are
                 discussed. The remainder of the paper describes how
                 end-to-end measures can be used to achieve each of the
                 security goals previously established.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "security os networks, computer networks",
}

@Article{Wasserman:1983:AILc,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "3",
  pages =        "173--174",
  month =        sep,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356914.356915",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:37 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Abadir:1983:FTS,
  author =       "Magdy S. Abadir and Hassan K. Reghbati",
  title =        "Functional Testing of Semiconductor Random Access
                 Memories",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "3",
  pages =        "175--198",
  month =        sep,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356914.356916",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:37 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "An overview is presented of the problem of testing
                 semiconductor random access memories (RAMs). An
                 important aspect of this test procedure is the
                 detection of permanent faults that cause the memory to
                 function incorrectly. Functional-level fault models are
                 very useful for describing a wide variety of RAM
                 faults. Several fault models are discussed, including
                 the stuck-at-0/1 faults, coupled-cell faults, and
                 single-cell pattern-sensitive faults. Test procedures
                 for these fault models are presented and their fault
                 coverage and execution times are discussed. The paper
                 is intended for the general computer science audience
                 and presupposes no background in the hardware testing
                 area.",
  acknowledgement = ack-nhfb,
  classification = "714; 721; 722",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data storage, digital --- Random Access; data storage,
                 semiconductor",
}

@Article{Partsch:1983:PTS,
  author =       "H. Partsch and R. Steinbr{\"u}ggen",
  title =        "Program Transformation Systems",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "3",
  pages =        "199--236",
  month =        sep,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356914.356917",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:37 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/Dcs-1.0.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This paper reviews and classifies transformation
                 systems and is intended to acquaint the reader with the
                 current state of the art and provide a basis for
                 comparing the different approaches. It is also designed
                 to provide easy access to specific details of the
                 various methodologies.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming",
}

@Article{Angluin:1983:IIT,
  author =       "Dana Angluin and Carl H. Smith",
  title =        "Inductive Inference: {Theory} and Methods",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "3",
  pages =        "237--269",
  month =        sep,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356914.356918",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:37 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "There has been a great deal of theoretical and
                 experimental work in computer science on inductive
                 inference systems, that is, systems that try to infer
                 general rules from examples. However a complete and
                 applicable theory of such systems is still a distant
                 goal. This survey highlights and explains the main
                 ideas that have been developed in the study of
                 inductive inference, with special emphasis on the
                 relations between the general theory and the specific
                 algorithms and implementations.",
  acknowledgement = ack-nhfb,
  classification = "723; 912",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "systems science and cybernetics",
}

@Article{Lientz:1983:ISM,
  author =       "Bennet P. Lientz",
  title =        "Issues in Software Maintenance",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "3",
  pages =        "271--278",
  month =        sep,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356914.356919",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:37 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Some of the major issues that surfaced during several
                 extensive operational software studies are highlighted.
                 These studies have raised significant questions about
                 the roles of the users in operations and maintenance,
                 the management of maintenance, and the kinds of tools
                 and techniques that are needed for maintenance.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer software",
}

@Article{Wulf:1983:SFR,
  author =       "William A. Wulf and Joe Newcomer and Bruce Leverett
                 and Rick Cattell and Paul Knueven",
  title =        "Surveyor's Forum: {Retargetable} Code Generators",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "3",
  pages =        "279--280",
  month =        sep,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356914.356920",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:37 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  note =         "See
                 \cite{Ganapathi:1982:RCC,Ganapathi:1983:SFRa,Fraser:1983:SFR,Ganapathi:1983:SFRb}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ganapathi:1983:SFRa,
  author =       "M. Ganapathi and J. L. Hennessy and C. N. Fischer",
  title =        "Surveyor's Forum: {Retargetable} Code Generators",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "3",
  pages =        "280--281",
  month =        sep,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356914.356921",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:37 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  note =         "See
                 \cite{Ganapathi:1982:RCC,Wulf:1983:SFR,Fraser:1983:SFR,Ganapathi:1983:SFRb}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fraser:1983:SFR,
  author =       "Christopher W. Fraser",
  title =        "Surveyor's Forum: {Retargetable} Code Generators",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "3",
  pages =        "281--283",
  month =        sep,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356914.356922",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:37 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  note =         "See
                 \cite{Ganapathi:1982:RCC,Wulf:1983:SFR,Ganapathi:1983:SFRa,Ganapathi:1983:SFRb}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ganapathi:1983:SFRb,
  author =       "M. Ganapathi and J. L. Hennessy and C. N. Fischer",
  title =        "Surveyor's Forum: {Retargetable} Code Generators",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "3",
  pages =        "283--284",
  month =        sep,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356914.356923",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:32:37 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  note =         "See
                 \cite{Ganapathi:1982:RCC,Wulf:1983:SFR,Ganapathi:1983:SFRa,Fraser:1983:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1983:AILd,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "4",
  pages =        "285--286",
  month =        dec,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289.357839",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:07 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Haerder:1983:PTO,
  author =       "Theo Haerder and Andreas Reuter",
  title =        "Principles of Transaction Oriented Database Recovery",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "4",
  pages =        "287--317",
  month =        dec,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289.291",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:07 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Also published in/as: Res. R No. 50-82, April 1982.
                 Reprinted in M. Stonebraker, Readings in Database
                 Systems, Morgan Kaufmann, San Mateo, CA, 1988",
  abstract =     "A terminological framework is provided for describing
                 different transaction-oriented recovery schemes for
                 database systems in a conceptual rather than an
                 implementation-dependent way. By introducing the terms
                 materialized database, propagation strategy, and
                 checkpoint, we obtain a means for classifying arbitrary
                 implementations from a unified viewpoint. This is
                 complemented by a classification scheme for logging
                 techniques, which are precisely defined by using the
                 other terms. It is shown that these criteria are
                 related to all relevant questions such as speed and
                 scope of recovery and amount of redundant information
                 required. In addition, an adequate and precise
                 terminology is established for this topic.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database systems, dblit transactions recovery
                 reliability",
}

@Article{King:1983:CVD,
  author =       "John Leslie King",
  title =        "Centralized versus decentralized
                 computing:organizational considerations and management
                 options",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "4",
  pages =        "319--349",
  month =        dec,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289.290",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:07 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/misc.1.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The long-standing debate over whether to centralize or
                 decentralize computing is examined in terms of the
                 fundamental organizational and economic factors at
                 stake. The traditional debate is evaluated, and found
                 to focus predominantly on issues of efficiency versus
                 effectiveness, with solutions based on a rationalistic
                 strategy of optimizing in this trade-off. A behavioral
                 assessment suggests that the driving issues in the
                 debate are the politics of organization and resources,
                 centering on the issue of control. The economics of
                 computing deployment decisions are presented as an
                 important issue, but one that often serves as a field
                 of argument in which political concerns are dealt with.
                 The debate in this light appears to be unresolvable in
                 the long run, although effective strategies can be
                 developed when the larger issues are recognized. The
                 current situation facing managers of computing, given
                 the advent of small and comparatively inexpensive
                 computers, is examined in detail, and a set of
                 management options for dealing with this persistent
                 issue is presented.",
  acknowledgement = ack-nhfb,
  classification = "722; 723; 912",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computers, digital; management",
}

@Article{Lee:1983:VRS,
  author =       "D. L. Lee and F. H. Lochovsky",
  title =        "Voice Response Systems",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "4",
  pages =        "351--374",
  month =        dec,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289.292",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:07 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Common techniques for representing speech in voice
                 response systems are surveyed. Two major classes of
                 techniques --- waveform coding and parametric coding
                 --- and their variants are presented. The encoding,
                 decoding, and synthesis techniques as well as the
                 advantages and disadvantages of each method are
                 discussed. Also surveyed are two types of voice
                 response systems: systems with limited vocabulary and
                 systems with unlimited vocabulary. Some examples of the
                 latter type of system are described and discussed.
                 Finally, some applications of voice response systems
                 are discussed.",
  acknowledgement = ack-nhfb,
  classification = "751",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; theory, speech",
  review =       "ACM CR 8411-0897",
  subject =      "B.4.2 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
                 Input/Output Devices, Voice \\ I.5 Computing
                 Methodologies, PATTERN RECOGNITION, Applications",
}

@Article{Atkins:1983:SFN,
  author =       "M. Stella Atkins",
  title =        "Surveyor's Forum: Notations for Concurrent
                 Programming",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "4",
  pages =        "375--376",
  month =        dec,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289.357841",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:07 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Andrews:1983:CNC,Andrews:1983:SFN,Andrews:1983:CCN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Andrews:1983:SFN,
  author =       "Gregory R. Andrews and Fred B. Schneider",
  title =        "Surveyor's Forum: Notations for Concurrent
                 Programming",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "4",
  pages =        "376--377",
  month =        dec,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289.357842",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:07 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Andrews:1983:CNC,Atkins:1983:SFN,Andrews:1983:CCN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Andrews:1983:CCN,
  author =       "Gregory R. Andrews and Fred B. Schneider",
  title =        "Corrigenda: {``Concepts and notations for concurrent
                 programs''}",
  journal =      j-COMP-SURV,
  volume =       "15",
  number =       "4",
  pages =        "377--377",
  month =        dec,
  year =         "1983",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289.357845",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:07 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Andrews:1983:CNC,Atkins:1983:SFN,Andrews:1983:SFN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1984:AILa,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/861.360084",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:31 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Stallings:1984:LN,
  author =       "William Stallings",
  title =        "Local Networks",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "1",
  pages =        "3--41",
  month =        mar,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/861.871",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:31 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/networking.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The rapidly evolving field of local network technology
                 has produced a steady stream of local network products
                 in recent years. The IEEE 802 standards that are now
                 taking shape, because of their complexity, do little to
                 narrow the range of alternative technical approaches
                 and at the same time encourage more vendors into the
                 field. The purpose of this paper is to present a
                 systematic, organized overview of the alternative
                 architectures for and design approaches to local
                 networks.\par

                 The key elements that determine the cost and
                 performance of a local network are its topology,
                 transmission medium, and medium access control
                 protocol. Transmission media include twisted pair,
                 baseband and broadband coaxial cable, and optical
                 fiber. Topologies include bus, tree, and ring. Medium
                 access control protocols include CSMA/CD, token bus,
                 token ring, register insertion, and slotted ring. Each
                 of these areas is examined in detail, comparisons are
                 drawn between competing technologies, and the current
                 status of standards is reported.",
  acknowledgement = ack-nhfb,
  classification = "723; 902",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer networks; standards",
}

@Article{Kurose:1984:MAP,
  author =       "James F. Kurose and Mischa Schwartz and Yechiam
                 Yemini",
  title =        "Multiple-Access Protocols and Time-Con\-strained
                 Communication",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "1",
  pages =        "43--70",
  month =        mar,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/861.870",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:31 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/networking.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "During the past ten years, the field of
                 multiple-access communication has developed into a
                 major area of both practical and theoretical interest
                 within the field of computer communications. The
                 multiple-access problem arises from the necessity of
                 sharing a single communication channel among a
                 community of distributed users. The distributed
                 algorithm used by the stations to share the channel is
                 known as the multiple-access protocol. In this paper we
                 examine the multiple-access problem and various
                 approaches to its resolution.\par

                 In this survey we first define the multiple-access
                 problem and then present the underlying issues and
                 difficulties in achieving multiple-access
                 communication. A taxonomy for multiple-access protocols
                 is then developed in order to characterize common
                 approaches and to provide a framework within which
                 these protocols can be compared and contrasted.
                 Different proposed protocols are then described and
                 discussed, and aspects of their performance are
                 examined. The use of multiple-access protocols for
                 'real- time' or 'time-constrained' communication
                 applications, such as voice transmission, is examined
                 next. Issues in time-constrained communication are
                 identified, and recent work in the design of
                 time-constrained multiple-access protocols is
                 surveyed.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer networks; multiple-access protocols;
                 real-time communication; time-constrained
                 communication, time-constrained",
}

@Article{Kim:1984:HAS,
  author =       "Won Kim",
  title =        "Highly Available Systems for Database Applications",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "1",
  pages =        "71--98",
  month =        mar,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/861.866",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:31 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "As users entrust more and more of their applications
                 to computer systems, the need for systems that are
                 continuously operational (24 hours per day) has become
                 even greater. This paper presents a survey and analysis
                 of representative architectures and techniques that
                 have been developed for constructing highly available
                 systems for database applications. It then proposes a
                 design of a distributed software subsystem that can
                 serve as a unified framework for constructing database
                 application systems that meet various requirements for
                 high availability.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "concurrency control; database recovery; database
                 systems; relational database",
}

@Article{Wasserman:1984:AILb,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "2",
  pages =        "99--100",
  month =        jun,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356924.356925",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1984:AAa,
  author =       "Anthony I. Wasserman",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "2",
  pages =        "101--102",
  month =        jun,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356924.356926",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1984:EP,
  author =       "Anthony I. Wasserman",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "2",
  pages =        "103--110",
  month =        jun,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356924.356927",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jarke:1984:QOD,
  author =       "Matthias Jarke and J{\"u}rgen Koch",
  title =        "Query Optimization in Database Systems",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "2",
  publisher =    "acm",
  pages =        "111--152",
  month =        jun,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356924.356928",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:52 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Efficient methods of processing unanticipated queries
                 are a crucial prerequisite for the success of
                 generalized database management systems. A wide variety
                 of approaches to improve the performance of query
                 evaluation algorithms have been proposed: logic-based
                 and semantic transformations, fast implementations of
                 basic operations, and combinatorial or heuristic
                 algorithms for generating alternative access plans and
                 choosing among them.\par

                 These methods are presented in the framework of a
                 general query evaluation procedure using the relational
                 calculus representation of queries. In addition,
                 nonstandard query optimization issues such as higher
                 level query evaluation, query optimization in
                 distributed databases, and use of database machines are
                 addressed. The focus, however, is on query optimization
                 in centralized database systems.",
  acknowledgement = ack-nhfb,
  affiliation =  "New York Univ, Graduate Sch of Business
                 Administration, New York, NY, USA",
  affiliationaddress = "New York Univ, Graduate Sch of Business
                 Administration, New York, NY, USA",
  annote =       "Representation, transformation, mapping to elementary
                 operations, choice.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Algorithms; database implementation; performance;
                 query evaluation; query optimization; query
                 simplification, database systems; relational
                 calculation",
  owner =        "manning",
}

@Article{Gallaire:1984:LDD,
  author =       "Herv{\'e} Gallaire and Jack Minker and Jean-Marie
                 Nicolas",
  title =        "Logic and Databases: a Deductive Approach",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "2",
  pages =        "153--185",
  month =        jun,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356924.356929",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:52 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The purpose of this paper is to show that logic
                 provides a convenient formalism for studying classical
                 database problems. There are two main parts to the
                 paper, devoted respectively to conventional databases
                 and deductive databases. In the first part, we focus on
                 query languages, integrity modeling and maintenance,
                 query optimization, and data dependencies. The second
                 part deals mainly with the representation and
                 manipulation of deduced facts and incomplete
                 information.",
  acknowledgement = ack-nhfb,
  affiliation =  "Compagnie Generale d'{\'E}lectricit{\'e}, Lab de
                 Marcoussis, Marcoussis, Fr",
  affiliationaddress = "Compagnie Generale d'{\'E}lectricit{\'e}, Lab de
                 Marcoussis, Marcoussis, Fr",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer metatheory --- Formal Logic; Deductive
                 Databases; deductive databases; Indefinite Data;
                 indefinite data; Logic and Databases; Null Values;
                 relational databases; Relational Databases, database
                 systems",
  owner =        "curtis",
}

@Article{Samet:1984:QRH,
  author =       "Hanan Samet",
  title =        "The Quadtree and Related Hierarchical Data
                 Structures",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "2",
  pages =        "187--260",
  month =        jun,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356924.356930",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:33:52 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A tutorial survey is presented of the quadtree and
                 related hierarchical data structures. They are based on
                 the principle of recursive decomposition. The emphasis
                 is on the representation of data used in applications
                 in image processing, computer graphics, geographic
                 information systems, and robotics. There is a greater
                 emphasis on region data (i.e., two-dimensional shapes)
                 and to a lesser extent on point, curvilinear, and
                 three-dimensional data. A number of operations in which
                 such data structures find use are examined in greater
                 detail.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland, at College Point, Computer Science
                 Dep, College Park, MD, USA",
  affiliationaddress = "Univ of Maryland, at College Point, Computer
                 Science Dep, College Park, MD, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer graphics; Data Structures; database systems;
                 geographic information systems; hierarchical data
                 structures; I35 Quadtrees, data processing; image
                 databases; image processing; pattern recognition;
                 quadtree; robotics",
}

@Article{Wasserman:1984:ATIc,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "3",
  pages =        "261--262",
  month =        sep,
  year =         "1984",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:14:56 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1984:AAb,
  author =       "Anthony I. Wasserman",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "3",
  pages =        "263--264",
  month =        sep,
  year =         "1984",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:21:25 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shneiderman:1984:RTD,
  author =       "Ben Shneiderman",
  title =        "Response Time and Display Rate in Human Performance
                 with Computers",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "3",
  pages =        "265--285",
  month =        sep,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2514.2517",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:34:24 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This paper reviews the theory and reports on
                 experimental results concerning display rates, response
                 time expectations and attitudes, user productivity, and
                 variability. The decomposition of concerns and tasks
                 helps to clarify the issues, but substantial effort
                 remains before a predictive model can emerge. In
                 general, the results indicate that frequent users
                 prefer response times of less than a second for most
                 tasks, and that productivity does increase as response
                 time decreases. However, error rates increase with too
                 short or too long a response time. Users pick up the
                 pace of the system, but the profile of commands may
                 change with the speed of the system.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland, Dep of Computer Science, College
                 Park, MD, USA",
  affiliationaddress = "Univ of Maryland, Dep of Computer Science,
                 College Park, MD, USA",
  classification = "461; 722; 723; 901",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer interfaces; computer programming; computer
                 systems, digital --- Interactive Operation; display
                 rate; human engineering; human/computer interaction;
                 response time",
}

@Article{Bitton:1984:TPS,
  author =       "Dina Bitton and David J. DeWitt and David K. Hsiao and
                 Jaishankar Menon",
  title =        "A Taxonomy of Parallel Sorting",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "3",
  pages =        "287--318",
  month =        sep,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2514.2516",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:34:24 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The authors propose a taxonomy of parallel sorting
                 that encompasses a broad range of array-and
                 file-sorting algorithms. They analyze how research on
                 parallel sorting has evolved, from the earliest sorting
                 networks to shared memory algorithms and VLSI sorters.
                 In the context of sorting networks, the authors
                 describe two fundamental parallel merging schemes: the
                 odd-even and the bitonic merge. They discuss sorting
                 algorithms that evolved from these merging schemes for
                 parallel computers, whose processors communicate
                 through interconnection networks such as the perfect
                 shuffle, the mesh, and a number of other sparse
                 networks. They describe how faster algorithms have been
                 derived from parallel enumeration sorting schemes,
                 where, with a shared memory model of parallel
                 computation, keys are first ranked and then rearranged
                 according to their rank. Parallel sorting algorithms
                 are evaluated according to several criteria related to
                 both the time complexity of an algorithm and its
                 feasibility from the viewpoint of computer
                 architecture.",
  acknowledgement = ack-nhfb,
  affiliation =  "Weizmann Inst of Science, Dep of Applied Mathematics,
                 Rehovot, Isr",
  affiliationaddress = "Weizmann Inst of Science, Dep of Applied
                 Mathematics, Rehovot, Isr",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "bitonic merge sorting, prll; computer systems
                 programming; computer systems, digital --- Parallel
                 Processing; odd-even sorting; parallel sorting;
                 Sorting; sorting",
}

@Article{Quinn:1984:PGA,
  author =       "Michael J. Quinn and Narsingh Deo",
  title =        "Parallel Graph Algorithms",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "3",
  pages =        "319--348",
  month =        sep,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2514.2515",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:34:24 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Algorithms and data structures developed to solve
                 graph problems on parallel computers are surveyed. The
                 problems discussed relate to searching graphs and
                 finding connected components, maximal cliques, maximum
                 cardinality matchings, minimum spanning trees, shortest
                 paths, and traveling salesman tours. The algorithms are
                 based on a number of models of parallel computation,
                 including systolic arrays, associative processors,
                 array processors, and multiple CPU computers. The most
                 popular model is a direct extension of the standard RAM
                 model of sequential computation. It may not, however,
                 be the best basis for the study of parallel algorithms.
                 More emphasis has been focused recently on
                 communications issues in the analysis of the complexity
                 of parallel algorithms; thus parallel models are coming
                 to be more complementary to implementable
                 architectures. Most algorithms use relatively simple
                 data structures, such as the adjacency matrix and
                 adjacency lists, although a few algorithms using linked
                 lists, heaps, and trees are also discussed.",
  acknowledgement = ack-nhfb,
  affiliation =  "Washington State Univ, Computer Science Dep, Pullman,
                 WA, USA",
  affiliationaddress = "Washington State Univ, Computer Science Dep,
                 Pullman, WA, USA",
  classification = "722; 723; 921",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Algorithms; computer programming; computer systems,
                 digital --- Parallel Processing; mathematical
                 techniques --- Graph Theory; parallel graph
                 algorithms",
}

@Article{Wasserman:1984:ATId,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "4",
  pages =        "349--350",
  month =        dec,
  year =         "1984",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:21:25 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1984:AAc,
  author =       "Anthony I. Wasserman",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "4",
  pages =        "351--351",
  month =        dec,
  year =         "1984",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:21:25 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Svobodova:1984:FSN,
  author =       "Liba Svobodova",
  title =        "File Servers for Network-Based Distributed Systems",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "4",
  pages =        "353--398",
  month =        dec,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3872.3873",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:34:36 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A file server provides remote centralized storage of
                 data to workstations connected to it via a
                 communication network; it facilitates data sharing
                 among autonomous workstations and support of
                 inexpensive workstations that have limited or no
                 secondary storage. Various characteristics of file
                 servers and the corresponding implementation issues
                 based on a survey of a number of experimental file
                 servers are discussed and evaluated in this paper.
                 Particular emphasis is placed on the problem of atomic
                 update of data stored in a file server. The design
                 issues related to the scope of atomic transactions and
                 the granularity of data access supported by a file
                 server are studied in detail.",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM, Zurich Research Lab, Rueschlikon, Switz",
  affiliationaddress = "IBM, Zurich Research Lab, Rueschlikon, Switz",
  annote =       "Mainly WFS (Woodstock), XDFS, CFS (Cambridge), FELIX,
                 SWALLOW, CMCFS, ALPINE; also Datacomputer, IFS, ACORN,
                 Z-ring (Zurich), VICE (CMU-ITC), LOCUS, DOMAIN
                 (Apollo), F-UNIX, R*, ENCOMPASS.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer operating systems; computer systems, digital
                 --- Distributed; design; file servers; network-based
                 distributed systems; reliability, computer networks",
  review =       "ACM CR 8601-0037",
  subject =      "C.2.2 Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
                 Protocol architecture \\ D.4.1 Software, OPERATING
                 SYSTEMS, Process Management, Concurrency \\ D.4.1
                 Software, OPERATING SYSTEMS, Process Management,
                 Deadlocks \\ D.4.2 Software, OPERATING SYSTEMS, Storage
                 Management, Allocation/deallocation strategies \\ D.4.3
                 Software, OPERATING SYSTEMS, File Systems Management,
                 Distributed file systems \\ D.4.3 Software, OPERATING
                 SYSTEMS, File Systems Management, File organization",
}

@Article{Yu:1984:DQP,
  author =       "C. T. Yu and C. C. Chang",
  title =        "Distributed Query Processing",
  journal =      j-COMP-SURV,
  volume =       "16",
  number =       "4",
  pages =        "399--433",
  month =        dec,
  year =         "1984",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3872.3874",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:34:36 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Various techniques for optimizing queries in
                 distributed databases are presented. Although no
                 attempt is made to cover all proposed algorithms on
                 this topic, quite a few ideas extracted from existing
                 algorithms are outlined. It is hoped that large-scale
                 experiments will be conducted to verify the usefulness
                 of these ideas and that they will be integrated to
                 construct a powerful algorithm for distributed query
                 processing.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Illinois at Chicago Circle, Dep of Electrical
                 Engineering \& Computer Science, Chicago, IL, USA",
  affiliationaddress = "Univ of Illinois at Chicago Circle, Dep of
                 Electrical Engineering \& Computer Science, Chicago,
                 IL, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming --- Algorithms; CTYU
                 optimization, database systems; Distributed;
                 distributed query processing; heuristic algorithms;
                 query optimization; semijoins",
}

@Article{Wasserman:1985:ATIa,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1985",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:25:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1985:AAa,
  author =       "Anthony I. Wasserman",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "1",
  pages =        "3--4",
  month =        mar,
  year =         "1985",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:25:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gupta:1985:RRD,
  author =       "Gopal K. Gupta and Ron Sacks-Davis and Peter E.
                 Tischer",
  title =        "A Review of Recent Developments in Solving {ODEs}",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "1",
  pages =        "5--47",
  month =        mar,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/4078.4079",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:34:46 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/4079.html",
  abstract =     "Mathematical models when simulating the behavior of
                 physical, chemical, and biological systems often
                 include one or more ordinary differential equations
                 (ODEs). To study the system behavior predicted by a
                 model, these equations are usually solved numerically.
                 Although many of the current methods for solving ODEs
                 were developed around the turn of the century, the past
                 15 years or so has been a period of intensive research.
                 The emphasis of this survey is on the methods and
                 techniques used in software for solving ODEs. ODEs can
                 be classified as stiff or nonstiff, and may be stiff
                 for some parts of an interval and nonstiff for others.
                 We discuss stiff equations, why they are difficult to
                 solve, and methods and software for solving both
                 nonstiff and stiff equations. We conclude this review
                 by looking at techniques for dealing with special
                 problems that may arise in some ODEs, for example,
                 discontinuities. Although important theoretical
                 developments have also taken place, we report only
                 those developments which have directly affected the
                 software and provide a review of this research. We
                 present the basic concepts involved but assume that the
                 reader has some background in numerical computing, such
                 as a first course in numerical methods.",
  acknowledgement = ack-nhfb,
  affiliation =  "Monash Univ, Dep of Computer Science, Clayton, Aust",
  affiliationaddress = "Monash Univ, Dep of Computer Science, Clayton,
                 Aust",
  classification = "723; 921",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer software; Differential Equations;
                 mathematical software, algorithms; mathematical
                 techniques; numerical methods; ordinary differential
                 equations; performance; theory",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Faloutsos:1985:AMT,
  author =       "Christos Faloutsos",
  title =        "Access Methods for Text",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "1",
  pages =        "49--74",
  month =        mar,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/4078.4080",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:34:46 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Also published in/as: ``{Multiattribute} Hashing Using
                 Gray Codes'', ACM SIGMOD, 1986.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/4080.html",
  abstract =     "This paper compares text retrieval methods intended
                 for office systems. The operational requirements of the
                 office environment are discussed, and retrieval methods
                 from database systems and from information retrieval
                 systems are examined. We classify these methods and
                 examine the most interesting representatives of each
                 class. Attempts to speed up retrieval with special
                 purpose hardware are also presented, and issues such as
                 approximate string matching and compression are
                 discussed. A qualitative comparison of the examined
                 methods is presented. The signature file method is
                 discussed in more detail.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Toronto, Computer Systems Research Inst,
                 Toronto, Ont, Can",
  affiliationaddress = "Univ of Toronto, Computer Systems Research Inst,
                 Toronto, Ont, Can",
  annote =       "Signature files.",
  classification = "723; 901",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database systems; design, information science;
                 document retrieval; Information Retrieval; office
                 automation; text retrieval",
  review =       "ACM CR 8601-0058",
  subject =      "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
                 AND RETRIEVAL, Information Search and Retrieval. {\bf
                 H.2.2}: Information Systems, DATABASE MANAGEMENT,
                 Physical Design, Access methods. {\bf H.3.6}:
                 Information Systems, INFORMATION STORAGE AND RETRIEVAL,
                 Library Automation. {\bf H.4.1}: Information Systems,
                 INFORMATION SYSTEMS APPLICATIONS, Office Automation.
                 {\bf I.7.m}: Computing Methodologies, TEXT PROCESSING,
                 Miscellaneous.",
}

@Article{Besl:1985:TDO,
  author =       "Paul J. Besl and Ramesh C. Jain",
  title =        "Three-Dimensional Object Recognition",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "1",
  pages =        "75--145",
  month =        mar,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/4078.4081",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:34:46 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/Reverse.eng.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/4081.html",
  abstract =     "A general purpose computer vision system must be
                 capable of recognizing three-dimensional (3-D) objects.
                 This paper proposes a precise definition of the 3-D
                 object recognition problem, discusses basic concepts
                 associated with this problem, and reviews the relevant
                 literature. Because range images (or depth maps) are
                 often used as sensor input instead of intensity images,
                 techniques for obtaining, processing, and
                 characterizing range data are also surveyed.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Michigan, Dep of Electrical Engineering \&
                 Computer Science, Ann Arbor, MI, USA",
  affiliationaddress = "Univ of Michigan, Dep of Electrical Engineering
                 \& Computer Science, Ann Arbor, MI, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; computer vision; design; image processing;
                 scene analysis; theory, pattern recognition;
                 three-dimensional object recognition",
  subject =      "{\bf I.5.4}: Computing Methodologies, PATTERN
                 RECOGNITION, Applications, Computer vision. {\bf
                 I.2.10}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding,
                 Intensity, color, photometry, and thresholding. {\bf
                 I.2.10}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding, Modeling
                 and recovery of physical attributes. {\bf I.2.10}:
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Vision and Scene Understanding, Perceptual reasoning.
                 {\bf I.2.10}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding,
                 Representations, data structures, and transforms. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations. {\bf
                 I.4.6}: Computing Methodologies, IMAGE PROCESSING,
                 Segmentation, Edge and feature detection. {\bf I.4.6}:
                 Computing Methodologies, IMAGE PROCESSING,
                 Segmentation, Pixel classification. {\bf I.4.6}:
                 Computing Methodologies, IMAGE PROCESSING,
                 Segmentation, Region growing, partitioning. {\bf
                 I.4.8}: Computing Methodologies, IMAGE PROCESSING,
                 Scene Analysis, Depth cues. {\bf I.4.8}: Computing
                 Methodologies, IMAGE PROCESSING, Scene Analysis, Range
                 data.",
}

@Article{Abbott:1985:GEI,
  author =       "Curtis Abbott",
  title =        "{Guest Editor}'s Introduction to the Special Issue on
                 Computer Music",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "2",
  pages =        "147--151",
  month =        jun,
  year =         "1985",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:25:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1985:AAb,
  author =       "Anthony I. Wasserman",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "2",
  pages =        "153--154",
  month =        jun,
  year =         "1985",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:25:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1985:EP,
  author =       "Anthony I. Wasserman",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "2",
  pages =        "155--162",
  month =        jun,
  year =         "1985",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:25:27 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Roads:1985:RMA,
  author =       "Curtis Roads",
  title =        "Research in Music and Artificial Intelligence",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "2",
  pages =        "163--190",
  month =        jun,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/4468.4469",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:05 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/4469.html",
  abstract =     "Although the boundaries of artificial intelligence
                 (AI) remain elusive, computers can now perform musical
                 tasks that were formerly associated exclusively with
                 naturally intelligent musicians. After a historical
                 note, this paper sermonizes on the need for AI
                 techniques in four areas of musical research:
                 composition, performance, music theory, and digital
                 sound processing. The next part surveys recent work
                 involving AI and music. The discussion concentrates on
                 applications in the four areas of research just
                 mentioned. The final part examines how AI techniques of
                 planning and learning could be used to expand the
                 knowledge base and enrich the behavior of musically
                 intelligent systems.",
  acknowledgement = ack-nhfb,
  affiliation =  "MIT, Cambridge, MA, USA",
  affiliationaddress = "MIT, Cambridge, MA, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer music; computers, digital --- Applications;
                 design; experimentation, artificial intelligence",
  subject =      "{\bf J.5}: Computer Applications, ARTS AND HUMANITIES,
                 Music. {\bf I.2.1}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Applications and Expert Systems.",
}

@Article{Gordon:1985:SAC,
  author =       "John W. Gordon",
  title =        "System Architectures for Computer Music",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "2",
  pages =        "191--233",
  month =        jun,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/4468.4996",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:05 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/4996.html",
  abstract =     "Computer music is a relatively new field. While a
                 large proportion of the public is aware of computer
                 music in one form or another, there seems to be a need
                 for a better understanding of its capabilities and
                 limitations in terms of synthesis, performance, and
                 recording hardware. This article addresses that need by
                 surveying and discussing the architecture of existing
                 computer music systems. System requirements vary
                 according to what the system will be used for. Common
                 uses for computer music systems include composition,
                 performance, research, home entertainment, and studio
                 recording/mixing. This paper outlines system components
                 with this wide diversity of possible uses in mind.
                 Current synthesis and analysis techniques, and the
                 different way in which these techniques can be
                 implemented in special-purpose hardware, are
                 comprehensively reviewed. Design specifications are
                 given for certain digital-to-analog (and
                 analog-to-digital) converters, disk interfaces, system
                 organization, control hardware and software, and
                 numerical precision. Several synthesis systems are
                 described in detail, with an emphasis on theoretical
                 developments and innovative design. Commercial
                 synthesizers and other architectures are also briefly
                 mentioned.",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ, Dep of Music, Stanford, CA, USA",
  affiliationaddress = "Stanford Univ, Dep of Music, Stanford, CA, USA",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; computer music; computers, digital ---
                 Applications; design; theory, computer architecture",
  subject =      "{\bf J.5}: Computer Applications, ARTS AND HUMANITIES,
                 Music. {\bf B.0}: Hardware, GENERAL. {\bf C.3}:
                 Computer Systems Organization, SPECIAL-PURPOSE AND
                 APPLICATION-BASED SYSTEMS.",
}

@Article{Loy:1985:PLC,
  author =       "Gareth Loy and Curtis Abbott",
  title =        "Programming Languages for Computer Music Synthesis,
                 Performance, and Composition",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "2",
  pages =        "235--265",
  month =        jun,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/4468.4485",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:05 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/4485.html",
  abstract =     "The development of formal, descriptive, and procedural
                 notations has become a practical concern within the
                 field of music now that computers are being applied to
                 musical tasks. Music combines the real-time demands of
                 performance with the intellectual demands of highly
                 developed symbolic systems that are quite different
                 from natural language. The richness and variety of
                 these demands makes the programming language paradigm a
                 natural one in the musical application of computers.
                 This paradigm provides musicians with a fresh
                 perspective on their work. At the same time, music is a
                 very advanced form of human endeavor, making computer
                 music applications a worthy challenge for computer
                 scientists. In this paper we outline the traditional
                 tasks and forms of representation in music, then
                 proceed with a survey of languages that deal with music
                 programming.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California, Computer Audio Research Lab, San
                 Diego, CA, USA",
  affiliationaddress = "Univ of California, Computer Audio Research Lab,
                 San Diego, CA, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer music; computer programming languages;
                 computers, digital --- Applications; music programming
                 languages, languages",
  subject =      "{\bf J.5}: Computer Applications, ARTS AND HUMANITIES,
                 Music. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES,
                 Language Classifications, Data-flow languages. {\bf
                 D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Extensible languages. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Very high-level languages. {\bf
                 D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Nonprocedural languages. {\bf D.3.3}:
                 Software, PROGRAMMING LANGUAGES, Language Constructs
                 and Features, Coroutines.",
}

@Article{Pennycook:1985:CMI,
  author =       "Bruce W. Pennycook",
  title =        "Computer-Music Interfaces: a Survey",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "2",
  pages =        "267--289",
  month =        jun,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/4468.4470",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:05 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/4470.html",
  abstract =     "This paper is a study of the unique problems posed by
                 the use of computers by composers and performers of
                 music. The paper begins with a presentation of the
                 basic concepts involved in the musical interaction with
                 computer devices, followed by a detailed discussion of
                 three musical tasks: music manuscript preparation,
                 music language interfaces for composition, and
                 real-time performance interaction. Fundamental design
                 principles are exposed through an examination of
                 several early computer music systems, especially the
                 Structured Sound Synthesis Project. A survey of
                 numerous systems, based on the following categories, is
                 presented: compositions and synthesis languages,
                 graphics score editing, performance instruments,
                 digital audio processing tools, and computer-aided
                 instruction in music systems. An extensive reference
                 list is provided for further study in the field.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; human factors; languages",
  subject =      "{\bf J.5}: Computer Applications, ARTS AND HUMANITIES,
                 Music. {\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Interaction
                 techniques.",
}

@Article{Wasserman:1985:ATIb,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "3",
  pages =        "291--292",
  month =        sep,
  year =         "1985",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:31:36 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1985:AAc,
  author =       "Anthony I. Wasserman",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "3",
  pages =        "293--294",
  month =        sep,
  year =         "1985",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:31:36 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hester:1985:SOL,
  author =       "James H. Hester and Daniel S. Hirschberg",
  title =        "Self-Organizing Linear Search",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "3",
  pages =        "295--311",
  month =        sep,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/5505.5507",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:21 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/5507.html",
  abstract =     "Algorithms that modify the order of linear search
                 lists are surveyed. First the problem, including
                 assumptions and restrictions, is defined. Next a
                 summary of analysis techniques and measurements that
                 apply to these algorithms is given. The main portion of
                 the survey presents algorithms in the literature with
                 absolute analyses when available. The following section
                 gives relative measures that are applied between two or
                 more algorithms. The final section presents open
                 questions.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California, Irvine, Irvine, CA, USA",
  affiliationaddress = "Univ of California, Irvine, Irvine, CA, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Algorithms; computer operating systems --- Storage
                 Allocation; computer programming; measurement;
                 performance; search algorithms, algorithms;
                 self-organizing liner search; theory",
  review =       "ACM CR 8609-0809",
  subject =      "{\bf E.1}: Data, DATA STRUCTURES, Lists. {\bf E.1}:
                 Data, DATA STRUCTURES, Tables. {\bf D.4.2}: Software,
                 OPERATING SYSTEMS, Storage Management, Swapping. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Sorting and searching. {\bf F.2.3}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Tradeoffs among Complexity Measures.",
}

@Article{Jarke:1985:FCD,
  author =       "Matthias Jarke and Yannis Vassiliou",
  title =        "A Framework for Choosing a Database Query Language",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "3",
  pages =        "313--340",
  month =        sep,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/5505.5506",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:21 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/5506.html",
  abstract =     "This paper presents a systematic approach to matching
                 cate- gories of query language interfaces with the
                 requirements of certain user types. The method is based
                 on a trend model of query language development on the
                 dimensions of functional capabilities and query
                 languages, a criterion hierarchy for query language
                 evaluation, a comprehensive classification scheme of
                 query language users and their requirements, and
                 preliminary recommendations for allocating language
                 classes to user types.\par

                 The method integrates the results of existing human
                 factors studies and provides a structured framework for
                 future research in this area. Current and expected
                 developments are exemplified by the description of
                 ``new generation'' database query languages. In a
                 preselecting suitable query language types; the final
                 selection decision will also depend on
                 organization-specific factors, such as the available
                 database management system, hardware and software
                 strategies, and financial system costs.",
  acknowledgement = ack-nhfb,
  affiliation =  "New York Univ, New York, NY, USA",
  affiliationaddress = "New York Univ, New York, NY, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming languages; database systems;
                 human factors; language evaluation; languages; query
                 language; query language interfaces, databases; Query
                 Languages; user classification",
  subject =      "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications, Very
                 high-level languages. {\bf H.1.2}: Information Systems,
                 MODELS AND PRINCIPLES, User/Machine Systems, Human
                 factors. {\bf H.3.3}: Information Systems, INFORMATION
                 STORAGE AND RETRIEVAL, Information Search and
                 Retrieval, Query formulation.",
}

@Article{Davidson:1985:CPN,
  author =       "Susan B. Davidson and Hector Garcia-Molina and Dale
                 Skeen",
  title =        "Consistency in Partitioned Networks",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "3",
  pages =        "341--370",
  month =        sep,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/5505.5508",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:21 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Also published in/as: University of Pennsylvania, TR
                 No. Management Science, Journal of TIMS-Conference on
                 Information Systems, sponsored by Machine Intelligence,
                 eds: Meltzer, and Michie, vars. Publishers, TIMS, ACM
                 SIGBDP-84-04, Aug. 1984. Also published in/as:
                 Princeton University, TR EECS 320, 1984.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/5508.html",
  abstract =     "Recently, several strategies have been proposed for
                 transaction processing in partitioned distributed
                 database systems with replicated data. These strategies
                 are surveyed in light of the competing goals of
                 maintaining correctness and achieving high
                 availability. Extensions and combinations are then
                 discussed, and guidelines are presented for selecting
                 strategies for particular applications.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pennsylvania, Philadelphia, PA, USA",
  affiliationaddress = "Univ of Pennsylvania, Philadelphia, PA, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; computer programming --- Algorithms;
                 consistency; Distributed; partitioned networks;
                 performance; reliability, database systems",
  review =       "ACM CR 8809-0690",
  subject =      "{\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems
                 Management, File organization. {\bf C.4}: Computer
                 Systems Organization, PERFORMANCE OF SYSTEMS,
                 Reliability, availability, and serviceability. {\bf
                 H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems, Transaction processing. {\bf H.2.4}:
                 Information Systems, DATABASE MANAGEMENT, Systems,
                 Distributed systems.",
  xxtitle =      "Consistency in a partitioned network: a survey",
}

@Article{Wasserman:1985:ATIc,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "4",
  pages =        "375--376",
  month =        dec,
  year =         "1985",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:34:40 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1985:AAd,
  author =       "Anthony I. Wasserman",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "4",
  pages =        "377--378",
  month =        dec,
  year =         "1985",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 24 23:34:40 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Quarterman:1985:EUS,
  author =       "John S. Quarterman and Abraham Silberschatz and James
                 L. Peterson",
  title =        "{4.2BSD} and {4.3BSD} as Examples of the {UNIX}
                 System",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "4",
  pages =        "379--418",
  month =        dec,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/6041.6043",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:33 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/6043.html",
  abstract =     "This paper presents an in-depth examination of the 4.2
                 Berkeley Software Distribution, Virtual VAX-11 Version
                 (4.2BSD), which is a version of the UNIX Time-Sharing
                 System. There are notes throughout on 4.3BSD, the
                 forthcoming system from the University of California at
                 Berkeley. We trace the historical development of the
                 UNIX system from its conception in 1969 until today,
                 and describe the design principles that have guided
                 this development. We then present the internal data
                 structures and algorithms used by the kernel to support
                 the user interface. In particular, we describe process
                 management, memory management, the file system, the I/O
                 system, and communications. These are treated in as
                 much detail as the UNIX licenses will allow. We
                 conclude with a brief description of the user interface
                 and a set of bibliographic notes.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas, Austin, TX, USA",
  affiliationaddress = "Univ of Texas, Austin, TX, USA",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "4.2BSD UNIX; 4.3BSD UNIX; computer operating systems;
                 computer systems, digital --- Distributed; distributed
                 operating systems, design; performance; reliability;
                 security; theory",
  review =       "ACM CR 8706-0484",
  subject =      "{\bf D.4.0}: Software, OPERATING SYSTEMS, General,
                 UNIX. {\bf D.4.7}: Software, OPERATING SYSTEMS,
                 Organization and Design, Interactive systems. {\bf
                 K.2}: Computing Milieux, HISTORY OF COMPUTING.",
}

@Article{Tanenbaum:1985:DOS,
  author =       "Andrew S. Tanenbaum and Robbert {van Renesse}",
  title =        "Distributed Operating Systems",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "4",
  pages =        "419--470",
  month =        dec,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/6041.6074",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:33 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/Mach.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/6074.html",
  abstract =     "Distributed operating systems have many aspects in
                 common with centralized ones, but they also differ in
                 certain ways. This paper is intended as an introduction
                 to distributed operating systems, and especially to
                 current university research about them. After a
                 discussion of what constitutes a distributed operating
                 system and how it is distinguished from a computer
                 network, various key design issues are discussed. Then
                 several examples of current research projects are
                 examined in some detail, namely, the Cambridge
                 Distributed Computing System, Amoeba, V, and Eden.",
  acknowledgement = ack-nhfb,
  affiliation =  "Vrije Univ, Amsterdam, Neth",
  affiliationaddress = "Vrije Univ, Amsterdam, Neth",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Amoeba system; Cambridge distributed computing system;
                 computer operating systems; computer systems, digital
                 --- Distributed; design; distributed operating systems;
                 Eden system, algorithms; reliability; Research;
                 security; V system",
  review =       "ACM CR 8612-1093",
  subject =      "{\bf D.4.7}: Software, OPERATING SYSTEMS, Organization
                 and Design, Distributed systems. {\bf D.4.3}: Software,
                 OPERATING SYSTEMS, File Systems Management, Distributed
                 file systems. {\bf D.4.5}: Software, OPERATING SYSTEMS,
                 Reliability, Fault-tolerance. {\bf D.4.6}: Software,
                 OPERATING SYSTEMS, Security and Protection, Access
                 controls. {\bf D.4.0}: Software, OPERATING SYSTEMS,
                 General. {\bf C.2.4}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
                 Network operating systems.",
}

@Article{Cardelli:1985:UTD,
  author =       "Luca Cardelli and Peter Wegner",
  title =        "On Understanding Types, Data Abstraction, and
                 Polymorphism",
  journal =      j-COMP-SURV,
  volume =       "17",
  number =       "4",
  pages =        "471--522",
  month =        dec,
  year =         "1985",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/6041.6042",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:33 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/6042.html",
  abstract =     "Our objective is to understand the notion of type in
                 programming languages, present a model of typed,
                 polymorphic programming languages that reflects recent
                 research in type theory, and examine the relevance of
                 recent research to the design of practical programming
                 languages. Object-oriented languages provide both a
                 framework and a motivation for exploring the
                 interaction among the concepts of type, data
                 abstraction, and polymorphism, since they extend the
                 notion of type to data abstraction and since type
                 inheritance is an important form of polymorphism. We
                 develop a $ \lambda $-calculus-based model for type
                 systems that allows us to explore these interactions in
                 a simple setting, unencumbered by complexities of
                 production programming languages. The evolution of
                 languages from untyped universes to monomorphic and
                 then polymorphic type systems is reviewed. Mechanisms
                 for polymorphism such as overloading, coercion,
                 subtyping, and parameterization are examined. A
                 unifying framework for polymorphic type systems is
                 developed in terms of the typed $ \lambda $-calculus
                 augmented to include binding of types by quantification
                 as well as binding of values by abstraction. The typed
                 $ \lambda $-calculus is augmented by universal
                 quantification to model generic functions with type
                 parameters, existential quantification and packaging
                 (information hiding) to model abstract data types, and
                 bounded quantification to model subtypes and type
                 inheritance. In this way we obtain a simple and precise
                 characterization of a powerful type system that
                 includes abstract data types, parametric polymorphism,
                 and multiple inheritance in a single consistent
                 framework. The mechanisms for type checking for the
                 augmented $ \lambda $-calculus are discussed. The
                 augmented typed $ \lambda $-calculus is used as a
                 programming language for a variety of illustrative
                 examples. We christen this language Fun because fun
                 instead of $ \lambda $ is the functional abstraction
                 keyword and because it is pleasant to deal with. Fun is
                 mathematically simple and can serve as a basis for the
                 design and implementation of real programming languages
                 with type facilities that are more powerful and
                 expressive than those of existing programming
                 languages. In particular, it provides a basis for the
                 design of strongly typed object-oriented languages.",
  acknowledgement = ack-nhfb,
  affiliation =  "AT\&T Bell Lab, Murray Hill, NJ, USA",
  affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA",
  annote =       "Ada examples, full set of type inference rules.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer metatheory; computer programming languages;
                 data abstraction; lambda-calculus, languages;
                 polymorphism; Theory; theory; type",
  review =       "ACM CR 8703-0173",
  subject =      "{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Abstract data types. {\bf
                 F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF
                 PROGRAMS, Studies of Program Constructs, Type
                 structure. {\bf F.4.1}: Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Lambda calculus and related systems. {\bf
                 D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Data types and structures.",
}

@Article{Wasserman:1986:ATIa,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1986",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 00:50:39 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1986:AAa,
  author =       "Anthony I. Wasserman",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "1",
  pages =        "3--4",
  month =        mar,
  year =         "1986",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 00:50:39 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Perrott:1986:SL,
  author =       "R. H. Perrott and A. Zarea-Aliabadi",
  title =        "Supercomputer Languages",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "1",
  pages =        "5--22",
  month =        mar,
  year =         "1986",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/6462.6463",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:52 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/6463.html",
  abstract =     "The high-level languages proposed for supercomputers,
                 such as vector and array processors, have been designed
                 using one of the following two approaches: (1) an
                 existing sequential language is adapted, (2) a new
                 language based on the hardware is developed. Recently,
                 there has emerged a third approach, which does not
                 require the programmer to be aware of the sequential
                 nature of the language or the hardware characteristics.
                 Examples of these language groups are examined to
                 illustrate their main features and what is required of
                 a programmer when using such languages. The study
                 therefore enables a comparison of the different
                 language approaches to be made.",
  acknowledgement = ack-nhfb,
  affiliation =  "Queen's Univ of Belfast, Belfast, North Irel",
  affiliationaddress = "Queen's Univ of Belfast, Belfast, North Irel",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming languages; computer systems,
                 digital --- Parallel Processing; Fortran; languages;
                 Pascal, design; supercomputer languages",
  review =       "ACM CR 8703-0162",
  subject =      "{\bf C.1.2}: Computer Systems Organization, PROCESSOR
                 ARCHITECTURES, Multiple Data Stream Architectures
                 (Multiprocessors). {\bf D.1.3}: Software, PROGRAMMING
                 TECHNIQUES, Concurrent Programming. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf D.3.3}: Software,
                 PROGRAMMING LANGUAGES, Language Constructs and
                 Features. {\bf C.5.1}: Computer Systems Organization,
                 COMPUTER SYSTEM IMPLEMENTATION, Large and Medium
                 (``Mainframe'') Computers, Super (very large)
                 computers. {\bf D.3.2}: Software, PROGRAMMING
                 LANGUAGES, Language Classifications, ACTUS.",
}

@Article{Galil:1986:EAF,
  author =       "Zvi Galil",
  title =        "Efficient Algorithms for Finding Maximum Matching in
                 Graphs",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "1",
  pages =        "23--38",
  month =        mar,
  year =         "1986",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/6462.6502",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:52 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/6502.html",
  abstract =     "This paper surveys the techniques used for designing
                 the most efficient algorithms for finding a maximum
                 cardinality or weighted matching in (general or
                 bipartite) graphs. It also lists some open problems
                 concerning possible improvements in existing algorithms
                 and the existence of fast parallel algorithms for these
                 problems.",
  acknowledgement = ack-nhfb,
  affiliation =  "Columbia Univ, New York, NY, USA",
  affiliationaddress = "Columbia Univ, New York, NY, USA",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Algorithms; computer programming; computer systems,
                 digital --- Parallel Processing; mathematical
                 techniques --- Graph Theory; maximum cardinality;
                 maximum matching; parallel algorithms, algorithms;
                 theory; verification; weighted matching",
  review =       "ACM CR 8702-0084",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures. {\bf G.2.2}: Mathematics of Computing,
                 DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.",
}

@Article{Misra:1986:DDE,
  author =       "Jayadev Misra",
  title =        "Distributed Discrete-Event Simulation",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "1",
  pages =        "39--65",
  month =        mar,
  year =         "1986",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/6462.6485",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:52 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/6485.html",
  abstract =     "Traditional discrete-event simulations employ an
                 inherently sequential algorithm. In practice,
                 simulations of large systems are limited by this
                 sequentiality, because only a modest number of events
                 can be simulated. Distributed discrete-event simulation
                 (carried out on a network of processors with
                 asynchronous message-communicating capabilities) is
                 proposed as an alternative; it may provide better
                 performance by partitioning the simulation among the
                 component processors. The basic distributed simulation
                 scheme, which uses time encoding, is described. Its
                 major shortcoming is a possibility of deadlock. Several
                 techniques for deadlock avoidance and deadlock
                 detection are suggested. The focus of this work is on
                 the theory of distributed discrete-event simulation.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin, Austin, TX, USA",
  affiliationaddress = "Univ of Texas at Austin, Austin, TX, USA",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "codes, symbolic --- Encoding; computer programming ---
                 Algorithms; computer simulation; computer systems,
                 digital --- Distributed; deadlock detection and
                 recovery; deadlock prevention; distributed
                 discrete-event simulation; message communicating
                 processes, algorithms; theory; verification",
  review =       "ACM CR 8706-0513",
  subject =      "{\bf I.6.1}: Computing Methodologies, SIMULATION AND
                 MODELING, Simulation Theory. {\bf D.1.3}: Software,
                 PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf
                 D.4.1}: Software, OPERATING SYSTEMS, Process
                 Management, Deadlocks. {\bf C.2.4}: Computer Systems
                 Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Distributed Systems, Distributed applications.",
}

@Article{Chin:1986:MBR,
  author =       "Roland T. Chin and Charles R. Dyer",
  title =        "Model-Based Recognition in Robot Vision",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "1",
  pages =        "67--108",
  month =        mar,
  year =         "1986",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/6462.6464",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:35:52 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/6464.html",
  abstract =     "This paper presents a comparative study and survey of
                 model-based object-recognition algorithms for robot
                 vision. The goal of these algorithms is to recognize
                 the identity, position, and orientation of randomly
                 oriented industrial parts. In one form this is commonly
                 referred to as the 'bin-picking' problem, in which the
                 parts to be recognized are presented in a jumbled bin.
                 The paper is organized according to 2-D, $ 2 \frac
                 {1}{2} $-D, and 3-D object representations, which are
                 used as the basis for the recognition algorithms. Three
                 central issues common to each category, namely, feature
                 extraction, modeling, and matching, are examined in
                 detail. An evaluation and comparison of existing
                 industrial part-recognition systems and algorithms is
                 given, providing insights for progress toward future
                 robot vision systems.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wisconsin, Madison, WI, USA",
  affiliationaddress = "Univ of Wisconsin, Madison, WI, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer programming --- Algorithms; computer vision;
                 design; industrial part recognition, algorithms;
                 model-based recognition; object recognition; pattern
                 recognition; performance; robot vision; robotics ---
                 Vision Systems; robots, industrial --- Vision Systems",
  review =       "ACM CR 8703-0210",
  subject =      "{\bf I.2.10}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding, Modeling
                 and recovery of physical attributes. {\bf I.5.4}:
                 Computing Methodologies, PATTERN RECOGNITION,
                 Applications, Computer vision. {\bf I.4.6}: Computing
                 Methodologies, IMAGE PROCESSING, Segmentation. {\bf
                 I.4.7}: Computing Methodologies, IMAGE PROCESSING,
                 Feature Measurement. {\bf I.2.9}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Robotics,
                 Sensors. {\bf I.4.8}: Computing Methodologies, IMAGE
                 PROCESSING, Scene Analysis.",
}

@Article{Wasserman:1986:ATIb,
  author =       "Anthony I. Wasserman",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "2",
  pages =        "113--114",
  month =        jun,
  year =         "1986",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 00:50:39 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1986:AAb,
  author =       "Anthony I. Wasserman",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "2",
  pages =        "115--116",
  month =        jun,
  year =         "1986",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 00:50:39 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasserman:1986:EP,
  author =       "Anthony I. Wasserman",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "2",
  pages =        "117--124",
  month =        jun,
  year =         "1986",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 00:50:39 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Leveson:1986:SSW,
  author =       "Nancy G. Leveson",
  title =        "Software Safety: Why, What, and How",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "2",
  pages =        "125--163",
  month =        jun,
  year =         "1986",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/7474.7528",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:36:09 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/7528.html",
  abstract =     "Software safety issues become important when computers
                 are used to control real-time, safety-critical
                 processes. This survey attempts to explain why there is
                 a problem, what the problem is, and what is known about
                 how to solve it. Since this is a relatively new
                 software research area, emphasis is placed on
                 delineating the outstanding issues and research
                 topics.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California, Irvine, CA, USA",
  affiliationaddress = "Univ of California, Irvine, CA, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computers --- Applications; design; human factors;
                 measurement; real-time processes; reliability;
                 Reliability; safety-critical processes; security,
                 computer software; software safety",
  review =       "ACM CR 8706-0480",
  subject =      "{\bf D.2.0}: Software, SOFTWARE ENGINEERING, General.
                 {\bf K.4.2}: Computing Milieux, COMPUTERS AND SOCIETY,
                 Social Issues. {\bf J.7}: Computer Applications,
                 COMPUTERS IN OTHER SYSTEMS. {\bf D.2.10}: Software,
                 SOFTWARE ENGINEERING, Design.",
}

@Article{Hirschheim:1986:EPV,
  author =       "R. A. Hirschheim",
  title =        "The Effect of {{\em A Priori\/}} Views on the Social
                 Implications of Computing: The Case of Office
                 Automation",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "2",
  pages =        "165--195",
  month =        jun,
  year =         "1986",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/7474.7476",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:36:09 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/7476.html",
  abstract =     "Office automation impact has received considerable
                 attention in the literature recently. Unfortunately,
                 that which has appeared is diverse and contradictory.
                 The relevant literature is reviewed, summarized, and
                 placed in a framework containing three positions on
                 office automation impact: optimism, pessimism, and
                 relativism. The basic assumptions and empirical support
                 for each position are noted and analyzed. It is
                 proposed that these positions are based on a number of
                 a priori views which guide the reporting and beliefs
                 about technological impact.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Oxford, Oxford, Engl",
  affiliationaddress = "Univ of Oxford, Oxford, Engl",
  classification = "723; 901; 913",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "economics; human factors; information systems;
                 management; performance; privacy; productivity; quality
                 of work life; social implications of computing;
                 technology --- Economic and Sociological Effects;
                 theory, office automation",
  review =       "ACM CR 8706-0508",
  subject =      "{\bf H.4.1}: Information Systems, INFORMATION SYSTEMS
                 APPLICATIONS, Office Automation. {\bf H.4.3}:
                 Information Systems, INFORMATION SYSTEMS APPLICATIONS,
                 Communications Applications. {\bf K.4.3}: Computing
                 Milieux, COMPUTERS AND SOCIETY, Organizational Impacts.
                 {\bf K.4.0}: Computing Milieux, COMPUTERS AND SOCIETY,
                 General.",
}

@Article{Teorey:1986:LDM,
  author =       "Toby J. Teorey and Dongqing Yang and James P. Fry",
  title =        "A Logical Design Methodology for Relational Databases
                 Using the Extended Entity-Relationship Model",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "2",
  pages =        "197--222",
  month =        jun,
  year =         "1986",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/7474.7475",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:36:09 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Segev:1987:SFT,Teorey:1987:SFT}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/7475.html",
  abstract =     "A database design methodology is defined for the
                 design of large relational databases. First, the data
                 requirements are conceptualized using an extended
                 entity-relationship model, with the extensions being
                 additional semantics such as ternary relationships,
                 optional relationships, and the generalization
                 abstraction. The extended entity-relationship model is
                 then decomposed according to a set of basic
                 entity-relationship constructs, and these are
                 transformed into candidate relations. A set of basic
                 transformations has been developed for the three types
                 of relations: entity relations, extended entity
                 relations, and relationship relations. Candidate
                 relations are further analyzed and modified to attain
                 the highest degree of normalization desired.\par

                 The methodology produces database designs that are not
                 only accurate representations of reality, but flexible
                 enough to accommodate future processing requirements.
                 It also reduces the number of data dependencies that
                 must be analyzed, using the extended ER model
                 conceptualization, and maintains data integrity through
                 normalization. This approach can be implemented
                 manually or in a simple software package as long as a
                 ``good'' solution is acceptable and absolute optimality
                 is not required.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Michigan, Ann Arbor, MI, USA",
  affiliationaddress = "Univ of Michigan, Ann Arbor, MI, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database design, databases; database systems; design;
                 entity-relationship model; extended entity-relationship
                 model; integrity; logical design; management;
                 Relational; relational databases",
  subject =      "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models.",
}

@Article{March:1986:ATIa,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "3",
  pages =        "227--228",
  month =        sep,
  year =         "1986",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:03:07 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1986:AAa,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "3",
  pages =        "229--229",
  month =        sep,
  year =         "1986",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:03:07 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mili:1986:FMS,
  author =       "Ali Mili and Jules Desharnais and Jean Raymond
                 Gagn{\'e}",
  title =        "Formal Models of Stepwise Refinement of Programs",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "3",
  pages =        "231--276",
  month =        sep,
  year =         "1986",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/27632.28054",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  MRclass =      "68N05",
  MRnumber =     "896 093",
  bibdate =      "Thu Jun 19 09:36:22 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Mili:1987:CFM}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/28054.html",
  abstract =     "Of the many ways to express program specifications,
                 three of the most common are: as a pair of assertions,
                 an input assertion and an output assertion; as a
                 function mapping legal inputs to correct outputs; or as
                 a relation containing the input\slash output pairs that
                 are considered correct. The construction of programs
                 consists of mapping a potentially complex specification
                 into a program by recursively decomposing complex
                 specifications into simpler ones. We show how this
                 decomposition takes place in all three modes of
                 specification and draw some conclusions on the nature
                 of programming.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Tunis, Belvedere, Tunisia",
  affiliationaddress = "Univ of Tunis, Belvedere, Tunisia",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; computer metatheory; decomposition of
                 specifications; design; languages; program
                 specifications; software specifications; stepwise
                 refinement; Theory; theory; verification, computer
                 programming",
  review =       "ACM CR 8805-0349",
  subject =      "{\bf F.3.1}: Theory of Computation, LOGICS AND
                 MEANINGS OF PROGRAMS, Specifying and Verifying and
                 Reasoning about Programs. {\bf D.1.4}: Software,
                 PROGRAMMING TECHNIQUES, Sequential Programming. {\bf
                 D.2.1}: Software, SOFTWARE ENGINEERING,
                 Requirements/Specifications. {\bf D.2.2}: Software,
                 SOFTWARE ENGINEERING, Tools and Techniques. {\bf
                 D.2.4}: Software, SOFTWARE ENGINEERING, Program
                 Verification. {\bf D.3.3}: Software, PROGRAMMING
                 LANGUAGES, Language Constructs and Features. {\bf
                 F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF
                 PROGRAMS, Studies of Program Constructs.",
}

@Article{Ryder:1986:EAD,
  author =       "Barbara G. Ryder and Marvin C. Paull",
  title =        "Elimination Algorithms for Data Flow Analysis",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "3",
  pages =        "277--316",
  month =        sep,
  year =         "1986",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/27632.27649",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:36:22 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/27649.html",
  abstract =     "A unified model of a family of data flow algorithms,
                 called elimination methods, is presented. The
                 algorithms, which gather information about the
                 definition and use of data in a program or a set of
                 programs, are characterized by the manner in which they
                 solve the systems of equations that describe data flow
                 problems of interest. The unified model provides
                 implementation-independent descriptions of the
                 algorithms to facilitate comparisons among them and
                 illustrate the sources of improvement in worst case
                 complexity bounds. This tutorial provides a study in
                 algorithm design, as well as a new view of these
                 algorithms and their interrelationships.",
  acknowledgement = ack-nhfb,
  affiliation =  "Rutgers Univ, New Brunswick, NJ, USA",
  affiliationaddress = "Rutgers Univ, New Brunswick, NJ, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithm design; Algorithms; algorithms; computer
                 software --- Design; data flow algorithms; elimination
                 methods; languages, computer programming",
  review =       "ACM CR 8803-0190",
  subject =      "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
                 Processors, Optimization. {\bf F.2.0}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, General.",
}

@Article{March:1986:ATIb,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "4",
  pages =        "319--319",
  month =        dec,
  year =         "1986",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:06:07 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1986:AAb,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "4",
  pages =        "321--321",
  month =        dec,
  year =         "1986",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:06:07 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Batini:1986:CAM,
  author =       "C. Batini and M. Lenzerini and S. B. Navathe",
  title =        "A Comparative Analysis of Methodologies for Database
                 Schema Integration",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "4",
  pages =        "323--364",
  month =        dec,
  year =         "1986",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/27633.27634",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:36:30 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/27634.html",
  abstract =     "One of the fundamental principles of the database
                 approach is that a database allows a nonredundant,
                 unified representation of all data managed in an
                 organization. This is achieved only when methodologies
                 are available to support integration across
                 organizational and application
                 boundaries.\par

                 Methodologies for database design usually perform the
                 design activity by separately producing several
                 schemas, representing parts of the application, which
                 are subsequently merged. Database schema integration is
                 the activity of integrating the schemas of existing or
                 proposed databases in a global, unified schema.\par

                 The aim of the paper is to provide first a unifying
                 framework for the problem of schema integration, then a
                 comparative review of the work done thus far in this
                 area. Such a framework, with the associated analysis of
                 the existing approaches, provides a basis for
                 identifying strengths and weaknesses of individual
                 methodologies, as well as general guidelines for future
                 improvements and extensions.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Rome, Rome, Italy",
  affiliationaddress = "Univ of Rome, Rome, Italy",
  annote =       "Comparisons of 12 established schema integration
                 methodologies. Examples include relational, structural,
                 extended E-R model.",
  annote2 =      "A very good comparison of different approaches to
                 schema migration. Formal treatment of the semantics is
                 given. Definitions of concepts of equivalence of
                 schemas created. Categorization of problems in Schema
                 integration. Overview and metrics of existing
                 systems.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "conceptual database design, conceptual database
                 design; database integration; database management;
                 database schema integration; database systems; Design;
                 design; information systems; information systems
                 design; management; models; view integration",
  review =       "ACM CR 8802-0107",
  subject =      "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Schema and subschema. {\bf H.2.1}:
                 Information Systems, DATABASE MANAGEMENT, Logical
                 Design, Data models. {\bf D.2.1}: Software, SOFTWARE
                 ENGINEERING, Requirements/Specifications,
                 Methodologies. {\bf H.2.5}: Information Systems,
                 DATABASE MANAGEMENT, Heterogeneous Databases.",
}

@Article{Veen:1986:DMA,
  author =       "Arthur H. Veen",
  title =        "Dataflow Machine Architecture",
  journal =      j-COMP-SURV,
  volume =       "18",
  number =       "4",
  pages =        "365--396",
  month =        dec,
  year =         "1986",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/27633.28055",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:36:30 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/28055.html",
  abstract =     "Dataflow machines are programmable computers of which
                 the hardware is optimized for fine-grain data-driven
                 parallel computation. The principles and complications
                 of data-driven execution are explained, as well as the
                 advantages and costs of fine-grain parallelism. A
                 general model for a dataflow machine is presented and
                 the major design options are discussed.\par

                 Most dataflow machines described in the literature are
                 surveyed on the basis of this model and its associated
                 technology. For general-purpose computing the most
                 promising dataflow machines are those that employ
                 packet-switching communication and support general
                 recursion. Such a recursion mechanism requires an
                 extremely fast mechanism to map a sparsely occupied
                 virtual space to a physical space of realistic size. No
                 solution has yet proved fully satisfactory.\par

                 A working prototype of one processing element is
                 described in detail. On the basis of experience with
                 this prototype, some of the objections raised against
                 the dataflow approach are discussed. It appears that
                 the overhead due to fine-grain parallelism can be made
                 acceptable by sophisticated compiling and employing
                 special hardware for the storage of data structures.
                 Many computing-intensive programs show sufficient
                 parallelism. In fact, a major problem is to restrain
                 parallelism when machine resources tend to get
                 overloaded. Another issue that requires further
                 investigation is the distribution of computation and
                 data structures over the processing elements.",
  acknowledgement = ack-nhfb,
  affiliation =  "Cent for Mathematics \& Computer Science, Amsterdam,
                 Neth",
  affiliationaddress = "Cent for Mathematics \& Computer Science,
                 Amsterdam, Neth",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer architecture --- Reviews; data structure
                 storage; data-driven architectures; data-flow
                 computers; dataflow machines; design; packet-switching
                 communication; Parallel Processing; performance,
                 computer systems, digital; recursion mechanism",
  subject =      "{\bf C.1.3}: Computer Systems Organization, PROCESSOR
                 ARCHITECTURES, Other Architecture Styles, Data-flow
                 architectures. {\bf C.1.2}: Computer Systems
                 Organization, PROCESSOR ARCHITECTURES, Multiple Data
                 Stream Architectures (Multiprocessors),
                 Multiple-instruction-stream, multiple-data-stream
                 processors (MIMD). {\bf C.4}: Computer Systems
                 Organization, PERFORMANCE OF SYSTEMS, Design studies.",
}

@Article{March:1987:ATIa,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "1",
  pages =        "1--1",
  month =        mar,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:09:13 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1987:AAa,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "1",
  pages =        "3--3",
  month =        mar,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:09:13 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lyytinen:1987:DPI,
  author =       "Kalle Lyytinen",
  title =        "Different Perspectives on Information Systems:
                 Problems and Solutions",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "1",
  pages =        "5--46",
  month =        mar,
  year =         "1987",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/28865.28867",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:36:41 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/28867.html",
  abstract =     "The paper puts information systems (IS) research
                 dealing with IS problems into perspective. IS problems
                 are surveyed and classified. Using the IS research
                 framework suggested by Ives, Hamilton, and Davis,
                 research into IS problems is classified into several
                 perspectives whose relevance in coping with the
                 problems is discussed. Research perspectives focusing
                 on IS operations environment, IS development process,
                 IS development organization, IS development methods,
                 and IS theories are distinguished. The paper concludes
                 with suggestions for future research and how to deal
                 with IS problems in practice.",
  acknowledgement = ack-nhfb,
  annote =       "Model types for system specification.",
  classification = "723; 912",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer system measurement; data processing,
                 business; database systems; economics; human factors;
                 information systems; management, management",
  subject =      "{\bf D.2.1}: Software, SOFTWARE ENGINEERING,
                 Requirements/Specifications. {\bf D.2.2}: Software,
                 SOFTWARE ENGINEERING, Tools and Techniques. {\bf
                 D.2.6}: Software, SOFTWARE ENGINEERING, Programming
                 Environments. {\bf D.2.9}: Software, SOFTWARE
                 ENGINEERING, Management. {\bf H.2.1}: Information
                 Systems, DATABASE MANAGEMENT, Logical Design. {\bf
                 H.2.7}: Information Systems, DATABASE MANAGEMENT,
                 Database Administration. {\bf K.4.3}: Computing
                 Milieux, COMPUTERS AND SOCIETY, Organizational Impacts.
                 {\bf K.6.0}: Computing Milieux, MANAGEMENT OF COMPUTING
                 AND INFORMATION SYSTEMS, General. {\bf K.6.1}:
                 Computing Milieux, MANAGEMENT OF COMPUTING AND
                 INFORMATION SYSTEMS, Project and People Management.
                 {\bf K.6.3}: Computing Milieux, MANAGEMENT OF COMPUTING
                 AND INFORMATION SYSTEMS, Software Management. {\bf
                 K.6.4}: Computing Milieux, MANAGEMENT OF COMPUTING AND
                 INFORMATION SYSTEMS, System Management.",
}

@Article{Kemper:1987:AGM,
  author =       "Alfons Kemper and Mechtild Wallrath",
  title =        "An Analysis of Geometric Modeling in Database
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "1",
  pages =        "47--91",
  month =        mar,
  year =         "1987",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/28865.28866",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:36:41 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/28866.html",
  abstract =     "The data-modeling and computational requirements for
                 integrated computer aided manufacturing (CAM) databases
                 are analyzed, and the most common representation
                 schemes for modeling solid geometric objects in a
                 computer are described. The primitive instancing model,
                 the boundary representation, and the constructive solid
                 geometry model are presented from the viewpoint of
                 database representation. Depending on the
                 representation scheme, one can apply geometric
                 transformations to the stored geometric objects. The
                 standard transformations, scaling, translation, and
                 rotation, are outlined with respect to the data
                 structure aspects. Some of the more recent developments
                 in the area of engineering databases with regard to
                 supporting these representation schemes are then
                 explored, and a classification scheme for technical
                 database management systems is presented that
                 distinguishes the systems according to their level of
                 object orientation: structural or behavioral object
                 orientation. First, several systems that are extensions
                 to the relational model are surveyed, then the
                 functional data model DAPLEX, the nonnormalized
                 relational model NF$^2$, and the database system $ R^2
                 D^2$ that provides abstract data types in the NF$^2$
                 model are described.",
  acknowledgement = ack-nhfb,
  annote =       "requirements for CAM. Functional, nested relations
                 (NFNF), RRDD models.",
  classification = "723; 921",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "boundary representation; computer aided manufacturing;
                 constructive solid geometry, design; database systems;
                 geometric modeling; languages; mathematical models;
                 mathematical techniques --- Geometry; primitive
                 instancing model",
  review =       "ACM CR 8808-0605",
  subject =      "{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Abstract data types. {\bf
                 H.2.1}: Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.3}: Information
                 Systems, DATABASE MANAGEMENT, Languages. {\bf J.6}:
                 Computer Applications, COMPUTER-AIDED ENGINEERING. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Hierarchy
                 and geometric transformations.",
}

@Article{March:1987:ATIb,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "2",
  pages =        "93--93",
  month =        jun,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:12:35 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1987:AAb,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "2",
  pages =        "95--95",
  month =        jun,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:12:35 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1987:EP,
  author =       "Salvatore T. March",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "2",
  pages =        "97--104",
  month =        jun,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:12:35 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Atkinson:1987:TPD,
  author =       "Malcolm P. Atkinson and O. Peter Buneman",
  title =        "Types and Persistence in Database Programming
                 Languages",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "2",
  pages =        "105--190",
  month =        jun,
  year =         "1987",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/62070.45066",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:36:51 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/45066.html",
  abstract =     "Traditionally, the interface between a programming
                 language and a database has either been through a set
                 of relatively low-level subroutine calls, or it has
                 required some form of embedding of one language in
                 another. Recently, the necessity of integrating
                 database and programming language techniques has
                 received some long-overdue recognition. In response, a
                 number of attempts have been made to construct
                 programming languages with completely integrated
                 database management systems. These languages, which we
                 term database programming languages, are the subject of
                 this review. The design of these languages is still in
                 its infancy, and the purpose of writing this review is
                 to identify the areas in which further research is
                 required. In particular, we focus on the problems of
                 providing a uniform type system and mechanisms for data
                 to persist. Of particular importance in solving these
                 problems are issues of polymorphism, type inheritance,
                 object identity, and the choice of structures to
                 represent sets of similar values. Our conclusion is
                 that there are areas of programming language research
                 --- modules, polymorphism, persistence, and inheritance
                 --- that must be developed and applied to achieve the
                 goal of a useful and consistent database programming
                 language. Other research areas of equal importance,
                 such as implementation, transaction handling, and
                 concurrency, are not examined here in any detail.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Glasgow, Glasgow, Scotl",
  affiliationaddress = "Univ of Glasgow, Glasgow, Scotl",
  annote =       "Illustrated with 4 tasks. Polymorphism, type
                 inheritance, object identity, and the choice of
                 structures to represent sets of similar values.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data models; data types; database programming
                 languages; database systems; design; Design; languages,
                 computer programming languages; object-oriented
                 programming; type inheritance",
  review =       "ACM CR 8904-0224",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Specialized application languages.
                 {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features. {\bf H.2.3}: Information
                 Systems, DATABASE MANAGEMENT, Languages.",
}

@Article{Segev:1987:SFT,
  author =       "Arie Segev",
  title =        "Surveyor's Forum: Transitive Dependencies",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "2",
  pages =        "191--192",
  month =        jun,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:12:35 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Teorey:1986:LDM,Teorey:1987:SFT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Teorey:1987:SFT,
  author =       "Toby J. Teorey",
  title =        "Surveyor's Forum: Transitive Dependencies",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "2",
  pages =        "193--193",
  month =        jun,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:12:35 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Teorey:1986:LDM,Segev:1987:SFT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mili:1987:CFM,
  author =       "Ali Mili and Jules Desharnais and Jean Raymond
                 Gagn{\'e}",
  title =        "Corrigendum: {``Formal Models of Stepwise Refinements
                 of Programs''}",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "2",
  pages =        "195--195",
  month =        jun,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 22:25:51 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Mili:1986:FMS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1987:ATIc,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "3",
  pages =        "197--198",
  month =        sep,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:16:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1987:AAc,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "3",
  pages =        "199--199",
  month =        sep,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:16:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hull:1987:SDM,
  author =       "Richard Hull and Roger King",
  title =        "Semantic Database Modeling: Survey, Applications, and
                 Research Issues",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "3",
  pages =        "201--260",
  month =        sep,
  year =         "1987",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/45072.45073",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:36:57 MDT 2008",
  bibsource =    "ACM Computing Archive;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Also published in/as: USC, TR-CRI 87-20, March 1987
                 (revised) and USC, TR-CRI 86-21, March 1986.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/45073.html",
  abstract =     "Most common database management systems represent
                 information in a simple record-based format. Semantic
                 modeling provides richer data structuring capabilities
                 for database applications. In particular, research in
                 this area has articulated a number of constructs that
                 provide mechanisms for representing structurally
                 complex interrelations among data typically arising in
                 commercial applications. In general terms, semantic
                 modeling complements work on knowledge representation
                 (in artificial intelligence) and on the new generation
                 of database models based on the object-oriented
                 paradigm of programming languages. This paper presents
                 an in-depth discussion of semantic data modeling. It
                 reviews the philosophical motivations of semantic
                 models, including the need for high-level modeling
                 abstractions and the reduction of semantic overloading
                 of data type constructors. It then provides a tutorial
                 introduction to the primary components of semantic
                 models, which are the explicit representation of
                 objects, attributes of and relationships among objects,
                 type constructors for building complex types, ISA
                 relationships, and derived schema components. Next, a
                 survey of the prominent semantic models in the
                 literature is presented. Further, since a broad area of
                 research has developed around semantic modeling, a
                 number of related topics based on these models are
                 discussed, including data languages, graphical
                 interfaces, theoretical investigations, and physical
                 implementation strategies.",
  acknowledgement = ack-nhfb,
  annote =       "A good overview of semantics and data models. It draws
                 contrasts between different types of semantic models,
                 and between OO and semantic extensions to DBMS. A
                 tutorial on the basic concepts is also presented. Also
                 considered is the relations between semantic data
                 models and AI constructs. \ldots{} Hierarchic, network
                 and relational. Semantic data models. IFO model. Paper
                 difficult to read. The original developers'
                 presentations are the basis of discussion.",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; languages",
  review =       "ACM CR 8904-0250",
  subject =      "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.0}: Information
                 Systems, DATABASE MANAGEMENT, General. {\bf H.2.3}:
                 Information Systems, DATABASE MANAGEMENT, Languages,
                 Data description languages (DDL). {\bf I.2.4}:
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Knowledge Representation Formalisms and Methods.",
}

@Article{Lelewer:1987:DC,
  author =       "Debra A. Lelewer and Daniel S. Hirschberg",
  title =        "Data Compression",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "3",
  pages =        "261--296",
  month =        sep,
  year =         "1987",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/45072.45074",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:36:57 MDT 2008",
  bibsource =    "ACM Computing Archive;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/45074.html",
  abstract =     "This paper surveys a variety of data compression
                 methods spanning almost 40 years of research, from the
                 work of Shannon, Fano, and Huffman in the late 1940s to
                 a technique developed in 1986. The aim of data
                 compression is to reduce redundancy in stored or
                 communicated data, thus increasing effective data
                 density. Data compression has important application in
                 the areas of file storage and distributed systems.
                 Concepts from information theory as they relate to the
                 goals and evaluation of data compression methods are
                 discussed briefly. A framework for evaluation and
                 comparison of methods is constructed and applied to the
                 algorithms presented. Comparisons of both theoretical
                 and empirical natures are reported, and possibilities
                 for future research are suggested.",
  acknowledgement = ack-nhfb,
  annote =       "Reviews techniques that are reversible.",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "adaptive coding; algorithms; data compression; Huffman
                 coding; text compression; theory",
  review =       "ACM CR 8902-0069",
  subject =      "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
                 compaction and compression. {\bf H.3.2}: Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Information
                 Storage. {\bf D.4.3}: Software, OPERATING SYSTEMS, File
                 Systems Management, Distributed file systems.",
}

@Article{March:1987:ATId,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "4",
  pages =        "299--299",
  month =        dec,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:18:57 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1987:AAd,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "4",
  pages =        "301--301",
  month =        dec,
  year =         "1987",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:18:57 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Knapp:1987:DDD,
  author =       "Edgar Knapp",
  title =        "Deadlock Detection in Distributed Databases",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "4",
  pages =        "303--328",
  month =        dec,
  year =         "1987",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/45075.46163",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:37:09 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/CCR.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/46163.html",
  abstract =     "The problem of deadlock detection in distributed
                 systems has undergone extensive study. An important
                 application relates to distributed database systems. A
                 uniform model in which published algorithms can be cast
                 is given, and the fundamental principles on which
                 distributed deadlock detection schemes are based are
                 presented. These principles represent mechanisms for
                 developing distributed algorithms in general and
                 deadlock detection schemes in particular. In addition,
                 a hierarchy of deadlock models is presented; each model
                 is characterized by the restrictions that are imposed
                 upon the form resource requests can assume. The
                 hierarchy includes the well-known models of resource
                 and communication deadlock. Algorithms are classified
                 according to both the underlying principles and the
                 generality of resource requests they permit. A number
                 of algorithms are discussed in detail, and their
                 complexity in terms of the number of messages employed
                 is compared. The point is made that correctness proofs
                 for such algorithms using operational arguments are
                 cumbersome and error prone and, therefore, that only
                 completely formal proofs are sufficient for
                 demonstrating correctness.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin, Austin, TX, USA",
  affiliationaddress = "Univ of Texas at Austin, Austin, TX, USA",
  annote =       "Four main types: 1. path-pushing algorithms, 2.
                 edge-chasing algorithms, 3. diffusing computations and
                 4. global state detection algorithms. Point about many
                 path-pushing were found to be incorrect. In
                 edge-chasing, a probe message is forwarded to all
                 processes that the receiving process waits for. A
                 deadlock exists if a probe message makes its way back
                 to the originating process.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; computer programming --- Algorithms;
                 correctness proofs; deadlock detection; design,
                 database systems; Distributed; hierarchy of deadlock
                 models; transaction processing",
  review =       "ACM CR 8902-0066",
  subject =      "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process
                 Management, Deadlocks. {\bf D.4.1}: Software, OPERATING
                 SYSTEMS, Process Management, Concurrency. {\bf C.2.4}:
                 Computer Systems Organization, COMPUTER-COMMUNICATION
                 NETWORKS, Distributed Systems. {\bf C.2.4}: Computer
                 Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Distributed Systems, Distributed databases. {\bf
                 D.4.7}: Software, OPERATING SYSTEMS, Organization and
                 Design, Distributed systems. {\bf H.2.4}: Information
                 Systems, DATABASE MANAGEMENT, Systems, Distributed
                 systems.",
}

@Article{Mills:1987:RTC,
  author =       "Carol Bergfeld Mills and Linda J. Weldon",
  title =        "Reading Text from Computer Screens",
  journal =      j-COMP-SURV,
  volume =       "19",
  number =       "4",
  pages =        "329--358",
  month =        dec,
  year =         "1987",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/45075.46162",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:37:09 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/46162.html",
  abstract =     "This paper reviews empirical studies concerning the
                 readability of text from computer screens. The review
                 focuses on the form and physical attributes of complex,
                 realistic displays of text material. Most studies
                 comparing paper and computer screen readability show
                 that screens are less readable than paper. There are
                 many factors that could affect the readability of
                 computer screens. The factors explored in this review
                 are the features of characters, the formatting of the
                 screen, the contrast and color of the characters and
                 background, and dynamic aspects of the screen. Numerous
                 areas for future research are pinpointed.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland, College Park, MD, USA",
  affiliationaddress = "Univ of Maryland, College Park, MD, USA",
  classification = "722",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer screens; display devices --- Human Factors;
                 experimentation; Human Factors; human factors, computer
                 interfaces; readability of text; screen design; text
                 presentation",
  review =       "ACM CR 8907-0453",
  subject =      "{\bf B.4.2}: Hardware, INPUT/OUTPUT AND DATA
                 COMMUNICATIONS, Input/Output Devices, Image display.
                 {\bf H.1.2}: Information Systems, MODELS AND
                 PRINCIPLES, User/Machine Systems, Human factors. {\bf
                 H.1.2}: Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems, Human information processing.
                 {\bf H.4.3}: Information Systems, INFORMATION SYSTEMS
                 APPLICATIONS, Communications Applications.",
}

@Article{March:1988:ATIa,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "1",
  pages =        "1--1",
  month =        mar,
  year =         "1988",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:22:08 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1988:AAa,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "1",
  pages =        "3--3",
  month =        mar,
  year =         "1988",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 01:22:08 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Takagi:1988:QAP,
  author =       "Hideaki Takagi",
  title =        "Queuing Analysis of Polling Models",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "1",
  pages =        "5--28",
  month =        mar,
  year =         "1988",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/62058.62059",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  MRclass =      "68-02 (68M10 68M20 90B22 90B35)",
  MRnumber =     "89f:68001",
  bibdate =      "Thu Jun 19 09:37:17 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1988.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/62059.html",
  abstract =     "A polling model is a system of multiple queues
                 accessed by a single server in cyclic order. Polling
                 models provide performance evaluation criteria for a
                 variety of demand-based, multiple-access schemes in
                 computer and communication systems. This paper presents
                 an overview of the state of the art of polling model
                 analysis, as well as an extensive list of references.
                 In particular, single-buffer systems and
                 infinite-buffer systems with exhaustive, gated, and
                 limited service disciplines are treated. There is also
                 some discussion of systems with a noncyclic order of
                 service and systems with priority. Applications to
                 computer networks are illustrated, and future research
                 topics are suggested.",
  acknowledgement = ack-nhfb,
  affiliation =  "Tokyo Research Lab, Tokyo, Jpn",
  affiliationaddress = "Tokyo Research Lab, Tokyo, Jpn",
  classification = "716; 717; 718; 723; 922",
  descriptors =  "Queueing system; polling; finite queue; LAN; modeling;
                 infinite queue; cyclic service; token ring; performance
                 evaluation; queueing theory",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer networks --- Mathematical Models; cyclic
                 order; infinite-buffer systems; information theory;
                 multiple queues; performance, probability; polling
                 models; Queueing Theory; single server; single-buffer
                 systems; telecommunication systems --- Analysis",
  subject =      "{\bf C.2.5}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Local Networks. {\bf
                 C.4}: Computer Systems Organization, PERFORMANCE OF
                 SYSTEMS, Modeling techniques. {\bf D.4.8}: Software,
                 OPERATING SYSTEMS, Performance, Queueing theory.",
}

@Article{Danforth:1988:TTO,
  author =       "Scott Danforth and Chris Tomlinson",
  title =        "Type Theories and Object-Oriented Programming",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "1",
  pages =        "29--72",
  month =        mar,
  year =         "1988",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/62058.62060",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  MRclass =      "68-02 (68N15 68Q65)",
  MRnumber =     "958 779",
  bibdate =      "Thu Jun 19 09:37:17 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/62060.html",
  abstract =     "Object-oriented programming is becoming a popular
                 approach to the construction of complex software
                 systems. Benefits of object orientation include support
                 for modular design, code sharing, and extensibility. In
                 order to make the most of these advantages, a type
                 theory for objects and their interactions should be
                 developed to aid checking and controlled derivation of
                 programs and to support early binding of code bodies
                 for efficiency. As a step in this direction, this paper
                 surveys a number of existing type theories and examines
                 the manner and extent to which these theories are able
                 to represent the ideas found in object-oriented
                 programming. Of primary interest are the models
                 provided by type theories for abstract data types and
                 inheritance, and the major portion of this paper is
                 devoted to these topics. Code fragments illustrative of
                 the various approaches are provided and discussed. The
                 introduction provides an overview of object-oriented
                 programming and types in programming languages; the
                 summary provides a comparative evaluation of the
                 reviewed typing systems, along with suggestions for
                 future work.",
  acknowledgement = ack-nhfb,
  affiliation =  "Systems Technology Lab, Austin, TX, USA",
  affiliationaddress = "Systems Technology Lab, Austin, TX, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "abstract data types; code sharing; codes, symbolic;
                 computer metatheory --- Programming Theory; computer
                 programming; computer software; inheritance;
                 object-oriented programming; polymorphism, languages;
                 Theory; theory; type theories",
  subject =      "{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Data types and structures.
                 {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Studies of Program Constructs, Type
                 structure. {\bf F.4.1}: Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Lambda calculus and related systems.",
}

@Article{March:1988:ATIb,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "2",
  pages =        "73--73",
  month =        jun,
  year =         "1988",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:24:23 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1988:AAb,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "2",
  pages =        "75--75",
  month =        jun,
  year =         "1988",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:24:23 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1988:EP,
  author =       "Salvatore T. March",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "2",
  pages =        "77--84",
  month =        jun,
  year =         "1988",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:24:23 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Enbody:1988:DHS,
  author =       "R. J. Enbody and H. C. Du",
  title =        "Dynamic Hashing Schemes",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "2",
  pages =        "85--113",
  month =        jun,
  year =         "1988",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/46157.330532",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:37:30 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A new type of dynamic file access called {\em dynamic
                 hashing\/} has recently emerged. It promises the
                 flexibility of handling dynamic files while preserving
                 the fast access times expected from hashing. Such a
                 fast, dynamic file access scheme is needed to support
                 modern database systems. This paper surveys dynamic
                 hashing schemes and examines their critical design
                 issues.",
  acknowledgement = ack-nhfb,
  affiliation =  "Michigan State Univ, East Lansing, MI, USA",
  affiliationaddress = "Michigan State Univ, East Lansing, MI, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database management; database systems; dynamic file
                 access; dynamic hashing; Dynamic hashing, data
                 processing; File Organization; hash-table
                 representations",
}

@Article{Kraemer:1988:CBS,
  author =       "Kenneth L. Kraemer and John Leslie King",
  title =        "Computer-Based Systems for Cooperative Work and Group
                 Decision Making",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "2",
  pages =        "115--146",
  month =        jun,
  year =         "1988",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/46157.46158",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:37:30 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/46158.html",
  abstract =     "Application of computer and communications technology
                 to cooperative work and group decision making has grown
                 out of three traditions: computer-based communications,
                 computer-based information service provision, and
                 computer-based decision support. This paper reviews the
                 group decision support systems (GDSSs) that have been
                 configured to meet the needs of groups at work, and
                 evaluates the experience to date with such systems.
                 Progress with GDSSs has proved to be slower than
                 originally anticipated because of shortcomings with
                 available technology, poor integration of the various
                 components of the computing `package,' and incomplete
                 understanding of the nature of group decision making.
                 Nevertheless, the field shows considerable promise with
                 respect to the creation of tools to aid in group
                 decision making and the development of sophisticated
                 means of studying the dynamics of decision making in
                 groups.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California, Irvine, CA, USA",
  affiliationaddress = "Univ of California, Irvine, CA, USA",
  classification = "722; 723; 901",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Applications; computer-based systems; cooperative
                 work; decision support; decision theory and analysis;
                 experimentation; group decision making; human factors;
                 management, computer systems, digital; technology ---
                 Economic and Sociological Effects; teleconferencing",
  subject =      "{\bf K.6.0}: Computing Milieux, MANAGEMENT OF
                 COMPUTING AND INFORMATION SYSTEMS, General. {\bf
                 K.4.3}: Computing Milieux, COMPUTERS AND SOCIETY,
                 Organizational Impacts. {\bf J.1}: Computer
                 Applications, ADMINISTRATIVE DATA PROCESSING. {\bf
                 J.7}: Computer Applications, COMPUTERS IN OTHER
                 SYSTEMS.",
}

@Article{March:1988:ATIc,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "3",
  pages =        "149--149",
  month =        sep,
  year =         "1988",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:28:04 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1988:AAc,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "3",
  pages =        "151--151",
  month =        sep,
  year =         "1988",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:28:04 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Peckham:1988:SDM,
  author =       "Joan Peckham and Fred Maryanski",
  title =        "Semantic Data Models",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "3",
  pages =        "153--189",
  month =        sep,
  year =         "1988",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/62061.62062",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:37:37 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/62062.html",
  abstract =     "Semantic data models have emerged from a requirement
                 for more expressive conceptual data models. Current
                 generation data models lack direct support for
                 relationships, data abstraction, inheritance,
                 constraints, unstructured objects, and the dynamic
                 properties of an application. Although the need for
                 data models with richer semantics is widely recognized,
                 no single approach has won general acceptance. This
                 paper describes the generic properties of semantic data
                 models and presents a representative selection of
                 models that have been proposed since the mid-1970s. In
                 addition to explaining the features of the individual
                 models, guidelines are offered for the comparison of
                 models. The paper concludes with a discussion of future
                 directions in the area of conceptual data modeling.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Connecticut",
  affiliationaddress = "Storrs, CT, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Conceptual Data Models; Database Languages; design;
                 languages, Database Systems; Logical Database Design;
                 Semantic Data Models",
  subject =      "{\bf D.2.1}: Software, SOFTWARE ENGINEERING,
                 Requirements/Specifications, Methodologies. {\bf
                 D.2.10}: Software, SOFTWARE ENGINEERING, Design. {\bf
                 D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Design languages. {\bf H.2.1}:
                 Information Systems, DATABASE MANAGEMENT, Logical
                 Design, Data models. {\bf H.2.3}: Information Systems,
                 DATABASE MANAGEMENT, Languages, Data description
                 languages (DDL). {\bf I.2.4}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Knowledge Representation
                 Formalisms and Methods, Semantic networks. {\bf K.6.3}:
                 Computing Milieux, MANAGEMENT OF COMPUTING AND
                 INFORMATION SYSTEMS, Software Management, Software
                 development.",
}

@Article{Mannino:1988:SPE,
  author =       "Michael V. Mannino and Paicheng Chu and Thomas Sager",
  title =        "Statistical Profile Estimation in Database Systems",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "3",
  pages =        "191--221",
  month =        sep,
  year =         "1988",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/62061.62063",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:37:37 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/62063.html",
  abstract =     "A statistical profile summarizes the instances of a
                 database. It describes aspects such as the number of
                 tuples, the number of values, the distribution of
                 values, the correlation between value sets, and the
                 distribution of tuples among secondary storage units.
                 Estimation of database profiles is critical in the
                 problems of query optimization, physical database
                 design, and database performance prediction. This paper
                 describes a model of a database of profile, relates
                 this model to estimating the cost of database
                 operations, and surveys methods of estimating profiles.
                 The operators and objects in the model include build
                 profile, estimate profile, and update profile. The
                 estimate operator is classified by the relational
                 algebra operator (select, project, join), the property
                 to be estimated (cardinality, distribution of values,
                 and other parameters), and the underlying method
                 (parametric, nonparametric, and ad-hoc). The accuracy,
                 overhead, and assumptions of methods are discussed in
                 detail. Relevant research in both the database and the
                 statistics disciplines is incorporated in the detailed
                 discussion.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin",
  affiliationaddress = "Austin, TX, USA",
  annote =       "A statistical profile summarizes the number of tuples
                 and values, the distribution of values, the correlation
                 between value sets, and the distribution of tuples
                 among storage units.. This paper surveys methods of
                 estimating profiles (parametric, nonparametric and
                 ad-hoc methods).",
  classification = "723; 921; 922",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Boolean Expressions; Database Profile;
                 languages; Mathematical Techniques--Estimation;
                 performance, Database Systems; Relational; Statistical
                 Methods; Statistical Profile Estimation",
  subject =      "{\bf H.0}: Information Systems, GENERAL. {\bf H.2.2}:
                 Information Systems, DATABASE MANAGEMENT, Physical
                 Design, Access methods. {\bf H.2.3}: Information
                 Systems, DATABASE MANAGEMENT, Languages, Query
                 languages. {\bf H.2.4}: Information Systems, DATABASE
                 MANAGEMENT, Systems, Query processing. {\bf H.3.3}:
                 Information Systems, INFORMATION STORAGE AND RETRIEVAL,
                 Information Search and Retrieval, Query formulation.",
}

@Article{March:1988:ATId,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "4",
  pages =        "223--224",
  month =        dec,
  year =         "1988",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:30:17 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1988:AAd,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "4",
  pages =        "225--225",
  month =        dec,
  year =         "1988",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:30:17 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Johnson:1988:SST,
  author =       "Allen M. {Johnson, Jr.} and Miroslaw Malek",
  title =        "Survey of Software Tools for Evaluating Reliability,
                 Availability, and Serviceability",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "4",
  pages =        "227--269",
  month =        dec,
  year =         "1988",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/50020.50062",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:37:47 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1988.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/50062.html",
  abstract =     "In computer design, it is essential to know the
                 effectiveness of different design options in improving
                 performance and dependability. Various software tools
                 have been created to evaluate these parameters,
                 applying both analytic and simulation techniques, and
                 this paper reviews those related primarily to
                 reliability, availability, and serviceability. The
                 purpose, type of models used, type of systems modeled,
                 inputs, and outputs are given for each package.
                 Examples of some of the key modeling elements such as
                 Markov chains, fault trees, and Petri nets are
                 discussed. The information is compiled to facilitate
                 recognition of similarities and differences between
                 various models and tools and can be used to aid in
                 selecting models and tools for a particular application
                 or designing tools for future needs. Tools included in
                 the evaluation are CARE-III, ARIES-82, SAVE, MARKl,
                 HARP, SHARPE, GRAMP, SURF, SURE, ASSIST, METASAN,
                 METFAC, ARM, and SUPER. Modeling tools, such as REL70,
                 RELCOMP, CARE, CARSRA, and CAST, that were forerunners
                 to some of the current tools are noted for their
                 contributions. Modeling elements that have gained
                 widespread use for general systems, as well as
                 fault-tolerant systems, are included. Tools capable of
                 modeling both repairable and nonrepairable systems,
                 accepting constant or time varying failure rates, and
                 predicting reliability, availability, and
                 serviceability parameters are surveyed.",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM",
  affiliationaddress = "Austin, TX, USA",
  classification = "722; 723; 913",
  descriptors =  "Reliability; method; survey; Petri net",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Availability; Computer Software; Maintainability;
                 measurement; Reliability; reliability, Computer
                 Systems, Digital; Serviceability; Software Tools",
  subject =      "{\bf C.4}: Computer Systems Organization, PERFORMANCE
                 OF SYSTEMS, Reliability, availability, and
                 serviceability. {\bf C.4}: Computer Systems
                 Organization, PERFORMANCE OF SYSTEMS, Measurement
                 techniques. {\bf C.4}: Computer Systems Organization,
                 PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf
                 I.6.3}: Computing Methodologies, SIMULATION AND
                 MODELING, Applications.",
}

@Article{Samet:1988:HRC,
  author =       "Hanan Samet",
  title =        "Hierarchical Representations of Collections of Small
                 Rectangles",
  journal =      j-COMP-SURV,
  volume =       "20",
  number =       "4",
  pages =        "271--309",
  month =        dec,
  year =         "1988",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/50020.50021",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:37:47 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/50021.html",
  abstract =     "A tutorial survey is presented of hierarchical data
                 structures for representing collections of small
                 rectangles. Rectangles are often used as an
                 approximation of shapes for which they serve as the
                 minimum rectilinear enclosing object. They arise in
                 applications in cartography as well as very large-scale
                 integration (VLSI) design rule checking. The different
                 data structures are discussed in terms of how they
                 support the execution of queries involving proximity
                 relations. The focus is on intersection and subset
                 queries. Several types of representations are
                 described. Some are designed for use with the
                 plane-sweep paradigm, which works well for static
                 collections of rectangles. Others are oriented toward
                 dynamic collections. In this case, one representation
                 reduces each rectangle to a point in a higher
                 multidimensional space and treats the problem as one
                 involving point data. The other representation is area
                 based --- that is, it depends on the physical extent of
                 each rectangle.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Maryland",
  affiliationaddress = "College Park, MD, USA",
  classification = "405; 714; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Cartography; Collections of Small
                 Rectangles; Data Structures; Design Rule Checking;
                 Hierarchical Representations; Image Processing;
                 Integrated Circuits, VLSI--Computer Aided Design; Maps
                 and Mapping--Computer Applications; theory, Data
                 Processing",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf B.7.2}:
                 Hardware, INTEGRATED CIRCUITS, Design Aids, Layout.
                 {\bf B.7.2}: Hardware, INTEGRATED CIRCUITS, Design
                 Aids, Placement and routing. {\bf E.1}: Data, DATA
                 STRUCTURES, Trees. {\bf E.5}: Data, FILES,
                 Organization/structure. {\bf F.2.2}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Geometrical problems and computations. {\bf F.2.2}:
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Routing and layout. {\bf H.2.2}: Information
                 Systems, DATABASE MANAGEMENT, Physical Design, Access
                 methods. {\bf H.3.2}: Information Systems, INFORMATION
                 STORAGE AND RETRIEVAL, Information Storage, File
                 organization. {\bf I.2.10}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Vision and Scene
                 Understanding, Representations, data structures, and
                 transforms. {\bf J.6}: Computer Applications,
                 COMPUTER-AIDED ENGINEERING, Computer-aided design
                 (CAD).",
}

@Article{March:1989:ATIa,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1989",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1989:AAa,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "1",
  pages =        "3--3",
  month =        mar,
  year =         "1989",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hartson:1989:HCI,
  author =       "H. Rex Hartson and Deborah Hix",
  title =        "Human-Computer Interface Development: Concepts and
                 Systems for Its Management",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "1",
  pages =        "5--92",
  month =        mar,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/62029.62031",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:37:55 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/62031.html",
  abstract =     "Human-computer interface management, from a computer
                 science viewpoint, focuses on the process of developing
                 quality human-computer interfaces, including their
                 representation, design, implementation, execution,
                 evaluation, and maintenance. This survey presents
                 important concepts of interface management: dialogue
                 independence, structural modeling, representation,
                 interactive tools, rapid prototyping, development
                 methodologies, and control structures. Dialogue
                 independence is the keystone concept upon which all the
                 other concepts depend. It is a characteristic that
                 separates design of the interface from design of the
                 computational component of an application system so
                 that modifications in either tend not to cause changes
                 in the other. The role of a dialogue developer, whose
                 main purpose is to create quality interfaces, is a
                 direct result of the dialogue independence concept.
                 Structural models of the human-computer interface serve
                 as frameworks for understanding the elements of
                 interfaces and for guiding the dialogue developer in
                 their construction. Representation of the
                 human-computer interface is accomplished by a variety
                 of notational schemes for describing the interface.
                 Numerous kinds of interactive tools for human-computer
                 interface development free the dialogue developer from
                 much of the tedium of 'coding' dialogue. The early
                 ability to observe behavior of the interface --- and
                 indeed that of the whole application system ---
                 provided by rapid prototyping increases communication
                 among system designers, implementors, evaluators, and
                 end-users. Methodologies for interactive system
                 development consider interface management to be an
                 integral part of the overall development process and
                 give emphasis to evaluation in the development life
                 cycle. Finally, several types of control structures
                 govern how sequencing among dialogue and computational
                 components is designed and executed. Numerous systems
                 for human-computer interface management are presented t
                 o illustrate these concepts.",
  acknowledgement = ack-nhfb,
  affiliation =  "Virginia Polytechnic Inst \& State Univ",
  affiliationaddress = "Blacksburg, VA, USA",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Computer Interfaces--Human Factors;
                 Computer Software--Software Engineering; design;
                 Dialogue Developer; Dialogue Independence; Human
                 Computer Interface; human factors; Interface
                 Management; Man Machine Systems; management; theory,
                 Systems Science and Cybernetics; User Interface",
  review =       "ACM CR 8911-0841",
  subject =      "{\bf K.6.1}: Computing Milieux, MANAGEMENT OF
                 COMPUTING AND INFORMATION SYSTEMS, Project and People
                 Management. {\bf H.1.2}: Information Systems, MODELS
                 AND PRINCIPLES, User/Machine Systems. {\bf D.2.2}:
                 Software, SOFTWARE ENGINEERING, Tools and Techniques.
                 {\bf D.2.10}: Software, SOFTWARE ENGINEERING, Design,
                 Methodologies.",
}

@Article{Knight:1989:UMS,
  author =       "Kevin Knight",
  title =        "Unification: a Multidisciplinary Survey",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "1",
  pages =        "93--124",
  month =        mar,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/62029.62030",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  MRclass =      "68T15 (03B35 03B70 68N17)",
  MRnumber =     "91g:68142",
  bibdate =      "Thu Jun 19 09:37:55 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/62030.html",
  abstract =     "The unification problem and several variants are
                 presented. Various algorithms and data structures are
                 discussed. Research on unification arising in several
                 areas of computer science is surveyed; these areas
                 include theorem proving, logic programming, and natural
                 language processing. Sections of the paper include
                 examples that highlight particular uses of unification
                 and the special problems encountered. Other topics
                 covered are resolution, higher order logic, the occur
                 check, infinite terms, feature structures, equational
                 theories, inheritance, parallel algorithms,
                 generalization, lattices, and other applications of
                 unification. The paper is intended for readers with a
                 general computer science background --- no specific
                 knowledge of any of the above topics is assumed.",
  acknowledgement = ack-nhfb,
  affiliation =  "Carnegie-Mellon Univ",
  affiliationaddress = "Pittsburgh, PA, USA",
  classification = "721; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Artificial Intelligence; Computational
                 Complexity; Computer Metatheory; Equational Theories;
                 Feature Structures; Higher Order Logic; languages,
                 Automata Theory; Logic Programming; Natural Language
                 Processing; Theorem Proving",
  review =       "ACM CR 9005-0423",
  subject =      "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Deduction and Theorem Proving. {\bf
                 I.1.3}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Languages and Systems, Substitution
                 mechanisms. {\bf E.1}: Data, DATA STRUCTURES, Graphs.
                 {\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Pattern matching. {\bf I.2.7}:
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Natural Language Processing.",
}

@Article{March:1989:ATIb,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "2",
  pages =        "125--126",
  month =        jun,
  year =         "1989",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1989:AAb,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "2",
  pages =        "127--127",
  month =        jun,
  year =         "1989",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1989:EP,
  author =       "Salvatore T. March",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "2",
  pages =        "129--136",
  month =        jun,
  year =         "1989",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Sep 29 23:55:40 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Abramson:1989:CST,
  author =       "Bruce Abramson",
  title =        "Control Strategies for Two-Player Games",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "2",
  pages =        "137--161",
  month =        jun,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/66443.66444",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  MRclass =      "90D05",
  MRnumber =     "1 072 799",
  bibdate =      "Thu Jun 19 09:38:07 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/66444.html",
  abstract =     "Computer games have been around for almost as long as
                 computers. Most of these games, however, have been
                 designed in a rather ad hoc manner because many of
                 their basic components have never been adequately
                 defined. In this paper some deficiencies in the
                 standard model of computer games, the minimax model,
                 are pointed out and the issues that a general theory
                 must address are outlined. Most of the discussion is
                 done in the context of control strategies, or sets of
                 criteria for move selection. A survey of control
                 strategies brings together results from two fields:
                 implementations of real games and theoretical
                 predictions derived on simplified game-trees. The
                 interplay between these results suggests a series of
                 open problems that have arisen during the course of
                 both analytic experimentation and practical experience
                 as the basis for a formal theory.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Southern California",
  affiliationaddress = "Los Angeles, CA, USA",
  classification = "723; 922",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Artificial Intelligence; Computer Games;
                 Computer Programming--Algorithms; Computer
                 Software--Applications; design; experimentation; Game
                 Theory; Mathematical Techniques--Trees; Minimax Model;
                 theory, Probability",
  review =       "ACM CR 9007-0605",
  subject =      "{\bf I.2.1}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Applications and Expert Systems, Games.
                 {\bf I.6.1}: Computing Methodologies, SIMULATION AND
                 MODELING, Simulation Theory, Model classification. {\bf
                 I.2.8}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Problem Solving, Control Methods, and
                 Search, Graph and tree search strategies.",
}

@Article{Ellman:1989:EBL,
  author =       "Thomas Ellman",
  title =        "Explanation-Based Learning: a Survey of Programs and
                 Perspectives",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "2",
  pages =        "163--221",
  month =        jun,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/66443.66445",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:38:07 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/66445.html",
  abstract =     "Explanation-based learning (EBL) is a technique by
                 which an intelligent system can learn by observing
                 examples. EBL systems are characterized by the ability
                 to create justified generalizations from single
                 training instances. They are also distinguished by
                 their reliance on background knowledge of the domain
                 under study. Although EBL is usually viewed as a method
                 for performing generalization, it can be viewed in
                 other ways as well. In particular, EBL can be seen as a
                 method that performs four different learning tasks:
                 generalization, chunking, operationalization, and
                 analogy. This paper provides a general introduction to
                 the field of explanation-based learning. Considerable
                 emphasis is placed on showing how EBL combines the four
                 learning tasks mentioned above. The paper begins with a
                 presentation of an intuitive example of the EBL
                 technique. Subsequently EBL is placed in its historical
                 context and the relation between EBL and other areas of
                 machine learning is described. The major part of this
                 paper is a survey of selected EBL programs, which have
                 been chosen to show how EBL manifests each of the four
                 learning tasks. Attempts to formalize the EBL technique
                 are also briefly discussed. The paper concludes with a
                 discussion of the limitations of EBL and the major open
                 questions in the field.",
  acknowledgement = ack-nhfb,
  affiliation =  "Columbia Univ",
  affiliationaddress = "New York, NY, USA",
  classification = "723; 731",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Applications; design; experimentation, Artificial
                 Intelligence; Explanation-Based Learning (EBL);
                 Knowledge Acquisition; Systems Science and
                 Cybernetics--Learning Systems",
  subject =      "{\bf I.2.6}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Learning.",
}

@Article{Colbourn:1989:ACD,
  author =       "Charles J. Colbourn and Paul C. {van Oorschot}",
  title =        "Applications of Combinatorial Designs in Computer
                 Science",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "2",
  pages =        "223--250",
  month =        jun,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/66443.66446",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  MRclass =      "68Q25 (05B05 68P05 68R05 94A60)",
  MRnumber =     "91g:68078",
  bibdate =      "Thu Jun 19 09:38:07 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Mandl:1990:SF}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/66446.html",
  abstract =     "The theory of combinatorial designs has been used in
                 widely different areas of computation concerned with
                 the design and analysis of both algorithms and
                 hardware. Combinatorial designs capture a subtle
                 balancing property that is inherent in many difficult
                 problems and hence can provide a sophisticated tool for
                 addressing these problems. The role of combinatorial
                 designs in solving many problems that are basic to the
                 field of computing is explored in this paper. Case
                 studies of many applications of designs to computation
                 are given; these constitute a first survey, which
                 provides a representative sample of uses of designs.
                 More importantly, they suggest paradigms in which
                 designs can be used profitably in algorithm design and
                 analysis.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Waterloo",
  affiliationaddress = "Waterloo, Ont, Can",
  classification = "722; 723; 921",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Algorithms; Combinatorial Design Theory, algorithms;
                 Computer Programming; Computer Science; Computer
                 Systems, Digital--Parallel Processing; Data
                 Processing--File Organization; design; Mathematical
                 Techniques--Combinatorial Mathematics; reliability;
                 security; theory",
  review =       "ACM CR 9006-0507",
  subject =      "{\bf G.2.1}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Combinatorics, Combinatorial algorithms.
                 {\bf G.2.2}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory, Network problems. {\bf
                 B.6.1}: Hardware, LOGIC DESIGN, Design Styles,
                 Combinational logic. {\bf B.6.3}: Hardware, LOGIC
                 DESIGN, Design Aids. {\bf F.2.2}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Routing and layout. {\bf F.2.2}: Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems, Sorting and
                 searching.",
}

@Article{March:1989:ATIc,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "3",
  pages =        "251--251",
  month =        sep,
  year =         "1989",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wegner:1989:ISI,
  author =       "Peter Wegner",
  title =        "{Guest Editor}'s Introduction to the Special Issue on
                 Programming Language Paradigms",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "3",
  pages =        "253--258",
  month =        sep,
  year =         "1989",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:40:15 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1989:AAc,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "3",
  pages =        "259--260",
  month =        sep,
  year =         "1989",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bal:1989:PLD,
  author =       "Henri E. Bal and Jennifer G. Steiner and Andrew S.
                 Tanenbaum",
  title =        "Programming Languages for Distributed Computing
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "3",
  pages =        "261--322",
  month =        sep,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/72551.72552",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:38:19 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/72552.html",
  abstract =     "When distributed systems first appeared, they were
                 programmed in traditional sequential languages, usually
                 with the addition of a few library procedures for
                 sending and receiving messages. As distributed
                 applications became more commonplace and more
                 sophisticated, this ad hoc approach became less
                 satisfactory. Researchers all over the world began
                 designing new programming languages specifically for
                 implementing distributed applications. These languages
                 and their history, their underlying principles, their
                 design, and their use are the subject of this paper. We
                 begin by giving our view of what a distributed system
                 is, illustrating with examples to avoid confusion on
                 this important and controversial point. We then
                 describe the three main characteristics that
                 distinguish distributed programming languages from
                 traditional sequential languages, namely, how they deal
                 with parallelism, communication, and partial failures.
                 Finally, we discuss 15 representative distributed
                 languages to give the flavor of each. These examples
                 include languages based on message passing, rendezvous,
                 remote procedure call, objects, and atomic
                 transactions, as well as functional languages, logic
                 languages, and distributed data structure languages.
                 The paper concludes with a comprehensive bibliography
                 listing over 200 papers on nearly 100 distributed
                 programming languages.",
  acknowledgement = ack-nhfb,
  affiliation =  "Vrije Univ",
  affiliationaddress = "Amsterdam, Neth",
  annote =       "Not a great survey, but a good one. It does not
                 mention issues closer to what people think as operating
                 system issues. But, it represents a good reference
                 point with all these languages [a few of which I've
                 never heard]: ABCL/1, Act 1, Ada, Aeolus, ALPS, AMPL,
                 Argus, Avalon, Blaze, BNR Pascal, BRAVE, Camelot
                 Library, Cantor, [Concurrent CSP] CCSP, [Xerox] Cedar,
                 CLIX, Cluster 86, CMAY, Concurrent C [2], Concurrent
                 CLU, Concurrent LISP, Concurrent PROLOG, Concurrent
                 Smalltalk, CONIC, CSM, CSP-S, CSP/80, CSP, CSPS, CSSA,
                 Delta PROLOG, Dislang, Distributed Smalltalk, DP,
                 DPL-82, ECSP, Emerald, EPL, FRANK, FX-87, GDPL, GHC,
                 GYPSY, Hybrid, Joyce, LADY, LIMP, Linda, Lisptalk,
                 LYNX, MC, Mandala, Mentat, MENYMA/S, Multilisp, NIL,
                 Oc, Occam, OIL, Ondine, Orca, Orient84/K, P*, P-PROLOG,
                 ParAlfl, PARLOG, ParMod, Pascal+CSP, Pascal-FC,
                 Pascal-m, PCL, Planet, Platon, PLITS, PML, POOL, Port
                 Language, Pronet, Quty, QLISP, Raddle, RBCSP,
                 Relational Language, SDL, SINA, Sloop, SR, StarMod,
                 Symmetric LISP, Vulcan, ZENO. It still lacks, but it
                 depends on the definition of a distributed language. No
                 mention of atomicity.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Categories and Subject Descriptors: C.2.4
                 [Computer-Communications Networks]: Distributed Systems
                 - distributed applications; Computer Programming
                 Languages; Computer Systems, Digital--Distributed;
                 Concurrent Programming; D.1.3 [Programming Techniques]:
                 Concurrent Programming; D.3.3 [Programming Languages]:
                 Language constructs - concurrent programming
                 structures; D.4.7 [Operating Systems]: Organization and
                 Design - distributed systems General Terms: Languages;
                 design; Design Additional Key Words and Phrases:
                 Distributed data structures; distributed languages;
                 Distributed Programming; distributed programming;
                 Functional Programming; functional programming;
                 languages; languages for distributed programming;
                 languages for parallel programming; Logic Programming;
                 logic programming; Object Oriented Programming,
                 algorithms; object-oriented programming; Parallel
                 Programming; parallel programming; performance; special
                 issue on programming language paradigms",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Specialized application languages.
                 {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES,
                 Concurrent Programming. {\bf D.3.3}: Software,
                 PROGRAMMING LANGUAGES, Language Constructs and
                 Features, Concurrent programming structures. {\bf
                 C.2.4}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
                 Distributed applications.",
}

@Article{Carriero:1989:HWP,
  author =       "Nicholas Carriero and David Gelernter",
  title =        "How to Write Parallel Programs: a Guide to the
                 Perplexed",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "3",
  pages =        "323--357",
  month =        sep,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/72551.72553",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:38:19 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/72553.html",
  abstract =     "We present a framework for parallel programming, based
                 on three conceptual classes for understanding
                 parallelism and three programming paradigms for
                 implementing parallel programs. The conceptual classes
                 are result parallelism, which centers on parallel
                 computation of all elements in a data structure; agenda
                 parallelism, which specifies an agenda of tasks for
                 parallel execution; and specialist parallelism, in
                 which specialist agents solve problems cooperatively.
                 The programming paradigms center on live data
                 structures that transform themselves into result data
                 structures; distributed data structures that are
                 accessible to many processes simultaneously; and
                 message passing, in which all data objects are
                 encapsulated within explicitly communicating processes.
                 There is a rough correspondence between the conceptual
                 classes and the programming methods, as we discuss. We
                 begin by outlining the basic conceptual classes and
                 programming paradigms, and by sketching an example
                 solution under each of the three paradigms. The final
                 section develops a simple example in greater detail,
                 presenting and explaining code and discussing its
                 performance on two commercial parallel computers, an
                 18-node shared-memory multiprocessor, and a 64-node
                 distributed-memory hypercube. The middle section
                 bridges the gap between the abstract and the practical
                 by giving an overview of how the basic paradigms are
                 implemented. We focus on the paradigms, not on machine
                 architecture or programming languages: The programming
                 methods we discuss are useful on many kinds of parallel
                 machine, and each can be expressed in several different
                 parallel programming languages. Our programming
                 discussion and the examples use the parallel language
                 C-Linda for several reasons: The main paradigms are all
                 simple to express in Linda; efficient Linda
                 implementations exist on a wide variety of parallel
                 machines; and a wide variety of parallel programs have
                 been written in Linda.",
  acknowledgement = ack-nhfb,
  affiliation =  "Yale Univ",
  affiliationaddress = "New Haven, CT, USA",
  annote =       "From page 326: It is nonetheless a subtle but
                 essential point that these approaches represent three
                 clearly separate ways of thinking about the problem:
                 Result parallelism focuses on the shape of the finished
                 product; specialist parallelism focuses on the makeup
                 of the work crew; and agenda parallelism focuses on the
                 list of tasks to be performed. Also the terms:
                 message-passing, distributed data structures or live
                 data structures. Notes that it does not deal with data
                 parallelism (ala CM) nor speculative parallelism
                 (OR-parallelism). Tries to be practical, but it does
                 admit distributed programs are harder and more complex.
                 The authors distinguish between three classes of
                 parallelism, result, agenda, and specialist, and
                 between three roughly corresponding methods for
                 implementation, live data structures, distributed
                 (shared) data structures, and message passing systems.
                 The Linda model is then introduced and related to each
                 class and method, it serves as a kind of universal
                 model for describing the essential parallelism, as
                 opposed to sequential processes. An example is treated
                 in some detail.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Additional Key Words and Phrases: Linda; ag;
                 Categories and Subject Descriptors: D.1.3 [Programming
                 Techniques]: Concurrent Programming; Computer
                 Programming; Computer Systems, Digital--Parallel
                 Processing; Concurrent Programming; D.3.2 [Programming
                 Languages]: Language classifications - parallel
                 languages; D.3.3 [Programming Languages]: Language
                 constructs - concurrent programming structures; design;
                 E.1.m [Data Structures]: Miscellaneous - distributed
                 data structures; General Terms: Algorithms;
                 grecommended91; hcc; languages; live data structures;
                 Parallel Programming; parallel programming methodology;
                 parallelism; performance; Program Design; Programming
                 Paradigms; special issue on programming language
                 paradigms, Computer Programming Languages",
  review =       "ACM CR 9006-0487",
  subject =      "{\bf D.1.3}: Software, PROGRAMMING TECHNIQUES,
                 Concurrent Programming. {\bf F.1.2}: Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
                 Computation, Parallelism and concurrency. {\bf D.3.3}:
                 Software, PROGRAMMING LANGUAGES, Language Constructs
                 and Features, Concurrent programming structures. {\bf
                 D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Linda. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications, C.",
}

@Article{Hudak:1989:CEA,
  author =       "Paul Hudak",
  title =        "Conception, Evolution, and Application of Functional
                 Programming Languages",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "3",
  pages =        "359--411",
  month =        sep,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/72551.72554",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:38:19 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/72554.html",
  abstract =     "The foundations of functional programming languages
                 are examined from both historical and technical
                 perspectives. Their evolution is traced through several
                 critical periods: early work on lambda calculus and
                 combinatory calculus, Lisp, Iswim, FP, ML, and modern
                 functional languages such as Miranda and Haskell. The
                 fundamental premises on which the functional
                 programming methodology stands are critically analyzed
                 with respect to philosophical, theoretical, and
                 pragmatic concerns. Particular attention is paid to the
                 main features that characterize modern functional
                 languages: higher-order functions, lazy evaluation,
                 equations and pattern matching, strong static typing
                 and type inference, and data abstraction. In addition,
                 current research areas --- such as parallelism,
                 nondeterminism, input\slash output, and state-oriented
                 computations --- are examined with the goal of
                 predicting the future development and application of
                 functional languages.",
  acknowledgement = ack-nhfb,
  affiliation =  "Yale Univ",
  affiliationaddress = "New Haven, CT, USA",
  annote =       "This is the second paper in the special issue which
                 has a section on non-determinism [along with Bal, et
                 al] which begins with a statement which would sound
                 bizarre to non-programmers or those not familiar with
                 the issues of determinacy.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "ag; APL; Categories and Subject Descriptors: D.1.1
                 [Programming Techniques]: Applicative (Functional)
                 Programming; Computer Programming Languages; D.3.2
                 [Programming Languages]: Language classifications -
                 applicative languages; Data Abstraction; data-flow
                 languages; denotative [declarative] language; F.4.1
                 [Mathematical Logic and Formal Languages]: Mathematical
                 Logic - lambda calculus and related systems; FL; FP;
                 Functional Programming Languages; grecommended91;
                 Haskell; higher-order functions; Hope; Iswim; K.2
                 [History of Computing]: software General Terms:
                 Languages; KRC; Lambda Calculus; Lambda Calculus,
                 Additional Key Words and Phrases: Data abstraction;
                 languages; lazy evaluation; Lisp; Miranda; ML;
                 non-procedural languages; referential transparency;
                 SASL; special issue on programming language paradigms;
                 types; very-high-level languages",
  review =       "ACM CR 9006-0486",
  subject =      "{\bf D.1.1}: Software, PROGRAMMING TECHNIQUES,
                 Applicative (Functional) Programming. {\bf F.4.1}:
                 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Mathematical Logic, Lambda calculus and
                 related systems. {\bf F.1.2}: Theory of Computation,
                 COMPUTATION BY ABSTRACT DEVICES, Modes of Computation,
                 Parallelism and concurrency. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications,
                 Applicative languages.",
}

@Article{Shapiro:1989:FCL,
  author =       "Ehud Shapiro",
  title =        "The Family of Concurrent Logic Programming Languages",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "3",
  pages =        "413--510",
  month =        sep,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/72551.72555",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:38:19 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/72555.html",
  abstract =     "Concurrent logic languages are high-level programming
                 languages for parallel and distributed systems that
                 offer a wide range of both known and novel concurrent
                 programming techniques. Being logic programming
                 languages, they preserve many advantages of the
                 abstract logic programming model, including the logical
                 reading of programs and computations, the convenience
                 of representing data structures with logical terms and
                 manipulating them using unification, and the
                 amenability to metaprogramming. Operationally, their
                 model of computation consists of a dynamic set of
                 concurrent processes, communicating by instantiating
                 shared logical variables, synchronizing by waiting for
                 variables to be instantiated, and making
                 nondeterministic choices, possibly based on the
                 availability of values of variables. This paper surveys
                 the family of concurrent logic programming languages
                 within a uniform operational framework. It demonstrates
                 the expressive power of even the simplest language in
                 the family and investigates how varying the basic
                 synchronization and control constructs affect the
                 expressiveness and efficiency of the resulting
                 languages. In addition, the paper reports on techniques
                 for sequential and parallel implementation of languages
                 in this family, mentions their applications to date,
                 and relates these languages to the abstract logic
                 programming model, to the programming language PROLOG,
                 and to other concurrent computational models and
                 programming languages.",
  acknowledgement = ack-nhfb,
  affiliation =  "Weizmann Inst of Science",
  affiliationaddress = "Rehovot, Isr",
  annote =       "One of the best subsections and a reference [paper] is
                 entitled ``X = X Considered Harmful'' from a Japanese
                 paper not likely to be seen by many in the West [for
                 the Doc, distributed Oc, language]. Almost as good as
                 Backus' von Neumann liberation Turing lecture (1978).
                 Programming language types will understand the title.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Additional Key Words and Phrases: Atomic unification;
                 algorithms; Categories and Subject Descriptors: D.1.3
                 [Programming Techniques]: Concurrent Programming;
                 computational replay; Concurrent Logic Languages;
                 Concurrent Prolog; D.3.3 [Programming Languages]:
                 Language classification - ALPS; D.3.3 [Programming
                 Languages]: Language Constructs - concurrent
                 programming structures; D.4.1 [Operating Systems]:
                 Process management - concurrency; design; distributed
                 detection; Doc; don't-know and don't-care [latter
                 called indeterminism] non-determinism; F.1.2
                 [Computation by Abstract Devices]: Modes of Computation
                 - parallelism; F.3.2 [Logics and Meanings of Programs]:
                 Semantics of Programming Languages - operational
                 semantics; F.4.1 [Mathematical Logic and Formal
                 Languages]: Mathematical Logic - logic programming;
                 FCP; General Terms: Languages; guarded Horn Clauses;
                 incomplete messages; indeterminism; input matching;
                 language embedding; languages; Logic Programming; logic
                 variable; metainterpretation; mutual exclusion;
                 P-prolog; PARLOG; performance; process structures;
                 Prolog; short-circuit; snapshots; special issue on
                 programming language paradigms; streams;
                 synchronization; theory; transformational vs. reactive
                 languages, Computer Programming Languages",
  subject =      "{\bf D.1.3}: Software, PROGRAMMING TECHNIQUES,
                 Concurrent Programming. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications, Very
                 high-level languages. {\bf D.3.3}: Software,
                 PROGRAMMING LANGUAGES, Language Constructs and
                 Features, Concurrent programming structures. {\bf
                 D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Control structures. {\bf
                 D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Prolog. {\bf F.3.2}: Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages, Operational semantics. {\bf
                 F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND
                 FORMAL LANGUAGES, Mathematical Logic, Logic
                 programming. {\bf F.1.2}: Theory of Computation,
                 COMPUTATION BY ABSTRACT DEVICES, Modes of Computation,
                 Alternation and nondeterminism. {\bf F.1.2}: Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
                 Computation, Parallelism and concurrency. {\bf C.1.2}:
                 Computer Systems Organization, PROCESSOR ARCHITECTURES,
                 Multiple Data Stream Architectures (Multiprocessors),
                 Parallel processors.",
}

@Article{March:1989:ATId,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "4",
  pages =        "511--512",
  month =        dec,
  year =         "1989",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1989:AAd,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "4",
  pages =        "513--513",
  month =        dec,
  year =         "1989",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Adam:1989:SCM,
  author =       "Nabil R. Adam and John C. Wortmann",
  title =        "Security-Control Methods for Statistical Databases: a
                 Comparative Study",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "4",
  pages =        "515--556",
  month =        dec,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/76894.76895",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:38:50 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/76895.html",
  abstract =     "This paper considers the problem of providing security
                 to statistical databases against disclosure of
                 confidential information. Security-control methods
                 suggested in the literature are classified into four
                 general approaches: conceptual, query restriction, data
                 perturbation, and output perturbation. Criteria for
                 evaluating the performance of the various
                 security-control methods are identified.
                 Security-control methods that are based on each of the
                 four approaches are discussed, together with their
                 performance with respect to the identified evaluation
                 criteria. A detailed comparative analysis of the most
                 promising methods for protecting dynamic-online
                 statistical databases is also presented. To date no
                 single security-control method prevents both exact and
                 partial disclosures. There are, however, a few
                 perturbation-based methods that prevent exact
                 disclosure and enable the database administrator to
                 exercise 'statistical disclosure control.' Some of
                 these methods, however introduce bias into query
                 responses or suffer from the 0/1 query-set-size problem
                 (i.e., partial disclosure is possible in case of null
                 query set or a query set of size 1). We recommend
                 directing future research efforts toward developing new
                 methods that prevent exact disclosure and provide
                 statistical-disclosure control, while at the same time
                 do not suffer from the bias problem and the 0/1
                 query-set-size problem. Furthermore, efforts directed
                 toward developing a bias-correction mechanism and
                 solving the general problem of small query-set-size
                 would help salvage a few of the current
                 perturbation-based methods.",
  acknowledgement = ack-nhfb,
  affiliation =  "State Univ of New Jersey",
  affiliationaddress = "Newark, NJ, USA",
  annote =       "Survey examines different approaches; no single method
                 is adequate.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Data Processing--Security of Data; Database Security;
                 design; performance; Protection; security, Database
                 Systems; Statistical Databases",
  subject =      "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
                 General, Security, integrity, and protection. {\bf
                 H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing.",
}

@Article{Bell:1989:MTC,
  author =       "Timothy Bell and Ian H. Witten and John G. Cleary",
  title =        "Modeling for Text Compression",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "4",
  pages =        "557--591",
  month =        dec,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/76894.76896",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:38:50 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/76896.html",
  abstract =     "The best schemes for text compression use large models
                 to help them predict which characters will come next.
                 The actual next characters are coded with respect to
                 the prediction, resulting in compression of
                 information. Models are best formed adaptively, based
                 on the text seen so far. This paper surveys successful
                 strategies for adaptive modeling that are suitable for
                 use in practical text compression systems. The
                 strategies fall into three main classes: finite-context
                 modeling, in which the last few characters are used to
                 condition the probability distribution for the next
                 one; finite-state modeling, in which the distribution
                 is conditioned by the current state (and which subsumes
                 finite-context modeling as an important special case);
                 and dictionary modeling, in which strings of characters
                 are replaced by pointers into an evolving dictionary. A
                 comparison of different methods on the same sample
                 texts is included, along with an analysis of future
                 research directions.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Canterbury",
  affiliationaddress = "Christchurch, NZ",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Arithmetic Coding; Encoding;
                 experimentation; measurement, Codes, Symbolic; Text
                 Compression",
  subject =      "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
                 compaction and compression. {\bf H.1.1}: Information
                 Systems, MODELS AND PRINCIPLES, Systems and Information
                 Theory, Information theory.",
}

@Article{McDowell:1989:DCP,
  author =       "Charles E. McDowell and David P. Helmbold",
  title =        "Debugging Concurrent Programs",
  journal =      j-COMP-SURV,
  volume =       "21",
  number =       "4",
  pages =        "593--622",
  month =        dec,
  year =         "1989",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/76894.76897",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:38:50 MDT 2008",
  bibsource =    "ACM Computing Archive; Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.debug.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/76897.html",
  abstract =     "The main problems associated with debugging concurrent
                 programs are increased complexity, the `probe effect',
                 nonrepeatability, and the lack of a synchronized global
                 clock. The probe effect refers to the fact that any
                 attempt to observe the behavior of a distributed system
                 may change the behavior of that system. For some
                 parallel programs, different executions with the same
                 data will result in different results even without any
                 attempt to observe the behavior. Even when the behavior
                 can be observed, in many systems the lack of a
                 synchronized global clock makes the results of the
                 observation difficult to interpret. This paper
                 discusses these and other problems related to debugging
                 concurrent programs and presents a survey of current
                 techniques used in debugging concurrent programs.
                 Systems using three general techniques are described:
                 traditional or breakpoint style debuggers, event
                 monitoring systems, and static analysis systems. In
                 addition, techniques for limiting, organizing, and
                 displaying a large amount of data produced by the
                 debugging systems are discussed.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California at Santa Cruz",
  affiliationaddress = "Santa Cruz, CA, USA",
  annote =       "Good tables surveying the field in the Appendix.
                 Thanks Charlie.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Agora; algorithms; Amoeba; belvedere; BUGNET;
                 Categories and Subject Descriptors: A.1 [General
                 Literature]: Introductory and Survey; CBUG; cdbg;
                 Computer Systems, Digital--Distributed; Concurrent
                 Programs; D.1.3 [Programming Techniques]: Concurrent
                 Programming; D.2.4 [Software Engineering]: Program
                 Verification --assertion checkers; D.2.5 [Software
                 Engineering]: Testing and Debugging -- debugging aids;
                 dbxtool; defense; design; diagnostics; DISDEB; EDL;
                 event history; HARD; IDD; Instant; Jade; languages;
                 MAD; Meglos; monitors; mtdbx; Multibug; nondeterminism;
                 parallel processing; Parasight; pdbx; performance;
                 Pilgram; PPD; probe-effect; Program Debugging; program
                 replay; program visualization; Program Visualization;
                 RADAR; Recap; static analysis; symbolic execution;
                 tracing Additional Key Words and Phrases: Distributed
                 computing; Traveler; TSL; verification; Voyeur; YODA,
                 Computer Programming",
  subject =      "{\bf D.2.5}: Software, SOFTWARE ENGINEERING, Testing
                 and Debugging. {\bf D.1.3}: Software, PROGRAMMING
                 TECHNIQUES, Concurrent Programming. {\bf D.2.4}:
                 Software, SOFTWARE ENGINEERING, Program Verification,
                 Assertion checkers.",
}

@Article{March:1990:ATIa,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1990:AAa,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "1",
  pages =        "3--3",
  month =        mar,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{vandeGoor:1990:ODF,
  author =       "A. J. {van de Goor} and C. A. Verruijt",
  title =        "An Overview of Deterministic Functional {RAM} Chip
                 Testing",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "1",
  pages =        "5--33",
  month =        mar,
  year =         "1990",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/78949.78950",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:39:10 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/78950.html",
  abstract =     "This paper presents an overview of deterministic
                 functional RAM chip testing. Instead of the traditional
                 ad-hoc approach toward developing memory test
                 algorithms, a hierarchy of functional faults and tests
                 is presented, which is shown to cover all likely
                 functional memory faults. This is done by presenting a
                 novel way of categorizing the faults. All (possible)
                 fault combinations are discussed. Requirements are put
                 forward under which conditions a fault combination can
                 be detected. Finally, memory test algorithms that
                 satisfy the given requirements are presented.",
  acknowledgement = ack-nhfb,
  affiliation =  "Delft Univ of Technology",
  affiliationaddress = "Delft, Neth",
  classification = "713; 721; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Automatic Testing; Computer
                 Programming--Algorithms; design; experimentation; Fault
                 Detection; Functional ram Chip Testing; Integrated
                 Circuit Testing; Memory Testing; ram Chip Testing;
                 Random Access; reliability; Test Algorithms;
                 verification, Data Storage, Digital",
  subject =      "{\bf B.3.4}: Hardware, MEMORY STRUCTURES, Reliability,
                 Testing, and Fault-Tolerance, Test generation. {\bf
                 B.7.3}: Hardware, INTEGRATED CIRCUITS, Reliability and
                 Testing, Test generation. {\bf D.4.2}: Software,
                 OPERATING SYSTEMS, Storage Management, Main memory.
                 {\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and
                 Design Styles, Memory technologies.",
}

@Article{Abbott:1990:RSF,
  author =       "Russell J. Abbott",
  title =        "Resourceful Systems for Fault Tolerance, Reliability,
                 and Safety",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "1",
  pages =        "35--68",
  month =        mar,
  year =         "1990",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/78949.78951",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:39:10 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Sankar:1991:SFR,Strigini:1991:SFR,Abbott:1991:SFR}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/78951.html",
  abstract =     "Above all, it is vital to recognize that completely
                 guaranteed behavior is impossible and that there are
                 inherent risks in relying on computer systems in
                 critical environments. The unforeseen consequences are
                 often the most disastrous [Neumann 1986]. Section 1 of
                 this survey reviews the current state of the art of
                 system reliability, safety, and fault tolerance. The
                 emphasis is on the contribution of software to these
                 areas. Section 2 reviews current approaches to software
                 fault tolerance. It discusses why some of the
                 assumptions underlying hardware fault tolerance do not
                 hold for software. It argues that the current software
                 fault tolerance techniques are more accurately thought
                 of as delayed debugging than as fault tolerance. It
                 goes on to show that in providing both backtracking and
                 executable specifications, logic programming offers
                 most of the tools currently used in software fault
                 tolerance. Section 3 presents a generalization of the
                 recovery block approach to software fault tolerance,
                 called resourceful systems. Systems are resourceful if
                 they are able to determine whether they have achieved
                 their goals or, if not, to develop and carry out
                 alternate plans. Section 3 develops an approach to
                 designing resourceful systems based upon a functionally
                 rich architecture and an explicit goal orientation.",
  acknowledgement = ack-nhfb,
  affiliation =  "Aerospace Corp",
  affiliationaddress = "Los Angeles, CA, USA",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Computer Programming; design; Logic
                 Programming; N-Version Programming; Object-Oriented
                 Programming; Reliability; reliability, Computer
                 Software; Resourceful Systems; Software Fault
                 Tolerance; Software Safety",
  subject =      "{\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability,
                 Fault-tolerance. {\bf D.2.4}: Software, SOFTWARE
                 ENGINEERING, Program Verification, Reliability.",
}

@Article{March:1990:ATIb,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "2",
  pages =        "69--70",
  month =        jun,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1990:AAb,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "2",
  pages =        "71--71",
  month =        jun,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1990:EP,
  author =       "Salvatore T. March",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "2",
  pages =        "73--81",
  month =        jun,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Onvural:1990:SCQ,
  author =       "Raif O. Onvural",
  title =        "Survey of Closed Queueing Networks with Blocking",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "2",
  pages =        "83--121",
  month =        jun,
  year =         "1990",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/78919.78920",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:39:17 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1990.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/78920.html",
  abstract =     "Closed queueing networks are frequently used to model
                 complex service systems such as production systems,
                 communication systems, computer systems, and flexible
                 manufacturing systems. When limitations are imposed on
                 the queue sizes (i.e., finite queues), a phenomenon
                 called blocking occurs. Queueing networks with blocking
                 are, in general, difficult to treat. Exact closed form
                 solutions have been reported only in a few special
                 cases. Hence, most of the techniques that are used to
                 analyze such queueing networks are in the form of
                 approximations, numerical analysis, and simulation. In
                 this paper, we give a systematic presentation of the
                 literature related to closed queueing networks with
                 finite queues. The results are significant for both
                 researchers and practitioners.",
  acknowledgement = ack-nhfb,
  affiliation =  "BNR",
  affiliationaddress = "Research Triangle Park, NC, USA",
  annote =       "In this paper we give a systematic presentation of the
                 literature related to closed queueing networks with
                 finite queues.",
  classification = "723; 922",
  country =      "USA",
  date =         "06/08/90",
  descriptors =  "Closed queueing network; performance evaluation;
                 blocking; survey; finite capacity",
  enum =         "3866",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Blocking; Closed Queueing Networks;
                 Computer Systems, Digital--Performance; design;
                 Industrial Plants--Flexible Manufacturing Systems;
                 Markov Models; measurement; performance; Production
                 Systems; Queueing Networks; Queueing Theory;
                 Telecommunication Systems--Performance; theory,
                 Probability",
  language =     "English",
  references =   "73",
  subject =      "{\bf G.m}: Mathematics of Computing, MISCELLANEOUS,
                 Queueing theory. {\bf D.4.8}: Software, OPERATING
                 SYSTEMS, Performance, Queueing theory. {\bf D.4.8}:
                 Software, OPERATING SYSTEMS, Performance, Simulation.
                 {\bf C.4}: Computer Systems Organization, PERFORMANCE
                 OF SYSTEMS, Modeling techniques.",
}

@Article{Pawlikowski:1990:SSS,
  author =       "Krzysztof Pawlikowski",
  title =        "Steady-State Simulation of Queueing Processes: a
                 Survey of Problems and Solutions",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "2",
  pages =        "123--170",
  month =        jun,
  year =         "1990",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/78919.78921",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:39:17 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1990.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also \cite{Pawlikowski:1990:CSS}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/78921.html",
  abstract =     "For years computer-based stochastic simulation has
                 been a commonly used tool in the performance evaluation
                 of various systems. Unfortunately, the results of
                 simulation studies quite often have little credibility,
                 since they are presented without regard to their random
                 nature and the need for proper statistical analysis of
                 simulation output data. This paper discusses the main
                 factors that can affect the accuracy of stochastic
                 simulations designed to give insight into the
                 steady-state behavior of queuing processes. The
                 problems of correctly starting and stopping such
                 simulation experiments to obtain the required
                 statistical accuracy of the results are addressed. In
                 this survey of possible solutions, the emphasis is put
                 on possible applications in the sequential analysis of
                 output data, which adaptively decides about continuing
                 a simulation experiment until the required accuracy of
                 results is reached. A suitable solution for deciding
                 upon the starting point of a steady-state analysis and
                 two techniques for obtaining the final simulation
                 results to a required level of accuracy are presented,
                 together with pseudocode implementations.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Canterbury",
  affiliationaddress = "Christchurch, NZ",
  annote =       "This paper discusses the main factors that can affect
                 the accuracy of stochastic simulations designed to get
                 insight into the steady-state behaviour of queueing
                 processes.",
  classification = "723; 922",
  country =      "USA",
  date =         "06/08/90",
  descriptors =  "Simulation; queueing system; output analysis;
                 accuracy",
  enum =         "3867",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Computer Simulation; design;
                 experimentation; performance; Queueing Theory; Steady
                 State Simulation; Stochastic Simulations; theory,
                 Probability",
  language =     "English",
  references =   "191",
  subject =      "{\bf I.6.4}: Computing Methodologies, SIMULATION AND
                 MODELING, Model Validation and Analysis. {\bf D.4.8}:
                 Software, OPERATING SYSTEMS, Performance, Simulation.
                 {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance,
                 Queueing theory. {\bf D.4.8}: Software, OPERATING
                 SYSTEMS, Performance, Stochastic analysis. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical computing. {\bf G.3}: Mathematics of
                 Computing, PROBABILITY AND STATISTICS, Statistical
                 software.",
}

@Article{Mandl:1990:SF,
  author =       "Robert Mandl",
  title =        "Surveyor's Forum: {``Applications of Combinatorial
                 Designs in Computer Science''}",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "2",
  pages =        "171--171",
  month =        jun,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Colbourn:1989:ACD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1990:ATIc,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "3",
  pages =        "173--173",
  month =        sep,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Elmagarmid:1990:ISI,
  author =       "Ahmed K. Elmagarmid and Calton Pu",
  title =        "Introduction to the Special Issue on Heterogeneous
                 Databases",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "3",
  pages =        "175--178",
  month =        sep,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:52:12 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "CTPu",
}

@Article{March:1990:AAc,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "3",
  pages =        "179--181",
  month =        sep,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:32:26 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sheth:1990:FDS,
  author =       "Amit P. Sheth and James A. Larson",
  title =        "Federated Database Systems for Managing Distributed,
                 Heterogeneous, and Autonomous Databases",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "3",
  pages =        "183--236",
  month =        sep,
  year =         "1990",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/96602.96604",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:39:33 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Also published in/as: Bellcore, TM-STS-016302,
                 Jun.1990.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/96604.html",
  abstract =     "A federated database system (FDBS) is a collection of
                 cooperating database systems that are autonomous and
                 possibly heterogeneous. In this paper, we define a
                 reference architecture for distributed database
                 management systems from system and schema viewpoints
                 and show how various FDBS architectures can be
                 developed. We then define a methodology for developing
                 one of the popular architectures of an FDBS. Finally,
                 we discuss critical issues related to developing and
                 operating an FDBS.",
  acknowledgement = ack-nhfb,
  affiliation =  "Bellcore",
  affiliationaddress = "Piscataway, NJ, USA",
  annote =       "The paper reviews the various problem areas in
                 federated systems. Specifically schema translation,
                 access control, and schema integration. Also considered
                 are the issues of query translation for the various
                 nodes in the system. The paper also contains a good
                 introductory section on the federated model of DDBMS.
                 \ldots{} A good reference for federated database
                 systems architecture: a reference architecture,
                 customization to a specific architecture, system
                 development processes and tasks. Uses a reasonable
                 taxonomy of federated database systems. Contains many
                 bibliographic references.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; Distributed; Federated Database Systems;
                 Heterogeneous Database Systems; languages; management,
                 Database Systems",
  owner =        "curtis",
  subject =      "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems, Distributed systems. {\bf H.2.1}: Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Schema
                 and subschema. {\bf D.2.10}: Software, SOFTWARE
                 ENGINEERING, Design, Methodologies. {\bf H.2.4}:
                 Information Systems, DATABASE MANAGEMENT, Systems. {\bf
                 H.2.5}: Information Systems, DATABASE MANAGEMENT,
                 Heterogeneous Databases.",
}

@Article{Thomas:1990:HDD,
  author =       "Gomer Thomas and Glenn R. Thompson and Chin-Wan Chung
                 and Edward Barkmeyer and Fred Carter and Marjorie
                 Templeton and Stephen Fox and Berl Hartman",
  title =        "Heterogeneous Distributed Database Systems for
                 Production Use",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "3",
  pages =        "237--266",
  month =        sep,
  year =         "1990",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/96602.96607",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:39:33 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/96607.html",
  abstract =     "It is increasingly important for organizations to
                 achieve additional coordination of diverse computerized
                 operations. To do so, it is necessary to have database
                 systems that can operate over a distributed network and
                 can encompass a heterogeneous mix of computers,
                 operating systems, communications links, and local
                 database management systems. This paper outlines
                 approaches to various aspects of heterogeneous
                 distributed data management and describes the
                 characteristics and architectures of seven existing
                 heterogeneous distributed database systems developed
                 for production use. The objective is a survey of the
                 state of the art in systems targeted for production
                 environments as opposed to research prototypes.",
  acknowledgement = ack-nhfb,
  affiliation =  "Bellcore",
  affiliationaddress = "Piscataway, NJ, USA",
  annote =       "Review of ADDS (AMOCO), DATAPLEX (GM), IMDAS (NTST),
                 INGRES, STAR, MERMAID, MULTIBASE, SYBASE",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Database Systems; Distributed; Heterogeneous
                 Databases; management; Production Environments, design;
                 standardization",
  review =       "ACM CR 9211-0889",
  subject =      "{\bf H.2.5}: Information Systems, DATABASE MANAGEMENT,
                 Heterogeneous Databases. {\bf H.2.4}: Information
                 Systems, DATABASE MANAGEMENT, Systems, Distributed
                 systems. {\bf C.2.4}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
                 Distributed databases.",
}

@Article{Litwin:1990:IMA,
  author =       "Witold Litwin and Leo Mark and Nick Roussopoulos",
  title =        "Interoperability of Multiple Autonomous Databases",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "3",
  pages =        "267--293",
  month =        sep,
  year =         "1990",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/96602.96608",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:39:33 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Also published in/as: University of Maryland, Systems
                 Research Center, TR-89-12 and CS TR-2188, March 1989.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/96608.html",
  abstract =     "Database systems were a solution to the problem of
                 shared access to heterogeneous files created by
                 multiple autonomous applications in a centralized
                 environment. To make data usage easier, the files were
                 replaced by a globally integrated database. To a large
                 extent, the idea was successful, and many databases are
                 now accessible through local and long-haul networks.
                 Unavoidably, users now need shared access to multiple
                 autonomous databases. The question is what the
                 corresponding methodology should be. Should one reapply
                 the database approach to create globally integrated
                 distributed database systems or should a new approach
                 be introduced?\par

                 We argue for a new approach to solving such data
                 management system problems, called {\em multidatabase}
                 or {\em federated} systems. These systems make
                 databases interoperable, that is, usable without a
                 globally integrated schema. They preserve the autonomy
                 of each database yet support shared access.\par

                 Systems of this type will be of major importance in the
                 future. This paper first discusses why this is the
                 case. Then, it presents methodologies for their design.
                 It further shows that major commercial relational
                 database systems are evolving toward multidatabase
                 systems. The paper discusses their capabilities and
                 limitations, presents and discusses a set of
                 prototypes, and, finally, presents some current
                 research issues.",
  acknowledgement = ack-nhfb,
  affiliation =  "INRIA",
  affiliationaddress = "Fr",
  annote =       "Survey of existing federated databases, and example of
                 update transformation using MACSYMA.",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; Interoperability; languages; management,
                 Database Systems; Multiple Autonomous Databases",
  subject =      "{\bf H.2.5}: Information Systems, DATABASE MANAGEMENT,
                 Heterogeneous Databases. {\bf H.2.2}: Information
                 Systems, DATABASE MANAGEMENT, Physical Design, Access
                 methods. {\bf H.2.1}: Information Systems, DATABASE
                 MANAGEMENT, Logical Design, Schema and subschema. {\bf
                 C.2.4}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
                 Distributed databases. {\bf H.3.4}: Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Systems and
                 Software, Information networks.",
}

@Article{March:1990:ATId,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "4",
  pages =        "295--296",
  month =        dec,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:55:17 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1990:AAd,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "4",
  pages =        "297--297",
  month =        dec,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:55:17 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Schneider:1990:IFT,
  author =       "Fred B. Schneider",
  title =        "Implementing Fault-Tolerant Services Using the State
                 Machine Approach: a Tutorial",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "4",
  pages =        "299--319",
  month =        dec,
  year =         "1990",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/98163.98167",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:39:57 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/98167.html",
  abstract =     "The state machine approach is a general method for
                 implementing fault-tolerant services in distributed
                 systems. This paper reviews the approach and describes
                 protocols for two different failure models ---
                 Byzantine and fail stop. Systems reconfiguration
                 techniques for removing faulty components and
                 integrating repaired components are also discussed.",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, NY, USA",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Computer Networks --- Reliability; design;
                 Distributed Computing; Fault Tolerant Capability;
                 performance; Reconfiguration; reliability, Computer
                 Systems, Digital",
  subject =      "{\bf C.4}: Computer Systems Organization, PERFORMANCE
                 OF SYSTEMS, Reliability, availability, and
                 serviceability. {\bf C.2.4}: Computer Systems
                 Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Distributed Systems. {\bf C.2.2}: Computer Systems
                 Organization, COMPUTER-COMMUNICATION NETWORKS, Network
                 Protocols. {\bf D.4.5}: Software, OPERATING SYSTEMS,
                 Reliability, Fault-tolerance. {\bf D.4.7}: Software,
                 OPERATING SYSTEMS, Organization and Design, Real-time
                 and embedded systems.",
}

@Article{Levy:1990:DFS,
  author =       "Eliezer Levy and Abraham Silberschatz",
  title =        "Distributed File Systems: Concepts and Examples",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "4",
  pages =        "321--374",
  month =        dec,
  year =         "1990",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/98163.98169",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:39:57 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/98169.html",
  abstract =     "The purpose of a distributed file system (DFS) is to
                 allow users of physically distributed computers to
                 share data and storage resources by using a common file
                 system. A typical configuration for a DFS is a
                 collection of workstations and mainframes connected by
                 a local area network (LAN). A DFS is implemented as
                 part of the operating system of each of the connected
                 computers. This paper establishes a viewpoint that
                 emphasizes the dispersed structure and decentralization
                 of both data and control in the design of such systems.
                 It defines the concepts of transparency, fault
                 tolerance, and scalability and discusses them in the
                 context of DFSs. The paper claims that the principle of
                 distributed operation is fundamental for a fault
                 tolerant and scalable DFS design. It also presents
                 alternatives for the semantics of sharing and methods
                 for providing access to remote files. A survey of
                 contemporary UNIX-based systems, namely, UNIX United,
                 Locus, Sprite, Sun's Network File System, and ITC's
                 Andrew, illustrates the concepts and demonstrates
                 various implementations and design alternatives. Based
                 on the assessment of these systems, the paper makes the
                 point that a departure from the approach of extending
                 centralized file systems over a communication network
                 is necessary to accomplish sound distributed file
                 system design.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin",
  affiliationaddress = "Austin, TX, USA",
  annote =       "UNIX United, Locus, Sprite, SNFS, ITC's Andrew, a
                 departure is necessary to accomplish sound distributed
                 file system design; topics: location transparency and
                 independence, naming, caching, stateful vs stateless
                 service, availability, replication, scalability,
                 lightweight processes",
  classification = "722; 723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Computer Operating Systems; design; Distributed;
                 Distributed File Systems; reliability, Computer
                 Systems, Digital; Shared Data; Shared Storage",
  subject =      "{\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems
                 Management, Distributed file systems. {\bf C.2.5}:
                 Computer Systems Organization, COMPUTER-COMMUNICATION
                 NETWORKS, Local Networks. {\bf C.2.4}: Computer Systems
                 Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Distributed Systems, Network operating systems. {\bf
                 D.4.2}: Software, OPERATING SYSTEMS, Storage
                 Management. {\bf D.4.4}: Software, OPERATING SYSTEMS,
                 Communications Management, Network communication.",
}

@Article{Katz:1990:TUF,
  author =       "Randy H. Katz",
  title =        "Toward a Unified Framework for Version Modeling in
                 Engineering Databases",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "4",
  pages =        "375--408",
  month =        dec,
  year =         "1990",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/98163.98172",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:39:57 MDT 2008",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/98172.html",
  abstract =     "Support for unusual applications such as
                 computer-aided design data has been of increasing
                 interest to database system architects. In this survey,
                 we concentrate on one aspect of such support, namely,
                 {\em version modeling}. By this, we mean the concepts
                 suitable for structuring a database of complex
                 engineering artifacts that evolve across multiple
                 representations and over time and the operations
                 through which such artifact descriptions are created
                 and modified. There have been many proposals for new
                 models and mechanisms to support such concepts within
                 database data models in general and engineering data
                 models in particular; here we not only describe such
                 proposals; we also unify them. We do not propose yet
                 another model but provide a common terminology and
                 collection of mechanisms that underlie any approach for
                 representing engineering design information in a
                 database. The key remaining challenge is to construct a
                 single framework, based on these mechanisms, which can
                 be tailored for the needs of a given version
                 environment.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of California",
  affiliationaddress = "Berkeley, CA, USA",
  annote =       "component hierarchies (PART-OF), version histories
                 (IS-DERIVED FROM), configurations, equivalencies of
                 multifaceted data, a variety of representations are
                 needed to describe a design artifact fully",
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "cad Databases; Computer Aided Design; design;
                 Engineering Databases; performance; theory, Database
                 Systems; Version Modeling",
  subject =      "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf J.6}: Computer
                 Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD). {\bf H.2.8}: Information
                 Systems, DATABASE MANAGEMENT, Database applications.
                 {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Object-oriented languages.",
}

@Article{Pawlikowski:1990:CSS,
  author =       "Krzysztof Pawlikowski",
  title =        "Corrigenda: {``Steady-State Simulation of Queueing
                 Processes: A Survey of Problems and Solutions''}",
  journal =      j-COMP-SURV,
  volume =       "22",
  number =       "4",
  pages =        "409--409",
  month =        dec,
  year =         "1990",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 22:33:58 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Pawlikowski:1990:SSS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1991:ATIa,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:58:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1991:AAa,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "1",
  pages =        "3--3",
  month =        mar,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:58:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1991:WEC,
  author =       "David Goldberg",
  title =        "What Every Computer Scientist Should Know About
                 Floating-Point Arithmetic",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "1",
  pages =        "5--48",
  month =        mar,
  year =         "1991",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/103162.103163",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:40:16 MDT 2008",
  bibsource =    "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See also
                 \cite{Goldberg:1991:CWE,Dunham:1992:SFW,Wichmann:1992:SFW}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/103163.html",
  abstract =     "Floating-point arithmetic is considered an esoteric
                 subject by many people. This is rather surprising,
                 because floating-point is ubiquitous in computer
                 systems: almost every language has a floating-point
                 datatype; computers from PCs to supercomputers have
                 floating-point accelerators; most compilers will be
                 called upon to compile floating-point algorithms from
                 time to time; and virtually every operating system must
                 respond to floating-point exceptions such as overflow.
                 This paper presents a tutorial on the aspects of
                 floating-point that have a direct impact on designers
                 of computer systems. It begins with background on
                 floating-point representation and rounding error,
                 continues with a discussion of the IEEE floating-point
                 standard, and concludes with examples of how computer
                 system builders can better support floating point.",
  acknowledgement = ack-nhfb # " and " # ack-nj,
  affiliation =  "Xerox Palo Alto Res. Center, CA, USA",
  classification = "C5230 (Digital arithmetic methods)",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; compilers; computer scientist; computer
                 systems; denormalized number; design; exception;
                 floating-point; floating-point accelerators;
                 floating-point algorithms; floating-point datatype;
                 floating-point exceptions; floating-point
                 representation; floating-point standard; gradual
                 underflow; guard digit; IEEE floating-point standard;
                 languages; NaN; operating system; overflow; PCs;
                 relative error; rounding error; rounding mode;
                 standardization; supercomputers; ulp; underflow",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Computer arithmetic. {\bf K.1}:
                 Computing Milieux, THE COMPUTER INDUSTRY, Standards.
                 {\bf C.0}: Computer Systems Organization, GENERAL,
                 Instruction set design. {\bf G.1.0}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Numerical
                 algorithms.",
  thesaurus =    "digital arithmetic; roundoff errors",
}

@Article{Andrews:1991:PPI,
  author =       "Gregory R. Andrews",
  title =        "Paradigms for Process Interaction in Distributed
                 Programs",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "1",
  pages =        "49--90",
  month =        mar,
  year =         "1991",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/103162.103164",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:40:16 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/cmubib.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/103164.html",
  abstract =     "Distributed computations are concurrent programs in
                 which processes communicate by message passing. Such
                 programs typically execute on network architectures
                 such as networks of workstations or distributed memory
                 parallel machines (i.e., multicomputers such as
                 hypercubes). Several paradigms --- examples or models
                 --- for process interaction in distributed computations
                 are described. These include networks of filters,
                 clients, and servers, heartbeat algorithms, probe/echo
                 algorithms, broadcast algorithms, token-passing
                 algorithms, decentralized servers, and bags of tasks.
                 These paradigms are appliable to numerous practical
                 problems. They are illustrated by solving problems,
                 including parallel sorting, file servers, computing the
                 topology of a network, distributed termination
                 detection, replicated databases, and parallel adaptive
                 quadrature. Solutions to all problems are derived in a
                 step-wise fashion from a general specification of the
                 problem to a concrete solution. The derivations
                 illustrate techniques for developing distributed
                 algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; clients and servers; design; distributed
                 and parallel algorithms; distributed programming;
                 distributed programming methods; heartbeat algorithms;
                 networks of filters; patterns for interprocess
                 communication; probe/echo algorithms; replicated
                 servers; token-passing algorithms",
  subject =      "{\bf C.2.4}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
                 Distributed applications. {\bf C.1.2}: Computer Systems
                 Organization, PROCESSOR ARCHITECTURES, Multiple Data
                 Stream Architectures (Multiprocessors),
                 Multiple-instruction-stream, multiple-data-stream
                 processors (MIMD). {\bf D.1.3}: Software, PROGRAMMING
                 TECHNIQUES, Concurrent Programming, Distributed
                 programming. {\bf D.4.4}: Software, OPERATING SYSTEMS,
                 Communications Management, Message sending. {\bf
                 D.4.1}: Software, OPERATING SYSTEMS, Process
                 Management, Concurrency.",
}

@Article{Chin:1991:DOB,
  author =       "Roger S. Chin and Samuel T. Chanson",
  title =        "Distributed, object-based programming systems",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "1",
  pages =        "91--124",
  month =        mar,
  year =         "1991",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/103162.103165",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:40:16 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/103165.html",
  abstract =     "The development of distributed operating systems and
                 object-based programming languages makes possible an
                 environment in which programs consisting of a set of
                 interacting modules, or objects, may execute
                 concurrently on a collection of loosely coupled
                 processors. An object-based programming language
                 encourages a methodology for designing and creating a
                 program as a set of autonomous components, whereas a
                 distributed operating system permits a collection of
                 workstations or personal computers to be treated as a
                 single entity. The amalgamation of these two concepts
                 has resulted in systems that shall be referred to as
                 {\em distributed}, {\em object-based programming
                 systems}.\par

                 This paper discusses issues in the design and
                 implementation of such systems. Following the
                 presentation of fundamental concepts and various object
                 models, issues in object management, object interaction
                 management, and physical resource management are
                 discussed. Extensive examples are drawn from existing
                 systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "capability scheme; design; distributed operating
                 systems; error recovery; languages; method invocation;
                 nested transaction; object model; object reliability;
                 object-based programming languages; processor
                 allocation; resource management; synchronization;
                 transaction",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Object-oriented languages. {\bf
                 D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent
                 Programming, Distributed programming. {\bf C.2.4}:
                 Computer Systems Organization, COMPUTER-COMMUNICATION
                 NETWORKS, Distributed Systems. {\bf D.3.3}: Software,
                 PROGRAMMING LANGUAGES, Language Constructs and
                 Features, Concurrent programming structures.",
}

@Article{Sankar:1991:SFR,
  author =       "S. Sankar and D. S. Rosenblum",
  title =        "Surveyor's Forum: Runtime Checking and Debugging of
                 Formally Specified Programs",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "1",
  pages =        "125--127",
  month =        mar,
  year =         "1991",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/103162.103166",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:40:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Abbott:1990:RSF,Abbott:1991:SFR,Strigini:1991:SFR}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/103166.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; design; languages",
  subject =      "{\bf D.2.5}: Software, SOFTWARE ENGINEERING, Testing
                 and Debugging, Debugging aids. {\bf D.3.4}: Software,
                 PROGRAMMING LANGUAGES, Processors, Run-time
                 environments. {\bf F.3.1}: Theory of Computation,
                 LOGICS AND MEANINGS OF PROGRAMS, Specifying and
                 Verifying and Reasoning about Programs.",
}

@Article{March:1991:ATIb,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "2",
  pages =        "129--129",
  month =        jun,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:58:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1991:AAb,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "2",
  pages =        "131--131",
  month =        jun,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:58:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1991:EP,
  author =       "Salvatore T. March",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "2",
  pages =        "133--141",
  month =        jun,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:58:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shahookar:1991:VCP,
  author =       "K. Shahookar and P. Mazumder",
  title =        "{VLSI} Cell Placement Techniques",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "2",
  pages =        "143--220",
  month =        jun,
  year =         "1991",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/103724.103725",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:40:41 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/103725.html",
  abstract =     "VLSI cell placement problem is known to be NP
                 complete. A wide repertoire of heuristic algorithms
                 exists in the literature for efficiently arranging the
                 logic cells on a VLSI chip. The objective of this paper
                 is to present a comprehensive survey of the various
                 cell placement techniques, with emphasis on standard
                 cell and macro placement. Five major algorithms for
                 placement are discussed: simulated annealing,
                 force-directed placement, min-cut placement, placement
                 by numerical optimization, and evolution-based
                 placement. The first two classes of algorithms owe
                 their origin to physical laws, the third and fourth are
                 analytical techniques, and the fifth class of
                 algorithms is derived from biological phenomena. In
                 each category, the basic algorithm is explained with
                 appropriate examples. Also discussed are the different
                 implementations done by researchers.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; design; floor planning; force-directed
                 placement; gate array; genetic algorithm; integrated
                 circuits; layout; min-cut; performance; physical
                 design; placement; simulated annealing; standard cell;
                 VLSI",
  subject =      "{\bf B.7.2}: Hardware, INTEGRATED CIRCUITS, Design
                 Aids, Placement and routing. {\bf B.7.1}: Hardware,
                 INTEGRATED CIRCUITS, Types and Design Styles, VLSI
                 (very large scale integration). {\bf F.2.2}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Routing and layout.",
}

@Article{Abeysundara:1991:HSL,
  author =       "Bandula W. Abeysundara and Ahmed E. Kamal",
  title =        "High-Speed Local Area Networks and Their Performance:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "2",
  pages =        "221--264",
  month =        jun,
  year =         "1991",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/103724.103726",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:40:41 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1991.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/103726.html",
  abstract =     "At high data transmission rates, the packet
                 transmission time of a local area network (LAN) could
                 become comparable to or less than the medium
                 propagation delay. The performance of many LAN schemes
                 degrades rapidly when the packet transmission time
                 becomes small comparative to the medium propagation
                 delay. This paper introduces LANs and discusses the
                 performance degradation of LANs at high speeds. It
                 surveys recently proposed LAN schemes designed to
                 operate at high data rates, including their performance
                 characteristics desirable in LAN medium access
                 protocols are identified and discussed. The paper
                 serves as a tutorial for readers less familiar with
                 local computer communication networks. It also serves
                 as a survey of the state-of-the-art LANs.",
  acknowledgement = ack-nhfb,
  annote =       "This paper introduces LANs and discusses the
                 performance degradation of LANs at high speeds. It
                 surveys recently proposed LAN schemes designed to
                 operate at high data rates, including their
                 performances characteristics.",
  country =      "USA",
  date =         "18/08/91",
  descriptors =  "HSLAN; survey; performance evaluation",
  enum =         "4260",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "access schemes; computer networks; data communication;
                 design; medium access protocols; optical fiber
                 networks; performance",
  language =     "English",
  references =   "122",
  subject =      "{\bf C.2.5}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Local Networks. {\bf
                 C.2.2}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
                 {\bf C.2.0}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, General, Data
                 communications. {\bf C.4}: Computer Systems
                 Organization, PERFORMANCE OF SYSTEMS, Performance
                 attributes.",
}

@Article{March:1991:ATIc,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "3",
  pages =        "265--266",
  month =        sep,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:58:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1991:AAc,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "3",
  pages =        "267--267",
  month =        sep,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:58:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Barghouti:1991:CCA,
  author =       "Naser S. Barghouti and Gail E. Kaiser",
  title =        "Concurrency Control in Advanced Database
                 Applications",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "3",
  pages =        "269--317",
  month =        sep,
  year =         "1991",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/116873.116875",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:40:54 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/116875.html",
  abstract =     "Concurrency control has been thoroughly studied in the
                 context of traditional database applications such as
                 banking and airline reservations systems. There are
                 relatively few studies, however, that address the
                 concurrency control issues of advanced database
                 applications such as CAD/CAM and software development
                 environments. The concurrency control requirements in
                 such applications are different from those in
                 conventional database applications; in particular,
                 there is a need to support nonserializable cooperation
                 among users whose transactions are long-lived and
                 interactive and to integrate concurrency control
                 mechanisms with version and configuration control. This
                 paper outlines the characteristics of data and
                 operations in some advanced database applications,
                 discusses their concurrency control requirements, and
                 surveys the mechanisms proposed to address these
                 requirements.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "advanced database applications; algorithms;
                 concurrency control; cooperative transactions; design;
                 design environments; extended transaction models; long
                 transactions; management; object-oriented databases;
                 relaxing serializability",
  owner =        "soo",
  subject =      "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems, Concurrency. {\bf H.2.4}: Information Systems,
                 DATABASE MANAGEMENT, Systems, Transaction processing.
                 {\bf H.2.8}: Information Systems, DATABASE MANAGEMENT,
                 Database applications.",
}

@Article{Galil:1991:DSA,
  author =       "Zvi Galil and Giuseppe F. Italiano",
  title =        "Data Structures and Algorithms for Disjoint Set Union
                 Problems",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "3",
  pages =        "319--344",
  month =        sep,
  year =         "1991",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/116873.116878",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:40:54 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/116878.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; equivalence algorithm; find and union
                 operations algorithm design analysis; partition; set
                 union; theory; time complexity",
  subject =      "{\bf E.1}: Data, DATA STRUCTURES. {\bf F.2.2}: Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Computations on discrete structures.",
}

@Article{Aurenhammer:1991:VDS,
  author =       "Franz Aurenhammer",
  title =        "{Voronoi} Diagrams: a Survey of a Fundamental
                 Geometric Data Structure",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "3",
  pages =        "345--405",
  month =        sep,
  year =         "1991",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/116873.116880",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:40:54 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/116880.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; arrangements; cell complex; cluster
                 analysis; clustering; combinatorial complexity; convex
                 hull; crystal structure; Delaunay triangulations;
                 divide-and-conquer; geometric data structure; growth
                 model; higher dimensional embedding; hyperplane
                 arrangement; hyperplanes; k-set; minimum spanning
                 trees; motion planning; neighbor searching; object
                 modeling; parallel computation; plane sweep;
                 plane-sweep; proximity; randomized insertion; spanning
                 tree; survey paper; theory; triangulation; Voronoi
                 diagrams",
  oldlabel =     "geom-2467.3",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Geometrical problems and
                 computations. {\bf E.1}: Data, DATA STRUCTURES.",
  succeeds =     "a-vdsfg-90",
}

@Article{Strigini:1991:SFR,
  author =       "Lorenzo Strigini",
  title =        "Surveyor's Forum: {``Resourceful Systems for Fault
                 Tolerance, Reliability, and Safety''}",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "3",
  pages =        "407--409",
  month =        sep,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:58:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Abbott:1990:RSF,Sankar:1991:SFR,Abbott:1991:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Abbott:1991:SFR,
  author =       "Russell Abbott",
  title =        "Surveyor's Forum: {``Resourceful Systems for Fault
                 Tolerance, Reliability, and Safety''}",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "3",
  pages =        "409--411",
  month =        sep,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:58:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Abbott:1990:RSF,Sankar:1991:SFR,Strigini:1991:SFR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldberg:1991:CWE,
  author =       "David Goldberg",
  title =        "Corrigendum: {``What Every Computer Scientist Should
                 Know About Floating-Point Arithmetic''}",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "3",
  pages =        "413--413",
  month =        sep,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 09:58:43 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "See
                 \cite{Goldberg:1991:WEC,Dunham:1992:SFW,Wichmann:1992:SFW}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1991:ATId,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "4",
  pages =        "417--418",
  month =        dec,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:12:08 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1991:AAd,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "4",
  pages =        "419--419",
  month =        dec,
  year =         "1991",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:12:08 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Stytz:1991:TDM,
  author =       "M. R. Stytz and G. Frieder and O. Frieder",
  title =        "Three-Dimensional Medical Imaging: Algorithms and
                 Computer Systems",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "4",
  pages =        "421--499",
  month =        dec,
  year =         "1991",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/125137.125155",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:41:25 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/125155.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Computer graphics; data model processing
                 shading antialiasing hidden-surface removal ray tracing
                 image segmentation surface tracking; design;
                 experimentation; medical imaging; performance; surface
                 rendering; three-dimensional imaging; volume
                 rendering",
  subject =      "{\bf J.3}: Computer Applications, LIFE AND MEDICAL
                 SCIENCES. {\bf I.3.7}: Computing Methodologies,
                 COMPUTER GRAPHICS, Three-Dimensional Graphics and
                 Realism. {\bf I.3.2}: Computing Methodologies, COMPUTER
                 GRAPHICS, Graphics Systems. {\bf C.5.0}: Computer
                 Systems Organization, COMPUTER SYSTEM IMPLEMENTATION,
                 General. {\bf C.1.0}: Computer Systems Organization,
                 PROCESSOR ARCHITECTURES, General.",
}

@Article{McKenzie:1991:ERA,
  author =       "L. Edwin {McKenzie, Jr.} and Richard Thomas
                 Snodgrass",
  title =        "Evaluation of Relational Algebras Incorporating the
                 Time Dimension in Databases",
  journal =      j-COMP-SURV,
  volume =       "23",
  number =       "4",
  pages =        "501--543",
  month =        dec,
  year =         "1991",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/125137.125166",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:41:25 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/125166.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "aggregate; chronon; design; historical relation;
                 homogeneity; languages; performance; query
                 optimization; snapshot relation; Temporal Query
                 Languages 26 Criteria; transaction time; valid time",
  subject =      "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.1}: Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Normal
                 forms. {\bf H.2.1}: Information Systems, DATABASE
                 MANAGEMENT, Logical Design, Schema and subschema. {\bf
                 H.2.3}: Information Systems, DATABASE MANAGEMENT,
                 Languages, Data manipulation languages (DML). {\bf
                 H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.4}: Information
                 Systems, DATABASE MANAGEMENT, Systems, Transaction
                 processing. {\bf H.4.1}: Information Systems,
                 INFORMATION SYSTEMS APPLICATIONS, Office Automation.
                 {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic.",
}

@Article{March:1992:ATIa,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:14:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1992:AAa,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "1",
  pages =        "3--3",
  month =        mar,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:14:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Suetens:1992:CSO,
  author =       "Paul Suetens and Pascal Fua and Andrew J. Hanson",
  title =        "Computational Strategies for Object Recognition",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "1",
  pages =        "5--61",
  month =        mar,
  year =         "1992",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/128762.128763",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:41:49 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/128763.html",
  abstract =     "This article reviews the available methods for
                 automated identification of objects in digital images.
                 The techniques are classified into groups according to
                 the nature of the computational strategy used. Four
                 classes are proposed: (1) the simplest strategies,
                 which work on data appropriate for feature vector
                 classification, (2) methods that match models to
                 symbolic data structures for situations involving
                 reliable data and complex models, (3) approaches that
                 fit models to the photometry and are appropriate for
                 noisy data and simple models, and (4) combinations of
                 these strategies, which must be adopted in complex
                 situations. Representative examples of various methods
                 are summarized, and the classes of strategies with
                 respect to their appropriateness for particular
                 applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; design; experimentation; image
                 understanding; model-based vision; object recognition;
                 theory",
  subject =      "{\bf I.5.4}: Computing Methodologies, PATTERN
                 RECOGNITION, Applications, Computer vision. {\bf
                 I.2.10}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding,
                 Architecture and control structures. {\bf I.2.10}:
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Vision and Scene Understanding, Modeling and recovery
                 of physical attributes. {\bf I.2.10}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Vision and
                 Scene Understanding, Representations, data structures,
                 and transforms. {\bf I.2.10}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Vision and Scene
                 Understanding, Shape. {\bf I.4.8}: Computing
                 Methodologies, IMAGE PROCESSING, Scene Analysis. {\bf
                 I.4.7}: Computing Methodologies, IMAGE PROCESSING,
                 Feature Measurement.",
}

@Article{Mishra:1992:JPR,
  author =       "Priti Mishra and Margaret H. Eich",
  title =        "Join Processing in Relational Databases",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "1",
  pages =        "63--113",
  month =        mar,
  year =         "1992",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/128762.128764",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:41:49 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/128764.html",
  abstract =     "The join operation is one of the fundamental
                 relational database query operations. It facilitates
                 the retrieval of information from two different
                 relations based on a Cartesian product of the two
                 relations. The join is one of the most difficult
                 operations to implement efficiently, as no predefined
                 links between relations are required to exist (as they
                 are with network and hierarchical systems). The join is
                 the only relational algebra operation that allows the
                 combining of related tuples from relations on different
                 attribute schemes. Since it is executed frequently and
                 is expensive, much research effort has been applied to
                 the optimization of join processing. In this paper, the
                 different kinds of joins and the various implementation
                 techniques are surveyed. These different methods are
                 classified based on how they partition tuples from
                 different relations. Some require that all tuples from
                 one be compared to all tuples from another; other
                 algorithms only compare some tuples from each. In
                 addition, some techniques perform an explicit
                 partitioning, whereas others are implicit.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; database machines; design; distributed
                 processing; join; outer joins; parallel processing;
                 performance; query execution; relational algebra;
                 semi-join; theory",
  owner =        "soo",
  subject =      "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.1}: Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Data
                 models.",
}

@Article{March:1992:EP,
  author =       "Salvatore T. March",
  title =        "Editorial Policy",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "2",
  pages =        "117--125",
  month =        jun,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:14:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1992:ATIb,
  author =       "Salvatore T. March",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "2",
  pages =        "127--128",
  month =        jun,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:14:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{March:1992:AAb,
  author =       "Salvatore T. March",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "2",
  pages =        "129--129",
  month =        jun,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:14:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Krueger:1992:SR,
  author =       "Charles W. Krueger",
  title =        "Software Reuse",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "2",
  pages =        "131--183",
  month =        jun,
  year =         "1992",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/130844.130856",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:42:15 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/obscure.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/130856.html",
  abstract =     "Software reuse is the process of creating software
                 systems from existing software rather than building
                 software systems from scratch. This simple yet powerful
                 vision was introduced in 1968. Software reuse has,
                 however, failed to become a standard software
                 engineering practice. In an attempt to understand why,
                 researchers have renewed their interest in software
                 reuse and in the obstacles to implementing it.\par

                 This paper surveys the different approaches to software
                 reuse found in the research literature. It uses a
                 taxonomy to describe and compare the different
                 approaches and make generalizations about the field of
                 software reuse. The taxonomy characterizes each reuse
                 approach in terms of its reusable {\em artifacts} and
                 the way these artifacts are {\em abstracted, selected,
                 specialized}, and {\em integrated}.\par

                 Abstraction plays a central role in software reuse.
                 Concise and expressive abstractions are essential if
                 software artifacts are to be effectively reused. The
                 effectiveness of a reuse technique can be evaluated in
                 terms of {\em cognitive distance}---an intuitive gauge
                 of the intellectual effort required to use the
                 technique. Cognitive distance is reduced in two ways:
                 (1) Higher level abstractions in a reuse technique
                 reduce the effort required to go from the initial
                 concept of a software system to representations in the
                 reuse technique, and (2) automation reduces the effort
                 required to go from abstractions in a reuse technique
                 to an executable implementation.\par

                 This survey will help answer the following questions:
                 What is software reuse? Why reuse software? What are
                 the different approaches to reusing software? How
                 effective are the different approaches? What is
                 required to implement a software reuse technology? Why
                 is software reuse difficult? What are the open areas
                 for research in software reuse?",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "abstraction; cognitive distance; design; economics;
                 languages; software reuse",
  subject =      "{\bf D.2.m}: Software, SOFTWARE ENGINEERING,
                 Miscellaneous, Reusable software. {\bf D.1.0}:
                 Software, PROGRAMMING TECHNIQUES, General. {\bf D.2.2}:
                 Software, SOFTWARE ENGINEERING, Tools and Techniques,
                 Modules and interfaces. {\bf D.2.2}: Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, Programmer
                 workbench. {\bf D.2.2}: Software, SOFTWARE ENGINEERING,
                 Tools and Techniques, Software libraries. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Specialized application languages.
                 {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Very high-level languages. {\bf
                 D.3.4}: Software, PROGRAMMING LANGUAGES, Processors.
                 {\bf H.3.1}: Information Systems, INFORMATION STORAGE
                 AND RETRIEVAL, Content Analysis and Indexing,
                 Abstracting methods. {\bf H.3.1}: Information Systems,
                 INFORMATION STORAGE AND RETRIEVAL, Content Analysis and
                 Indexing, Indexing methods. {\bf D.2.1}: Software,
                 SOFTWARE ENGINEERING, Requirements/Specifications. {\bf
                 H.3.3}: Information Systems, INFORMATION STORAGE AND
                 RETRIEVAL, Information Search and Retrieval. {\bf A.1}:
                 General Literature, INTRODUCTORY AND SURVEY.",
}

@Article{BrinchHansen:1992:HRL,
  author =       "Per {Brinch Hansen}",
  title =        "{Householder} Reduction of Linear Equations",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "2",
  pages =        "185--194",
  month =        jun,
  year =         "1992",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/130844.130851",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:42:15 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/130851.html",
  abstract =     "This tutorial discusses Householder reduction of n
                 linear equations to a triangular form which can be
                 solved by back substitution. The main strength of the
                 method is its unconditional numerical stability. We
                 explain how Householder reduction can be derived from
                 elementary-matrix algebra. The method is illustrated by
                 a numerical example and a Pascal procedure. We assume
                 that the reader has a general knowledge of vector and
                 matrix algebra but is less familiar with linear
                 transformation of a vector space.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Householder reduction",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods).",
}

@Article{McGeoch:1992:AAS,
  author =       "Catherine McGeoch",
  title =        "Analyzing Algorithms by Simulation: Variance Reduction
                 Techniques and Simulation Speedups",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "2",
  pages =        "195--212",
  month =        jun,
  year =         "1992",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/130844.130853",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:42:15 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1992.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/130853.html",
  abstract =     "Although experimental studies have been widely applied
                 to the investigation of algorithm performance, very
                 little attention has been given to experimental method
                 in this area. This is unfortunate, since much can be
                 done to improve the quality of the data obtained;
                 often, much improvement may be needed for the data to
                 be useful. This paper gives a tutorial discussion of
                 two aspects of good experimental technique: the use of
                 {\em variance reduction techniques} and {\em simulation
                 speedups} in algorithm studies.\par

                 In an illustrative study, application of variance
                 reduction techniques produces a decrease in variance by
                 a factor 1000 in one case, giving a dramatic
                 improvement in the precision of experimental results.
                 Furthermore, the complexity of the simulation program
                 is improved from $ \Theta (m n / H_n) $ to $ \Theta (m
                 + n \log n) $ (where $m$ is typically much larger than
                 $n$ ), giving a much faster simulation program and
                 therefore more data per unit of computation time. The
                 general application of variance reduction techniques is
                 also discussed for a variety of algorithm problem
                 domains.",
  acknowledgement = ack-nhfb,
  annote =       "This paper documents the power of variance reduction
                 techniques for algorithm problems and provides tutorial
                 discussion. Since even complex heuristic algorithms
                 tend to have precise mathematical specifications and a
                 great deal of structure, there is much potential for
                 exploiting partial understanding of the underlying
                 model.",
  country =      "USA",
  date =         "09/12/92",
  descriptors =  "Analysis; algorithm; simulation; variance reduction;
                 variance; speedup",
  enum =         "5196",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; experimental analysis of algorithms;
                 experimentation; move-to-front rule; performance;
                 self-organizing sequential search; statistical analysis
                 of algorithms; transpose rule; variance reduction
                 techniques",
  language =     "English",
  references =   "42",
  subject =      "{\bf I.6.8}: Computing Methodologies, SIMULATION AND
                 MODELING, Types of Simulation, Discrete event. {\bf
                 I.6.3}: Computing Methodologies, SIMULATION AND
                 MODELING, Applications. {\bf F.2.2}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Sorting and searching. {\bf G.3}: Mathematics of
                 Computing, PROBABILITY AND STATISTICS.",
}

@Article{Muntz:1992:PN,
  author =       "Richard R. Muntz",
  title =        "A Personal Note",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "3",
  pages =        "213--214",
  month =        sep,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:14:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1992:ATIa,
  author =       "Richard R. Muntz",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "3",
  pages =        "215--215",
  month =        sep,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:14:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1992:AAa,
  author =       "Richard R. Muntz",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "3",
  pages =        "217--217",
  month =        sep,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:14:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hwang:1992:GMP,
  author =       "Yong K. Hwang and Narendra Ahuja",
  title =        "Gross Motion Planning --- a Survey",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "3",
  pages =        "219--291",
  month =        sep,
  year =         "1992",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/136035.136037",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:42:45 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/136037.html",
  abstract =     "Motion planning is one of the most important areas of
                 robotics research. The complexity of the
                 motion-planning problem has hindered the development of
                 practical algorithms. This paper surveys the work on
                 gross-motion planning, including motion planners for
                 point robots, rigid robots, and manipulators in
                 stationary, time-varying, constrained, and
                 movable-object environments. The general issues in
                 motion planning are explained. Recent approaches and
                 their performances are briefly described, and possible
                 future research directions are discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; collision detection; computational
                 geometry; implementation; motion planning; obstacle
                 avoidance; path planning; spatial representation;
                 theory",
  subject =      "{\bf I.2.9}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Robotics, Manipulators. {\bf I.2.10}:
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Vision and Scene Understanding, Motion. {\bf I.2.8}:
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Problem Solving, Control Methods, and Search, Graph and
                 tree search strategies. {\bf I.2.8}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Problem
                 Solving, Control Methods, and Search, Heuristic
                 methods.",
}

@Article{Bryant:1992:SBM,
  author =       "Randal E. Bryant",
  title =        "Symbolic {Boolean} Manipulation with Ordered
                 Binary-Decision Diagrams",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "3",
  pages =        "293--318",
  month =        sep,
  year =         "1992",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/136035.136043",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:42:45 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/136043.html",
  abstract =     "Ordered Binary-Decision Diagrams (OBDDs) represent
                 Boolean functions as directed acyclic graphs. They form
                 a canonical representation, making testing of
                 functional properties such as satisfiability and
                 equivalence straightforward. A number of operations on
                 Boolean functions can be implemented as graph
                 algorithms on OBDD data structures. Using OBDDs, a wide
                 variety of problems can be solved through {\em symbolic
                 analysis}. First, the possible variations in system
                 parameters and operating conditions are encoded with
                 Boolean variables. Then the system is evaluated for all
                 variations by a sequence of OBDD operations.
                 Researchers have thus solved a number of problems in
                 digital-system design, finite-state system analysis,
                 artificial intelligence, and mathematical logic. This
                 paper describes the OBDD data structure and surveys a
                 number of applications that have been solved by
                 OBDD-based symbolic analysis.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; binary-decision diagrams; Boolean algebra;
                 Boolean functions; branching programs; symbolic
                 analysis; symbolic manipulation; verification",
  subject =      "{\bf B.6.0}: Hardware, LOGIC DESIGN, General. {\bf
                 I.1.m}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Miscellaneous. {\bf F.1.1}: Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Models of
                 Computation, Automata. {\bf F.2.2}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems.",
}

@Article{Dunham:1992:SFW,
  author =       "Charles B. Dunham",
  title =        "Surveyor's Forum: {``What Every Computer Scientist
                 Should Know About Floating-Point Arithmetic''}",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "3",
  pages =        "319--319",
  month =        sep,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:14:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "See
                 \cite{Goldberg:1991:WEC,Goldberg:1991:CWE,Wichmann:1992:SFW}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wichmann:1992:SFW,
  author =       "Brian A. Wichmann",
  title =        "Surveyor's Forum: {``What Every Computer Scientist
                 Should Know About Floating-Point Arithmetic''}",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "3",
  pages =        "319--319",
  month =        sep,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:14:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See
                 \cite{Goldberg:1991:WEC,Goldberg:1991:CWE,Dunham:1992:SFW}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1992:ATIb,
  author =       "Richard R. Muntz",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "4",
  pages =        "321--322",
  month =        dec,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:24:44 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1992:AAb,
  author =       "Richard R. Muntz",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "4",
  pages =        "323--323",
  month =        dec,
  year =         "1992",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:24:44 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Brown:1992:SIR,
  author =       "Lisa Gottesfeld Brown",
  title =        "A Survey of Image Registration Techniques",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "4",
  pages =        "325--376",
  month =        dec,
  year =         "1992",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/146370.146374",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:43:10 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/cmubib.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/146374.html",
  abstract =     "Registration is a fundamental task in image processing
                 used to match two or more pictures taken, for example,
                 at different times, from different sensors, or from
                 different viewpoints. Virtually all large systems which
                 evaluate images require the registration of images, or
                 a closely related operation, as an intermediate step.
                 Specific examples of systems where image registration
                 is a significant component include matching a target
                 with a real-time image of a scene for target
                 recognition, monitoring global land usage using
                 satellite images, matching stereo images to recover
                 shape for autonomous navigation, and aligning images
                 from different medical modalities for
                 diagnosis.\par

                 Over the years, a broad range of techniques has been
                 developed for various types of data and problems. These
                 techniques have been independently studied for several
                 different applications, resulting in a large body of
                 research. This paper organizes this material by
                 establishing the relationship between the variations in
                 the images and the type of registration techniques
                 which can most appropriately be applied. Three major
                 types of variations are distinguished. The first type
                 are the variations due to the differences in
                 acquisition which cause the images to be misaligned. To
                 register images, a spatial transformation is found
                 which will remove these variations. The class of
                 transformations which must be searched to find the
                 optimal transformation is determined by knowledge about
                 the variations of this type. The transformation class
                 in turn influences the general technique that should be
                 taken. The second type of variations are those which
                 are also due to differences in acquisition, but cannot
                 be modeled easily such as lighting and atmospheric
                 conditions. This type usually effects intensity values,
                 but they may also be spatial, such as perspective
                 distortions. The third type of variations are
                 differences in the images that are of interest such as
                 object movements, growths, or other scene changes.
                 Variations of the second and third type are not
                 directly removed by registration, but they make
                 registration more difficult since an exact match is no
                 longer possible. In particular, it is critical that
                 variations of the third type are not removed. Knowledge
                 about the characteristics of each type of variation
                 effect the choice of feature space, similarity measure,
                 search space, and search strategy which will make up
                 the final technique. All registration techniques can be
                 viewed as different combinations of these choices. This
                 framework is useful for understanding the merits and
                 relationships between the wide variety of existing
                 techniques and for assisting in the selection of the
                 most suitable technique for a specific problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; design; image registration; image warping;
                 measurement; performance; rectification; template
                 matching",
  subject =      "{\bf I.4.3}: Computing Methodologies, IMAGE
                 PROCESSING, Enhancement, Registration. {\bf A.1}:
                 General Literature, INTRODUCTORY AND SURVEY. {\bf
                 I.2.10}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding. {\bf
                 I.5.0}: Computing Methodologies, PATTERN RECOGNITION,
                 General. {\bf I.4.8}: Computing Methodologies, IMAGE
                 PROCESSING, Scene Analysis, Sensor fusion.",
}

@Article{Kukich:1992:TAC,
  author =       "Karen Kukich",
  title =        "Techniques for Automatically Correcting Words in
                 Text",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "4",
  pages =        "377--439",
  month =        dec,
  year =         "1992",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/146370.146380",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:43:10 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/cmubib.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/146380.html",
  abstract =     "Research aimed at correcting words in text has focused
                 on three progressively more difficult problems: (1)
                 nonword error detection; (2) isolated-word error
                 correction; and (3) context-dependent word correction.
                 In response to the first problem, efficient pattern
                 matching and $n$-gram analysis techniques have been
                 developed for detecting strings that do not appear in a
                 given word list. In response to the second problem, a
                 variety of general and application-specific spelling
                 correction techniques have been developed. Some of them
                 were based on detailed studies of spelling error
                 patterns. In response to the third problem, a few
                 experiments using natural-language-processing tools or
                 statistical-language models have been carried out. This
                 article surveys documented findings on spelling error
                 patterns, provides descriptions of various nonword
                 detection and isolated-word error correction
                 techniques, reviews the state of the art of
                 context-dependent word correction techniques, and
                 discusses research issues related to all three areas of
                 automatic error correction in text.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "$n$-gram analysis; algorithms; context-dependent
                 spelling correction; experimentation; grammar checking;
                 human factors; n-gram analysis;
                 natural-language-processing models; neural net
                 classifiers; Optical Character Recognition (OCR);
                 performance; spell checking; spelling error detection;
                 spelling error patterns; statistical-language models;
                 theory; word recognition and correction",
  subject =      "I.2.6 [Artificial Intelligence]: Learning ---
                 connectionism and neural nets; I.2.7 [Artificial
                 Intelligence]: Natural Language Processing --- language
                 models; language parsing and understanding; text
                 analysis; I.5.1 [Pattern Recognition]: Models ---
                 neural nets; statistical; I.5.4 [Pattern Recognition]:
                 Applications --- text processing; I.7.1 [Text
                 Processing]: Text Editing --- spelling",
}

@Article{Estivill-Castro:1992:SAS,
  author =       "Vladimir Estivill-Castro and Derick Wood",
  title =        "A Survey of Adaptive Sorting Algorithms",
  journal =      j-COMP-SURV,
  volume =       "24",
  number =       "4",
  pages =        "441--476",
  month =        dec,
  year =         "1992",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/146370.146381",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:43:10 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1992.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/146381.html",
  abstract =     "The design and analysis of adaptive sorting algorithms
                 has made important contributions to both theory and
                 practice. The main contributions from the theoretical
                 point of view are: the description of the complexity of
                 a sorting algorithm not only in terms of the size of a
                 problem instance but also in terms of the disorder of
                 the given problem instance; the establishment of new
                 relationships among measures of disorder; the
                 introduction of new sorting algorithms that take
                 advantage of the existing order in the input sequence;
                 and, the proofs that several of the new sorting
                 algorithms achieve maximal (optimal) adaptivity with
                 respect to several measures of disorder. The main
                 contributions from the practical point of view are: the
                 demonstration that several algorithms currently in use
                 are adaptive; and, the development of new algorithms,
                 similar to currently used algorithms that perform
                 competitively on random sequences and are significantly
                 faster on nearly sorted sequences. In this survey, we
                 present the basic notions and concepts of adaptive
                 sorting and the state of the art of adaptive sorting
                 algorithms.",
  acknowledgement = ack-nhfb,
  annote =       "In this survey the basic notions and concepts of
                 adaptive sorting and the state of the art of adaptive
                 sorting algorithm are presented. It gives the
                 description of the complexity of a sorting algorithm
                 not only in term of a size of a problem but also in
                 terms of the disorder of a given problem instance and
                 the introduction od new sorting algorithms that take
                 advantage of the existing order in the input
                 sequence.",
  country =      "USA",
  date =         "09/02/94",
  descriptors =  "Algorithm; Sorting; Search Tree",
  enum =         "8478",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "adaptive sorting algorithms; algorithms; comparison
                 trees; design; measures of disorder; nearly sorted
                 sequences; randomized algorithms; theory",
  language =     "English",
  references =   "76",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Sorting and searching. {\bf
                 G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Probabilistic algorithms (including Monte
                 Carlo). {\bf E.5}: Data, FILES, Sorting/searching. {\bf
                 E.2}: Data, DATA STORAGE REPRESENTATIONS, Composite
                 structures.",
}

@Article{Muntz:1993:ATIa,
  author =       "Richard R. Muntz",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1993",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:24:44 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1993:AAa,
  author =       "Richard R. Muntz",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "1",
  pages =        "3--3",
  month =        mar,
  year =         "1993",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:24:44 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Arman:1993:MBO,
  author =       "Farshid Arman and J. K. Aggarwal",
  title =        "Model-Based Object Recognition in Dense-Range Images
                 --- a Review",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "1",
  pages =        "5--43",
  month =        mar,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/151254.151255",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:43:37 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/151255.html",
  abstract =     "The goal in computer vision systems is to analyze data
                 collected from the environment and derive an
                 interpretation to complete a specified task. Vision
                 system tasks may be divided into data acquisition,
                 low-level processing, representation, model
                 construction, and matching subtasks. This paper
                 presents a comprehensive survey of model-based vision
                 systems using dense-range images. A comprehensive
                 survey of the recent publications in each subtask
                 pertaining to dense-range image object recognition is
                 presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "3D object recognition; 3D representations; algorithms;
                 CAD-based vision; dense-range images; design;
                 experimentation; image understanding",
  subject =      "{\bf I.5.4}: Computing Methodologies, PATTERN
                 RECOGNITION, Applications, Computer vision. {\bf J.6}:
                 Computer Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD). {\bf A.1}: General
                 Literature, INTRODUCTORY AND SURVEY. {\bf I.4.8}:
                 Computing Methodologies, IMAGE PROCESSING, Scene
                 Analysis, Range data. {\bf I.2.10}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Vision and
                 Scene Understanding. {\bf I.2.9}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Robotics,
                 Sensors. {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Modeling
                 packages. {\bf I.4.9}: Computing Methodologies, IMAGE
                 PROCESSING, Applications. {\bf I.5.2}: Computing
                 Methodologies, PATTERN RECOGNITION, Design Methodology,
                 Feature evaluation and selection. {\bf I.5.3}:
                 Computing Methodologies, PATTERN RECOGNITION,
                 Clustering, Similarity measures. {\bf I.4.6}: Computing
                 Methodologies, IMAGE PROCESSING, Segmentation, Region
                 growing, partitioning. {\bf I.4.6}: Computing
                 Methodologies, IMAGE PROCESSING, Segmentation, Pixel
                 classification.",
}

@Article{Schneider:1993:SS,
  author =       "Marco Schneider",
  title =        "Self-Sta\-bi\-li\-za\-tion",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "1",
  pages =        "45--67",
  month =        mar,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/151254.151256",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:43:37 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/151256.html",
  abstract =     "In 1973 Dijkstra introduced to computer science the
                 notion of self-stabilization in the context of
                 distributed systems. He defined a system as {\em
                 self-stabilizing} when ``regardless of its initial
                 state, it is guaranteed to arrive at a legitimate state
                 in a finite number of steps.'' A system which is not
                 self-stabilizing may stay in an illegitimate state
                 forever. Dijkstra's notion of self-stabilization, which
                 originally had a very narrow scope of application, is
                 proving to encompass a formal and unified approach to
                 fault tolerance under a model of transient failures for
                 distributed systems. In this paper we define
                 self-stabilization, examine its significance in the
                 context of fault tolerance, define the important
                 research themes that have arisen from it, and discuss
                 the relevant results. In addition to the issues arising
                 from Dijkstra's original presentation as well as
                 several related issues, we discuss methodologies for
                 designing self-stabilizing systems, the role of
                 compilers with respect to self-stabilization, and some
                 of the factors that prevent self-stabilization.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; convergence; design; distributed systems
                 legal illegal states fault tolerance; fault tolerance;
                 reliability; self-stabilization; self-stabilizing
                 systems; stabilization; transient errors; transient
                 failures; verification",
  subject =      "{\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability,
                 Fault-tolerance. {\bf D.4.1}: Software, OPERATING
                 SYSTEMS, Process Management. {\bf F.3.1}: Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about Programs.
                 {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES,
                 Concurrent Programming. {\bf C.2.4}: Computer Systems
                 Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Distributed Systems, Distributed applications.",
}

@Article{Muntz:1993:ATIb,
  author =       "Richard R. Muntz",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "2",
  pages =        "69--70",
  month =        jun,
  year =         "1993",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:24:44 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1993:AAb,
  author =       "Richard R. Muntz",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "2",
  pages =        "71--72",
  month =        jun,
  year =         "1993",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:24:44 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Graefe:1993:QET,
  author =       "Goetz Graefe",
  title =        "Query Evaluation Techniques for Large Databases",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "2",
  pages =        "73--170",
  month =        jun,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/152610.152611",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:43:58 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/152611.html",
  abstract =     "Database management systems will continue to manage
                 large data volumes. Thus, efficient algorithms for
                 accessing and manipulating large sets and sequences
                 will be required to provide acceptable performance. The
                 advent of object-oriented and extensible database
                 systems will not solve this problem. On the contrary,
                 modern data models exacerbate the problem: In order to
                 manipulate large sets of complex objects as efficiently
                 as today's database systems manipulate simple records,
                 query-processing algorithms and software will become
                 more complex, and a solid understanding of algorithm
                 and architectural issues is essential for the designer
                 of database management software.\par

                 This survey provides a foundation for the design and
                 implementation of query execution facilities in new
                 database management systems. It describes a wide array
                 of practical query evaluation techniques for both
                 relational and postrelational database systems,
                 including iterative execution of complex query
                 evaluation plans, the duality of sort- and hash-based
                 set-matching algorithms, types of parallel query
                 execution and their implementation, and special
                 operators for emerging database application domains.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; complex query evaluation plans; dynamic
                 query evaluation plans; extensible database systems;
                 iterators; object-oriented database systems; operator
                 model of parallelization; parallel algorithms;
                 performance; processing execution iterators algorithms
                 parallelism logical physical algebra level of
                 abstraction performance meta-operator extensible
                 object-oriented scientific operators sort sorting hash
                 hashing duality; relational database systems;
                 set-matching algorithms; sort-hash duality",
  subject =      "{\bf E.5}: Data, FILES. {\bf H.2.4}: Information
                 Systems, DATABASE MANAGEMENT, Systems, Query
                 processing. {\bf A.1}: General Literature, INTRODUCTORY
                 AND SURVEY.",
}

@Article{Barborak:1993:CPF,
  author =       "Michael Barborak and Miroslaw Malek and Anton
                 Dahbura",
  title =        "The Consensus Problem in Fault-Tolerant Computing",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "2",
  pages =        "171--220",
  month =        jun,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/152610.152612",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:43:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/152612.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; Byzantine agreement; consensus problem;
                 decision theory; design; processor membership;
                 reliability; system diagnosis",
  subject =      "{\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability,
                 Fault-tolerance. {\bf C.2.3}: Computer Systems
                 Organization, COMPUTER-COMMUNICATION NETWORKS, Network
                 Operations, Network management. {\bf C.2.3}: Computer
                 Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Network Operations, Network monitoring. {\bf C.2.4}:
                 Computer Systems Organization, COMPUTER-COMMUNICATION
                 NETWORKS, Distributed Systems, Distributed
                 applications. {\bf C.2.4}: Computer Systems
                 Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Distributed Systems, Network operating systems.",
}

@Article{Muntz:1993:ATIc,
  author =       "Richard R. Muntz",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "3",
  pages =        "221--222",
  month =        sep,
  year =         "1993",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Oct 31 23:28:59 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1993:AAc,
  author =       "Richard R. Muntz",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "3",
  pages =        "223--223",
  month =        sep,
  year =         "1993",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Oct 31 23:29:08 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shankar:1993:IAR,
  author =       "A. Udaya Shankar",
  title =        "An Introduction to Assertional Reasoning for
                 Concurrent Systems",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "3",
  pages =        "225--262",
  month =        sep,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/158439.158441",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:44:33 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/158441.html",
  abstract =     "This is a tutorial introduction to assertional
                 reasoning based on temporal logic. The objective is to
                 provide a working familiarity with the technique. We
                 use a simple system model and a simple proof system,
                 and we keep to a minimum the treatment of issues such
                 as soundness, completeness, compositionality, and
                 abstraction. We model a concurrent system by a state
                 transition system and fairness requirements. We reason
                 about such systems using Hoare logic and a subset of
                 linear-time temporal logic, specifically, invariant
                 assertions and leads-to assertions. We apply the method
                 to several examples.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "assertional reasoning; generation of preconditions;
                 Hoare logic; invariants; leads-to; progress properties;
                 safety properties; state transition systems;
                 verification; weakest preconditions",
  subject =      "{\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program
                 Verification, Correctness proofs. {\bf D.3.3}:
                 Software, PROGRAMMING LANGUAGES, Language Constructs
                 and Features. {\bf F.3.1}: Theory of Computation,
                 LOGICS AND MEANINGS OF PROGRAMS, Specifying and
                 Verifying and Reasoning about Programs, Assertions.
                 {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Specifying and Verifying and Reasoning
                 about Programs, Invariants. {\bf F.3.1}: Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about Programs,
                 Logics of programs. {\bf F.3.1}: Theory of Computation,
                 LOGICS AND MEANINGS OF PROGRAMS, Specifying and
                 Verifying and Reasoning about Programs, Pre- and
                 post-conditions.",
}

@Article{Norman:1993:MMC,
  author =       "Michael G. Norman and Peter Thanisch",
  title =        "Models of Machines and Computation for Mapping in
                 Multicomputers",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "3",
  pages =        "263--302",
  month =        sep,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/158439.158908",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:44:33 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/158908.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; mapping; multicomputer load balancing;
                 multicomputers; partitioning; performance; scheduling",
  subject =      "{\bf C.1.2}: Computer Systems Organization, PROCESSOR
                 ARCHITECTURES, Multiple Data Stream Architectures
                 (Multiprocessors), Multiple-instruction-stream,
                 multiple-data-stream processors (MIMD).",
}

@Article{Lilja:1993:CCL,
  author =       "David J. Lilja",
  title =        "Cache Coherence in Large-Scale Shared-Memory
                 Multiprocessors: Issues and Comparisons",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "3",
  pages =        "303--338",
  month =        sep,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/158439.158907",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:44:33 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/158907.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "{\bf B.3.2}: Hardware, MEMORY STRUCTURES, Design
                 Styles, Cache memories.",
}

@Article{Nelson:1993:MPF,
  author =       "Randolph D. Nelson",
  title =        "The Mathematics of Product Form Queuing Networks",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "3",
  pages =        "339--369",
  month =        sep,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/158439.158906",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:44:33 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/158906.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "partial balance; performance; product form;
                 quasireversibility; queuing theory; reversibility",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS. {\bf C.4}: Computer Systems Organization,
                 PERFORMANCE OF SYSTEMS, Modeling techniques.",
}

@Article{Muntz:1993:ATId,
  author =       "Richard R. Muntz",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "4",
  pages =        "371--372",
  month =        dec,
  year =         "1993",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Oct 31 23:29:38 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1993:AAd,
  author =       "Richard R. Muntz",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "4",
  pages =        "373--373",
  month =        dec,
  year =         "1993",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Oct 31 23:29:47 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Baskerville:1993:ISS,
  author =       "Richard Baskerville",
  title =        "Information Systems Security Design Methods:
                 Implications for Information Systems Development",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "4",
  pages =        "375--414",
  month =        dec,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/162124.162127",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:44:55 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/162127.html",
  abstract =     "The security of information systems is a serious issue
                 because computer abuse is increasing. It is important,
                 therefore, that systems analysts and designers develop
                 expertise in methods for specifying information systems
                 security. The characteristics found in three
                 generations of general information system design
                 methods provide a framework for comparing and
                 understanding current security design methods. These
                 methods include approaches that use checklists of
                 controls, divide functional requirements into
                 engineering partitions, and create abstract models of
                 both the problem and the solution. Comparisons and
                 contrasts reveal that advances in security methods lag
                 behind advances in general systems development methods.
                 This analysis also reveals that more general methods
                 fail to consider security specifications rigorously.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "checklists; control; integrity; management; risk
                 analysis; safety; security; structured systems analysis
                 and design; system modeling",
  subject =      "{\bf C.0}: Computer Systems Organization, GENERAL,
                 Systems specification methodology. {\bf H.1.1}:
                 Information Systems, MODELS AND PRINCIPLES, Systems and
                 Information Theory, Value of information. {\bf H.1.2}:
                 Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems, Human factors. {\bf K.6.1}:
                 Computing Milieux, MANAGEMENT OF COMPUTING AND
                 INFORMATION SYSTEMS, Project and People Management,
                 Systems analysis and design. {\bf K.6.5}: Computing
                 Milieux, MANAGEMENT OF COMPUTING AND INFORMATION
                 SYSTEMS, Security and Protection, Authentication. {\bf
                 K.6.5}: Computing Milieux, MANAGEMENT OF COMPUTING AND
                 INFORMATION SYSTEMS, Security and Protection,
                 Insurance. {\bf K.6.5}: Computing Milieux, MANAGEMENT
                 OF COMPUTING AND INFORMATION SYSTEMS, Security and
                 Protection, Invasive software. {\bf K.6.5}: Computing
                 Milieux, MANAGEMENT OF COMPUTING AND INFORMATION
                 SYSTEMS, Security and Protection, Physical security.",
}

@Article{Eschermann:1993:SAH,
  author =       "Bernhard Eschermann",
  title =        "State Assignment for Hardwired {VLSI} Control Units",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "4",
  pages =        "415--436",
  month =        dec,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/162124.162132",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:44:55 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/162132.html",
  abstract =     "Finding a binary encoding of symbolic control states,
                 such that the implementation area of a digital control
                 unit is minimized is well known to be NP-complete. Many
                 heuristic algorithms have been proposed for this state
                 assignment problem. The objective of this article is to
                 present a comprehensive survey and systematic
                 categorization of the various techniques, in
                 particular, for synchronous sequential circuits with
                 nonmicroprogrammed implementations. The problem is
                 partitioned into the generation and the satisfaction of
                 coding constraints. Three types of coding constraints
                 --- adjacency, covering, and disjunctive constraints
                 --- are widely used. The constraint satisfaction
                 algorithms are classified into column-based, row-based,
                 tree-based, dichotomy-based, and global minimization
                 approaches. All of them are illustrated with examples.
                 Special coding requirements and testability-related
                 aspects of state assignment are considered in a
                 separate section. Different implementations of the
                 algorithms presented are also compared.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; built-in tests; coding constraints;
                 computer-aided design; control design; design;
                 finite-state machines; integrated circuits; logic
                 design; sequential circuits; state assignment;
                 synthesis; testability; VLSI",
  subject =      "{\bf B.1.2}: Hardware, CONTROL STRUCTURES AND
                 MICROPROGRAMMING, Control Structure Performance
                 Analysis and Design Aids, Automatic synthesis.",
}

@Article{Brancheau:1993:MEU,
  author =       "James C. Brancheau and Carol V. Brown",
  title =        "The Management of End-User Computing: Status and
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "4",
  pages =        "437--482",
  month =        dec,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/162124.162138",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:44:55 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/162138.html",
  abstract =     "The development of computing applications by the
                 people who have direct need for them in their work has
                 become commonplace. During the 1980s, development of
                 applications by ``end users'' accelerated and became a
                 key management and research concern. Known as
                 ``end-user computing,'' the phenomena and research
                 associated with this trend cross a variety of
                 disciplines. This article critically surveys the
                 published literature on end-user computing (EUC)
                 management according to a comprehensive research model.
                 The article introduces the EUC management research
                 model, identifies prior research contributions, and
                 offers guideline for the future. The focal points of
                 the model are two EUC management components which
                 represent two different levels of theorizing found in
                 the literature. The first level focuses on the
                 organization factors of strategy, technology, and
                 management action. The second level focuses on the
                 individual factors of end user, task, tool, and
                 end-user action. The remainder of the model includes
                 factors typically investigated as the antecedents
                 (context) and consequences (outcomes) of EUC. More than
                 90 English-language articles published from 1983-1990
                 are mapped into the model. Specific variables for each
                 factor are identified; research streams are
                 interpreted; findings are synthesized; and gaps in our
                 knowledge are highlighted. We then raise a number of
                 substantive and methodological issues that need to be
                 addressed and suggest two themes we envision as
                 important for EUC management research in the 1990s: EUC
                 as an extension of organizational computing and EUC as
                 a social learning phenomenon. Guidance is offered for
                 using these theme to inform future research.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "desktop computing; end-user computing; human factors;
                 information center; information technology management;
                 management; personal computing",
  subject =      "{\bf H.4.1}: Information Systems, INFORMATION SYSTEMS
                 APPLICATIONS, Office Automation. {\bf K.6.1}: Computing
                 Milieux, MANAGEMENT OF COMPUTING AND INFORMATION
                 SYSTEMS, Project and People Management.",
}

@Article{Gupta:1994:RSD,
  author =       "Rajiv Gupta and Scott A. Smolka and Shaji Bhaskar",
  title =        "On Randomization in Sequential and Distributed
                 Algorithms",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "1",
  pages =        "7--86",
  month =        mar,
  year =         "1994",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/174666.174667",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:45:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/174667.html",
  abstract =     "Probabilistic, or randomized, algorithms are fast
                 becoming as commonplace as conventional deterministic
                 algorithms. This survey presents five techniques that
                 have been widely used in the design of randomized
                 algorithms. These techniques are illustrated using 12
                 randomized algorithms---both sequential and
                 distributed--- that span a wide range of applications,
                 including:{\em primality testing} (a classical problem
                 in number theory), {\em interactive probabilistic proof
                 systems} (a new method of program testing), {\em dining
                 philosophers} (a classical problem in distributed
                 computing), and {\em Byzantine agreement} (reaching
                 agreement in the presence of malicious processors).
                 Included with each algorithm is a discussion of its
                 correctness and its computational complexity. Several
                 related topics of interest are also addressed,
                 including the theory of probabilistic automata,
                 probabilistic analysis of conventional algorithms,
                 deterministic amplification, and derandomization of
                 randomized algorithms. Finally, a comprehensive
                 annotated bibliography is given.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; analysis of algorithms; Byzantine
                 agreement; computational complexity; CSP; dining
                 philosophers problem; distributed algorithms; graph
                 isomorphism; hashing; interactive probabilistic proof
                 systems; leader election; message routing;
                 nearest-neighbors problem; perfect hashing; primality
                 testing; probabilistic techniques; randomized or
                 probabilistic algorithms; randomized quicksort;
                 sequential algorithms; transitive tournaments;
                 universal hashing",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Probabilistic algorithms (including Monte
                 Carlo). {\bf F.1.2}: Theory of Computation, COMPUTATION
                 BY ABSTRACT DEVICES, Modes of Computation,
                 Probabilistic computation. {\bf D.1.0}: Software,
                 PROGRAMMING TECHNIQUES, General.",
}

@Article{Malone:1994:ISC,
  author =       "Thomas W. Malone and Kevin Crowston",
  title =        "The Interdisciplinary Study of Coordination",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "1",
  pages =        "87--119",
  month =        mar,
  year =         "1994",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/174666.174668",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:45:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/174668.html",
  abstract =     "This survey characterizes an emerging research area,
                 sometimes called {\em coordination theory}, that
                 focuses on the interdisciplinary study of coordination.
                 Research in this area uses and extends ideas about
                 coordination from disciplines such as computer science,
                 organization theory, operations research, economics,
                 linguistics, and psychology.\par

                 A key insight of the framework presented here is that
                 coordination can be seen as the process of {\em
                 managing dependencies} among activities. Further
                 progress, therefore, should be possible by
                 characterizing different kinds of dependencies and
                 identifying the coordination processes that can be used
                 to manage them. A variety of processes are analyzed
                 from this perspective, and commonalities across
                 disciplines are identified. Processes analyzed include
                 those for managing {\em shared resources,
                 producer/consumer relationships, simultaneity
                 constraints}, and {\em task/subtask
                 dependencies}.\par

                 Section 3 summarizes ways of applying a coordination
                 perspective in three different domains:(1)
                 understanding the effects of information technology on
                 human organizations and markets, (2) designing
                 cooperative work tools, and (3) designing distributed
                 and parallel computer systems. In the final section,
                 elements of a research agenda in this new area are
                 briefly outlined.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer-supported cooperative work; coordination;
                 coordination science; coordination theory; design;
                 economics; groupware; human factors; management;
                 theory",
  subject =      "{\bf I.2.11}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Distributed Artificial Intelligence,
                 Coherence and coordination. {\bf C.0}: Computer Systems
                 Organization, GENERAL, System architectures. {\bf
                 C.2.4}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
                 {\bf D.4.1}: Software, OPERATING SYSTEMS, Process
                 Management. {\bf D.4.2}: Software, OPERATING SYSTEMS,
                 Storage Management. {\bf H.1.1}: Information Systems,
                 MODELS AND PRINCIPLES, Systems and Information Theory.
                 {\bf H.4.1}: Information Systems, INFORMATION SYSTEMS
                 APPLICATIONS, Office Automation. {\bf H.4.3}:
                 Information Systems, INFORMATION SYSTEMS APPLICATIONS,
                 Communications Applications. {\bf H.5.3}: Information
                 Systems, INFORMATION INTERFACES AND PRESENTATION, Group
                 and Organization Interfaces. {\bf K.4.3}: Computing
                 Milieux, COMPUTERS AND SOCIETY, Organizational
                 Impacts.",
}

@Article{Lee:1994:PDM,
  author =       "Sunggu Lee and Kang Geun Shin",
  title =        "Probabilistic Diagnosis of Multiprocessor Systems",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "1",
  pages =        "121--139",
  month =        mar,
  year =         "1994",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/174666.174669",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:45:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/174669.html",
  abstract =     "This paper critically surveys methods for the
                 automated probabilistic diagnosis of large
                 multiprocessor systems. In recent years, much of the
                 work on system-level diagnosis has focused on
                 probabilistic methods, which can diagnose
                 intermittently faulty processing nodes and can be
                 applied in {\em general} situations on {\em general}
                 interconnection networks. The theory behind the
                 probabilistic diagnosis methods is explained, and the
                 various diagnosis algorithms are described in simple
                 terms with the aid of a running example. The diagnosis
                 methods are compared and analyzed, and a chart is
                 produced, showing the comparative advantages of the
                 various diagnosis algorithms on the basis of several
                 factors important to the probabilistic diagnosis.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; centralized and distributed
                 self-diagnosis; comparison testing; fault-tolerant
                 computing; performance; probabilistic diagnosis;
                 system-level diagnosis; system-level testing",
  subject =      "{\bf C.4}: Computer Systems Organization, PERFORMANCE
                 OF SYSTEMS, Reliability, availability, and
                 serviceability. {\bf C.1.2}: Computer Systems
                 Organization, PROCESSOR ARCHITECTURES, Multiple Data
                 Stream Architectures (Multiprocessors).",
}

@Article{Muntz:1994:ATI,
  author =       "Richard R. Muntz",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "2",
  pages =        "141--142",
  month =        jun,
  year =         "1994",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:24:44 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1994:,
  author =       "Richard R. Muntz",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "2",
  pages =        "143--144",
  month =        jun,
  year =         "1994",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 25 10:24:44 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chen:1994:RHP,
  author =       "Peter M. Chen and Edward K. Lee and Garth A. Gibson
                 and Randy H. Katz and David A. Patterson",
  title =        "{RAID}: High-Performance, Reliable Secondary Storage",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "2",
  pages =        "145--185",
  month =        jun,
  year =         "1994",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/176979.176981",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:45:42 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/176981.html",
  abstract =     "Disk arrays were proposed in the 1980s as a way to use
                 parallelism between multiple disks to improve aggregate
                 I/O performance. Today they appear in the product lines
                 of most major computer manufacturers. This article
                 gives a comprehensive overview of disk arrays and
                 provides a framework in which to organize current and
                 future work. First, the article introduces disk
                 technology and reviews the driving forces that have
                 popularized disk arrays: performance and reliability.
                 It discusses the two architectural techniques used in
                 disk arrays: striping across multiple disks to improve
                 performance and redundancy to improve reliability.
                 Next, the article describes seven disk array
                 architectures, called RAID (Redundant Arrays of
                 Inexpensive Disks) levels 0--6 and compares their
                 performance, cost, and reliability. It goes on to
                 discuss advanced research and implementation topics
                 such as refining the basic RAID levels to improve
                 performance and designing algorithms to maintain data
                 consistency. Last, the article describes six disk array
                 prototypes of products and discusses future
                 opportunities for research, with an annotated
                 bibliography disk array-related literature.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; Disk Array; disk array; parallel I/O;
                 performance; RAID; redundancy; reliability; storage;
                 striping",
  subject =      "{\bf B.4.2}: Hardware, INPUT/OUTPUT AND DATA
                 COMMUNICATIONS, Input/Output Devices. {\bf B.4.5}:
                 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
                 Reliability, Testing, and Fault-Tolerance. {\bf B.4.4}:
                 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
                 Performance Analysis and Design Aids. {\bf B.3.2}:
                 Hardware, MEMORY STRUCTURES, Design Styles, Mass
                 storage.",
}

@Article{Harris:1994:SPS,
  author =       "Tim J. Harris",
  title =        "A Survey of {PRAM} Simulation Techniques",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "2",
  pages =        "187--206",
  month =        jun,
  year =         "1994",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/176979.176984",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:45:42 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/176984.html",
  abstract =     "The Parallel Random Access Machine (PRAM) is an
                 abstract model of parallel computation which allows
                 researchers to focus on the essential characteristics
                 of a parallel architecture and ignore other details.
                 The PRAM has long been acknowledged to be a useful tool
                 for the study of parallel computing, but unfortunately
                 it is not physically implementable in hardware. In
                 order to take advantage of the broad base of algorithms
                 and results regarding this high-level abstraction one
                 needs general methods for allowing the execution of
                 PRAM algorithms on more realistic machines. In the
                 following we survey these methods, which we refer to as
                 PRAM simulation techniques. The general issues of
                 memory management and routing are discussed, and both
                 randomized and deterministic solutions are considered.
                 We show that good theoretical solutions to many of the
                 subproblems in PRAM simulation have been developed,
                 though questions still exist as to their practical
                 utility. This article should allow those performing
                 research in this field to become well acquainted with
                 the current state of the art, while allowing the novice
                 to get an intuitive feeling for the fundamental
                 questions being considered. The introduction should
                 provide a concise tutorial for those unfamiliar with
                 the problem of PRAM simulation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; bounded-degree networks; models of
                 parallel computation; Parallel complexity theory;
                 parallel complexity theory",
  subject =      "{\bf F.1.1}: Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Models of Computation,
                 Unbounded-action devices. {\bf F.1.1}: Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Models of
                 Computation, Relations among models. {\bf C.1.2}:
                 Computer Systems Organization, PROCESSOR ARCHITECTURES,
                 Multiple Data Stream Architectures (Multiprocessors),
                 Interconnection architectures. {\bf F.2.2}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Routing and layout. {\bf F.2.2}: Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems, Sorting and
                 searching. {\bf F.1.2}: Theory of Computation,
                 COMPUTATION BY ABSTRACT DEVICES, Modes of Computation,
                 Parallelism and concurrency.",
}

@Article{Muntz:1994:AIa,
  author =       "Richard R. Muntz",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "3",
  pages =        "207--207",
  month =        sep,
  year =         "1994",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Dec 16 18:45:42 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1994:AAa,
  author =       "Richard R. Muntz",
  title =        "About the Authors \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "3",
  pages =        "209--210",
  month =        sep,
  year =         "1994",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Dec 16 18:45:42 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Landwehr:1994:TCP,
  author =       "Carl E. Landwehr and Alan R. Bull and John P.
                 McDermott and William S. Choi",
  title =        "A Taxonomy of Computer Program Security Flaws",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "3",
  pages =        "211--254",
  month =        sep,
  year =         "1994",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/185403.185412",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:45:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/185412.html",
  abstract =     "An organized record of actual flaws can be useful to
                 computer system designers, programmers, analysts,
                 administrators, and users. This survey provides a
                 taxonomy for computer program security flaws, with an
                 Appendix that documents 50 actual security flaws. These
                 flaws have all been described previously in the open
                 literature, but in widely separated places. For those
                 new to the field of computer security, they provide a
                 good introduction to the characteristics of security
                 flaws and how they can arise. Because these flaws were
                 not randomly selected from a valid statistical sample
                 of such flaws, we make no strong claims concerning the
                 likely distribution of actual security flaws within the
                 taxonomy. However, this method of organizing security
                 flaw data can help those who have custody of more
                 representative samples to organize them and to focus
                 their efforts to remove and, eventually, to prevent the
                 introduction of security flaws.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; authentication; D.2.0 [Software
                 Engineering]: General---protection mechanisms; D.2.9
                 [Software Engineering]: Management---life cycle; D.4.6
                 [Operating Systems]: Security and Protection---access
                 controls; error/defect classification; information
                 flows controls; invasive software; K.6.3 [Management of
                 Computing and Information Systems]: Software
                 Management---software development; K.6.5 [Management of
                 Computing and Information Systems]: Security and
                 Protection---authentication; security; security flaw;
                 software configuration management; software
                 maintenance; taxonomy",
  subject =      "{\bf D.4.6}: Software, OPERATING SYSTEMS, Security and
                 Protection. {\bf D.4.6}: Software, OPERATING SYSTEMS,
                 Security and Protection, Authentication. {\bf D.4.6}:
                 Software, OPERATING SYSTEMS, Security and Protection,
                 Information flow controls. {\bf D.4.6}: Software,
                 OPERATING SYSTEMS, Security and Protection, Invasive
                 software. {\bf D.2.0}: Software, SOFTWARE ENGINEERING,
                 General, Protection mechanisms. {\bf D.2.9}: Software,
                 SOFTWARE ENGINEERING, Management, Life cycle. {\bf
                 D.2.9}: Software, SOFTWARE ENGINEERING, Management,
                 Software configuration management. {\bf K.6.3}:
                 Computing Milieux, MANAGEMENT OF COMPUTING AND
                 INFORMATION SYSTEMS, Software Management, Software
                 development. {\bf K.6.5}: Computing Milieux, MANAGEMENT
                 OF COMPUTING AND INFORMATION SYSTEMS, Security and
                 Protection, Authentication. {\bf K.6.5}: Computing
                 Milieux, MANAGEMENT OF COMPUTING AND INFORMATION
                 SYSTEMS, Security and Protection, Invasive software.",
}

@Article{Bailey:1994:PLS,
  author =       "Mary L. Bailey and Jack V. {Briner, Jr.} and Roger D.
                 Chamberlain",
  title =        "Parallel Logic Simulation of {VLSI} Systems",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "3",
  pages =        "255--294",
  month =        sep,
  year =         "1994",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/185403.185424",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:45:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/185424.html",
  abstract =     "Fast, efficient logic simulators are an essential tool
                 in modern VLSI system design. Logic simulation is used
                 extensively for design verification prior to
                 fabrication, and as VLSI systems grow in size, the
                 execution time required by simulation is becoming more
                 and more significant. Faster logic simulators will have
                 an appreciable economic impact, speeding time to market
                 while ensuring more thorough system design testing. One
                 approach to this problem is to utilize parallel
                 processing, taking advantage of the concurrency
                 available in the VLSI system to accelerate the logic
                 simulation task.\par

                 Parallel logic simulation has received a great deal of
                 attention over the past several years, but this work
                 has not yet resulted in effective, high-performance
                 simulators being available to VLSI designers. A number
                 of techniques have been developed to investigate
                 performance issues: formal models, performance
                 modeling, empirical studies, and prototype
                 implementations. Analyzing reported results of these
                 techniques, we conclude that five major factors affect
                 performance: synchronization algorithm, circuit
                 structure, timing granularity, target architecture, and
                 partitioning. After reviewing techniques for parallel
                 simulation, we consider each of these factors using
                 results reported in the literature. Finally we
                 synthesize the results and present directions for
                 future research in the field.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Algorithms; B.6.3 [Logic Design]: Design
                 Aids---simulation; B.7.2 [Integrated Circuits]: Design
                 Aids---simulation; C.2.4 [Computer-Communications
                 Networks]: Distributed Systems---distributed
                 applications; Circuit structure; circuit structure;
                 distributed; Experimentation; I.6.3 [Simulation and
                 Modeling]: Applications; I.6.8 [Simulation and
                 Modeling]: Types of Simulation---discrete event;
                 parallel; parallel algorithms; parallel architecture;
                 parallelism; partitioning; Performance; synchronization
                 algorithm; timing granularity",
  subject =      "{\bf B.6.3}: Hardware, LOGIC DESIGN, Design Aids,
                 Simulation. {\bf B.7.2}: Hardware, INTEGRATED CIRCUITS,
                 Design Aids, Simulation. {\bf C.2.4}: Computer Systems
                 Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Distributed Systems, Distributed applications. {\bf
                 I.6.3}: Computing Methodologies, SIMULATION AND
                 MODELING, Applications. {\bf I.6.8}: Computing
                 Methodologies, SIMULATION AND MODELING, Types of
                 Simulation, Discrete event. {\bf I.6.8}: Computing
                 Methodologies, SIMULATION AND MODELING, Types of
                 Simulation, Distributed. {\bf I.6.8}: Computing
                 Methodologies, SIMULATION AND MODELING, Types of
                 Simulation, Parallel.",
}

@Article{deKergommeaux:1994:PLP,
  author =       "Jacques Chassin de Kergommeaux and Philippe Codognet",
  title =        "Parallel Logic Programming Systems",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "3",
  pages =        "295--336",
  month =        sep,
  year =         "1994",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/185403.185453",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:45:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/185453.html",
  abstract =     "Parallelizing logic programming has attracted much
                 interest in the research community, because of the
                 intrinsic OR- and AND-parallelisms of logic programs.
                 One research stream aims at transparent exploitation of
                 parallelism in existing logic programming languages
                 such as Prolog, while the family of concurrent logic
                 languages develops language constructs allowing
                 programmers to express the concurrency --- that is, the
                 communication and synchronization between parallel
                 processes --- within their algorithms. This article
                 concentrates mainly on transparent exploitation of
                 parallelism and surveys the most mature solutions to
                 the problems to be solved in order to obtain efficient
                 implementations. These solutions have been implemented,
                 and the most efficient parallel logic programming
                 systems reach effective speedups over state-of-the-art
                 sequential Prolog implementations. The article also
                 addresses current and prospective research issues in
                 extending the applicability and the efficiency of
                 existing systems, such as models merging the
                 transparent parallelism and the concurrent logic
                 languages approaches, combination of constraint logic
                 programming with parallelism, and use of highly
                 parallel architectures.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "and parallel languages; AND-parallelism; B.3.2 [Memory
                 Structures]: Design Styles---shared memory; binding
                 arrays; C.1.2 [Processor Architectures]: Multiple Data
                 Stream Architectures; concurrent constraint
                 programming; constraints; D.1.3 [Programming
                 Techniques]: Concurrent Programming---parallel
                 programming; D.1.6 [Programming Techniques]: Logic
                 Programming; D.3.2 [Programming Languages]: Language
                 Classifications--concurrent; D.3.4 [Programming
                 Languages]: Processors---compilers; distributed; F.4.1
                 [Mathematical Logic and Formal Languages]: Mathematical
                 Logic--logic programming; guard; hash windows;
                 interpreters; languages; load balancing; massive
                 parallelism; memory management; multisequential
                 implementation techniques; nondeterminism;
                 OR-parallelism; preprocessors; Prolog; scheduling
                 parallel tasks; static analysis; Warren Abstract
                 Machine",
  subject =      "{\bf D.1.6}: Software, PROGRAMMING TECHNIQUES, Logic
                 Programming. {\bf D.1.3}: Software, PROGRAMMING
                 TECHNIQUES, Concurrent Programming, Parallel
                 programming. {\bf B.3.2}: Hardware, MEMORY STRUCTURES,
                 Design Styles, Shared memory. {\bf C.1.2}: Computer
                 Systems Organization, PROCESSOR ARCHITECTURES, Multiple
                 Data Stream Architectures (Multiprocessors). {\bf
                 D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Concurrent, distributed, and parallel
                 languages. {\bf D.3.4}: Software, PROGRAMMING
                 LANGUAGES, Processors, Compilers. {\bf D.3.4}:
                 Software, PROGRAMMING LANGUAGES, Processors,
                 Interpreters. {\bf F.4.1}: Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Logic programming.",
}

@Article{Wegner:1994:ED,
  author =       "Peter Wegner and Marvin Israel",
  title =        "Editorial Directions",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "4",
  pages =        "337--339",
  month =        dec,
  year =         "1994",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 13 09:52:49 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1994:AIb,
  author =       "Richard R. Muntz",
  title =        "About This Issue",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "4",
  pages =        "341--341",
  month =        dec,
  year =         "1994",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 13 09:52:49 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1994:AAb,
  author =       "Richard R. Muntz",
  title =        "About The Authors",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "4",
  pages =        "343--343",
  month =        dec,
  year =         "1994",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 13 09:52:49 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bacon:1994:CTH,
  author =       "David F. Bacon and Susan L. Graham and Oliver J.
                 Sharp",
  title =        "Compiler Transformations for High-Performance
                 Computing",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "4",
  pages =        "345--420",
  month =        dec,
  year =         "1994",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/197405.197406",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/197406.html",
  abstract =     "In the last three decades a large number of compiler
                 transformations for optimizing programs have been
                 implemented. Most optimizations for uniprocessors
                 reduce the number of instructions executed by the
                 program using transformations based on the analysis of
                 scalar quantities and data-flow techniques. In
                 contrast, optimizations for high-performance
                 superscalar, vector, and parallel processors maximize
                 parallelism and memory locality with transformations
                 that rely on tracking the properties of arrays using
                 loop dependence analysis.\par

                 This survey is a comprehensive overview of the
                 important high-level program restructuring techniques
                 for imperative languages, such as C and Fortran.
                 Transformations for both sequential and various types
                 of parallel architectures are covered in depth. We
                 describe the purpose of each transformation, explain
                 how to determine if it is legal, and give an example of
                 its application.\par

                 Programmers wishing to enhance the performance of their
                 code can use this survey to improve their understanding
                 of the optimizations that compilers can perform, or as
                 a reference for techniques to be applied manually.
                 Students can obtain an overview of optimizing compiler
                 technology. Compiler writers can use this survey as a
                 reference for most of the important optimizations
                 developed to date, and as bibliographic reference for
                 the details of each optimization. Readers are expected
                 to be familiar with modern computer architecture and
                 basic program compilation techniques.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "compilation; D.1.3 [Programming Techniques]:
                 Concurrent Programming; D.3.4 [Programming Languages]:
                 Processors---compilers; dependence analysis; I.2.2
                 [Artificial Intelligence]: Automatic
                 Programming---program transformation; languages;
                 locality; multiprocessors; optimization; parallelism;
                 performance; superscalar processors; vectorization",
  subject =      "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
                 Processors, Compilers. {\bf D.1.3}: Software,
                 PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf
                 D.3.4}: Software, PROGRAMMING LANGUAGES, Processors,
                 Optimization. {\bf I.2.2}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Automatic Programming, Program
                 transformation.",
}

@Article{Matousek:1994:GRS,
  author =       "Ji{\v{r}}{\'\i} Matou{\v{s}}ek",
  title =        "Geometric Range Searching",
  journal =      j-COMP-SURV,
  volume =       "26",
  number =       "4",
  pages =        "421--461",
  month =        dec,
  year =         "1994",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/197405.197408",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:22 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/197408.html",
  abstract =     "In geometric range searching, algorithmic problems of
                 the following type are considered. Given an $n$-point
                 set P in the plane, build a data structure so that,
                 given a query triangle R, the number of points of P
                 lying in R can be determined quickly. Similar questions
                 can be asked for point sets in higher dimensions, with
                 triangles replaced by simplices or by more complicated
                 shapes. Algorithms of this type are of crucial
                 importance in computational geometry, as they can be
                 used as subroutines in solutions to many seemingly
                 unrelated problems, which are often motivated by
                 practical applications, for instance in computer
                 graphics (ray tracing, hidden-surface removal etc.). We
                 present a survey of theoretical results and the main
                 techniques in geometric range searching.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; and systems; computational geometry; E.1
                 [Data]: Data Structures; F.2.2 [Analysis of Algorithms
                 and Problem Complexity]: Nonnumerical Algorithms and
                 Problems---geometric problems and computations; G.m
                 [Mathematics of Computing]: Miscellaneous; H.3.3
                 [Information Storage and Retrieval]: Information Search
                 and Retrieval; I.3.5 [Computer Graphics]: Computational
                 Geometry and Object Modeling---geometric algorithms;
                 languages; lower bounds in arithmetic model; partition
                 tree; range searching; theory",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Geometrical problems and
                 computations. {\bf E.1}: Data, DATA STRUCTURES. {\bf
                 G.m}: Mathematics of Computing, MISCELLANEOUS. {\bf
                 H.3.3}: Information Systems, INFORMATION STORAGE AND
                 RETRIEVAL, Information Search and Retrieval. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems.",
}

@Article{Wegner:1995:AIa,
  author =       "Peter Wegner and Marvin Israel",
  title =        "About This Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Jun 23 18:07:21 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hartmanis:1995:TAL,
  author =       "Juris Hartmanis",
  title =        "{Turing Award} Lecture: {On} Computational Complexity
                 and the Nature of Computer Science",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "7--16",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214040",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214040.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "human factors",
  subject =      "{\bf F.0}: Theory of Computation, GENERAL. {\bf A.0}:
                 General Literature, GENERAL. {\bf K.1}: Computing
                 Milieux, THE COMPUTER INDUSTRY.",
}

@Article{Belady:1995:DPS,
  author =       "Laszlo A. Belady",
  title =        "The Disappearance of the {``Pure''} Software
                 Industry",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "17--18",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214043",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214043.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf K.1}: Computing Milieux, THE COMPUTER INDUSTRY.
                 {\bf D.2.0}: Software, SOFTWARE ENGINEERING, General.",
}

@Article{Brassard:1995:TAP,
  author =       "Gilles Brassard",
  title =        "Time for Another Paradigm Shift",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "19--21",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214044",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214044.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "human factors",
  subject =      "{\bf F.2.0}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf A.0}:
                 General Literature, GENERAL.",
}

@Article{Denning:1995:CTS,
  author =       "Peter J. Denning",
  title =        "Can there be a science of information?",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "23--25",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214046",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214046.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf H.1.1}: Information Systems, MODELS AND
                 PRINCIPLES, Systems and Information Theory, Value of
                 information. {\bf A.0}: General Literature, GENERAL.",
}

@Article{Freeman:1995:ECS,
  author =       "Peter A. Freeman",
  title =        "Effective Computer Science",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "27--29",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214048",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214048.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf K.1}: Computing Milieux, THE COMPUTER INDUSTRY.
                 {\bf A.0}: General Literature, GENERAL.",
}

@Article{Loui:1995:CSN,
  author =       "Michael C. Loui",
  title =        "Computer Science is a New Engineering Discipline",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "31--32",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214049",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214049.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf F.0}: Theory of Computation, GENERAL. {\bf K.1}:
                 Computing Milieux, THE COMPUTER INDUSTRY. {\bf A.0}:
                 General Literature, GENERAL.",
}

@Article{Plaice:1995:CSE,
  author =       "John Plaice",
  title =        "Computer Science is an Experimental Science",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "33--33",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214050",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214050.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf F.0}: Theory of Computation, GENERAL. {\bf K.1}:
                 Computing Milieux, THE COMPUTER INDUSTRY. {\bf A.0}:
                 General Literature, GENERAL.",
}

@Article{Savage:1995:WCS,
  author =       "John E. Savage",
  title =        "Will computer science become irrelevant?",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "35--37",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214052",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214052.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf F.0}: Theory of Computation, GENERAL. {\bf K.1}:
                 Computing Milieux, THE COMPUTER INDUSTRY. {\bf A.0}:
                 General Literature, GENERAL.",
}

@Article{Stewart:1995:SCS,
  author =       "N. F. Stewart",
  title =        "Science and Computer Science",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "39--41",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214088",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214088.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf F.0}: Theory of Computation, GENERAL. {\bf K.1}:
                 Computing Milieux, THE COMPUTER INDUSTRY. {\bf A.0}:
                 General Literature, GENERAL.",
}

@Article{Ullman:1995:RTT,
  author =       "Jeffrey D. Ullman",
  title =        "The Role of Theory Today",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "43--44",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214089",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214089.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf F.0}: Theory of Computation, GENERAL. {\bf K.1}:
                 Computing Milieux, THE COMPUTER INDUSTRY. {\bf A.0}:
                 General Literature, GENERAL.",
}

@Article{Wegner:1995:IBE,
  author =       "Peter Wegner",
  title =        "Interaction as a Basis for Empirical Computer
                 Science",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "45--48",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214092",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214092.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf F.0}: Theory of Computation, GENERAL. {\bf A.0}:
                 General Literature, GENERAL. {\bf K.1}: Computing
                 Milieux, THE COMPUTER INDUSTRY.",
}

@Article{Weingarten:1995:GFC,
  author =       "Fred Weingarten",
  title =        "Government Funding and Computing Research Priorities",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "49--54",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214093",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214093.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf F.0}: Theory of Computation, GENERAL. {\bf A.0}:
                 General Literature, GENERAL. {\bf K.1}: Computing
                 Milieux, THE COMPUTER INDUSTRY.",
}

@Article{Wulf:1995:WSE,
  author =       "W. A. Wulf",
  title =        "Are we scientists or engineers?",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "55--57",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214096",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214096.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf A.0}: General Literature, GENERAL. {\bf K.1}:
                 Computing Milieux, THE COMPUTER INDUSTRY. {\bf F.0}:
                 Theory of Computation, GENERAL.",
}

@Article{Hartmanis:1995:REC,
  author =       "Juris Hartmanis",
  title =        "Response to the Essays {``On Computational Complexity
                 and the Nature of Computer Science''}",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "59--61",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214097",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214097.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf F.0}: Theory of Computation, GENERAL. {\bf A.0}:
                 General Literature, GENERAL. {\bf K.1}: Computing
                 Milieux, THE COMPUTER INDUSTRY.",
}

@Article{Buhr:1995:MC,
  author =       "Peter A. Buhr and Michel Fortier and Michael H.
                 Coffin",
  title =        "Monitor Classification",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "63--107",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214100",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214100.html",
  abstract =     "One of the most natural, elegant, and efficient
                 mechanisms for synchronization and communication,
                 especially for systems with shared memory, is the {\em
                 monitor}. Over the past twenty years many kinds of
                 monitors have been proposed and implemented, and many
                 modern programming languages provide some form of
                 monitor for concurrency control. This paper presents a
                 taxonomy of monitors that encompasses all the extant
                 monitors and suggests others not found in the
                 literature or in existing programming languages. It
                 discusses the semantics and performance of the various
                 kinds of monitors suggested by the taxonomy, and it
                 discusses programming techniques suitable to each.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; classification; control structures; D.1.3
                 [Programming Techniques]: Concurrent Programming; D.3.3
                 [Programming Languages]: Language Constructs and
                 Features---concurrent programming structures; D.4.1
                 [Operating Systems]: Process Management---concurrency;
                 F.3.3 [Logics and Meanings of Programs]: Studies of
                 Program Constructs---control primitives; languages;
                 monitors; mutual exclusion; performance;
                 Performance---simulation; scheduling; synchronization",
  subject =      "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance,
                 Simulation. {\bf D.1.3}: Software, PROGRAMMING
                 TECHNIQUES, Concurrent Programming. {\bf D.3.3}:
                 Software, PROGRAMMING LANGUAGES, Language Constructs
                 and Features, Concurrent programming structures. {\bf
                 D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Control structures. {\bf
                 D.4.1}: Software, OPERATING SYSTEMS, Process
                 Management, Concurrency. {\bf D.4.1}: Software,
                 OPERATING SYSTEMS, Process Management, Mutual
                 exclusion. {\bf D.4.1}: Software, OPERATING SYSTEMS,
                 Process Management, Scheduling. {\bf D.4.1}: Software,
                 OPERATING SYSTEMS, Process Management, Synchronization.
                 {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Studies of Program Constructs, Control
                 primitives.",
}

@Article{Baeza-Yates:1995:FAR,
  author =       "Ricardo A. Baeza-Yates",
  title =        "Fringe Analysis Revisited",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "109--119",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/214037.214103",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:46:43 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/214103.html",
  abstract =     "Fringe analysis is a technique used to study the
                 average behavior of search trees. In this paper we
                 survey the main results regarding this technique, and
                 we improve a previous asymptotic theorem. At the same
                 time, we present new developments and applications of
                 the theory that allow improvements in several bounds on
                 the behavior of search trees. Our examples cover binary
                 search trees, AVL-trees, 2--3 trees, and B-trees.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; average case analysis; AVL trees; B-trees;
                 E.1 [Data]: Data Structures---trees; F.2.2 [Analysis of
                 Algorithms and Problem Complexity]: Nonnumerical
                 Algorithms and Problems---computations on discrete
                 structures; matrix theory; recurrence equations; search
                 trees; sorting and searching",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Sorting and searching. {\bf
                 E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.2}: Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Computations on discrete structures.",
}

@Article{Various:1995:STN,
  author =       "Various",
  title =        "The Scope and Tutorial Needs of the {ACM SIGs}",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "1",
  pages =        "121--137",
  month =        mar,
  year =         "1995",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Jun 23 18:07:21 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wegner:1995:AIb,
  author =       "Peter Wegner and Marvin Israel",
  title =        "About This Issue",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "139--140",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Sep 18 08:40:14 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pitoura:1995:OOM,
  author =       "Evaggelia Pitoura and Omran Bukhres and Ahmed
                 Elmagarmid",
  title =        "Object Orientation in Multidatabase Systems",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "141--195",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210378",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210378.html",
  abstract =     "A multidatabase system (MDBS) is a confederation of
                 preexisting distributed, heterogeneous, and autonomous
                 database systems. There has been a recent proliferation
                 of research suggesting the application of
                 object-oriented techniques to facilitate the complex
                 task of designing and implementing MDBSs. Although this
                 approach seems promising, the lack of a general
                 framework impedes any further development. The goal of
                 this paper is to provide a concrete analysis and
                 categorization of the various ways in which object
                 orientation has affected the task of designing and
                 implementing MDBSs.\par

                 We identify three dimensions in which the
                 object-oriented paradigm has influenced this task: the
                 general system architecture, the schema architecture,
                 and the heterogeneous transaction management. Then we
                 provide a classification and a comprehensive analysis
                 of the issues related to each of the above dimensions.
                 To demonstrate the applicability of this analysis, we
                 conclude with a comparative review of existing
                 multidatabase systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; distributed objects; federated databases;
                 integration; languages; management; multidatabases;
                 standardization; views",
  subject =      "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems, Distributed systems. {\bf C.2.4}: Computer
                 Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Distributed Systems, Distributed applications. {\bf
                 C.2.4}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
                 Distributed databases. {\bf D.1.5}: Software,
                 PROGRAMMING TECHNIQUES, Object-oriented Programming.
                 {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models. {\bf H.2.1}: Information
                 Systems, DATABASE MANAGEMENT, Logical Design, Schema
                 and subschema. {\bf H.2.3}: Information Systems,
                 DATABASE MANAGEMENT, Languages, Query languages. {\bf
                 H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.2.4}: Information
                 Systems, DATABASE MANAGEMENT, Systems, Transaction
                 processing. {\bf H.2.5}: Information Systems, DATABASE
                 MANAGEMENT, Heterogeneous Databases, Data translation.
                 {\bf H.2.5}: Information Systems, DATABASE MANAGEMENT,
                 Heterogeneous Databases, Program translation.",
}

@Article{Paakki:1995:AGP,
  author =       "Jukka Paakki",
  title =        "Attribute Grammar Paradigms --- a High-Level
                 Methodology in Language Implementation",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "196--255",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.197409",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/197409.html",
  abstract =     "Attribute grammars are a formalism for specifying
                 programming languages. They have been applied to a
                 great number of systems automatically producing
                 language implementations from their specifications. The
                 systems and their specification languages can be
                 evaluated and classified according to their level of
                 application support, linguistic characteristics, and
                 degree of automation.\par

                 A survey of attribute grammar-based specification
                 languages is given. The modern advanced specification
                 languages extend the core attribute grammar model with
                 concepts and primitives from established programming
                 paradigms. The main ideas behind the developed
                 attribute grammar paradigms are discussed, and
                 representative specification languages are presented
                 with a common example grammar. The presentation is
                 founded on mapping elements of attribute grammars to
                 their counterparts in programming languages. This
                 methodology of integrating two problem-solving
                 disciplines together is explored with a classification
                 of the paradigms into structured, modular,
                 object-oriented, logic, and functional attribute
                 grammars. The taxonomy is complemented by introducing
                 approaches based on an implicit parallel or incremental
                 attribute evaluation paradigm.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "attribute grammars; blocks; classes; compiler writing
                 systems; design; functional dependencies; incomplete
                 data; incrementality; inheritance; language processing;
                 language processor generators; languages; lazy
                 evaluation; logical variables; objects; parallelism;
                 processes; programming paradigms; semantic functions;
                 symbol tables; theory; unification",
  subject =      "{\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal
                 Definitions and Theory. {\bf F.4.2}: Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Grammars and Other Rewriting Systems. {\bf D.3.4}:
                 Software, PROGRAMMING LANGUAGES, Processors,
                 Compilers.",
}

@Article{Garlan:1995:RDS,
  author =       "David Garlan",
  title =        "Research Directions in Software Architecture",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "257--261",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210388",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210388.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design",
  subject =      "{\bf D.2.0}: Software, SOFTWARE ENGINEERING, General.
                 {\bf K.6.3}: Computing Milieux, MANAGEMENT OF COMPUTING
                 AND INFORMATION SYSTEMS, Software Management.",
}

@Article{Nierstrasz:1995:RDS,
  author =       "Oscar Nierstrasz and Theo Dirk Meijler",
  title =        "Research Directions in Software Composition",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "262--264",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210389",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210389.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques. {\bf D.2.m}: Software, SOFTWARE
                 ENGINEERING, Miscellaneous, Reusable software. {\bf
                 D.2.10}: Software, SOFTWARE ENGINEERING, Design,
                 Methodologies.",
}

@Article{Wiederhold:1995:MIS,
  author =       "Gio Wiederhold",
  title =        "Mediation in Information Systems",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "265--267",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210390",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210390.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; theory",
  subject =      "{\bf H.4.2}: Information Systems, INFORMATION SYSTEMS
                 APPLICATIONS, Types of Systems, Decision support. {\bf
                 H.1.0}: Information Systems, MODELS AND PRINCIPLES,
                 General.",
}

@Article{Manola:1995:IIL,
  author =       "Frank Manola",
  title =        "Interoperability Issues in Large-Scale Distributed
                 Object Systems",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "268--270",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210391",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210391.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; theory",
  subject =      "{\bf C.2.4}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
                 {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems, Distributed systems. {\bf H.3.4}: Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Systems and
                 Software, Information networks.",
}

@Article{Heiler:1995:SI,
  author =       "Sandra Heiler",
  title =        "Semantic Interoperability",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "271--273",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210392",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210392.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; theory",
  subject =      "{\bf C.2.4}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
                 {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems, Distributed systems. {\bf H.3.4}: Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Systems and
                 Software, Information networks.",
}

@Article{Sutherland:1995:BOC,
  author =       "Jeff Sutherland",
  title =        "Business Objects in Corporate Information Systems",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "274--276",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210394",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210394.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; theory",
  subject =      "{\bf D.2.m}: Software, SOFTWARE ENGINEERING,
                 Miscellaneous, Reusable software. {\bf H.4.2}:
                 Information Systems, INFORMATION SYSTEMS APPLICATIONS,
                 Types of Systems. {\bf D.2.2}: Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, Modules and
                 interfaces.",
}

@Article{Gallopoulos:1995:WPS,
  author =       "Efstratios Gallopoulos and Elias N. Houstis and John
                 R. Rice",
  title =        "Workshop on Problem-Solving Environments: Findings and
                 Recommendations",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "277--279",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210396",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210396.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "documentation",
  subject =      "{\bf F.0}: Theory of Computation, GENERAL. {\bf A.0}:
                 General Literature, GENERAL, Conference proceedings.",
}

@Article{Rosenberg:1995:TPC,
  author =       "Arnold L. Rosenberg",
  title =        "Thoughts on Parallelism and Concurrency in Computing
                 Curricula",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "280--283",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210399",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210399.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; human factors",
  subject =      "{\bf K.3.2}: Computing Milieux, COMPUTERS AND
                 EDUCATION, Computer and Information Science Education,
                 Curriculum. {\bf F.1.2}: Theory of Computation,
                 COMPUTATION BY ABSTRACT DEVICES, Modes of Computation,
                 Parallelism and concurrency.",
}

@Article{Metaxas:1995:FIP,
  author =       "P. Takis Metaxas",
  title =        "Fundamental Ideas for a Parallel Computing Course",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "284--286",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210404",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210404.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; human factors",
  subject =      "{\bf K.3.2}: Computing Milieux, COMPUTERS AND
                 EDUCATION, Computer and Information Science Education,
                 Curriculum. {\bf F.1.2}: Theory of Computation,
                 COMPUTATION BY ABSTRACT DEVICES, Modes of Computation,
                 Parallelism and concurrency.",
}

@Article{Moller:1995:CCB,
  author =       "Faron Moller and Scott A. Smolka",
  title =        "On the Computational Complexity of Bisimulation",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "287--289",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210406",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210406.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf F.1.3}: Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Complexity Classes. {\bf F.2.0}:
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, General.",
}

@Article{Cytron:1995:SST,
  author =       "Ron K. Cytron and Brent Hailpern",
  title =        "{SIGPLAN} Scope and Tutorial Needs",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "290--291",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210407",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210407.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design",
  subject =      "{\bf A.0}: General Literature, GENERAL. {\bf D.3.0}:
                 Software, PROGRAMMING LANGUAGES, General.",
}

@Article{Thomasian:1995:SFH,
  author =       "Alexander Thomasian",
  title =        "Surveyors' forum --- high-performance secondary
                 memory",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "2",
  pages =        "292--295",
  month =        jun,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/210376.210409",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:47:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/210409.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; performance; reliability",
  subject =      "{\bf B.4.2}: Hardware, INPUT/OUTPUT AND DATA
                 COMMUNICATIONS, Input/Output Devices. {\bf B.4.5}:
                 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
                 Reliability, Testing, and Fault-Tolerance. {\bf B.4.4}:
                 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
                 Performance Analysis and Design Aids. {\bf B.3.2}:
                 Hardware, MEMORY STRUCTURES, Design Styles, Mass
                 storage.",
}

@Article{Wegner:1995:AIc,
  author =       "Peter Wegner and Marvin Israel",
  title =        "About This Issue",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "297--297",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 28 15:34:50 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Reddy:1995:GCA,
  author =       "Raj Reddy",
  title =        "Grand Challenges in {AI}",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "301--303",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212097",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212097.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.0}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, General.",
}

@Article{Ahuja:1995:DRM,
  author =       "Narendra Ahuja",
  title =        "On Detection and Representation of Multiscale
                 Low-Level Image Structure",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "304--306",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212099",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212099.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.10}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding.",
}

@Article{Aloimonos:1995:SUR,
  author =       "Yiannis Aloimonos and C. Ferm{\"u}ller and A.
                 Rosenfeld",
  title =        "Seeing and Understanding: Representing the Visual
                 World",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "307--309",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212101",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212101.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.10}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding. {\bf
                 I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism. {\bf I.5.4}:
                 Computing Methodologies, PATTERN RECOGNITION,
                 Applications, Computer vision.",
}

@Article{Bajcsy:1995:SST,
  author =       "Ruzena Bajcsy",
  title =        "Signal-to-Symbol Transformation and Vice Versa: From
                 Fundamental Processes to Representation",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "310--313",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212103",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212103.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.4}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Knowledge Representation Formalisms and
                 Methods, Representations (procedural and rule-based).
                 {\bf I.2.0}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, General.",
}

@Article{Brachman:1995:UBU,
  author =       "Ronald J. Brachman and Hector J. Levesque",
  title =        "Undirected Behavior Without Unbounded Search",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "314--316",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212104",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212104.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.4}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Knowledge Representation Formalisms and
                 Methods, Representations (procedural and rule-based).
                 {\bf I.2.8}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Problem Solving, Control Methods, and
                 Search.",
}

@Article{Charniak:1995:NLL,
  author =       "Eugene Charniak",
  title =        "Natural Language Learning",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "317--319",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212108",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212108.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.7}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Natural Language Processing.",
  xxauthor =     "Eugen Charniak",
}

@Article{Clancey:1995:AIN,
  author =       "William J. Clancey",
  title =        "{AI}: Inventing a New Kind of Machine",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "320--322",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212110",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212110.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.0}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, General.",
}

@Article{Cohn:1995:CQS,
  author =       "A. G. Cohn",
  title =        "The Challenge of Qualitative Spatial Reasoning",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "323--325",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212112",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212112.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.4}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Knowledge Representation Formalisms and
                 Methods. {\bf I.2.3}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Deduction and Theorem
                 Proving.",
}

@Article{Dietterich:1995:OUM,
  author =       "Tom Dietterich",
  title =        "Overfitting and Undercomputing in Machine Learning",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "326--327",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212114",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212114.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.6}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Learning. {\bf I.2.8}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Problem
                 Solving, Control Methods, and Search, Heuristic
                 methods. {\bf I.2.2}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Automatic Programming,
                 Automatic analysis of algorithms.",
}

@Article{Dubois:1995:WDF,
  author =       "Didier Dubois and Henri Prade",
  title =        "What Does Fuzzy Logic Bring to {AI}?",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "328--330",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212115",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212115.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Deduction and Theorem Proving,
                 Uncertainty, ``fuzzy,'' and probabilistic reasoning.",
}

@Article{Ginsberg:1995:EHA,
  author =       "Matthew L. Ginsberg",
  title =        "Epistemological and Heuristic Adequacy Revisited",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "331--333",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212117",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212117.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Problem Solving, Control Methods, and
                 Search.",
}

@Article{Kambhampati:1995:APP,
  author =       "Subbarao Kambhampati",
  title =        "{AI} Planning: a Prospectus on Theory and
                 Applications",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "334--336",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212118",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212118.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Problem Solving, Control Methods, and
                 Search, Plan execution, formation, generation.",
}

@Article{Korf:1995:SES,
  author =       "Richard E. Korf",
  title =        "Space-Efficient Search Algorithms",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "337--339",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212120",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212120.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Problem Solving, Control Methods, and
                 Search, Graph and tree search strategies. {\bf I.2.8}:
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Problem Solving, Control Methods, and Search, Heuristic
                 methods.",
}

@Article{Lesser:1995:MSE,
  author =       "Victor R. Lesser",
  title =        "Multiagent Systems: An Emerging Subdiscipline of
                 {AI}",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "340--342",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212121",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212121.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.11}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Distributed Artificial Intelligence. {\bf
                 I.2.1}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Applications and Expert Systems.",
}

@Article{Lifschitz:1995:LCS,
  author =       "Vladimir Lifschitz",
  title =        "The Logic of Common Sense",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "343--345",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212122",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212122.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Deduction and Theorem Proving, Logic
                 programming.",
}

@Article{Loui:1995:MDS,
  author =       "R. P. Loui",
  title =        "Models of Deliberation in the Social Sciences",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "346--348",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212123",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212123.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.0}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, General. {\bf I.2.3}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
                 Theorem Proving. {\bf J.4}: Computer Applications,
                 SOCIAL AND BEHAVIORAL SCIENCES.",
}

@Article{Pitrat:1995:ASD,
  author =       "Jacques Pitrat",
  title =        "{AI} Systems are Dumb Because {AI} Researchers Are Too
                 Clever",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "349--350",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212124",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212124.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; human factors; performance",
  subject =      "{\bf I.2.1}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Applications and Expert Systems.",
}

@Article{Tate:1995:DLY,
  author =       "Austin Tate",
  title =        "Don't Leave Your Plan on the Shelf",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "351--352",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212125",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212125.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; theory",
  subject =      "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Problem Solving, Control Methods, and
                 Search, Plan execution, formation, generation.",
}

@Article{Torasso:1995:RA,
  author =       "Pietro Torasso and Luca Console and Luigi Portinale
                 and Daniele Theseider Dupr{\'e}",
  title =        "On the Role of Abduction",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "353--355",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212126",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212126.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Deduction and Theorem Proving. {\bf
                 I.2.8}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Problem Solving, Control Methods, and
                 Search.",
}

@Article{Waltz:1995:RD,
  author =       "David Waltz and Simon Kasif",
  title =        "On Reasoning From Data",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "356--359",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212127",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212127.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Deduction and Theorem Proving. {\bf
                 I.2.4}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Knowledge Representation Formalisms and
                 Methods.",
}

@Article{Wellman:1995:EAA,
  author =       "Michael P. Wellman",
  title =        "The Economic Approach to Artificial Intelligence",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "360--362",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212128",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212128.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "economics; theory",
  subject =      "{\bf I.2.0}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, General. {\bf K.6.0}: Computing Milieux,
                 MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS,
                 General.",
}

@Article{Yip:1995:IR,
  author =       "Kenneth Yip and Feng Zhao and Elisha Sacks",
  title =        "Imagistic Reasoning",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "363--365",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212130",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 UnCover library database",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212130.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; performance; theory",
  subject =      "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Deduction and Theorem Proving. {\bf
                 I.2.9}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Robotics, Manipulators.",
}

@Article{Allan:1995:SP,
  author =       "Vicki H. Allan and Reese B. Jones and Randall M. Lee
                 and Stephen J. Allan",
  title =        "Software Pipelining",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "367--432",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212131",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212131.html",
  abstract =     "Utilizing parallelism at the instruction level is an
                 important way to improve performance. Because the time
                 spent in loop execution dominates total execution time,
                 a large body of optimizations focuses on decreasing the
                 time to execute each iteration. Software pipelining is
                 a technique that reforms the loop so that a faster
                 execution rate is realized. Iterations are executed in
                 overlapped fashion to increase parallelism.\par

                 Let $ \mbox {\em ABC}^n $ represent a loop containing
                 operations $A$, $B$, $C$ that is executed $n$ times.
                 Although the operations of a single iteration can be
                 parallelized, more parallelism may be achieved if the
                 entire loop is considered rather than a single
                 iteration. The software pipelining transformation
                 utilizes the fact that a loop $ \mbox {\em ABC}^n $ is
                 equivalent to $ \mbox {\em A} \mbox {\em BCA}^{n - 1}
                 \mbox {\em BC} $. Although the operations contained in
                 the loop do not change, the operations are from
                 different iterations of the original loop.\par

                 Various algorithms for software pipelining exist. A
                 comparison of the alternative methods for software
                 pipelining is presented. The relationships between the
                 methods are explored and possibilities for improvement
                 highlighted.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; instruction level parallelism; languages;
                 loop reconstruction; optimization; software
                 pipelining",
  subject =      "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
                 Processors, Optimization. {\bf D.1.3}: Software,
                 PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf
                 D.3.4}: Software, PROGRAMMING LANGUAGES, Processors,
                 Compilers.",
}

@Article{Beauchemin:1995:COF,
  author =       "S. S. Beauchemin and J. L. Barron",
  title =        "The Computation of Optical Flow",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "3",
  pages =        "433--467",
  month =        sep,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/212094.212141",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:48:20 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/212141.html",
  abstract =     "Two-dimensional image motion is the projection of the
                 three-dimensional motion of objects, relative to a
                 visual sensor, onto its image plane. Sequences of
                 time-ordered images allow the estimation of projected
                 two-dimensional image motion as either instantaneous
                 image velocities or discrete image displacements. These
                 are usually called the {\em optical flow field} or the
                 {\em image velocity field}. Provided that optical flow
                 is a reliable approximation to two-dimensional image
                 motion, it may then be used to recover the
                 three-dimensional motion of the visual sensor (to
                 within a scale factor) and the three-dimensional
                 surface structure (shape or relative depth) through
                 assumptions concerning the structure of the optical
                 flow field, the three-dimensional environment, and the
                 motion of the sensor. Optical flow may also be used to
                 perform motion detection, object segmentation,
                 time-to-collision and focus of expansion calculations,
                 motion compensated encoding, and stereo disparity
                 measurement. We investigate the computation of optical
                 flow in this survey: widely known methods for
                 estimating optical flow are classified and examined by
                 scrutinizing the hypothesis and assumptions they use.
                 The survey concludes with a discussion of current
                 research issues.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; measurement; theory",
  subject =      "{\bf I.2.10}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding, Motion.
                 {\bf I.3.1}: Computing Methodologies, COMPUTER
                 GRAPHICS, Hardware architecture, Three-dimensional
                 displays. {\bf I.4.0}: Computing Methodologies, IMAGE
                 PROCESSING, General, Image displays. {\bf I.4.0}:
                 Computing Methodologies, IMAGE PROCESSING, General,
                 Image processing software. {\bf I.4.8}: Computing
                 Methodologies, IMAGE PROCESSING, Scene Analysis,
                 Time-varying imagery. {\bf I.4.10}: Computing
                 Methodologies, IMAGE PROCESSING, Image Representation,
                 Hierarchical. {\bf I.5.0}: Computing Methodologies,
                 PATTERN RECOGNITION, General.",
}

@Article{Greenlaw:1995:CG,
  author =       "Raymond Greenlaw and Rossella Petreschi",
  title =        "Cubic Graphs",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "471--495",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234783",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "coloring; complexity theory; cubic graphs; discrete
                 mathematics; graph theory; matching; NP-completeness;
                 P-completeness; planar graphs; regular graphs",
}

@Article{Prather:1995:DAH,
  author =       "Ronald E. Prather",
  title =        "Design and Analysis of Hierarchical Software Metrics",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "497--518",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234784",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "flowcharts; hierarchical metrics; software
                 engineering; software metrics",
}

@Article{Sarkar:1995:MSE,
  author =       "Dilip Sarkar",
  title =        "Methods to Speed Up Error Back-Propagation Learning
                 Algorithm",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "519--542",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234785",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "adaptive learning rate; artificial neural networks;
                 conjugate gradient method; energy function; error
                 back-propagation learning; feedforward networks;
                 learning rate; momentum; oscillation of weights;
                 training set size",
}

@Article{Anonymous:1995:CSS,
  author =       "Anonymous",
  title =        "Computing Surveys Symposium on Multimedia",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "543--544",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 20 11:54:12 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gudivada:1995:MSI,
  author =       "Venkat N. Gudivada",
  title =        "Multimedia Systems --- An Interdisciplinary
                 Perspective",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "545--548",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234786",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fox:1995:MCC,
  author =       "Edward A. Fox and Linda M. Kieffer",
  title =        "Multimedia Curricula, Courses, and Knowledge Modules",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "549--551",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234787",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Furht:1995:WIS,
  author =       "Borko Furht",
  title =        "Where Are Information Superhighways Headed?",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "554--556",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234788",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Preece:1995:SFE,
  author =       "Jenny Preece and Ben Shneiderman",
  title =        "Survival of the Fittest: The Evolution of Multimedia
                 User Interfaces",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "557--559",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234789",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Andre:1995:IMM,
  author =       "Elisabeth Andr{\'e}",
  title =        "Intellimedia: Making Multimedia Usable by Exploiting
                 {AI} Methods",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "560--563",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234790",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Aref:1995:HEI,
  author =       "Walid G. Aref and Ibrahim Kamel and Daniel P.
                 Lopresti",
  title =        "On Handling Electronic Ink",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "564--567",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234791",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Baker:1995:NMA,
  author =       "James E. Baker and Isabel F. Cruz and Giuseppe Liotta
                 and Roberto Tamassia",
  title =        "A New Model for Algorithm Animation Over the {WWW}",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "568--572",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234792",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chang:1995:EFC,
  author =       "Shih-Fu Chang",
  title =        "Exploring Functionalities in the Compressed
                 Image\slash Video Domain",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "573--575",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.250721",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Christodoulakis:1995:RDI,
  author =       "Stavros Christodoulakis and Peter Triantafillou",
  title =        "Research and Development Issues for Large-Scale
                 Multimedia Information Systems",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "576--579",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234793",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cowan:1995:AMD,
  author =       "Crispin Cowan and Shanwei Cen and Jonathan Walpole and
                 Calton Pu",
  title =        "Adaptive Methods for Distributed Video Presentation",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "580--583",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234794",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dimitrova:1995:MSV,
  author =       "Nevenka Dimitrova",
  title =        "The Myth of Semantic Video Retrieval",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "584--586",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234795",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Flank:1995:RNL,
  author =       "Sharon Flank",
  title =        "The Role of Natural-Language Processing in
                 Multimedia",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "587--589",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234796",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Garofalakis:1995:SIM,
  author =       "Minos N. Garofalakis and Yannis E. Ioannidis",
  title =        "Scheduling Issues in Multimedia Query Optimization",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "590--592",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234797",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ghafoor:1995:MDM,
  author =       "Arif Ghafoor",
  title =        "Multimedia Database Management Systems",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "593--598",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234798",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hall:1995:RHM,
  author =       "Wendy Hall",
  title =        "The Role of Hypermedia in Multimedia Information
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "599--601",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234799",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:1995:DDM,
  author =       "Qing Li and Liu Sheng Huang",
  title =        "A Dynamic Data Model for a Video Database Management
                 System",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "602--606",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234800",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Moffat:1995:IOM,
  author =       "Alistair Moffat and Justin Zobel",
  title =        "Index Organization for Multimedia Database Systems",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "607--609",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234801",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mosse:1995:RRN,
  author =       "Daniel Moss{\'e}",
  title =        "Resource Reservations in Networked Multimedia
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "610--612",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234802",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nahrstedt:1995:EEQ,
  author =       "Klara Nahrstedt",
  title =        "End-to-End {QoS} Guarantees in Networked Multimedia
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "613--616",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234803",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ozden:1995:RIM,
  author =       "Banu {\"O}zden and Rajeev Rastogi and Avi
                 Silberschatz",
  title =        "Research Issues in Multimedia Storage Servers",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "617--620",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234804",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Picard:1995:CLS,
  author =       "Rosalind W. Picard",
  title =        "Computer Learning of Subjectivity",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "621--623",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234805",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Roselli:1995:AIC,
  author =       "Teresa Roselli",
  title =        "Artificial Intelligence Can Improve Hypermedia
                 Instructional Technologies for Learning",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "624--626",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234806",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rus:1995:CMI,
  author =       "Daniela Rus and Devika Subramanian",
  title =        "Customizing Multimedia Information Access",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "627--629",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234807",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Samet:1995:GRI,
  author =       "Hanan Samet",
  title =        "General Research Issues in Multimedia Database
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "630--632",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234808",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Schank:1995:MAE,
  author =       "Roger C. Schank and Michael Korcuska and Menachem
                 Jona",
  title =        "Multimedia Applications for Education and Training:
                 Revolution or Red Herring?",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "633--635",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234809",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shenoy:1995:IMS,
  author =       "Prashant J. Shenoy and Pawan Goyal and Harrick M.
                 Vin",
  title =        "Issues in Multimedia Server Design",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "636--639",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234810",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Staehli:1995:DPD,
  author =       "Richard Staehli and Jonathan Walpole and David Maier",
  title =        "Device and Physical-Data Independence for Multimedia
                 Presentations",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "640--642",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234811",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhang:1995:DVA,
  author =       "HongJiang Zhang and Qi Tian",
  title =        "Digital Video Analysis and Recognition for
                 Content-Based Access",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "643--644",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234782.234812",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:49:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Anonymous:1995:CAI,
  author =       "Anonymous",
  title =        "Contents: Author Index: Vols. 23--27 (1991--1995)",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "645--650",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 20 11:51:39 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Anonymous:1995:CSI,
  author =       "Anonymous",
  title =        "Contents: Subject index: Vols. 23--27 (1991--1995)",
  journal =      j-COMP-SURV,
  volume =       "27",
  number =       "4",
  pages =        "650--653",
  month =        dec,
  year =         "1995",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 20 11:53:27 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Abiteboul:1996:MPC,
  author =       "Serge Abiteboul and Gabriel M. Kuper and Harry G.
                 Mairson and Alexander A. Shvartsman and Moshe Y.
                 Vardi",
  title =        "In memoriam {Paris C. Kanellakis}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "3--15",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234318",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p3-abiteboul/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234318.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "biographies/autobiographies. {\bf h.2.0}: information
                 systems; database management; documentation; general;
                 history of computing; humanfactors; people. {\bf a.0}:
                 general literature; {\bf k.2}: computing milieux",
  subject =      "{\bf K.2}: Computing Milieux, HISTORY OF COMPUTING,
                 People. {\bf A.0}: General Literature, GENERAL,
                 Biographies/autobiographies. {\bf H.2.0}: Information
                 Systems, DATABASE MANAGEMENT, General.",
}

@Article{Reingold:1996:BTD,
  author =       "Edward M. Reingold",
  title =        "Basic techniques for design and analysis of
                 algorithms",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "19--21",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234321",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p19-reingold/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234321.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; analysis of algorithms and problem
                 complexity; and search; artificial intelligence;
                 control methods; design; dynamic programming.; general.
                 {\bf i.2.8}: computing methodologies; problem solving;
                 {\bf f.2.0}: theory of computation",
  subject =      "{\bf F.2.0}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf
                 I.2.8}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Problem Solving, Control Methods, and
                 Search, Dynamic programming.",
}

@Article{Tucker:1996:AAS,
  author =       "Allen Tucker and Peter Wegner",
  title =        "{ACM 50th-Anniversary Symposium}: {Perspectives} in
                 Computer Science",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "19--286",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 24 18:42:48 MDT 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tamassia:1996:DS,
  author =       "Roberto Tamassia",
  title =        "Data structures",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "23--26",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234323",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p23-tamassia/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234323.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "general.; logics and meanings of programs; semantics
                 of programming languages. {\bf e.0}: data; theory; {\bf
                 f.3.2}: theory of computation",
  subject =      "{\bf F.3.2}: Theory of Computation, LOGICS AND
                 MEANINGS OF PROGRAMS, Semantics of Programming
                 Languages. {\bf E.0}: Data, GENERAL.",
}

@Article{Lee:1996:CG,
  author =       "D. T. Lee",
  title =        "Computational geometry",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "27--31",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234325",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p27-lee/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234325.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "analysis of algorithms and problem complexity; and
                 search.; and systems. {\bf i.2.8}: computing
                 methodologies; artificial intelligence; computational
                 geometry and object modeling; computer graphics;
                 control methods; geometric algorithms; geometrical
                 problems and computations. {\bf i.3.5}: computing
                 methodologies; languages; nonnumerical algorithms and
                 problems; problem solving; theory; {\bf f.2.2}: theory
                 of computation",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Geometrical problems and
                 computations. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Geometric algorithms, languages, and systems.
                 {\bf I.2.8}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Problem Solving, Control Methods, and
                 Search.",
}

@Article{Motwani:1996:RA,
  author =       "Rajeev Motwani and Prabhakar Raghavan",
  title =        "Randomized algorithms",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "33--37",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234327",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p33-motwani/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234327.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; analysis of algorithms and problem
                 complexity; design; general. {\bf g.3}: mathematics of
                 computing; probability and statistics.; theory; {\bf
                 f.2.0}: theory of computation",
  subject =      "{\bf F.2.0}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS.",
}

@Article{Crochemore:1996:PMT,
  author =       "Maxime Crochemore and Thierry Lecroq",
  title =        "Pattern-matching and text-compression algorithms",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "39--41",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234331",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p39-crochemore/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234331.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; analysis of algorithms and problem
                 complexity; nonnumerical algorithms and problems;
                 pattern matching.; theory; {\bf f.2.2}: theory of
                 computation",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Pattern matching.",
}

@Article{Khuller:1996:GNA,
  author =       "Samir Khuller and Balaji Raghavachari",
  title =        "Graph and network algorithms",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "43--45",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234334",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p43-khuller/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234334.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; analysis of algorithms and problem
                 complexity; discrete mathematics; general.; graph
                 theory. {\bf f.2.0}: theory of computation; theory;
                 {\bf g.2.2}: mathematics of computing",
  subject =      "{\bf G.2.2}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory. {\bf F.2.0}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, General.",
}

@Article{Loui:1996:CCT,
  author =       "Michael C. Loui",
  title =        "Computational complexity theory",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "47--49",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234337",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p47-loui/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234337.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "analysis of algorithms and problem complexity;
                 complexity classes.; computation by abstract devices;
                 general. {\bf f.1.3}: theory of computation; theory;
                 {\bf f.2.0}: theory of computation",
  subject =      "{\bf F.2.0}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf
                 F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT
                 DEVICES, Complexity Classes.",
}

@Article{Blelloch:1996:PA,
  author =       "Guy E. Blelloch and Bruce M. Maggs",
  title =        "Parallel algorithms",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "51--54",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234339",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p51-blelloch/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234339.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; computation by abstract devices; general;
                 modes of computation; numerical analysis; parallel
                 algorithms.; parallelism and concurrency. {\bf g.1.0}:
                 mathematics of computing; theory; {\bf f.1.2}: theory
                 of computation",
  subject =      "{\bf F.1.2}: Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Modes of Computation, Parallelism and
                 concurrency. {\bf G.1.0}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, General, Parallel algorithms.",
}

@Article{Chandru:1996:COI,
  author =       "Vijay Chandru and M. R. Rao",
  title =        "Combinatorial optimization: an integer programming
                 perspective",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "55--58",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234341",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p55-chandru/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234341.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; combinatorial algorithms.; combinatorics;
                 discrete mathematics; numerical analysis; optimization.
                 {\bf g.2.1}: mathematics of computing; theory; {\bf
                 g.1.6}: mathematics of computing",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization. {\bf G.2.1}: Mathematics of
                 Computing, DISCRETE MATHEMATICS, Combinatorics,
                 Combinatorial algorithms.",
}

@Article{Lapaugh:1996:LAV,
  author =       "Andrea S. Lapaugh",
  title =        "Layout algorithm for {VLSI} design",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "59--61",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234343",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p59-lapaugh/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234343.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; analysis of algorithms and problem
                 complexity; design; nonnumerical algorithms and
                 problems.; theory; {\bf f.2.2}: theory of computation",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems.",
}

@Article{Burger:1996:MS,
  author =       "Doug Burger",
  title =        "Memory systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "63--65",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234974",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p63-burger/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234974.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; general.; memory structures; theory; {\bf
                 b.3.0}: hardware",
  subject =      "{\bf B.3.0}: Hardware, MEMORY STRUCTURES, General.",
}

@Article{Flynn:1996:PA,
  author =       "Michael J. Flynn and Kevin W. Rudd",
  title =        "Parallel architectures",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "67--70",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234345",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p67-flynn/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234345.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computation by abstract devices; design; general.;
                 modes of computation; parallelism and concurrency. {\bf
                 c.1.0}: computer systems organization; processor
                 architectures; theory; {\bf f.1.2}: theory of
                 computation",
  subject =      "{\bf F.1.2}: Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Modes of Computation, Parallelism and
                 concurrency. {\bf C.1.0}: Computer Systems
                 Organization, PROCESSOR ARCHITECTURES, General.",
}

@Article{Quinlan:1996:LDT,
  author =       "J. R. Quinlan",
  title =        "Learning decision tree classifiers",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "71--72",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234346",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p71-quinlan/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234346.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "artificial intelligence; complexity classes;
                 complexity hierarchies.; computation by abstract
                 devices; learning. {\bf f.1.3}: theory of computation;
                 theory; {\bf i.2.6}: computing methodologies",
  subject =      "{\bf I.2.6}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Learning. {\bf F.1.3}: Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Complexity Classes, Complexity hierarchies.",
}

@Article{Jordan:1996:NN,
  author =       "Michael I. Jordan and Christopher M. Bishop",
  title =        "Neural networks",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "73--75",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234348",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p73-jordan/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234348.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "artificial intelligence; connectionism and neural
                 nets. {\bf g.2.2}: mathematics of computing; design;
                 discrete mathematics; graph theory.; learning; theory;
                 {\bf i.2.6}: computing methodologies",
  subject =      "{\bf I.2.6}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Learning, Connectionism and neural nets.
                 {\bf G.2.2}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory.",
}

@Article{Forrest:1996:GA,
  author =       "Stephanie Forrest",
  title =        "Genetic algorithms",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "77--80",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234350",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p77-forrest/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234350.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; and search.; artificial intelligence;
                 automatic analysis of algorithms. {\bf i.2.8}:
                 computing methodologies; automatic programming; control
                 methods; problem solving; theory; {\bf i.2.2}:
                 computing methodologies",
  subject =      "{\bf I.2.2}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Automatic Programming, Automatic analysis
                 of algorithms. {\bf I.2.8}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Problem Solving, Control
                 Methods, and Search.",
}

@Article{Lewis:1996:R,
  author =       "F. L. Lewis and M. Fitzgerald and K. Liu",
  title =        "Robotics",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "81--83",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234351",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p81-lewis/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234351.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "artificial intelligence; coherence and coordination.;
                 distributed artificial intelligence; reliability;
                 robotics. {\bf i.2.11}: computing methodologies;
                 theory; {\bf i.2.9}: computing methodologies",
  subject =      "{\bf I.2.9}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Robotics. {\bf I.2.11}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Distributed
                 Artificial Intelligence, Coherence and coordination.",
}

@Article{Dean:1996:AP,
  author =       "Thomas Dean",
  title =        "Automated planning",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "85--87",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234352",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p85-dean/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234352.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "and search; artificial intelligence; control methods;
                 design; formation; generation.; plan execution; problem
                 solving; theory; {\bf i.2.8}: computing methodologies",
  subject =      "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Problem Solving, Control Methods, and
                 Search, Plan execution, formation, generation.",
}

@Article{Pearl:1996:DMU,
  author =       "Judea Pearl",
  title =        "Decision making under uncertainty",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "89--92",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234354",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p89-pearl/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234354.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "'' and probabilistic reasoning. {\bf i.2.6}: computing
                 methodologies; ``fuzzy; algorithms; artificial
                 intelligence; connectionism and neural nets. {\bf
                 g.2.2}: mathematics of computing; deduction and theorem
                 proving; discrete mathematics; graph theory.; learning;
                 theory; uncertainty; {\bf i.2.3}: computing
                 methodologies",
  subject =      "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Deduction and Theorem Proving,
                 Uncertainty, ``fuzzy,'' and probabilistic reasoning.
                 {\bf I.2.6}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Learning, Connectionism and neural nets.
                 {\bf G.2.2}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory.",
}

@Article{Cinnella:1996:NSR,
  author =       "Pasquale Cinnella",
  title =        "Numerical simulations of reactive flows",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "93--96",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234355",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p93-cinnella/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234355.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "general. {\bf j.2}: computer applications; numerical
                 analysis; physical sciences and engineering; physics.;
                 theory; {\bf g.1.0}: mathematics of computing",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General. {\bf J.2}: Computer Applications,
                 PHYSICAL SCIENCES AND ENGINEERING, Physics.",
}

@Article{Shang:1996:CE,
  author =       "Joseph S. Shang",
  title =        "Computational electromagnetics",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "97--99",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234357",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p97-shang/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234357.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "general. {\bf j.2}: computer applications; numerical
                 analysis; physical sciences and engineering; physics.;
                 theory; {\bf g.1.0}: mathematics of computing",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General. {\bf J.2}: Computer Applications,
                 PHYSICAL SCIENCES AND ENGINEERING, Physics.",
}

@Article{Kingsbury:1996:CB,
  author =       "David T. Kingsbury",
  title =        "Computational biology",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "101--103",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234358",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p101-kingsbury/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234358.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "biology.; life and medical sciences; theory; {\bf
                 j.3}: computer applications",
  subject =      "{\bf J.3}: Computer Applications, LIFE AND MEDICAL
                 SCIENCES, Biology.",
}

@Article{Silberschatz:1996:DM,
  author =       "Avi Silberschatz and Henry F. Korth and S. Sudarshan",
  title =        "Data models",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "105--108",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234360",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p105-silberschatz/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234360.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data models.; database management; design; logical
                 design; theory; {\bf h.2.1}: information systems",
  subject =      "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
                 Logical Design, Data models.",
}

@Article{Ceri:1996:RDS,
  author =       "Stefano Ceri and Raghu Ramakrishnan",
  title =        "Rules in database systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "109--111",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234362",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p109-ceri/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234362.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database management; management; systems.; theory;
                 {\bf h.2.4}: information systems",
  subject =      "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems.",
}

@Article{Shasha:1996:TDH,
  author =       "Dennis Shasha",
  title =        "Tuning databases for high performance",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "113--115",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234363",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p113-shasha/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234363.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "access methods. {\bf h.2.4}: information systems;
                 database management; management; physical design;
                 systems; theory; transaction processing.; {\bf h.2.2}:
                 information systems",
  subject =      "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
                 Physical Design, Access methods. {\bf H.2.4}:
                 Information Systems, DATABASE MANAGEMENT, Systems,
                 Transaction processing.",
}

@Article{Salzberg:1996:AM,
  author =       "Betty Salzberg",
  title =        "Access methods",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "117--120",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234365",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p117-salzberg/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234365.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database management; design; physical design.; theory;
                 {\bf h.2.2}: information systems",
  subject =      "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
                 Physical Design.",
}

@Article{Ioannidis:1996:QO,
  author =       "Yannis E. Ioannidis",
  title =        "Query optimization",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "121--123",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234367",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p121-ioannidis/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234367.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database management; design; information search and
                 retrieval; information storage and retrieval; query
                 formulation.; query processing. {\bf h.3.3}:
                 information systems; systems; theory; {\bf h.2.4}:
                 information systems",
  subject =      "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems, Query processing. {\bf H.3.3}: Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Information
                 Search and Retrieval, Query formulation.",
}

@Article{Ozsu:1996:DPD,
  author =       "M. Tamer {\"O}zsu and Patrick Valduriez",
  title =        "Distributed and parallel database systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "125--128",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234368",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p125-ozsu/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234368.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database management; design; systems.; theory; {\bf
                 h.2.4}: information systems",
  subject =      "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems.",
}

@Article{Jajodia:1996:DSP,
  author =       "Sushil Jajodia",
  title =        "Database security and privacy",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "129--131",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234370",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p129-jajodia/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234370.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "access methods.; and protection. {\bf h.2.2}:
                 information systems; database management; general;
                 integrity; management; physical design; security;
                 theory; {\bf h.2.0}: information systems",
  subject =      "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
                 General, Security, integrity, and protection. {\bf
                 H.2.2}: Information Systems, DATABASE MANAGEMENT,
                 Physical Design, Access methods.",
}

@Article{Riloff:1996:TDI,
  author =       "Ellen Riloff and Lee Hollaar",
  title =        "Text databases and information retrieval",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "133--135",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234371",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p133-riloff/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234371.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database management; information search and retrieval.
                 {\bf h.2.4}: information systems; information storage
                 and retrieval; systems.; theory; {\bf h.3.3}:
                 information systems",
  subject =      "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
                 AND RETRIEVAL, Information Search and Retrieval. {\bf
                 H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems.",
}

@Article{Bancilhon:1996:OD,
  author =       "Fran{\c{c}}ois Bancilhon",
  title =        "Object databases",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "137--140",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234373",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p137-bancilhon/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234373.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database management; design; languages; performance;
                 query languages.; systems. {\bf h.2.3}: information
                 systems; theory; {\bf h.2.4}: information systems",
  subject =      "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
                 Systems. {\bf H.2.3}: Information Systems, DATABASE
                 MANAGEMENT, Languages, Query languages.",
}

@Article{Melton:1996:SLS,
  author =       "Jim Melton",
  title =        "{SQL} language summary",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "141--143",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234374",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p141-melton/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234374.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database management; languages; query languages.;
                 reliability; {\bf h.2.3}: information systems",
  subject =      "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages.",
}

@Article{House:1996:OTD,
  author =       "Donald H. House",
  title =        "Overview of three-dimensional computer graphics",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "145--148",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234375",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p145-house/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234375.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer graphics; documentation; experimentation;
                 graphics systems.; reliability; three-dimensional
                 graphics and realism. {\bf i.3.2}: computing
                 methodologies; {\bf i.3.7}: computing methodologies",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism. {\bf
                 I.3.2}: Computing Methodologies, COMPUTER GRAPHICS,
                 Graphics Systems.",
}

@Article{Rockwood:1996:GP,
  author =       "A. P. Rockwood",
  title =        "Geometric primitives",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "149--151",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234377",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p149-rockwood/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234377.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "and object representations.; computational geometry
                 and object modeling; computer graphics; curve; solid;
                 surface; theory; {\bf i.3.5}: computing methodologies",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations.",
}

@Article{Ebert:1996:AMT,
  author =       "David S. Ebert",
  title =        "Advanced modeling techniques for computer graphics",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "153--156",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234378",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p153-ebert/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234378.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computational geometry and object modeling.; computer
                 graphics; experimentation; methodology and techniques.
                 {\bf i.3.5}: computing methodologies; theory;
                 verification; {\bf i.3.6}: computing methodologies",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling.",
}

@Article{Watt:1996:RTP,
  author =       "Alan Watt",
  title =        "Rendering techniques: past, present and future",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "157--159",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234380",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p157-watt/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234380.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computational geometry and object modeling.; computer
                 graphics; methodology and techniques. {\bf i.3.5}:
                 computing methodologies; theory; {\bf i.3.6}: computing
                 methodologies",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling.",
}

@Article{Thalmann:1996:CA,
  author =       "Nadia Magnenat Thalmann and Daniel Thalmann",
  title =        "Computer animation",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "161--163",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234381",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p161-thalmann/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234381.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "animation. {\bf i.3.6}: computing methodologies;
                 computer graphics; experimentation; methodology and
                 techniques.; theory; three-dimensional graphics and
                 realism; verification; {\bf i.3.7}: computing
                 methodologies",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Animation. {\bf I.3.6}: Computing Methodologies,
                 COMPUTER GRAPHICS, Methodology and Techniques.",
}

@Article{Kaufman:1996:VV,
  author =       "Arie E. Kaufman",
  title =        "Volume visualization",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "165--167",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234383",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p165-kaufman/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234383.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer graphics; methodology and techniques. {\bf
                 i.6.8}: computing methodologies; performance;
                 simulation and modeling; theory; types of simulation;
                 visual.; {\bf i.3.6}: computing methodologies",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques. {\bf I.6.8}:
                 Computing Methodologies, SIMULATION AND MODELING, Types
                 of Simulation, Visual.",
}

@Article{Grudin:1996:OCD,
  author =       "Jonathan Grudin",
  title =        "The organizational contexts of development and use",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "169--171",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234384",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p169-grudin/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234384.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; group and organization interfaces;
                 humanfactors; information interfaces and presentation;
                 models and principles; organizational design. {\bf
                 h.1.2}: information systems; theory; user/machine
                 systems.; {\bf h.5.3}: information systems",
  subject =      "{\bf H.5.3}: Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, Group and Organization
                 Interfaces, Organizational design. {\bf H.1.2}:
                 Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems.",
}

@Article{Dzida:1996:IUS,
  author =       "Wolfgang Dzida",
  title =        "International usability standards",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "173--175",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234386",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p173-dzida/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234386.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "humanfactors; information interfaces and presentation;
                 standardization; user interfaces.; {\bf h.5.2}:
                 information systems",
  subject =      "{\bf H.5.2}: Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, User Interfaces.",
}

@Article{Jacob:1996:HCI,
  author =       "Robert J. K. Jacob",
  title =        "Human-computer interaction: input devices",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "177--179",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234387",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p177-jacob/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234387.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "humanfactors; information interfaces and presentation;
                 input devices and strategies.; theory; user interfaces;
                 {\bf h.5.2}: information systems",
  subject =      "{\bf H.5.2}: Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, User Interfaces, Input
                 devices and strategies.",
}

@Article{Ware:1996:MOD,
  author =       "Colin Ware",
  title =        "Multimedia output devices and techniques",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "181--183",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234389",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p181-ware/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234389.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer graphics; documentation; hardware
                 architecture; humanfactors; methodology and techniques.
                 {\bf i.3.1}: computing methodologies; vector display
                 devices.; {\bf i.3.6}: computing methodologies",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques. {\bf I.3.1}:
                 Computing Methodologies, COMPUTER GRAPHICS, Hardware
                 architecture, Vector display devices.",
}

@Article{Ziegler:1996:IT,
  author =       "J{\"u}rgen Ziegler",
  title =        "Interactive techniques",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "185--187",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234392",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p185-ziegler/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234392.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; humanfactors; information interfaces and
                 presentation; interaction styles.; theory; user
                 interfaces; {\bf h.5.2}: information systems",
  subject =      "{\bf H.5.2}: Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, User Interfaces,
                 Interaction styles.",
}

@Article{Myers:1996:UIS,
  author =       "Brad A. Myers",
  title =        "User interface software technology",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "189--191",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234394",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p189-myers/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234394.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; humanfactors; information interfaces and
                 presentation; software engineering; theory; tools and
                 techniques; user interfaces; user interfaces. {\bf
                 h.5.2}: information systems; windowing systems.; {\bf
                 d.2.2}: software",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, User interfaces. {\bf H.5.2}: Information
                 Systems, INFORMATION INTERFACES AND PRESENTATION, User
                 Interfaces, Windowing systems.",
}

@Article{Rosson:1996:HFP,
  author =       "Mary Beth Rosson",
  title =        "Human factors in programming and software
                 development",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "193--195",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234396",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p193-rosson/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234396.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; human factors.; humanfactors; models and
                 principles; theory; user/machine systems; {\bf h.1.2}:
                 information systems",
  subject =      "{\bf H.1.2}: Information Systems, MODELS AND
                 PRINCIPLES, User/Machine Systems, Human factors.",
}

@Article{Selber:1996:OSS,
  author =       "Stuart A. Selber and Johndan Johnson-Eilola and Brad
                 Mehlenbacher",
  title =        "Online support systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "197--200",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234397",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p197-selber/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234397.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "evaluation/methodology.; humanfactors; information
                 interfaces and presentation; information storage and
                 retrieval; multimedia information systems; online
                 information services. {\bf h.5.1}: information systems;
                 reliability; theory; {\bf h.3.5}: information systems",
  subject =      "{\bf H.3.5}: Information Systems, INFORMATION STORAGE
                 AND RETRIEVAL, Online Information Services. {\bf
                 H.5.1}: Information Systems, INFORMATION INTERFACES AND
                 PRESENTATION, Multimedia Information Systems,
                 Evaluation/methodology.",
}

@Article{Finkel:1996:OS,
  author =       "Raphel A. Finkel",
  title =        "Operating systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "201--203",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234399",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p201-finkel/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234399.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "general.; management; operating systems; theory; {\bf
                 d.4.0}: software",
  subject =      "{\bf D.4.0}: Software, OPERATING SYSTEMS, General.",
}

@Article{Stankovic:1996:RTE,
  author =       "John A. Stankovic",
  title =        "Real-time and embedded systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "205--208",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234400",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p205-stankovic/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234400.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; management; operating systems; organization
                 and design; real-time and embedded systems.; {\bf
                 d.4.7}: software",
  subject =      "{\bf D.4.7}: Software, OPERATING SYSTEMS, Organization
                 and Design, Real-time and embedded systems.",
}

@Article{Wills:1996:PSI,
  author =       "Craig E. Wills",
  title =        "Process synchronization and {IPC}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "209--211",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234401",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p209-wills/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234401.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "management; operating systems; process management;
                 synchronization.; theory; {\bf d.4.1}: software",
  subject =      "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process
                 Management, Synchronization.",
}

@Article{Denning:1996:VM,
  author =       "Peter J. Denning",
  title =        "Virtual memory",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "213--216",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234403",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p213-denning/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234403.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; management; operating systems; storage
                 management; theory; virtual memory.; {\bf d.4.2}:
                 software",
  subject =      "{\bf D.4.2}: Software, OPERATING SYSTEMS, Storage
                 Management, Virtual memory.",
}

@Article{McKusick:1996:SSF,
  author =       "Marshall Kirk McKusick",
  title =        "Secondary storage and filesystems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "217--219",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234404",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p217-mckusick/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234404.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "file systems management.; management; operating
                 systems; secondary storage. {\bf d.4.3}: software;
                 storage management; theory; {\bf d.4.2}: software",
  subject =      "{\bf D.4.2}: Software, OPERATING SYSTEMS, Storage
                 Management, Secondary storage. {\bf D.4.3}: Software,
                 OPERATING SYSTEMS, File Systems Management.",
}

@Article{Stallings:1996:AHS,
  author =       "William Stallings",
  title =        "Advances in high-speed networking",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "221--223",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234406",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p221-stallings/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234406.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "communications management.; management; operating
                 systems; theory; {\bf d.4.4}: software",
  subject =      "{\bf D.4.4}: Software, OPERATING SYSTEMS,
                 Communications Management.",
}

@Article{Mullender:1996:DOS,
  author =       "Sape J. Mullender",
  title =        "Distributed operating systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "225--227",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234407",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p225-mullender/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234407.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "distributed file systems.; file systems management;
                 management; operating systems; theory; {\bf d.4.3}:
                 software",
  subject =      "{\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems
                 Management, Distributed file systems.",
}

@Article{Doeppner:1996:DFS,
  author =       "Thomas W. {Doeppner, Jr.}",
  title =        "Distributed file systems and distributed memory",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "229--231",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234409",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p229-doeppner/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234409.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "distributed file systems. {\bf d.4.2}: software;
                 distributed memories.; file systems management;
                 humanfactors; management; operating systems; storage
                 management; theory; {\bf d.4.3}: software",
  subject =      "{\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems
                 Management, Distributed file systems. {\bf D.4.2}:
                 Software, OPERATING SYSTEMS, Storage Management,
                 Distributed memories.",
}

@Article{Chapin:1996:DMS,
  author =       "Steve J. Chapin",
  title =        "Distributed and multiprocessor scheduling",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "233--235",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234410",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p233-chapin/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234410.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "management; operating systems; organization and
                 design.; process management; scheduling. {\bf d.4.7}:
                 software; theory; {\bf d.4.1}: software",
  subject =      "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process
                 Management, Scheduling. {\bf D.4.7}: Software,
                 OPERATING SYSTEMS, Organization and Design.",
}

@Article{Siegel:1996:SSH,
  author =       "Howard Jay Siegel and Henry G. Dietz and John K.
                 Antonio",
  title =        "Software support for heterogeneous computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "237--239",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234411",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p237-siegel/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234411.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; general.; management; operating systems;
                 systems programs and utilities. {\bf d.4.0}: software;
                 theory; {\bf d.4.9}: software",
  subject =      "{\bf D.4.9}: Software, OPERATING SYSTEMS, Systems
                 Programs and Utilities. {\bf D.4.0}: Software,
                 OPERATING SYSTEMS, General.",
}

@Article{Sandhu:1996:AAC,
  author =       "Ravi Sandhu and Pierangela Samarati",
  title =        "Authentication, access control, and audit",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "241--243",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234412",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p241-sandhu/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234412.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "access controls.; authentication. {\bf d.4.6}:
                 software; design; management; operating systems;
                 security and protection; theory; {\bf d.4.6}:
                 software",
  subject =      "{\bf D.4.6}: Software, OPERATING SYSTEMS, Security and
                 Protection, Authentication. {\bf D.4.6}: Software,
                 OPERATING SYSTEMS, Security and Protection, Access
                 controls.",
}

@Article{Bruce:1996:PPL,
  author =       "Kim B. Bruce",
  title =        "Progress in programming languages",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "245--247",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234413",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p245-bruce/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234413.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "general. {\bf d.1.6}: software; languages; logic
                 programming.; programming languages; programming
                 techniques; theory; {\bf d.3.0}: software",
  subject =      "{\bf D.3.0}: Software, PROGRAMMING LANGUAGES, General.
                 {\bf D.1.6}: Software, PROGRAMMING TECHNIQUES, Logic
                 Programming.",
}

@Article{Goldberg:1996:FPL,
  author =       "Benjamin Goldberg",
  title =        "Functional programming languages",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "249--251",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234414",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p249-goldberg/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234414.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "applicative (functional) programming. {\bf f.4.1}:
                 theory of computation; languages; mathematical logic
                 and formal languages; mathematical logic.; programming
                 techniques; theory; {\bf d.1.1}: software",
  subject =      "{\bf D.1.1}: Software, PROGRAMMING TECHNIQUES,
                 Applicative (Functional) Programming. {\bf F.4.1}:
                 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Mathematical Logic.",
}

@Article{Hirshfield:1996:OOP,
  author =       "Stuart Hirshfield and Raimund K. Ege",
  title =        "Object-oriented programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "253--255",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234415",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p253-hirshfield/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234415.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "languages; object-oriented programming.; programming
                 techniques; theory; {\bf d.1.5}: software",
  subject =      "{\bf D.1.5}: Software, PROGRAMMING TECHNIQUES,
                 Object-oriented Programming.",
}

@Article{Cohen:1996:LPC,
  author =       "Jacques Cohen",
  title =        "Logic programming and constraint logic programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "257--259",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234416",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p257-cohen/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234416.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "languages; logic programming.; logic programming. {\bf
                 f.4.1}: theory of computation; mathematical logic;
                 mathematical logic and formal languages; programming
                 techniques; theory; {\bf d.1.6}: software",
  subject =      "{\bf D.1.6}: Software, PROGRAMMING TECHNIQUES, Logic
                 Programming. {\bf F.4.1}: Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Logic programming.",
}

@Article{Wolfe:1996:PC,
  author =       "Michael Wolfe",
  title =        "Parallelizing compilers",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "261--262",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234417",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p261-wolfe/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234417.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "compilers. {\bf d.1.5}: software; languages;
                 object-oriented programming.; processors; programming
                 languages; programming techniques; theory; {\bf d.3.4}:
                 software",
  subject =      "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
                 Processors, Compilers. {\bf D.1.5}: Software,
                 PROGRAMMING TECHNIQUES, Object-oriented Programming.",
}

@Article{Cardelli:1996:TS,
  author =       "Luca Cardelli",
  title =        "Type systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "263--264",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234418",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p263-cardelli/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234418.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "languages; logics and meanings of programs; studies of
                 program constructs; theory; type structure.; {\bf
                 f.3.3}: theory of computation",
  subject =      "{\bf F.3.3}: Theory of Computation, LOGICS AND
                 MEANINGS OF PROGRAMS, Studies of Program Constructs,
                 Type structure.",
}

@Article{Schmidt:1996:PLS,
  author =       "David A. Schmidt",
  title =        "Programming language semantics",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "265--267",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234419",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p265-schmidt/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234419.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "formal definitions and theory. {\bf f.3.2}: theory of
                 computation; languages; logics and meanings of
                 programs; programming languages; semantics of
                 programming languages.; theory; {\bf d.3.1}: software",
  subject =      "{\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal
                 Definitions and Theory. {\bf F.3.2}: Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages.",
}

@Article{Sommerville:1996:SPM,
  author =       "Ian Sommerville",
  title =        "Software process models",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "269--271",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234420",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p269-sommerville/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234420.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "languages; management; management.; software
                 engineering; theory; {\bf d.2.9}: software",
  subject =      "{\bf D.2.9}: Software, SOFTWARE ENGINEERING,
                 Management.",
}

@Article{Holland:1996:OOD,
  author =       "Ian M. Holland and Karl J. Lieberherr",
  title =        "Object-oriented design",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "273--275",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234421",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p273-holland/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234421.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "languages; software engineering; theory; tools and
                 techniques.; {\bf d.2.2}: software",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques.",
}

@Article{Schach:1996:TPP,
  author =       "Stephen R. Schach",
  title =        "Testing: principles and practice",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "277--279",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234422",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p277-schach/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234422.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "languages; software engineering; testing and
                 debugging.; theory; verification; {\bf d.2.5}:
                 software",
  subject =      "{\bf D.2.5}: Software, SOFTWARE ENGINEERING, Testing
                 and Debugging.",
}

@Article{Reiss:1996:STE,
  author =       "Steven P. Reiss",
  title =        "Software tools and environments",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "281--284",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234423",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p281-reiss/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234423.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "languages; programming environments.; reliability;
                 software engineering; tools and techniques. {\bf
                 d.2.6}: software; {\bf d.2.2}: software",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques. {\bf D.2.6}: Software, SOFTWARE
                 ENGINEERING, Programming Environments.",
}

@Article{Wegner:1996:I,
  author =       "Peter Wegner",
  title =        "Interoperability",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "1",
  pages =        "285--287",
  month =        mar,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234313.234424",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:50:59 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p285-wegner/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234424.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data types and structures. {\bf f.3.3}: theory of
                 computation; language constructs and features;
                 languages; logics and meanings of programs; programming
                 languages; studies of program constructs; theory; type
                 structure.; {\bf d.3.3}: software",
  subject =      "{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Data types and structures.
                 {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Studies of Program Constructs, Type
                 structure.",
}

@Article{Hankin:1996:CSS,
  author =       "Chris Hankin and Hanne Riis Nielson",
  title =        "{Computing Surveys Symposium on Models of Programming
                 Languages and Computation}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "293--294",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234729",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p293-hankin/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234729.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Agha:1996:LPP,
  author =       "Gul A. Agha",
  title =        "Linguistic Paradigms for Programming Complex
                 Distributed Systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "295--296",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234730",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p295-agha/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234730.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Andreoli:1996:ICP,
  author =       "Jean-Marc Andreoli and Remo Pareschi",
  title =        "Integrated Computational Paradigms for Flexible
                 Client-Server Communication",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "297--299",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234731",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p297-andreoli/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234731.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ciancarini:1996:CML,
  author =       "Paolo Ciancarini",
  title =        "Coordination Models and Languages as Software
                 Integrators",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "300--302",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234732",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p300-ciancarini/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234732.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gilbert:1996:CCL,
  author =       "David Gilbert",
  title =        "Can Computational Logic Provide a Paradigm for Both
                 the Specification and Implementation of Concurrent
                 Systems?",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "303--305",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234733",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p303-gilbert/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234733.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hanus:1996:IFL,
  author =       "Michael Hanus and Herbert Kuchen",
  title =        "Integration of Functional and Logic Programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "306--308",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234734",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p306-hanus/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234734.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mycroft:1996:IPP,
  author =       "Alan Mycroft",
  title =        "On Integration of Programming Paradigms",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "309--311",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234735",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p309-mycroft/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234735.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Reddy:1996:IFP,
  author =       "U. S. Reddy",
  title =        "Imperative Functional Programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "312--314",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234736",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p312-reddy/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234736.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Volpano:1996:SDW,
  author =       "Dennis Volpano and Geoffrey Smith",
  title =        "On the Systematic Design of {Web} Languages",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "315--317",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234737",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p315-volpano/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234737.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wadler:1996:LVS,
  author =       "Philip Wadler",
  title =        "Lazy Versus Strict",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "318--320",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234738",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p318-wadler/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234738.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Benton:1996:RBF,
  author =       "P. N. Benton",
  title =        "On the Relationship Between Formal Semantics and
                 Static Analysis",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "321--323",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234739",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p321-benton/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234739.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cousot:1996:AI,
  author =       "Patrick Cousot",
  title =        "Abstract Interpretation",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "324--328",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234740",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p324-cousot/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234740.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Danvy:1996:RBP,
  author =       "Olivier Danvy and Nevin Hentze and Karoline
                 Malmkj{\ae}r",
  title =        "Resource-bounded partial evaluation",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "329--332",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234741",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p329-danvy/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234741.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{File:1996:UVA,
  author =       "Gilberto Fil{\'e} and Roberto Giacobazzi and Francesco
                 Ranzato",
  title =        "A Unifying View of Abstract Domain Design",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "333--336",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234742",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p333-file/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234742.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jagannathan:1996:CFL,
  author =       "Suresh Jagannathan and Andrew Wright",
  title =        "Compiling Functional Languages with Flow Analysis",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "337--339",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234743",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p337-jagannathan/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234743.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{LeMetayer:1996:SOS,
  author =       "Daniel {Le M{\'e}tayer} and David Schmidt",
  title =        "Structural Operational Semantics as a Basis for Static
                 Program Analysis",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "340--343",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234744",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p340-le_metayer/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234744.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nielson:1996:ATE,
  author =       "Flemming Nielson",
  title =        "Annotated Type and Effect Systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "344--345",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234745",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p344-nielson/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234745.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dam:1996:MAV,
  author =       "Mads Dam",
  title =        "Modalities in Analysis and Verification",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "346--348",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234746",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p346-dam/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234746.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cartwright:1996:PVT,
  author =       "Robert Cartwright and Matthias Felleisen",
  title =        "Program Verification Through Soft Typing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "349--351",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234747",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p349-cartwright/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234747.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Degano:1996:EOS,
  author =       "Pierpaolo Degano and Corrado Priami",
  title =        "Enhanced Operational Semantics",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "352--354",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234748",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p352-degano/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234748.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jay:1996:SC,
  author =       "C. Barry Jay",
  title =        "Shape in Computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "355--357",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234749",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p355-jay/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234749.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Palsberg:1996:TIO,
  author =       "Jens Palsberg",
  title =        "Type Inference for Objects",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "358--359",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234750",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p358-palsberg/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234750.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pettorossi:1996:RST,
  author =       "Alberto Pettorossi and Maurizio Proietti",
  title =        "Rules and Strategies for Transforming Functional and
                 Logic Programs",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "360--414",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234529",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p360-pettorossi/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234529.html",
  abstract =     "We present an overview of the program transformation
                 methodology, focusing our attention on the so-called
                 ``rules + strategies'' approach in the case of
                 functional and logic programs. The paper is intended to
                 offer an introduction to the subject. The various
                 techniques we present are illustrated via simple
                 examples.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; analysis of algorithms and problem
                 complexity; applicative (functional) programming. {\bf
                 d.1.2}: software; artificial intelligence; automatic
                 programming; automatic programming. {\bf d.1.6}:
                 software; correctness proofs. {\bf d.2.5}: software;
                 deduction and theorem proving; design; documentation;
                 general. {\bf f.3.2}: theory of computation; logic
                 programming.; logic programming. {\bf d.2.4}: software;
                 logics and meanings of programs; methodologies. {\bf
                 d.3.4}: software; optimization. {\bf f.2.0}: theory of
                 computation; processors; program derivation; program
                 improvement; program transformation. {\bf i.2.3}:
                 computing methodologies; program verification;
                 programming languages; programming techniques;
                 semantics of programming languages. {\bf i.2.2}:
                 computing methodologies; software engineering;
                 specifying and verifying and reasoning about programs.
                 {\bf d.1.1}: software; symbolic execution. {\bf
                 d.2.10}: software; testing and debugging; theory;
                 transformation rules; transformation strategies;
                 verification; {\bf f.3.1}: theory of computation",
  subject =      "{\bf F.3.1}: Theory of Computation, LOGICS AND
                 MEANINGS OF PROGRAMS, Specifying and Verifying and
                 Reasoning about Programs, Logics of programs. {\bf
                 D.1.1}: Software, PROGRAMMING TECHNIQUES, Applicative
                 (Functional) Programming. {\bf D.1.2}: Software,
                 PROGRAMMING TECHNIQUES, Automatic Programming. {\bf
                 D.1.6}: Software, PROGRAMMING TECHNIQUES, Logic
                 Programming. {\bf D.2.4}: Software, SOFTWARE
                 ENGINEERING, Program Verification, Correctness proofs.
                 {\bf D.2.5}: Software, SOFTWARE ENGINEERING, Testing
                 and Debugging, Symbolic execution. {\bf D.2.10}:
                 Software, SOFTWARE ENGINEERING, Design, Methodologies.
                 {\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
                 Processors, Optimization. {\bf F.2.0}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, General. {\bf F.3.2}: Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages. {\bf I.2.2}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Automatic
                 Programming, Program transformation. {\bf I.2.3}:
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Deduction and Theorem Proving, Logic programming.",
}

@Article{Frakes:1996:SRM,
  author =       "William Frakes and Carol Terry",
  title =        "Software Reuse: Metrics and Models",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "2",
  pages =        "415--435",
  month =        jun,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/234528.234531",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:53:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-2/p415-frakes/;
                 http://www.acm.org/pubs/toc/Abstracts/surveys/234531.html",
  abstract =     "As organizations implement systematic software reuse
                 programs to improve productivity and quality, they must
                 be able to measure their progress and identify the most
                 effective reuse strategies. This is done with reuse
                 metrics and models. In this article we survey metrics
                 and models of software reuse and reusability, and
                 provide a classification structure that will help users
                 select them. Six types of metrics and models are
                 reviewed: cost-benefit models, maturity assessment
                 models, amount of reuse metrics, failure modes models,
                 reusability assessment models, and reuse library
                 metrics.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "cost-benefit analysis; definitions; economics;
                 economics. {\bf k.6.4}: computing milieux; general;
                 management of computing and information systems;
                 maturity assessment; measurement; metrics. {\bf d.2.m}:
                 software; miscellaneous; models; object-oriented;
                 performance; productivity; quality; quality assurance.;
                 reusability; reusability assessment; reusable software.
                 {\bf k.6.0}: computing milieux; reuse; reuse level;
                 reuse library metrics; software; software engineering;
                 software reuse failure modes model; system management;
                 {\bf d.2.8}: software",
  subject =      "{\bf D.2.8}: Software, SOFTWARE ENGINEERING, Metrics.
                 {\bf D.2.m}: Software, SOFTWARE ENGINEERING,
                 Miscellaneous, Reusable software. {\bf K.6.0}:
                 Computing Milieux, MANAGEMENT OF COMPUTING AND
                 INFORMATION SYSTEMS, General, Economics. {\bf K.6.4}:
                 Computing Milieux, MANAGEMENT OF COMPUTING AND
                 INFORMATION SYSTEMS, System Management, Quality
                 assurance.",
}

@Article{Taivalsaari:1996:NI,
  author =       "Antero Taivalsaari",
  title =        "On the Notion of Inheritance",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "3",
  pages =        "438--479",
  month =        sep,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/243439.243441",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:32 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-3/p438-taivalsaari/",
  abstract =     "One of the most intriguing---and at the same time most
                 problematic---notions in object-oriented programming is
                 {\em inheritance}. Inheritance is commonly regarded as
                 the feature that distinguishes object-oriented
                 programming from other modern programming paradigms,
                 but researchers rarely agree on its meaning and usage.
                 Yet inheritance of often hailed as a solution to many
                 problems hampering software development, and many of
                 the alleged benefits of object-oriented programming,
                 such as improved conceptual modeling and reusability,
                 are largely credited to it. This article aims at a
                 comprehensive understanding of inheritance, examining
                 its usage, surveying its varieties, and presenting a
                 simple taxonomy of mechanisms that can be seen as
                 underlying different inheritance models.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "delegation; incremental modification; inheritance;
                 language classifications; language constructs; language
                 constructs and features.; object-oriented languages.
                 {\bf d.3.3}: software; object-oriented programming;
                 object-oriented programming. {\bf d.3.2}: software;
                 programming languages; programming techniques; {\bf
                 d.1.5}: software",
  subject =      "{\bf D.1.5}: Software, PROGRAMMING TECHNIQUES,
                 Object-oriented Programming. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications,
                 Object-oriented languages. {\bf D.3.3}: Software,
                 PROGRAMMING LANGUAGES, Language Constructs and
                 Features.",
}

@Article{Jones:1996:IPE,
  author =       "Neil D. Jones",
  title =        "An Introduction to Partial Evaluation",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "3",
  pages =        "480--503",
  month =        sep,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/243439.243447",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:32 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-3/p480-jones/",
  abstract =     "Partial evaluation provides a unifying paradigm for a
                 broad spectrum of work in program optimization
                 compiling interpretation and the generation of
                 automatic program generators [Bj{\o}rner et al. 1987;
                 Ershov 1992; and Jones et al. 1993]. It is a program
                 optimization technique, perhaps better called {\em
                 program specialization}, closely related to but
                 different from J{\o}rring and Scherlis' {\em staging
                 transformations\/} [1986]. It emphasizes, in comparison
                 with Burstall and Darlington [1977] and J{\o}rring and
                 Scherlis [1986] and other program transformation work,
                 {\em full automation\/} and the generation of {\em
                 program generators\/} as well as transforming single
                 programs. Much partial evaluation work to date has
                 concerned automatic compiler generation from an
                 interpretive definition of programming language, but it
                 also has important applications to scientific
                 computing, logic programming, metaprogramming, and
                 expert systems; some pointers are given later.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "compiler generators; compilers; interpreters;
                 miscellaneous; partial evaluation; processors.; program
                 specialization; programming languages; rapid
                 prototyping. {\bf d.3.4}: software; software
                 engineering; {\bf d.2.m}: software",
  subject =      "{\bf D.2.m}: Software, SOFTWARE ENGINEERING,
                 Miscellaneous, Rapid prototyping. {\bf D.3.4}:
                 Software, PROGRAMMING LANGUAGES, Processors.",
}

@Article{Gallian:1996:EDM,
  author =       "Joseph A. Gallian",
  title =        "Error Detection Methods",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "3",
  pages =        "504--517",
  month =        sep,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/243439.243457",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:32 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-3/p504-gallian/",
  abstract =     "The use of check digits with identification numbers
                 for error detection is now standard practice. Notable
                 exceptions such as social security numbers, telephone
                 numbers and serial numbers on currency predate
                 computers. Despite their ubiquity and utility, few
                 people are knowledgeable about the myriad of check
                 digit schemes in use by businesses. In this article we
                 survey many of these schemes. Among them are three that
                 have not been described in journal articles
                 previously.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "codes",
  subject =      "{\bf A.1}: General Literature, INTRODUCTORY AND
                 SURVEY. {\bf E.4}: Data, CODING AND INFORMATION THEORY,
                 Error control codes. {\bf G.2}: Mathematics of
                 Computing, DISCRETE MATHEMATICS.",
}

@Article{Soderquist:1996:APT,
  author =       "Peter Soderquist and Miriam Leeser",
  title =        "Area and Performance Tradeoffs in Floating-Point
                 Divide and Square-Root Implementations",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "3",
  pages =        "518--564",
  month =        sep,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/243439.243481",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:32 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-3/p518-soderquist/",
  abstract =     "Floating-point divide and square-root operations are
                 essential to many scientific and engineering
                 applications, and are required in all computer systems
                 that support the IEEE floating-point standard. Yet many
                 current microprocessors provide only weak support for
                 these operations. The latency and throughput of
                 division are typically far inferior to those of
                 floating-point addition and multiplication, and
                 square-root performance is often even lower. This
                 article argues the case for high-performance division
                 and square root. It also explains the algorithms and
                 implementations of the primary techniques, subtractive
                 and multiplicative methods, employed in microprocessor
                 floating-point units with their associated
                 area/performance tradeoffs. Case studies of
                 representative floating-point unit configurations are
                 presented, supported by simulation results using a
                 carefully selected benchmark, Givens rotation, to show
                 the dynamic performance impact of the various
                 implementation alternatives. The topology of the
                 implementation is found to be an important performance
                 factor. Multiplicative algorithms, such as the
                 Newton--Raphson method and Goldschmidt's algorithm, can
                 achieve low latencies. However, these implementations
                 serialize multiply, divide, and square root operations
                 through a single pipeline, which can lead to low
                 throughput. While this hardware sharing yields low size
                 requirements for baseline implementations,
                 lower-latency versions require many times more area.
                 For these reasons, multiplicative implementations are
                 best suited to cases where subtractive methods are
                 precluded by area constraints, and modest performance
                 on divide and square root operations is tolerable.
                 Subtractive algorithms, exemplified by radix-4 SRT and
                 radix-16 SRT, can be made to execute in parallel with
                 other floating-point operations.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "area and performance tradeoffs; arithmetic and logic
                 structures; computer arithmetic.; computer system
                 implementation; design studies. {\bf c.5.3}: computer
                 systems organization; design styles; division;
                 floating-point; FPU; general; microcomputers;
                 microprocessors. {\bf g.1.0}: mathematics of computing;
                 numerical analysis; parallel. {\bf c.4}: computer
                 systems organization; performance of systems; square
                 root; SRT; {\bf b.2.1}: hardware",
  subject =      "{\bf B.2.1}: Hardware, ARITHMETIC AND LOGIC
                 STRUCTURES, Design Styles, Parallel. {\bf C.4}:
                 Computer Systems Organization, PERFORMANCE OF SYSTEMS,
                 Design studies. {\bf C.5.3}: Computer Systems
                 Organization, COMPUTER SYSTEM IMPLEMENTATION,
                 Microcomputers, Microprocessors. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Computer arithmetic.",
}

@Article{Wegner:1996:ESD,
  author =       "Peter Wegner and Jon Doyle",
  title =        "Editorial: {Strategic} directions in computing
                 research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "565--574",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242227",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p565-wegner/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Anonymous:1996:AAI,
  author =       "Anonymous",
  title =        "{ACM} 50th Anniversary Issue --- Strategic Directions
                 in Computing Research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "565--845",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 26 15:49:24 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Loui:1996:SDR,
  author =       "Michael C. Loui and Anne Condon and Faith Fich and
                 Greg N. Frederickson and Andrew V. Goldberg and David
                 S. Johnson and Steven Mahney and Prabhakar Raghavan and
                 John Savage and Alan L. Selman and David B. Shmoys",
  title =        "Strategic directions in research in theory of
                 computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "575--590",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242240",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p575-loui/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tamassia:1996:SDC,
  author =       "Roberto Tamassia and Pankaj K. Agarwal and Nancy Amato
                 and Danny Z. Chen and David Dobkin and Scot Drysdale
                 and Steven Fortune and Michael T. Goodrich and John
                 Hershberger and Joseph O'Rourke and Franco P. Preparata
                 and Joerg-Rudiger Sack and Subhash Suri and Ioannis
                 Tollis and Jeffrey S. Vitter and Sue Whitesides",
  title =        "Strategic directions in computational geometry",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "591--606",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242248",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p591-tamassia/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cleaveland:1996:SDC,
  author =       "Rance Cleaveland and Scott A. Smolka and Rajeev Alur
                 and Jos Baeten and Jan A. Bergstra and Eike Best and
                 Rocco {De Nicola} and Helen Gill and Roberto Gorrieri
                 and Mohamed G. Gouda and Jan Friso Groote and Tom A.
                 Henzinger and C. A. R. Hoare and Maj. David Luginbuhl
                 and Albert Meyer and Dale Miller and Jayadev Misra and
                 Faron Moller and Ugo Montanari and Amir Pnueli and
                 Sanjiva Prasad and Vaughan R. Pratt and Joseph Sifakis
                 and Bernhard Steffen and Bent Thomsen and Frits
                 Vaandrager and Moshe Vardi and Pierre Wolper",
  title =        "Strategic directions in concurrency research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "607--625",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242252",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p607-cleaveland/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Clarke:1996:FMS,
  author =       "Edmund M. Clarke and Jeannette M. Wing and Rajeev Alur
                 and Rance Cleaveland and David Dill and Allen Emerson
                 and Stephen Garland and Steven German and John Guttag
                 and Anthony Hall and Thomas Henzinger and Gerard
                 Holzmann and Cliff Jones and Robert Kurshan and Nancy
                 Leveson and Kenneth McMillan and J. Moore and Doron
                 Peled and Amir Pnueli and John Rushby and Natarajan
                 Shankar and Joseph Sifakis and Prasad Sistla and
                 Bernhard Steffen and Pierre Wolper and Jim Woodcock and
                 Pamela Zave",
  title =        "Formal methods: state of the art and future
                 directions",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "626--643",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242257",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p626-clarke/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hankin:1996:SDR,
  author =       "Chris Hankin and Hanne Riis Nielson and Jens Palsberg
                 and others",
  title =        "Strategic directions in research on programming
                 languages",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "644--652",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242260",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p644-hankin/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  remark =       "A footnote on the cover page credits several dozen
                 others.",
}

@Article{Doyle:1996:SDA,
  author =       "Jon Doyle and Thomas Dean and others",
  title =        "Strategic directions in artificial intelligence",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "653--670",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242268",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p653-doyle/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mudge:1996:SDC,
  author =       "Trevor Mudge",
  title =        "Strategic directions in computer architecture",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "671--678",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242271",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p671-mudge/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Clark:1996:SDN,
  author =       "David Clark and Joseph Pasquale and others",
  title =        "Strategic directions in networks and
                 telecommunications",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "679--690",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242273",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p679-clark/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Guerraoui:1996:SDO,
  author =       "Rachid Guerraoui and others",
  title =        "Strategic directions in object-oriented programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "691--700",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242275",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p691-guerraoui/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{VanHentenryck:1996:SDC,
  author =       "Pascal {Van Hentenryck} and Vijay Saraswat and
                 others",
  title =        "Strategic directions in constraint programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "701--726",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242279",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p701-van_hentenryck/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gunter:1996:SDS,
  author =       "Carl Gunter and John Mitchell and David Notkin",
  title =        "Strategic directions in software engineering and
                 programming languages",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "727--737",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242283",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p727-gunter/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Osterweil:1996:SDS,
  author =       "Leon Osterweil and others",
  title =        "Strategic directions in software quality",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "738--750",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242288",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p738-osterweil/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Stankovic:1996:SDR,
  author =       "John A. Stankovic and others",
  title =        "Strategic directions in real-time and embedded
                 systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "751--763",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242291",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p751-stankovic/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Silberschatz:1996:SDD,
  author =       "Avi Silberschatz and Stan Zdonik and others",
  title =        "Strategic directions in database systems --- breaking
                 out of the box",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "764--778",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242295",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p764-silberschatz/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gibson:1996:SDS,
  author =       "Garth A. Gibson and Jeffrey Scott Vitter and John
                 Wilkes and others",
  title =        "Strategic directions in storage {I/O} issues in
                 large-scale computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "779--793",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242300",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p779-gibson/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Myers:1996:SDH,
  author =       "Brad Myers and Jim Hollan and Isabel Cruz and Steve
                 Bryson and Dick Bulterman and Tiziana Catarci and Wayne
                 Citrin and Ephraim Glinert and Jonathan Grudin and Rob
                 Jacob and Bonnie John and David Kurlander and Dan Olsen
                 and Randy Pausch and Stuart Shieber and Ben Shneiderman
                 and John Stasko and Gary Strong and Kent Wittenburg",
  title =        "Strategic directions in human-computer interaction",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "794--809",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.246855",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p794-myers/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sameh:1996:CSE,
  author =       "A. Sameh and G. Cybenko and M. Kalos and K. Neves and
                 J. Rice and D. Sorensen and F. Sullivan",
  title =        "Computational science and engineering",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "810--817",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.246865",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p810-sameh/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Adam:1996:SDE,
  author =       "Nabil Adam and Yelena Yesha and others",
  title =        "Strategic directions in electronic commerce and
                 digital libraries: towards a digital agora",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "818--835",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.246871",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p818-adam/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tucker:1996:SDC,
  author =       "Allen B. Tucker and others",
  title =        "Strategic directions in computer science education",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "836--845",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.246876",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p836-tucker/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Anonymous:1996:AIV,
  author =       "Anonymous",
  title =        "Author Index: Vols. 24--28 (1992--1996)",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "846--854",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 26 15:49:24 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Anonymous:1996:SIV,
  author =       "Anonymous",
  title =        "Subject Index: Vols. 24--28 (1992--1996)",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "854--859",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 26 15:49:24 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

%%% ====================================================================
%%% Volume 28, number 4es, is an electronic supplement that is published
%%% online at the indicated URLs; the table of contents entries in
%%% number 4 lists these short articles, but the paper issue of the
%%% journal itself does not contain them.  The last article in 4es,
%%% labeled Harper:1996:MB below, does not appear in the table of
%%% contents.
%%% ====================================================================
@Article{Brachman:1996:UBU,
  author =       "Ronald J. Brachman and Hector J. Levesque",
  title =        "Undirected behavior without unbounded search",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "1:1--1:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242227",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a1-brachman/",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dean:1996:ITP,
  author =       "Thomas L. Dean",
  title =        "Integrating theory and practice in planning",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "2:1--2:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242240",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a2-dean/",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dietterich:1996:ML,
  author =       "Tom Dietterich",
  title =        "Machine learning",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "3:1--3:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242248",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a3-dietterich/",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Doyle:1996:CAI,
  author =       "Jon Doyle",
  title =        "Cleaving (unto) artificial intelligence",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "4:1--4:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242252",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a4-doyle/",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Green:1996:FHS,
  author =       "Cordell Green",
  title =        "Formality helps scalability and robustness",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "5:1--5:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242257",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a5-green/",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Grosz:1996:IIA,
  author =       "Barbara J. Grosz",
  title =        "The importance of integration for {AI}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "6:1--6:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242260",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a6-grosz/",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Horswill:1996:ISN,
  author =       "Ian Horswill",
  title =        "Integrated systems and naturalistic tasks",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "7:1--7:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242268",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a7-horswill/",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Koller:1996:SRI,
  author =       "Daphne Koller",
  title =        "Structured representations and intractability",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "8:1--8:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242271",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a8-koller/",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pereira:1996:LCA,
  author =       "Fernando Pereira",
  title =        "Language, computation and artificial intelligence",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "9:1--9:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242273",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a9-pereira/",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Selman:1996:CCA,
  author =       "Bart Selman",
  title =        "Computational challenges in artificial intelligence",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "10:1--10:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242275",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a10-selman/",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shoham:1996:OSB,
  author =       "Yoav Shoham",
  title =        "The open scientific borders of {AI}, and the case of
                 economics",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "11:1--11:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242279",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a11-shoham/",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shrobe:1996:TCD,
  author =       "Howard E. Shrobe",
  title =        "Two challenging domains",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "12:1--12:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242283",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a12-shrobe/",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Swartout:1996:FDK,
  author =       "William R. Swartout",
  title =        "Future directions in knowledge-based systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "13:1--13:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242288",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a13-swartout/",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wellman:1996:EAA,
  author =       "Michael P. Wellman",
  title =        "The economic approach to artificial intelligence",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "14:1--14:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242291",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a14-wellman/",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zilberstein:1996:RBR,
  author =       "Shlomo Zilberstein",
  title =        "Resource-bounded reasoning in intelligent systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "15:1--15:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242295",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a15-zilberstein/",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Agarwal:1996:SPG,
  author =       "Pankaj K. Agarwal and Subhash Suri",
  title =        "Simple and practical geometric algorithms",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "16:1--16:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242300",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a16-agarwal/",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Amato:1996:ECC,
  author =       "Nancy M. Amato",
  title =        "Equipping {CAD\slash CAM} systems with geometric
                 intelligence",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "17:1--17:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.246855",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a17-amato/",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chen:1996:DAS,
  author =       "Danny Z. Chen",
  title =        "Developing algorithms and software for geometric path
                 planning problems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "18:1--18:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.246865",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a18-chen/",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tollis:1996:GDI,
  author =       "Ioannis G. Tollis",
  title =        "Graph drawing and information visualization",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "19:1--19:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.246871",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a19-tollis/",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Vitter:1996:CIL,
  author =       "Jeffrey S. Vitter",
  title =        "Communication issues in large-scale geometric
                 computation",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "20:1--20:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.246876",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a20-vitter/",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cybenko:1996:LSC,
  author =       "George Cybenko",
  title =        "Large-scope computing: the industrial challenges",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "21:1--21:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242250",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a21-cybenko/",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kalos:1996:CCS,
  author =       "Melvin Kalos",
  title =        "Challenges in computational science",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "22:1--22:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242251",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a22-kalos/",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Neves:1996:TCC,
  author =       "Kenneth Neves",
  title =        "Thoughts on {CSE} candidates for industrial
                 positions",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "23:1--23:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242253",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a23-neves/",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rice:1996:CSO,
  author =       "John R. Rice",
  title =        "Computational science as one driving force for all
                 aspects of computing research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "24:1--24:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242254",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a24-rice/",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sullivan:1996:TP,
  author =       "Francis Sullivan",
  title =        "From theory to practice",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "25:1--25:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242255",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a25-sullivan/",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Conte:1996:IPC,
  author =       "Tom Conte",
  title =        "Importance of profiling and compatibility",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "26:1--26:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242256",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a26-conte/",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Emer:1996:IVR,
  author =       "Joel Emer",
  title =        "Incremental versus revolutionary research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "27:1--27:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242258",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a27-emer/",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Farrens:1996:DDC,
  author =       "Matt Farrens",
  title =        "Distributed decentralized computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "28:1--28:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242259",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a28-farrens/",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Grunwald:1996:EGP,
  author =       "Dirk Grunwald",
  title =        "Embedded, general-purpose, and high-performance
                 systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "29:1--29:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242261",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a29-grunwald/",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:1996:ASH,
  author =       "Kai Li",
  title =        "Applications, storage hierarchy, and integration",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "30:1--30:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242262",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a30-li/",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mills:1996:IPC,
  author =       "Jack Mills",
  title =        "An industrial perspective on computer architecture",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "31:1--31:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242263",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a31-mills/",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nagle:1996:SBS,
  author =       "David Nagle",
  title =        "Synergy between software and hardware",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "32:1--32:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242264",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a32-nagle/",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Patt:1996:MCA,
  author =       "Yale Patt",
  title =        "Microarchitecture, compilers and algorithms",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "33:1--33:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242265",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a33-patt/",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Smith:1996:MNA,
  author =       "Jim Smith",
  title =        "Multiscalar as a new architecture paradigm",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "34:1--34:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242266",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a34-smith/",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wang:1996:MAC,
  author =       "Wen-Hann Wang",
  title =        "Microprocessor architecture challenges --- the best is
                 yet to come!",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "35:1--35:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242267",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a35-wang/",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wood:1996:PCI,
  author =       "David Wood",
  title =        "Problems, challenges and the importance of performance
                 evaluation",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "36:1--36:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242269",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a36-wood/",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yung:1996:IPT,
  author =       "Robert Yung",
  title =        "The importance of process technology to
                 microarchitecture",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "37:1--37:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242270",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a37-yung/",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Baeten:1996:SIC,
  author =       "Jos C. M. Baeten and Jan A. Bergstra",
  title =        "Six issues concerning future directions in concurrency
                 research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "39:1--39:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242272",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a39-baeten/",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Best:1996:SMD,
  author =       "Eike Best",
  title =        "Some major dichotomies relating to future research in
                 concurrency",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "40:1--40:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242274",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a40-best/",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cleaveland:1996:STS,
  author =       "Rance Cleaveland",
  title =        "Semantic theories and system design",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "41:1--41:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242276",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a41-cleaveland/",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gorrieri:1996:PCT,
  author =       "Roberto Gorrieri",
  title =        "On the power of concurrency theory",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "42:1--42:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242277",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a42-gorrieri/",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gouda:1996:NPB,
  author =       "Mohamed G. Gouda",
  title =        "Network protocols between exact specifications and
                 pragmatic implementations",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "43:1--43:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242278",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a43-gouda/",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Groote:1996:CTW,
  author =       "Jan Friso Groote",
  title =        "Concurrency theory will set standards for description
                 and analysis of software",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "44:1--44:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242280",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a44-groote/",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hoare:1996:UTP,
  author =       "C. A. R. Hoare",
  title =        "Unifying theories: a personal statement",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "46:1--46:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242282",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a46-hoare/",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Luginbuhl:1996:ICS,
  author =       "David Luginbuhl",
  title =        "Issues in concurrent systems research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "47:1--47:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242284",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a47-luginbuhl/",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Miller:1996:LFO,
  author =       "Dale Miller",
  title =        "Logical foundations for open system design",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "48:1--48:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242285",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a48-miller/",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Misra:1996:DM,
  author =       "Jayadev Misra",
  title =        "A discipline of multiprogramming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "49:1--49:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242286",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a49-misra/",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Moller:1996:LCS,
  author =       "Faron Moller",
  title =        "Logics for concurrency: structure versus automata",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "50:1--50:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242287",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a50-moller/",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Montanari:1996:CC,
  author =       "Ugo Montanari",
  title =        "Causal computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "51:1--51:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242289",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a51-montanari/",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{DeNicola:1996:CTP,
  author =       "Rocco {De Nicola} and Scott A. Smolka",
  title =        "Concurrency: theory and practice",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "52:1--52:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242290",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a52-de_nicola/",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Prasad:1996:MMC,
  author =       "Sanjiva Prasad",
  title =        "Models for mobile computing agents",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "53:1--53:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242292",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a53-prasad/",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pratt:1996:CCO,
  author =       "Vaughan R. Pratt",
  title =        "Concurrency concepts: an ongoing search",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "54:1--54:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242293",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a54-pratt/",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sifakis:1996:RDC,
  author =       "Joseph Sifakis",
  title =        "Research directions for concurrency",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "55:1--55:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242294",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a55-sifakis/",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Steffen:1996:MER,
  author =       "Bernhard Steffen and Tiziana Margaria",
  title =        "Method engineering for real-life concurrent systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "56:1--56:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242296",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a56-steffen/",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Thomsen:1996:PLA,
  author =       "Bent Thomsen",
  title =        "Programming languages, analysis tools, and concurrency
                 theory",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "57:1--57:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242297",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a57-thomsen/",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wolper:1996:WAS,
  author =       "Pierre Wolper",
  title =        "Where is the algorithmic support?",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "58:1--58:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242298",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a58-wolper/",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Brodsky:1996:CDP,
  author =       "Alexander Brodsky",
  title =        "Constraint databases: promising technology or just
                 intellectual exercise?",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "59:1--59:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242299",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a59-brodsky/",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Codognet:1996:VCC,
  author =       "Philippe Codognet",
  title =        "The virtuality of constraints and the constraints of
                 virtuality",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "60:1--60:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242301",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a60-codognet/",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dechter:1996:BEU,
  author =       "R. Dechter",
  title =        "Bucket elimination: a unifying framework for
                 processing hard and soft constraints",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "61:1--61:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242302",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a61-dechter/",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dincbas:1996:CP,
  author =       "M. Dincbas",
  title =        "Constraint programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "62:1--62:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242303",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a62-dincbas/",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Freuder:1996:PHG,
  author =       "E. Freuder",
  title =        "In pursuit of the holy grail",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "63:1--63:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242304",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a63-freuder/",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hermenegildo:1996:SCC,
  author =       "Manuel Hermenegildo",
  title =        "Some challenges for constraint programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "64:1--64:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242305",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a64-hermenegildo/",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jaffar:1996:CP,
  author =       "J. Jaffar and R. Yap",
  title =        "Constraint programming 2000",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "65:1--65:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242307",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a65-jaffar/",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kasif:1996:TCB,
  author =       "S. Kasif",
  title =        "Towards a constraint-based engineering framework for
                 algorithm design and application",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "66:1--66:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242308",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a66-kasif/",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mackworth:1996:CBD,
  author =       "Alan Mackworth",
  title =        "Constraint-based design of embedded intelligent
                 systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "67:1--67:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242309",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a67-mackworth/",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{McAllester:1996:RNM,
  author =       "D. McAllester",
  title =        "The rise of nonlinear mathematical programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "68:1--68:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242311",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a68-mcallester/",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{McAloon:1996:CBP,
  author =       "Ken McAloon",
  title =        "Constraint-based programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "69:1--69:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242313",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a69-mcaloon/",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Montanari:1996:CSP,
  author =       "Ugo Montanari and Francesca Rossi",
  title =        "Constraint solving and programming: what's next?",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "70:1--70:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242314",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a70-montanari/",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Older:1996:CI,
  author =       "William J. Older",
  title =        "{CLP} (intervals)",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "71:1--71:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242315",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a71-older/",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Puget:1996:FCP,
  author =       "Jean-Fran{\c{c}}ois Puget",
  title =        "Future of constraint programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "72:1--72:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242317",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a72-puget/",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ramakrishnan:1996:CD,
  author =       "R. Ramakrishnan",
  title =        "Constraints in databases",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "73:1--73:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242318",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a73-ramakrishnan/",
  acknowledgement = ack-nhfb,
  articleno =    "73",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Saraswat:1996:CC,
  author =       "Vijay Saraswat",
  title =        "Compositional computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "74:1--74:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242320",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a74-saraswat/",
  acknowledgement = ack-nhfb,
  articleno =    "74",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Smolka:1996:CO,
  author =       "Gert Smolka",
  title =        "Constraints in {OZ}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "75:1--75:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242321",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a75-smolka/",
  acknowledgement = ack-nhfb,
  articleno =    "75",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{VanHentenryck:1996:CPC,
  author =       "Pascal {Van Hentenryck}",
  title =        "Constraint programming for combinatorial search
                 problems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "76:1--76:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242322",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a76-van_hentenryck/",
  acknowledgement = ack-nhfb,
  articleno =    "76",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Blakeley:1996:TDD,
  author =       "Jos{\'e} Blakeley",
  title =        "Thoughts on directions in database research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "77:1--77:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242324",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a77-blakeley/",
  acknowledgement = ack-nhfb,
  articleno =    "77",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dayal:1996:DTC,
  author =       "Umeshwar Dayal",
  title =        "Database technology at a crossroads",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "78:1--78:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242326",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a78-dayal/",
  acknowledgement = ack-nhfb,
  articleno =    "78",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jajodia:1996:MSP,
  author =       "Sushil Jajodia",
  title =        "Managing security and privacy of information",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "79:1--79:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242327",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a79-jajodia/",
  acknowledgement = ack-nhfb,
  articleno =    "79",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Korth:1996:NFP,
  author =       "Henry F. Korth",
  title =        "New focal points for research in database systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "80:1--80:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242328",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a80-korth/",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lohman:1996:YTY,
  author =       "Guy M. Lohman",
  title =        "You think your {DBMS} is complex now\ldots{}?",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "81:1--81:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242330",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a81-lohman/",
  acknowledgement = ack-nhfb,
  articleno =    "81",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lomet:1996:RRD,
  author =       "David Lomet",
  title =        "A role for research in the database industry",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "82:1--82:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242332",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a82-lomet/",
  acknowledgement = ack-nhfb,
  articleno =    "82",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Maier:1996:RDS,
  author =       "David Maier",
  title =        "Repackaging database systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "83:1--83:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242335",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a83-maier/",
  acknowledgement = ack-nhfb,
  articleno =    "83",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Manola:1996:TDS,
  author =       "Frank Manola",
  title =        "Transforming the database system into an open service
                 concept",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "84:1--84:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242336",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a84-manola/",
  acknowledgement = ack-nhfb,
  articleno =    "84",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ozsu:1996:FDS,
  author =       "M. Tamer {\"O}zsu",
  title =        "Future of database systems: changing applications and
                 technological developments",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "85:1--85:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242337",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a85-ozsu/",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ramakrishnan:1996:SPD,
  author =       "Raghu Ramakrishnan",
  title =        "Some promising directions for database research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "86:1--86:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242339",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a86-ramakrishnan/",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ramamritham:1996:AOD,
  author =       "Krithi Ramamritham",
  title =        "Application-oriented database support",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "87:1--87:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242340",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a87-ramamritham/",
  acknowledgement = ack-nhfb,
  articleno =    "87",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Schek:1996:IRF,
  author =       "Hans-J. Schek",
  title =        "Improving the role of future database systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "88:1--88:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242341",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a88-schek/",
  acknowledgement = ack-nhfb,
  articleno =    "88",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Snodgrass:1996:IM,
  author =       "Richard Thomas Snodgrass",
  title =        "The inefficiency of misalignment",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "89:1--89:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242342",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a89-snodgrass/",
  acknowledgement = ack-nhfb,
  articleno =    "89",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ullman:1996:MDT,
  author =       "Jeff Ullman",
  title =        "Moving database theory into database practice",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "90:1--90:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242343",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a90-ullman/",
  acknowledgement = ack-nhfb,
  articleno =    "90",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Widom:1996:IHD,
  author =       "Jennifer Widom",
  title =        "Integrating heterogeneous databases: lazy or eager?",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "91:1--91:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242344",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a91-widom/",
  acknowledgement = ack-nhfb,
  articleno =    "91",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Astrachan:1996:EGP,
  author =       "Owen Astrachan",
  title =        "Education goals and priorities",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "92:1--92:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242345",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a92-astrachan/",
  acknowledgement = ack-nhfb,
  articleno =    "92",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bruce:1996:TCS,
  author =       "Kim Bruce",
  title =        "Thoughts on computer science education",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "93:1--93:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242346",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a93-bruce/",
  acknowledgement = ack-nhfb,
  articleno =    "93",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cupper:1996:RCF,
  author =       "Robert Cupper",
  title =        "A revised curriculum framework",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "94:1--94:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242347",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a94-cupper/",
  acknowledgement = ack-nhfb,
  articleno =    "94",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Denning:1996:BDU,
  author =       "Peter Denning",
  title =        "Business designs of the university",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "95:1--95:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242348",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a95-denning/",
  acknowledgement = ack-nhfb,
  articleno =    "95",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Drysdale:1996:WSW,
  author =       "Scot Drysdale",
  title =        "What should we teach?",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "96:1--96:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242349",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a96-drysdale/",
  acknowledgement = ack-nhfb,
  articleno =    "96",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kelemen:1996:FCN,
  author =       "Charles Kelemen",
  title =        "First courses for nonmajors and public understanding
                 of computer science",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "97:1--97:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242350",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a97-kelemen/",
  acknowledgement = ack-nhfb,
  articleno =    "97",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{McGeoch:1996:RCW,
  author =       "Catherine McGeoch",
  title =        "Research in the curriculum, and the {Web}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "98:1--98:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242352",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a98-mcgeoch/",
  acknowledgement = ack-nhfb,
  articleno =    "98",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Patt:1996:FCF,
  author =       "Yale Patt",
  title =        "First courses and fundamentals",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "99:1--99:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242353",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a99-patt/",
  acknowledgement = ack-nhfb,
  articleno =    "99",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Proulx:1996:FCS,
  author =       "Richard Proulx and Richard Rosala",
  title =        "The future of computer science education",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "100:1--100:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242354",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a100-proulx/",
  acknowledgement = ack-nhfb,
  articleno =    "100",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rada:1996:CVC,
  author =       "Roy Rada",
  title =        "Calling for a virtual computing college",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "101:1--101:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242356",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a101-rada/",
  acknowledgement = ack-nhfb,
  articleno =    "101",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Roberts:1996:DCS,
  author =       "Eric Roberts",
  title =        "Directions in computer science education",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "102:1--102:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242357",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a102-roberts/",
  acknowledgement = ack-nhfb,
  articleno =    "102",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Stein:1996:IPR,
  author =       "Lynn Andrea Stein",
  title =        "Interactive programming: revolutionizing introductory
                 computer science",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "103:1--103:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242358",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a103-stein/",
  acknowledgement = ack-nhfb,
  articleno =    "103",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tucker:1996:CCS,
  author =       "Allen Tucker",
  title =        "Crisis in computer science education",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "104:1--104:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242359",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a104-tucker/",
  acknowledgement = ack-nhfb,
  articleno =    "104",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Adam:1996:UAD,
  author =       "Nabil R. Adam and Shamim Naqvi",
  title =        "Universal access in digital libraries",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "105:1--105:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242360",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a105-adam/",
  acknowledgement = ack-nhfb,
  articleno =    "105",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Awerbuch:1996:MGN,
  author =       "Baruch Awerbuch",
  title =        "Maximizing gross network product {(GNP)}: resource
                 management on the {GII}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "106:1--106:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242361",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a106-awerbuch/",
  acknowledgement = ack-nhfb,
  articleno =    "106",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Brodsky:1996:CDT,
  author =       "Alex Brodsky",
  title =        "Constraint database technology for electronic trade
                 with complex objectives",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "107:1--107:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242362",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a107-brodsky/",
  acknowledgement = ack-nhfb,
  articleno =    "107",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Grossman:1996:DMC,
  author =       "Robert Grossman",
  title =        "Database mining challenges for digital libraries",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "108:1--108:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242364",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a108-grossman/",
  acknowledgement = ack-nhfb,
  articleno =    "108",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Johnson:1996:PPI,
  author =       "Jim Johnson",
  title =        "The physics of politics in the information age",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "109:1--109:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242365",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a109-johnson/",
  acknowledgement = ack-nhfb,
  articleno =    "109",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Blaustein:1996:FSP,
  author =       "Barbara T. Blaustein and Catherine McCollum and Arnon
                 Rosenthal",
  title =        "Flexible security policies for digital libraries",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "110:1--110:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242366",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a110-blaustein/",
  acknowledgement = ack-nhfb,
  articleno =    "110",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Neches:1996:FEC,
  author =       "Anna-Lena Neches",
  title =        "The future of electronic commerce: a pragmatic view",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "111:1--111:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242368",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a111-neches/",
  acknowledgement = ack-nhfb,
  articleno =    "111",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bennet:1996:ECP,
  author =       "Karen Bennet and Jacob Slonim",
  title =        "The electronic commerce position paper",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "112:1--112:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242369",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a112-bennet/",
  acknowledgement = ack-nhfb,
  articleno =    "112",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wolfson:1996:ICM,
  author =       "Ouri Wolfson",
  title =        "Infrastructure and cost models for digital libraries",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "113:1--113:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242371",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a113-wolfson/",
  acknowledgement = ack-nhfb,
  articleno =    "113",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wactlar:1996:NGE,
  author =       "Howard D. Wactlar",
  title =        "The next generation electronic library --- capturing
                 the experience",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "114:1--114:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242372",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a114-wactlar/",
  acknowledgement = ack-nhfb,
  articleno =    "114",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Alur:1996:NSF,
  author =       "Rajeev Alur",
  title =        "Next steps in formal verification",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "115:1--115:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242373",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a115-alur/",
  acknowledgement = ack-nhfb,
  articleno =    "115",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Clarke:1996:TPA,
  author =       "Edmund Clarke and Jeannette M. Wing",
  title =        "Tools and partial analysis",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "116:1--116:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242374",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a116-clarke/",
  acknowledgement = ack-nhfb,
  articleno =    "116",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cleaveland:1996:FSD,
  author =       "Rance Cleaveland",
  title =        "Formality and software design",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "117:1--117:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242376",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a117-cleaveland/",
  acknowledgement = ack-nhfb,
  articleno =    "117",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{German:1996:RGF,
  author =       "Steven German",
  title =        "Research goals for formal methods",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "118:1--118:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242377",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a118-german/",
  acknowledgement = ack-nhfb,
  articleno =    "118",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Henzinger:1996:SMA,
  author =       "Thomas A. Henzinger",
  title =        "Some myths about formal verification",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "119:1--119:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242378",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a119-henzinger/",
  acknowledgement = ack-nhfb,
  articleno =    "119",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Holzmann:1996:FMC,
  author =       "Gerard Holzmann",
  title =        "On-the-fly model checking",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "120:1--120:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242379",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a120-holzmann/",
  acknowledgement = ack-nhfb,
  articleno =    "120",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jones:1996:FML,
  author =       "Cliff Jones",
  title =        "Formal methods light",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "121:1--121:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242380",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a121-jones/",
  acknowledgement = ack-nhfb,
  articleno =    "121",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Peled:1996:UIF,
  author =       "Doron Peled",
  title =        "User interfaces for formal methods",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "122:1--122:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242381",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a122-peled/",
  acknowledgement = ack-nhfb,
  articleno =    "122",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rushby:1996:EUF,
  author =       "John Rushby",
  title =        "Enhancing the utility of formal methods",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "123:1--123:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242382",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a123-rushby/",
  acknowledgement = ack-nhfb,
  articleno =    "123",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sifakis:1996:SSQ,
  author =       "Joseph Sifakis",
  title =        "Safety, security and quality",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "124:1--124:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242383",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a124-sifakis/",
  acknowledgement = ack-nhfb,
  articleno =    "124",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sistla:1996:HIM,
  author =       "Prasad Sistla",
  title =        "Hybrid and incremental modelchecking techniques",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "125:1--125:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242384",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a125-sistla/",
  acknowledgement = ack-nhfb,
  articleno =    "125",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Steffen:1996:TGF,
  author =       "Bernhard Steffen and Tiziana Margaria",
  title =        "Tools get formal methods into practice",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "126:1--126:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242385",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a126-steffen/",
  acknowledgement = ack-nhfb,
  articleno =    "126",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wolper:1996:MF,
  author =       "Pierre Wolper",
  title =        "The meaning of ``formal''",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "127:1--127:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242386",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a127-wolper/",
  acknowledgement = ack-nhfb,
  articleno =    "127",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Woodcock:1996:SER,
  author =       "Jim Woodcock",
  title =        "Software engineering research directions",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "128:1--128:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242387",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a128-woodcock/",
  acknowledgement = ack-nhfb,
  articleno =    "128",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bryson:1996:INR,
  author =       "Steve Bryson",
  title =        "Implications of near-real-time three-dimensional
                 interfaces",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "129:1--129:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242389",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a129-bryson/",
  acknowledgement = ack-nhfb,
  articleno =    "129",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bulterman:1996:MTS,
  author =       "Dick C. A. Bulterman",
  title =        "Making the technology serve the user",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "130:1--130:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242390",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a130-bulterman/",
  acknowledgement = ack-nhfb,
  articleno =    "130",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Catarci:1996:DWN,
  author =       "Tiziana Catarci",
  title =        "Databases and the {Web}: new requirements for an easy
                 access",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "131:1--131:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242391",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a131-catarci/",
  acknowledgement = ack-nhfb,
  articleno =    "131",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Citrin:1996:SDV,
  author =       "Wayne Citrin",
  title =        "Strategic directions in visual languages research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "132:1--132:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242392",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a132-citrin/",
  acknowledgement = ack-nhfb,
  articleno =    "132",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cruz:1996:TIV,
  author =       "Isabel F. Cruz",
  title =        "Tailorable information visualization",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "133:1--133:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.250708",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a133-cruz/",
  acknowledgement = ack-nhfb,
  articleno =    "133",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Glinert:1996:AMI,
  author =       "Ephraim P. Glinert and R. Lindsay Todd and G. Bowden
                 Wise",
  title =        "The adaptive multi-interface multimodal environment",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "134:1--134:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242394",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a134-glinert/",
  acknowledgement = ack-nhfb,
  articleno =    "134",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Grudin:1996:EE,
  author =       "Jonathan Grudin",
  title =        "The end of exile",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "135:1--135:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242396",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a135-grudin/",
  acknowledgement = ack-nhfb,
  articleno =    "135",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hollan:1996:SIH,
  author =       "James D. Hollan",
  title =        "Strategic issues for human-computer interaction",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "136:1--136:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242397",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a136-hollan/",
  acknowledgement = ack-nhfb,
  articleno =    "136",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ioannidis:1996:VUI,
  author =       "Yannis E. Ioannidis",
  title =        "Visual user interfaces for database systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "137:1--137:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242399",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a137-ioannidis/",
  acknowledgement = ack-nhfb,
  articleno =    "137",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jacob:1996:FID,
  author =       "Robert J. K. Jacob",
  title =        "The future of input devices",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "138:1--138:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242400",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a138-jacob/",
  acknowledgement = ack-nhfb,
  articleno =    "138",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{John:1996:EUE,
  author =       "Bonnie E. John",
  title =        "Evaluating usability evaluation techniques",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "139:1--139:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242402",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a139-john/",
  acknowledgement = ack-nhfb,
  articleno =    "139",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kurlander:1996:TUI,
  author =       "David Kurlander",
  title =        "Thoughts on user interface processes and agendas",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "140:1--140:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242403",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a140-kurlander/",
  acknowledgement = ack-nhfb,
  articleno =    "140",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Myers:1996:PHU,
  author =       "Brad A. Myers",
  title =        "Programmability and heuristics in the user
                 interfaces",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "141:1--141:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242404",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a141-myers/",
  acknowledgement = ack-nhfb,
  articleno =    "141",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Olsen:1996:CRI,
  author =       "Dan R. {Olsen, Jr.}",
  title =        "Computational resources and the {Internet}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "142:1--142:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242407",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a142-olsen/",
  acknowledgement = ack-nhfb,
  articleno =    "142",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shieber:1996:CCI,
  author =       "Stuart M. Shieber",
  title =        "A call for collaborative interfaces",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "143:1--143:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242408",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a143-shieber/",
  acknowledgement = ack-nhfb,
  articleno =    "143",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shneiderman:1996:AGU,
  author =       "Ben Shneiderman",
  title =        "Advanced graphic user interfaces: elastic and tightly
                 coupled windows",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "144:1--144:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242409",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a144-shneiderman/",
  acknowledgement = ack-nhfb,
  articleno =    "144",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Stasko:1996:FRD,
  author =       "John Stasko",
  title =        "Future research directions in human-computer
                 interaction",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "145:1--145:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242410",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a145-stasko/",
  acknowledgement = ack-nhfb,
  articleno =    "145",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Strong:1996:HCI,
  author =       "Gary W. Strong",
  title =        "Human-centered information systems {(HCIS)}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "146:1--146:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242411",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a146-strong/",
  acknowledgement = ack-nhfb,
  articleno =    "146",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wittenburg:1996:WIG,
  author =       "Kent Wittenburg",
  title =        "The {WWW} information glut: implications for
                 next-generation {HCI} technologies",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "147:1--147:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242412",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a147-wittenburg/",
  acknowledgement = ack-nhfb,
  articleno =    "147",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Aksit:1996:SCC,
  author =       "M. Aksit",
  title =        "Separation and composition of concerns in the
                 object-oriented model",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "148:1--148:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242413",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a148-aksit/",
  acknowledgement = ack-nhfb,
  articleno =    "148",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Black:1996:OOL,
  author =       "A. P. Black",
  title =        "Object-oriented languages: the next generation",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "149:1--149:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242414",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a149-black/",
  acknowledgement = ack-nhfb,
  articleno =    "149",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cardelli:1996:BEP,
  author =       "L. Cardelli",
  title =        "Bad engineering properties of object-orient
                 languages",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "150:1--150:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242415",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a150-cardelli/",
  acknowledgement = ack-nhfb,
  articleno =    "150",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cointe:1996:RLM,
  author =       "P. Cointe",
  title =        "Reflective languages and metalevel architectures",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "151:1--151:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242416",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a151-cointe/",
  acknowledgement = ack-nhfb,
  articleno =    "151",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Coplien:1996:BBO,
  author =       "J. Coplien",
  title =        "Broadening beyond objects to patterns and to other
                 paradigms",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "152:1--152:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242418",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a152-coplien/",
  acknowledgement = ack-nhfb,
  articleno =    "152",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Guerraoui:1996:DPA,
  author =       "R. Guerraoui",
  title =        "Distributed programming abstractions",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "153:1--153:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242419",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a153-guerraoui/",
  acknowledgement = ack-nhfb,
  articleno =    "153",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kiczales:1996:AOP,
  author =       "G. Kiczales",
  title =        "Aspect-oriented programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "154:1--154:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242420",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a154-kiczales/",
  acknowledgement = ack-nhfb,
  articleno =    "154",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lea:1996:SAI,
  author =       "D. Lea",
  title =        "Specification, architecture, and interoperability",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "155:1--155:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242422",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a155-lea/",
  acknowledgement = ack-nhfb,
  articleno =    "155",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lieberherr:1996:TPO,
  author =       "K. Lieberherr",
  title =        "From transience to persistence in object-oriented
                 programming: architectures and patterns",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "156:1--156:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242423",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a156-lieberherr/",
  acknowledgement = ack-nhfb,
  articleno =    "156",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Madsen:1996:SRD,
  author =       "O. Madsen",
  title =        "Strategic research directions in object-oriented
                 programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "157:1--157:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242424",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a157-madsen/",
  acknowledgement = ack-nhfb,
  articleno =    "157",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Magnusson:1996:TI,
  author =       "B. Magnusson",
  title =        "Technology integration",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "158:1--158:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242425",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a158-magnusson/",
  acknowledgement = ack-nhfb,
  articleno =    "158",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Meseguer:1996:WON,
  author =       "Jos{\'e} Meseguer",
  title =        "Why {OOP} needs new semantic foundations",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "159:1--159:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242426",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a159-meseguer/",
  acknowledgement = ack-nhfb,
  articleno =    "159",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mossenbock:1996:TOO,
  author =       "H. M{\"o}ssenb{\"o}ck",
  title =        "Trends in object-oriented programming",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "160:1--160:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242427",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a160-mossenbock/",
  acknowledgement = ack-nhfb,
  articleno =    "160",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Palsberg:1996:CTO,
  author =       "J. Palsberg",
  title =        "Compiler technology for object-oriented languages",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "161:1--161:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242428",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a161-palsberg/",
  acknowledgement = ack-nhfb,
  articleno =    "161",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Schmidt:1996:UDP,
  author =       "D. Schmidt",
  title =        "Using design patterns to guide the development of
                 reusable object-oriented software",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "162:1--162:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242429",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a162-schmidt/",
  acknowledgement = ack-nhfb,
  articleno =    "162",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cardelli:1996:GC,
  author =       "Luca Cardelli",
  title =        "Global computation",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "163:1--163:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242430",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a163-cardelli/",
  acknowledgement = ack-nhfb,
  articleno =    "163",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Consel:1996:PAB,
  author =       "Charles Consel",
  title =        "Program adaptation based on program transformation",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "164:1--164:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242431",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a164-consel/",
  acknowledgement = ack-nhfb,
  articleno =    "164",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cousot:1996:PAA,
  author =       "Patrick Cousot",
  title =        "Program analysis: the abstract interpretation
                 perspective",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "165:1--165:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242433",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a165-cousot/",
  acknowledgement = ack-nhfb,
  articleno =    "165",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hanus:1996:IDP,
  author =       "Michael Hanus",
  title =        "Integration of declarative paradigms: benefits and
                 challenges",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "166:1--166:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242434",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a166-hanus/",
  acknowledgement = ack-nhfb,
  articleno =    "166",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Metayer:1996:PAS,
  author =       "Daniel Le M{\'e}tayer",
  title =        "Program analysis for software engineering: new
                 applications, new requirements, new tools",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "167:1--167:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242435",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a167-le_metayer/",
  acknowledgement = ack-nhfb,
  articleno =    "167",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nielson:1996:PPA,
  author =       "Flemming Nielson",
  title =        "Perspectives on program analysis",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "168:1--168:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242441",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a168-nielson/",
  acknowledgement = ack-nhfb,
  articleno =    "168",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Odersky:1996:CTS,
  author =       "Martin Odersky",
  title =        "Challenges in type systems research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "169:1--169:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242442",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a169-odersky/",
  acknowledgement = ack-nhfb,
  articleno =    "169",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Paige:1996:FDP,
  author =       "Robert Paige",
  title =        "Future directions in program transformations",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "170:1--170:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242444",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a170-paige/",
  acknowledgement = ack-nhfb,
  articleno =    "170",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pettorossi:1996:FDP,
  author =       "Alberto Pettorossi and Maurizio Proietti",
  title =        "Future directions in program transformation",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "171:1--171:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242445",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a171-pettorossi/",
  acknowledgement = ack-nhfb,
  articleno =    "171",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Reynolds:1996:BM,
  author =       "John Reynolds",
  title =        "Beyond {ML}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "172:1--172:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242447",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a172-reynolds/",
  acknowledgement = ack-nhfb,
  articleno =    "172",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Riecke:1996:SDC,
  author =       "Jon G. Riecke",
  title =        "Semantics: the description of computational
                 structures",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "173:1--173:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242448",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a173-riecke/",
  acknowledgement = ack-nhfb,
  articleno =    "173",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ryder:1996:FPA,
  author =       "Barbara Ryder",
  title =        "The future of program analysis",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "174:1--174:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242450",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a174-ryder/",
  acknowledgement = ack-nhfb,
  articleno =    "174",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Schmidt:1996:NPF,
  author =       "David A. Schmidt",
  title =        "On the need for a popular formal semantics",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "175:1--175:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242451",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a175-schmidt/",
  acknowledgement = ack-nhfb,
  articleno =    "175",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Volpano:1996:PSP,
  author =       "Dennis Volpano",
  title =        "Provably secure programming languages for remote
                 evaluation",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "176:1--176:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242453",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a176-volpano/",
  acknowledgement = ack-nhfb,
  articleno =    "176",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wilhelm:1996:PAT,
  author =       "Reinhard Wilhelm",
  title =        "Program analysis --- a toolmaker's perspective",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "177:1--177:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242454",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a177-wilhelm/",
  acknowledgement = ack-nhfb,
  articleno =    "177",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Burns:1996:BRT,
  author =       "Alan Burns",
  title =        "Broadening real-time systems research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "178:1--178:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242456",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a178-burns/",
  acknowledgement = ack-nhfb,
  articleno =    "178",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jeffay:1996:TEC,
  author =       "Kevin Jeffay",
  title =        "Technical and educational challenges for real-time
                 computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "179:1--179:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242457",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a179-jeffay/",
  acknowledgement = ack-nhfb,
  articleno =    "179",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jones:1996:CRT,
  author =       "Mike Jones",
  title =        "Consumer real-time systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "180:1--180:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242459",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a180-jones/",
  acknowledgement = ack-nhfb,
  articleno =    "180",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Koob:1996:LSD,
  author =       "Gary Koob",
  title =        "Large-scale distributed real-time systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "181:1--181:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242460",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a181-koob/",
  acknowledgement = ack-nhfb,
  articleno =    "181",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lee:1996:FVT,
  author =       "Insup Lee",
  title =        "Formal verification, testing and checking of real-time
                 systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "182:1--182:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242461",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a182-lee/",
  acknowledgement = ack-nhfb,
  articleno =    "182",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lehoczky:1996:AMR,
  author =       "John Lehoczky",
  title =        "Analytical methods for real-time computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "183:1--183:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242463",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a183-lehoczky/",
  acknowledgement = ack-nhfb,
  articleno =    "183",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Liu:1996:VTP,
  author =       "Jane Liu",
  title =        "Validation of timing properties",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "184:1--184:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242464",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a184-liu/",
  acknowledgement = ack-nhfb,
  articleno =    "184",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mok:1996:FRT,
  author =       "Al Mok",
  title =        "Firm real-time systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "185:1--185:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242465",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a185-mok/",
  acknowledgement = ack-nhfb,
  articleno =    "185",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ramamritham:1996:PDR,
  author =       "Krithi Ramamritham",
  title =        "Predictability: demonstrating real-time properties",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "186:1--186:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242466",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a186-ramamritham/",
  acknowledgement = ack-nhfb,
  articleno =    "186",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sha:1996:RTR,
  author =       "Lui Sha",
  title =        "Real-time in the real world",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "187:1--187:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242467",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a187-sha/",
  acknowledgement = ack-nhfb,
  articleno =    "187",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Stankovic:1996:PRT,
  author =       "Jack Stankovic",
  title =        "The pervasiveness of real-time computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "188:1--188:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242468",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a188-stankovic/",
  acknowledgement = ack-nhfb,
  articleno =    "188",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{vanTilborg:1996:RTR,
  author =       "Andre {van Tilborg}",
  title =        "Real-time research in the {Department of Defense}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "189:1--189:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242470",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a189-van_tilborg/",
  acknowledgement = ack-nhfb,
  articleno =    "189",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Abowd:1996:SEP,
  author =       "Gregory Abowd",
  title =        "Software engineering and programming language
                 considerations for ubiquitous computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "190:1--190:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242471",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a190-abowd/",
  acknowledgement = ack-nhfb,
  articleno =    "190",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chambers:1996:TRE,
  author =       "Craig Chambers",
  title =        "Towards reusable, extensible components",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "192:1--192:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242473",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a192-chambers/",
  acknowledgement = ack-nhfb,
  articleno =    "192",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Clarke:1996:NFP,
  author =       "Lori A. Clarke and Peri Tarr",
  title =        "New functionality for programming languages",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "193:1--193:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242474",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a193-clarke/",
  acknowledgement = ack-nhfb,
  articleno =    "193",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Griswold:1996:PLR,
  author =       "William G. Griswold and Richard Wolski and Scott B.
                 Baden and Stephen J. Fink and Scott R. Kohn",
  title =        "Programming language requirements for the next
                 millennium",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "194:1--194:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242475",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a194-griswold/",
  acknowledgement = ack-nhfb,
  articleno =    "194",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Harper:1996:RPL,
  author =       "Robert Harper and Peter Lee",
  title =        "Research in programming languages for composability,
                 safety, and performance",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "195:1--195:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242476",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a195-harper/",
  acknowledgement = ack-nhfb,
  articleno =    "195",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hudak:1996:BDS,
  author =       "Paul Hudak",
  title =        "Building domain-specific embedded languages",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "196:1--196:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242477",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a196-hudak/",
  acknowledgement = ack-nhfb,
  articleno =    "196",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kamin:1996:CLT,
  author =       "Sam Kamin",
  title =        "The challenge of language technology transfer",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "197:1--197:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242478",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a197-kamin/",
  acknowledgement = ack-nhfb,
  articleno =    "197",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Moore:1996:RIR,
  author =       "Melody M. Moore",
  title =        "Representation issues for reengineering interactive
                 systems",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "199:1--199:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242479",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a199-moore/",
  acknowledgement = ack-nhfb,
  articleno =    "199",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Palsberg:1996:SEI,
  author =       "Jens Palsberg",
  title =        "Software evolution and integration",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "200:1--200:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242480",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a200-palsberg/",
  acknowledgement = ack-nhfb,
  articleno =    "200",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Scherlis:1996:BC,
  author =       "Bill Scherlis",
  title =        "Beyond coding",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "201:1--201:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242481",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a201-scherlis/",
  acknowledgement = ack-nhfb,
  articleno =    "201",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wileden:1996:PLS,
  author =       "Jack Wileden",
  title =        "Programming languages and software engineering: past,
                 present and future",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "202:1--202:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242482",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a202-wileden/",
  acknowledgement = ack-nhfb,
  articleno =    "202",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Clarke:1996:HDW,
  author =       "Lori A. Clarke",
  title =        "How do we improve software quality and how do we show
                 that it matters?",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "203:1--203:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242483",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a203-clarke/",
  acknowledgement = ack-nhfb,
  articleno =    "203",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{DeMillo:1996:MCA,
  author =       "Richard A. DeMillo",
  title =        "Mission-critical applications, commercial value and
                 software quality",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "204:1--204:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242484",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a204-demillo/",
  acknowledgement = ack-nhfb,
  articleno =    "204",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{McKeeman:1996:SCS,
  author =       "William McKeeman",
  title =        "Separating concerns in software quality",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "205:1--205:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242486",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a205-mckeeman/",
  acknowledgement = ack-nhfb,
  articleno =    "205",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Miller:1996:GQM,
  author =       "Edward F. {Miller, Jr.}",
  title =        "Getting quality methods into practice",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "206:1--206:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242487",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a206-miller/",
  acknowledgement = ack-nhfb,
  articleno =    "206",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Choudhary:1996:LSF,
  author =       "Alok Choudhary and David Kotz",
  title =        "Large-scale file systems with the flexibility of
                 databases",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "207:1--207:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242488",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a207-choudhary/",
  acknowledgement = ack-nhfb,
  articleno =    "207",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cormen:1996:BMP,
  author =       "Thomas H. Cormen and Michael T. Goodrich",
  title =        "A bridging model for parallel computation,
                 communication, and {I}/{O}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "208:1--208:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242490",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a208-cormen/",
  acknowledgement = ack-nhfb,
  articleno =    "208",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gibson:1996:SMN,
  author =       "Garth A. Gibson and John Wilkes",
  title =        "Self-managing network-attached storage",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "209:1--209:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242491",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a209-gibson/",
  acknowledgement = ack-nhfb,
  articleno =    "209",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Muntz:1996:SLD,
  author =       "Richard R. Muntz and Joseph Pasquale",
  title =        "System-level design issues for storage {I/O}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "210:1--210:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242492",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a210-muntz/",
  acknowledgement = ack-nhfb,
  articleno =    "210",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Satyanarayanan:1996:AKM,
  author =       "M. Satyanarayanan and Carla Schlatter Ellis",
  title =        "Adaptation: the key to mobile {I/O}",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "211:1--211:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242494",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a211-satyanarayanan/",
  acknowledgement = ack-nhfb,
  articleno =    "211",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Vengroff:1996:EAE,
  author =       "Darren Erik Vengroff and Jeffrey Scott Vitter",
  title =        "{I/O}-efficient algorithms and environments",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "212:1--212:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242495",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a212-vengroff/",
  acknowledgement = ack-nhfb,
  articleno =    "212",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Green:1996:IWN,
  author =       "Paul Green",
  title =        "The impact of the {Web} on networking research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "213:1--213:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242497",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a213-green/",
  acknowledgement = ack-nhfb,
  articleno =    "213",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kurose:1996:FDN,
  author =       "Jim Kurose",
  title =        "Future directions in networking research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "214:1--214:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242498",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a214-kurose/",
  acknowledgement = ack-nhfb,
  articleno =    "214",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pasquale:1996:TIC,
  author =       "Joseph Pasquale",
  title =        "Towards {Internet} computing",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "215:1--215:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242499",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a215-pasquale/",
  acknowledgement = ack-nhfb,
  articleno =    "215",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Angluin:1996:SCL,
  author =       "Dana Angluin",
  title =        "A 1996 snapshot of computational learning theory",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "216:1--216:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242501",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a216-angluin/",
  acknowledgement = ack-nhfb,
  articleno =    "216",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fich:1996:IIR,
  author =       "Faith Fich",
  title =        "Infrastructure issues related to theory of computing
                 research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "217:1--217:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242502",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a217-fich/",
  acknowledgement = ack-nhfb,
  articleno =    "217",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goldreich:1996:TCS,
  author =       "Oded Goldreich and Avi Wigderson",
  title =        "Theory of computing: a scientific perspective",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "218:1--218:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242503",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a218-goldreich/",
  acknowledgement = ack-nhfb,
  articleno =    "218",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Harper:1996:MB,
  author =       "Robert Harper and John Mitchell",
  title =        "{ML} and beyond",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "219:1--219:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242438",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a219-harper/",
  acknowledgement = ack-nhfb,
  articleno =    "219",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wegner:1997:ES,
  author =       "Peter Wegner",
  title =        "Editorial Statement",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/248621.251369",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:04:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-1/p1-wegner/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Reid:1997:SGI,
  author =       "M. M. Reid and R. J. Millar and N. D. Black",
  title =        "Second-Generation Image Coding: An Overview",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "1",
  pages =        "3--29",
  month =        mar,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/248621.248622",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:04:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-1/p3-reid/",
  abstract =     "This article gives an overview of a diverse selection
                 of currently used second-generation image coding
                 techniques. These techniques have been grouped into
                 similar categories in order to allow a direct
                 comparison among the varying methods. An attempt has
                 been made, where possible, to expand upon and clarify
                 the details given by the original authors. The relative
                 merits and shortcomings of each of the techniques are
                 compared and contrasted.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; compression; human factors; image coding;
                 MRi; theory",
  subject =      "{\bf I.4.2} Computing Methodologies, IMAGE PROCESSING
                 AND COMPUTER VISION, Compression (Coding), Approximate
                 methods. {\bf E.4} Data, CODING AND INFORMATION THEORY,
                 Data compaction and compression. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory, Trees. {\bf I.4.2} Computing Methodologies,
                 IMAGE PROCESSING AND COMPUTER VISION, Compression
                 (Coding), Exact coding**. {\bf I.4.3} Computing
                 Methodologies, IMAGE PROCESSING AND COMPUTER VISION,
                 Enhancement, Filtering. {\bf I.4.3} Computing
                 Methodologies, IMAGE PROCESSING AND COMPUTER VISION,
                 Enhancement, Smoothing. {\bf I.5.4} Computing
                 Methodologies, PATTERN RECOGNITION, Applications,
                 Waveform analysis.",
}

@Article{Walicki:1997:AAN,
  author =       "Micha{\l} Walicki and Sigurd Meldal",
  title =        "Algebraic approaches to nondeterminism --- an
                 overview",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "1",
  pages =        "30--81",
  month =        mar,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/248621.248623",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:04:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-1/p30-walicki/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "theory",
  subject =      "{\bf F.1.1} Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Models of Computation. {\bf F.1.2}
                 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Modes of Computation, Alternation and nondeterminism.
                 {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Semantics of Programming Languages,
                 Algebraic approaches to semantics. {\bf F.4.1} Theory
                 of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Mathematical Logic.",
}

@Article{Pong:1997:VTC,
  author =       "Fong Pong and Michel Dubois",
  title =        "Verification Techniques for Cache Coherence
                 Protocols",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "1",
  pages =        "82--126",
  month =        mar,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/248621.248624",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:04:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-1/p82-pong/",
  abstract =     "In this article we present a comprehensive survey of
                 various approaches for the verification of cache
                 coherence protocols based on {\em state enumeration},
                 {\em symbolic model checking}, and {\em symbolic state
                 models}. Since these techniques search the state space
                 of the protocol exhaustively, the amount of memory
                 required to manipulate that state information and the
                 verification time grow very fast with the number of
                 processors and the complexity of the protocol
                 mechanisms. To be successful for systems of arbitrary
                 complexity, a verification technique must solve this
                 so-called {\em state space explosion\/} problem. The
                 emphasis of our discussion is on the underlying theory
                 in each method of handling the state space explosion
                 problem, and formulating and checking the {\em
                 safety\/} properties (e.g., data consistency) and the
                 {\em liveness\/} properties (absence of deadlock and
                 livelock). We compare the efficiency and discuss the
                 limitations of each technique in terms of memory and
                 computation time. Also, we discuss issues of {\em
                 generality, applicability, automaticity, and amenity\/}
                 for existing tools in each class of methods. No method
                 is truly superior because each method has its own
                 strengths and weaknesses. Finally, refinements that can
                 further reduce the verification time and/or the memory
                 requirement are also discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "cache coherence; finite state machine; protocol
                 verification; shared-memory multiprocessors; state
                 representation and expansion; verification",
  subject =      "{\bf B.3.3} Hardware, MEMORY STRUCTURES, Performance
                 Analysis and Design Aids, Formal models**. {\bf B.3.2}
                 Hardware, MEMORY STRUCTURES, Design Styles, Shared
                 memory. {\bf B.4.4} Hardware, INPUT/OUTPUT AND DATA
                 COMMUNICATIONS, Performance Analysis and Design Aids,
                 Formal models**. {\bf B.4.4} Hardware, INPUT/OUTPUT AND
                 DATA COMMUNICATIONS, Performance Analysis and Design
                 Aids, Verification**.",
}

@Article{Wegner:1997:AIL,
  author =       "Peter Wegner",
  title =        "About this Issue \ldots{}",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "2",
  pages =        "127--127",
  month =        jun,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/254180.257471",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:04:42 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-2/p127-wegner/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "{\bf A.0} General Literature, GENERAL.",
}

@Article{Uhlig:1997:TDM,
  author =       "Richard A. Uhlig and Trevor N. Mudge",
  title =        "Trace-Driven Memory Simulation: a Survey",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "2",
  pages =        "128--170",
  month =        jun,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/254180.254184",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:04:42 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See erratum \cite{Anonymous:1997:E}.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-2/p128-uhlig/",
  abstract =     "As the gap between processor and memory speeds
                 continues to widen, methods for evaluating memory
                 system designs before they are implemented in hardware
                 are becoming increasingly important. One such method,
                 trace-driven memory simulation, has been the subject of
                 intense interest among researchers and has, as a
                 result, enjoyed rapid development and substantial
                 improvements during the past decade. This article
                 surveys and analyzes these developments by establishing
                 criteria for evaluating trace-driven methods, and then
                 applies these criteria to describe, categorize, and
                 compare over 50 trace-driven simulation tools. We
                 discuss the strengths and weaknesses of different
                 approaches and show that no single method is best when
                 all criteria, including accuracy, speed, memory,
                 flexibility, portability, expense, and ease of use are
                 considered. In a concluding section, we examine
                 fundamental limitations to trace-driven simulation, and
                 survey some recent developments in memory simulation
                 that may overcome these bottlenecks.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "caches; experimentation; measurement; memory
                 management; memory simulation; TLBs; trace-driven
                 simulation",
  subject =      "{\bf B.3.3} Hardware, MEMORY STRUCTURES, Performance
                 Analysis and Design Aids, Simulation**. {\bf C.4}
                 Computer Systems Organization, PERFORMANCE OF SYSTEMS,
                 Measurement techniques. {\bf I.6.0} Computing
                 Methodologies, SIMULATION AND MODELING, General.",
}

@Article{Paschos:1997:SAO,
  author =       "Vangelis T. Paschos",
  title =        "A Survey of Approximately Optimal Solutions to Some
                 Covering and Packing Problems",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "2",
  pages =        "171--209",
  month =        jun,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/254180.254190",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:04:42 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-2/p171-paschos/",
  abstract =     "We survey approximation algorithms for some well-known
                 and very natural combinatorial optimization problems,
                 the minimum set covering, the minimum vertex covering,
                 the maximum set packing, and maximum independent set
                 problems; we discuss their approximation performance
                 and their complexity. For already known results, any
                 time we have conceived simpler proofs than those
                 already published, we give these proofs, and, for the
                 rest, we cite the simpler published ones. Finally, we
                 discuss how one can relate the approximability behavior
                 (from both a positive and a negative point of view) of
                 vertex covering to the approximability behavior of a
                 restricted class of independent set problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithm analysis; algorithms; approximation
                 algorithms; combinatorial algorithms; constrained
                 optimization; problem complexity; theory",
  subject =      "{\bf G.2.1} Mathematics of Computing, DISCRETE
                 MATHEMATICS, Combinatorics, Combinatorial algorithms.
                 {\bf G.4} Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm design and analysis. {\bf G.1.6}
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Integer programming. {\bf F.2.2} Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Computations on discrete structures. {\bf G.1.6}
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Linear programming.",
}

@Article{Thorn:1997:PLM,
  author =       "Tommy Thorn",
  title =        "Programming languages for mobile code",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "3",
  pages =        "213--239",
  month =        sep,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/262009.262010",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:04:53 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See erratum \cite{Anonymous:1997:E}.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-3/p213-thorn/",
  abstract =     "Sun's announcement of the programming language Java
                 more that anything popularized the notion of mobile
                 code, that is, programs traveling on a heterogeneous
                 network and automatically executing upon arrival at the
                 destination. We describe several classes of mobile code
                 and extract their common characteristics, where
                 security proves to be one of the major concerns. With
                 these characteristics as reference points, we examine
                 six representative languages proposed for mobile code.
                 The conclusion of this study leads to our
                 recommendations for future work, illustrated by
                 examples of ongoing research.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "distribution; formal methods; Java; languages; Limbo;
                 mobile code; network programming; object orientation;
                 Objective Caml; Obliq; portability; Safe-Tcl; safety;
                 security; telescript",
  subject =      "{\bf A.1} General Literature, INTRODUCTORY AND SURVEY.
                 {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Object-oriented languages. {\bf C.2.4}
                 Computer Systems Organization, COMPUTER-COMMUNICATION
                 NETWORKS, Distributed Systems, Distributed
                 applications. {\bf D.4.6} Software, OPERATING SYSTEMS,
                 Security and Protection, Access controls.",
}

@Article{Wadler:1997:HDI,
  author =       "Philip Wadler",
  title =        "How to declare an imperative",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "3",
  pages =        "240--263",
  month =        sep,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/262009.262011",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:04:53 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-3/p240-wadler/",
  abstract =     "How can we integrate interaction into a purely
                 declarative language? This tutorial describes a
                 solution to this problem based on a monad. The solution
                 has been implemented in the functional language Haskell
                 and the declarative language Escher. Comparisons are
                 given with other approaches to interaction based on
                 synchronous streams, continuations, linear logic, and
                 side effects.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "functional programming; Haskell; monad; theory",
  subject =      "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Input/Output. {\bf F.4.1}
                 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Mathematical Logic, Lambda calculus and
                 related systems.",
}

@Article{Ji:1997:MIC,
  author =       "Qiang Ji and Michael M. Marefat",
  title =        "Machine interpretation of {CAD} data for manufacturing
                 applications",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "3",
  pages =        "264--311",
  month =        sep,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/262009.262012",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:04:53 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-3/p264-ji/",
  abstract =     "Machine interpretation of the shape of a component for
                 CAD databases is an important problem in CAD/CAM,
                 computer vision, and intelligent manufacturing. It can
                 be used in CAD/CAM for evaluation of designs, in
                 computer vision for machine recognition and machine
                 inspection of objects, and in intelligent manufacturing
                 for automating and integrating the link between design
                 and manufacturing. This topic has been an active area
                 of research since the late '70s, and a significant
                 number of computational methods have been proposed to
                 identify portions of the geometry of a part having
                 engineering significance (here called ``features'').
                 However, each proposed mechanism has been able to solve
                 the problem only for components within a restricted
                 geometric domain (such as polyhedral components), or
                 only for components whose features interact with each
                 other in a restricted manner. The purposes of this
                 article are to review and summarize the development of
                 research on machine recognition of features from CAD
                 data, to discuss the advantages and potential problems
                 of each approach, and to point out some of the
                 promising directions future investigations may take.
                 Since most work in this field has focused on machining
                 features, the article primarily covers those features
                 associated with the manufacturing domain. In order to
                 better understand the state of the art, methods of
                 automated feature recognition are divided into the
                 following categories of methods based on their
                 approach: graph-based, syntactic pattern recognition,
                 rule-based, and volumetric. Within each category we
                 have studied issues such as the definition of features,
                 mechanisms developed for recognition of features, the
                 application scope, and the assumptions made. In
                 addition, the problem is addressed from the perspective
                 of information input requirements and the advantages
                 and disadvantages of boundary representation,
                 constructive solid geometry (CSG), and 2D drawings with
                 respect to machine recognition of features are
                 examined. Emphasis is placed on the mechanisms for
                 attacking problems associated with interacting
                 features.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "artificial intelligence; automated process planning;
                 computer-aided design; computer-integrated
                 manufacturing; feature recognition; flexible
                 automation; performance; reliability",
  subject =      "{\bf I.3.5} Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Boundary representations. {\bf I.3.8} Computing
                 Methodologies, COMPUTER GRAPHICS, Applications. {\bf
                 I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling,
                 Constructive solid geometry (CSG)**. {\bf I.3.5}
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations. {\bf I.3.5}
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf I.5.1}
                 Computing Methodologies, PATTERN RECOGNITION, Models,
                 Geometric. {\bf I.5.2} Computing Methodologies, PATTERN
                 RECOGNITION, Design Methodology, Pattern analysis. {\bf
                 I.5.0} Computing Methodologies, PATTERN RECOGNITION,
                 General. {\bf I.2.10} Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Vision and Scene
                 Understanding, Shape. {\bf I.2.9} Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Robotics. {\bf
                 J.2} Computer Applications, PHYSICAL SCIENCES AND
                 ENGINEERING, Engineering.",
}

@Article{Zave:1997:CRE,
  author =       "Pamela Zave",
  title =        "Classification of research efforts in requirements
                 engineering",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "4",
  pages =        "315--321",
  month =        dec,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/267580.267581",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-4/p315-zave/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; performance",
  subject =      "{\bf D.2.1} Software, SOFTWARE ENGINEERING,
                 Requirements/Specifications.",
}

@Article{Nwana:1997:CSE,
  author =       "Hyacinth S. Nwana",
  title =        "Is computer science education in crisis?",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "4",
  pages =        "322--324",
  month =        dec,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/267580.267582",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-4/p322-nwana/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; performance",
  subject =      "{\bf K.3.2} Computing Milieux, COMPUTERS AND
                 EDUCATION, Computer and Information Science
                 Education.",
}

@Article{Weinhaus:1997:TMM,
  author =       "Frederick M. Weinhaus and Venkat Devarajan",
  title =        "Texture mapping {$3$D} models of real-world scenes",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "4",
  pages =        "325--365",
  month =        dec,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/267580.267583",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-4/p325-weinhaus/",
  abstract =     "Texture mapping has become a popular tool in the
                 computer graphics industry in the last few years
                 because it is an easy way to achieve a high degree of
                 realism in computer-generated imagery with very little
                 effort. Over the last decade, texture-mapping
                 techniques have advanced to the point where it is
                 possible to generate real-time perspective simulations
                 of real-world areas by texture mapping every object
                 surface with texture from photographic images of these
                 real-world areas. The techniques for generating such
                 perspective transformations are variations on
                 traditional texture mapping that in some circles have
                 become known as the {\em Image Perspective
                 Transformation\/} or IPT technology. This article first
                 presents a background survey of traditional texture
                 mapping. It then continues with a description of the
                 texture-mapping variations that achieve these
                 perspective transformations of photographic images of
                 real-world scenes. The style of the presentation is
                 that of a resource survey rather thatn an in-depth
                 analysis.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; anti-aliasing; height field; homogeneous
                 coordinates; image perspective transformation; image
                 warping; multiresolution data; perspective projection;
                 polygons; ray tracing; real-time scene generation;
                 rectification; registration; texture mapping; visual
                 simulators; voxels",
  subject =      "{\bf I.3.7} Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture. {\bf I.3.3}
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation, Antialiasing**. {\bf I.3.5}
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations. {\bf I.3.5}
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Hierarchy
                 and geometric transformations. {\bf I.3.7} Computing
                 Methodologies, COMPUTER GRAPHICS, Three-Dimensional
                 Graphics and Realism, Hidden line/surface removal. {\bf
                 I.3.7} Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Raytracing.",
}

@Article{Zhu:1997:SUT,
  author =       "Hong Zhu and Patrick A. V. Hall and John H. R. May",
  title =        "Software unit test coverage and adequacy",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "4",
  pages =        "366--427",
  month =        dec,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/267580.267590",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-4/p366-zhu/",
  abstract =     "Objective measurement of test quality is one of the
                 key issues in software testing. It has been a major
                 research focus for the last two decades. Many test
                 criteria have been proposed and studied for this
                 purpose. Various kinds of rationales have been
                 presented in support of one criterion or another. We
                 survey the research work in this area. The notion of
                 adequacy criteria is examined together with its role in
                 software dynamic testing. A review of criteria
                 classification is followed by a summary of the methods
                 for comparison and assessment of criteria.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "comparing testing effectiveness; fault detection;
                 measurement; performance; reliability; software unit
                 test; test adequacy criteria; test coverage; testing
                 methods; verification",
  subject =      "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing
                 and Debugging.",
}

@Article{Anonymous:1997:E,
  author =       "Anonymous",
  title =        "Errata",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "4",
  pages =        "428--428",
  month =        dec,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/267580.269951",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 10 14:53:57 MST 1998",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Uhlig:1997:TDM,Thorn:1997:PLM}.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-4/p428-errata/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Anonymous:1997:AIV,
  author =       "Anonymous",
  title =        "Author index: Vols. 25--29 (1993--1997)",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "4",
  pages =        "429--437",
  month =        dec,
  year =         "1997",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 10 14:53:57 MST 1998",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-4/p429-author_index/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Anonymous:1997:AI,
  author =       "Anonymous",
  title =        "Author index",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "4",
  pages =        "429--437",
  month =        dec,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/267580.269949",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Anonymous:1997:SIV,
  author =       "Anonymous",
  title =        "Subject index: Vols. 25--29 (1993--1997)",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "4",
  pages =        "437--442",
  month =        dec,
  year =         "1997",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 10 14:53:57 MST 1998",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1997-29-4/p437-subject_index/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{index:1997:SI,
  author =       "Subject index",
  title =        "Subject index",
  journal =      j-COMP-SURV,
  volume =       "29",
  number =       "4",
  pages =        "437--442",
  month =        dec,
  year =         "1997",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/267580.269950",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wegner:1998:AIa,
  author =       "Peter Wegner",
  title =        "About this issue",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "1",
  pages =        "1--1",
  month =        mar,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/274440.275545",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-1/p1-wegner/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lewandowski:1998:FCB,
  author =       "Scott M. Lewandowski",
  title =        "Frameworks for component-based client\slash server
                 computing",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "1",
  pages =        "3--27",
  month =        mar,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/274440.274441",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-1/p3-lewandowski/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{El-Yaniv:1998:CSO,
  author =       "Ran El-Yaniv",
  title =        "Competitive solutions for online financial problems",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "1",
  pages =        "28--69",
  month =        mar,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/274440.274442",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-1/p28-el-yaniv/",
  abstract =     "This article surveys results concerning online
                 algorithms for solving problems related to the
                 management of money and other assets. In particular,
                 the survey focuses on search, replacement, and
                 portfolio selection problems",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; measurement; performance; theory",
  subject =      "{\bf F.1.2} Theory of Computation, COMPUTATION BY
                 ABSTRACT DEVICES, Modes of Computation, Online
                 computation. {\bf F.2.2} Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems, Sorting and
                 searching. {\bf G.2.m} Mathematics of Computing,
                 DISCRETE MATHEMATICS, Miscellaneous. {\bf G.3}
                 Mathematics of Computing, PROBABILITY AND STATISTICS.
                 {\bf J.1} Computer Applications, ADMINISTRATIVE DATA
                 PROCESSING, Financial. {\bf F.1.2} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
                 Computation, Probabilistic computation.",
}

@Article{Thomasian:1998:CCM,
  author =       "Alexander Thomasian",
  title =        "Concurrency control: methods, performance, and
                 analysis",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "1",
  pages =        "70--119",
  month =        mar,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/274440.274443",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-1/p70-thomasian/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "adaptive methods; algorithms; concurrency control;
                 data contention; deadlocks; flow diagrams; load
                 control; Markov chains; optimistic concurrency control;
                 performance; queueing network models; restart-oriented
                 locking methods; serializability; thrashing; two-phase
                 locking; two-phase processing; wait depth limited
                 methods",
  subject =      "{\bf D.4.8} Software, OPERATING SYSTEMS, Performance,
                 Modeling and prediction. {\bf H.2.4} Information
                 Systems, DATABASE MANAGEMENT, Systems, Transaction
                 processing.",
}

@Article{Skillicorn:1998:MLP,
  author =       "David B. Skillicorn and Domenico Talia",
  title =        "Models and languages for parallel computation",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "2",
  pages =        "123--169",
  month =        jun,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/280277.280278",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-2/p123-skillicorn/",
  abstract =     "We survey parallel programming models and languages
                 using six criteria to assess their suitability for
                 realistic portable parallel programming. We argue that
                 an ideal model should by easy to program, should have a
                 software development methodology, should be
                 architecture-independent, should be easy to understand,
                 should guarantee performance, and should provide
                 accurate information about the cost of programs. These
                 criteria reflect our belief that developments in
                 parallelism must be driven by a parallel software
                 industry based on portability and efficiency. We
                 consider programming models in six categories,
                 depending on the level of abstraction they provide.
                 Those that are very abstract conceal even the presence
                 of parallelism at the software level. Such models make
                 software easy to build and port, but efficient and
                 predictable performance is usually hard to achieve. At
                 the other end of the spectrum, low-level models make
                 all of the messy issues of parallel programming
                 explicit (how many threads, how to place them, how to
                 express communication, and how to schedule
                 communication), so that software is hard to build and
                 not very portable, but is usually efficient. Most
                 recent models are near the center of this spectrum,
                 exploring the best tradeoffs between expressiveness and
                 performance. A few models have achieved both
                 abstractness and efficiency. Both kinds of models raise
                 the possibility of parallelism as part of the
                 mainstream of computing.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "general-purpose parallel computation; languages; logic
                 programming languages; object-oriented languages;
                 parallel programming languages; parallel programming
                 models; performance; software development methods;
                 taxonomy; theory",
  subject =      "{\bf C.4} Computer Systems Organization, PERFORMANCE
                 OF SYSTEMS. {\bf D.1} Software, PROGRAMMING TECHNIQUES.
                 {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
                 Classifications.",
}

@Article{Gaede:1998:MAM,
  author =       "Volker Gaede and Oliver G{\"u}nther",
  title =        "Multidimensional access methods",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "2",
  pages =        "170--231",
  month =        jun,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/280277.280279",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-2/p170-gaede/",
  abstract =     "Search operations in databases require special support
                 at the physical level. This is true for conventional
                 databases as well as spatial databases, where typical
                 search operations include the {\em point query\/} (find
                 all objects that contain a given search point) and the
                 {\em region query\/} (find all objects that overlap a
                 given search region). More than ten years of spatial
                 database research have resulted in a great variety of
                 multidimensional access methods to support such
                 operations. We give an overview of that work. After a
                 brief survey of spatial data management in general, we
                 first present the class of {\em point access methods},
                 which are used to search sets of points in two or more
                 dimensions. The second part of the paper is devoted to
                 {\em spatial access methods\/} to handle extended
                 objects, such as rectangles or polyhedra. We conclude
                 with a discussion of theoretical and experimental
                 results concerning the relative performance of various
                 approaches.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data structures; design; experimentation;
                 multidimensional access methods; performance",
  subject =      "{\bf H.2.2} Information Systems, DATABASE MANAGEMENT,
                 Physical Design, Access methods. {\bf H.2.4}
                 Information Systems, DATABASE MANAGEMENT, Systems. {\bf
                 H.2.8} Information Systems, DATABASE MANAGEMENT,
                 Database Applications, Spatial databases and GIS. {\bf
                 H.3.3} Information Systems, INFORMATION STORAGE AND
                 RETRIEVAL, Information Search and Retrieval, Search
                 process. {\bf H.3.3} Information Systems, INFORMATION
                 STORAGE AND RETRIEVAL, Information Search and
                 Retrieval, Selection process.",
}

@Article{Conradi:1998:VMS,
  author =       "Reidar Conradi and Bernhard Westfechtel",
  title =        "Version models for software configuration management",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "2",
  pages =        "232--282",
  month =        jun,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/280277.280280",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:05:38 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-2/p232-conradi/",
  abstract =     "After more than 20 years of research and practice in
                 software configuration management (SCM), constructing
                 consistent configurations of versioned software
                 products still remains a challenge. This article
                 focuses on the version models underlying both
                 commercial systems and research prototypes. It provides
                 an overview and classification of different versioning
                 paradigms and defines and relates fundamental concepts
                 such as revisions, variants, configurations, and
                 changes. In particular, we focus on intensional
                 versioning, that is, construction of versions based on
                 configuration rules. Finally, we provide an overview of
                 systems that have had significant impact on the
                 development of the SCM discipline and classify them
                 according to a detailed taxonomy.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "changes; configuration rules; configurations;
                 languages; management; revisions; variants; versions",
  subject =      "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design
                 Tools and Techniques, Computer-aided software
                 engineering (CASE). {\bf D.2.6} Software, SOFTWARE
                 ENGINEERING, Programming Environments. {\bf D.2.9}
                 Software, SOFTWARE ENGINEERING, Management, Software
                 configuration management. {\bf H.2.3} Information
                 Systems, DATABASE MANAGEMENT, Languages, Database
                 (persistent) programming languages. {\bf H.2.8}
                 Information Systems, DATABASE MANAGEMENT, Database
                 Applications. {\bf I.2.3} Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
                 Deduction. {\bf I.2.3} Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
                 Logic programming.",
}

@Article{Anonymous:1998:CCS,
  author =       "Anonymous",
  title =        "Contents: {Computing Surveys' Electronic Symposium on
                 Partial Evaluating}:
                 \path=http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/=",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3",
  pages =        "283--283",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Jan 26 17:29:12 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Anonymous:1998:E,
  author =       "Anonymous",
  title =        "Editorial",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3",
  pages =        "284--284",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Jan 26 17:29:12 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wegner:1998:E,
  author =       "Peter Wegner and Marvin Israel",
  title =        "Editorial",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3",
  pages =        "284--284",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/292469.293683",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:00 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Danvy:1998:SPE,
  author =       "Olivier Danvy and Robert Gl{\"u}ck and Peter
                 Thiemann",
  title =        "{1998 Symposium on Partial Evaluation}",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3",
  pages =        "285--290",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/292469.293684",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:00 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Briot:1998:CDO,
  author =       "Jean-Pierre Briot and Rachid Guerraoui and Klaus-Peter
                 Lohr",
  title =        "Concurrency and Distribution in Object-Oriented
                 Programming",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3",
  pages =        "291--329",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/292469.292470",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:00 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3/p291-briot/",
  abstract =     "This paper aims at discussing and classifying the
                 various ways in which the object paradigm is used in
                 concurrent and distributed contexts. We distinguish
                 among the {\em library\/} approach, the {\em
                 integrative\/} approach, and the {\em reflective\/}
                 approach. The library approach applies object-oriented
                 concepts, as they are, to structure concurrent and
                 distributed systems through class libraries. The
                 integrative approach consists of merging concepts such
                 as object and activity, message passing, and
                 transaction, etc. The reflective approach integrates
                 class libraries intimately within an object-based
                 programming language. We discuss and illustrate each of
                 these and point out their complementary levels and
                 goals.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "concurrency; distribution; integration; languages;
                 libraries; message passing; object; performance;
                 reflection; reliability",
  subject =      "{\bf C.1.2} Computer Systems Organization, PROCESSOR
                 ARCHITECTURES, Multiple Data Stream Architectures
                 (Multiprocessors). {\bf C.2.4} Computer Systems
                 Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Distributed Systems. {\bf D.1} Software, PROGRAMMING
                 TECHNIQUES. {\bf D.3.2} Software, PROGRAMMING
                 LANGUAGES, Language Classifications. {\bf D.4.1}
                 Software, OPERATING SYSTEMS, Process Management. {\bf
                 D.4.4} Software, OPERATING SYSTEMS, Communications
                 Management. {\bf D.4.5} Software, OPERATING SYSTEMS,
                 Reliability. {\bf I.2.11} Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Distributed Artificial
                 Intelligence.",
}

@Article{Abdullahi:1998:GCI,
  author =       "Saleh E. Abdullahi and Graem A. Ringwood",
  title =        "Garbage Collecting the {Internet}: a Survey of
                 Distributed Garbage Collection",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3",
  pages =        "330--373",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/292469.292471",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:00 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3/p330-abdullahi/",
  abstract =     "Internet programming languages such as Java present
                 new challenges to garbage-collection design. The
                 spectrum of garbage-collection schema for linked
                 structures distributed over a network are reviewed
                 here. Distributed garbage collectors are classified
                 first because they evolved from single-address-space
                 collectors. This taxonomy is used as a framework to
                 explore distribution issues: locality of action,
                 communication overhead and indeterministic
                 communication latency.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "automatic storage reclamation; distributed;
                 distributed file systems; distributed memories;
                 distributed object-oriented management; languages;
                 management; memory management; network communication;
                 object-oriented databases; performance; reference
                 counting; reliability",
  subject =      "{\bf C.2.4} Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
                 {\bf D.1.3} Software, PROGRAMMING TECHNIQUES,
                 Concurrent Programming. {\bf D.1.3} Software,
                 PROGRAMMING TECHNIQUES, Concurrent Programming,
                 Distributed programming. {\bf D.1.3} Software,
                 PROGRAMMING TECHNIQUES, Concurrent Programming,
                 Parallel programming. {\bf D.4.2} Software, OPERATING
                 SYSTEMS, Storage Management. {\bf D.4.3} Software,
                 OPERATING SYSTEMS, File Systems Management.",
}

@Article{Mohapatra:1998:WRT,
  author =       "Prasant Mohapatra",
  title =        "Wormhole Routing Techniques for Directly Connected
                 Multicomputer Systems",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3",
  pages =        "374--410",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/292469.292472",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:00 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3/p374-mohapatra/",
  abstract =     "Wormhole routing has emerged as the most widely used
                 switching technique in massively parallel computers. We
                 present a detailed survey of various techniques for
                 enhancing the performance and reliability of
                 wormhole-routing schemes in directly connected
                 networks. We start with an overview of the direct
                 network topologies and a comparison of various
                 switching techniques. Next, the characteristics of the
                 wormhole routing mechanism are described in detail
                 along with the theory behind deadlock-free routing. The
                 performance of routing algorithms depends on the
                 selection of the path between the source and the
                 destination, the network traffic, and the router
                 design. The routing algorithms are implemented in the
                 router chips. We outline the router characteristics and
                 describe the functionality of various elements of the
                 router. Depending on the usage of paths between the
                 source and the destination, routing algorithms are
                 classified as deterministic, fully adaptive, and
                 partially adaptive. We discuss several representative
                 algorithms for all these categories. The algorithms
                 within each category vary in terms of resource
                 requirements and performance under various traffic
                 conditions. The main difference among various adaptive
                 routing schemes is the technique used to avoid
                 deadlocks. We also discuss a few algorithms based on
                 deadlock recovery techniques. Along with performance,
                 fault tolerance is essential for message routing in
                 multicomputers, and we thus discuss several
                 fault-tolerant wormhole routing algorithms along with
                 their fault-handling capabilities. These routing
                 schemes enable a message to reach its destination even
                 in the presence of faults in the network. The
                 implementation details of wormhole routing algorithms
                 in contemporary commercial systems are also discussed.
                 We conclude by itemizing several future directions and
                 open issues.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; design; performance; reliability",
  subject =      "{\bf C.2.6} Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Internetworking,
                 Routers. {\bf B.4.3} Hardware, INPUT/OUTPUT AND DATA
                 COMMUNICATIONS, Interconnections (Subsystems),
                 Topology. {\bf C.1.4} Computer Systems Organization,
                 PROCESSOR ARCHITECTURES, Parallel Architectures. {\bf
                 C.2.1} Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Network Architecture
                 and Design. {\bf C.2.2} Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
                 Routing protocols.",
}

@Article{Basin:1998:LFB,
  author =       "David Basin",
  title =        "Logical framework based program development",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "1:1--1:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/292469.293683",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 1.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a1-basin/",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Field:1998:EUF,
  author =       "J. Field and J. Heering and T. B. Dinesh",
  title =        "Equations as a uniform framework for partial
                 evaluation and abstract interpretation",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "2:1--2:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/292469.293684",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 2.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a2-field/",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Klimov:1998:PSV,
  author =       "Andrei Klimov",
  title =        "Program specialization vs. program composition",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "3:1--3:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/292469.292470",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 3.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a3-klimov/",
  abstract =     "This paper aims at discussing and classifying the
                 various ways in which the object paradigm is used in
                 concurrent and distributed contexts. We distinguish
                 among the library approach, the integrative approach,
                 and the reflective approach. The library approach
                 applies object-oriented concepts, as they are, to
                 structure concurrent and distributed systems through
                 class libraries. The integrative approach consists of
                 merging concepts such as object and activity, message
                 passing, and transaction, etc. The reflective approach
                 integrates class libraries intimately within an
                 object-based programming language. We discuss and
                 illustrate each of these and point out their
                 complementary levels and goals.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "concurrency; distribution; integration; libraries;
                 message passing; object; reflection",
}

@Article{Leuschel:1998:SAP,
  author =       "Michael Leuschel and B. Martens and D. de Schreye",
  title =        "Some achievements and prospects in partial deduction",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "4:1--4:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/292469.292471",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 4.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a4-leuschel/",
  abstract =     "Internet programming languages such as Java present
                 new challenges to garbage-collection design. The
                 spectrum of garbage-collection schema for linked
                 structures distributed over a network are reviewed
                 here. Distributed garbage collectors are classified
                 first because they evolved from single-address-space
                 collectors. This taxonomy is used as a framework to
                 explore distribution issues: locality of action,
                 communication overhead and indeterministic
                 communication latency.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "automatic storage reclamation; distributed;
                 distributed file systems; distributed memories;
                 distributed object-oriented management; memory
                 management; network communication; object-oriented
                 databases; reference counting",
}

@Article{Mogensen:1998:IL,
  author =       "Torben Mogensen",
  title =        "Inherited limits",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "5:1--5:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/292469.292472",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 5.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a5-mogensen/",
  abstract =     "Wormhole routing has emerged as the most widely used
                 switching technique in massively parallel computers. We
                 present a detailed survey of various techniques for
                 enhancing the performance and reliability of
                 wormhole-routing schemes in directly connected
                 networks. We start with an overview of the direct
                 network topologies and a comparison of various
                 switching techniques. Next, the characteristics of the
                 wormhole routing mechanism are described in detail
                 along with the theory behind deadlock-free routing. The
                 performance of routing algorithms depends on the
                 selection of the path between the source and the
                 destination, the network traffic, and the router
                 design. The routing algorithms are implemented in the
                 router chips. We outline the router characteristics and
                 describe the functionality of various elements of the
                 router. Depending on the usage of paths between the
                 source and the destination, routing algorithms are
                 classified as deterministic, fully adaptive, and
                 partially adaptive. We discuss several representative
                 algorithms for all these categories. The algorithms
                 within each category vary in terms of resource
                 requirements and performance under various traffic
                 conditions. The main difference among various adaptive
                 routing schemes is the technique used to avoid
                 deadlocks. We also discuss a few algorithms based on
                 deadlock recovery techniques. Along with performance,
                 fault tolerance is essential for message routing in
                 multicomputers, and we thus discuss several
                 fault-tolerant wormhole routing algorithms along with
                 their fault-handling capabilities. These routing
                 schemes enable a message to reach its destination even
                 in the presence of faults in the network. The
                 implementation details of wormhole routing algorithms
                 in contemporary commercial systems are also discussed.
                 We conclude by itemizing several future directions and
                 open issues.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pettorossi:1998:PSA,
  author =       "Alberto Pettorossi and Maurizio Proietti",
  title =        "Program specialization via algorithmic unfold\slash
                 fold transformations",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "6:1--6:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289127",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 6.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a6-pettorossi/",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Takano:1998:PTC,
  author =       "Akihiko Takano and Zhenjiang Hu and Masato Takeichi",
  title =        "Program transformation in calculational form",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "7:1--7:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289128",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 7.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a7-takano/",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wickline:1998:MTS,
  author =       "Philip Wickline and Peter Lee and Frank Pfenning and
                 Rowan Davies",
  title =        "Modal types as staging specifications for run-time
                 code generation",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "8:1--8:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289129",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 8.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a8-wickline/",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Alpuente:1998:UVF,
  author =       "Maria Alpuente and Moreno Falaschi and German Vidal",
  title =        "A unifying view of functional and logic program
                 specialization",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "9:1--9:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289130",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 9.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a9-alpuente/",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bugliesi:1998:OML,
  author =       "Michele Bugliesi and Anna Ciampolini and Evelina Lamma
                 and Paola Mello",
  title =        "Optimizing modular logic languages",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "10:1--10:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289131",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 10.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a10-bugliesi/",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Etalle:1998:PEC,
  author =       "Sandro Etalle and Maurizio Gabbrieli",
  title =        "Partial evaluation of concurrent constraint
                 languages",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "11:1--11:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289132",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 11.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a11-etalle/",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gallagher:1998:RTA,
  author =       "J. P. Gallagher and L. Lafave",
  title =        "The role of trace abstractions in program
                 specialization algorithms",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "12:1--12:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289133",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 12.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a12-gallagher/",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hatcliff:1998:FPE,
  author =       "John Hatcliff",
  title =        "Foundations for partial evaluation of functional
                 programs with computational effects",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "13:1--13:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289134",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 13.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a13-hatcliff/",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hughes:1998:TS,
  author =       "John Hughes",
  title =        "Type specialization",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "14:1--14:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289135",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 14.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a14-hughes/",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lafave:1998:EPA,
  author =       "L. Lafave and J. P. Gallagher",
  title =        "Extending the power of automatic constraint-based
                 partial evaluators",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "15:1--15:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289136",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 15.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a15-lafave/",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sagonas:1998:EPD,
  author =       "Konstantinos Sagonas and Michael Leuschel",
  title =        "Extending partial deduction to tabled execution: some
                 results and open issues",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "16:1--16:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289137",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 16.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a16-sagonas/",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Blazy:1998:PEP,
  author =       "Sandrine Blazy and Philippe Facon",
  title =        "Partial evaluation for program comprehension",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "17:1--17:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289138",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 17.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a17-blazy/",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cazenave:1998:SET,
  author =       "Tristan Cazenave",
  title =        "Synthesis of an efficient tactical theorem prover for
                 the game of go",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "18:1--18:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289139",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 18.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a18-cazenave/",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Consel:1998:TSS,
  author =       "C. Consel and L. Hornof and R. Marlet and G. Muller
                 and S. Thibault and E.-N. Volanschi and J. Lawall and
                 J. Noy{\'e}",
  title =        "{Tempo}: specializing systems applications and
                 beyond",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "19:1--19:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289140",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 19.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a19-consel/",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Consel:1998:PES,
  author =       "C. Consel and L. Hornof and R. Marlet and G. Muller
                 and S. Thibault and E.-N. Volanschi and J. Lawall and
                 J. Noy{\'e}",
  title =        "Partial evaluation for software engineering",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "20:1--20:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289141",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 20.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a20-consel/",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Draves:1998:PEM,
  author =       "Scott Draves",
  title =        "Partial evaluation for media processing",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "21:1--21:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289142",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 21.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a21-draves/",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dwyer:1998:UPE,
  author =       "Matthew Dwyer and John Hatcliff and Muhammad Nanda",
  title =        "Using partial evaluation to enable verification of
                 concurrent software",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "22:1--22:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289143",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 22.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a22-dwyer/",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Leone:1998:DSF,
  author =       "Mark Leone and Peter Lee",
  title =        "Dynamic specialization in the {Fabius} system",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "23:1--23:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289144",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 23.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a23-leone/",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Waddell:1998:VPE,
  author =       "Oscar Waddell and R. Kent Dybvig",
  title =        "Visualizing partial evaluation",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "24:1--24:??",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/289121.289145",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:06:21 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article 24.",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/a24-waddell/",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Liou:1998:TIM,
  author =       "Yuan Chang Liou and Yih Nen Jeng",
  title =        "A transfinite interpolation method of grid generation
                 based on multipoints",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "3es",
  pages =        "105--113",
  month =        sep,
  year =         "1998",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jan 4 05:41:38 MST 1999",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-3es/p105-liou/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "performance",
  subject =      "{\bf G.1.1} Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Interpolation formulas. {\bf
                 G.1.8} Mathematics of Computing, NUMERICAL ANALYSIS,
                 Partial Differential Equations.",
}

@Article{Wegner:1998:AIb,
  author =       "Peter Wegner",
  title =        "About this issue\ldots{}",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "4",
  pages =        "411--411",
  month =        dec,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/299917.305493",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:07:07 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Agarwal:1998:EAG,
  author =       "Pankaj K. Agarwal and Micha Sharir",
  title =        "Efficient algorithms for geometric optimization",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "4",
  pages =        "412--458",
  month =        dec,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/299917.299918",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:07:07 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-4/p412-agarwal/",
  abstract =     "We review the recent progress in the design of
                 efficient algorithms for various problems in geometric
                 optimization. We present several techniques used to
                 attack these problems, such as parametric searching,
                 geometric alternatives to parametric searching,
                 prune-and-search techniques for linear programming and
                 related problems, and LP-type problems and their
                 efficient solution. We then describe a wide range of
                 applications of these and other techniques to numerous
                 problems in geometric optimization, including facility
                 location, proximity problems, statistical estimators
                 and metrology, placement and intersection of polygons
                 and polyhedra, and ray shooting and other query-type
                 problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; clustering; collision detection; design;
                 linear programming; matrix searching; parametric
                 searching; proximity problems; prune-and-search;
                 randomized algorithms",
  subject =      "{\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Geometrical problems and
                 computations. {\bf A.1} General Literature,
                 INTRODUCTORY AND SURVEY. {\bf I.1.2} Computing
                 Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
                 Algorithms, Analysis of algorithms.",
}

@Article{Wieringa:1998:SSO,
  author =       "Roel Wieringa",
  title =        "A survey of structured and object-oriented software
                 specification methods and techniques",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "4",
  pages =        "459--527",
  month =        dec,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/299917.299919",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:07:07 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-4/p459-wieringa/",
  abstract =     "This article surveys techniques used in structured and
                 object-oriented software specification methods. The
                 techniques are classified as techniques for the
                 specification of external interaction and internal
                 decomposition. The external specification techniques
                 are further subdivided into techniques for the
                 specification of functions, behavior, and
                 communication. After surveying the techniques, we
                 summarize the way they are used in structured and
                 object-oriented methods and indicate ways in which they
                 can be combined. This article ends with a plea for
                 simplicity in diagram techniques and for the use of
                 formal semantics to define these techniques. The
                 appendices show how the reviewed techniques are used in
                 6 structured and 19 object-oriented specification
                 methods.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design; languages",
  subject =      "{\bf D.2.1} Software, SOFTWARE ENGINEERING,
                 Requirements/Specifications, Tools. {\bf D.2.2}
                 Software, SOFTWARE ENGINEERING, Design Tools and
                 Techniques, Object-oriented design methods. {\bf D.2.2}
                 Software, SOFTWARE ENGINEERING, Design Tools and
                 Techniques, State diagrams.",
}

@Article{Crestani:1998:DRL,
  author =       "Fabio Crestani and Mounia Lalmas and Cornelis J. {Van
                 Rijsbergen} and Iain Campbell",
  title =        "{``Is} this document relevant? \ldots{} probably'': a
                 survey of probabilistic models in information
                 retrieval",
  journal =      j-COMP-SURV,
  volume =       "30",
  number =       "4",
  pages =        "528--552",
  month =        dec,
  year =         "1998",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/299917.299920",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:07:07 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/surveys/1998-30-4/p528-crestani/",
  abstract =     "This article surveys probabilistic approaches to
                 modeling information retrieval. The basic concepts of
                 probabilistic approaches to information retrieval are
                 outlined and the principles and assumptions upon which
                 the approaches are based are presented. The various
                 models proposed in the development of IR are described,
                 classified, and compared using a common formalism. New
                 approaches that constitute the basis of future research
                 are described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithms; information retrieval; probabilistic
                 indexing; probabilistic modeling; probabilistic
                 retrieval; theory; uncertain inference modeling",
  subject =      "{\bf H.3.3} Information Systems, INFORMATION STORAGE
                 AND RETRIEVAL, Information Search and Retrieval,
                 Retrieval models. {\bf H.3.1} Information Systems,
                 INFORMATION STORAGE AND RETRIEVAL, Content Analysis and
                 Indexing, Indexing methods.",
}

@Article{Gartner:1999:FFT,
  author =       "Felix C. G{\"a}rtner",
  title =        "Fundamentals of fault-tolerant distributed computing
                 in asynchronous environments",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "1",
  pages =        "1--26",
  month =        mar,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/311531.311532",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:07:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-1/p1-gartner/",
  abstract =     "Fault tolerance in distributed computing is a wide
                 area with a significant body of literature that is
                 vastly diverse in methodology and terminology. This
                 paper aims at structuring the area and thus guiding
                 readers into this interesting field. We use a formal
                 approach to define important terms like {\em fault},
                 {\em fault tolerance}, and {\em redundancy}. This leads
                 to four distinct forms of fault tolerance and to two
                 main phases in achieving them: {\em detection\/} and
                 {\em correction}. We show that this can help to reveal
                 inherently fundamental structures that contribute to
                 understanding and unifying methods and terminology. By
                 doing this, we survey many existing methodologies and
                 discuss their relations. The underlying system model is
                 the close-to-reality asynchronous message-passing model
                 of distributed computing.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Algorithms; Design; Reliability; Theory",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "agreement problem; algorithms; asynchronous system;
                 consensus problem; design; failure correction; failure
                 detection; fault models; fault tolerance; liveness;
                 message passing; possibility detection; predicate
                 detection; redundancy; reliability; safety; theory",
  subject =      "General Literature --- Introductory and Survey (A.1);
                 Computer Systems Organization --- Performance of
                 Systems (C.4): {\bf Modeling techniques}; Computer
                 Systems Organization --- Performance of Systems (C.4):
                 {\bf Reliability, availability, and serviceability}",
}

@Article{Liu:1999:DDL,
  author =       "Mengchi Liu",
  title =        "Deductive database languages: problems and solutions",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "1",
  pages =        "27--62",
  month =        mar,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/311531.311533",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:07:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-1/p27-liu/",
  abstract =     "Deductive databases result from the integration of
                 relational database and logic programming techniques.
                 However, significant problems remain inherent in this
                 simple synthesis from the language point of view. In
                 this paper, we discuss these problems from four
                 different aspects: complex values, object orientation,
                 higher-orderness, and updates. In each case, we examine
                 four typical languages that address the corresponding
                 issues.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Languages; Theory",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "complex object databases; deductive databases;
                 inheritance; logic programming; nested relational
                 databases; object-oriented databases",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Data description languages
                 (DDL)}; Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Data manipulation languages
                 (DML)}; Information Systems --- Database Management ---
                 Languages (H.2.3): {\bf Query languages}; Information
                 Systems --- Database Management --- Languages (H.2.3):
                 {\bf Database (persistent) programming languages};
                 Information Systems --- Database Management --- Logical
                 Design (H.2.1): {\bf Data models}; Information Systems
                 --- Database Management --- Logical Design (H.2.1):
                 {\bf Schema and subschema}; Computing Methodologies ---
                 Artificial Intelligence --- Deduction and Theorem
                 Proving (I.2.3): {\bf Deduction}; Computing
                 Methodologies --- Artificial Intelligence --- Deduction
                 and Theorem Proving (I.2.3): {\bf Logic programming};
                 Computing Methodologies --- Artificial Intelligence ---
                 Deduction and Theorem Proving (I.2.3): {\bf
                 Nonmonotonic reasoning and belief revision}; Computing
                 Methodologies --- Artificial Intelligence --- Knowledge
                 Representation Formalisms and Methods (I.2.4): {\bf
                 Representation languages}; Software --- Programming
                 Techniques --- Object-oriented Programming (D.1.5);
                 Software --- Programming Languages --- Language
                 Classifications (D.3.2); Theory of Computation ---
                 Mathematical Logic and Formal Languages ---
                 Mathematical Logic (F.4.1): {\bf Logic and constraint
                 programming}; Software --- Programming Techniques ---
                 Logic Programming (D.1.6)",
}

@Article{Paton:1999:ADS,
  author =       "Norman W. Paton and Oscar D{\'\i}az",
  title =        "Active database systems",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "1",
  pages =        "63--103",
  month =        mar,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/311531.311623",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:07:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-1/p63-paton/",
  abstract =     "Active database systems support mechanisms that enable
                 them to respond automatically to events that are taking
                 place either inside or outside the database system
                 itself. Considerable effort has been directed towards
                 improving understanding of such systems in recent
                 years, and many different proposals have been made and
                 applications suggested. This high level of activity has
                 not yielded a single agreed-upon standard approach to
                 the integration of active functionality with
                 conventional database systems, but has led to improved
                 understanding of active behavior description languages,
                 execution models, and architectures. This survey
                 presents the fundamental characteristics of active
                 database systems, describes a collection of
                 representative systems within a common framework,
                 considers the consequences for implementations of
                 certain design decisions, and discusses tools for
                 developing active applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Languages",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "active databases; events; object-oriented databases;
                 relational databases",
  subject =      "Information Systems --- Database Management ---
                 Languages (H.2.3)",
}

@Article{Mills:1999:IESa,
  author =       "Kevin L. Mills",
  title =        "Introduction to the {Electronic Symposium on
                 Computer-Supported Cooperative Work}",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2",
  pages =        "105--115",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/319806.319810",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:02 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2/p105-mills/p105-mills.pdf;
                 http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a1-mills/a1-mills.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2/p105-mills/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2/p105-mills/#abstract;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2/p105-mills/#indterms;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a1-mills/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a1-mills/#abstract",
  abstract =     "Computer-supported cooperative work (CSCW) holds great
                 importance and promise for modern society. This paper
                 provides an overview of seventeen papers comprising a
                 symposium on CSCW. The overview also discusses some
                 relationships among the contributions made by each
                 paper, and places those contributions into a larger
                 context by identifying some of the key challenges faced
                 by computer science researchers who aim to help us work
                 effectively as teams mediated through networks of
                 computers. The paper also describes why the promise of
                 CSCW holds particular salience for the U.S. military.
                 In the context of a military setting, the paper
                 describes five particular challenges for CSCW
                 researchers. While most of these challenges might seem
                 specific to military environments, many others probably
                 already face similar challenges, or soon will, when
                 attempting to collaborate through networks of
                 computers. To support this claim, the paper includes a
                 military scenario that might hit fairly close to home
                 for many, and certainly for civilian emergency response
                 personnel. After discussing the military needs for
                 collaboration technology, the paper briefly outlines
                 for motivation for a recent DARPA research program
                 along these lines. That program, called Intelligent
                 Collaboration and Visualization, sponsored the work
                 reported in this symposium.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "asynchronous collaboration; computer-supported
                 collaborative work; human-computer interaction;
                 information management; multimedia collaboration;
                 multimodal collaboration",
  subject =      "Information Systems --- Information Interfaces and
                 Presentation --- Group and Organization Interfaces
                 (H.5.3): {\bf Computer-supported cooperative work};
                 Computer Applications --- Administrative Data
                 Processing (J.1): {\bf Military}",
}

@Article{Anonymous:1999:TCE,
  author =       "Anonymous",
  title =        "Table of Contents: Electronic Symposium on
                 Computer-Supported Cooperative Work",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2",
  pages =        "116--116",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 05 06:17:51 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "These articles are only available electronically, and
                 are cited as volume 31, number 2es.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jing:1999:CSC,
  author =       "Jin Jing and Abdelsalam Sumi Helal and Ahmed
                 Elmagarmid",
  title =        "Client-server computing in mobile environments",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2",
  pages =        "117--157",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/319806.319814",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:02 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2/p117-jing/p117-jing.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2/p117-jing/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2/p117-jing/#abstract;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2/p117-jing/#indterms",
  abstract =     "Recent advances in wireless data networking and
                 portable information appliances have engendered a new
                 paradigm of computing, called {\em mobile computing},
                 in which users carrying portable devices have access to
                 data and information services regardless of their
                 physical location or movement behavior. In the
                 meantime, research addressing information access in
                 mobile environments has proliferated. In this survey,
                 we provide a concrete framework and categorization of
                 the various ways of supporting mobile client-server
                 computing for information access. We examine
                 characteristics of mobility that distinguish mobile
                 client-server computing from its traditional
                 counterpart. We provide a comprehensive analysis of new
                 paradigms and enabler concepts for mobile client-server
                 computing, including mobile-aware adaptation, extended
                 client-server model, and mobile data access. A
                 comparative and detailed review of major research
                 prototypes for mobile information access is also
                 presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Algorithms; Design; Experimentation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "application adaptation; cache invalidation; caching;
                 client/server; data dissemination; disconnected
                 operation; mobile applications; mobile client/server;
                 mobile computing; mobile data; mobility awareness;
                 survey; system application",
  subject =      "Computer Systems Organization ---
                 Computer-Communication Networks --- Distributed Systems
                 (C.2.4): {\bf Client/server}; Computer Systems
                 Organization --- Computer-Communication Networks ---
                 Distributed Systems (C.2.4); Computer Systems
                 Organization --- Computer-Communication Networks ---
                 Network Architecture and Design (C.2.1): {\bf Wireless
                 communication}",
}

%%% ====================================================================
%%% Volume 31, number 2es is an electronic supplement that is published
%%% online at the indicated URLs; the table of contents entries in
%%% number 1 lists these short articles, but the paper issue of the
%%% journal itself does not contain them.  They have no assigned page
%%% numbers, so they are listed in citation label order here.
%%% ====================================================================
@Article{Salzberg:1999:CAM,
  author =       "Betty Salzberg and Vassilis J. Tsotras",
  title =        "Comparison of access methods for time-evolving data",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2",
  pages =        "158--221",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/319806.319816",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:02 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2/p158-salzberg/p158-salzberg.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2/p158-salzberg/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2/p158-salzberg/#abstract;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2/p158-salzberg/#indterms",
  abstract =     "This paper compares different indexing techniques
                 proposed for supporting efficient access to temporal
                 data. The comparison is based on a collection of
                 important performance criteria, including the space
                 consumed, update processing, and query time for
                 representative queries. The comparison is based on
                 worst-case analysis, hence no assumptions on data
                 distribution or query frequencies are made. When a
                 number of methods have the same asymptotic worst-case
                 behavior, features in the methods that affect average
                 case behavior are discussed. Additional criteria
                 examined are the pagination of an index, the ability to
                 cluster related data together, and the ability to
                 efficiently separate old from current data (so that
                 larger archival storage media such as write-once
                 optical disks can be used). The purpose of the paper is
                 to identify the difficult problems in accessing
                 temporal data and describe how the different methods
                 aim to solve them. A general lower bound for answering
                 basic temporal queries is also introduced.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Management; Performance",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "access methods; I/O performance; structures; temporal
                 databases",
  subject =      "Information Systems --- Database Management ---
                 Physical Design (H.2.2): {\bf Access methods};
                 Information Systems --- Information Storage and
                 Retrieval --- Content Analysis and Indexing (H.3.1):
                 {\bf Indexing methods}",
}

@Article{Mills:1999:IESb,
  author =       "Kevin L. Mills",
  title =        "Introduction to the {Electronic Symposium} on
                 {Computer-Supported Cooperative Work}",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "1:1--1:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/319806.319810",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Computer-supported cooperative work (CSCW) holds great
                 importance and promise for modern society. This paper
                 provides an overview of seventeen papers comprising a
                 symposium on CSCW. The overview also discusses some
                 relationships among the contributions made by each
                 paper, and places those contributions into a larger
                 context by identifying some of the key challenges faced
                 by computer science researchers who aim to help us work
                 effectively as teams mediated through networks of
                 computers. The paper also describes why the promise of
                 CSCW holds particular salience for the U.S. military.
                 In the context of a military setting, the paper
                 describes five particular challenges for CSCW
                 researchers. While most of these challenges might seem
                 specific to military environments, many others probably
                 already face similar challenges, or soon will, when
                 attempting to collaborate through networks of
                 computers. To support this claim, the paper includes a
                 military scenario that might hit fairly close to home
                 for many, and certainly for civilian emergency response
                 personnel. After discussing the military needs for
                 collaboration technology, the paper briefly outlines
                 for motivation for a recent DARPA research program
                 along these lines. That program, called Intelligent
                 Collaboration and Visualization, sponsored the work
                 reported in this symposium.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "asynchronous collaboration; computer-supported
                 collaborative work; human-computer interaction;
                 information management; multimedia collaboration;
                 multimodal collaboration",
}

@Article{McCanne:1999:MES,
  author =       "Steven McCanne and Eric Brewer and Randy Katz and Elan
                 Amir and Yatin Chawathe and Todd Hodes and Ketan
                 Mayer-Patel and Suchitra Raman and Cynthia Romer and
                 Angela Schuett and Andrew Swan and Teck-Lee Tung and
                 Tina Wong and Kristin Wright",
  title =        "{MASH}: enabling scalable multipoint collaboration",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "2:1--2:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/319806.319814",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a2-mccanne/a2-mccanne.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a2-mccanne/",
  abstract =     "Recent advances in wireless data networking and
                 portable information appliances have engendered a new
                 paradigm of computing, called mobile computing, in
                 which users carrying portable devices have access to
                 data and information services regardless of their
                 physical location or movement behavior. In the
                 meantime, research addressing information access in
                 mobile environments has proliferated. In this survey,
                 we provide a concrete framework and categorization of
                 the various ways of supporting mobile client-server
                 computing for information access. We examine
                 characteristics of mobility that distinguish mobile
                 client-server computing from its traditional
                 counterpart. We provide a comprehensive analysis of new
                 paradigms and enabler concepts for mobile client-server
                 computing, including mobile-aware adaptation, extended
                 client-server model, and mobile data access. A
                 comparative and detailed review of major research
                 prototypes for mobile information access is also
                 presented.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "application adaptation; cache invalidation; caching;
                 client/server; data dissemination; disconnected
                 operation; mobile applications; mobile client/server;
                 mobile computing; mobile data; mobility awareness;
                 survey; system application",
}

@Article{Dao:1999:SMI,
  author =       "Son Dao and Eddie Shek and Asha Vellaikal and Richard
                 R. Muntz and Lixia Zhang and Miodrag Potkonjak and Ouri
                 Wolfson",
  title =        "Semantic multicast: intelligently sharing
                 collaborative sessions",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "3:1--3:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323221",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a3-dao/a3-dao.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a3-dao/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a3-dao/#abstract;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a3-dao/#indterms",
  abstract =     "We introduce the concept of semantic multicast to
                 implement a large-scale shared interaction
                 infrastructure providing mechanisms for collecting,
                 indexing, and disseminating the information produced in
                 collaborative sessions. This infrastructure captures
                 the interactions between users (as video, text, audio
                 and other data streams) and promotes a philosophy of
                 filtering, archiving, and correlating collaborative
                 sessions in user and context sensitive groupings. The
                 semantic multicast service efficiently disseminates
                 relevant information to every user engaged in the
                 collaborative session, making the aggregated streams of
                 the collaborative session available to the correct
                 users at the right amount of detail. This contextual
                 focus is accomplished by introducing proxy servers to
                 gather, annotate, and filter the streams appropriate
                 for specific interest groups. Users are subscribed to
                 appropriate proxies, based on their profiles, and the
                 collaborative session becomes a multi-level multicast
                 of data from sources through proxies and to user
                 interest groups.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "access methods; I/O performance; structures; temporal
                 databases",
  subject =      "Categories and Subject Descriptors: Information
                 Systems --- Information Storage and Retrieval (H.3);
                 Information Systems --- Information Storage and
                 Retrieval --- Content Analysis and Indexing (H.3.1):
                 Abstracting methods; Information Systems ---
                 Information Storage and Retrieval --- Content Analysis
                 and Indexing (H.3.1): Indexing methods; Information
                 Systems --- Information Storage and Retrieval ---
                 Information Search and Retrieval (H.3.3): Clustering;
                 Information Systems --- Information Storage and
                 Retrieval --- Information Search and Retrieval (H.3.3):
                 Information filtering; Information Systems ---
                 Information Storage and Retrieval --- Information
                 Search and Retrieval (H.3.3): Relevance feedback;
                 Information Systems --- Information Storage and
                 Retrieval --- Systems and Software (H.3.4): Distributed
                 systems; Information Systems --- Information Storage
                 and Retrieval --- Systems and Software (H.3.4): User
                 profiles and alert services",
}

@Article{Marsic:1999:DFM,
  author =       "Ivan Marsic",
  title =        "{DISCIPLE}: a framework for multimodal collaboration
                 in heterogeneous environments",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "4:1--4:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323225",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a4-marsic/a4-marsic.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a4-marsic/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a4-marsic/#abstract;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a4-marsic/#indterms",
  abstract =     "This paper presents a framework for sharing JavaBeans
                 applications in real-time synchronous collaboration. A
                 generic collaboration bus provides a plug-and-play
                 environment that enables collaboration with
                 applications that may or may not be collaboration
                 aware. Research on knowledge-based quality-of-service
                 management and multimodel human/machine interface is
                 described.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "CSCW frameworks; group communication; JavaBeans;
                 multimodal interface; shared electronic workspaces;
                 synchronous groupware",
  subject =      "Information Systems --- Information Interfaces and
                 Presentation --- User Interfaces (H.5.2); Information
                 Systems --- Information Interfaces and Presentation ---
                 Group and Organization Interfaces (H.5.3); Software ---
                 Software Engineering --- Design Tools and Techniques
                 (D.2.2); Computer Systems Organization ---
                 Computer-Communication Networks --- Distributed Systems
                 (C.2.4); General Terms: Design, Human Factors",
}

@Article{Reed:1999:OVC,
  author =       "Daniel A. Reed and Simon M. Kaplan",
  title =        "{Orbit\slash Virtue}: collaboration and visualization
                 toolkits",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "5:1--5:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323226",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a5-reed/a5-reed.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a5-reed/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a5-reed/#indterms",
  abstract =     "In distributed collaborative virtual environments,
                 participants are often embodied or represented in some
                 form within a virtual world. The representations take
                 many different forms and are often driven by
                 limitations in the available technology. Desktop Web
                 based environments typically use textual or two
                 dimensional representations, while high end
                 environments use motion trackers to embody a
                 participant and their actions in an avatar or human
                 form. This paper describes this wide range of virtual
                 user representations and their creation and performance
                 issues investigated as part of the Human-Computer
                 Symbiotes project within DARPA's Intelligent
                 Collaboration and Visualization (IC and V) program.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Martin:1999:CPA,
  author =       "Kevin Martin",
  title =        "Creation and performance analysis of user
                 representations in collaborative virtual environments",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "6:1--6:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323227",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a6-martin/a6-martin.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a6-martin/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a6-martin/#abstract",
  abstract =     "In distributed collaborative virtual environments,
                 participants are often embodied or represented in some
                 form within a virtual world. The representations take
                 many different forms and are often driven by
                 limitations in the available technology. Desktop Web
                 based environments typically use textual or two
                 dimensional representations, while high end
                 environments use motion trackers to embody a
                 participant and their actions in an avatar or human
                 form. This paper describes this wide range of virtual
                 user representations and their creation and performance
                 issues investigated as part of the Human-Computer
                 Symbiotes project within DARPA's Intelligent
                 Collaboration and Visualization (IC\&V) program.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kubala:1999:RMR,
  author =       "Francis Kubala and Sean Colbath and Daben Liu and John
                 Makhoul",
  title =        "{Rough'n'Ready}: a meeting recorder and browser",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "7:1--7:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323354",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a7-kubala/a7-kubala.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a7-kubala/",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Payton:1999:DCD,
  author =       "David Payton and Mike Daily and Kevin Martin",
  title =        "Dynamic collaborator discovery in information
                 intensive environments",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "8:1--8:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323355",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a8-payton/a8-payton.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a8-payton/",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wactlar:1999:IED,
  author =       "Howard D. Wactlar and Michael G. Christel and
                 Alexander G. Hauptmann and Yihong Gong",
  title =        "{Informedia Experience-on-Demand}: capturing,
                 integrating and communicating experiences across
                 people, time and space",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "9:1--9:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323356",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a9-wactlar/a9-wactlar.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a9-wactlar/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a9-wactlar/#abstract",
  abstract =     "The Informedia Experience-on-Demand system uses
                 speech, image, and natural language processing combined
                 with GPS information to capture, integrate, and
                 communicate personal multimedia experiences. This paper
                 discusses in initial prototype of the EOD system.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "audio; multimedia information systems; video and
                 location content analysis",
}

@Article{Wolverton:1999:TBI,
  author =       "Michael Wolverton",
  title =        "Task-based information management",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "10:1--10:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323357",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a10-wolverton/a10-wolverton.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a10-wolverton/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a10-wolverton/#abstract",
  abstract =     "Effective collaboration in fast-changing environment
                 can put great demands on a collaborator's time.
                 Therefore, information retrieval and filtering tools
                 for these environments should impose as little on that
                 time as possible. Not only should they exclude as many
                 irrelevant documents as possible from those presented
                 to the user (to avoid the time wasted sorting through
                 and reading those documents), they should also minimize
                 the user's effort in characterizing his or her
                 information needs. The goal of the Task-based
                 Information Distribution Environment (TIDE) system is
                 to achieve these objectives by explicitly representing
                 each collaborator's current task and using those
                 representations to deliver documents that meet the
                 information needs implied by those tasks. It does this
                 by treating information gathering as a diagnosis
                 problem, in which the situation (i.e., the current
                 state of beliefs about various questions related to a
                 task) leads probabilistically to test that will provide
                 the most evidence toward reaching a diagnosis (i.e., a
                 description of the documents most likely to be useful
                 to that task). It encodes tasks as nodes in a Bayesian
                 network, and computes document descriptions based on
                 the probabilistic relationship among tasks and their
                 corresponding information requirements.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Morris:1999:IIC,
  author =       "James H. Morris and Christine M. Neuwirth and Susan
                 Harkness Regli and Ravinder Chandhok and Geoffrey C.
                 Wenger",
  title =        "Interface issues in computer support for asynchronous
                 communication",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "11:1--11:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323358",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a11-morris/a11-morris.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a11-morris/",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jackson:1999:ISA,
  author =       "Larry S. Jackson and Ed Grossman",
  title =        "Integration of synchronous and asynchronous
                 collaboration activities",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "12:1--12:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323359",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a12-jackson/a12-jackson.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a12-jackson/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a12-jackson/#abstract",
  abstract =     "The integrated synchronous and asynchronous
                 collaboration (ISAAC) project [1] is constructing a
                 communication and collaboration system to bridge
                 traditional workgroup barriers of time and space.
                 Possible applications include military command and
                 control, corporate real-time collaboration, and
                 distributed teams of research scientists. Thus, this
                 system must host the widest possible range of
                 applications, and must run on heterogeneous hardware.
                 ISAAC incorporates real-time (synchronous)
                 collaboration technologies developed by the
                 Habanero{\reg} project [2,3] at the National Center for
                 Supercomputing Applications at the University of
                 Illinois Urbana-Champaign, with asynchronous
                 extensions. ISAAC research is aimed at moving
                 information between synchronous and asynchronous modes.
                 ISAAC's session capture conceptually transforms a
                 real-time multiple tool collaboration into multimedia
                 document, which can be analyzed and reused by other
                 programs. Automated segmentation and indexing of
                 captured audio and videoteleconference traffic adds
                 further information.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rees:1999:CMD,
  author =       "Jonathan Rees and Sarah Ferguson and Sankar
                 Virdhagriswaran",
  title =        "Consistency management for distributed collaboration",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "13:1--13:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323360",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a13-rees/a13-rees.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a13-rees/",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Thompson:1999:IAI,
  author =       "Craig Thompson and Paul Pazandak and Venu Vasudevan
                 and Frank Manola and Mark Palmer and Gil Hansen and Tom
                 Bannon",
  title =        "Intermediary Architecture: {Interposing} middleware
                 object services between {Web} client and server",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "14:1--14:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323361",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a14-thompson/a14-thompson.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a14-thompson/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a14-thompson/#abstract;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a14-thompson/#indterms",
  abstract =     "This paper describes the Intermediary Architecture, a
                 middleware architecture which interposes distributed
                 object services between Web client and server. The
                 architecture extends current Web architectures with a
                 new kind of plug-in, making a new collection of Web
                 applications easier to develop. Example services
                 including Web annotations and Web performance
                 monitoring are described.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "annotations; distributed objects; object request
                 brokers; World Wide Web",
  subject =      "Information Systems --- Information Storage and
                 Retrieval --- Systems and Software (H.3.4): Information
                 networks",
}

@Article{Damianos:1999:ECS,
  author =       "Laurie Damianos and Lynette Hirschman and Robyn
                 Kozierok and Jeffrey Kurtz and Andrew Greenberg and
                 Kimberley Walls and Sharon Laskowski and Jean Scholtz",
  title =        "Evaluation for collaborative systems",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "15:1--15:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323362",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a15-damianos/a15-damianos.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a15-damianos/",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ranganathan:1999:RCD,
  author =       "M. Ranganathan and Laurent Andrey and Virginie Schaal
                 and Jean-Philippe Favreau",
  title =        "Re-configurable distributed scripting",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "16:1--16:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323363",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a16-ranganathan/a16-ranganathan.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a16-ranganathan/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a16-ranganathan/#abstract",
  abstract =     "Several distributed testing, control and collaborative
                 applications are reactive or event driven in nature.
                 Such applications can be structured as a set of
                 handlers that react to events and that in turn can
                 trigger other events. We have developed an application
                 building toolkit that facilitates development of such
                 applications. Our system is based on the concept of
                 Mobile Streams. Applications developed in our system
                 are dynamically extensible and re-configurable and our
                 system provides the application designer a mechanism to
                 control extension and re-configuration. We describe our
                 system model and give examples of its use.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bayer:1999:MMM,
  author =       "Samuel Bayer and Laurie E. Damianos and Robyn Kozierok
                 and James Mokwa",
  title =        "The {MITRE Multi-Modal Logger}: its use in evaluation
                 of collaborative systems",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "17:1--17:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323364",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a17-bayer/a17-bayer.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a17-bayer/",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kurtz:1999:MMN,
  author =       "Jeffrey L. Kurtz and Laurie E. Damianos and Robyn
                 Kozierok and Lynette Hirschman",
  title =        "The {MITRE} map navigation experiment",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "2es",
  pages =        "18:1--18:??",
  month =        jun,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/323216.323365",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-2es/a18-kurtz/a18-kurtz.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-2es/a18-kurtz/",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Degano:1999:CSEa,
  author =       "P. Degano and R. Gorrieri and A. Marchetti-Spaccamela
                 and P. Wegner",
  title =        "{Computing Surveys' Electronic Symposium on the Theory
                 of Computation}",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3",
  pages =        "223--225",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/331499.382387",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:57 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a1-degano/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Anonymous:1999:STC,
  author =       "Anonymous",
  title =        "Symposium on the Theory of Computation: Table of
                 Contents",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3",
  pages =        "226--226",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 28 17:54:34 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/contents/journals/surveys/1999-31",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fraternali:1999:TAD,
  author =       "Piero Fraternali",
  title =        "Tools and approaches for developing data-intensive
                 {Web} applications: a survey",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3",
  pages =        "227--263",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/331499.331502",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:57 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-3/p227-fraternali/p227-fraternali.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-3/p227-fraternali/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-3/p227-fraternali/#indterms",
  abstract =     "The exponential growth and capillar diffusion of the
                 Web are nurturing a novel generation of applications,
                 characterized by a direct business-to-customer
                 relationship. The development of such applications is a
                 hybrid between traditional IS development and
                 Hypermedia authoring, and challenges the existing tools
                 and approaches for software production. This paper
                 investigates the current situation of Web development
                 tools, both in the commercial and research fields, by
                 identifying and characterizing different categories of
                 solutions, evaluating their adequacy to the
                 requirements of Web application development,
                 enlightening open problems, and exposing possible
                 future trends.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Design; Experimentation; Languages; Reliability",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "application; development; HTML; Intranet; WWW",
  subject =      "Information Systems --- Information Interfaces and
                 Presentation --- Hypertext/Hypermedia (H.5.4); Software
                 --- Software Engineering --- Design Tools and
                 Techniques (D.2.2); General Terms: Design,
                 Experimentation, Languages, Reliability",
}

%%% ====================================================================
%%% Volume 31, number 3es is an electronic supplement that is published
%%% online at the indicated URLs; the table of contents entries in
%%% number 3 lists these short articles, but the paper issue of the
%%% journal itself does not contain them.  They have no assigned page
%%% numbers, so they are listed in table-of-contents order here.
%%% ====================================================================
@Article{Jain:1999:DCR,
  author =       "A. K. Jain and M. N. Murty and P. J. Flynn",
  title =        "Data clustering: a review",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3",
  pages =        "264--323",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/331499.331504",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:08:57 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-3/p264-jain/p264-jain.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-3/p264-jain/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-3/p264-jain/#indterms",
  abstract =     "Clustering is the unsupervised classification of
                 patterns (observations, data items, or feature vectors)
                 into groups (clusters). The clustering problem has been
                 addressed in many contexts and by researchers in many
                 disciplines; this reflects its broad appeal and
                 usefulness as one of the steps in exploratory data
                 analysis. However, clustering is a difficult problem
                 combinatorially, and differences in assumptions and
                 contexts in different communities has made the transfer
                 of useful generic concepts and methodologies slow to
                 occur. This paper presents an overview of pattern
                 clustering methods from a statistical pattern
                 recognition perspective, with a goal of providing
                 useful advice and references to fundamental concepts
                 accessible to the broad community of clustering
                 practitioners. We present a taxonomy of clustering
                 techniques, and identify cross-cutting themes and
                 recent advances. We also describe some important
                 applications of clustering algorithms such as image
                 segmentation, object recognition, and information
                 retrieval.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Algorithms",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "cluster analysis; clustering applications; exploratory
                 data analysis; incremental clustering; similarity
                 indices; unsupervised learning",
  subject =      "Computing Methodologies --- Pattern Recognition ---
                 Models (I.5.1); Computing Methodologies --- Pattern
                 Recognition --- Clustering (I.5.3); Computing
                 Methodologies --- Pattern Recognition --- Applications
                 (I.5.4): {\bf Computer vision}; Information Systems ---
                 Information Storage and Retrieval --- Information
                 Search and Retrieval (H.3.3): {\bf Clustering};
                 Computing Methodologies --- Artificial Intelligence ---
                 Learning (I.2.6): {\bf Knowledge acquisition}",
}

@Article{Degano:1999:CSEb,
  author =       "P. Degano and R. Gorrieri and A. Marchetti-Spaccamela
                 and P. Wegner",
  title =        "Computing surveys' electronic symposium on the theory
                 of computation",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "1:1--1:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/331499.382387",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Noltemeier:1999:NDI,
  author =       "H. Noltemeier and H.-C. Wirth and S. O. Krumke",
  title =        "Network design and improvement",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "2:1--2:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/331499.331502",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The exponential growth and capillar diffusion of the
                 Web are nurturing a novel generation of applications,
                 characterized by a direct business-to-customer
                 relationship. The development of such applications is a
                 hybrid between traditional IS development and
                 Hypermedia authoring, and challenges the existing tools
                 and approaches for software production. This paper
                 investigates the current situation of Web development
                 tools, both in the commercial and research fields, by
                 identifying and characterizing different categories of
                 solutions, evaluating their adequacy to the
                 requirements of Web application development,
                 enlightening open problems, and exposing possible
                 future trends.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "application; development; HTML; Intranet; WWW",
}

@Article{Cattaneo:1999:AE,
  author =       "Giuseppe Cattaneo and Giuseppe Italiano",
  title =        "Algorithm engineering",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "3:1--3:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/331499.331504",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a3-cattaneo/",
  abstract =     "Clustering is the unsupervised classification of
                 patterns (observations, data items, or feature vectors)
                 into groups (clusters). The clustering problem has been
                 addressed in many contexts and by researchers in many
                 disciplines; this reflects its broad appeal and
                 usefulness as one of the steps in exploratory data
                 analysis. However, clustering is a difficult problem
                 combinatorially, and differences in assumptions and
                 contexts in different communities has made the transfer
                 of useful generic concepts and methodologies slow to
                 occur. This paper presents an overview of pattern
                 clustering methods from a statistical pattern
                 recognition perspective, with a goal of providing
                 useful advice and references to fundamental concepts
                 accessible to the broad community of clustering
                 practitioners. We present a taxonomy of clustering
                 techniques, and identify cross-cutting themes and
                 recent advances. We also describe some important
                 applications of clustering algorithms such as image
                 segmentation, object recognition, and information
                 retrieval.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "cluster analysis; clustering applications; exploratory
                 data analysis; incremental clustering; similarity
                 indices; unsupervised learning",
}

@Article{Albers:1999:LA,
  author =       "Susanne Albers and Stefano Leonardi",
  title =        "On-line algorithms",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "4:1--4:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333583",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a4-albers/",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hankin:1999:PAG,
  author =       "Chris Hankin and Pasquale Malacaria",
  title =        "Program analysis games",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "5:1--5:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333584",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a5-hankin/",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cousot:1999:DRA,
  author =       "Patric Cousot",
  title =        "Directions for research in approximate system
                 analysis",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "6:1--6:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333585",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a6-cousot/",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bernardo:1999:LEP,
  author =       "Marco Bernardo",
  title =        "Let's evaluate performance algebraically",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "7:1--7:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333586",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a7-bernardo/",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hromkovic:1999:SCS,
  author =       "Juraj Hromkovi{\v{c}}",
  title =        "Some contributions of the study of abstract
                 communication complexity to other areas of computer
                 science",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "8:1--8:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333587",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a8-hromkovic/",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ehrig:1999:GRG,
  author =       "Hartmut Ehrig and Gabriele Taentzer",
  title =        "Graphical representation and graph transformation",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "9:1--9:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333588",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a9-ehrig/",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sannella:1999:AMS,
  author =       "Donald Sannella and Andrzei Tarlecki",
  title =        "Algebraic methods for specification and formal
                 development of programs",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "10:1--10:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333589",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a10-sannella/",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Miller:1999:FAS,
  author =       "Dale Miller and Catuscia Palmidessi",
  title =        "Foundational aspects of syntax",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "11:1--11:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333590",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a11-miller/",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Giammarresi:1999:EFL,
  author =       "Dora Giammarresi and Antonio Restivo",
  title =        "Extending formal language hierarchies to higher
                 dimensions",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "12:1--12:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333591",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a12-giammarresi/",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Priami:1999:OMT,
  author =       "Corrado Priami",
  title =        "Operational methods in theoretical computer science",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "13:1--13:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333592",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a13-priami/",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Honda:1999:SSR,
  author =       "Kohei Honda",
  title =        "Semantics study and reality of computing",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "14:1--14:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333593",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a14-honda/",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Freivalds:1999:HSF,
  author =       "Rusins Freivalds",
  title =        "How to simulate free will in a computational device",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "15:1--15:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333594",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a15-freivalds/",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wiedermann:1999:SMG,
  author =       "Jiri Wiedermann",
  title =        "Simulating the mind: a gauntlet thrown to computer
                 science",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "3es",
  pages =        "16:1--16:??",
  month =        sep,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/333580.333595",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-3es/a16-wiedermann/",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ashman:1999:CSEa,
  author =       "Helen Ashman and Rosemary Michelle Simpson",
  title =        "{Computing Surveys' Electronic Symposium on Hypertext
                 and Hypermedia}: {Editorial}",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4",
  pages =        "325--334",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/344588.344596",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:50 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/1999-31-4es/a1-ashman/a1-ashman.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-4/p325-ashman/;
                 http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a1-ashman/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- General (I.2.0)",
}

@Article{Antoniou:1999:TDL,
  author =       "Grigoris Antoniou",
  title =        "A tutorial on default logics",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4",
  pages =        "337--359",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/344588.344602",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:50 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4/p337-antoniou/",
  abstract =     "Default logic is one of the most prominent approaches
                 to nonmonotonic reasoning, and allows one to make
                 plausible conjectures when faced with incomplete
                 information about the problem at hand. Default rules
                 prevail in many application domains such as medical and
                 legal reasoning.\par

                 Several variants have been developed over the past
                 year, either to overcome some perceived deficiencies of
                 the original presentation, or to realize somewhat
                 different intuitions. This paper provides a
                 tutorial-style introduction to some important
                 approaches of Default Logic. The presentation is based
                 on operational models for these approaches, thus making
                 them easily accessible to a broader audience, and more
                 easily usable in practical applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "default logic; nonmonotonic reasoning; operational
                 models",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- Deduction and Theorem Proving (I.2.3): {\bf
                 Nonmonotonic reasoning and belief revision}; Computing
                 Methodologies --- Artificial Intelligence --- Knowledge
                 Representation Formalisms and Methods (I.2.4): {\bf
                 Representation languages}",
}

@Article{Iren:1999:TLT,
  author =       "Sami Iren and Paul D. Amer and Phillip T. Conrad",
  title =        "The transport layer: tutorial and survey",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4",
  pages =        "360--404",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/344588.344609",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:50 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4/p360-iren/",
  abstract =     "Transport layer protocols provide for end-to-end
                 communication between two or more hosts. This paper
                 presents a tutorial on transport layer concepts and
                 terminology, and a survey of transport layer services
                 and protocols. The transport layer protocol TCP is used
                 as a reference point, and compared and contrasted with
                 nineteen other protocols designed over the past two
                 decades. The service and protocol features of twelve of
                 the most important protocols are summarized in both
                 text and tables.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "congestion control; flow control; TCP/IP networks;
                 transport protocol; transport service",
  subject =      "Computer Systems Organization ---
                 Computer-Communication Networks --- General (C.2.0):
                 {\bf Data communications}; Computer Systems
                 Organization --- Computer-Communication Networks ---
                 Network Architecture and Design (C.2.1): {\bf Network
                 communications}; Computer Systems Organization ---
                 Computer-Communication Networks --- Network
                 Architecture and Design (C.2.1): {\bf Packet-switching
                 networks}; Computer Systems Organization ---
                 Computer-Communication Networks --- Network
                 Architecture and Design (C.2.1): {\bf Store and forward
                 networks}; Computer Systems Organization ---
                 Computer-Communication Networks --- Network Protocols
                 (C.2.2): {\bf Protocol architecture}; Computer Systems
                 Organization --- Computer-Communication Networks ---
                 Local and Wide-Area Networks (C.2.5); Computer Systems
                 Organization --- Computer-Communication Networks ---
                 General (C.2.0): {\bf Open Systems Interconnection
                 reference model (OSI)}",
}

%%% ====================================================================
%%% Volume 31, number 4es is an electronic supplement that is published
%%% online at the indicated URLs; the table of contents entries in
%%% number 4 lists these short articles, but the paper issue of the
%%% journal itself does not contain them.  They have no assigned page
%%% numbers, so they are listed in table-of-contents order here.
%%% ====================================================================
@Article{Kwok:1999:SSA,
  author =       "Yu-Kwong Kwok and Ishfaq Ahmad",
  title =        "Static scheduling algorithms for allocating directed
                 task graphs to multiprocessors",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4",
  pages =        "406--471",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/344588.344618",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:09:50 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4/p406-kwok/",
  abstract =     "Static scheduling of a program represented by a
                 directed task graph on a multiprocessor system to
                 minimize the program completion time is a well-known
                 problem in parallel processing. Since finding an
                 optimal schedule is an NP-complete problem in general,
                 researchers have resorted to devising efficient
                 heuristics. A plethora of heuristics have been proposed
                 based on a wide spectrum of techniques, including
                 branch-and-bound, integer-programming, searching,
                 graph-theory, randomization, genetic algorithms, and
                 evolutionary methods. The objective of this survey is
                 to describe various scheduling algorithms and their
                 functionalities in a contrasting fashion as well as
                 examine their relative merits in terms of performance
                 and time-complexity. Since these algorithms are based
                 on diverse assumptions, they differ in their
                 functionalities, and hence are difficult to describe in
                 a unified context. We propose a taxonomy that
                 classifies these algorithms into different categories.
                 We consider 27 scheduling algorithms, with each
                 algorithm explained through an easy-to-understand
                 description followed by an illustrative example to
                 demonstrate its operation. We also outline some of the
                 novel and promising optimization approaches and current
                 research trends in the area. Finally, we give an
                 overview of the software tools that provide
                 scheduling/mapping functionalities.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "automatic parallelization; DAG; multiprocessors;
                 parallel processing; software tools; static scheduling;
                 task graphs",
  subject =      "Computer Systems Organization --- Processor
                 Architectures --- Multiple Data Stream Architectures
                 (Multiprocessors) (C.1.2): {\bf Parallel processors**};
                 Software --- Programming Techniques --- Concurrent
                 Programming (D.1.3): {\bf Parallel programming};
                 Software --- Operating Systems --- Process Management
                 (D.4.1): {\bf
                 Multiprocessing/multiprogramming/multitasking}; Theory
                 of Computation --- Computation by Abstract Devices ---
                 Modes of Computation (F.1.2): {\bf Parallelism and
                 concurrency}; Software --- Operating Systems ---
                 Process Management (D.4.1): {\bf Scheduling}",
}

@Article{Ashman:1999:CSEb,
  author =       "Helen Ashman and Rosemary Michelle Simpson",
  title =        "{Computing Surveys' Electronic Symposium on Hypertext
                 and Hypermedia}: {Editorial}",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "1:1--1:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/344588.344596",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wiil:1999:HRD,
  author =       "Uffe K. Wiil and Peter J. N{\"u}rnberg and John J.
                 Leggett",
  title =        "Hypermedia research directions: an infrastructure
                 perspective",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "2:1--2:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/344588.344602",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a2-wiil/",
  abstract =     "Default logic is one of the most prominent approaches
                 to nonmonotonic reasoning, and allows one to make
                 plausible conjectures when faced with incomplete
                 information about the problem at hand. Default rules
                 prevail in many application domains such as medical and
                 legal reasoning. Several variants have been developed
                 over the past year, either to overcome some perceived
                 deficiencies of the original presentation, or to
                 realize somewhat different intuitions. This paper
                 provides a tutorial-style introduction to some
                 important approaches of Default Logic. The presentation
                 is based on operational models for these approaches,
                 thus making them easily accessible to a broader
                 audience, and more easily usable in practical
                 applications.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "default logic; nonmonotonic reasoning; operational
                 models",
}

@Article{Treloar:1999:AHH,
  author =       "Andrew E. Treloar",
  title =        "Applying hypertext and hypermedia to scholarly
                 journals enables both product and process innovation",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "3:1--3:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/344588.344609",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a3-treloar/",
  abstract =     "Transport layer protocols provide for end-to-end
                 communication between two or more hosts. This paper
                 presents a tutorial on transport layer concepts and
                 terminology, and a survey of transport layer services
                 and protocols. The transport layer protocol TCP is used
                 as a reference point, and compared and contrasted with
                 nineteen other protocols designed over the past two
                 decades. The service and protocol features of twelve of
                 the most important protocols are summarized in both
                 text and tables.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "congestion control; flow control; TCP/IP networks;
                 transport protocol; transport service",
}

@Article{Tudhope:1999:SIH,
  author =       "Douglas Tudhope and Daniel Cunliffe",
  title =        "Semantically indexed hypermedia: linking information
                 disciplines",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "4:1--4:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/344588.344618",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a4-tudhope/",
  abstract =     "Static scheduling of a program represented by a
                 directed task graph on a multiprocessor system to
                 minimize the program completion time is a well-known
                 problem in parallel processing. Since finding an
                 optimal schedule is an NP-complete problem in general,
                 researchers have resorted to devising efficient
                 heuristics. A plethora of heuristics have been proposed
                 based on a wide spectrum of techniques, including
                 branch-and-bound, integer-programming, searching,
                 graph-theory, randomization, genetic algorithms, and
                 evolutionary methods. The objective of this survey is
                 to describe various scheduling algorithms and their
                 functionalities in a contrasting fashion as well as
                 examine their relative merits in terms of performance
                 and time-complexity. Since these algorithms are based
                 on diverse assumptions, they differ in their
                 functionalities, and hence are difficult to describe in
                 a unified context. We propose a taxonomy that
                 classifies these algorithms into different categories.
                 We consider 27 scheduling algorithms, with each
                 algorithm explained through an easy-to-understand
                 description followed by an illustrative example to
                 demonstrate its operation. We also outline some of the
                 novel and promising optimization approaches and current
                 research trends in the area. Finally, we give an
                 overview of the software tools that provide
                 scheduling/mapping functionalities.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "automatic parallelization; DAG; multiprocessors;
                 parallel processing; software tools; static scheduling;
                 task graphs",
}

@Article{Kleinberg:1999:HAC,
  author =       "Jon M. Kleinberg",
  title =        "Hubs, authorities, and communities",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "5:1--5:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.345982",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a5-kleinberg/",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "graph algorithms; hypertext structure; link analysis;
                 World Wide Web",
}

@Article{Mukherjea:1999:IVH,
  author =       "Sougata Mukherjea",
  title =        "Information visualization for hypermedia systems",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "6:1--6:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.345984",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a6-mukherjea/",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "focus+context views; information visualization",
}

@Article{Oinas-Kukkonen:1999:FCH,
  author =       "Harri Oinas-Kukkonen",
  title =        "Flexible {CASE} and hypertext",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "7:1--7:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.345985",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a7-oinas-kukkonen/",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer-aided software engineering; integrated
                 environments",
}

@Article{Rossi:1999:DHA,
  author =       "Gustavo Rossi and Fernando Daniel Lyardet and Daniel
                 Schwabe",
  title =        "Developing hypermedia applications with methods and
                 patterns",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "8:1--8:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.345987",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a8-rossi/",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Web information systems",
}

@Article{Carr:1999:EHL,
  author =       "Leslie Carr and Wendy Hall and David {De Roure}",
  title =        "The evolution of hypertext link services",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "9:1--9:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.345989",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a9-carr/",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "electronic publishing; link services; open hypermedia
                 systems",
}

@Article{Lewis:1999:SL,
  author =       "Paul H. Lewis and Wendy Hall and Leslie A. Carr and
                 David De Roure",
  title =        "The significance of linking",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "10:1--10:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.345992",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a10-lewis/",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "content-based navigation; semantics",
}

@Article{Reich:1999:WYB,
  author =       "Siegfried Reich and Leslie Carr and David {De Roure}
                 and Wendy Hall",
  title =        "Where have you been from here? {Trials} in hypertext
                 systems",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "11:1--11:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.345994",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a11-reich/",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "open hypermedia system; software agents; user trails",
}

@Article{DeBra:1999:AHS,
  author =       "Paul {De Bra} and Peter Brusilovsky and Geert-Jan
                 Houben",
  title =        "Adaptive hypermedia: from systems to framework",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "12:1--12:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.345996",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a12-de_bra/",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "adaptation; adaptive navigation support; hypermedia;
                 navigation adaptive presentation",
}

@Article{Li:1999:ICS,
  author =       "Wen-Syan Li and K. Sel{\c{c}}uk Candan",
  title =        "Integrating content search with structure analysis for
                 hypermedia retrieval and management",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "13:1--13:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.345999",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a13-li/",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "link analysis; organization; topic distillation",
}

@Article{Shipman:1999:SHA,
  author =       "Frank M. {Shipman, III} and Catherine C. Marshall",
  title =        "Spatial hypertext: an alternative to navigational and
                 semantic links",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "14:1--14:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346001",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a14-shipman/",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bodner:1999:DHQ,
  author =       "Richard Bodner and Mark Chignell",
  title =        "Dynamic hypertext: querying and linking",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "15:1--15:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346002",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a15-bodner/",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "dynamic linking; hypertext browsing; information
                 retrieval interface",
}

@Article{Kopak:1999:FLT,
  author =       "Richard W. Kopak",
  title =        "Functional link typing in hypertext",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "16:1--16:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346005",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a16-kopak/",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "electronic publishing; link taxonomies; link typing",
}

@Article{Chakrabarti:1999:RRA,
  author =       "Soumen Chakrabarti",
  title =        "Recent results in automatic {Web} resource discovery",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "17:1--17:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346007",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a17-chakrabarti/",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Furner:1999:ILC,
  author =       "Jonathan Furner and David Ellis and Peter Willett",
  title =        "Inter-linker consistency in the manual construction of
                 hypertext documents",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "18:1--18:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346008",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a18-furner/",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "graph theory; inter-indexer consistency; link
                 creation; similarity; topological indices",
}

@Article{Bernstein:1999:SPH,
  author =       "Mark Bernstein",
  title =        "Structural patterns and hypertext rhetoric",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "19:1--19:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346011",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a19-bernstein/",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "criticism; design; fiction; hypertext structure;
                 pattern languages; patterns; rhetoric",
}

@Article{Anderson:1999:SSE,
  author =       "Kenneth M. Anderson",
  title =        "Supporting software engineering with open hypermedia",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "20:1--20:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346013",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a20-anderson/",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "case study; open hypermedia; software engineering",
}

@Article{DeRose:1999:XL,
  author =       "Steven J. DeRose",
  title =        "{XML} linking",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "21:1--21:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346015",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a21-derose/",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Green:1999:LSA,
  author =       "Stephen J. Green",
  title =        "Lexical semantics and automatic hypertext
                 construction",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "22:1--22:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346016",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a22-green/",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "automatic hypertext construction; lexical semantics",
}

@Article{Hardman:1999:HLT,
  author =       "Lynda Hardman and Jacco van Ossenbruggen and Lloyd
                 Rutledge and Dick C. A. Bulterman",
  title =        "Hypermedia: the link with time",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "23:1--23:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346018",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a23-hardman/",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "document models; multimedia; W3C recommendations",
}

@Article{Vitali:1999:VH,
  author =       "Fabio Vitali",
  title =        "Versioning hypermedia",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "24:1--24:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346019",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a24-vitali/",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Benford:1999:TDV,
  author =       "Steve Benford and Ian Taylor and David Brailsford and
                 Boriana Koleva and Mike Craven and Mike Fraser and Gail
                 Reynard and Chris Greenhalgh",
  title =        "Three dimensional visualization of the {World Wide
                 Web}",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "25:1--25:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346021",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a25-benford/",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Quentin-Baxter:1999:QED,
  author =       "Megan Quentin-Baxter",
  title =        "Quantitative evidence for differences between learners
                 making use of passive hypermedia learning
                 environments",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "26:1--26:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346022",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a26-quentin-baxter/",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "evaluation; hypermedia; hypertext; learning style;
                 quantitative",
}

@Article{Wilkinson:1999:ALG,
  author =       "Ross Wilkinson and Alan F. Smeaton",
  title =        "Automatic link generation",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "27:1--27:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346024",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a27-wilkinson/",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Davis:1999:HLI,
  author =       "Hugh C. Davis",
  title =        "Hypertext link integrity",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "28:1--28:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346026",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a28-davis/",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "broken links; content reference problem; dangling
                 links; link integrity",
}

@Article{Bieber:1999:HDP,
  author =       "Michael Bieber and Joonhee Yoo",
  title =        "Hypermedia: a design philosophy",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "29:1--29:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346028",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a29-bieber/",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "hypermedia; hypertext; links; navigation; relationship
                 analysis; relationship taxonomy",
}

@Article{Brailsford:1999:SHD,
  author =       "David F. Brailsford",
  title =        "Separable hyperstructure and delayed link binding",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "30:1--30:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346029",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a30-brailsford/",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Vitali:1999:HWW,
  author =       "Fabio Vitali and Michael Bieber",
  title =        "Hypermedia on the {Web}: what will it take?",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "31:1--31:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346030",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a31-vitali/",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "browsers; hypermedia; hypertext; hypertext
                 functionality; link attributes; linkbases; World Wide
                 Web",
}

@Article{Bieber:1999:HF,
  author =       "Michael Bieber and Harri Oinas-Kukkonen and V.
                 Balasubramanian",
  title =        "Hypertext functionality",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "32:1--32:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346032",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a32-bieber/",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "added value; analysis; hypertext functionality",
}

@Article{Nelson:1999:XSN,
  author =       "Theodor Holm Nelson",
  title =        "Xanalogical structure, needed now more than ever:
                 parallel documents, deep links to content, deep
                 versioning, and deep re-use",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "33:1--33:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346033",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a33-nelson/",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Verbyla:1999:UL,
  author =       "Janet Verbyla",
  title =        "Unlinking the link",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "34:1--34:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346035",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a34-verbyla/",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cailliau:1999:HWH,
  author =       "Robert Cailliau and Helen Ashman",
  title =        "Hypertext in the {Web} --- a history",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "35:1--35:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346036",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a35-cailliau/",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "browsers; hypermedia; hypertext; World Wide Web; XML",
}

@Article{vanDam:1999:EUR,
  author =       "Andries van Dam",
  title =        "Education: the unfinished revolution",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "36:1--36:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346038",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a36-van_dam/",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nelson:1999:URX,
  author =       "Theodor Holm Nelson",
  title =        "The unfinished revolution and {Xanadu}",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "37:1--37:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346039",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a37-nelson/",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Engelbart:1999:BOC,
  author =       "Douglas Engelbart and Jeff Ruilifson",
  title =        "Bootstrapping our collective intelligence",
  journal =      j-COMP-SURV,
  volume =       "31",
  number =       "4es",
  pages =        "38:1--38:??",
  month =        dec,
  year =         "1999",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/345966.346040",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:10:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1999-31-4es/a38-engelbart/",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bellini:2000:TLR,
  author =       "P. Bellini and R. Mattolini and P. Nesi",
  title =        "Temporal logics for real-time system specification",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1",
  pages =        "12--42",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/349194.349197",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:11:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-1/p12-bellini/p12-bellini.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p12-bellini/",
  abstract =     "The specification of reactive and real-time systems
                 must be supported by formal, mathematically-founded
                 methods in order to be satisfactory and reliable.
                 Temporal logics have been used to this end for several
                 years. Temporal logics allow the specification of
                 system behavior in terms of logical formulas, including
                 temporal constraints, events, and the relationships
                 between the two. In the last ten years, temporal logics
                 have reached a high degree of expressiveness. Most of
                 the temporal logics proposed in the last few years can
                 be used for specifying reactive systems, although not
                 all are suitable for specifying real-time systems. In
                 this paper we present a series of criteria for
                 assessing the capabilities of temporal logics for the
                 specification, validation, and verification of
                 real-time systems. Among the criteria are the logic's
                 expressiveness, the logic's order, presence of a metric
                 for time, the type of temporal operators, the
                 fundamental time entity, and the structure of time. We
                 examine a selection of temporal logics proposed in the
                 literature. To make the comparison clearer, a set of
                 typical specifications is identified and used with most
                 of the temporal logics considered, thus presenting the
                 reader with a number of real examples.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Theory; Verification",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "logic specification languages; metric of time; modal
                 logic; reactive systems; real-time; specification
                 model; temporal constraints; temporal logics; temporal
                 relationships",
  subject =      "Theory of Computation --- Mathematical Logic and
                 Formal Languages --- Mathematical Logic (F.4.1): {\bf
                 Temporal logic}; Theory of Computation --- Mathematical
                 Logic and Formal Languages --- Mathematical Logic
                 (F.4.1): {\bf Modal logic}; Software --- Software
                 Engineering --- Requirements/Specifications (D.2.1):
                 {\bf Languages}; Software --- Software Engineering ---
                 Software/Program Verification (D.2.4): {\bf Formal
                 methods}; Computer Applications --- Computers in Other
                 Systems (J.7): {\bf Real time}",
}

@Article{Hasselbring:2000:PLS,
  author =       "Wilhelm Hasselbring",
  title =        "Programming languages and systems for prototyping
                 concurrent applications",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1",
  pages =        "43--79",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/349194.349199",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:11:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-1/p43-hasselbring/p43-hasselbring.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p43-hasselbring/",
  abstract =     "Concurrent programming is conceptually harder to
                 undertake and to understand than sequential
                 programming, because a programmer has to manage the
                 coexistence and coordination of multiple concurrent
                 activities. To alleviate this task several high-level
                 approaches to concurrent programming have been
                 developed. For some high-level programming approaches,
                 {\em prototyping\/} for facilitating early evaluation
                 of new ideas is a central goal. \par

                 Prototyping is used to explore the essential features
                 of a proposed system through practical experimentation
                 before its actual implementation to make the correct
                 design choices early in the process of software
                 development. Approaches to prototyping {\em
                 concurrent\/} applications with very high-level
                 programming systems intend to alleviate the development
                 in different ways. Early experimentation with alternate
                 design choices or problem decompositions for concurrent
                 applications is suggested to make concurrent
                 programming easier. \par

                 This paper presents a survey of programming languages
                 and systems for prototyping concurrent applications to
                 review the state of the art in this area. The surveyed
                 approaches are classified with respect to the
                 prototyping process.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Languages",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "concurrency; distribution; parallelism; rapid
                 prototyping; very high-level languages",
  subject =      "Software --- Programming Techniques --- Concurrent
                 Programming (D.1.3): {\bf Parallel programming};
                 Software --- Programming Techniques --- Concurrent
                 Programming (D.1.3): {\bf Distributed programming};
                 Software --- Software Engineering ---
                 Requirements/Specifications (D.2.1); Software ---
                 Software Engineering --- Design Tools and Techniques
                 (D.2.2): {\bf Computer-aided software engineering
                 (CASE)}; Software --- Software Engineering --- Design
                 Tools and Techniques (D.2.2): {\bf Petri nets};
                 Software --- Software Engineering --- Design Tools and
                 Techniques (D.2.2): {\bf Software libraries}; Software
                 --- Software Engineering --- Programming Environments
                 (D.2.6): {\bf Interactive environments}; Software ---
                 Programming Languages --- Language Classifications
                 (D.3.2): {\bf Concurrent, distributed, and parallel
                 languages}; Software --- Programming Languages ---
                 Language Classifications (D.3.2): {\bf Very high-level
                 languages}; Software --- Programming Languages ---
                 Language Constructs and Features (D.3.3): {\bf
                 Concurrent programming structures}",
}

@Article{Sarkar:2000:BHC,
  author =       "Palash Sarkar",
  title =        "A brief history of cellular automata",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1",
  pages =        "80--107",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/349194.349202",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:11:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-1/p80-sarkar/p80-sarkar.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p80-sarkar/",
  abstract =     "Cellular automata are simple models of computation
                 which exhibit fascinatingly complex behavior. They have
                 captured the attention of several generations of
                 researchers, leading to an extensive body of work. Here
                 we trace a history of cellular automata from their
                 beginnings with von Neumann to the present day. The
                 emphasis is mainly on topics closer to computer science
                 and mathematics rather than physics, biology or other
                 applications. The work should be of interest to both
                 new entrants into the field as well as researchers
                 working on particular aspects of cellular automata.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "cellular automata; cellular space; homogeneous
                 structures; systolic arrays; tessellation automata",
  subject =      "Theory of Computation --- Computation by Abstract
                 Devices --- Models of Computation (F.1.1); Computing
                 Milieux --- History of Computing (K.2)",
}

@Article{Fayad:2000:ICS,
  author =       "Mohamed E. Fayad",
  title =        "Introduction to the {Computing Surveys' Electronic
                 Symposium on Object-Oriented Application Frameworks}",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "1:1--1:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/349194.349197",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 4",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-1/p1-fayad/p1-fayad.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p1-fayad/",
  abstract =     "The specification of reactive and real-time systems
                 must be supported by formal, mathematically-founded
                 methods in order to be satisfactory and reliable.
                 Temporal logics have been used to this end for several
                 years. Temporal logics allow the specification of
                 system behavior in terms of logical formulas, including
                 temporal constraints, events, and the relationships
                 between the two. In the last ten years, temporal logics
                 have reached a high degree of expressiveness. Most of
                 the temporal logics proposed in the last few years can
                 be used for specifying reactive systems, although not
                 all are suitable for specifying real-time systems. In
                 this paper we present a series of criteria for
                 assessing the capabilities of temporal logics for the
                 specification, validation, and verification of
                 real-time systems. Among the criteria are the logic's
                 expressiveness, the logic's order, presence of a metric
                 for time, the type of temporal operators, the
                 fundamental time entity, and the structure of time. We
                 examine a selection of temporal logics proposed in the
                 literature. To make the comparison clearer, a set of
                 typical specifications is identified and used with most
                 of the temporal logics considered, thus presenting the
                 reader with a number of real examples.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  generalterms = "Design; Documentation; Languages",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "logic specification languages; metric of time; modal
                 logic; reactive systems; real-time; specification
                 model; temporal constraints; temporal logics; temporal
                 relationships",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Software Engineering --- Reusable Software
                 (D.2.13); Software --- Programming Techniques ---
                 Object-oriented Programming (D.1.5)",
  xxpages =      "1--9",
}

@Article{Brugali:2000:FPL,
  author =       "Davide Brugali and Katia Sycara",
  title =        "Frameworks and pattern languages: an intriguing
                 relationship",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "2:1--2:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/349194.349199",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 2",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p2-brugali/",
  abstract =     "Concurrent programming is conceptually harder to
                 undertake and to understand than sequential
                 programming, because a programmer has to manage the
                 coexistence and coordination of multiple concurrent
                 activities. To alleviate this task several high-level
                 approaches to concurrent programming have been
                 developed. For some high-level programming approaches,
                 prototyping for facilitating early evaluation of new
                 ideas is a central goal. Prototyping is used to explore
                 the essential features of a proposed system through
                 practical experimentation before its actual
                 implementation to make the correct design choices early
                 in the process of software development. Approaches to
                 prototyping concurrent applications with very
                 high-level programming systems intend to alleviate the
                 development in different ways. Early experimentation
                 with alternate design choices or problem decompositions
                 for concurrent applications is suggested to make
                 concurrent programming easier. This paper presents a
                 survey of programming languages and systems for
                 prototyping concurrent applications to review the state
                 of the art in this area. The surveyed approaches are
                 classified with respect to the prototyping process.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "concurrency; design patterns; development method;
                 distribution; framework documentation; parallelism;
                 pattern languages; rapid prototyping; very high-level
                 languages",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Patterns};
                 Software --- Software Engineering --- Reusable Software
                 (D.2.13); Software --- Programming Techniques ---
                 Object-oriented Programming (D.1.5)",
}

@Article{Bosch:2000:OOF,
  author =       "Jan Bosch and Peter Molin and Michael Mattsson and
                 PerOlof Bengtsson",
  title =        "Object-oriented framework-based software development:
                 problems and experiences",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "3:1--3:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/349194.349202",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 3",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p3-bosch/",
  abstract =     "Cellular automata are simple models of computation
                 which exhibit fascinatingly complex behavior. They have
                 captured the attention of several generations of
                 researchers, leading to an extensive body of work. Here
                 we trace a history of cellular automata from their
                 beginnings with von Neumann to the present day. The
                 emphasis is mainly on topics closer to computer science
                 and mathematics rather than physics, biology or other
                 applications. The work should be of interest to both
                 new entrants into the field as well as researchers
                 working on particular aspects of cellular automata.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "cellular automata; cellular space; homogeneous
                 structures; object-oriented frameworks; software reuse;
                 systolic arrays; tessellation automata",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Software Engineering --- Reusable Software
                 (D.2.13); Software --- Programming Techniques ---
                 Object-oriented Programming (D.1.5)",
}

@Article{Fayad:2000:EFG,
  author =       "Mohamed E. Fayad and David S. Hamu",
  title =        "Enterprise frameworks: guidelines for selection",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "4:1--4:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351940",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 4",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p4-fayad/",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "aspect-oriented frameworks; customization; distributed
                 computing; enterprise frameworks; extensibility;
                 framework economics; object-orientation; software
                 architecture; software stability",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Software Engineering --- Software
                 Architectures (D.2.11); Software --- Programming
                 Techniques --- Object-oriented Programming (D.1.5);
                 Software --- Programming Languages --- Language
                 Classifications (D.3.2): {\bf Concurrent, distributed,
                 and parallel languages}",
}

@Article{Baumer:2000:DDF,
  author =       "Dirk B{\"a}umer and Guido Gryczan and Rolf Knoll and
                 Carola Lilienthal and Dirk Riehle and Heinz
                 Z{\"u}llighoven",
  title =        "Domain-driven framework layering in large systems",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "5:1--5:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351941",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 5",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p5-baumer/",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "domain modeling; framework; framework layering",
  subject =      "Software --- Programming Techniques ---
                 Object-oriented Programming (D.1.5); Software ---
                 Software Engineering --- General (D.2.0); Software ---
                 Software Engineering --- Design Tools and Techniques
                 (D.2.2); Software --- Software Engineering --- Design**
                 (D.2.10); Software --- Software Engineering ---
                 Software Architectures (D.2.11); Software ---
                 Programming Languages --- Language Constructs and
                 Features (D.3.3): {\bf Frameworks}; Computer
                 Applications --- Administrative Data Processing (J.1):
                 {\bf Financial}",
}

@Article{Pree:2000:FSL,
  author =       "Wolfgang Pree and Kai Koskimies",
  title =        "Framelets --- small and loosely coupled frameworks",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "6:1--6:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351942",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p6-pree/",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  generalterms = "Design; Languages; Performance",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5); Software --- Programming Languages
                 --- Language Classifications (D.3.2): {\bf Java};
                 Software --- Software Engineering --- Reusable Software
                 (D.2.13)",
}

@Article{Wang:2000:BTR,
  author =       "Yingwu Wang and Dilip Patel and Graham King and Ian
                 Court and Geoff Staples and Maraget Ross and Mohamad
                 Fayad",
  title =        "On built-in test reuse in object-oriented framework
                 design",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "7:1--7:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351943",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 7",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p7-wang/",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "built-in test; code reuse; framework; framework reuse;
                 object-oriented technology; pattern; software
                 engineering; test reuse; testable software",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5); Software --- Software Engineering
                 --- Testing and Debugging (D.2.5)",
}

@Article{Hedin:2000:RLC,
  author =       "G{\"o}rel Hedin and J{\o}rgen Lindskov Knudsen",
  title =        "On the role of language constructs for framework
                 design",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "8:1--8:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351944",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 8",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p8-hedin/",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5)",
}

@Article{Carey:2000:DDD,
  author =       "James E. Carey and Brent A. Carlson",
  title =        "Deferring design decisions in an application
                 framework",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "9:1--9:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351945",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 9",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p9-carey/",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Techniques ---
                 Object-oriented Programming (D.1.5); Software ---
                 Software Engineering --- Design Tools and Techniques
                 (D.2.2): {\bf Object-oriented design methods}; Software
                 --- Programming Languages --- Language Constructs and
                 Features (D.3.3): {\bf Frameworks}; Software ---
                 Programming Languages --- Language Constructs and
                 Features (D.3.3): {\bf Patterns}",
}

@Article{Riehle:2000:PDR,
  author =       "Dirk Riehle and Roger Brudermann and Thomas Gross and
                 Kai-Uwe M{\"a}tzel",
  title =        "Pattern density and role modeling of an object
                 transport service",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "10:1--10:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351946",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 10",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p10-riehle/",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "framework; inter-process communication; object
                 migration; object transport; pattern; pattern
                 application; pattern composition; pattern density;
                 role; role model; role model composition",
  subject =      "Computer Systems Organization ---
                 Computer-Communication Networks --- Distributed Systems
                 (C.2.4); Software --- Programming Techniques ---
                 Concurrent Programming (D.1.3); Software ---
                 Programming Techniques --- Object-oriented Programming
                 (D.1.5); Software --- Software Engineering --- General
                 (D.2.0); Software --- Software Engineering --- Design
                 Tools and Techniques (D.2.2); Software --- Software
                 Engineering --- Design** (D.2.10); Software ---
                 Software Engineering --- Software Architectures
                 (D.2.11); Software --- Software Engineering ---
                 Reusable Software (D.2.13)",
}

@Article{Aksit:2000:DOO,
  author =       "Mehmet Aksit and Francesco Marcelloni and Bedir
                 Tekinerdogan",
  title =        "Developing object-oriented frameworks using domain
                 models",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "11:1--11:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351947",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 11",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p11-aksit/",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5)",
}

@Article{Succi:2000:FED,
  author =       "Giancarlo Succi and Andrea Valerio and Tullio Vernazza
                 and Massimo Fenaroli and Paolo Predonzani",
  title =        "Framework extraction with domain analysis",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "12:1--12:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351948",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 12",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p12-succi/",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5); Information Systems ---
                 Information Interfaces and Presentation --- User
                 Interfaces (H.5.2): {\bf Graphical user interfaces
                 (GUI)}",
}

@Article{Roy:2000:FAC,
  author =       "Pierre Roy and Anne Liret and Fran{\c{c}}ois Pachet",
  title =        "The framework approach for constraint satisfaction",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "13:1--13:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351949",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 13",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p13-roy/",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "constraint satisfaction; frameworks; object-oriented
                 programming",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Constraints};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5)",
}

@Article{Soundarajan:2000:DFB,
  author =       "Neelam Soundarajan",
  title =        "Documenting framework behavior",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "14:1--14:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351950",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 14",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p14-soundarajan/",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "specifying OO frameworks; traces of method calls",
  subject =      "Software --- Programming Techniques ---
                 Object-oriented Programming (D.1.5); Software ---
                 Software Engineering --- Requirements/Specifications
                 (D.2.1); Software --- Programming Languages ---
                 Language Constructs and Features (D.3.3): {\bf
                 Frameworks}",
}

@Article{Butler:2000:FFD,
  author =       "Greg Butler and Rudolf K. Keller and Hafedh Mili",
  title =        "A framework for framework documentation",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "15:1--15:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351951",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 15",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p15-butler/",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "application frameworks; CASE; design patterns; use
                 case",
  subject =      "Software --- Software Engineering --- Miscellaneous
                 (D.2.m): {\bf Reusable software**}; Software ---
                 Programming Techniques --- Object-oriented Programming
                 (D.1.5); Software --- Programming Languages ---
                 Language Constructs and Features (D.3.3): {\bf
                 Frameworks}",
}

@Article{Silva:2000:FDU,
  author =       "Ant{\'o}nio Rito Silva and Francisco Assis Rosa and
                 Teresa Gon{\c{c}}alves",
  title =        "Framework description using concern-specific design
                 patterns composition",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "16:1--16:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351952",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 16",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p16-silva/",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "object-oriented composition; object-oriented design
                 patterns; object-oriented frameworks",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5)",
}

@Article{Froehlich:2000:COO,
  author =       "Garry Froehlich and H. James Hoover and Paul G.
                 Sorenson",
  title =        "Choosing an object-oriented domain framework",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "17:1--17:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351953",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p17-froehlich/",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5)",
}

@Article{Bansiya:2000:EFA,
  author =       "Jagdish Bansiya",
  title =        "Evaluating framework architecture structural
                 stability",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "18:1--18:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351954",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 18",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p18-bansiya/",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5); Software --- Software Engineering
                 --- Software Architectures (D.2.11)",
}

@Article{Maamar:2000:OSA,
  author =       "Zakaria Maamar and Bernard Moulin",
  title =        "An overview of software agent-oriented frameworks",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "19:1--19:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351955",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 19",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p19-maamar/",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Computer Systems Organization ---
                 Computer-Communication Networks --- Distributed Systems
                 (C.2.4); Computing Methodologies --- Artificial
                 Intelligence --- Distributed Artificial Intelligence
                 (I.2.11): {\bf Multiagent systems}; Information Systems
                 --- Information Storage and Retrieval --- Digital
                 Libraries (H.3.7)",
}

@Article{Kendall:2000:AFI,
  author =       "Elizabeth A. Kendall and P. V. Murali Krishna and C.
                 B. Suresh and Chira G. V. Pathak",
  title =        "An application framework for intelligent and mobile
                 agents",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "20:1--20:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351956",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 20",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p20-kendall/",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Computing Methodologies --- Artificial Intelligence ---
                 Distributed Artificial Intelligence (I.2.11): {\bf
                 Intelligent agents}; Software --- Software Engineering
                 --- Software Architectures (D.2.11); Software ---
                 Programming Techniques --- Object-oriented Programming
                 (D.1.5); Software --- Programming Languages ---
                 Language Constructs and Features (D.3.3): {\bf
                 Patterns}",
}

@Article{Brugali:2000:TAO,
  author =       "Davide Brugali and Katia Sycara",
  title =        "Towards agent oriented application frameworks",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "21:1--21:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351957",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 21",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p21-brugali/",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "component customization; software agents",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5); Computing Methodologies ---
                 Artificial Intelligence --- Distributed Artificial
                 Intelligence (I.2.11): {\bf Intelligent agents}",
}

@Article{Garbinato:2000:OFR,
  author =       "Beno{\^\i}t Garbinato and Rachid Guerraoui",
  title =        "An open framework for reliable distributed computing",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "22:1--22:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351958",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 22",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p22-garbinato/",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5)",
}

@Article{Michaloski:2000:OSF,
  author =       "John Michaloski and Sushil Birla and C. Jerry Yen and
                 Richard Igou and George Weinert",
  title =        "An open system framework for component-based {CNC}
                 machines",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "23:1--23:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351959",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 23",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p23-michaloski/",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "API; architecture; classes; CNC; object-oriented",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Computer Applications --- Computers in Other Systems
                 (J.7): {\bf Industrial control}; Software ---
                 Programming Techniques --- Object-oriented Programming
                 (D.1.5)",
}

@Article{Fuentes:2000:TOM,
  author =       "Lidia Fuentes and Jos{\'e}e M. Troya",
  title =        "Towards an open multimedia service framework",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "24:1--24:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351960",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 24",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p24-fuentes/",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "compositional frameworks; distributed systems;
                 Java/Web; multimedia services",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Information Systems --- Information Interfaces and
                 Presentation --- Multimedia Information Systems
                 (H.5.1); Information Systems --- Information Interfaces
                 and Presentation --- Group and Organization Interfaces
                 (H.5.3): {\bf Web-based interaction}; Software ---
                 Programming Languages --- Language Classifications
                 (D.3.2): {\bf Java}",
}

@Article{Johnson:2000:SFP,
  author =       "Verlyn Johnson",
  title =        "The {San Francisco Project}: {Business} process
                 components and infrastructure",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "25:1--25:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351961",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 25",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p25-johnson/",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "application domain; business process components;
                 design patterns; distributed object infrastructure;
                 frameworks; Java; object oriented application
                 development",
  subject =      "Software --- Software Engineering (D.2); Software ---
                 Programming Languages --- Language Constructs and
                 Features (D.3.3): {\bf Frameworks}; Software ---
                 Software Engineering --- Reusable Software (D.2.13);
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5); Software --- Programming Languages
                 --- Language Classifications (D.3.2): {\bf Java}",
}

@Article{Capobianchi:2000:FAS,
  author =       "Riccardo Capobianchi and Alberto Coen-Porisini and
                 Dino Mandrioli and Angelo Morzenti",
  title =        "A framework architecture for supervision and control
                 systems",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "26:1--26:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351962",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 26",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p26-capobianchi/",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Software Engineering ---
                 Requirements/Specifications (D.2.1): {\bf CORBA};
                 Computer Applications --- Computers in Other Systems
                 (J.7): {\bf Real time}; Software --- Programming
                 Techniques --- Object-oriented Programming (D.1.5)",
}

@Article{Kappel:2000:FWM,
  author =       "Gerti Kappel and Stefan Rausch-Schott and Werner
                 Retschitzegger",
  title =        "A framework for workflow management systems based on
                 objects, rules and roles",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "27:1--27:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351963",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p27-kappel/",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "context dependent behavior; event/condition/action
                 rule; object-oriented frameworks; role modeling",
  subject =      "Information Systems --- Information Systems
                 Applications --- Office Automation (H.4.1): {\bf
                 Workflow management}; Software --- Software Engineering
                 --- Software Architectures (D.2.11): {\bf
                 Domain-specific architectures}; Software ---
                 Programming Languages --- Language Constructs and
                 Features (D.3.3): {\bf Frameworks}; Software ---
                 Programming Techniques --- Object-oriented Programming
                 (D.1.5)",
}

@Article{Koch:2000:AFG,
  author =       "Michael Koch and J{\"u}rgen Koch",
  title =        "Application of frameworks in groupware --- the {Iris}
                 group editor environment",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "28:1--28:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351964",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p28-koch/",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  generalterms = "Design; Human Factors; Languages",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "group editors; Iris; Java",
  subject =      "Software --- Programming Techniques ---
                 Object-oriented Programming (D.1.5); Software ---
                 Programming Languages --- Language Constructs and
                 Features (D.3.3): {\bf Frameworks}; Information Systems
                 --- Information Systems Applications --- Office
                 Automation (H.4.1): {\bf Groupware}; Software ---
                 Software Engineering --- Design Tools and Techniques
                 (D.2.2): {\bf IRIS}; Software --- Programming Languages
                 --- Language Classifications (D.3.2): {\bf Java}",
}

@Article{Pal:2000:FIC,
  author =       "Partha Pratim Pal",
  title =        "A Framework for Isolating Connection Exception
                 Management",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "29:1--29:10",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351965",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p29-pal/",
  abstract =     "This paper presents an abstract, object-oriented
                 application framework for isolating connection related
                 failure management from the main application. It also
                 describes our experience in designing and developing a
                 specific realization of this abstract
                 framework.\par

                 The isolation is achieved by introducing a ``connection
                 layer'', designed as an objectoriented application
                 framework, in between the application and the
                 middleware. The main contribution of such a framework
                 is the loose coupling between the application and the
                 underlying middleware. Furthermore, the ``connection
                 layer'' provides a simple middleware independent API
                 enabling applications to be migrated to multiple
                 middleware platforms.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  xxauthor =     "Partha pratim Pal",
}

@Article{pratimPal:2000:FIC,
  author =       "Partha {pratim Pal}",
  title =        "A framework for isolating connection exception
                 management",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "29:1--29:??",
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351965",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jul 26 06:52:17 MDT 2001",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 29",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5)",
}

@Article{Rossi:2000:NBO,
  author =       "Gustavo Rossi and Alejandra Garrido and Daniel
                 Schwabe",
  title =        "Navigating between objects. {Lessons} from an
                 object-oriented framework perspective",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "30:1--30:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351966",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 30",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p30-rossi/",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5); Information Systems ---
                 Information Interfaces and Presentation ---
                 Hypertext/Hypermedia (H.5.4); Information Systems ---
                 Information Interfaces and Presentation --- Group and
                 Organization Interfaces (H.5.3): {\bf Web-based
                 interaction}",
}

@Article{Jezequel:2000:OOF,
  author =       "J.-M. J{\'e}z{\'e}quel",
  title =        "An object-oriented framework for data parallelism",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "31:1--31:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351967",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 31",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p31-jezequel/",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data distribution; distribution systems; frameworks;
                 object-oriented design; parallel linear algebra
                 library; reuse; software components; supercomputing",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5); Mathematics of Computing ---
                 Numerical Analysis --- Numerical Linear Algebra
                 (G.1.3); Computer Systems Organization --- Processor
                 Architectures --- Parallel Architectures (C.1.4)",
}

@Article{Kannan:2000:PSF,
  author =       "Raman Kannan",
  title =        "{PAcceptor} and {SConnector} frameworks: combining
                 concurrency and communication",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "32:1--32:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351968",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 32",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p32-kannan/",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Concurrent
                 Programming (D.1.3)",
}

@Article{Buchner:2000:HFC,
  author =       "J{\"u}rgen Buchner",
  title =        "{HotDoc}: a framework for compound documents",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "33:1--33:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351969",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 33",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p33-buchner/",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "compound documents; frameworks; multimedia;
                 smalltalk",
  subject =      "Software --- Programming Techniques ---
                 Object-oriented Programming (D.1.5); Computing
                 Methodologies --- Document and Text Processing ---
                 Document Preparation (I.7.2); Software --- Programming
                 Languages --- Language Constructs and Features (D.3.3):
                 {\bf Frameworks}; Information Systems --- Information
                 Interfaces and Presentation --- Multimedia Information
                 Systems (H.5.1); Software --- Programming Languages ---
                 Language Classifications (D.3.2): {\bf Smalltalk}",
}

@Article{Demeyer:2000:CFD,
  author =       "Serge Demeyer and Koen {De Hondt} and Patrick
                 Steyaert",
  title =        "Consistent framework documentation with computed links
                 and framework contracts",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "34:1--34:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351971",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 34",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p34-demeyer/",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Information Systems --- Information Interfaces and
                 Presentation --- Hypertext/Hypermedia (H.5.4): {\bf
                 Theory}",
}

@Article{Whelan:2000:EIS,
  author =       "Peter T. Whelan",
  title =        "Experiences and issues with {SEMATECH}'s {CIM}
                 framework",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "35:1--35:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351972",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 35",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p35-whelan/",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer integrated manufacturing; framework;
                 manufacturing execution system; software component",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Computer Applications --- Computer-Aided Engineering
                 (J.6): {\bf Computer-aided manufacturing (CAM)}",
}

@Article{Harinath:2000:EOO,
  author =       "Raja Harinath and Jaideep Srivastava and Jim
                 Richardson and Mark Foresti",
  title =        "Experiences with an object oriented framework for
                 distributed control applications",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "36:1--36:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351973",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 36",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p36-harinath/",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Computer Applications --- Computers in Other Systems
                 (J.7): {\bf Command and control}; Software ---
                 Programming Techniques --- Object-oriented Programming
                 (D.1.5); Computer Applications --- Computers in Other
                 Systems (J.7): {\bf Process control}",
}

@Article{Al-Shaer:2000:AOO,
  author =       "Ehab Al-Shaer and Mohamed Fayed and Hussein
                 Abdel-Wahab",
  title =        "Adaptive object-oriented filtering framework for event
                 management applications",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "37:1--37:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351974",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 37",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p37-al-shaer/",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design patterns; filtering; frameworks; monitoring",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5); Computer Applications ---
                 Computers in Other Systems (J.7): {\bf Process
                 control}",
}

@Article{Luckas:2000:EFF,
  author =       "Volker Luckas and Ralf D{\"o}rner",
  title =        "Experience form the future --- using
                 object-orientation concepts for {$3$D} visualization
                 and validation of industrial scenarios",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "38:1--38:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351975",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p38-luckas/",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  generalterms = "Design; Economics; Human Factors; Performance;
                 Reliability",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "3D visualization; animation element; automation;
                 object-orientation; simulation",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5); Computing Methodologies ---
                 Computer Graphics --- Three-Dimensional Graphics and
                 Realism (I.3.7)",
}

@Article{Schmidt:2000:DFH,
  author =       "Douglas C. Schmidt and James C. Hu",
  title =        "Developing flexible and high-performance {Web} servers
                 with frameworks and patterns",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "39:1--39:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351976",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 39",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p39-schmidt/",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "design patterns; distributed software systems;
                 object-oriented application frameworks; WWW",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Patterns};
                 Information Systems --- Information Storage and
                 Retrieval --- Systems and Software (H.3.4): {\bf World
                 Wide Web (WWW)}; Software --- Programming Techniques
                 --- Concurrent Programming (D.1.3)",
}

@Article{Ebner:2000:FMF,
  author =       "Ezra Ebner and Weiguang Shao and Wei-Tek Tsai",
  title =        "The five-module framework for {Internet} application
                 development",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "40:1--40:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351977",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 40",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p40-ebner/",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Software Engineering --- Software
                 Architectures (D.2.11); Information Systems ---
                 Information Systems Applications --- Communications
                 Applications (H.4.3)",
}

@Article{Constantinides:2000:DAO,
  author =       "Constantinos A. Constantinides and Atef Bader and
                 Tzilla H. Elrad and P. Netinant and Mohamed E. Fayad",
  title =        "Designing an aspect-oriented framework in an
                 object-oriented environment",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "1es",
  pages =        "41:1--41:??",
  month =        mar,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/351936.351978",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:12:24 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Article No. 41",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/2000-32-1/p41-constantinides/",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  subject =      "Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Frameworks};
                 Software --- Programming Techniques --- Object-oriented
                 Programming (D.1.5); Software --- Programming
                 Techniques --- Concurrent Programming (D.1.3)",
}

@Article{Coello:2000:USG,
  author =       "Carlos A. Coello",
  title =        "An updated survey of {GA}-based multiobjective
                 optimization techniques",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "2",
  pages =        "109--143",
  month =        jun,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/358923.358929",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:14:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-2/p109-coello/p109-coello.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-2/p109-coello/",
  abstract =     "After using evolutionary techniques for
                 single-objective optimization during more than two
                 decades, the incorporation of more than one objective
                 in the fitness function has finally become a popular
                 area of research. As a consequence, many new
                 evolutionary-based approaches and variations of
                 existing techniques have recently been published in the
                 technical literature. The purpose of this paper is to
                 summarize and organize the information on these current
                 approaches, emphasizing the importance of analyzing the
                 operations research techniques in which most of them
                 are based, in an attempt to motivate researchers to
                 look into these mathematical programming approaches for
                 new ways of exploiting the search capabilities of
                 evolutionary algorithms. Furthermore, a summary of the
                 main algorithms behind these approaches is provided,
                 together with a brief criticism that includes their
                 advantages and disadvantages, degree of applicability,
                 and some known applications. Finally, further trends in
                 this area and some possible paths for further research
                 are also addressed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Algorithms",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "artificial intelligence; genetic algorithms;
                 multicriteria optimization; multiobjective
                 optimization; vector optimization",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- Problem Solving, Control Methods, and Search
                 (I.2.8): {\bf Heuristic methods}",
}

@Article{Kobayashi:2000:IRW,
  author =       "Mei Kobayashi and Koichi Takeda",
  title =        "Information retrieval on the {Web}",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "2",
  pages =        "144--173",
  month =        jun,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/358923.358934",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:14:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-2/p144-kobayashi/p144-kobayashi.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-2/p144-kobayashi/",
  abstract =     "In this paper we review studies of the growth of the
                 Internet and technologies that are useful for
                 information search and retrieval on the Web. We present
                 data on the Internet from several different sources,
                 e.g., current as well as projected number of users,
                 hosts, and Web sites. Although numerical figures vary,
                 overall trends cited by the sources are consistent and
                 point to exponential growth in the past and in the
                 coming decade. Hence it is not surprising that about
                 85\% of Internet users surveyed claim using search
                 engines and search services to find specific
                 information. The same surveys show, however, that users
                 are not satisfied with the performance of the current
                 generation of search engines; the slow retrieval speed,
                 communication delays, and poor quality of retrieved
                 results (e.g., noise and broken links) are commonly
                 cited problems. We discuss the development of new
                 techniques targeted to resolve some of the problems
                 associated with Web-based information retrieval and
                 speculate on future trends.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Theory",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "clustering; indexing; information retrieval; Internet;
                 knowledge management; search engine; World Wide Web",
  subject =      "Mathematics of Computing --- Numerical Analysis ---
                 Numerical Linear Algebra (G.1.3): {\bf Eigenvalues and
                 eigenvectors (direct and iterative methods)};
                 Mathematics of Computing --- Numerical Analysis ---
                 Numerical Linear Algebra (G.1.3): {\bf Singular value
                 decomposition}; Mathematics of Computing --- Numerical
                 Analysis --- Numerical Linear Algebra (G.1.3): {\bf
                 Sparse, structured, and very large systems (direct and
                 iterative methods)}; Mathematics of Computing ---
                 Numerical Analysis --- Interpolation (G.1.1);
                 Information Systems --- Information Storage and
                 Retrieval --- Content Analysis and Indexing (H.3.1);
                 Information Systems --- Information Storage and
                 Retrieval --- Information Search and Retrieval (H.3.3):
                 {\bf Clustering}; Information Systems --- Information
                 Storage and Retrieval --- Information Search and
                 Retrieval (H.3.3): {\bf Retrieval models}; Information
                 Systems --- Information Storage and Retrieval ---
                 Information Search and Retrieval (H.3.3): {\bf Search
                 process}; Information Systems --- Miscellaneous (H.m)",
}

@Article{Vanderwiel:2000:DPM,
  author =       "Steven P. Vanderwiel and David J. Lilja",
  title =        "Data prefetch mechanisms",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "2",
  pages =        "174--199",
  month =        jun,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/358923.358939",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:14:26 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-2/p174-vanderwiel/p174-vanderwiel.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-2/p174-vanderwiel/",
  abstract =     "The expanding gap between microprocessor and DRAM
                 performance has necessitated the use of increasingly
                 aggressive techniques designed to reduce or hide the
                 latency of main memory access. Although large cache
                 hierarchies have proven to be effective in reducing
                 this latency for the most frequently used data, it is
                 still not uncommon for many programs to spend more than
                 half their run times stalled on memory requests. Data
                 prefetching has been proposed as a technique for hiding
                 the access latency of data referencing patterns that
                 defeat caching strategies. Rather than waiting for a
                 cache miss to initiate a memory fetch, data prefetching
                 anticipates such misses and issues a fetch to the
                 memory system in advance of the actual memory
                 reference. To be effective, prefetching must be
                 implemented in such a way that prefetches are timely,
                 useful, and introduce little overhead. Secondary
                 effects such as cache pollution and increased memory
                 bandwidth requirements must also be taken into
                 consideration. Despite these obstacles, prefetching has
                 the potential to significantly improve overall program
                 execution time by overlapping computation with memory
                 accesses. Prefetching strategies are diverse, and no
                 single strategy has yet been proposed that provides
                 optimal performance. The following survey examines
                 several alternative approaches, and discusses the
                 design tradeoffs involved when implementing a data
                 prefetch strategy.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Design; Performance",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "memory latency; prefetching",
  subject =      "Hardware --- Memory Structures --- Design Styles
                 (B.3.2): {\bf Cache memories}; Hardware --- Memory
                 Structures (B.3)",
}

@Article{Ashman:2000:EDA,
  author =       "Helen Ashman",
  title =        "Electronic document addressing: dealing with change",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "3",
  pages =        "201--212",
  month =        sep,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/367701.367702",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:14:44 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-3/p201-ashman/p201-ashman.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-3/p201-ashman/",
  abstract =     "The management of electronic document collections is
                 fundamentally different from the management of paper
                 documents. The ephemeral nature of some electronic
                 documents means that the document address (i.e.,
                 reference details of the document) can become incorrect
                 some time after coming into use, resulting in
                 references, such as index entries and hypertext links,
                 failing to correctly address the document they
                 describe. A classic case of invalidated references is
                 on the World Wide Web--links that point to a named
                 resource fail when the domain name, file name, or any
                 other aspect of the addressed resource is changed,
                 resulting in the well-known Error 404. Additionally,
                 there are other errors which arise from changes to
                 document collections. \par

                 This paper surveys the strategies used both in World
                 Wide Web software and other hypertext systems for
                 managing the integrity of references and hence the
                 integrity of links. Some strategies are {\em
                 preventative}, not permitting errors to occur; others
                 are {\em corrective}, discovering references errors and
                 sometimes attempting to correct them; while the last
                 strategy is {\em adaptive}, because references are
                 calculated on a just-in-time basis, according the
                 current state of the document collection.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Management; Reliability",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "404; link; link integrity",
  subject =      "Information Systems --- Information Interfaces and
                 Presentation --- Hypertext/Hypermedia (H.5.4)",
}

@Article{Kazi:2000:TOH,
  author =       "Iffat H. Kazi and Howard H. Chen and Berdenia Stanley
                 and David J. Lilja",
  title =        "Techniques for obtaining high performance in {Java}
                 programs",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "3",
  pages =        "213--240",
  month =        sep,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/367701.367714",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:14:44 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-3/p213-kazi/p213-kazi.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-3/p213-kazi/",
  abstract =     "This survey describes research directions in
                 techniques to improve the performance of programs
                 written in the Java programming language. The standard
                 technique for Java execution is interpretation, which
                 provides for extensive portability of programs. A Java
                 interpreter dynamically executes Java bytecodes, which
                 comprise the instruction set of the Java Virtual
                 Machine (JVM). Execution time performance of Java
                 programs can be improved through compilation, possibly
                 at the expense of portability. Various types of Java
                 compilers have been proposed, including Just-In-Time
                 (JIT) compilers that compile bytecode into native
                 processor instructions on the fly; direct compilers
                 that directly translate the Java source code into the
                 target processor's native language; and
                 bytecode-to-source translators that generate either
                 native code or an intermediate language, such as C,
                 from the bytecodes. Additional techniques, including
                 bytecode optimization, dynamic compilation, and
                 executing Java programs in parallel, attempt to improve
                 Java run-time performance while maintaining Java's
                 portability. Another alternative for executing Java
                 programs is a Java processor that implements the JVM
                 directly in hardware. In this survey, we discuss the
                 basis features, and the advantages and disadvantages,
                 of the various Java execution techniques. We also
                 discuss the various Java benchmarks that are being used
                 by the Java community for performance evaluation of the
                 different techniques. Finally, we conclude with a
                 comparison of the performance of the alternative Java
                 execution techniques based on reported results.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Languages; Performance",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "bytecode-to-source translators; direct compilers;
                 dynamic compilation; interpreters; Java; Java virtual
                 machine; just-in-time compilers",
  subject =      "General Literature --- Introductory and Survey (A.1);
                 Computer Systems Organization --- Performance of
                 Systems (C.4); Software --- Programming Languages
                 (D.3)",
}

@Article{Milojicic:2000:PM,
  author =       "Dejan S. Milo{\'\j}i{\v{c}}i{\'c} and Fred Douglis and
                 Yves Paindaveine and Richard Wheeler and Songnian
                 Zhou",
  title =        "Process migration",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "3",
  pages =        "241--299",
  month =        sep,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/367701.367728",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:14:44 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-3/p241-miloiic/p241-miloiic.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-3/p241-miloiic/",
  abstract =     "Process migration is the act of transferring a process
                 between two machines. It enables dynamic load
                 distribution, fault resilience, eased system
                 administration, and data access locality. Despite these
                 goals and ongoing research efforts, migration has not
                 achieved widespread use. With the increasing deployment
                 of distributed systems in general, and distributed
                 operating systems in particular, process migration is
                 again receiving more attention in both research and
                 product development. As high-performance facilities
                 shift from supercomputers to networks of workstations,
                 and with the ever-increasing role of the World Wide
                 Web, we expect migration to play a more important role
                 and eventually to be widely adopted. \par

                 This survey reviews the field of process migration by
                 summarizing the key concepts and giving an overview of
                 the most important implementations. Design and
                 implementation issues of process migration are analyzed
                 in general, and then revisited for each of the case
                 studies described: MOSIX, Sprite, Mach, and Load
                 Sharing Facility. The benefits and drawbacks of process
                 migration depend on the details of implementation and,
                 therefore, this paper focuses on practical matters.
                 This survey will help in understanding the potentials
                 of process migration and why it has not caught on.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Design; Experimentation",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "distributed operating systems; distributed systems;
                 load distribution; process migration",
  subject =      "Computer Systems Organization ---
                 Computer-Communication Networks --- Distributed Systems
                 (C.2.4): {\bf Network operating systems}; Software ---
                 Operating Systems --- Organization and Design (D.4.7):
                 {\bf Distributed systems}; Software --- Operating
                 Systems --- Performance (D.4.8): {\bf Measurements};
                 Software --- Operating Systems --- Storage Management
                 (D.4.2): {\bf Distributed memories}",
}

@Article{Rieffel:2000:IQC,
  author =       "Eleanor Rieffel and Wolfgang Polak",
  title =        "An introduction to quantum computing for
                 non-physicists",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "3",
  pages =        "300--335",
  month =        sep,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/367701.367709",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:14:44 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-3/p300-rieffel/p300-rieffel.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-3/p300-rieffel/",
  abstract =     "Richard Feynman's observation that certain quantum
                 mechanical effects cannot be simulated efficiently on a
                 computer led to speculation that computation in general
                 could be done more efficiently if it used these quantum
                 effects. This speculation proved justified when Peter
                 Shor described a polynomial time quantum algorithm for
                 factoring integers. \par

                 In quantum systems, the computational space increases
                 exponentially with the size of the system, which
                 enables exponential parallelism. This parallelism could
                 lead to exponentially faster quantum algorithms than
                 possible classically. The catch is that accessing the
                 results, which requires measurement, proves tricky and
                 requires new nontraditional programming techniques.
                 \par

                 The aim of this paper is to guide computer scientists
                 through the barriers that separate quantum computing
                 from conventional computing. We introduce basic
                 principles of quantum mechanics to explain where the
                 power of quantum computers comes from and why it is
                 difficult to harness. We describe quantum cryptography,
                 teleportation, and dense coding. Various approaches to
                 exploiting the power of quantum parallelism are
                 explained. We conclude with a discussion of quantum
                 error correction.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Algorithms; Security; Theory",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "complexity; parallelism; quantum computing",
  subject =      "General Literature --- Introductory and Survey (A.1);
                 Computer Applications --- Physical Sciences and
                 Engineering (J.2): {\bf Physics}",
}

@Article{Chesnevar:2000:LMA,
  author =       "Carlos Iv{\'a}n Ches{\~n}evar and Ana Gabriela
                 Maguitman and Ronald Prescott Loui",
  title =        "Logical models of argument",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "4",
  pages =        "337--383",
  month =        dec,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/371578.371581",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:15:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-4/p337-chesnevar/p337-chesnevar.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-4/p337-chesnevar/",
  abstract =     "Logical models of argument formalize commonsense
                 reasoning while taking process and computation
                 seriously. This survey discusses the main ideas that
                 characterize different logical models of argument. It
                 presents the formal features of a few features of a few
                 main approaches to the modeling of argumentation. We
                 trace the evolution of argumentation from the
                 mid-1980s, when argument systems emerged as an
                 alternative to nonmonotonic formalisms based on
                 classical logic, to the present, as argument in
                 embedded in different complex systems for real-world
                 applications, and allow more formal work to be done in
                 different areas, such as AI and Law, case-based
                 reasoning and negotiation among intelligent agents.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Theory",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "argumentation; argumentative systems; defeasible
                 argumentation; defeasible reasoning; reasoning",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- Knowledge Representation Formalisms and Methods
                 (I.2.4)",
}

@Article{Hilbert:2000:EUI,
  author =       "David M. Hilbert and David F. Redmiles",
  title =        "Extracting usability information from user interface
                 events",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "4",
  pages =        "384--421",
  month =        dec,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/371578.371593",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:15:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-4/p384-hilbert/p384-hilbert.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-4/p384-hilbert/",
  abstract =     "Modern window-based user interface systems generate
                 user interface events as natural products of their
                 normal operation. Because such events can be
                 automatically captured and because they indicate user
                 behavior with respect to an application's user
                 interface, they have long been regarded as a
                 potentially fruitful source of information regarding
                 application usage and usability. However, because user
                 interface events are typically voluminous and rich in
                 detail, automated support is generally required to
                 extract information at a level of abstraction that is
                 useful to investigators interested in analyzing
                 application usage or evaluating usability. This survey
                 examines computer-aided techniques used by HCI
                 practitioners and researchers to extract
                 usability-related information from user interface
                 events. A framework is presented to help HCI
                 practitioners and researchers categorize and compare
                 the approaches that have been, or might fruitfully be,
                 applied to this problem. Because many of the techniques
                 in the research literature have not been evaluated in
                 practice, this survey provides a conceptual evaluation
                 to help identify some of the relative merits and
                 drawbacks of the various classes of approaches. Ideas
                 for future research in this area are also presented.
                 This survey addresses the following questions: How
                 might user interface events be used in evaluating
                 usability? How are user interface events related to
                 other forms of usability data? What are the key
                 challenges faced by investigators wishing to exploit
                 this data? What approaches have been brought to bear on
                 this problem and how do they compare to one another?
                 What are some of the important open research questions
                 in this area?",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Experimentation; Human Factors; Measurement",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "human-computer interaction; sequential data analysis;
                 usability testing; user interface event monitoring",
  subject =      "Information Systems --- Information Interfaces and
                 Presentation --- User Interfaces (H.5.2): {\bf
                 Evaluation/methodology}",
}

@Article{Kossmann:2000:SAD,
  author =       "Donald Kossmann",
  title =        "The state of the art in distributed query processing",
  journal =      j-COMP-SURV,
  volume =       "32",
  number =       "4",
  pages =        "422--469",
  month =        dec,
  year =         "2000",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/371578.371598",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:15:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2000-32-4/p422-kossmann/p422-kossmann.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2000-32-4/p422-kossmann/",
  abstract =     "Distributed data processing is becoming a reality.
                 Businesses want to do it for many reasons, and they
                 often must do it in order to stay competitive. While
                 much of the infrastructure for distributed data
                 processing is already there (e.g., modern network
                 technology), a number of issues make distributed data
                 processing still a complex undertaking: (1) distributed
                 systems can become very large, involving thousands of
                 heterogeneous sites including PCs and mainframe server
                 machines; (2) the state of a distributed system changes
                 rapidly because the load of sites varies over time and
                 new sites are added to the system; (3) legacy systems
                 need to be integrated --- such legacy systems usually
                 have not been designed for distributed data processing
                 and now need to interact with other (modern) systems in
                 a distributed environment. This paper presents the
                 state of the art of query processing for distributed
                 database and information systems. The paper presents
                 the ``textbook'' architecture for distributed query
                 processing and a series of techniques that are
                 particularly useful for distributed database systems.
                 These techniques include special join techniques,
                 techniques to exploit intraquery parallelism,
                 techniques to reduce communication costs, and
                 techniques to exploit caching and replication of data.
                 Furthermore, the paper discusses different kinds of
                 distributed systems such as client-server, middleware
                 (multitier), and heterogeneous database systems, and
                 shows how query processing works in these systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Algorithms; Performance",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "caching; client-server databases; database application
                 systems; dissemination-based information systems;
                 economic models for query processing; middleware;
                 multitier architectures; query execution; query
                 optimization; replication; wrappers",
  subject =      "Data --- Files (E.5); Information Systems --- Database
                 Management --- Systems (H.2.4): {\bf Distributed
                 databases}; Information Systems --- Database Management
                 --- Systems (H.2.4): {\bf Query processing};
                 Information Systems --- Database Management ---
                 Heterogeneous Databases (H.2.5): {\bf Data
                 translation**}",
}

@Article{Greiner:2001:ER,
  author =       "Russell Greiner and Christian Darken and N. Iwan
                 Santoso",
  title =        "Efficient reasoning",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "1",
  pages =        "1--30",
  month =        mar,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/375360.375363",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:15:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2001-33-1/p1-greiner/p1-greiner.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2001-33-1/p1-greiner/",
  abstract =     "Many tasks require ``reasoning''--i.e., deriving
                 conclusions from a corpus of explicitly stored
                 information--to solve their range of problems. An ideal
                 reasoning system would produce all-and-only the {\em
                 correct\/} answers to every possible query, produce
                 answers that are as {\em specific\/} as possible, be
                 {\em expressive\/} enough to permit any possible fact
                 to be stored and any possible query to be asked, and be
                 (time) {\em efficient}. Unfortunately, this is provably
                 impossible: as correct and precise systems become more
                 expressive, they can become increasingly inefficient,
                 or even undecidable. This survey first formalizes these
                 hardness results, in the context of both logic- and
                 probability-based reasoning, then overviews the
                 techniques now used to address, or at least side-step,
                 this dilemma.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Algorithms; Performance",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "efficiency trade-offs;
                 soundness/completeness/expressibility",
  subject =      "Computing Methodologies --- Artificial Intelligence
                 --- Deduction and Theorem Proving (I.2.3); Computing
                 Methodologies --- Artificial Intelligence --- Knowledge
                 Representation Formalisms and Methods (I.2.4)",
}

@Article{Navarro:2001:GTA,
  author =       "Gonzalo Navarro",
  title =        "A guided tour to approximate string matching",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "1",
  pages =        "31--88",
  month =        mar,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/375360.375365",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:15:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2001-33-1/p31-navarro/p31-navarro.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2001-33-1/p31-navarro/",
  abstract =     "We survey the current techniques to cope with the
                 problem of string matching that allows errors. This is
                 becoming a more and more relevant issue for many fast
                 growing areas such as information retrieval and
                 computational biology. We focus on online searching and
                 mostly on edit distance, explaining the problem and its
                 relevance, its statistical behavior, its history and
                 current developments, and the central ideas of the
                 algorithms and their complexities. We present a number
                 of experiments to compare the performance of the
                 different algorithms and show which are the best
                 choices. We conclude with some directions for future
                 work and open problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Algorithms",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "edit distance; Levenshtein distance; online string
                 matching; text searching allowing errors",
  subject =      "Theory of Computation --- Analysis of Algorithms and
                 Problem Complexity --- Nonnumerical Algorithms and
                 Problems (F.2.2): {\bf Computations on discrete
                 structures}; Information Systems --- Information
                 Storage and Retrieval --- Information Search and
                 Retrieval (H.3.3): {\bf Search process}",
}

@Article{Weihe:2001:SEP,
  author =       "Karsten Weihe",
  title =        "A software engineering perspective on algorithmics",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "1",
  pages =        "89--134",
  month =        mar,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/375360.375367",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:15:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/surveys/2001-33-1/p89-weihe/p89-weihe.pdf;
                 http://www.acm.org/pubs/citations/journals/surveys/2001-33-1/p89-weihe/",
  abstract =     "An {\em algorithm component\/} is an implementation of
                 an algorithm which is not intended to be a stand-alone
                 module, but to perform a specific task within a large
                 software package or even within several distinct
                 software packages. Therefore, the design of algorithm
                 components must also incorporate software-engineering
                 aspects. A key design goal is adaptability. This goal
                 is important for maintenance throughout a project,
                 prototypical development, and reuse in new, unforseen
                 contexts. From a theoretical viewpoint most algorithms
                 apply to a range of possible use scenarios. Ideally,
                 each algorithm is implemented by one algorithm
                 component, which is easily, safely, and efficiently
                 adaptable to all of these contexts. \par

                 Various techniques have been developed for the design
                 and implementation of algorithm components. However, a
                 common basis for systematic, detailed evaluations and
                 comparisons in view of the {\em real\/} practical needs
                 is still missing. Basically, this means a set of
                 concrete criteria, which specify what sort of
                 adaptability is {\em really\/} required in practice,
                 and which are well-justified by convincing,
                 representative use scenarios. \par

                 This paper is intended to be a first ``milestone'' on
                 the way towards such a system of criteria. We will
                 present a set of concrete goals, which are general and
                 problem-independent and might appear ubiquitously in
                 the algorithmic realm. These goals are illustrated,
                 motivated, and justified by an extensive requirements
                 analysis for a particular algorithm from a particular
                 algorithmic domain: Dijkstra's algorithm for shortest
                 paths in networks. \par

                 Clearly, the field of algorithmics might be too
                 versatile to allow a comprehensive, yet concise set of
                 precise, justified criteria. Even a domain as
                 restricted as graph and network algorithms includes
                 aspects that are not fully understood. The analysis
                 will include a discussion of the limits of the case
                 study and the scope of the goals. The case study was
                 chosen because it seems to be close to the
                 ``borderline'' between the aspects that are well
                 understood and the aspects that are not. Hence, this
                 example may well serve as an``acid test'' for
                 programming techniques in view of the state of the
                 art.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  generalterms = "Algorithms; Design; Languages",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "algorithm engineering",
  subject =      "Software --- Software Engineering --- Reusable
                 Software (D.2.13); Software --- Programming Languages
                 --- Language Constructs and Features (D.3.3);
                 Mathematics of Computing --- Discrete Mathematics ---
                 Graph Theory (G.2.2): {\bf Graph algorithms};
                 Mathematics of Computing --- Mathematical Software
                 (G.4)",
}

@Article{Degano:2001:EOS,
  author =       "Pierpaolo Degano and Corrado Priami",
  title =        "Enhanced operational semantics: a tool for describing
                 and analyzing concurrent systems",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "2",
  pages =        "135--176",
  month =        jun,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/384192.384194",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:16:06 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article surveys the definition and application of
                 an enhancement of structural operational semantics in
                 the field of concurrent systems, and also addresses
                 issues of distribution and mobility of code. The focus
                 is on how enriching the labels of transitions with
                 encodings of their deduction trees is sufficient to
                 derive qualitative and quantitative information on the
                 systems in hand simply by relabeling the transitions of
                 a unique concrete model.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "parametric models; process algebra",
}

@Article{Littlewood:2001:MSD,
  author =       "Bev Littlewood and Peter Popov and Lorenzo Strigini",
  title =        "Modeling software design diversity: a review",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "2",
  pages =        "177--208",
  month =        jun,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/384192.384195",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:16:06 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Design diversity has been used for many years now as a
                 means of achieving a degree of fault tolerance in
                 software-based systems. While there is clear evidence
                 that the approach can be expected to deliver some
                 increase in reliability compared to a single version,
                 there is no agreement about the extent of this. More
                 importantly, it remains difficult to evaluate exactly
                 how reliable a particular diverse fault-tolerant system
                 is. This difficulty arises because assumptions of
                 independence of failures between different versions
                 have been shown to be untenable: assessment of the
                 actual level of dependence present is therefore needed,
                 and this is difficult. In this tutorial, we survey the
                 modeling issues here, with an emphasis upon the impact
                 these have upon the problem of assessing the
                 reliability of fault-tolerant systems. The intended
                 audience is one of designers, assessors, and project
                 managers with only a basic knowledge of probabilities,
                 as well as reliability experts without detailed
                 knowledge of software, who seek an introduction to the
                 probabilistic issues in decisions about design
                 diversity.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "control systems; functional diversity; multiple
                 version programming; N -version software; protection
                 systems; safety; software fault tolerance",
}

@Article{Vitter:2001:EMA,
  author =       "Jeffrey Scott Vitter",
  title =        "External memory algorithms and data structures:
                 dealing with {\bf massive data}",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "2",
  pages =        "209--271",
  month =        jun,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/384192.384193",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:16:06 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Data sets in large applications are often too massive
                 to fit completely inside the computers internal memory.
                 The resulting input/output communication (or I/O)
                 between fast internal memory and slower external memory
                 (such as disks) can be a major performance bottleneck.
                 In this article we survey the state of the art in the
                 design and analysis of external memory (or EM)
                 algorithms and data structures, where the goal is to
                 exploit locality in order to reduce the I/O costs. We
                 consider a variety of EM paradigms for solving batched
                 and online problems efficiently in external memory. For
                 the batched problem of sorting and related problems
                 such as permuting and fast Fourier transform, the key
                 paradigms include distribution and merging. The
                 paradigm of disk striping offers an elegant way to use
                 multiple disks in parallel. For sorting, however, disk
                 striping can be nonoptimal with respect to I/O, so to
                 gain further improvements we discuss distribution and
                 merging techniques for using the disks independently.
                 We also consider useful techniques for batched EM
                 problems involving matrices (such as matrix
                 multiplication and transposition), geometric data (such
                 as finding intersections and constructing convex
                 hulls), and graphs (such as list ranking, connected
                 components, topological sorting, and shortest paths).
                 In the online domain, canonical EM applications include
                 dictionary lookup and range searching. The two
                 important classes of indexed data structures are based
                 upon extendible hashing and B-trees. The paradigms of
                 filtering and bootstrapping provide a convenient means
                 in online data structures to make effective use of the
                 data accessed from disk. We also reexamine some of the
                 above EM problems in slightly different settings, such
                 as when the data items are moving, when the data items
                 are variable-length (e.g., text strings), or when the
                 allocated amount of internal memory can change
                 dynamically. Programming tools and environments are
                 available for simplifying the EM programming task.
                 During the course of the survey, we report on some
                 experiments in the domain of spatial databases using
                 the TPIE system (transparent parallel I/O programming
                 environment). The newly developed EM algorithms and
                 data structures that incorporate the paradigms we
                 discuss are significantly faster than methods currently
                 used in practice.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "B-tree; batched; block; disk; dynamic; extendible
                 hashing; external memory; hierarchical memory; I/O;
                 multidimensional access methods; multilevel memory;
                 online; out-of-core; secondary storage; sorting",
}

@Article{Chavez:2001:SMS,
  author =       "Edgar Ch{\'a}vez and Gonzalo Navarro and Ricardo
                 Baeza-Yates and Jos{\'e} Luis Marroqu{\'\i}n",
  title =        "Searching in metric spaces",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "3",
  pages =        "273--321",
  month =        sep,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/502807.502808",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:16:31 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The problem of searching the elements of a set that
                 are close to a given query element under some
                 similarity criterion has a vast number of applications
                 in many branches of computer science, from pattern
                 recognition to textual and multimedia information
                 retrieval. We are interested in the rather general case
                 where the similarity criterion defines a metric space,
                 instead of the more restricted case of a vector space.
                 Many solutions have been proposed in different areas,
                 in many cases without cross-knowledge. Because of this,
                 the same ideas have been reconceived several times, and
                 very different presentations have been given for the
                 same approaches. We present some basic results that
                 explain the intrinsic difficulty of the search problem.
                 This includes a quantitative definition of the elusive
                 concept of 'intrinsic dimensionality.' We also present
                 a unified view of all the known proposals to organize
                 metric spaces, so as to be able to understand them
                 under a common framework. Most approaches turn out to
                 be variations on a few different concepts. We organize
                 those works in a taxonomy that allows us to devise new
                 algorithms from combinations of concepts not noticed
                 before because of the lack of communication between
                 different communities. We present experiments
                 validating our results and comparing the existing
                 approaches. We finish with recommendations for
                 practitioners and open questions for future
                 development.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Curse of dimensionality; nearest neighbors; similarity
                 searching; vector spaces",
}

@Article{Bohm:2001:SHD,
  author =       "Christian B{\"o}hm and Stefan Berchtold and Daniel A.
                 Keim",
  title =        "Searching in high-dimensional spaces: {Index}
                 structures for improving the performance of multimedia
                 databases",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "3",
  pages =        "322--373",
  month =        sep,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/502807.502809",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:16:31 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "During the last decade, multimedia databases have
                 become increasingly important in many application areas
                 such as medicine, CAD, geography, and molecular
                 biology. An important research issue in the field of
                 multimedia databases is the content-based retrieval of
                 similar multimedia objects such as images, text, and
                 videos. However, in contrast to searching data in a
                 relational database, a content-based retrieval requires
                 the search of similar objects as a basic functionality
                 of the database system. Most of the approaches
                 addressing similarity search use a so-called feature
                 transformation that transforms important properties of
                 the multimedia objects into high-dimensional points
                 (feature vectors). Thus, the similarity search is
                 transformed into a search of points in the feature
                 space that are close to a given query point in the
                 high-dimensional feature space. Query processing in
                 high-dimensional spaces has therefore been a very
                 active research area over the last few years. A number
                 of new index structures and algorithms have been
                 proposed. It has been shown that the new index
                 structures considerably improve the performance in
                 querying large multimedia databases. Based on recent
                 tutorials [Berchtold and Keim 1998], in this survey we
                 provide an overview of the current state of the art in
                 querying multimedia databases, describing the index
                 structures and algorithms for an efficient query
                 processing in high-dimensional spaces. We identify the
                 problems of processing queries in high-dimensional
                 space, and we provide an overview of the proposed
                 approaches to overcome these problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Index structures; indexing high-dimensional data;
                 multimedia databases; similarity search",
}

@Article{Dantsin:2001:CEP,
  author =       "Evgeny Dantsin and Thomas Eiter and Georg Gottlob and
                 Andrei Voronkov",
  title =        "Complexity and expressive power of logic programming",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "3",
  pages =        "374--425",
  month =        sep,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/502807.502810",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:16:31 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article surveys various complexity and
                 expressiveness results on different forms of logic
                 programming. The main focus is on decidable forms of
                 logic programming, in particular, propositional logic
                 programming and datalog, but we also mention general
                 logic programming with function symbols. Next to
                 classical results on plain logic programming (pure Horn
                 clause programs), more recent results on various
                 important extensions of logic programming are surveyed.
                 These include logic programming with different forms of
                 negation, disjunctive logic programming, logic
                 programming with equality, and constraint logic
                 programming.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Complexity; datalog; expressive power; logic
                 programming; nonmonotonic logic; query languages",
}

@Article{Chockler:2001:GCS,
  author =       "Gregory V. Chockler and Idit Keidar and Roman
                 Vitenberg",
  title =        "Group communication specifications: a comprehensive
                 study",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "4",
  pages =        "427--469",
  month =        dec,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/503112.503113",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:17:06 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "View-oriented group communication is an important and
                 widely used building block for many distributed
                 applications. Much current research has been dedicated
                 to specifying the semantics and services of
                 view-oriented group communication systems (GCSs).
                 However, the guarantees of different GCSs are
                 formulated using varying terminologies and modeling
                 techniques, and the specifications vary in their rigor.
                 This makes it difficult to analyze and compare the
                 different systems. This survey provides a comprehensive
                 set of clear and rigorous specifications, which may be
                 combined to represent the guarantees of most existing
                 GCSs. In the light of these specifications, over 30
                 published GCS specifications are surveyed. Thus, the
                 specifications serve as a unifying framework for the
                 classification, analysis, and comparison of group
                 communication systems. The survey also discusses over a
                 dozen different applications of group communication
                 systems, shedding light on the usefulness of the
                 presented specifications. This survey is aimed at both
                 system builders and theoretical researchers. The
                 specification framework presented in this article will
                 help builders of group communication systems understand
                 and specify their service semantics; the extensive
                 survey will allow them to compare their service to
                 others. Application builders will find a guide here to
                 the services provided by a large variety of GCSs, which
                 could help them choose the GCS appropriate for their
                 needs. The formal framework may provide a basis for
                 interesting theoretical work, for example, analyzing
                 relative strengths of different properties and the
                 costs of implementing them.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Group communication systems; partitionable group
                 membership; process group membership; specifications of
                 group communication systems; view synchrony; virtual
                 synchrony",
}

@Article{Ivory:2001:SAA,
  author =       "Melody Y. Ivory and Marti A. Hearst",
  title =        "The state of the art in automating usability
                 evaluation of user interfaces",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "4",
  pages =        "470--516",
  month =        dec,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/503112.503114",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:17:06 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Usability evaluation is an increasingly important part
                 of the user interface design process. However,
                 usability evaluation can be expensive in terms of time
                 and human resources, and automation is therefore a
                 promising way to augment existing approaches. This
                 article presents an extensive survey of usability
                 evaluation methods, organized according to a new
                 taxonomy that emphasizes the role of automation. The
                 survey analyzes existing techniques, identifies which
                 aspects of usability evaluation automation are likely
                 to be of use in future research, and suggests new ways
                 to expand existing approaches to better support
                 usability evaluation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Graphical user interfaces; taxonomy; usability
                 evaluation automation; Web interfaces",
}

@Article{Hartel:2001:FSJ,
  author =       "Pieter H. Hartel and Luc Moreau",
  title =        "Formalizing the safety of {Java}, the {Java Virtual
                 Machine}, and {Java} card",
  journal =      j-COMP-SURV,
  volume =       "33",
  number =       "4",
  pages =        "517--558",
  month =        dec,
  year =         "2001",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/503112.503115",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:17:06 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We review the existing literature on Java safety,
                 emphasizing formal approaches, and the impact of Java
                 safety on small footprint devices such as smartcards.
                 The conclusion is that although a lot of good work has
                 been done, a more concerted effort is needed to build a
                 coherent set of machine-readable formal models of the
                 whole of Java and its implementation. This is a
                 formidable task but we believe it is essential to build
                 trust in Java safety, and thence to achieve ITSEC level
                 6 or Common Criteria level 7 certification for Java
                 programs.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Common criteria; programming",
}

@Article{Sebastiani:2002:MLA,
  author =       "Fabrizio Sebastiani",
  title =        "Machine learning in automated text categorization",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "1",
  pages =        "1--47",
  month =        mar,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/505282.505283",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:17:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The automated categorization (or classification) of
                 texts into predefined categories has witnessed a
                 booming interest in the last 10 years, due to the
                 increased availability of documents in digital form and
                 the ensuing need to organize them. In the research
                 community the dominant approach to this problem is
                 based on machine learning techniques: a general
                 inductive process automatically builds a classifier by
                 learning, from a set of preclassified documents, the
                 characteristics of the categories. The advantages of
                 this approach over the knowledge engineering approach
                 (consisting in the manual definition of a classifier by
                 domain experts) are a very good effectiveness,
                 considerable savings in terms of expert labor power,
                 and straightforward portability to different domains.
                 This survey discusses the main approaches to text
                 categorization that fall within the machine learning
                 paradigm. We will discuss in detail issues pertaining
                 to three different problems, namely, document
                 representation, classifier construction, and classifier
                 evaluation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Machine learning; text categorization; text
                 classification",
}

@Article{Meng:2002:BEE,
  author =       "Weiyi Meng and Clement Yu and King-Lup Liu",
  title =        "Building efficient and effective metasearch engines",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "1",
  pages =        "48--89",
  month =        mar,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/505282.505284",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:17:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Frequently a user's information needs are stored in
                 the databases of multiple search engines. It is
                 inconvenient and inefficient for an ordinary user to
                 invoke multiple search engines and identify useful
                 documents from the returned results. To support unified
                 access to multiple search engines, a metasearch engine
                 can be constructed. When a metasearch engine receives a
                 query from a user, it invokes the underlying search
                 engines to retrieve useful information for the user.
                 Metasearch engines have other benefits as a search tool
                 such as increasing the search coverage of the Web and
                 improving the scalability of the search. In this
                 article, we survey techniques that have been proposed
                 to tackle several underlying challenges for building a
                 good metasearch engine. Among the main challenges, the
                 database selection problem is to identify search
                 engines that are likely to return useful documents to a
                 given query. The document selection problem is to
                 determine what documents to retrieve from each
                 identified search engine. The result merging problem is
                 to combine the documents returned from multiple search
                 engines. We will also point out some problems that need
                 to be further researched.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Collection fusion; distributed collection; distributed
                 information retrieval; information resource discovery;
                 metasearch",
}

@Article{McTear:2002:SDT,
  author =       "Michael F. McTear",
  title =        "Spoken dialogue technology: enabling the
                 conversational user interface",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "1",
  pages =        "90--169",
  month =        mar,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/505282.505285",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:17:34 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Spoken dialogue systems allow users to interact with
                 computer-based applications such as databases and
                 expert systems by using natural spoken language. The
                 origins of spoken dialogue systems can be traced back
                 to Artificial Intelligence research in the 1950s
                 concerned with developing conversational interfaces.
                 However, it is only within the last decade or so, with
                 major advances in speech technology, that large-scale
                 working systems have been developed and, in some cases,
                 introduced into commercial environments. As a result
                 many major telecommunications and software companies
                 have become aware of the potential for spoken dialogue
                 technology to provide solutions in newly developing
                 areas such as computer-telephony integration. Voice
                 portals, which provide a speech-based interface between
                 a telephone user and Web-based services, are the most
                 recent application of spoken dialogue technology. This
                 article describes the main components of the
                 technology---speech recognition, language
                 understanding, dialogue management, communication with
                 an external source such as a database, language
                 generation, speech synthesis---and shows how these
                 component technologies can be integrated into a spoken
                 dialogue system. The article describes in detail the
                 methods that have been adopted in some well-known
                 dialogue systems, explores different system
                 architectures, considers issues of specification,
                 design, and evaluation, reviews some currently
                 available dialogue development toolkits, and outlines
                 prospects for future development.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Dialogue management; human computer interaction;
                 language generation; language understanding; speech
                 recognition; speech synthesis",
}

@Article{Compton:2002:RCS,
  author =       "Katherine Compton and Scott Hauck",
  title =        "Reconfigurable computing: a survey of systems and
                 software",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "2",
  pages =        "171--210",
  month =        jun,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/508352.508353",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:17:56 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Due to its potential to greatly accelerate a wide
                 variety of applications, reconfigurable computing has
                 become a subject of a great deal of research. Its key
                 feature is the ability to perform computations in
                 hardware to increase performance, while retaining much
                 of the flexibility of a software solution. In this
                 survey, we explore the hardware aspects of
                 reconfigurable computing machines, from single chip
                 architectures to multi-chip systems, including internal
                 structures and external coupling. We also focus on the
                 software that targets these machines, such as
                 compilation tools that map high-level algorithms
                 directly to the reconfigurable substrate. Finally, we
                 consider the issues involved in run-time reconfigurable
                 systems, which reuse the configurable hardware during
                 program execution.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Automatic design; field-programmable; FPGA; manual
                 design; reconfigurable architectures; reconfigurable
                 computing; reconfigurable systems",
}

@Article{Petitjean:2002:SMR,
  author =       "Sylvain Petitjean",
  title =        "A survey of methods for recovering quadrics in
                 triangle meshes",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "2",
  pages =        "211--262",
  month =        jun,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/508352.508354",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:17:56 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In a variety of practical situations such as reverse
                 engineering of boundary representation from depth maps
                 of scanned objects, range data analysis, model-based
                 recognition and algebraic surface design, there is a
                 need to recover the shape of visible surfaces of a
                 dense 3D point set. In particular, it is desirable to
                 identify and fit simple surfaces of known type wherever
                 these are in reasonable agreement with the data. We are
                 interested in the class of quadric surfaces, that is,
                 algebraic surfaces of degree 2, instances of which are
                 the sphere, the cylinder and the cone. A comprehensive
                 survey of the recent work in each subtask pertaining to
                 the extraction of quadric surfaces from triangulations
                 is presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Data fitting; geometry enhancement; local geometry
                 estimation; mesh fairing; shape recovery",
}

@Article{Cardellini:2002:SAL,
  author =       "Valeria Cardellini and Emiliano Casalicchio and
                 Michele Colajanni and Philip S. Yu",
  title =        "The state of the art in locally distributed
                 {Web}-server systems",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "2",
  pages =        "263--311",
  month =        jun,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/508352.508355",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:17:56 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The overall increase in traffic on the World Wide Web
                 is augmenting user-perceived response times from
                 popular Web sites, especially in conjunction with
                 special events. System platforms that do not replicate
                 information content cannot provide the needed
                 scalability to handle large traffic volumes and to
                 match rapid and dramatic changes in the number of
                 clients. The need to improve the performance of
                 Web-based services has produced a variety of novel
                 content delivery architectures. This article will focus
                 on Web system architectures that consist of multiple
                 server nodes distributed on a local area, with one or
                 more mechanisms to spread client requests among the
                 nodes. After years of continual proposals of new system
                 solutions, routing mechanisms, and policies (the first
                 dated back to 1994 when the NCSA Web site had to face
                 the first million of requests per day), many problems
                 concerning multiple server architectures for Web sites
                 have been solved. Other issues remain to be addressed,
                 especially at the network application layer, but the
                 main techniques and methodologies for building scalable
                 Web content delivery architectures placed in a single
                 location are settled now. This article classifies and
                 describes main mechanisms to split the traffic load
                 among the server nodes, discussing both the alternative
                 architectures and the load sharing policies. To this
                 purpose, it focuses on architectures, internal routing
                 mechanisms, and dispatching request algorithms for
                 designing and implementing scalable Web-server systems
                 under the control of one content provider. It
                 identifies also some of the open research issues
                 associated with the use of distributed systems for
                 highly accessed Web sites.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Client/server; cluster-based architectures;
                 dispatching algorithms; distributed systems; load
                 balancing; routing mechanisms; World Wide Web",
}

@Article{Diaz:2002:SGL,
  author =       "Josep D{\'\i}az and Jordi Petit and Maria Serna",
  title =        "A survey of graph layout problems",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "3",
  pages =        "313--356",
  month =        sep,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/568522.568523",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:18:14 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Graph layout problems are a particular class of
                 combinatorial optimization problems whose goal is to
                 find a linear layout of an input graph in such way that
                 a certain objective cost is optimized. This survey
                 considers their motivation, complexity, approximation
                 properties, upper and lower bounds, heuristics and
                 probabilistic analysis on random graphs. The result is
                 a complete view of the current state of the art with
                 respect to layout problems from an algorithmic point of
                 view.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Approximation algorithms; complexity; embedding;
                 heuristics; layout; parameterized complexity; random
                 graphs",
}

@Article{Elaarag:2002:ITP,
  author =       "Hala Elaarag",
  title =        "Improving {TCP} performance over mobile networks",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "3",
  pages =        "357--374",
  month =        sep,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/568522.568524",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:18:14 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Transmission Control Protocol (TCP) is the most
                 commonly used transport protocol on the Internet. All
                 indications assure that mobile computers and their
                 wireless communication links will be an integral part
                 of the future internetworks. In this paper, we present
                 how regular TCP is well tuned to react to packet loss
                 in wired networks. We then define mobility and the
                 problems associated with it. We discuss why regular TCP
                 is not suitable for mobile hosts and their wireless
                 links by providing simulation results that demonstrate
                 the effect of the high bit error rates of the wireless
                 link on TCP performance. We discuss and illustrate the
                 problems caused by the mobility of hosts using a graph
                 tracing packets between fixed and mobile hosts. We then
                 present a survey of the research done to improve the
                 performance of TCP over mobile wireless networks. We
                 classify the proposed solutions into three categories:
                 link layer, end-to-end and split. We discuss the
                 intuition behind each solution and present example
                 protocols of each category. We discuss the protocols
                 functionality, their strengths and weaknesses. We also
                 provide a comparison of the different approaches in the
                 same category and on the category level. We conclude
                 this survey with a recommendation of the features that
                 need to be satisfied in a standard mobile TCP
                 protocol.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "base station; comparison of TCP implementations;
                 end-to-end; I-TCP; link layer; M-TCP; mobile host;
                 mobile TCP; mobile wireless networks; mobility; MTCP;
                 New-Reno; Reno; SACK; snoop; split TCP; standard TCP;
                 TCP performance; WAP; wired networks; wireless TCP;
                 WTCP",
}

@Article{Elnozahy:2002:SRR,
  author =       "E. N. (Mootaz) Elnozahy and Lorenzo Alvisi and Yi-Min
                 Wang and David B. Johnson",
  title =        "A survey of rollback-recovery protocols in
                 message-passing systems",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "3",
  pages =        "375--408",
  month =        sep,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/568522.568525",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:18:14 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This survey covers rollback-recovery techniques that
                 do not require special language constructs. In the
                 first part of the survey we classify rollback-recovery
                 protocols into checkpoint-based and log-based.
                 Checkpoint-based protocols rely solely on checkpointing
                 for system state restoration. Checkpointing can be
                 coordinated, uncoordinated, or communication-induced.
                 Log-based protocols combine checkpointing with logging
                 of nondeterministic events, encoded in tuples called
                 determinants. Depending on how determinants are logged,
                 log-based protocols can be pessimistic, optimistic, or
                 causal. Throughout the survey, we highlight the
                 research issues that are at the core of
                 rollback-recovery and present the solutions that
                 currently address them. We also compare the performance
                 of different rollback-recovery protocols with respect
                 to a series of desirable properties and discuss the
                 issues that arise in the practical implementations of
                 these protocols.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "message logging; rollback-recovery",
}

@Article{Leontiev:2002:TSO,
  author =       "Yuri Leontiev and M. Tamer {\"O}zsu and Duane
                 Szafron",
  title =        "On type systems for object-oriented database
                 programming languages",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "4",
  pages =        "409--449",
  month =        dec,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/592642.592643",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:18:33 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The concept of an object-oriented database programming
                 language (OODBPL) is appealing because it has the
                 potential of combining the advantages of object
                 orientation and database programming to yield a
                 powerful and universal programming language design. A
                 uniform and consistent combination of object
                 orientation and database programming, however, is not
                 straightforward. Since one of the main components of an
                 object-oriented programming language is its type
                 system, one of the first problems that arises during an
                 OODBPL design is related to the development of a
                 uniform, consistent, and theoretically sound type
                 system that is sufficiently expressive to satisfy the
                 combined needs of object orientation and database
                 programming. The purpose of this article is to answer
                 two questions: 'What are the requirements that a modern
                 type system for an object-oriented database programming
                 language should satisfy?' and 'Are there any type
                 systems developed to-date that satisfy these
                 requirements?'. In order to answer the first question,
                 we compile the set of requirements that an OODBPL type
                 system should satisfy. We then use this set of
                 requirements to evaluate more than 30 existing type
                 systems. The result of this extensive analysis shows
                 that while each of the requirements is satisfied by at
                 least one type system, no type system satisfies all of
                 them. It also enables identification of the mechanisms
                 that lie behind the strengths and weaknesses of the
                 current type systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "object-oriented database programming language; OODB;
                 OODBPL; type checking; typing",
}

@Article{Denys:2002:SCO,
  author =       "G. Denys and F. Piessens and F. Matthijs",
  title =        "A survey of customizability in operating systems
                 research",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "4",
  pages =        "450--468",
  month =        dec,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/592642.592644",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:18:33 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "An important goal of an operating system is to make
                 computing and communication resources available in a
                 fair and efficient way to the applications that will
                 run on top of it. To achieve this result, the operating
                 system implements a number of policies for allocating
                 resources to, and sharing resources among applications,
                 and it implements safety mechanisms to guard against
                 misbehaving applications. However, for most of these
                 allocation and sharing tasks, no single optimal policy
                 exists. Different applications may prefer different
                 operating system policies to achieve their goals in the
                 best possible way. A customizable or adaptable
                 operating system is an operating system that allows for
                 flexible modification of important system policies.
                 Over the past decade, a wide range of approaches for
                 achieving customizability has been explored in the
                 operating systems research community. In this survey,
                 an overview of these approaches, structured around a
                 taxonomy, is presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Customizability; microkernels; operating systems;
                 software protection mechanisms",
}

@Article{Dhyani:2002:SWM,
  author =       "Devanshu Dhyani and Wee Keong Ng and Sourav S.
                 Bhowmick",
  title =        "A survey of {Web} metrics",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "4",
  pages =        "469--503",
  month =        dec,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/592642.592645",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:18:33 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The unabated growth and increasing significance of the
                 World Wide Web has resulted in a flurry of research
                 activity to improve its capacity for serving
                 information more effectively. But at the heart of these
                 efforts lie implicit assumptions about 'quality' and
                 'usefulness' of Web resources and services. This
                 observation points towards measurements and models that
                 quantify various attributes of Web sites. The science
                 of measuring all aspects of information, especially its
                 storage and retrieval or informetrics has interested
                 information scientists for decades before the existence
                 of the Web. Is Web informetrics any different, or is it
                 just an application of classical informetrics to a new
                 medium? In this article, we examine this issue by
                 classifying and discussing a wide ranging set of Web
                 metrics. We present the origins, measurement functions,
                 formulations and comparisons of well-known Web metrics
                 for quantifying Web graph properties, Web page
                 significance, Web page similarity, search and
                 retrieval, usage characterization and information
                 theoretic properties. We also discuss how these metrics
                 can be applied for improving Web information access and
                 use.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Information theoretic; PageRank; quality metrics; Web
                 graph; Web metrics; Web page similarity",
}

@Article{Rothe:2002:SFC,
  author =       "J{\"o}rg Rothe",
  title =        "Some facets of complexity theory and cryptography: a
                 five-lecture tutorial",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "4",
  pages =        "504--549",
  month =        dec,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/592642.592646",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:18:33 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In this tutorial, selected topics of cryptology and of
                 computational complexity theory are presented. We give
                 a brief overview of the history and the foundations of
                 classical cryptography, and then move on to modern
                 public-key cryptography. Particular attention is paid
                 to cryptographic protocols and the problem of
                 constructing key components of protocols such as
                 one-way functions. A function is one-way if it is easy
                 to compute, but hard to invert. We discuss the notion
                 of one-way functions both in a cryptographic and in a
                 complexity-theoretic setting. We also consider
                 interactive proof systems and present some interesting
                 zero-knowledge protocols. In a zero-knowledge protocol,
                 one party can convince the other party of knowing some
                 secret information without disclosing any bit of this
                 information. Motivated by these protocols, we survey
                 some complexity-theoretic results on interactive proof
                 systems and related complexity classes.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Complexity theory; interactive proof systems; one-way
                 functions; public-key cryptography; zero-knowledge
                 protocols",
}

@Article{Agarwal:2002:AIM,
  author =       "Pankaj K. Agarwal and Leonidas J. Guibas and Herbert
                 Edelsbrunner and Jeff Erickson and Michael Isard and
                 Sariel Har-Peled and John Hershberger and Christian
                 Jensen and Lydia Kavraki and Patrice Koehl and Ming Lin
                 and Dinesh Manocha and Dimitris Metaxas and Brian
                 Mirtich and David Mount and S. Muthukrishnan and Dinesh
                 Pai and Elisha Sacks and Jack Snoeyink and Subhash Suri
                 and Ouri Wolefson",
  title =        "Algorithmic issues in modeling motion",
  journal =      j-COMP-SURV,
  volume =       "34",
  number =       "4",
  pages =        "550--572",
  month =        dec,
  year =         "2002",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/592642.592647",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:18:33 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article is a survey of research areas in which
                 motion plays a pivotal role. The aim of the article is
                 to review current approaches to modeling motion
                 together with related data structures and algorithms,
                 and to summarize the challenges that lie ahead in
                 producing a more unified theory of motion
                 representation that would be useful across several
                 disciplines.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Computational geometry; computer vision; mobile
                 networks; modeling; molecular biology; motion modeling;
                 physical simulation; robotics; spatio-temporal
                 databases",
}

@Article{Dedrick:2003:ITE,
  author =       "Jason Dedrick and Vijay Gurbaxani and Kenneth L.
                 Kraemer",
  title =        "Information technology and economic performance: a
                 critical review of the empirical evidence",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "1",
  pages =        "1--28",
  month =        mar,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/641865.641866",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:18:52 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "For many years, there has been considerable debate
                 about whether the IT revolution was paying off in
                 higher productivity. Studies in the 1980s found no
                 connection between IT investment and productivity in
                 the U.S. economy, a situation referred to as the
                 productivity paradox. Since then, a decade of studies
                 at the firm and country level has consistently shown
                 that the impact of IT investment on labor productivity
                 and economic growth is significant and positive. This
                 article critically reviews the published research, more
                 than 50 articles, on computers and productivity. It
                 develops a general framework for classifying the
                 research, which facilitates identifying what we know,
                 how well we know it, and what we do not know. The
                 framework enables us to systematically organize,
                 synthesize, and evaluate the empirical evidence and to
                 identify both limitations in existing research and data
                 and substantive areas for future research. The review
                 concludes that the productivity paradox as first
                 formulated has been effectively refuted. At both the
                 firm and the country level, greater investment in IT is
                 associated with greater productivity growth. At the
                 firm level, the review further concludes that the wide
                 range of performance of IT investments among different
                 organizations can be explained by complementary
                 investments in organizational capital such as
                 decentralized decision-making systems, job training,
                 and business process redesign. IT is not simply a tool
                 for automating existing processes, but is more
                 importantly an enabler of organizational changes that
                 can lead to additional productivity gains. In mid-2000,
                 IT capital investment began to fall sharply due to
                 slowing economic growth, the collapse of many
                 Internet-related firms, and reductions in IT spending
                 by other firms facing fewer competitive pressures from
                 Internet firms. This reduction in IT investment has had
                 devastating effects on the IT-producing sector, and may
                 lead to slower economic and productivity growth in the
                 U.S. economy. While the turmoil in the technology
                 sector has been unsettling to investors and executives
                 alike, this review shows that it should not overshadow
                 the fundamental changes that have occurred as a result
                 of firms' investments in IT. Notwithstanding the demise
                 of many Internet-related companies, the returns to IT
                 investment are real, and innovative companies continue
                 to lead the way.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "country; economic performance; firm; industry;
                 Information technology; management practices;
                 productivity",
}

@Article{Ungerer:2003:SPE,
  author =       "Theo Ungerer and Borut Robi{\v{c}} and Jurij
                 {\v{S}}ilc",
  title =        "A survey of processors with explicit multithreading",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "1",
  pages =        "29--63",
  month =        mar,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/641865.641867",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:18:52 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Hardware multithreading is becoming a generally
                 applied technique in the next generation of
                 microprocessors. Several multithreaded processors are
                 announced by industry or already into production in the
                 areas of high-performance microprocessors, media, and
                 network processors. A multithreaded processor is able
                 to pursue two or more threads of control in parallel
                 within the processor pipeline. The contexts of two or
                 more threads of control are often stored in separate
                 on-chip register sets. Unused instruction slots, which
                 arise from latencies during the pipelined execution of
                 single-threaded programs by a contemporary
                 microprocessor, are filled by instructions of other
                 threads within a multithreaded processor. The execution
                 units are multiplexed between the thread contexts that
                 are loaded in the register sets. Underutilization of a
                 superscalar processor due to missing instruction-level
                 parallelism can be overcome by simultaneous
                 multithreading, where a processor can issue multiple
                 instructions from multiple threads each cycle.
                 Simultaneous multithreaded processors combine the
                 multithreading technique with a wide-issue superscalar
                 processor to utilize a larger part of the issue
                 bandwidth by issuing instructions from different
                 threads simultaneously. Explicit multithreaded
                 processors are multithreaded processors that apply
                 processes or operating system threads in their hardware
                 thread slots. These processors optimize the throughput
                 of multiprogramming workloads rather than single-thread
                 performance. We distinguish these processors from
                 implicit multithreaded processors that utilize
                 thread-level speculation by speculatively executing
                 compiler- or machine-generated threads of control that
                 are part of a single sequential program. This survey
                 paper explains and classifies the explicit
                 multithreading techniques in research and in commercial
                 microprocessors.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Blocked multithreading; interleaved multithreading;
                 simultaneous multithreading",
}

@Article{Scott:2003:VPA,
  author =       "William R. Scott and Gerhard Roth and
                 Jean-Fran{\c{c}}ois Rivest",
  title =        "View planning for automated three-dimensional object
                 reconstruction and inspection",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "1",
  pages =        "64--96",
  month =        mar,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/641865.641868",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:18:52 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Laser scanning range sensors are widely used for
                 high-precision, high-density three-dimensional (3D)
                 reconstruction and inspection of the surface of
                 physical objects. The process typically involves
                 planning a set of views, physically altering the
                 relative object-sensor pose, taking scans, registering
                 the acquired geometric data in a common coordinate
                 frame of reference, and finally integrating range
                 images into a nonredundant model. Efficiencies could be
                 achieved by automating or semiautomating this process.
                 While challenges remain, there are adequate solutions
                 to semiautomate the scan-register-integrate tasks. On
                 the other hand, view planning remains an open
                 problem---that is, the task of finding a suitably small
                 set of sensor poses and configurations for specified
                 reconstruction or inspection goals. This paper surveys
                 and compares view planning techniques for automated 3D
                 object reconstruction and inspection by means of
                 active, triangulation-based range sensors.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "object inspection; object reconstruction; range
                 images; View planning",
}

@Article{Aycock:2003:BHJ,
  author =       "John Aycock",
  title =        "A brief history of just-in-time",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "2",
  pages =        "97--113",
  month =        jun,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/857076.857077",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:04 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Software systems have been using 'just-in-time'
                 compilation (JIT) techniques since the 1960s. Broadly,
                 JIT compilation includes any translation performed
                 dynamically, after a program has started execution. We
                 examine the motivation behind JIT compilation and
                 constraints imposed on JIT compilation systems, and
                 present a classification scheme for such systems. This
                 classification emerges as we survey forty years of JIT
                 work, from 1960--2000.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "dynamic compilation; Just-in-time compilation",
}

@Article{Eugster:2003:MFP,
  author =       "Patrick Th. Eugster and Pascal A. Felber and Rachid
                 Guerraoui and Anne-Marie Kermarrec",
  title =        "The many faces of publish\slash subscribe",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "2",
  pages =        "114--131",
  month =        jun,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/857076.857078",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:04 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Well adapted to the loosely coupled nature of
                 distributed interaction in large-scale applications,
                 the publish/subscribe communication paradigm has
                 recently received increasing attention. With systems
                 based on the publish/subscribe interaction scheme,
                 subscribers register their interest in an event, or a
                 pattern of events, and are subsequently asynchronously
                 notified of events generated by publishers. Many
                 variants of the paradigm have recently been proposed,
                 each variant being specifically adapted to some given
                 application or network model. This paper factors out
                 the common denominator underlying these variants: full
                 decoupling of the communicating entities in time,
                 space, and synchronization. We use these three
                 decoupling dimensions to better identify commonalities
                 and divergences with traditional interaction paradigms.
                 The many variations on the theme of publish/subscribe
                 are classified and synthesized. In particular, their
                 respective benefits and shortcomings are discussed both
                 in terms of interfaces and implementations.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Distribution; interaction; publish/subscribe",
}

@Article{Robinson:2003:RIM,
  author =       "William N. Robinson and Suzanne D. Pawlowski and
                 Vecheslav Volkov",
  title =        "Requirements interaction management",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "2",
  pages =        "132--190",
  month =        jun,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/857076.857079",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:04 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Requirements interaction management (RIM) is the set
                 of activities directed toward the discovery,
                 management, and disposition of critical relationships
                 among sets of requirements, which has become a critical
                 area of requirements engineering. This survey looks at
                 the evolution of supporting concepts and their related
                 literature, presents an issues-based framework for
                 reviewing processes and products, and applies the
                 framework in a review of RIM state-of-the-art. Finally,
                 it presents seven research projects that exemplify this
                 emerging discipline.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "analysis and design; composite system; deficiency
                 driven design; dependency analysis; distributed
                 intentionality; interaction analysis; KAOS; KATE; Oz;
                 Requirements engineering; software cost reduction
                 (SCR); system architecture; system specification;
                 Telos; viewpoints; WinWin",
}

@Article{Purao:2003:PMO,
  author =       "Sandeep Purao and Vijay Vaishnavi",
  title =        "Product metrics for object-oriented systems",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "2",
  pages =        "191--221",
  month =        jun,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/857076.857090",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:04 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We survey metrics proposed for object-oriented
                 systems, focusing on product metrics. The survey is
                 intended for the purposes of understanding,
                 classifying, and analyzing ongoing research in
                 object-oriented metrics. The survey applies fundamental
                 measurement theory to artifacts created by development
                 activities. We develop a mathematical formalism that
                 captures this perspective clearly, giving appropriate
                 attention to the peculiarities of the object-oriented
                 system development process. Consistent representation
                 of the available metrics, following this mathematical
                 formalism, shows that current research in this area
                 contains varying coverage of different products and
                 their properties at different development stages. The
                 consistent representation also facilitates several
                 analyses including aggregation across metrics, usage
                 across metrics, equivalent formulation of metrics by
                 multiple researchers, and exploitation of traditional
                 metrics for object-oriented metrics. We also trace the
                 chronological development of research in this area, and
                 uncover gaps that suggest opportunities for future
                 research.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "measurement theory; object-oriented metrics;
                 object-oriented product metrics; object-oriented
                 systems; Software metrics",
}

@Article{Beszdes:2003:SCS,
  author =       "{\'A}rp{\'a}d Besz{\'e}des and Rudolf Ferenc and Tibor
                 Gyim{\'o}thy and Andr{\'e} Dolenc and Konsta Karsisto",
  title =        "Survey of code-size reduction methods",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "3",
  pages =        "223--267",
  month =        sep,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/937503.937504",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:22 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Program code compression is an emerging research
                 activity that is having an impact in several production
                 areas such as networking and embedded systems. This is
                 because the reduced-sized code can have a positive
                 impact on network traffic and embedded system costs
                 such as memory requirements and power consumption.
                 Although code-size reduction is a relatively new
                 research area, numerous publications already exist on
                 it. The methods published usually have different
                 motivations and a variety of application contexts. They
                 may use different principles and their publications
                 often use diverse notations. To our knowledge, there
                 are no publications that present a good overview of
                 this broad range of methods and give a useful
                 assessment. This article surveys twelve methods and
                 several related works appearing in some 50 papers
                 published up to now. We provide extensive assessment
                 criteria for evaluating the methods and offer a basis
                 for comparison. We conclude that it is fairly hard to
                 make any fair comparisons of the methods or draw
                 conclusions about their applicability.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "code compaction; code compression; method assessment;
                 method evaluation",
}

@Article{Blum:2003:MCO,
  author =       "Christian Blum and Andrea Roli",
  title =        "Metaheuristics in combinatorial optimization:
                 {Overview} and conceptual comparison",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "3",
  pages =        "268--308",
  month =        sep,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/937503.937505",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:22 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The field of metaheuristics for the application to
                 combinatorial optimization problems is a rapidly
                 growing field of research. This is due to the
                 importance of combinatorial optimization problems for
                 the scientific as well as the industrial world. We give
                 a survey of the nowadays most important metaheuristics
                 from a conceptual point of view. We outline the
                 different components and concepts that are used in the
                 different metaheuristics in order to analyze their
                 similarities and differences. Two very important
                 concepts in metaheuristics are intensification and
                 diversification. These are the two forces that largely
                 determine the behavior of a metaheuristic. They are in
                 some way contrary but also complementary to each other.
                 We introduce a framework, that we call the I\&D frame,
                 in order to put different intensification and
                 diversification components into relation with each
                 other. Outlining the advantages and disadvantages of
                 different metaheuristic approaches we conclude by
                 pointing out the importance of hybridization of
                 metaheuristics as well as the integration of
                 metaheuristics and other methods for optimization.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "combinatorial optimization; diversification;
                 intensification; Metaheuristics",
}

@Article{Rafaeli:2003:SKM,
  author =       "Sandro Rafaeli and David Hutchison",
  title =        "A survey of key management for secure group
                 communication",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "3",
  pages =        "309--329",
  month =        sep,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/937503.937506",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:22 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Group communication can benefit from IP multicast to
                 achieve scalable exchange of messages. However, there
                 is a challenge of effectively controlling access to the
                 transmitted data. IP multicast by itself does not
                 provide any mechanisms for preventing nongroup members
                 to have access to the group communication. Although
                 encryption can be used to protect messages exchanged
                 among group members, distributing the cryptographic
                 keys becomes an issue. Researchers have proposed
                 several different approaches to group key management.
                 These approaches can be divided into three main
                 classes: centralized group key management protocols,
                 decentralized architectures and distributed key
                 management protocols. The three classes are described
                 here and an insight given to their features and goals.
                 The area of group key management is then surveyed and
                 proposed solutions are classified according to those
                 characteristics.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Group Key Distribution; Multicast Security",
}

@Article{Westermann:2003:AXD,
  author =       "Utz Westermann and Wolfgang Klas",
  title =        "An analysis of {XML} database solutions for the
                 management of {MPEG-7} media descriptions",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "4",
  pages =        "331--373",
  month =        dec,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/954339.954340",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:32 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "MPEG-7 constitutes a promising standard for the
                 description of multimedia content. It can be expected
                 that a lot of applications based on MPEG-7 media
                 descriptions will be set up in the near future.
                 Therefore, means for the adequate management of large
                 amounts of MPEG-7-compliant media descriptions are
                 certainly desirable. Essentially, MPEG-7 media
                 descriptions are XML documents following media
                 description schemes defined with a variant of XML
                 Schema. Thus, it is reasonable to investigate current
                 database solutions for XML documents regarding their
                 suitability for the management of these descriptions.
                 In this paper, we motivate and present critical
                 requirements for the management of MPEG-7 media
                 descriptions and the resulting consequences for XML
                 database solutions. Along these requirements, we
                 discuss current state-of-the-art database solutions for
                 XML documents. The analysis and comparison unveil the
                 limitations of current database solutions with respect
                 to the management of MPEG-7 media descriptions and
                 point the way to the need for a new generation of XML
                 database solutions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "MPEG-7; multimedia databases; XML database systems",
}

@Article{Podlipnig:2003:SWC,
  author =       "Stefan Podlipnig and Laszlo B{\"o}sz{\"o}rmenyi",
  title =        "A survey of {Web} cache replacement strategies",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "4",
  pages =        "374--398",
  month =        dec,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/954339.954341",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:32 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Web caching is an important technique to scale the
                 Internet. One important performance factor of Web
                 caches is the replacement strategy. Due to specific
                 characteristics of the World Wide Web, there exist a
                 huge number of proposals for cache replacement. This
                 article proposes a classification for these proposals
                 that subsumes prior classifications. Using this
                 classification, different proposals and their
                 advantages and disadvantages are described.
                 Furthermore, the article discusses the importance of
                 cache replacement strategies in modern proxy caches and
                 outlines potential future research topics.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "replacement strategies; Web caching",
}

@Article{Zhao:2003:FRL,
  author =       "W. Zhao and R. Chellappa and P. J. Phillips and A.
                 Rosenfeld",
  title =        "Face recognition: a literature survey",
  journal =      j-COMP-SURV,
  volume =       "35",
  number =       "4",
  pages =        "399--458",
  month =        dec,
  year =         "2003",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/954339.954342",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:32 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "As one of the most successful applications of image
                 analysis and understanding, face recognition has
                 recently received significant attention, especially
                 during the past several years. At least two reasons
                 account for this trend: the first is the wide range of
                 commercial and law enforcement applications, and the
                 second is the availability of feasible technologies
                 after 30 years of research. Even though current machine
                 recognition systems have reached a certain level of
                 maturity, their success is limited by the conditions
                 imposed by many real applications. For example,
                 recognition of face images acquired in an outdoor
                 environment with changes in illumination and/or pose
                 remains a largely unsolved problem. In other words,
                 current systems are still far away from the capability
                 of the human perception system. This paper provides an
                 up-to-date critical survey of still- and video-based
                 face recognition research. There are two underlying
                 motivations for us to write this survey paper: the
                 first is to provide an up-to-date review of the
                 existing literature, and the second is to offer some
                 insights into the studies of machine recognition of
                 faces. To provide a comprehensive survey, we not only
                 categorize existing recognition techniques but also
                 present detailed descriptions of representative methods
                 within each category. In addition, relevant topics such
                 as psychophysical studies, system evaluation, and
                 issues of illumination and pose variation are
                 covered.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Face recognition; person identification",
}

@Article{Johnston:2004:ADP,
  author =       "Wesley M. Johnston and J. R. Paul Hanna and Richard J.
                 Millar",
  title =        "Advances in dataflow programming languages",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "1",
  pages =        "1--34",
  month =        mar,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1013208.1013209",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Many developments have taken place within dataflow
                 programming languages in the past decade. In
                 particular, there has been a great deal of activity and
                 advancement in the field of dataflow visual programming
                 languages. The motivation for this article is to review
                 the content of these recent developments and how they
                 came about. It is supported by an initial review of
                 dataflow programming in the 1970s and 1980s that led to
                 current topics of research. It then discusses how
                 dataflow programming evolved toward a hybrid von
                 Neumann dataflow formulation, and adopted a more
                 coarse-grained approach. Recent trends toward dataflow
                 visual programming languages are then discussed with
                 reference to key graphical dataflow languages and their
                 development environments. Finally, the article details
                 four key open topics in dataflow programming
                 languages.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "co-ordination languages; component software; data flow
                 visual programming; Dataflow; graphical programming;
                 multithreading; software engineering",
}

@Article{Kherfi:2004:IRW,
  author =       "M. L. Kherfi and D. Ziou and A. Bernardi",
  title =        "Image Retrieval from the {World Wide Web}: {Issues},
                 Techniques, and Systems",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "1",
  pages =        "35--67",
  month =        mar,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1013208.1013210",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "With the explosive growth of the World Wide Web, the
                 public is gaining access to massive amounts of
                 information. However, locating needed and relevant
                 information remains a difficult task, whether the
                 information is textual or visual. Text search engines
                 have existed for some years now and have achieved a
                 certain degree of success. However, despite the large
                 number of images available on the Web, image search
                 engines are still rare. In this article, we show that
                 in order to allow people to profit from all this visual
                 information, there is a need to develop tools that help
                 them to locate the needed images with good precision in
                 a reasonable time, and that such tools are useful for
                 many applications and purposes. The article surveys the
                 main characteristics of the existing systems most often
                 cited in the literature, such as ImageRover, WebSeek,
                 Diogenes, and Atlas WISE. It then examines the various
                 issues related to the design and implementation of a
                 Web image search engine, such as data gathering and
                 digestion, indexing, query specification, retrieval and
                 similarity, Web coverage, and performance evaluation. A
                 general discussion is given for each of these issues,
                 with examples of the ways they are addressed by
                 existing engines, and 130 related references are given.
                 Some concluding remarks and directions for future
                 research are also presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "crawling; feature extraction and selection;
                 Image-retrieval; indexing; relevance feedback; search;
                 similarity; World Wide Web",
}

@Article{Harris:2004:LDL,
  author =       "Mitchell A. Harris and Edward M. Reingold",
  title =        "Line drawing, leap years, and {Euclid}",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "1",
  pages =        "68--80",
  month =        mar,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1013208.1013211",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Bresenham's algorithm minimizes error in drawing lines
                 on integer grid points; leap year calculations,
                 surprisingly, are a generalization. We compare the two
                 calculations, explicate the pattern, and discuss the
                 connection of the leap year\slash line pattern with
                 integer division and Euclid's algorithm for computing
                 the greatest common divisor.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Bresenham's algorithm; calendar algorithms; continued
                 fractions; Euclid's algorithm; greatest common divisor;
                 leap years; line drawing; scan-line conversion",
}

@Article{Kirbas:2004:RVE,
  author =       "Cemil Kirbas and Francis Quek",
  title =        "A review of vessel extraction techniques and
                 algorithms",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "2",
  pages =        "81--121",
  month =        jun,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1031120.1031121",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:57 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Vessel segmentation algorithms are the critical
                 components of circulatory blood vessel analysis
                 systems. We present a survey of vessel extraction
                 techniques and algorithms. We put the various vessel
                 extraction approaches and techniques in perspective by
                 means of a classification of the existing research.
                 While we have mainly targeted the extraction of blood
                 vessels, neurosvascular structure in particular, we
                 have also reviewed some of the segmentation methods for
                 the tubular objects that show similar characteristics
                 to vessels. We have divided vessel segmentation
                 algorithms and techniques into six main categories: (1)
                 pattern recognition techniques, (2) model-based
                 approaches, (3) tracking-based approaches, (4)
                 artificial intelligence-based approaches, (5) neural
                 network-based approaches, and (6) tube-like object
                 detection approaches. Some of these categories are
                 further divided into subcategories. We have also
                 created tables to compare the papers in each category
                 against such criteria as dimensionality, input type,
                 preprocessing, user interaction, and result type.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Magnetic resonance angiography; medical imaging;
                 neurovascular; vessel extraction; X-ray angiography",
}

@Article{Cohen:2004:BIC,
  author =       "Jacques Cohen",
  title =        "Bioinformatics --- an introduction for computer
                 scientists",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "2",
  pages =        "122--158",
  month =        jun,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1031120.1031122",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:57 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The article aims to introduce computer scientists to
                 the new field of bioinformatics. This area has arisen
                 from the needs of biologists to utilize and help
                 interpret the vast amounts of data that are constantly
                 being gathered in genomic research---and its more
                 recent counterparts, proteomics and functional
                 genomics. The ultimate goal of bioinformatics is to
                 develop in silicon models that will complement in vitro
                 and in vivo biological experiments. The article
                 provides a bird's eye view of the basic concepts in
                 molecular cell biology, outlines the nature of the
                 existing data, and describes the kind of computer
                 algorithms and techniques that are necessary to
                 understand cell behavior. The underlying motivation for
                 many of the bioinformatics approaches is the evolution
                 of organisms and the complexity of working with
                 incomplete and noisy data. The topics covered include:
                 descriptions of the current software especially
                 developed for biologists, computer and mathematical
                 cell models, and areas of computer science that play an
                 important role in bioinformatics.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "alignments; cell simulation and modeling; computer;
                 DNA; dynamic programming; hidden-Markov-models;
                 microarray; Molecular cell biology; parsing biological
                 sequences; phylogenetic trees; RNA and protein
                 structure",
}

@Article{Samet:2004:OBI,
  author =       "Hanan Samet",
  title =        "Object-based and image-based object representations",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "2",
  pages =        "159--217",
  month =        jun,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1031120.1031123",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:19:57 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "An overview is presented of object-based and
                 image-based representations of objects by their
                 interiors. The representations are distinguished by the
                 manner in which they can be used to answer two
                 fundamental queries in database applications: (1)
                 Feature query: given an object, determine its
                 constituent cells (i.e., their locations in space). (2)
                 Location query: given a cell (i.e., a location in
                 space), determine the identity of the object (or
                 objects) of which it is a member as well as the
                 remaining constituent cells of the object (or objects).
                 Regardless of the representation that is used, the
                 generation of responses to the feature and location
                 queries is facilitated by building an index (i.e., the
                 result of a sort) either on the objects or on their
                 locations in space, and implementing it using an access
                 structure that correlates the objects with the
                 locations. Assuming the presence of an access
                 structure, implicit (i.e., image-based) representations
                 are described that are good for finding the objects
                 associated with a particular location or cell (i.e.,
                 the location query), while requiring that all cells be
                 examined when determining the locations associated with
                 a particular object (i.e., the feature query). In
                 contrast, explicit (i.e., object-based) representations
                 are good for the feature query, while requiring that
                 all objects be examined when trying to respond to the
                 location query. The goal is to be able to answer both
                 types of queries with one representation and without
                 possibly having to examine every cell. Representations
                 are presented that achieve this goal by imposing
                 containment hierarchies on either space (i.e., the
                 cells in the space in which the objects are found), or
                 objects. In the former case, space is aggregated into
                 successively larger-sized chunks (i.e., blocks), while
                 in the latter, objects are aggregated into successively
                 larger groups (in terms of the number of objects that
                 they contain). The former is applicable to image-based
                 interior-based representations of which the space
                 pyramid is an example. The latter is applicable to
                 object-based interior-based representations of which
                 the R-tree is an example. The actual mechanics of many
                 of these representations are demonstrated in the VASCO
                 JAVA applets found at
                 \path=http://www.cs.umd.edu/~hjs/quadtree/index.html=.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Access methods; feature query; geographic information
                 systems (GIS); image space; location query; object
                 space; octrees; pyramids; quadtrees; R-trees;
                 space-filling curves; spatial databases",
}

@Article{Pleisch:2004:AFT,
  author =       "Stefan Pleisch and Andr{\'e} Schiper",
  title =        "Approaches to fault-tolerant and transactional mobile
                 agent execution---an algorithmic view",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "3",
  pages =        "219--262",
  month =        sep,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1035570.1035571",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Over the past years, mobile agent technology has
                 attracted considerable attention, and a significant
                 body of literature has been published. To further
                 develop mobile agent technology, reliability mechanisms
                 such as fault tolerance and transaction support are
                 required. This article aims at structuring the field of
                 fault-tolerant and transactional mobile agent execution
                 and thus at guiding the reader to understand the basic
                 strengths and weaknesses of existing approaches. It
                 starts with a discussion on providing fault tolerance
                 in a system in which processes simply fail. For this
                 purpose, we first identify two basic requirements for
                 fault-tolerant mobile agent execution: (1) non-blocking
                 (i.e., a single failure does not prevent progress of
                 the mobile agent execution) and (2) exactly-once (i.e.,
                 multiple executions of the agent are prevented). This
                 leads us to introduce the notion of a {\em local
                 transaction\/} as the basic building block for
                 fault-tolerant mobile agent execution and to classify
                 existing approaches according to when and by whom the
                 local transactions are committed. In a second part, we
                 show that transactional mobile agent execution
                 additionally ensures execution atomicity and present a
                 survey of existing approaches. In the last part of the
                 survey, we extend the notion of fault tolerance to
                 arbitrary Byzantine failures and security-related
                 issues of the mobile agent execution.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "ACID; agreement problem; asynchronous system;
                 Byzantine failures; commit; crash failures; fault
                 tolerance; malicious places; mobile agents;
                 replication; security; transaction",
}

@Article{Formica:2004:IPC,
  author =       "Anna Formica and Michele Missikoff",
  title =        "Inheritance processing and conflicts in structural
                 generalization hierarchies",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "3",
  pages =        "263--290",
  month =        sep,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1035570.1035572",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Generalization hierarchies; inheritance; structural
                 conceptual modeling; subclassing; subsumption;
                 subtyping",
}

@Article{Sivasubramanian:2004:RWH,
  author =       "Swaminathan Sivasubramanian and Michal Szymaniak and
                 Guillaume Pierre and Maarten van Steen",
  title =        "Replication for {Web} hosting systems",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "3",
  pages =        "291--334",
  month =        sep,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1035570.1035573",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Replication is a well-known technique to improve the
                 accessibility of Web sites. It generally offers reduced
                 client latencies and increases a site's availability.
                 However, applying replication techniques is not
                 trivial, and various Content Delivery Networks (CDNs)
                 have been created to facilitate replication for digital
                 content providers. The success of these CDNs has
                 triggered further research efforts into developing
                 advanced {\em Web replica hosting systems}. These are
                 systems that host the documents of a website and manage
                 replication automatically. To identify the key issues
                 in designing a wide-area replica hosting system, we
                 present an architectural framework. The framework
                 assists in characterizing different systems in a
                 systematic manner. We categorize different research
                 efforts and review their relative merits and demerits.
                 As an important side-effect, this review and
                 characterization shows that there a number of
                 interesting research questions that have not received
                 much attention yet, but which deserve exploration by
                 the research community.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "content delivery networks; Web replication",
}

@Article{Androutsellis-Theotokis:2004:SPP,
  author =       "Stephanos Androutsellis-Theotokis and Diomidis
                 Spinellis",
  title =        "A survey of peer-to-peer content distribution
                 technologies",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "4",
  pages =        "335--371",
  month =        dec,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1041680.1041681",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Distributed computer architectures labeled
                 'peer-to-peer' are designed for the sharing of computer
                 resources (content, storage, CPU cycles) by direct
                 exchange, rather than requiring the intermediation or
                 support of a centralized server or authority.
                 Peer-to-peer architectures are characterized by their
                 ability to adapt to failures and accommodate transient
                 populations of nodes while maintaining acceptable
                 connectivity and performance. Content distribution is
                 an important peer-to-peer application on the Internet
                 that has received considerable research attention.
                 Content distribution applications typically allow
                 personal computers to function in a coordinated manner
                 as a distributed storage medium by contributing,
                 searching, and obtaining digital content. In this
                 survey, we propose a framework for analyzing
                 peer-to-peer content distribution technologies. Our
                 approach focuses on nonfunctional characteristics such
                 as security, scalability, performance, fairness, and
                 resource management potential, and examines the way in
                 which these characteristics are reflected in---and
                 affected by---the architectural design decisions
                 adopted by current peer-to-peer systems. We study
                 current peer-to-peer systems and infrastructure
                 technologies in terms of their distributed object
                 location and routing mechanisms, their approach to
                 content replication, caching and migration, their
                 support for encryption, access control, authentication
                 and identity, anonymity, deniability, accountability
                 and reputation, and their use of resource trading and
                 management schemes.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Content distribution; DHT; DOLR; grid computing; p2p;
                 peer-to-peer",
}

@Article{Defago:2004:TOB,
  author =       "Xavier D{\'e}fago and Andr{\'e} Schiper and P{\'e}ter
                 Urb{\'a}n",
  title =        "Total order broadcast and multicast algorithms:
                 {Taxonomy} and survey",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "4",
  pages =        "372--421",
  month =        dec,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1041680.1041682",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Total order broadcast and multicast (also called
                 atomic broadcast/multicast) present an important
                 problem in distributed systems, especially with respect
                 to fault-tolerance. In short, the primitive ensures
                 that messages sent to a set of processes are, in turn,
                 delivered by all those processes in the same total
                 order.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "agreement problems; atomic broadcast; atomic
                 multicast; classification; distributed algorithms;
                 Distributed systems; fault-tolerance; global ordering;
                 group communication; message passing; survey; taxonomy;
                 total ordering",
}

@Article{Bar-Yehuda:2004:LRU,
  author =       "Reuven Bar-Yehuda and Keren Bendel and Ari Freund and
                 Dror Rawitz",
  title =        "Local ratio: a unified framework for approximation
                 algorithms. {In Memoriam}: {Shimon Even} 1935--2004",
  journal =      j-COMP-SURV,
  volume =       "36",
  number =       "4",
  pages =        "422--463",
  month =        dec,
  year =         "2004",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1041680.1041683",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:19 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The local ratio technique is a methodology for the
                 design and analysis of algorithms for a broad range of
                 optimization problems. The technique is remarkably
                 simple and elegant, and yet can be applied to several
                 classical and fundamental problems (including covering
                 problems, packing problems, and scheduling problems).
                 The local ratio technique uses elementary math and
                 requires combinatorial insight into the structure and
                 properties of the problem at hand. Typically, when
                 using the technique, one has to invent a weight
                 function for a problem instance under which every
                 'reasonable' solution is 'good.' The local ratio
                 technique is closely related to the primal-dual schema,
                 though it is not based on weak LP duality (which is the
                 basis of the primal-dual approach) since it is not
                 based on linear programming. In this survey we,
                 introduce the local ratio technique and demonstrate its
                 use in the design and analysis of algorithms for
                 various problems. We trace the evolution path of the
                 technique since its inception in the 1980's,
                 culminating with the most recent development, namely,
                 fractional local ratio, which can be viewed as a new LP
                 rounding technique.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Approximation algorithms; fractional local ratio;
                 local ratio technique",
}

@Article{Bose:2005:LRS,
  author =       "Rajendra Bose and James Frew",
  title =        "Lineage retrieval for scientific data processing: a
                 survey",
  journal =      j-COMP-SURV,
  volume =       "37",
  number =       "1",
  pages =        "1--28",
  month =        mar,
  year =         "2005",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1057977.1057978",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:31 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Scientific research relies as much on the
                 dissemination and exchange of data sets as on the
                 publication of conclusions. Accurately tracking the
                 lineage (origin and subsequent processing history) of
                 scientific data sets is thus imperative for the
                 complete documentation of scientific work. Researchers
                 are effectively prevented from determining, preserving,
                 or providing the lineage of the computational data
                 products they use and create, however, because of the
                 lack of a definitive model for lineage retrieval and a
                 poor fit between current data management tools and
                 scientific software. Based on a comprehensive survey of
                 lineage research and previous prototypes, we present a
                 metamodel to help identify and assess the basic
                 components of systems that provide lineage retrieval
                 for scientific data products.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "audit; Data lineage; data provenance; scientific data;
                 scientific workflow",
}

@Article{Tolone:2005:ACC,
  author =       "William Tolone and Gail-Joon Ahn and Tanusree Pai and
                 Seng-Phil Hong",
  title =        "Access control in collaborative systems",
  journal =      j-COMP-SURV,
  volume =       "37",
  number =       "1",
  pages =        "29--41",
  month =        mar,
  year =         "2005",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1057977.1057979",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:31 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Balancing the competing goals of collaboration and
                 security is a difficult, multidimensional problem.
                 Collaborative systems often focus on building useful
                 connections among people, tools, and information while
                 security seeks to ensure the availability,
                 confidentiality, and integrity of these same elements.
                 In this article, we focus on one important dimension of
                 this problem---access control. The article examines
                 existing access control models as applied to
                 collaboration, highlighting not only the benefits, but
                 also the weaknesses of these models.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Access control; collaboration; security models",
}

@Article{Saito:2005:OR,
  author =       "Yasushi Saito and Marc Shapiro",
  title =        "Optimistic replication",
  journal =      j-COMP-SURV,
  volume =       "37",
  number =       "1",
  pages =        "42--81",
  month =        mar,
  year =         "2005",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1057977.1057980",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:31 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Data replication is a key technology in distributed
                 systems that enables higher availability and
                 performance. This article surveys optimistic
                 replication algorithms. They allow replica contents to
                 diverge in the short term to support concurrent work
                 practices and tolerate failures in low-quality
                 communication links. The importance of such techniques
                 is increasing as collaboration through wide-area and
                 mobile networks becomes popular. Optimistic replication
                 deploys algorithms not seen in traditional
                 ``pessimistic'' systems. Instead of synchronous replica
                 coordination, an optimistic algorithm propagates
                 changes in the background, discovers conflicts after
                 they happen, and reaches agreement on the final
                 contents incrementally. We explore the solution space
                 for optimistic replication algorithms. This article
                 identifies key challenges facing optimistic replication
                 systems---ordering operations, detecting and resolving
                 conflicts, propagating changes efficiently, and
                 bounding replica divergence---and provides a
                 comprehensive survey of techniques developed for
                 addressing these challenges.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "disconnected operation; distributed systems; large
                 scale systems; optimistic techniques; Replication",
}

@Article{Kelleher:2005:LBP,
  author =       "Caitlin Kelleher and Randy Pausch",
  title =        "Lowering the barriers to programming: a taxonomy of
                 programming environments and languages for novice
                 programmers",
  journal =      j-COMP-SURV,
  volume =       "37",
  number =       "2",
  pages =        "83--137",
  month =        jun,
  year =         "2005",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1089733.1089734",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:41 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Since the early 1960's, researchers have built a
                 number of programming languages and environments with
                 the intention of making programming accessible to a
                 larger number of people. This article presents a
                 taxonomy of languages and environments designed to make
                 programming more accessible to novice programmers of
                 all ages. The systems are organized by their primary
                 goal, either to teach programming or to use programming
                 to empower their users, and then, by each system's
                 authors' approach, to making learning to program easier
                 for novice programmers. The article explains all
                 categories in the taxonomy, provides a brief
                 description of the systems in each category, and
                 suggests some avenues for future work in novice
                 programming environments and languages.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer Science education; Human-computer
                 interaction; learning; literacy; problem solving",
}

@Article{Gal:2005:ADS,
  author =       "Eran Gal and Sivan Toledo",
  title =        "Algorithms and data structures for flash memories",
  journal =      j-COMP-SURV,
  volume =       "37",
  number =       "2",
  pages =        "138--163",
  month =        jun,
  year =         "2005",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1089733.1089735",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:41 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Flash memory is a type of electrically-erasable
                 programmable read-only memory (EEPROM). Because flash
                 memories are nonvolatile and relatively dense, they are
                 now used to store files and other persistent objects in
                 handheld computers, mobile phones, digital cameras,
                 portable music players, and many other computer systems
                 in which magnetic disks are inappropriate. Flash, like
                 earlier EEPROM devices, suffers from two limitations.
                 First, bits can only be cleared by erasing a large
                 block of memory. Second, each block can only sustain a
                 limited number of erasures, after which it can no
                 longer reliably store data. Due to these limitations,
                 sophisticated data structures and algorithms are
                 required to effectively use flash memories. These
                 algorithms and data structures support efficient
                 not-in-place updates of data, reduce the number of
                 erasures, and level the wear of the blocks in the
                 device. This survey presents these algorithms and data
                 structures, many of which have only been described in
                 patents until now.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "EEPROM memory; Flash memory; wear leveling",
}

@Article{Santi:2005:TCW,
  author =       "Paolo Santi",
  title =        "Topology control in wireless ad hoc and sensor
                 networks",
  journal =      j-COMP-SURV,
  volume =       "37",
  number =       "2",
  pages =        "164--194",
  month =        jun,
  year =         "2005",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1089733.1089736",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:41 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Topology Control (TC) is one of the most important
                 techniques used in wireless ad hoc and sensor networks
                 to reduce energy consumption (which is essential to
                 extend the network operational time) and radio
                 interference (with a positive effect on the network
                 traffic carrying capacity). The goal of this technique
                 is to control the topology of the graph representing
                 the communication links between network nodes with the
                 purpose of maintaining some global graph property
                 (e.g., connectivity), while reducing energy consumption
                 and/or interference that are strictly related to the
                 nodes' transmitting range. In this article, we state
                 several problems related to topology control in
                 wireless ad hoc and sensor networks, and we survey
                 state-of-the-art solutions which have been proposed to
                 tackle them. We also outline several directions for
                 further research which we hope will motivate
                 researchers to undertake additional studies in this
                 field.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Connectivity; energy consumption; sensor networks;
                 topology control; wireless ad hoc networks",
}

@Article{Venkatachalam:2005:PRT,
  author =       "Vasanth Venkatachalam and Michael Franz",
  title =        "Power reduction techniques for microprocessor
                 systems",
  journal =      j-COMP-SURV,
  volume =       "37",
  number =       "3",
  pages =        "195--237",
  month =        sep,
  year =         "2005",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1108956.1108957",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:51 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Power consumption is a major factor that limits the
                 performance of computers. We survey the ``state of the
                 art'' in techniques that reduce the total power
                 consumed by a microprocessor system over time. These
                 techniques are applied at various levels ranging from
                 circuits to architectures, architectures to system
                 software, and system software to applications. They
                 also include holistic approaches that will become more
                 important over the next decade. We conclude that power
                 management is a multifaceted discipline that is
                 continually expanding with new techniques being
                 developed at every level. These techniques may
                 eventually allow computers to break through the ``power
                 wall'' and achieve unprecedented levels of performance,
                 versatility, and reliability. Yet it remains too early
                 to tell which techniques will ultimately solve the
                 power problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Energy dissipation; power reduction",
}

@Article{Taylor:2005:STP,
  author =       "David E. Taylor",
  title =        "Survey and taxonomy of packet classification
                 techniques",
  journal =      j-COMP-SURV,
  volume =       "37",
  number =       "3",
  pages =        "238--275",
  month =        sep,
  year =         "2005",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1108956.1108958",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:51 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Packet classification is an enabling function for a
                 variety of Internet applications including quality of
                 service, security, monitoring, and multimedia
                 communications. In order to classify a packet as
                 belonging to a particular flow or set of flows, network
                 nodes must perform a search over a set of filters using
                 multiple fields of the packet as the search key. In
                 general, there have been two major threads of research
                 addressing packet classification, algorithmic and
                 architectural. A few pioneering groups of researchers
                 posed the problem, provided complexity bounds, and
                 offered a collection of algorithmic solutions.
                 Subsequently, the design space has been vigorously
                 explored by many offering new algorithms and
                 improvements on existing algorithms. Given the
                 inability of early algorithms to meet performance
                 constraints imposed by high speed links, researchers in
                 industry and academia devised architectural solutions
                 to the problem. This thread of research produced the
                 most widely-used packet classification device
                 technology, Ternary Content Addressable Memory (TCAM).
                 New architectural research combines intelligent
                 algorithms and novel architectures to eliminate many of
                 the unfavorable characteristics of current TCAMs. We
                 observe that the community appears to be converging on
                 a combined algorithmic and architectural approach to
                 the problem. Using a taxonomy based on the high-level
                 approach to the problem and a minimal set of running
                 examples, we provide a survey of the seminal and recent
                 solutions to the problem. It is our hope to foster a
                 deeper understanding of the various packet
                 classification techniques while providing a useful
                 framework for discerning relationships and
                 distinctions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "flow identification; Packet classification",
}

@Article{Eichelberg:2005:SAE,
  author =       "Marco Eichelberg and Thomas Aden and J{\"o}rg
                 Riesmeier and Asuman Dogac and Gokce B. Laleci",
  title =        "A survey and analysis of {Electronic Healthcare
                 Record} standards",
  journal =      j-COMP-SURV,
  volume =       "37",
  number =       "4",
  pages =        "277--315",
  month =        dec,
  year =         "2005",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1118890.1118891",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Medical information systems today store clinical
                 information about patients in all kinds of proprietary
                 formats. To address the resulting interoperability
                 problems, several Electronic Healthcare Record
                 standards that structure the clinical content for the
                 purpose of exchange are currently under development. In
                 this article, we present a survey of the most relevant
                 Electronic Healthcare Record standards, examine the
                 level of interoperability they provide, and assess
                 their functionality in terms of content structure,
                 access services, multimedia support, and security. We
                 further investigate the complementarity of the
                 standards and assess their market relevance.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "eHealth; Electronic Healthcare Record standards;
                 interoperability",
}

@Article{Mernik:2005:WHD,
  author =       "Marjan Mernik and Jan Heering and Anthony M. Sloane",
  title =        "When and how to develop domain-specific languages",
  journal =      j-COMP-SURV,
  volume =       "37",
  number =       "4",
  pages =        "316--344",
  month =        dec,
  year =         "2005",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1118890.1118892",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Domain-specific languages (DSLs) are languages
                 tailored to a specific application domain. They offer
                 substantial gains in expressiveness and ease of use
                 compared with general-purpose programming languages in
                 their domain of application. DSL development is hard,
                 requiring both domain knowledge and language
                 development expertise. Few people have both. Not
                 surprisingly, the decision to develop a DSL is often
                 postponed indefinitely, if considered at all, and most
                 DSLs never get beyond the application library stage.
                 Although many articles have been written on the
                 development of particular DSLs, there is very limited
                 literature on DSL development methodologies and many
                 questions remain regarding when and how to develop a
                 DSL. To aid the DSL developer, we identify patterns in
                 the decision, analysis, design, and implementation
                 phases of DSL development. Our patterns improve and
                 extend earlier work on DSL design patterns. We also
                 discuss domain analysis tools and language development
                 systems that may help to speed up DSL development.
                 Finally, we present a number of open problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "application language; domain analysis; Domain-specific
                 language; language development system",
}

%%% ====================================================================
%%% NB: Volume 38 numbers each article from page 1. ACM journals are
%%% switching to a new format where page numbers contain an article
%%% number prefix, with page ranges of the form ai:p1--ai:pj.
%%% ====================================================================
@Article{Bustos:2005:FBS,
  author =       "Benjamin Bustos and Daniel A. Keim and Dietmar Saupe
                 and Tobias Schreck and Dejan V. Vrani{\'c}",
  title =        "Feature-based similarity search in {$3$D} object
                 databases",
  journal =      j-COMP-SURV,
  volume =       "37",
  number =       "4",
  pages =        "345--387",
  month =        dec,
  year =         "2005",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1118890.1118893",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:20:58 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The development of effective content-based multimedia
                 search systems is an important research issue due to
                 the growing amount of digital audio-visual information.
                 In the case of images and video, the growth of digital
                 data has been observed since the introduction of 2D
                 capture devices. A similar development is expected for
                 3D data as acquisition and dissemination technology of
                 3D models is constantly improving. 3D objects are
                 becoming an important type of multimedia data with many
                 promising application possibilities. Defining the
                 aspects that constitute the similarity among 3D objects
                 and designing algorithms that implement such similarity
                 definitions is a difficult problem. Over the last few
                 years, a strong interest in methods for 3D similarity
                 search has arisen, and a growing number of competing
                 algorithms for content-based retrieval of 3D objects
                 have been proposed. We survey feature-based methods for
                 3D retrieval, and we propose a taxonomy for these
                 methods. We also present experimental results,
                 comparing the effectiveness of some of the surveyed
                 methods.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "3D model retrieval; content-based similarity search",
}

@Article{Bjerregaard:2006:SRP,
  author =       "Tobias Bjerregaard and Shankar Mahadevan",
  title =        "A survey of research and practices of
                 {Network-on-Chip}",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "1",
  pages =        "1:1--1:51",
  month =        mar,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1132952.1132953",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The scaling of microchip technologies has enabled
                 large scale systems-on-chip (SoC). Network-on-chip
                 (NoC) research addresses global communication in SoC,
                 involving (i) a move from computation-centric to
                 communication-centric design and (ii) the
                 implementation of scalable communication structures.
                 This survey presents a perspective on existing NoC
                 research. We define the following abstractions: system,
                 network adapter, network, and link to explain and
                 structure the fundamental concepts. First, research
                 relating to the actual network design is reviewed. Then
                 system level design and modeling are discussed. We also
                 evaluate performance analysis techniques. The research
                 shows that NoC constitutes a unification of current
                 trends of intrachip communication rather than an
                 explicit new alternative.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Chip-area networks; communication abstractions;
                 communication-centric design; GALS; GSI design;
                 interconnects; network-on-chip; NoC; OCP; on-chip
                 communication; SoC; sockets; system-on-chip; ULSI
                 design",
}

@Article{Chakrabarti:2006:GML,
  author =       "Deepayan Chakrabarti and Christos Faloutsos",
  title =        "Graph mining: {Laws}, generators, and algorithms",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "1",
  pages =        "2:1--2:69",
  month =        mar,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1132952.1132953",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Venugopal:2006:TDG,
  author =       "Srikumar Venugopal and Rajkumar Buyya and Kotagiri
                 Ramamohanarao",
  title =        "A taxonomy of {Data Grids} for distributed data
                 sharing, management, and processing",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "1",
  pages =        "3:1--3:53",
  month =        mar,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1132952.1132955",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Data Grids have been adopted as the next generation
                 platform by many scientific communities that need to
                 share, access, transport, process, and manage large
                 data collections distributed worldwide. They combine
                 high-end computing technologies with high-performance
                 networking and wide-area storage management techniques.
                 In this article, we discuss the key concepts behind
                 Data Grids and compare them with other data sharing and
                 distribution paradigms such as content delivery
                 networks, peer-to-peer networks, and distributed
                 databases. We then provide comprehensive taxonomies
                 that cover various aspects of architecture, data
                 transportation, data replication and resource
                 allocation, and scheduling. Finally, we map the
                 proposed taxonomy to various Data Grid systems not only
                 to validate the taxonomy but also to identify areas for
                 future exploration.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "data-intensive applications; Grid computing; replica
                 management; virtual organizations",
}

@Article{Turmo:2006:AIE,
  author =       "Jordi Turmo and Alicia Ageno and Neus Catal{\`a}",
  title =        "Adaptive information extraction",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "2",
  pages =        "4:1--4:47",
  month =        mar,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1132956.1132957",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:09 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The growing availability of online textual sources and
                 the potential number of applications of knowledge
                 acquisition from textual data has lead to an increase
                 in Information Extraction (IE) research. Some examples
                 of these applications are the generation of data bases
                 from documents, as well as the acquisition of knowledge
                 useful for emerging technologies like question
                 answering, information integration, and others related
                 to text mining. However, one of the main drawbacks of
                 the application of IE refers to its intrinsic domain
                 dependence. For the sake of reducing the high cost of
                 manually adapting IE applications to new domains,
                 experiments with different Machine Learning (ML)
                 techniques have been carried out by the research
                 community. This survey describes and compares the main
                 approaches to IE and the different ML techniques used
                 to achieve Adaptive IE technology.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Information extraction; machine learning",
}

@Article{Ceglar:2006:AM,
  author =       "Aaron Ceglar and John F. Roddick",
  title =        "Association mining",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "2",
  pages =        "5:1--5:42",
  month =        mar,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1132956.1132958",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:09 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The task of finding correlations between items in a
                 dataset, association mining, has received considerable
                 attention over the last decade. This article presents a
                 survey of association mining fundamentals, detailing
                 the evolution of association mining algorithms from the
                 seminal to the state-of-the-art. This survey focuses on
                 the fundamental principles of association mining, that
                 is, itemset identification, rule generation, and their
                 generic optimizations.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "association mining; Data mining",
}

@Article{Zobel:2006:IFT,
  author =       "Justin Zobel and Alistair Moffat",
  title =        "Inverted files for text search engines",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "2",
  pages =        "6:1--6:56",
  month =        mar,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1132956.1132959",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:09 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The technology underlying text search engines has
                 advanced dramatically in the past decade. The
                 development of a family of new index representations
                 has led to a wide range of innovations in index
                 storage, index construction, and query evaluation.
                 While some of these developments have been consolidated
                 in textbooks, many specific techniques are not widely
                 known or the textbook descriptions are out of date. In
                 this tutorial, we introduce the key techniques in the
                 area, describing both a core implementation and how the
                 core can be enhanced through a range of extensions. We
                 conclude with a comprehensive bibliography of text
                 indexing literature.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "document database; information retrieval; Inverted
                 file indexing; text retrieval; Web search engine",
}

@Article{Ma:2006:HSR,
  author =       "Jing Ma and Jeffrey V. Nickerson",
  title =        "Hands-on, simulated, and remote laboratories: a
                 comparative literature review",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "3",
  pages =        "7:1--7:24",
  month =        sep,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1132960.1132961",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Laboratory-based courses play a critical role in
                 scientific education. Automation is changing the nature
                 of these laboratories, and there is a long-running
                 debate about the value of hands-on versus simulated
                 laboratories. In addition, the introduction of remote
                 laboratories adds a third category to the debate.
                 Through a review of the literature related to these
                 labs in education, the authors draw several conclusions
                 about the state of current research. The debate over
                 different technologies is confounded by the use of
                 different educational objectives as criteria for
                 judging the laboratories: Hands-on advocates emphasize
                 design skills, while remote lab advocates focus on
                 conceptual understanding. We observe that the
                 boundaries among the three labs are blurred in the
                 sense that most laboratories are mediated by computers,
                 and that the psychology of presence may be as important
                 as technology. We also discuss areas for future
                 research.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "experimentation; human-computer interaction; presence;
                 Remote laboratories; simulation; teleoperation; thought
                 experiments",
}

@Article{Miller:2006:STL,
  author =       "Alice Miller and Alastair Donaldson and Muffy Calder",
  title =        "Symmetry in temporal logic model checking",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "3",
  pages =        "8:1--8:36",
  month =        sep,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1132960.1132962",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Temporal logic model checking involves checking the
                 state-space of a model of a system to determine whether
                 errors can occur in the system. Often this involves
                 checking symmetrically equivalent areas of the
                 state-space. The use of symmetry reduction to increase
                 the efficiency of model checking has inspired a wealth
                 of activity in the area of model checking research. We
                 provide a survey of the associated literature.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Model checking; quotient graph; symmetry",
}

@Article{Geng:2006:IMD,
  author =       "Liqiang Geng and Howard J. Hamilton",
  title =        "Interestingness measures for data mining: a survey",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "3",
  pages =        "9:1--9:32",
  month =        sep,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1132960.1132963",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Interestingness measures play an important role in
                 data mining, regardless of the kind of patterns being
                 mined. These measures are intended for selecting and
                 ranking patterns according to their potential interest
                 to the user. Good measures also allow the time and
                 space costs of the mining process to be reduced. This
                 survey reviews the interestingness measures for rules
                 and summaries, classifies them from several
                 perspectives, compares their properties, identifies
                 their roles in the data mining process, gives
                 strategies for selecting appropriate measures for
                 applications, and identifies opportunities for future
                 research in this area.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "association rules; classification rules; interest
                 measures; interestingness measures; Knowledge
                 discovery; summaries",
}

@Article{Graefe:2006:ISD,
  author =       "Goetz Graefe",
  title =        "Implementing sorting in database systems",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "3",
  pages =        "10:1--10:37",
  month =        sep,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1132960.1132964",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Most commercial database systems do (or should)
                 exploit many sorting techniques that are publicly
                 known, but not readily available in the research
                 literature. These techniques improve both sort
                 performance on modern computer systems and the ability
                 to adapt gracefully to resource fluctuations in
                 multiuser operations. This survey collects many of
                 these techniques for easy reference by students,
                 researchers, and product developers. It covers
                 in-memory sorting, disk-based external sorting, and
                 considerations that apply specifically to sorting in
                 database systems.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "asynchronous read-ahead; compression; dynamic memory
                 resource allocation; forecasting; graceful degradation;
                 index operations; key conditioning; Key normalization;
                 nested iteration",
}

@Article{Frost:2006:RNL,
  author =       "Richard A. Frost",
  title =        "Realization of natural language interfaces using lazy
                 functional programming",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "4",
  pages =        "11:1--11:54",
  month =        dec,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1177352.1177353",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The construction of natural language interfaces to
                 computers continues to be a major challenge. The need
                 for such interfaces is growing now that speech
                 recognition technology is becoming more readily
                 available, and people cannot speak those
                 computer-oriented formal languages that are frequently
                 used to interact with computer applications. Much of
                 the research related to the design and implementation
                 of natural language interfaces has involved the use of
                 high-level declarative programming languages. This is
                 to be expected as the task is extremely difficult,
                 involving syntactic and semantic analysis of
                 potentially ambiguous input. The use of LISP and Prolog
                 in this area is well documented. However, research
                 involving the relatively new lazy functional
                 programming paradigm is less well known. This paper
                 provides a comprehensive survey of that research.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computational linguistics; higher-order functions;
                 lazy functional programming; Montague grammar;
                 Natural-language interfaces",
}

@Article{Bordeaux:2006:PSC,
  author =       "Lucas Bordeaux and Youssef Hamadi and Lintao Zhang",
  title =        "Propositional Satisfiability and Constraint
                 Programming: a comparative survey",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "4",
  pages =        "12:1--12:54",
  month =        dec,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1177352.1177354",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Propositional Satisfiability (SAT) and Constraint
                 Programming (CP) have developed as two relatively
                 independent threads of research cross-fertilizing
                 occasionally. These two approaches to problem solving
                 have a lot in common as evidenced by similar ideas
                 underlying the branch and prune algorithms that are
                 most successful at solving both kinds of problems. They
                 also exhibit differences in the way they are used to
                 state and solve problems since SAT's approach is, in
                 general, a black-box approach, while CP aims at being
                 tunable and programmable. This survey overviews the two
                 areas in a comparative way, emphasizing the
                 similarities and differences between the two and the
                 points where we feel that one technology can benefit
                 from ideas or experience acquired from the other.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "constraint satisfaction; SAT; Search",
}

@Article{Yilmaz:2006:OTS,
  author =       "Alper Yilmaz and Omar Javed and Mubarak Shah",
  title =        "Object tracking: a survey",
  journal =      j-COMP-SURV,
  volume =       "38",
  number =       "4",
  pages =        "13:1--13:45",
  month =        dec,
  year =         "2006",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1177352.1177355",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:10 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The goal of this article is to review the
                 state-of-the-art tracking methods, classify them into
                 different categories, and identify new trends. Object
                 tracking, in general, is a challenging problem.
                 Difficulties in tracking objects can arise due to
                 abrupt object motion, changing appearance patterns of
                 both the object and the scene, nonrigid object
                 structures, object-to-object and object-to-scene
                 occlusions, and camera motion. Tracking is usually
                 performed in the context of higher-level applications
                 that require the location and/or shape of the object in
                 every frame. Typically, assumptions are made to
                 constrain the tracking problem in the context of a
                 particular application. In this survey, we categorize
                 the tracking methods on the basis of the object and
                 motion representations used, provide detailed
                 descriptions of representative methods in each
                 category, and examine their pros and cons. Moreover, we
                 discuss the important issues related to tracking
                 including the use of appropriate image features,
                 selection of motion models, and detection of objects.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Appearance models; contour evolution; feature
                 selection; object detection; object representation;
                 point tracking; shape tracking",
}

@Article{VanDerMerwe:2007:SPP,
  author =       "Johann {Van Der Merwe} and Dawoud Dawoud and Stephen
                 McDonald",
  title =        "A survey on peer-to-peer key management for mobile ad
                 hoc networks",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "1",
  pages =        "1:1--1:45",
  month =        apr,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1216370.1216371",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The article reviews the most popular peer-to-peer key
                 management protocols for mobile ad hoc networks
                 (MANETs). The protocols are subdivided into groups
                 based on their design strategy or main characteristic.
                 The article discusses and provides comments on the
                 strategy of each group separately. The discussions give
                 insight into open research problems in the area of
                 pairwise key management.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Mobile ad hoc networks; pairwise key management;
                 peer-to-peer key management; security",
}

@Article{Navarro:2007:CFT,
  author =       "Gonzalo Navarro and Veli M{\"a}kinen",
  title =        "Compressed full-text indexes",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "1",
  pages =        "2:1--2:61",
  month =        apr,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1216370.1216372",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Full-text indexes provide fast substring search over
                 large text collections. A serious problem of these
                 indexes has traditionally been their space consumption.
                 A recent trend is to develop indexes that exploit the
                 compressibility of the text, so that their size is a
                 function of the compressed text length. This concept
                 has evolved into self-indexes, which in addition
                 contain enough information to reproduce any text
                 portion, so they replace the text. The exciting
                 possibility of an index that takes space close to that
                 of the compressed text, replaces it, and in addition
                 provides fast search over it, has triggered a wealth of
                 activity and produced surprising results in a very
                 short time, which radically changed the status of this
                 area in less than 5 years. The most successful indexes
                 nowadays are able to obtain almost optimal space and
                 search time simultaneously.\par

                 In this article we present the main concepts underlying
                 (compressed) self-indexes. We explain the relationship
                 between text entropy and regularities that show up in
                 index structures and permit compressing them. Then we
                 cover the most relevant self-indexes, focusing on how
                 they exploit text compressibility to achieve compact
                 structures that can efficiently solve various search
                 problems. Our aim is to give the background to
                 understand and follow the developments in this area.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "entropy; text compression; Text indexing",
}

@Article{Peng:2007:SNB,
  author =       "Tao Peng and Christopher Leckie and Kotagiri
                 Ramamohanarao",
  title =        "Survey of network-based defense mechanisms countering
                 the {DoS} and {DDoS} problems",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "1",
  pages =        "3:1--3:42",
  month =        apr,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1216370.1216373",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article presents a survey of denial of service
                 attacks and the methods that have been proposed for
                 defense against these attacks. In this survey, we
                 analyze the design decisions in the Internet that have
                 created the potential for denial of service attacks. We
                 review the state-of-art mechanisms for defending
                 against denial of service attacks, compare the
                 strengths and weaknesses of each proposal, and discuss
                 potential countermeasures against each defense
                 mechanism. We conclude by highlighting opportunities
                 for an integrated solution to solve the problem of
                 distributed denial of service attacks.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "bandwidth attack; Botnet; DDoS; DNS reflector attack;
                 DoS; Internet security; IP spoofing; IP traceback; IRC;
                 resource management; SYN flood; VoIP security",
}

@Article{Puglisi:2007:TSA,
  author =       "Simon J. Puglisi and W. F. Smyth and Andrew H.
                 Turpin",
  title =        "A taxonomy of suffix array construction algorithms",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "2",
  pages =        "4:1--4:31",
  month =        jul,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1242471.1242472",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In 1990, Manber and Myers proposed suffix arrays as a
                 space-saving alternative to suffix trees and described
                 the first algorithms for suffix array construction and
                 use. Since that time, and especially in the last few
                 years, suffix array construction algorithms have
                 proliferated in bewildering abundance. This survey
                 paper attempts to provide simple high-level
                 descriptions of these numerous algorithms that
                 highlight both their distinctive features and their
                 commonalities, while avoiding as much as possible the
                 complexities of implementation details. New hybrid
                 algorithms are also described. We provide comparisons
                 of the algorithms' worst-case time complexity and use
                 of additional space, together with results of recent
                 experimental test runs on many of their
                 implementations.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Burrows--Wheeler transform; Suffix array; suffix
                 sorting; suffix tree",
}

@Article{Zheng:2007:SRI,
  author =       "Dong Zheng and Yan Liu and Jiying Zhao and
                 Abdulmotaleb El Saddik",
  title =        "A survey of {RST} invariant image watermarking
                 algorithms",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "2",
  pages =        "5:1--5:91",
  month =        jul,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1242471.1242473",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In this article, we review the algorithms for
                 rotation, scaling and translation (RST) invariant image
                 watermarking. There are mainly two categories of RST
                 invariant image watermarking algorithms. One is to
                 rectify the RST transformed image before conducting
                 watermark detection. Another is to embed and detect
                 watermark in an RST invariant or semi-invariant domain.
                 In order to help readers understand, we first introduce
                 the fundamental theories and techniques used in the
                 existing RST invariant image watermarking algorithms.
                 Then, we discuss in detail the work principles,
                 embedding process, and detection process of the typical
                 RST invariant image watermarking algorithms. Finally,
                 we analyze and evaluate these typical algorithms
                 through implementation, and point out their advantages
                 and disadvantages.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Digital image watermarking; feature points;
                 Fourier-Mellin transform; ILPM; LPM; moments; Radon
                 transform; RST invariant; template matching",
}

@Article{Bruss:2007:QCS,
  author =       "Dagmar Bruss and G{\'a}bor Erd{\'e}lyi and Tim Meyer
                 and Tobias Riege and J{\"o}rg Rothe",
  title =        "Quantum cryptography: a survey",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "2",
  pages =        "6:1--6:27",
  month =        jul,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1242471.1242474",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:12 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We survey some results in quantum cryptography. After
                 a brief introduction to classical cryptography, we
                 provide the quantum-mechanical background needed to
                 present some fundamental protocols from quantum
                 cryptography. In particular, we review quantum key
                 distribution via the BB84 protocol and its security
                 proof, as well as the related quantum bit commitment
                 protocol and its proof of insecurity.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Quantum bit commitment; quantum cryptography; quantum
                 key distribution",
}

@Article{Uludag:2007:ATA,
  author =       "Suleyman Uludag and King-Shan Lui and Klara Nahrstedt
                 and Gregory Brewster",
  title =        "Analysis of {Topology Aggregation} techniques for
                 {QoS} routing",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "3",
  pages =        "7:1--7:31",
  month =        sep,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1267070.1267071",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We study and compare topology aggregation techniques
                 used in QoS routing. Topology Aggregation (TA) is
                 defined as a set of techniques that abstract or
                 summarize the state information about the network
                 topology to be exchanged, processed, and maintained by
                 network nodes for routing purposes. Due to scalability,
                 aggregation techniques have been an integral part of
                 some routing protocols. However, TA has not been
                 studied extensively except in a rather limited context.
                 With the continuing growth of the Internet, scalability
                 issues of QoS routing have been gaining importance.
                 Therefore, we survey the current TA techniques, provide
                 methodology to classify, evaluate, and compare their
                 complexities and efficiencies.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "bandwidth; delay; hierarchical networks; inaccuracy;
                 networks; path selection; QoS routing; routing;
                 topology; Topology aggregation",
}

@Article{Truran:2007:AAT,
  author =       "Mark Truran and James Goulding and Helen Ashman",
  title =        "Autonomous authoring tools for hypertext",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "3",
  pages =        "8:1--8:30",
  month =        sep,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1267070.1267072",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Autonomous authoring tools are routinely used to
                 expedite the translation of large document collections
                 into functioning hypertexts. They are also used to add
                 hyperlinks to pre-existing hypertext structures. In
                 this survey we describe a taxonomy of autonomous
                 hypertext authoring tools. The classification of any
                 given system is determined by the type and nature of
                 the document analysis it performs.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Authoring tools; automatic hypertext generation
                 systems; link generation",
}

@Article{Nakamura:2007:IFW,
  author =       "Eduardo F. Nakamura and Antonio A. F. Loureiro and
                 Alejandro C. Frery",
  title =        "Information fusion for wireless sensor networks:
                 {Methods}, models, and classifications",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "3",
  pages =        "9:1--9:55",
  month =        sep,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1267070.1267073",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:13 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Wireless sensor networks produce a large amount of
                 data that needs to be processed, delivered, and
                 assessed according to the application objectives. The
                 way these data are manipulated by the sensor nodes is a
                 fundamental issue. Information fusion arises as a
                 response to process data gathered by sensor nodes and
                 benefits from their processing capability. By
                 exploiting the synergy among the available data,
                 information fusion techniques can reduce the amount of
                 data traffic, filter noisy measurements, and make
                 predictions and inferences about a monitored entity. In
                 this work, we survey the current state-of-the-art of
                 information fusion by presenting the known methods,
                 algorithms, architectures, and models of information
                 fusion, and discuss their applicability in the context
                 of wireless sensor networks.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "architectures and models; data aggregation; data
                 fusion; Information fusion; wireless sensor networks",
}

@Article{Katifori:2007:OVM,
  author =       "Akrivi Katifori and Constantin Halatsis and George
                 Lepouras and Costas Vassilakis and Eugenia
                 Giannopoulou",
  title =        "Ontology visualization methods --- a survey",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "4",
  pages =        "10:1--10:43",
  month =        nov,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1287620.1287621",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:14 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Ontologies, as sets of concepts and their
                 interrelations in a specific domain, have proven to be
                 a useful tool in the areas of digital libraries, the
                 Semantic Web, and personalized information management.
                 As a result, there is a growing need for effective
                 ontology visualization for design, management and
                 browsing. There exist several ontology visualization
                 methods and also a number of techniques used in other
                 contexts that could be adapted for ontology
                 representation. The purpose of this article is to
                 present these techniques and categorize their
                 characteristics and features in order to assist method
                 selection and promote future research in the area of
                 ontology visualization.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "human-computer interaction; Ontology; visualization
                 method",
}

@Article{Thomas:2007:GRN,
  author =       "David B. Thomas and Wayne Luk and Philip H. W. Leong
                 and John D. Villasenor",
  title =        "{Gaussian} random number generators",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "4",
  pages =        "11:1--11:38",
  month =        nov,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1287620.1287622",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:14 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Rapid generation of high quality Gaussian random
                 numbers is a key capability for simulations across a
                 wide range of disciplines. Advances in computing have
                 brought the power to conduct simulations with very
                 large numbers of random numbers and with it, the
                 challenge of meeting increasingly stringent
                 requirements on the quality of Gaussian random number
                 generators (GRNG). This article describes the
                 algorithms underlying various GRNGs, compares their
                 computational requirements, and examines the quality of
                 the random numbers with emphasis on the behaviour in
                 the tail region of the Gaussian probability density
                 function.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Ahrens--Dieter; Box--Muller; Central-Limit;
                 CLT-Stretched; Gaussian; GRAND; Hastings; Kinderman;
                 Leva; Marsaglia--Bray; Mersenne Twister;
                 Mixture-of-Triangles; Monty Python; normal; polar;
                 PPND16; PPND7; random number; Random numbers;
                 simulation; Wallace; ziggurat",
}

@Article{Morfonios:2007:RID,
  author =       "Konstantinos Morfonios and Stratis Konakas and Yannis
                 Ioannidis and Nikolaos Kotsis",
  title =        "{ROLAP} implementations of the data cube",
  journal =      j-COMP-SURV,
  volume =       "39",
  number =       "4",
  pages =        "12:1--12:53",
  month =        nov,
  year =         "2007",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1287620.1287623",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:14 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Implementation of the data cube is an important and
                 scientifically interesting issue in On-Line Analytical
                 Processing (OLAP) and has been the subject of a
                 plethora of related publications. Naive implementation
                 methods that compute each node separately and store the
                 result are impractical, since they have exponential
                 time and space complexity with respect to the cube
                 dimensionality. To overcome this drawback, a wide range
                 of methods that provide efficient cube implementation
                 (with respect to both computation and storage) have
                 been proposed, which make use of relational,
                 multidimensional, or graph-based data structures.
                 Furthermore, there are several other methods that
                 compute and store approximate descriptions of data
                 cubes, sacrificing accuracy for condensation. In this
                 article, we focus on Relational-OLAP (ROLAP), following
                 the majority of the efforts so far. We review existing
                 ROLAP methods that implement the data cube and identify
                 six orthogonal parameters/dimensions that characterize
                 them. We place the existing techniques at the
                 appropriate points within the problem space defined by
                 these parameters and identify several clusters that the
                 techniques form with various interesting properties. A
                 careful study of these properties leads to the
                 identification of particularly effective values for the
                 space parameters and indicates the potential for
                 devising new algorithms with better overall
                 performance.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Data cube; data warehouse; OLAP",
}

@Article{Angles:2008:SGD,
  author =       "Renzo Angles and Claudio Gutierrez",
  title =        "Survey of graph database models",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "1",
  pages =        "1:1--1:39",
  month =        feb,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1322432.1322433",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:15 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Graph database models can be defined as those in which
                 data structures for the schema and instances are
                 modeled as graphs or generalizations of them, and data
                 manipulation is expressed by graph-oriented operations
                 and type constructors. These models took off in the
                 eighties and early nineties alongside object-oriented
                 models. Their influence gradually died out with the
                 emergence of other database models, in particular
                 geographical, spatial, semistructured, and XML.
                 Recently, the need to manage information with
                 graph-like nature has reestablished the relevance of
                 this area. The main objective of this survey is to
                 present the work that has been conducted in the area of
                 graph database modeling, concentrating on data
                 structures, query languages, and integrity
                 constraints.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "database models; Database systems; graph database
                 models; graph databases; graph integrity constraints;
                 graph query languages",
}

@Article{Fabbri:2008:EDT,
  author =       "Ricardo Fabbri and Luciano Da F. Costa and Julio C.
                 Torelli and Odemir M. Bruno",
  title =        "{$2$D} {Euclidean} distance transform algorithms: a
                 comparative survey",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "1",
  pages =        "2:1--2:44",
  month =        feb,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1322432.1322434",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:15 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The distance transform (DT) is a general operator
                 forming the basis of many methods in computer vision
                 and geometry, with great potential for practical
                 applications. However, all the optimal algorithms for
                 the computation of the exact Euclidean DT (EDT) were
                 proposed only since the 1990s. In this work,
                 state-of-the-art sequential 2D EDT algorithms are
                 reviewed and compared, in an effort to reach more solid
                 conclusions regarding their differences in speed and
                 their exactness. Six of the best algorithms were fully
                 implemented and compared in practice.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computational geometry; Dijkstra's algorithm; Distance
                 transform; exact Euclidean distance map; performance
                 evaluation; shape analysis",
}

@Article{Ramsin:2008:PCR,
  author =       "Raman Ramsin and Richard F. Paige",
  title =        "Process-centered review of object oriented software
                 development methodologies",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "1",
  pages =        "3:1--3:89",
  month =        feb,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1322432.1322435",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:15 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We provide a detailed review of existing
                 object-oriented software development methodologies,
                 focusing on their development processes. The review
                 aims at laying bare their core philosophies, processes,
                 and internal activities. This is done by using a
                 process-centered template for summarizing the
                 methodologies, highlighting the activities prescribed
                 in the methodology while describing the modeling
                 languages used (mainly diagrams and tables) as
                 secondary to the activities. The descriptions produced
                 using this template aim not to offer a critique on the
                 methodologies and processes, but instead provide an
                 abstract and structured description in a way that
                 facilitates their elaborate analysis for the purposes
                 of improving understanding, and making it easier to
                 tailor, select, and evaluate the processes.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "agile methods; integrated methodologies; methodology
                 engineering; Object-oriented methodologies; seminal
                 methodologies",
}

@Article{Vosloo:2008:SCW,
  author =       "Iwan Vosloo and Derrick G. Kourie",
  title =        "Server-centric {Web} frameworks: an overview",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "2",
  pages =        "4:1--4:33",
  month =        apr,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1348246.1348247",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Most contemporary Web frameworks may be classified as
                 server-centric. An overview of such Web frameworks is
                 presented. It is based on information gleaned from
                 surveying 80 server-centric Web frameworks, as well as
                 from popular related specifications. Requirements
                 typically expected of a server-centric Web framework
                 are discussed. Two Web framework taxonomies are
                 proposed, reflecting two orthogonal ways of
                 characterizing a framework: the way in which the markup
                 language content of a browser-destined document is
                 specified in the framework (presentation concerns); and
                 the framework's facilities for the user to control the
                 flow of events between browser and server (control
                 concerns).",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Architecture; specification techniques; user
                 interfaces; Web frameworks",
}

@Article{Datta:2008:IRI,
  author =       "Ritendra Datta and Dhiraj Joshi and Jia Li and James
                 Z. Wang",
  title =        "Image retrieval: {Ideas}, influences, and trends of
                 the new age",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "2",
  pages =        "5:1--5:60",
  month =        apr,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1348246.1348248",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We have witnessed great interest and a wealth of
                 promise in content-based image retrieval as an emerging
                 technology. While the last decade laid foundation to
                 such promise, it also paved the way for a large number
                 of new techniques and systems, got many new people
                 involved, and triggered stronger association of weakly
                 related fields. In this article, we survey almost 300
                 key theoretical and empirical contributions in the
                 current decade related to image retrieval and automatic
                 image annotation, and in the process discuss the
                 spawning of related subfields. We also discuss
                 significant challenges involved in the adaptation of
                 existing image retrieval techniques to build systems
                 that can be useful in the real world. In retrospect of
                 what has been achieved so far, we also conjecture what
                 the future may hold for image retrieval research.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "annotation; Content-based image retrieval; learning;
                 modeling; tagging",
}

@Article{DeFlorio:2008:SLS,
  author =       "Vincenzo {De Florio} and Chris Blondia",
  title =        "A survey of linguistic structures for
                 application-level fault tolerance",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "2",
  pages =        "6:1--6:37",
  month =        apr,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1348246.1348249",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 10:21:16 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Structures for the expression of fault-tolerance
                 provisions in application software comprise the central
                 topic of this article. Structuring techniques answer
                 questions as to how to incorporate fault tolerance in
                 the application layer of a computer program and how to
                 manage the fault-tolerant code. As such, they provide
                 the means to control complexity, the latter being a
                 relevant factor for the introduction of design faults.
                 This fact and the ever-increasing complexity of today's
                 distributed software justify the need for simple,
                 coherent, and effective structures for the expression
                 of fault-tolerance in the application software. In this
                 text we first define a ``base'' of structural
                 attributes with which application-level fault-tolerance
                 structures can be qualitatively assessed and compared
                 with each other and with respect to the aforementioned
                 needs. This result is then used to provide an
                 elaborated survey of the state-of-the-art of
                 application-level fault-tolerance structures.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Language support for software-implemented fault
                 tolerance; reconfiguration and error recovery;
                 separation of design concerns; software fault
                 tolerance",
}

@Article{Huebscher:2008:SAC,
  author =       "Markus C. Huebscher and Julie A. McCann",
  title =        "A survey of autonomic computing --- degrees, models,
                 and applications",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "3",
  pages =        "7:1--7:28",
  month =        aug,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1380584.1380585",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Aug 12 12:48:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Autonomic Computing is a concept that brings together
                 many fields of computing with the purpose of creating
                 computing systems that self-manage. In its early days
                 it was criticised as being a ``hype topic'' or a
                 rebadging of some Multi Agent Systems work. In this
                 survey, we hope to show that this was not indeed `hype'
                 and that, though it draws on much work already carried
                 out by the Computer Science and Control communities,
                 its innovation is strong and lies in its robust
                 application to the specific self-management of
                 computing systems. To this end, we first provide an
                 introduction to the motivation and concepts of
                 autonomic computing and describe some research that has
                 been seen as seminal in influencing a large proportion
                 of early work. Taking the components of an established
                 reference model in turn, we discuss the works that have
                 provided significant contributions to that area. We
                 then look at larger scaled systems that compose
                 autonomic systems illustrating the hierarchical nature
                 of their architectures. Autonomicity is not a well
                 defined subject and as such different systems adhere to
                 different degrees of Autonomicity, therefore we
                 cross-slice the body of work in terms of these degrees.
                 From this we list the key applications of autonomic
                 computing and discuss the research work that is missing
                 and what we believe the community should be
                 considering.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "autonomic computing; self-adaptive; self-healing
                 systems",
}

@Article{Lopez:2008:SMT,
  author =       "Adam Lopez",
  title =        "Statistical machine translation",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "3",
  pages =        "8:1--8:49",
  month =        aug,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1380584.1380586",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Aug 12 12:48:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Statistical machine translation (SMT) treats the
                 translation of natural language as a machine learning
                 problem. By examining many samples of human-produced
                 translation, SMT algorithms automatically learn how to
                 translate. SMT has made tremendous strides in less than
                 two decades, and new ideas are constantly introduced.
                 This survey presents a tutorial overview of the state
                 of the art. We describe the context of the current
                 research and then move to a formal problem description
                 and an overview of the main subproblems: translation
                 modeling, parameter estimation, and decoding. Along the
                 way, we present a taxonomy of some different approaches
                 within these areas. We conclude with an overview of
                 evaluation and a discussion of future directions.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "machine translation; natural language processing",
}

@Article{Chapin:2008:ATM,
  author =       "Peter C. Chapin and Christian Skalka and X. Sean
                 Wang",
  title =        "Authorization in trust management: {Features} and
                 foundations",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "3",
  pages =        "9:1--9:48",
  month =        aug,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1380584.1380587",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Aug 12 12:48:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Trust management systems are frameworks for
                 authorization in modern distributed systems, allowing
                 remotely accessible resources to be protected by
                 providers. By allowing providers to specify policy, and
                 access requesters to possess certain access rights,
                 trust management automates the process of determining
                 whether access should be allowed on the basis of
                 policy, rights, and an authorization semantics. In this
                 paper we survey modern state-of-the-art in trust
                 management authorization, focusing on features of
                 policy and rights languages that provide the necessary
                 expressiveness for modern practice. We characterize
                 systems in light of a generic structure that takes into
                 account components of practical implementations. We
                 emphasize systems that have a formal foundation, since
                 security properties of them can be rigorously
                 guaranteed. Underlying formalisms are reviewed to
                 provide necessary background.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "distributed authorization; trust management systems",
}

@Article{Miltchev:2008:DAC,
  author =       "Stefan Miltchev and Jonathan M. Smith and Vassilis
                 Prevelakis and Angelos Keromytis and Sotiris
                 Ioannidis",
  title =        "Decentralized access control in distributed file
                 systems",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "3",
  pages =        "10:1--10:30",
  month =        aug,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1380584.1380588",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Aug 12 12:48:08 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Internet enables global sharing of data across
                 organizational boundaries. Distributed file systems
                 facilitate data sharing in the form of remote file
                 access. However, traditional access control mechanisms
                 used in distributed file systems are intended for
                 machines under common administrative control, and rely
                 on maintaining a centralized database of user
                 identities. They fail to scale to a large user base
                 distributed across multiple organizations. We provide a
                 survey of decentralized access control mechanisms in
                 distributed file systems intended for large scale, in
                 both administrative domains and users. We identify
                 essential properties of such access control mechanisms.
                 We analyze both popular production and experimental
                 distributed file systems in the context of our
                 survey.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "authentication; authorization; certificates;
                 credentials; decentralized access control; networked
                 file systems; trust management",
}

@Article{Ilyas:2008:STQ,
  author =       "Ihab F. Ilyas and George Beskales and Mohamed A.
                 Soliman",
  title =        "A survey of top-$k$ query processing techniques in
                 relational database systems",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "4",
  pages =        "11:1--11:58",
  month =        oct,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1391729.1391730",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 10 12:49:18 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Efficient processing of top-$k$ queries is a crucial
                 requirement in many interactive environments that
                 involve massive amounts of data. In particular,
                 efficient top-$k$ processing in domains such as the
                 Web, multimedia search, and distributed systems has
                 shown a great impact on performance. In this survey, we
                 describe and classify top-$k$ processing techniques in
                 relational databases. We discuss different design
                 dimensions in the current techniques including query
                 models, data access methods, implementation levels,
                 data and query certainty, and supported scoring
                 functions. We show the implications of each dimension
                 on the design of the underlying techniques. We also
                 discuss top-$k$ queries in XML domain, and show their
                 connections to relational approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "rank aggregation; rank-aware processing; top-k;
                 voting",
}

@Article{Biasotti:2008:DSG,
  author =       "S. Biasotti and L. {De Floriani} and B. Falcidieno and
                 P. Frosini and D. Giorgi and C. Landi and L. Papaleo
                 and M. Spagnuolo",
  title =        "Describing shapes by geometrical-topological
                 properties of real functions",
  journal =      j-COMP-SURV,
  volume =       "40",
  number =       "4",
  pages =        "12:1--12:87",
  month =        oct,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1391729.1391731",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 10 12:49:18 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Differential topology, and specifically Morse theory,
                 provide a suitable setting for formalizing and solving
                 several problems related to shape analysis. The
                 fundamental idea behind Morse theory is that of
                 combining the topological exploration of a shape with
                 quantitative measurement of geometrical properties
                 provided by a real function defined on the shape. The
                 added value of approaches based on Morse theory is in
                 the possibility of adopting different functions as
                 shape descriptors according to the properties and
                 invariants that one wishes to analyze. In this sense,
                 Morse theory allows one to construct a {\em general
                 framework\/} for shape characterization, parametrized
                 with respect to the mapping function used, and possibly
                 the space associated with the shape. The mapping
                 function plays the role of a {\em lens\/} through which
                 we look at the properties of the shape, and different
                 functions provide different insights.\par

                 In the last decade, an increasing number of methods
                 that are rooted in Morse theory and make use of
                 properties of real-valued functions for describing
                 shapes have been proposed in the literature. The
                 methods proposed range from approaches which use the
                 configuration of contours for encoding topographic
                 surfaces to more recent work on size theory and
                 persistent homology. All these have been developed over
                 the years with a specific target domain and it is not
                 trivial to systematize this work and understand the
                 links, similarities, and differences among the
                 different methods. Moreover, different terms have been
                 used to denote the same mathematical constructs, which
                 often overwhelm the understanding of the underlying
                 common framework.\par

                 The aim of this survey is to provide a clear vision of
                 what has been developed so far, focusing on methods
                 that make use of theoretical frameworks that are
                 developed for {\em classes\/} of real functions rather
                 than for a single function, even if they are applied in
                 a restricted manner. The term {\em
                 geometrical-topological\/} used in the title is meant
                 to underline that both levels of information content
                 are relevant for the applications of shape
                 descriptions: geometrical, or metrical, properties and
                 attributes are crucial for characterizing specific
                 instances of features, while topological properties are
                 necessary to abstract and classify shapes according to
                 invariant aspects of their geometry. The approaches
                 surveyed will be discussed in detail, with respect to
                 theory, computation, and application. Several
                 properties of the shape descriptors will be analyzed
                 and compared. We believe this is a crucial step to
                 exploit fully the potential of such approaches in many
                 applications, as well as to identify important areas of
                 future research.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computational topology; contour tree; Morse complexes;
                 Morse theory; persistent homology; Reeb graph; shape
                 analysis; size theory",
}

@Article{Bleiholder:2008:DF,
  author =       "Jens Bleiholder and Felix Naumann",
  title =        "Data fusion",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "1",
  pages =        "1:1--1:41",
  month =        dec,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1456650.1456651",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jan 12 16:47:51 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The development of the Internet in recent years has
                 made it possible and useful to access many different
                 information systems anywhere in the world to obtain
                 information. While there is much research on the
                 integration of heterogeneous information systems, most
                 commercial systems stop short of the actual integration
                 of available data. Data fusion is the process of fusing
                 multiple records representing the same real-world
                 object into a single, consistent, and clean
                 representation.\par

                 This article places data fusion into the greater
                 context of data integration, precisely defines the
                 goals of data fusion, namely, complete, concise, and
                 consistent data, and highlights the challenges of data
                 fusion, namely, uncertain and conflicting data values.
                 We give an overview and classification of different
                 ways of fusing data and present several techniques
                 based on standard and advanced operators of the
                 relational algebra and SQL. Finally, the article
                 features a comprehensive survey of data integration
                 systems from academia and industry, showing if and how
                 data fusion is performed in each.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Data cleansing; data conflicts; data consolidation;
                 data integration; data merging; data quality",
}

@Article{Cockburn:2008:ROZ,
  author =       "Andy Cockburn and Amy Karlson and Benjamin B.
                 Bederson",
  title =        "A review of overview+detail, zooming, and
                 focus+context interfaces",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "1",
  pages =        "2:1--2:31",
  month =        dec,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1456650.1456652",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jan 12 16:47:51 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "There are many interface schemes that allow users to
                 work at, and move between, focused and contextual views
                 of a dataset. We review and categorize these schemes
                 according to the interface mechanisms used to separate
                 and blend views. The four approaches are
                 overview+detail, which uses a spatial separation
                 between focused and contextual views; zooming, which
                 uses a temporal separation; focus+context, which
                 minimizes the seam between views by displaying the
                 focus within the context; and cue-based techniques
                 which selectively highlight or suppress items within
                 the information space. Critical features of these
                 categories, and empirical evidence of their success,
                 are discussed. The aim is to provide a succinct summary
                 of the state-of-the-art, to illuminate both successful
                 and unsuccessful interface strategies, and to identify
                 potentially fruitful areas for further work.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "fisheye views; focus+context; Information display;
                 information visualization; overview+detail; review
                 paper; zoomable user interfaces",
}

@Article{Benedikt:2008:XL,
  author =       "Michael Benedikt and Christoph Koch",
  title =        "{XPath} leashed",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "1",
  pages =        "3:1--3:54",
  month =        dec,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1456650.1456653",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jan 12 16:47:51 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This survey gives an overview of formal results on the
                 XML query language XPath. We identify several important
                 fragments of XPath, focusing on subsets of XPath 1.0.
                 We then give results on the expressiveness of XPath and
                 its fragments compared to other formalisms for querying
                 trees, algorithms, and complexity bounds for evaluation
                 of XPath queries, as well as static analysis of XPath
                 queries.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "XML; XPath",
}

@Article{Borie:2008:SPR,
  author =       "Richard B. Borie and R. Gary Parker and Craig A.
                 Tovey",
  title =        "Solving problems on recursively constructed graphs",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "1",
  pages =        "4:1--4:51",
  month =        dec,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1456650.1456654",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jan 12 16:47:51 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Fast algorithms can be created for many graph problems
                 when instances are confined to classes of graphs that
                 are recursively constructed. This article first
                 describes some basic conceptual notions regarding the
                 design of such fast algorithms, and then the coverage
                 proceeds through several recursive graph classes.
                 Specific classes include trees, series-parallel graphs,
                 {\em k\/} -terminal graphs, treewidth- {\em k\/}
                 graphs, {\em k\/} -trees, partial {\em k\/} -trees,
                 {\em k\/} -jackknife graphs, pathwidth- {\em k\/}
                 graphs, bandwidth- {\em k\/} graphs, cutwidth- {\em
                 k\/} graphs, branchwidth- {\em k\/} graphs, Halin
                 graphs, cographs, cliquewidth- {\em k\/} graphs, {\em
                 k\/} -NLC graphs, {\em k\/} -HB graphs, and rankwidth-
                 {\em k\/} graphs. The definition of each class is
                 provided. Typical algorithms are applied to solve
                 problems on instances of most classes. Relationships
                 between the classes are also discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Bandwidth; branchwidth; cliquewidth; cograph;
                 cutwidth; dynamic programming; Halin graph; pathwidth;
                 rankwidth; series parallel; tree; treewidth",
}

@Article{Onieva:2008:MNS,
  author =       "Jose A. Onieva and Jianying Zhou and Javier Lopez",
  title =        "Multiparty nonrepudiation: a survey",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "1",
  pages =        "5:1--5:43",
  month =        dec,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1456650.1456655",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jan 12 16:47:51 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Nonrepudiation is a security service that plays an
                 important role in many Internet applications.
                 Traditional two-party nonrepudiation has been studied
                 intensively in the literature. This survey focuses on
                 multiparty scenarios and provides a comprehensive
                 overview. It starts with a brief introduction of
                 fundamental issues on nonrepudiation, including the
                 types of nonrepudiation service and cryptographic
                 evidence, the roles of trusted third-party,
                 nonrepudiation phases and requirements, and the status
                 of standardization. Then it describes the general
                 multiparty nonrepudiation problem, and analyzes
                 state-of-the-art mechanisms. After this, it presents in
                 more detail the 1-N multiparty nonrepudiation solutions
                 for distribution of different messages to multiple
                 recipients. Finally, it discusses advanced solutions
                 for two typical multiparty nonrepudiation applications,
                 namely, multiparty certified email and multiparty
                 contract signing.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Multiparty applications; multiparty protocols;
                 nonrepudiation",
}

@Article{Smith-Miles:2008:CDP,
  author =       "Kate A. Smith-Miles",
  title =        "Cross-disciplinary perspectives on meta-learning for
                 algorithm selection",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "1",
  pages =        "6:1--6:25",
  month =        dec,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1456650.1456656",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jan 12 16:47:51 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The algorithm selection problem [Rice 1976] seeks to
                 answer the question: {\em Which algorithm is likely to
                 perform best for my problem?\/} Recognizing the problem
                 as a learning task in the early 1990's, the machine
                 learning community has developed the field of
                 meta-learning, focused on learning about learning
                 algorithm performance on classification problems. But
                 there has been only limited generalization of these
                 ideas beyond classification, and many related attempts
                 have been made in other disciplines (such as AI and
                 operations research) to tackle the algorithm selection
                 problem in different ways, introducing different
                 terminology, and overlooking the similarities of
                 approaches. In this sense, there is much to be gained
                 from a greater awareness of developments in
                 meta-learning, and how these ideas can be generalized
                 to learn about the behaviors of other (nonlearning)
                 algorithms. In this article we present a unified
                 framework for considering the algorithm selection
                 problem as a learning problem, and use this framework
                 to tie together the crossdisciplinary developments in
                 tackling the algorithm selection problem. We discuss
                 the generalization of meta-learning concepts to
                 algorithms focused on tasks including sorting,
                 forecasting, constraint satisfaction, and optimization,
                 and the extension of these ideas to bioinformatics,
                 cryptography, and other fields.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Algorithm selection; classification; combinatorial
                 optimization; constraint satisfaction; dataset
                 characterization; empirical hardness; forecasting;
                 landscape analysis; meta-learning; model selection;
                 sorting",
}

@Article{Abidi:2008:SAM,
  author =       "Besma R. Abidi and Nash R. Aragam and Yi Yao and Mongi
                 A. Abidi",
  title =        "Survey and analysis of multimodal sensor planning and
                 integration for wide area surveillance",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "1",
  pages =        "7:1--7:36",
  month =        dec,
  year =         "2008",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1456650.1456657",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jan 12 16:47:51 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Although sensor planning in computer vision has been a
                 subject of research for over two decades, a vast
                 majority of the research seems to concentrate on two
                 particular applications in a rather limited context of
                 laboratory and industrial workbenches, namely 3D object
                 reconstruction and robotic arm manipulation. Recently,
                 increasing interest is engaged in research to come up
                 with solutions that provide wide-area autonomous
                 surveillance systems for object characterization and
                 situation awareness, which involves portable, wireless,
                 and/or Internet connected radar, digital video, and/or
                 infrared sensors. The prominent research problems
                 associated with multisensor integration for wide-area
                 surveillance are modality selection, sensor planning,
                 data fusion, and data exchange (communication) among
                 multiple sensors. Thus, the requirements and
                 constraints to be addressed include far-field view,
                 wide coverage, high resolution, cooperative sensors,
                 adaptive sensing modalities, dynamic objects, and
                 uncontrolled environments. This article summarizes a
                 new survey and analysis conducted in light of these
                 challenging requirements and constraints. It involves
                 techniques and strategies from work done in the areas
                 of sensor fusion, sensor networks, smart sensing,
                 Geographic Information Systems (GIS), photogrammetry,
                 and other intelligent systems where finding optimal
                 solutions to the placement and deployment of multimodal
                 sensors covering a wide area is important. While
                 techniques covered in this survey are applicable to
                 many wide-area environments such as traffic monitoring,
                 airport terminal surveillance, parking lot
                 surveillance, etc., our examples will be drawn mainly
                 from such applications as harbor security and
                 long-range face recognition.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "cooperative sensing; multimodal sensing; persistent
                 surveillance; Sensor planning; threat object
                 recognition; ubiquitous surveillance; wireless sensor
                 network",
}

@Article{Brown:2009:CIC,
  author =       "Nathan Brown",
  title =        "Chemoinformatics --- an introduction for computer
                 scientists",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "2",
  pages =        "8:1--8:38",
  month =        feb,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1459352.1459353",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 20 13:36:29 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Chemoinformatics is an interface science aimed
                 primarily at discovering novel chemical entities that
                 will ultimately result in the development of novel
                 treatments for unmet medical needs, although these same
                 methods are also applied in other fields that
                 ultimately design new molecules. The field combines
                 expertise from, among others, chemistry, biology,
                 physics, biochemistry, statistics, mathematics, and
                 computer science. In this general review of
                 chemoinformatics the emphasis is placed on describing
                 the general methods that are routinely applied in
                 molecular discovery and in a context that provides for
                 an easily accessible article for computer scientists as
                 well as scientists from other numerate disciplines.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Chemoinformatics; chemometrics; docking; drug
                 discovery; molecular modeling; QSAR",
}

@Article{Hierons:2009:UFS,
  author =       "Robert M. Hierons and Kirill Bogdanov and Jonathan P.
                 Bowen and Rance Cleaveland and John Derrick and Jeremy
                 Dick and Marian Gheorghe and Mark Harman and Kalpesh
                 Kapoor and Paul Krause and Gerald L{\"u}ttgen and
                 Anthony J. H. Simons and Sergiy Vilkomir and Martin R.
                 Woodward and Hussein Zedan",
  title =        "Using formal specifications to support testing",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "2",
  pages =        "9:1--9:76",
  month =        feb,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1459352.1459354",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 20 13:36:29 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Formal methods and testing are two important
                 approaches that assist in the development of
                 high-quality software. While traditionally these
                 approaches have been seen as rivals, in recent years a
                 new consensus has developed in which they are seen as
                 complementary. This article reviews the state of the
                 art regarding ways in which the presence of a formal
                 specification can be used to assist testing.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "formal methods; Software testing",
}

@Article{Navigli:2009:WSD,
  author =       "Roberto Navigli",
  title =        "Word sense disambiguation: a survey",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "2",
  pages =        "10:1--10:69",
  month =        feb,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1459352.1459355",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 20 13:36:29 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Word sense disambiguation (WSD) is the ability to
                 identify the meaning of words in context in a
                 computational manner. WSD is considered an AI-complete
                 problem, that is, a task whose solution is at least as
                 hard as the most difficult problems in artificial
                 intelligence. We introduce the reader to the
                 motivations for solving the ambiguity of words and
                 provide a description of the task. We overview
                 supervised, unsupervised, and knowledge-based
                 approaches. The assessment of WSD systems is discussed
                 in the context of the Senseval/Semeval campaigns,
                 aiming at the objective evaluation of systems
                 participating in several different disambiguation
                 tasks. Finally, applications, open problems, and future
                 directions are discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "lexical ambiguity; lexical semantics; semantic
                 annotation; sense annotation; Word sense
                 disambiguation; word sense discrimination; WSD",
}

@Article{Iriberri:2009:LCP,
  author =       "Alicia Iriberri and Gondy Leroy",
  title =        "A life-cycle perspective on online community success",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "2",
  pages =        "11:1--11:29",
  month =        feb,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1459352.1459356",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 20 13:36:29 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Using the information systems lifecycle as a unifying
                 framework, we review online communities research and
                 propose a sequence for incorporating success conditions
                 during initiation and development to increase their
                 chances of becoming a successful community, one in
                 which members participate actively and develop lasting
                 relationships. Online communities evolve following
                 distinctive lifecycle stages and recommendations for
                 success are more or less relevant depending on the
                 developmental stage of the online community. In
                 addition, the goal of the online community under study
                 determines the components to include in the development
                 of a successful online community. Online community
                 builders and researchers will benefit from this review
                 of the conditions that help online communities
                 succeed.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "lifecycle; literature review; Online communities;
                 success factors",
}

@Article{Qi:2009:WPC,
  author =       "Xiaoguang Qi and Brian D. Davison",
  title =        "{Web} page classification: Features and algorithms",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "2",
  pages =        "12:1--12:31",
  month =        feb,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1459352.1459357",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 20 13:36:29 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Classification of Web page content is essential to
                 many tasks in Web information retrieval such as
                 maintaining Web directories and focused crawling. The
                 uncontrolled nature of Web content presents additional
                 challenges to Web page classification as compared to
                 traditional text classification, but the interconnected
                 nature of hypertext also provides features that can
                 assist the process.\par

                 As we review work in Web page classification, we note
                 the importance of these Web-specific features and
                 algorithms, describe state-of-the-art practices, and
                 track the underlying assumptions behind the use of
                 information from neighboring pages.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Categorization; Web mining",
}

@Article{Furia:2009:CTL,
  author =       "Carlo A. Furia and Matteo Pradella and Matteo Rossi",
  title =        "Comments on temporal logics for real-time system
                 specification",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "2",
  pages =        "13:1--13:5",
  month =        feb,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1459352.1459358",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 20 13:36:29 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The article ``Temporal Logics for Real-Time System
                 Specification'' surveys some of the relevant literature
                 dealing with the use of temporal logics for the
                 specification of real-time systems. Unfortunately, it
                 introduces some imprecisions that might create some
                 confusion in the reader. While a certain degree of
                 informality is certainly useful when addressing a broad
                 audience, imprecisions can negatively impact the
                 legibility of the exposition. We clarify some of its
                 remarks on a few topics, in an effort to contribute to
                 the usefulness of the survey for the reader.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Temporal logic",
}

@Article{Sockut:2009:ORD,
  author =       "Gary H. Sockut and Balakrishna R. Iyer",
  title =        "Online reorganization of databases",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "3",
  pages =        "14:1--14:136",
  month =        jul,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1541880.1541881",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Aug 11 18:48:26 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In practice, any database management system sometimes
                 needs reorganization, that is, a change in some aspect
                 of the logical and/or physical arrangement of a
                 database. In traditional practice, many types of
                 reorganization have required denying access to a
                 database (taking the database offline) during
                 reorganization. Taking a database offline can be
                 unacceptable for a highly available (24-hour) database,
                 for example, a database serving electronic commerce or
                 armed forces, or for a very large database. A solution
                 is to reorganize online (concurrently with usage of the
                 database, incrementally during users' activities, or
                 interpretively). This article is a tutorial and survey
                 on requirements, issues, and strategies for online
                 reorganization. It analyzes the issues and then
                 presents the strategies, which use the issues. The
                 issues, most of which involve design trade-offs,
                 include use of partitions, the locus of control for the
                 process that reorganizes (a background process or
                 users' activities), reorganization by copying to newly
                 allocated storage (as opposed to reorganizing in
                 place), use of differential files, references to data
                 that has moved, performance, and activation of
                 reorganization. The article surveys online strategies
                 in three categories of reorganization. The first
                 category, maintenance, involves restoring the physical
                 arrangement of data instances without changing the
                 database definition. This category includes restoration
                 of clustering, reorganization of an index, rebalancing
                 of parallel or distributed data, garbage collection for
                 persistent storage, and cleaning (reclamation of space)
                 in a log-structured file system. The second category
                 involves changing the physical database definition;
                 topics include construction of indexes, conversion
                 between B$^+$ -trees and linear hash files, and
                 redefinition (e.g., splitting) of partitions. The third
                 category involves changing the logical database
                 definition. Some examples are changing a column's data
                 type, changing the inheritance hierarchy of object
                 classes, and changing a relationship from one-to-many
                 to many-to-many. The survey encompasses both research
                 and commercial implementations, and this article points
                 out several open research topics. As highly available
                 or very large databases continue to become more common
                 and more important in the world economy, the importance
                 of online reorganization is likely to continue
                 growing.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Clustering; concurrent reorganization; indexes;
                 log-structured file systems; maintenance; online
                 reorganization; redefinition; reorganization;
                 restructuring; schema evolution; very large databases",
}

@Article{Chandola:2009:ADS,
  author =       "Varun Chandola and Arindam Banerjee and Vipin Kumar",
  title =        "Anomaly detection: a survey",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "3",
  pages =        "15:1--15:58",
  month =        jul,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1541880.1541882",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Aug 11 18:48:26 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Anomaly detection is an important problem that has
                 been researched within diverse research areas and
                 application domains. Many anomaly detection techniques
                 have been specifically developed for certain
                 application domains, while others are more generic.
                 This survey tries to provide a structured and
                 comprehensive overview of the research on anomaly
                 detection. We have grouped existing techniques into
                 different categories based on the underlying approach
                 adopted by each technique. For each category we have
                 identified key assumptions, which are used by the
                 techniques to differentiate between normal and
                 anomalous behavior. When applying a given technique to
                 a particular domain, these assumptions can be used as
                 guidelines to assess the effectiveness of the technique
                 in that domain. For each category, we provide a basic
                 anomaly detection technique, and then show how the
                 different existing techniques in that category are
                 variants of the basic technique. This template provides
                 an easier and more succinct understanding of the
                 techniques belonging to each category. Further, for
                 each category, we identify the advantages and
                 disadvantages of the techniques in that category. We
                 also provide a discussion on the computational
                 complexity of the techniques since it is an important
                 issue in real application domains. We hope that this
                 survey will provide a better understanding of the
                 different directions in which research has been done on
                 this topic, and how techniques developed in one area
                 can be applied in domains for which they were not
                 intended to begin with.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Anomaly detection; outlier detection",
}

@Article{Batini:2009:MDQ,
  author =       "Carlo Batini and Cinzia Cappiello and Chiara
                 Francalanci and Andrea Maurino",
  title =        "Methodologies for data quality assessment and
                 improvement",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "3",
  pages =        "16:1--16:52",
  month =        jul,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1541880.1541883",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Aug 11 18:48:26 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The literature provides a wide range of techniques to
                 assess and improve the quality of data. Due to the
                 diversity and complexity of these techniques, research
                 has recently focused on defining methodologies that
                 help the selection, customization, and application of
                 data quality assessment and improvement techniques. The
                 goal of this article is to provide a systematic and
                 comparative description of such methodologies.
                 Methodologies are compared along several dimensions,
                 including the methodological phases and steps, the
                 strategies and techniques, the data quality dimensions,
                 the types of data, and, finally, the types of
                 information systems addressed by each methodology. The
                 article concludes with a summary description of each
                 methodology.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Data quality; data quality assessment; data quality
                 improvement; data quality measurement; information
                 system; methodology; quality dimension",
}

@Article{Carpineto:2009:SWC,
  author =       "Claudio Carpineto and Stanislaw Osi{\'n}ski and
                 Giovanni Romano and Dawid Weiss",
  title =        "A survey of {Web} clustering engines",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "3",
  pages =        "17:1--17:38",
  month =        jul,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1541880.1541884",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Aug 11 18:48:26 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Web clustering engines organize search results by
                 topic, thus offering a complementary view to the
                 flat-ranked list returned by conventional search
                 engines. In this survey, we discuss the issues that
                 must be addressed in the development of a Web
                 clustering engine, including acquisition and
                 preprocessing of search results, their clustering and
                 visualization. Search results clustering, the core of
                 the system, has specific requirements that cannot be
                 addressed by classical clustering algorithms. We
                 emphasize the role played by the quality of the cluster
                 labels as opposed to optimizing only the clustering
                 structure. We highlight the main characteristics of a
                 number of existing Web clustering engines and also
                 discuss how to evaluate their retrieval performance.
                 Some directions for future research are finally
                 presented.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Information retrieval; meta search engines; search
                 results clustering; text clustering; user interfaces",
}

@Article{Hoare:2009:PSI,
  author =       "C. A. R. Hoare and Jayadev Misra",
  title =        "Preface to special issue on software verification",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "4",
  pages =        "18:1--18:3",
  month =        oct,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592434.1592435",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 7 08:29:52 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Woodcock:2009:FMP,
  author =       "Jim Woodcock and Peter Gorm Larsen and Juan Bicarregui
                 and John Fitzgerald",
  title =        "Formal methods: {Practice} and experience",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "4",
  pages =        "19:1--19:36",
  month =        oct,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592434.1592436",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 7 08:29:52 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Formal methods use mathematical models for analysis
                 and verification at any part of the program life-cycle.
                 We describe the state of the art in the industrial use
                 of formal methods, concentrating on their increasing
                 use at the earlier stages of specification and design.
                 We do this by reporting on a new survey of industrial
                 use, comparing the situation in 2009 with the most
                 significant surveys carried out over the last 20 years.
                 We describe some of the highlights of our survey by
                 presenting a series of industrial projects, and we draw
                 some observations from these surveys and records of
                 experience. Based on this, we discuss the issues
                 surrounding the industrial adoption of formal methods.
                 Finally, we look to the future and describe the
                 development of a Verified Software Repository, part of
                 the worldwide Verified Software Initiative. We
                 introduce the initial projects being used to populate
                 the repository, and describe the challenges they
                 address.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Experimental software engineering; formal methods
                 surveys; grand challenges; verified software
                 initiative; verified software repository",
}

@Article{Shankar:2009:ADV,
  author =       "Natarajan Shankar",
  title =        "Automated deduction for verification",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "4",
  pages =        "20:1--20:56",
  month =        oct,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592434.1592437",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 7 08:29:52 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Automated deduction uses computation to perform
                 symbolic logical reasoning. It has been a core
                 technology for program verification from the very
                 beginning. Satisfiability solvers for propositional and
                 first-order logic significantly automate the task of
                 deductive program verification. We introduce some of
                 the basic deduction techniques used in software and
                 hardware verification and outline the theoretical and
                 engineering issues in building deductive verification
                 tools. Beyond verification, deduction techniques can
                 also be used to support a variety of applications
                 including planning, program optimization, and program
                 synthesis.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jhala:2009:SMC,
  author =       "Ranjit Jhala and Rupak Majumdar",
  title =        "Software model checking",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "4",
  pages =        "21:1--21:54",
  month =        oct,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592434.1592438",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 7 08:29:52 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We survey recent progress in software model
                 checking.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "abstraction; counterexample-guided refinement;
                 enumerative and symbolic model checking; liveness;
                 safety; Software model checking",
}

@Article{Hoare:2009:VSI,
  author =       "C. A. R. Hoare and Jayadev Misra and Gary T. Leavens
                 and Natarajan Shankar",
  title =        "The verified software initiative: a manifesto",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "4",
  pages =        "22:1--22:8",
  month =        oct,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592434.1592439",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 7 08:29:52 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hoffman:2009:SAD,
  author =       "Kevin Hoffman and David Zage and Cristina
                 Nita-Rotaru",
  title =        "A survey of attack and defense techniques for
                 reputation systems",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "1",
  pages =        "1:1--1:31",
  month =        dec,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592451.1592452",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 15 11:55:39 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chen:2009:RLC,
  author =       "Hubie Chen",
  title =        "A rendezvous of logic, complexity, and algebra",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "1",
  pages =        "2:1--2:32",
  month =        dec,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592451.1592453",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 15 11:55:39 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "An emerging area of research studies the complexity of
                 constraint satisfaction problems under restricted
                 constraint languages. This article gives a
                 self-contained, contemporary presentation of Schaefer's
                 theorem on Boolean constraint satisfaction, the
                 inaugural result of this area, as well as analogs of
                 this theorem for quantified formulas. Our exposition
                 makes use of and may serve as an introduction to
                 logical and algebraic tools that have recently come
                 into focus.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Constraint satisfaction; polymorphisms; propositional
                 logic; quantified formulas; Schaefer's theorem",
}

@Article{Kirke:2009:SCS,
  author =       "Alexis Kirke and Eduardo Reck Miranda",
  title =        "A survey of computer systems for expressive music
                 performance",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "1",
  pages =        "3:1--3:41",
  month =        dec,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592451.1592454",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 15 11:55:39 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We present a survey of research into automated and
                 semiautomated computer systems for expressive
                 performance of music. We will examine the motivation
                 for such systems and then examine the majority of the
                 systems developed over the last 25 years. To highlight
                 some of the possible future directions for new
                 research, the review uses primary terms of reference
                 based on four elements: testing status, expressive
                 representation, polyphonic ability, and performance
                 creativity.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer music; generative performance; machine
                 learning; Music performance",
}

@Article{Muir:2009:IGE,
  author =       "James A. Muir and Paul C. {Van Oorschot}",
  title =        "{Internet} geolocation: {Evasion} and counterevasion",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "1",
  pages =        "4:1--4:23",
  month =        dec,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592451.1592455",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 15 11:55:39 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Internet geolocation technology aims to determine the
                 physical (geographic) location of Internet users and
                 devices. It is currently proposed or in use for a wide
                 variety of purposes, including targeted marketing,
                 restricting digital content sales to authorized
                 jurisdictions, and security applications such as
                 reducing credit card fraud. This raises questions about
                 the veracity of claims of accurate and reliable
                 geolocation. We provide a survey of Internet
                 geolocation technologies with an emphasis on
                 adversarial contexts; that is, we consider how this
                 technology performs against a knowledgeable adversary
                 whose goal is to evade geolocation. We do so by
                 examining first the limitations of existing techniques,
                 and then, from this base, determining how best to evade
                 existing geolocation techniques. We also consider two
                 further geolocation techniques which may be of use even
                 against adversarial targets: (1) the extraction of
                 client IP addresses using functionality introduced in
                 the 1.5 Java API, and (2) the collection of round-trip
                 times using HTTP refreshes. These techniques illustrate
                 that the seemingly straightforward technique of evading
                 geolocation by relaying traffic through a proxy server
                 (or network of proxy servers) is not as straightforward
                 as many end-users might expect. We give a demonstration
                 of this for users of the popular Tor anonymizing
                 network.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "adversarial environment; anonymizing network; evasion;
                 Internet geolocation; Tor",
}

@Article{Edman:2009:AES,
  author =       "Matthew Edman and B{\"u}lent Yener",
  title =        "On anonymity in an electronic society: a survey of
                 anonymous communication systems",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "1",
  pages =        "5:1--5:35",
  month =        dec,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592451.1592456",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 15 11:55:39 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The past two decades have seen a growing interest in
                 methods for anonymous communication on the Internet,
                 both from the academic community and the general
                 public. Several system designs have been proposed in
                 the literature, of which a number have been implemented
                 and are used by diverse groups, such as journalists,
                 human rights workers, the military, and ordinary
                 citizens, to protect their identities on the
                 Internet.\par

                 In this work, we survey the previous research done to
                 design, develop, and deploy systems for enabling
                 private and anonymous communication on the Internet. We
                 identify and describe the major concepts and
                 technologies in the field, including mixes and mix
                 networks, onion routing, and Dining Cryptographers
                 networks. We will also review powerful traffic analysis
                 attacks that have motivated improvements and variations
                 on many of these anonymity protocols made since their
                 introduction. Finally, we will summarize some of the
                 major open problems in anonymous communication research
                 and discuss possible directions for future work in the
                 field.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Anonymity; anonymous communication; DC-nets; mix
                 networks; mixes; onion routing; privacy; traffic
                 analysis",
}

@Article{Furia:2010:MTC,
  author =       "Carlo A. Furia and Dino Mandrioli and Angelo Morzenti
                 and Matteo Rossi",
  title =        "Modeling time in computing: a taxonomy and a
                 comparative survey",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "2",
  pages =        "6:1--6:59",
  month =        feb,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1667062.1667063",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 15 11:56:03 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The increasing relevance of areas such as real-time
                 and embedded systems, pervasive computing, hybrid
                 systems control, and biological and social systems
                 modeling is bringing a growing attention to the
                 temporal aspects of computing, not only in the computer
                 science domain, but also in more traditional fields of
                 engineering.\par

                 This article surveys various approaches to the formal
                 modeling and analysis of the temporal features of
                 computer-based systems, with a level of detail that is
                 also suitable for nonspecialists. In doing so, it
                 provides a unifying framework, rather than just a
                 comprehensive list of formalisms.\par

                 The article first lays out some key dimensions along
                 which the various formalisms can be evaluated and
                 compared. Then, a significant sample of formalisms for
                 time modeling in computing are presented and discussed
                 according to these dimensions. The adopted perspective
                 is, to some extent, historical, going from
                 ``traditional'' models and formalisms to more modern
                 ones.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "dynamic systems; Temporal aspects of computing; time
                 modeling",
}

@Article{Haslhofer:2010:STA,
  author =       "Bernhard Haslhofer and Wolfgang Klas",
  title =        "A survey of techniques for achieving metadata
                 interoperability",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "2",
  pages =        "7:1--7:37",
  month =        feb,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1667062.1667064",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 15 11:56:03 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Achieving uniform access to media objects in
                 heterogeneous media repositories requires dealing with
                 the problem of metadata interoperability. Currently
                 there exist many interoperability techniques, with
                 quite varying potential for resolving the structural
                 and semantic heterogeneities that can exist between
                 metadata stored in distinct repositories. Besides
                 giving a general overview of the field of metadata
                 interoperability, we provide a categorization of
                 existing interoperability techniques, describe their
                 characteristics, and compare their quality by analyzing
                 their potential for resolving various types of
                 heterogeneities. Based on our work, domain experts and
                 technicians get an overview and categorization of
                 existing metadata interoperability techniques and can
                 select the appropriate approach for their specific
                 metadata integration scenarios. Our analysis explicitly
                 shows that metadata mapping is the appropriate
                 technique in integration scenarios where an agreement
                 on a certain metadata standard is not possible.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "interoperability; mapping; Metadata standards",
}

@Article{Yu:2010:SMS,
  author =       "Zhiwen Yu and Yuichi Nakamura",
  title =        "Smart meeting systems: a survey of state-of-the-art
                 and open issues",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "2",
  pages =        "8:1--8:20",
  month =        feb,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1667062.1667065",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 15 11:56:03 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Smart meeting systems, which record meetings and
                 analyze the generated audio--visual content for future
                 viewing, have been a topic of great interest in recent
                 years. A successful smart meeting system relies on
                 various technologies, ranging from devices and
                 algorithms to architecture. This article presents a
                 condensed survey of existing research and technologies,
                 including smart meeting system architecture, meeting
                 capture, meeting recognition, semantic processing, and
                 evaluation methods. It aims at providing an overview of
                 underlying technologies to help understand the key
                 design issues of such systems. This article also
                 describes various open issues as possible ways to
                 extend the capabilities of current smart meeting
                 systems.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "evaluation; meeting capture; meeting recognition;
                 semantic processing; Smart meeting system",
}

@Article{Abella:2010:EM,
  author =       "Jaume Abella and Xavier Vera",
  title =        "Electromigration for microarchitects",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "2",
  pages =        "9:1--9:18",
  month =        feb,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1667062.1667066",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 15 11:56:03 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Degradation of devices has become a major issue for
                 processor design due to continuous device shrinkage and
                 current density increase. Transistors and wires suffer
                 high stress, and failures may appear in the field. In
                 particular, wires degrade mainly due to
                 electromigration when driving current. Techniques to
                 mitigate electromigration to some extent have been
                 proposed from the circuit point of view, but much
                 effort is still required from the microarchitecture
                 side to enable wire scaling in future
                 technologies.\par

                 This survey brings to the microarchitecture community a
                 comprehensive study of the causes and implications of
                 electromigration in digital circuits and describes the
                 challenges that must be faced to mitigate
                 electromigration by means of microarchitectural
                 solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "buses; degradation; Electromigration; wires",
}

@Article{Salfner:2010:SOF,
  author =       "Felix Salfner and Maren Lenk and Miroslaw Malek",
  title =        "A survey of online failure prediction methods",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "3",
  pages =        "10:1--10:42",
  month =        mar,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1670679.1670680",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 25 09:34:56 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "With the ever-growing complexity and dynamicity of
                 computer systems, proactive fault management is an
                 effective approach to enhancing availability. Online
                 failure prediction is the key to such techniques. In
                 contrast to classical reliability methods, online
                 failure prediction is based on runtime monitoring and a
                 variety of models and methods that use the current
                 state of a system and, frequently, the past experience
                 as well. This survey describes these methods. To
                 capture the wide spectrum of approaches concerning this
                 area, a taxonomy has been developed, whose different
                 approaches are explained and major concepts are
                 described in detail.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Error; failure prediction; fault; prediction metrics;
                 runtime monitoring",
}

@Article{Kabak:2010:SAE,
  author =       "Yildiray Kabak and Asuman Dogac",
  title =        "A survey and analysis of electronic business document
                 standards",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "3",
  pages =        "11:1--11:31",
  month =        mar,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1670679.1670681",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 25 09:34:56 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "No document standard is sufficient for all purposes
                 because the requirements significantly differ among
                 businesses, industries, and geopolitical regions. On
                 the other hand, the ultimate aim of business document
                 interoperability is to exchange business data among
                 partners without any prior agreements related to the
                 document syntax and semantics. Therefore, an important
                 characteristic of a document standard is its ability to
                 adapt to different contexts, its extensibility, and its
                 customization. The UN/CEFACT Core Component Technical
                 Specification (CCTS) is an important landmark in this
                 direction.\par

                 In this article, we present a survey and an analysis of
                 some of the prominent UN/CEFACT CCTS-based electronic
                 document standards. We describe their document design
                 principles and discuss how they handle customization
                 and extensibility. We address their industry relevance
                 and the recent efforts for their harmonization and
                 convergence. We conclude by mentioning some emerging
                 efforts for the semantic interoperability of different
                 document standards.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Document Interoperability Standards; eBusiness; Global
                 Standards One (GS1) XML; OAGIS Business Object
                 Documents (BODs); OASIS Universal Business Language
                 (UBL); UN/CEFACT Core Component Technical Specification
                 (CCTS)",
}

@Article{Ilarri:2010:LDQ,
  author =       "Sergio Ilarri and Eduardo Mena and Arantza
                 Illarramendi",
  title =        "Location-dependent query processing: {Where} we are
                 and where we are heading",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "3",
  pages =        "12:1--12:73",
  month =        mar,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1670679.1670682",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 25 09:34:56 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The continuous development of wireless networks and
                 mobile devices has motivated an intense research in
                 mobile data services. Some of these services provide
                 the user with context-aware information. Specifically,
                 location-based services and location-dependent queries
                 have attracted a lot of interest.\par

                 In this article, the existing literature in the field
                 of location-dependent query processing is reviewed. The
                 technological context (mobile computing) and support
                 middleware (such as moving object databases and data
                 stream technology) are described, location-based
                 services and location-dependent queries are defined and
                 classified, and different query processing approaches
                 are reviewed and compared.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Continuous queries; location-based services;
                 location-dependent data; location-dependent queries;
                 mobile computing; query processing",
}

@Article{Cardoso:2010:CRC,
  author =       "Jo{\~a}o M. P. Cardoso and Pedro C. Diniz and Markus
                 Weinhardt",
  title =        "Compiling for reconfigurable computing: a survey",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "4",
  pages =        "13:1--13:65",
  month =        jun,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1749603.1749604",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 21 18:51:52 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Reconfigurable computing platforms offer the promise
                 of substantially accelerating computations through the
                 concurrent nature of hardware structures and the
                 ability of these architectures for hardware
                 customization. Effectively programming such
                 reconfigurable architectures, however, is an extremely
                 cumbersome and error-prone process, as it requires
                 programmers to assume the role of hardware designers
                 while mastering hardware description languages, thus
                 limiting the acceptance and dissemination of this
                 promising technology. To address this problem,
                 researchers have developed numerous approaches at both
                 the programming languages as well as the compilation
                 levels, to offer high-level programming abstractions
                 that would allow programmers to easily map applications
                 to reconfigurable architectures. This survey describes
                 the major research efforts on compilation techniques
                 for reconfigurable computing architectures. The survey
                 focuses on efforts that map computations written in
                 imperative programming languages to reconfigurable
                 architectures and identifies the main compilation and
                 synthesis techniques used in this mapping.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "Compilation; custom-computing platforms; FPGA;
                 hardware compilers; high-level synthesis; mapping
                 methods; reconfigurable computing",
}

@Article{Fung:2010:PPD,
  author =       "Benjamin C. M. Fung and Ke Wang and Rui Chen and
                 Philip S. Yu",
  title =        "Privacy-preserving data publishing: a survey of recent
                 developments",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "4",
  pages =        "14:1--14:53",
  month =        jun,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1749603.1749605",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 21 18:51:52 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The collection of digital information by governments,
                 corporations, and individuals has created tremendous
                 opportunities for knowledge- and information-based
                 decision making. Driven by mutual benefits, or by
                 regulations that require certain data to be published,
                 there is a demand for the exchange and publication of
                 data among various parties. Data in its original form,
                 however, typically contains sensitive information about
                 individuals, and publishing such data will violate
                 individual privacy. The current practice in data
                 publishing relies mainly on policies and guidelines as
                 to what types of data can be published and on
                 agreements on the use of published data. This approach
                 alone may lead to excessive data distortion or
                 insufficient protection. {\em Privacy-preserving data
                 publishing\/} (PPDP) provides methods and tools for
                 publishing useful information while preserving data
                 privacy. Recently, PPDP has received considerable
                 attention in research communities, and many approaches
                 have been proposed for different data publishing
                 scenarios. In this survey, we will systematically
                 summarize and evaluate different approaches to PPDP,
                 study the challenges in practical data publishing,
                 clarify the differences and requirements that
                 distinguish PPDP from other related problems, and
                 propose future research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "anonymity; data mining; Information sharing; privacy
                 protection; sensitive information",
}

@Article{Gao:2010:VSV,
  author =       "Wen Gao and Yonghong Tian and Tiejun Huang and Qiang
                 Yang",
  title =        "Vlogging: a survey of videoblogging technology on the
                 {Web}",
  journal =      j-COMP-SURV,
  volume =       "42",
  number =       "4",
  pages =        "15:1--15:57",
  month =        jun,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1749603.1749606",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 21 18:51:52 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In recent years, blogging has become an exploding
                 passion among Internet communities. By combining the
                 grassroots blogging with the richness of expression
                 available in video, videoblogs (vlogs for short) will
                 be a powerful new media adjunct to our existing
                 televised news sources. Vlogs have gained much
                 attention worldwide, especially with Google's
                 acquisition of YouTube. This article presents a
                 comprehensive survey of videoblogging (vlogging for
                 short) as a new technological trend. We first summarize
                 the technological challenges for vlogging as four key
                 issues that need to be answered. Along with their
                 respective possibilities, we give a review of the
                 currently available techniques and tools supporting
                 vlogging, and envision emerging technological
                 directions for future vlogging. Several multimedia
                 technologies are introduced to empower vlogging
                 technology with better scalability, interactivity,
                 searchability, and accessability, and to potentially
                 reduce the legal, economic, and moral risks of vlogging
                 applications. We also make an in-depth investigation of
                 various vlog mining topics from a research perspective
                 and present several incentive applications such as
                 user-targeted video advertising and collective
                 intelligence gaming. We believe that vlogging and its
                 applications will bring new opportunities and drives to
                 the research in related fields.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "multimedia computing; Survey; vlog mining; vlogging;
                 vlogs",
}

@Article{Cannataro:2010:PPI,
  author =       "Mario Cannataro and Pietro H. Guzzi and Pierangelo
                 Veltri",
  title =        "Protein-to-protein interactions: {Technologies},
                 databases, and algorithms",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "1",
  pages =        "1:1--1:36",
  month =        nov,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1824795.1824796",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 9 11:50:14 MST 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Studying proteins and their structures has an
                 important role for understanding protein
                 functionalities. Recently, due to important results
                 obtained with proteomics, a great interest has been
                 given to interactomics, that is, the study of
                 protein-to-protein interactions, called PPI, or more
                 generally, interactions among macromolecules,
                 particularly within cells. Interactomics means
                 studying, modeling, storing, and retrieving
                 protein-to-protein interactions as well as algorithms
                 for manipulating, simulating, and predicting
                 interactions. PPI data can be obtained from biological
                 experiments studying interactions. Modeling and storing
                 PPIs can be realized by using graph theory and graph
                 data management, thus graph databases can be queried
                 for further experiments. PPI graphs can be used as
                 input for data-mining algorithms, where raw data are
                 binary interactions forming interaction graphs, and
                 analysis algorithms retrieve biological interactions
                 among proteins (i.e., PPI biological meanings).",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Diesburg:2010:SCD,
  author =       "Sarah M. Diesburg and An-I Andy Wang",
  title =        "A survey of confidential data storage and deletion
                 methods",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "1",
  pages =        "2:1--2:37",
  month =        nov,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1824795.1824797",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 9 11:50:14 MST 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "As the amount of digital data grows, so does the theft
                 of sensitive data through the loss or misplacement of
                 laptops, thumb drives, external hard drives, and other
                 electronic storage media. Sensitive data may also be
                 leaked accidentally due to improper disposal or resale
                 of storage media. To protect the secrecy of the entire
                 data lifetime, we must have confidential ways to store
                 and delete data. This survey summarizes and compares
                 existing methods of providing confidential storage and
                 deletion of data in personal computing environments.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mabroukeh:2010:TSP,
  author =       "Nizar R. Mabroukeh and C. I. Ezeife",
  title =        "A taxonomy of sequential pattern mining algorithms",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "1",
  pages =        "3:1--3:41",
  month =        nov,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1824795.1824798",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 9 11:50:14 MST 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Owing to important applications such as mining Web
                 page traversal sequences, many algorithms have been
                 introduced in the area of sequential pattern mining
                 over the last decade, most of which have also been
                 modified to support concise representations like
                 closed, maximal, incremental or hierarchical sequences.
                 This article presents a taxonomy of sequential
                 pattern-mining techniques in the literature with Web
                 usage mining as an application. This article
                 investigates these algorithms by introducing a taxonomy
                 for classifying sequential pattern-mining algorithms
                 based on important key features supported by the
                 techniques. This classification aims at enhancing
                 understanding of sequential pattern-mining problems,
                 current status of provided solutions, and direction of
                 research in this area.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mili:2010:BPM,
  author =       "Hafedh Mili and Guy Tremblay and Guitta Bou Jaoude and
                 {\'E}ric Lefebvre and Lamia Elabed and Ghizlane El
                 Boussaidi",
  title =        "Business process modeling languages: {Sorting} through
                 the alphabet soup",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "1",
  pages =        "4:1--4:56",
  month =        nov,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1824795.1824799",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 9 11:50:14 MST 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Requirements capture is arguably the most important
                 step in software engineering, and yet the most
                 difficult and the least formalized one [Phalp and
                 Shepperd 2000]. Enterprises build information systems
                 to support their business processes. Software
                 engineering research has typically focused on the
                 development process, starting with user
                 requirements---if that---with business modeling often
                 confused with software system modeling [Isoda 2001].
                 Researchers and practitioners in management information
                 systems have long recognized that understanding the
                 business processes that an information system must
                 support is key to eliciting the needs of its users (see
                 e.g., Eriksson and Penker 2000), but lacked the tools
                 to model such business processes or to relate such
                 models to software requirements.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kurian:2010:SDA,
  author =       "Jinu Kurian and Kamil Sarac",
  title =        "A survey on the design, applications, and enhancements
                 of application-layer overlay networks",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "1",
  pages =        "5:1--5:34",
  month =        nov,
  year =         "2010",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1824795.1824800",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 9 11:50:14 MST 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article presents a survey of recent advancements
                 in application-layer overlay networks. Some of the most
                 important applications that have been proposed for
                 overlays include multicast, QoS support,
                 denial-of-service (DoS) defense, and resilient routing.
                 We look at some of the important approaches proposed
                 for these applications and compare the advantages and
                 disadvantages of these approaches. We also examine some
                 of the enhancements that have been proposed in overlay
                 topology design, enhanced routing performance, failure
                 resistance, and the issues related to coexistence of
                 overlay and native layers in the Internet. We conclude
                 the article with a comment on the purist vs pluralist
                 argument of overlay networks that has received much
                 debate recently.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chaovalit:2011:DWT,
  author =       "Pimwadee Chaovalit and Aryya Gangopadhyay and George
                 Karabatis and Zhiyuan Chen",
  title =        "Discrete wavelet transform-based time series analysis
                 and mining",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "2",
  pages =        "6:1--6:37",
  month =        jan,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1883612.1883613",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Jan 30 14:27:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Time series are recorded values of an interesting
                 phenomenon such as stock prices, household incomes, or
                 patient heart rates over a period of time. Time series
                 data mining focuses on discovering interesting patterns
                 in such data. This article introduces a wavelet-based
                 time series data analysis to interested readers. It
                 provides a systematic survey of various analysis
                 techniques that use discrete wavelet transformation
                 (DWT) in time series data mining, and outlines the
                 benefits of this approach demonstrated by previous
                 studies performed on diverse application domains,
                 including image classification, multimedia retrieval,
                 and computer network anomaly detection.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Viana:2011:OSF,
  author =       "Aline Carneiro Viana and Stephane Maag and Fatiha
                 Zaidi",
  title =        "One step forward: Linking wireless self-organizing
                 network validation techniques with formal testing
                 approaches",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "2",
  pages =        "7:1--7:36",
  month =        jan,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1883612.1883614",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Jan 30 14:27:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Wireless self-organizing networks (WSONs) have
                 attracted considerable attention from the network
                 research community; however, the key for their success
                 is the rigorous validation of the properties of the
                 network protocols. Applications of risk or those
                 demanding precision (like alert-based systems) require
                 a rigorous and reliable validation of deployed network
                 protocols. While the main goal is to ensure the
                 reliability of the protocols, validation techniques
                 also allow the establishment of their correctness
                 regarding the related protocols' requirements.
                 Nevertheless, even if different communities have
                 carried out intensive research activities on the
                 validation domain, WSONs still raise new issues for and
                 challenging constraints to these communities.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Urdaneta:2011:SDS,
  author =       "Guido Urdaneta and Guillaume Pierre and Maarten {Van
                 Steen}",
  title =        "A survey of {DHT} security techniques",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "2",
  pages =        "8:1--8:49",
  month =        jan,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1883612.1883615",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Jan 30 14:27:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Peer-to-peer networks based on distributed hash tables
                 (DHTs) have received considerable attention ever since
                 their introduction in 2001. Unfortunately, DHT-based
                 systems have been shown to be notoriously difficult to
                 protect against security attacks. Various reports have
                 been published that discuss or classify general
                 security issues, but so far a comprehensive survey
                 describing the various proposed defenses has been
                 lacking. In this article, we present an overview of
                 techniques reported in the literature for making
                 DHT-based systems resistant to the three most important
                 attacks that can be launched by malicious nodes
                 participating in the DHT: (1) the Sybil attack, (2) the
                 Eclipse attack, and (3) routing and storage attacks.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Freiling:2011:FDA,
  author =       "Felix C. Freiling and Rachid Guerraoui and Petr
                 Kuznetsov",
  title =        "The failure detector abstraction",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "2",
  pages =        "9:1--9:40",
  month =        jan,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1883612.1883616",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Jan 30 14:27:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A failure detector is a fundamental abstraction in
                 distributed computing. This article surveys this
                 abstraction through two dimensions. First we study
                 failure detectors as building blocks to simplify the
                 design of reliable distributed algorithms. In
                 particular, we illustrate how failure detectors can
                 factor out timing assumptions to detect failures in
                 distributed agreement algorithms. Second, we study
                 failure detectors as computability benchmarks. That is,
                 we survey the weakest failure detector question and
                 illustrate how failure detectors can be used to
                 classify problems. We also highlight some limitations
                 of the failure detector abstraction along each of the
                 dimensions.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Parsons:2011:ABG,
  author =       "Simon Parsons and Juan A. Rodriguez-Aguilar and Mark
                 Klein",
  title =        "Auctions and bidding: a guide for computer
                 scientists",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "2",
  pages =        "10:1--10:59",
  month =        jan,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1883612.1883617",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Jan 30 14:27:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "There is a veritable menagerie of
                 auctions---single-dimensional, multi-dimensional,
                 single-sided, double-sided, first-price, second-price,
                 English, Dutch, Japanese, sealed-bid---and these have
                 been extensively discussed and analyzed in the
                 economics literature. The main purpose of this article
                 is to survey this literature from a computer science
                 perspective, primarily from the viewpoint of computer
                 scientists who are interested in learning about auction
                 theory, and to provide pointers into the economics
                 literature for those who want a deeper technical
                 understanding. In addition, since auctions are an
                 increasingly important topic in computer science, we
                 also look at work on auctions from the computer science
                 literature.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nie:2011:SCT,
  author =       "Changhai Nie and Hareton Leung",
  title =        "A survey of combinatorial testing",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "2",
  pages =        "11:1--11:29",
  month =        jan,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1883612.1883618",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Jan 30 14:27:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Combinatorial Testing (CT) can detect failures
                 triggered by interactions of parameters in the Software
                 Under Test (SUT) with a covering array test suite
                 generated by some sampling mechanisms. It has been an
                 active field of research in the last twenty years. This
                 article aims to review previous work on CT, highlights
                 the evolution of CT, and identifies important issues,
                 methods, and applications of CT, with the goal of
                 supporting and directing future practice and research
                 in this area. First, we present the basic concepts and
                 notations of CT. Second, we classify the research on CT
                 into the following categories: modeling for CT, test
                 suite generation, constraints, failure diagnosis,
                 prioritization, metric, evaluation, testing procedure
                 and the application of CT.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jie:2011:RGA,
  author =       "Wei Jie and Junaid Arshad and Richard Sinnott and Paul
                 Townend and Zhou Lei",
  title =        "A review of grid authentication and authorization
                 technologies and support for federated access control",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "2",
  pages =        "12:1--12:26",
  month =        jan,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1883612.1883619",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Jan 30 14:27:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Grid computing facilitates resource sharing typically
                 to support distributed virtual organizations (VO). The
                 multi-institutional nature of a grid environment
                 introduces challenging security issues, especially with
                 regard to authentication and authorization. This
                 article presents a state-of-the-art review of major
                 grid authentication and authorization technologies. In
                 particular we focus upon the Internet2 Shibboleth
                 technologies and their use to support federated
                 authentication and authorization to support
                 interinstitutional sharing of remote grid resources
                 that are subject to access control. We outline the
                 architecture, features, advantages, limitations,
                 projects, and applications of Shibboleth in a grid
                 environment.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Magnien:2011:IRF,
  author =       "Cl{\'e}mence Magnien and Matthieu Latapy and Jean-Loup
                 Guillaume",
  title =        "Impact of random failures and attacks on {Poisson} and
                 power-law random networks",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "3",
  pages =        "13:1--13:31",
  month =        apr,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1922649.1922650",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 27 07:58:39 MDT 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "It has appeared recently that the underlying degree
                 distribution of networks may play a crucial role
                 concerning their robustness. Previous work insisted on
                 the fact that power-law degree distributions induce
                 high resilience to random failures but high sensitivity
                 to attack strategies, while Poisson degree
                 distributions are quite sensitive in both cases. Then
                 much work has been done to extend these results. We aim
                 here at studying in depth these results, their origin,
                 and limitations. We review in detail previous
                 contributions in a unified framework, and identify the
                 approximations on which these results rely. We then
                 present new results aimed at clarifying some important
                 aspects.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Beatty:2011:CTC,
  author =       "Patricia Beatty and Ian Reay and Scott Dick and James
                 Miller",
  title =        "Consumer trust in e-commerce {Web} sites: a
                 meta-study",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "3",
  pages =        "14:1--14:46",
  month =        apr,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1922649.1922651",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 27 07:58:39 MDT 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Trust is at once an elusive, imprecise concept, and a
                 critical attribute that must be engineered into
                 e-commerce systems. Trust conveys a vast number of
                 meanings, and is deeply dependent upon context. The
                 literature on engineering trust into e-commerce systems
                 reflects these ambiguous meanings; there are a large
                 number of articles, but there is as yet no clear
                 theoretical framework for the investigation of trust in
                 e-commerce. E-commerce, however, is predicated on
                 trust; indeed, any e-commerce vendor that fails to
                 establish a trusting relationship with their customers
                 is doomed. There is a very clear need for specific
                 guidance on e-commerce system attributes and business
                 operations that will effectively promote consumer
                 trust.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mcgill:2011:RAL,
  author =       "Kathleen Mcgill and Stephen Taylor",
  title =        "Robot algorithms for localization of multiple emission
                 sources",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "3",
  pages =        "15:1--15:25",
  month =        apr,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1922649.1922652",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 27 07:58:39 MDT 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The problem of time-varying, multisource localization
                 using robotic swarms has received relatively little
                 attention when compared to single-source localization.
                 It involves distinct challenges regarding how to
                 partition the robots during search to ensure that all
                 sources are located in minimal time, how to avoid
                 obstacles and other robots, and how to proceed after
                 each source is found. Unfortunately, no common set of
                 validation problems and reference algorithms has
                 evolved, and there are no general theoretical
                 foundations that guarantee progress, convergence, and
                 termination. This article surveys the current
                 multisource literature from the viewpoint of these
                 central questions.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Aggarwal:2011:HAA,
  author =       "J. K. Aggarwal and M. S. Ryoo",
  title =        "Human activity analysis: a review",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "3",
  pages =        "16:1--16:43",
  month =        apr,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1922649.1922653",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 27 07:58:39 MDT 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Human activity recognition is an important area of
                 computer vision research. Its applications include
                 surveillance systems, patient monitoring systems, and a
                 variety of systems that involve interactions between
                 persons and electronic devices such as human-computer
                 interfaces. Most of these applications require an
                 automated recognition of high-level activities,
                 composed of multiple simple (or atomic) actions of
                 persons. This article provides a detailed overview of
                 various state-of-the-art research papers on human
                 activity recognition. We discuss both the methodologies
                 developed for simple human actions and those for
                 high-level activities. An approach-based taxonomy is
                 chosen that compares the advantages and limitations of
                 each approach. Recognition methodologies for an
                 analysis of the simple actions of a single person are
                 first presented in the article.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Karimi:2011:MTS,
  author =       "Sarvnaz Karimi and Falk Scholer and Andrew Turpin",
  title =        "Machine transliteration survey",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "3",
  pages =        "17:1--17:46",
  month =        apr,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1922649.1922654",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 27 07:58:39 MDT 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Machine transliteration is the process of
                 automatically transforming the script of a word from a
                 source language to a target language, while preserving
                 pronunciation. The development of algorithms
                 specifically for machine transliteration began over a
                 decade ago based on the phonetics of source and target
                 languages, followed by approaches using statistical and
                 language-specific methods. In this survey, we review
                 the key methodologies introduced in the transliteration
                 literature. The approaches are categorized based on the
                 resources and algorithms used, and the effectiveness is
                 compared.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ducournau:2011:IST,
  author =       "Roland Ducournau",
  title =        "Implementing statically typed object-oriented
                 programming languages",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "3",
  pages =        "18:1--18:48",
  month =        apr,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1922649.1922655",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 27 07:58:39 MDT 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Object-oriented programming represents an original
                 implementation issue due to its philosophy of making
                 the program behavior depend on the dynamic type of
                 objects. This is expressed by the late binding
                 mechanism, aka message sending. The underlying
                 principle is that the address of the actually called
                 procedure is not statically determined at compile-time,
                 but depends on the dynamic type of a distinguished
                 parameter known as the receiver. A similar issue arises
                 with attributes, because their position in the object
                 layout may also depend on the object's dynamic type.
                 Furthermore, subtyping introduces another original
                 feature (i.e., runtime subtype checks). All three
                 mechanisms need specific implementations and data
                 structures.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mottola:2011:PWS,
  author =       "Luca Mottola and Gian Pietro Picco",
  title =        "Programming wireless sensor networks: Fundamental
                 concepts and state of the art",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "3",
  pages =        "19:1--19:51",
  month =        apr,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1922649.1922656",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 27 07:58:39 MDT 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Wireless sensor networks (WSNs) are attracting great
                 interest in a number of application domains concerned
                 with monitoring and control of physical phenomena, as
                 they enable dense and untethered deployments at low
                 cost and with unprecedented flexibility. However,
                 application development is still one of the main
                 hurdles to a wide adoption of WSN technology. In
                 current real-world WSN deployments, programming is
                 typically carried out very close to the operating
                 system, therefore requiring the programmer to focus on
                 low-level system issues. This not only distracts the
                 programmer from the application logic, but also
                 requires a technical background rarely found among
                 application domain experts.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{VanBakel:2011:SIT,
  author =       "Steffen {Van Bakel}",
  title =        "Strict intersection types for the {Lambda Calculus}",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "3",
  pages =        "20:1--20:49",
  month =        apr,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1922649.1922657",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 27 07:58:39 MDT 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article will show the usefulness and elegance of
                 strict intersection types for the Lambda Calculus, that
                 are strict in the sense that they are the
                 representatives of equivalence classes of types in the
                 BCD-system [Barendregt et al. 1983]. We will focus on
                 the essential intersection type assignment; this system
                 is almost syntax directed, and we will show that all
                 major properties hold that are known to hold for other
                 intersection systems, like the approximation theorem,
                 the characterization of (head/strong) normalization,
                 completeness of type assignment using filter semantics,
                 strong normalization for cut-elimination and the
                 principal pair property.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ko:2011:SAE,
  author =       "Andrew J. Ko and Robin Abraham and Laura Beckwith and
                 Alan Blackwell and Margaret Burnett and Martin Erwig
                 and Chris Scaffidi and Joseph Lawrance and Henry
                 Lieberman and Brad Myers and Mary Beth Rosson and Gregg
                 Rothermel and Mary Shaw and Susan Wiedenbeck",
  title =        "The state of the art in end-user software
                 engineering",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "3",
  pages =        "21:1--21:44",
  month =        apr,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1922649.1922658",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 27 07:58:39 MDT 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Most programs today are written not by professional
                 software developers, but by people with expertise in
                 other domains working towards goals for which they need
                 computational support. For example, a teacher might
                 write a grading spreadsheet to save time grading, or an
                 interaction designer might use an interface builder to
                 test some user interface design ideas. Although these
                 end-user programmers may not have the same goals as
                 professional developers, they do face many of the same
                 software engineering challenges, including
                 understanding their requirements, as well as making
                 decisions about design, reuse, integration, testing,
                 and debugging. This article summarizes and classifies
                 research on these activities, defining the area of
                 End-User Software Engineering (EUSE) and related
                 terminology.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Duarte:2011:SCB,
  author =       "Elias P. {Duarte, Jr.} and Roverli P. Ziwich and Luiz
                 C. P. Albini",
  title =        "A survey of comparison-based system-level diagnosis",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "3",
  pages =        "22:1--22:56",
  month =        apr,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1922649.1922659",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 27 07:58:39 MDT 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The growing complexity and dependability requirements
                 of hardware, software, and networks demand efficient
                 techniques for discovering disruptive behavior in those
                 systems. Comparison-based diagnosis is a realistic
                 approach to detect faulty units based on the outputs of
                 tasks executed by system units. This survey integrates
                 the vast amount of research efforts that have been
                 produced in this field, from the earliest theoretical
                 models to new promising applications. Key results also
                 include the quantitative evaluation of a relevant
                 reliability metric---the diagnosability---of several
                 popular interconnection network topologies. Relevant
                 diagnosis algorithms are also described.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Deng:2011:WFD,
  author =       "Yuhui Deng",
  title =        "What is the future of disk drives, death or rebirth?",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "3",
  pages =        "23:1--23:27",
  month =        apr,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1922649.1922660",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Apr 27 07:58:39 MDT 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Disk drives have experienced dramatic development to
                 meet performance requirements since the IBM 1301 disk
                 drive was announced in 1961. However, the performance
                 gap between memory and disk drives has widened to 6
                 orders of magnitude and continues to widen by about
                 50\% per year. Furthermore, energy efficiency has
                 become one of the most important challenges in
                 designing disk drive storage systems. The architectural
                 design of disk drives has reached a turning point which
                 should allow their performance to advance further,
                 while still maintaining high reliability and energy
                 efficiency. This article explains how disk drives have
                 evolved over five decades to meet challenging customer
                 demands.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{McLeod:2011:FAS,
  author =       "Laurie McLeod and Stephen G. MacDonell",
  title =        "Factors that affect software systems development
                 project outcomes: a survey of research",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "24:1--24:56",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978803",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Determining the factors that have an influence on
                 software systems development and deployment project
                 outcomes has been the focus of extensive and ongoing
                 research for more than 30 years. We provide here a
                 survey of the research literature that has addressed
                 this topic in the period 1996--2006, with a particular
                 focus on empirical analyses. On the basis of this
                 survey we present a new classification framework that
                 represents an abstracted and synthesized view of the
                 types of factors that have been asserted as influencing
                 project outcomes.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Algergawy:2011:XDC,
  author =       "Alsayed Algergawy and Marco Mesiti and Richi Nayak and
                 Gunter Saake",
  title =        "{XML} data clustering: an overview",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "25:1--25:41",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978804",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the last few years we have observed a proliferation
                 of approaches for clustering XML documents and schemas
                 based on their structure and content. The presence of
                 such a huge amount of approaches is due to the
                 different applications requiring the clustering of XML
                 data. These applications need data in the form of
                 similar contents, tags, paths, structures, and
                 semantics. In this article, we first outline the
                 application contexts in which clustering is useful,
                 then we survey approaches so far proposed relying on
                 the abstract representation of data (instances or
                 schema), on the identified similarity measure, and on
                 the clustering algorithm.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rocha:2011:VUC,
  author =       "Anderson Rocha and Walter Scheirer and Terrance Boult
                 and Siome Goldenstein",
  title =        "Vision of the unseen: {Current} trends and challenges
                 in digital image and video forensics",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "26:1--26:42",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978805",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Digital images are everywhere---from our cell phones
                 to the pages of our online news sites. How we choose to
                 use digital image processing raises a surprising host
                 of legal and ethical questions that we must address.
                 What are the ramifications of hiding data within an
                 innocent image? Is this an intentional security
                 practice when used legitimately, or intentional
                 deception? Is tampering with an image appropriate in
                 cases where the image might affect public behavior?
                 Does an image represent a crime, or is it simply a
                 representation of a scene that has never existed?
                 Before action can even be taken on the basis of a
                 questionable image, we must detect something about the
                 image itself.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Damas:2011:FIC,
  author =       "Sergio Damas and Oscar Cord{\'o}n and Oscar
                 Ib{\'a}{\~n}ez and Jose Santamar{\'\i}a and Inmaculada
                 Alem{\'a}n and Miguel Botella and Fernando Navarro",
  title =        "Forensic identification by computer-aided craniofacial
                 superimposition: a survey",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "27:1--27:27",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978806",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Craniofacial superimposition is a forensic process in
                 which a photograph of a missing person is compared with
                 a skull found to determine its identity. After one
                 century of development, craniofacial superimposition
                 has become an interdisciplinary research field where
                 computer sciences have acquired a key role as a
                 complement of forensic sciences. Moreover, the
                 availability of new digital equipment (such as
                 computers and 3D scanners) has resulted in a
                 significant advance in the applicability of this
                 forensic identification technique. The purpose of this
                 contribution is twofold. On the one hand, we aim to
                 clearly define the different stages involved in the
                 computer-aided craniofacial superimposition process.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wimmer:2011:SUB,
  author =       "Manuel Wimmer and Andrea Schauerhuber and Gerti Kappel
                 and Werner Retschitzegger and Wieland Schwinger and
                 Elizabeth Kapsammer",
  title =        "A survey on {UML}-based aspect-oriented design
                 modeling",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "28:1--28:33",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978807",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Aspect-orientation provides a new way of
                 modularization by clearly separating crosscutting
                 concerns from noncrosscutting ones. While
                 aspect-orientation originally has emerged at the
                 programming level, it now stretches also over other
                 development phases. There are, for example, already
                 several proposals for Aspect-Oriented Modeling (AOM),
                 most of them pursuing distinguished goals, providing
                 different concepts as well as notations, and showing
                 various levels of maturity. Consequently, there is an
                 urgent need to provide an in-depth survey, clearly
                 identifying commonalities and differences between
                 current AOM approaches. Existing surveys in this area
                 focus more on comprehensibility with respect to
                 development phases or evaluated approaches rather than
                 on comparability on bases of a detailed evaluation
                 framework.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sohel:2011:GDM,
  author =       "Ferdous A. Sohel and Gour C. Karmakar and Laurence S.
                 Dooley and Mohammed Bennamoun",
  title =        "Geometric distortion measurement for shape coding: a
                 contemporary review",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "29:1--29:22",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978808",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Geometric distortion measurement and the associated
                 metrics involved are integral to the Rate Distortion
                 (RD) shape coding framework, with importantly the
                 efficacy of the metrics being strongly influenced by
                 the underlying measurement strategy. This has been the
                 catalyst for many different techniques with this
                 article presenting a comprehensive review of geometric
                 distortion measurement, the diverse metrics applied,
                 and their impact on shape coding. The respective
                 performance of these measuring strategies is analyzed
                 from both a RD and complexity perspective, with a
                 recent distortion measurement technique based on
                 arc-length-parameterization being comparatively
                 evaluated.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Anders:2011:CPS,
  author =       "Torsten Anders and Eduardo R. Miranda",
  title =        "Constraint programming systems for modeling music
                 theories and composition",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "30:1--30:38",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978809",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Constraint programming is well suited for the
                 computational modeling of music theories and
                 composition: its declarative and modular approach
                 shares similarities with the way music theory is
                 traditionally expressed, namely by a set of rules which
                 describe the intended result. Various music theory
                 disciplines have been modeled, including counterpoint,
                 harmony, rhythm, form, and instrumentation. Because
                 modeling music theories ``from scratch'' is a complex
                 task, generic music constraint programming systems have
                 been proposed that predefine the required building
                 blocks for modeling a range of music theories.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Parris:2011:PAF,
  author =       "Matthew G. Parris and Carthik A. Sharma and Ronald F.
                 Demara",
  title =        "Progress in autonomous fault recovery of field
                 programmable gate arrays",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "31:1--31:30",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978810",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The capabilities of current fault-handling techniques
                 for Field Programmable Gate Arrays (FPGAs) develop a
                 descriptive classification ranging from simple passive
                 techniques to robust dynamic methods. Fault-handling
                 methods not requiring modification of the FPGA device
                 architecture or user intervention to recover from
                 faults are examined and evaluated against
                 overhead-based and sustainability-based performance
                 metrics such as additional resource requirements,
                 throughput reduction, fault capacity, and fault
                 coverage. This classification alongside these
                 performance metrics forms a standard for confident
                 comparisons.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wang:2011:CPS,
  author =       "Bang Wang",
  title =        "Coverage problems in sensor networks: a survey",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "32:1--32:53",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978811",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Sensor networks, which consist of sensor nodes each
                 capable of sensing environment and transmitting data,
                 have lots of applications in battlefield surveillance,
                 environmental monitoring, industrial diagnostics, etc.
                 Coverage which is one of the most important performance
                 metrics for sensor networks reflects how well a sensor
                 field is monitored. Individual sensor coverage models
                 are dependent on the sensing functions of different
                 types of sensors, while network-wide sensing coverage
                 is a collective performance measure for geographically
                 distributed sensor nodes. This article surveys research
                 progress made to address various coverage problems in
                 sensor networks. We first provide discussions on sensor
                 coverage models and design issues.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Falessi:2011:DMT,
  author =       "Davide Falessi and Giovanni Cantone and Rick Kazman
                 and Philippe Kruchten",
  title =        "Decision-making techniques for software architecture
                 design: a comparative survey",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "33:1--33:28",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978812",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The architecture of a software-intensive system can be
                 defined as the set of relevant design decisions that
                 affect the qualities of the overall system
                 functionality; therefore, architectural decisions are
                 eventually crucial to the success of a software
                 project. The software engineering literature describes
                 several techniques to choose among architectural
                 alternatives, but it gives no clear guidance on which
                 technique is more suitable than another, and in which
                 circumstances. As such, there is no systematic way for
                 software engineers to choose among decision-making
                 techniques for resolving tradeoffs in architecture
                 design. In this article, we provide a comparison of
                 existing decision-making techniques, aimed to guide
                 architects in their selection.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Skopal:2011:NSS,
  author =       "Tom{\'a}{\v{s}} Skopal and Benjamin Bustos",
  title =        "On nonmetric similarity search problems in complex
                 domains",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "34:1--34:50",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978813",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The task of similarity search is widely used in
                 various areas of computing, including multimedia
                 databases, data mining, bioinformatics, social
                 networks, etc. In fact, retrieval of semantically
                 unstructured data entities requires a form of
                 aggregated qualification that selects entities relevant
                 to a query. A popular type of such a mechanism is
                 similarity querying. For a long time, the
                 database-oriented applications of similarity search
                 employed the definition of similarity restricted to
                 metric distances. Due to its topological properties,
                 metric similarity can be effectively used to index a
                 database which can then be queried efficiently by
                 so-called metric access methods. However, together with
                 the increasing complexity of data entities across
                 various domains, in recent years there appeared many
                 similarities that were not metrics---we call them
                 nonmetric similarity functions.",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Davis:2011:SHR,
  author =       "Robert I. Davis and Alan Burns",
  title =        "A survey of hard real-time scheduling for
                 multiprocessor systems",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "35:1--35:44",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978814",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This survey covers hard real-time scheduling
                 algorithms and schedulability analysis techniques for
                 homogeneous multiprocessor systems. It reviews the key
                 results in this field from its origins in the late
                 1960s to the latest research published in late 2009.
                 The survey outlines fundamental results about
                 multiprocessor real-time scheduling that hold
                 independent of the scheduling algorithms employed. It
                 provides a taxonomy of the different scheduling
                 methods, and considers the various performance metrics
                 that can be used for comparison purposes. A detailed
                 review is provided covering partitioned, global, and
                 hybrid scheduling algorithms, approaches to resource
                 sharing, and the latest results from empirical
                 investigations.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sadri:2011:AIS,
  author =       "Fariba Sadri",
  title =        "Ambient intelligence: a survey",
  journal =      j-COMP-SURV,
  volume =       "43",
  number =       "4",
  pages =        "36:1--36:66",
  month =        oct,
  year =         "2011",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1978802.1978815",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 12 09:59:08 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In this article we survey ambient intelligence (AmI),
                 including its applications, some of the technologies it
                 uses, and its social and ethical implications. The
                 applications include AmI at home, care of the elderly,
                 healthcare, commerce, and business, recommender
                 systems, museums and tourist scenarios, and group
                 decision making. Among technologies, we focus on
                 ambient data management and artificial intelligence;
                 for example planning, learning, event-condition-action
                 rules, temporal reasoning, and agent-oriented
                 technologies. The survey is not intended to be
                 exhaustive, but to convey a broad range of
                 applications, technologies, and technical, social, and
                 ethical challenges.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Carpineto:2012:SAQ,
  author =       "Claudio Carpineto and Giovanni Romano",
  title =        "A Survey of Automatic Query Expansion in Information
                 Retrieval",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "1",
  pages =        "1:1--1:50",
  month =        jan,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2071389.2071390",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Jan 31 06:44:41 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The relative ineffectiveness of information retrieval
                 systems is largely caused by the inaccuracy with which
                 a query formed by a few keywords models the actual user
                 information need. One well known method to overcome
                 this limitation is automatic query expansion (AQE),
                 whereby the user's original query is augmented by new
                 features with a similar meaning. AQE has a long history
                 in the information retrieval community but it is only
                 in the last years that it has reached a level of
                 scientific and experimental maturity, especially in
                 laboratory settings such as TREC. This survey presents
                 a unified view of a large number of recent approaches
                 to AQE that leverage various data sources and employ
                 very different principles and techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhang:2012:CSP,
  author =       "David Zhang and Wangmeng Zuo and Feng Yue",
  title =        "A Comparative Study of Palmprint Recognition
                 Algorithms",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "1",
  pages =        "2:1--2:37",
  month =        jan,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2071389.2071391",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Jan 31 06:44:41 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Palmprint images contain rich unique features for
                 reliable human identification, which makes it a very
                 competitive topic in biometric research. A great many
                 different low resolution palmprint recognition
                 algorithms have been developed, which can be roughly
                 grouped into three categories: holistic-based,
                 feature-based, and hybrid methods. The purpose of this
                 article is to provide an updated survey of palmprint
                 recognition methods, and present a comparative study to
                 evaluate the performance of the state-of-the-art
                 palmprint recognition methods. Using the Hong Kong
                 Polytechnic University (HKPU) palmprint database
                 (version 2), we compare the recognition performance of
                 a number of holistic-based (Fisherpalms and DCT+LDA)
                 and local feature-based (competitive code, ordinal
                 code, robust line orientation code, derivative of
                 Gaussian code, and wide line detector) methods, and
                 then investigate the error correlation and score-level
                 fusion performance of different algorithms.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nielson:2012:FLP,
  author =       "Hanne Riis Nielson and Flemming Nielson and Henrik
                 Pilegaard",
  title =        "{Flow Logic} for Process Calculi",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "1",
  pages =        "3:1--3:39",
  month =        jan,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2071389.2071392",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Jan 31 06:44:41 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Flow Logic is an approach to statically determining
                 the behavior of programs and processes. It borrows
                 methods and techniques from Abstract Interpretation,
                 Data Flow Analysis and Constraint Based Analysis while
                 presenting the analysis in a style more reminiscent of
                 Type Systems. Traditionally developed for programming
                 languages, this article provides a tutorial development
                 of the approach of Flow Logic for process calculi based
                 on a decade of research. We first develop a simple
                 analysis for the $ \pi $-calculus; this consists of the
                 specification, semantic soundness (in the form of
                 subject reduction and adequacy results), and a Moore
                 Family result showing that a least solution always
                 exists, as well as providing insights on how to
                 implement the analysis.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Song:2012:SPT,
  author =       "Songbo Song and Hassnaa Moustafa and Hossam Afifi",
  title =        "A Survey on Personalized {TV} and {NGN} Services
                 through Context-Awareness",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "1",
  pages =        "4:1--4:18",
  month =        jan,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2071389.2071393",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Jan 31 06:44:41 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The advances in IPTV (Internet Protocol Television)
                 technology enable a new user-centric and interactive TV
                 model, in which context-awareness is promising in
                 making the user's interaction with the TV dynamic and
                 transparent. Our research interest is how to achieve TV
                 service personalization applying context-awareness to
                 the NGN IPTV architecture. In this article we present
                 the different existing contributions that employ
                 context-awareness to allow interactive services. Some
                 of these contributions directly focus on TV, while
                 others are proposed for specific NGN services. We
                 present a technical analysis for these solutions and
                 give some guidelines for future deployment of
                 personalized IPTV services.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wojcik:2012:FOA,
  author =       "Robert W{\'o}jcik and Andrzej Jajszczyk",
  title =        "Flow Oriented Approaches to {QoS} Assurance",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "1",
  pages =        "5:1--5:37",
  month =        jan,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2071389.2071394",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Jan 31 06:44:41 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The following flow-oriented architectures for quality
                 of service assurance in IP networks are surveyed:
                 Integrated Services, Connectionless Approach to QoS
                 guarantees, Dynamic Packet State, Caspian Networks and
                 Anagran, the Feedback and Distribution method,
                 Flow-Based Differentiated Services, Flow-Aware
                 Networking, the Flow-State-Aware transport, and
                 Flow-Aggregate-Based services. The reasons why
                 flow-awareness attracted so much attention are
                 explained, and the current studies as well as the
                 development history of the solutions are presented. The
                 following features of the discussed architectures are
                 compared: flow definition, classes of service,
                 architecture, and signaling. Also, their pros and cons,
                 complexity, and scalability, as well as perspectives
                 are assessed.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Egele:2012:SAD,
  author =       "Manuel Egele and Theodoor Scholte and Engin Kirda and
                 Christopher Kruegel",
  title =        "A survey on automated dynamic malware-analysis
                 techniques and tools",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "2",
  pages =        "6:1--6:42",
  month =        feb,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2089125.2089126",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 28 16:26:04 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Anti-virus vendors are confronted with a multitude of
                 potentially malicious samples today. Receiving
                 thousands of new samples every day is not uncommon. The
                 signatures that detect confirmed malicious threats are
                 mainly still created manually, so it is important to
                 discriminate between samples that pose a new unknown
                 threat and those that are mere variants of known
                 malware. This survey article provides an overview of
                 techniques based on dynamic analysis that are used to
                 analyze potentially malicious samples.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Crowston:2012:FLO,
  author =       "Kevin Crowston and Kangning Wei and James Howison and
                 Andrea Wiggins",
  title =        "{Free\slash} Libre open-source software development:
                 {What} we know and what we do not know",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "2",
  pages =        "7:1--7:35",
  month =        feb,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2089125.2089127",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 28 16:26:04 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/gnu.bib",
  abstract =     "We review the empirical research on Free/Libre and
                 Open-Source Software (FLOSS) development and assess the
                 state of the literature. We develop a framework for
                 organizing the literature based on the
                 input-mediator-output-input (IMOI) model from the small
                 groups literature. We present a quantitative summary of
                 articles selected for the review and then discuss
                 findings of this literature categorized into issues
                 pertaining to inputs (e.g., member characteristics,
                 technology use, and project characteristics), processes
                 (software development practices, social processes, and
                 firm involvement practices), emergent states (e.g.,
                 social states and task-related states), and outputs
                 (e.g. team performance, FLOSS implementation, and
                 project evolution).",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Antunes:2012:SDC,
  author =       "Pedro Antunes and Valeria Herskovic and Sergio F.
                 Ochoa and Jose A. Pino",
  title =        "Structuring dimensions for collaborative systems
                 evaluation",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "2",
  pages =        "8:1--8:28",
  month =        feb,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2089125.2089128",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 28 16:26:04 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Collaborative systems evaluation is always necessary
                 to determine the impact a solution will have on the
                 individuals, groups, and the organization. Several
                 methods of evaluation have been proposed. These methods
                 comprise a variety of approaches with various goals.
                 Thus, the need for a strategy to select the most
                 appropriate method for a specific case is clear. This
                 research work presents a detailed framework to evaluate
                 collaborative systems according to given variables and
                 performance levels. The proposal assumes that
                 evaluation is an evolving process during the system
                 lifecycle.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Caruana:2012:SEA,
  author =       "Godwin Caruana and Maozhen Li",
  title =        "A survey of emerging approaches to spam filtering",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "2",
  pages =        "9:1--9:27",
  month =        feb,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2089125.2089129",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 28 16:26:04 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "From just an annoying characteristic of the electronic
                 mail epoch, spam has evolved into an expensive resource
                 and time-consuming problem. In this survey, we focus on
                 emerging approaches to spam filtering built on recent
                 developments in computing technologies. These include
                 peer-to-peer computing, grid computing, semantic Web,
                 and social networks. We also address a number of
                 perspectives related to personalization and privacy in
                 spam filtering. We conclude that, while important
                 advancements have been made in spam filtering in recent
                 years, high performance approaches remain to be
                 explored due to the large scale of the problem.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Midtgaard:2012:CFA,
  author =       "Jan Midtgaard",
  title =        "Control-flow analysis of functional programs",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "3",
  pages =        "10:1--10:33",
  month =        jun,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2187671.2187672",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 13 16:57:49 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We present a survey of control-flow analysis of
                 functional programs, which has been the subject of
                 extensive investigation throughout the past 30 years.
                 Analyses of the control flow of functional programs
                 have been formulated in multiple settings and have led
                 to many different approximations, starting with the
                 seminal works of Jones, Shivers, and Sestoft. In this
                 article, we survey control-flow analysis of functional
                 programs by structuring the multitude of formulations
                 and approximations and comparing them.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shahriar:2012:MPS,
  author =       "Hossain Shahriar and Mohammad Zulkernine",
  title =        "Mitigating program security vulnerabilities:
                 {Approaches} and challenges",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "3",
  pages =        "11:1--11:46",
  month =        jun,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2187671.2187673",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 13 16:57:49 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Programs are implemented in a variety of languages and
                 contain serious vulnerabilities which might be
                 exploited to cause security breaches. These
                 vulnerabilities have been exploited in real life and
                 caused damages to related stakeholders such as program
                 users. As many security vulnerabilities belong to
                 program code, many techniques have been applied to
                 mitigate these vulnerabilities before program
                 deployment. Unfortunately, there is no comprehensive
                 comparative analysis of different vulnerability
                 mitigation works. As a result, there exists an obscure
                 mapping between the techniques, the addressed
                 vulnerabilities, and the limitations of different
                 approaches. This article attempts to address these
                 issues. The work extensively compares and contrasts the
                 existing program security vulnerability mitigation
                 techniques, namely testing, static analysis, and hybrid
                 analysis. We also discuss three other approaches
                 employed to mitigate the most common program security
                 vulnerabilities: secure programming, program
                 transformation, and patching. The survey provides a
                 comprehensive understanding of the current program
                 security vulnerability mitigation approaches and
                 challenges as well as their key characteristics and
                 limitations. Moreover, our discussion highlights the
                 open issues and future research directions in the area
                 of program security vulnerability mitigation.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Silva:2012:VPS,
  author =       "Josep Silva",
  title =        "A vocabulary of program slicing-based techniques",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "3",
  pages =        "12:1--12:41",
  month =        jun,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2187671.2187674",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 13 16:57:49 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article surveys previous work on program
                 slicing-based techniques. For each technique, we
                 describe its features, its main applications, and a
                 common example of slicing using such a technique. After
                 discussing each technique separately, all of them are
                 compared in order to clarify and establish the
                 relations between them. This comparison gives rise to a
                 classification of techniques which can help to guide
                 future research directions in this field.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kong:2012:RTM,
  author =       "Joonho Kong and Sung Woo Chung and Kevin Skadron",
  title =        "Recent thermal management techniques for
                 microprocessors",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "3",
  pages =        "13:1--13:42",
  month =        jun,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2187671.2187675",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 13 16:57:49 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Microprocessor design has recently encountered many
                 constraints such as power, energy, reliability, and
                 temperature. Among these challenging issues,
                 temperature-related issues have become especially
                 important within the past several years. We summarize
                 recent thermal management techniques for
                 microprocessors, focusing on those that affect or rely
                 on the microarchitecture. We categorize thermal
                 management techniques into six main categories:
                 temperature monitoring, microarchitectural techniques,
                 floorplanning, OS/compiler techniques, liquid cooling
                 techniques, and thermal reliability/security.
                 Temperature monitoring, a requirement for Dynamic
                 Thermal Management (DTM), includes temperature
                 estimation and sensor placement techniques for accurate
                 temperature measurement or estimation.
                 Microarchitectural techniques include both static and
                 dynamic thermal management techniques that control
                 hardware structures. Floorplanning covers a range of
                 thermal-aware floorplanning techniques for 2D and 3D
                 microprocessors. OS/compiler techniques include
                 thermal-aware task scheduling and instruction
                 scheduling techniques. Liquid cooling techniques are
                 higher-capacity alternatives to conventional air
                 cooling techniques. Thermal reliability/security issues
                 cover temperature-dependent reliability modeling,
                 Dynamic Reliability Management (DRM), and malicious
                 codes that specifically cause overheating.
                 Temperature-related issues will only become more
                 challenging as process technology continues to evolve
                 and transistor densities scale up faster than power per
                 transistor scales down. The overall objective of this
                 survey is to give microprocessor designers a broad
                 perspective on various aspects of designing
                 thermal-aware microprocessors and to guide future
                 thermal management studies.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Islam:2012:RRA,
  author =       "Syed M. S. Islam and Mohammed Bennamoun and Robyn A.
                 Owens and Rowan Davies",
  title =        "A review of recent advances in {$3$D} ear- and
                 expression-invariant face biometrics",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "3",
  pages =        "14:1--14:34",
  month =        jun,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2187671.2187676",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 13 16:57:49 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Biometric-based human recognition is rapidly gaining
                 popularity due to breaches of traditional security
                 systems and the lowering cost of sensors. The current
                 research trend is to use 3D data and to combine
                 multiple traits to improve accuracy and robustness.
                 This article comprehensively reviews unimodal and
                 multimodal recognition using 3D ear and face data. It
                 covers associated data collection, detection,
                 representation, and matching techniques and focuses on
                 the challenging problem of expression variations. All
                 the approaches are classified according to their
                 methodologies. Through the analysis of the scope and
                 limitations of these techniques, it is concluded that
                 further research should investigate fast and fully
                 automatic ear-face multimodal systems robust to
                 occlusions and deformations.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cugola:2012:PFI,
  author =       "Gianpaolo Cugola and Alessandro Margara",
  title =        "Processing flows of information: {From} data stream to
                 complex event processing",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "3",
  pages =        "15:1--15:62",
  month =        jun,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2187671.2187677",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 13 16:57:49 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A large number of distributed applications requires
                 continuous and timely processing of information as it
                 flows from the periphery to the center of the system.
                 Examples include intrusion detection systems which
                 analyze network traffic in real-time to identify
                 possible attacks; environmental monitoring applications
                 which process raw data coming from sensor networks to
                 identify critical situations; or applications
                 performing online analysis of stock prices to identify
                 trends and forecast future values. Traditional DBMSs,
                 which need to store and index data before processing
                 it, can hardly fulfill the requirements of timeliness
                 coming from such domains. Accordingly, during the last
                 decade, different research communities developed a
                 number of tools, which we collectively call Information
                 flow processing (IFP) systems, to support these
                 scenarios. They differ in their system architecture,
                 data model, rule model, and rule language. In this
                 article, we survey these systems to help researchers,
                 who often come from different backgrounds, in
                 understanding how the various approaches they adopt may
                 complement each other. In particular, we propose a
                 general, unifying model to capture the different
                 aspects of an IFP system and use it to provide a
                 complete and precise classification of the systems and
                 mechanisms proposed so far.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hatcliff:2012:BIS,
  author =       "John Hatcliff and Gary T. Leavens and K. Rustan M.
                 Leino and Peter M{\"u}ller and Matthew Parkinson",
  title =        "Behavioral interface specification languages",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "3",
  pages =        "16:1--16:58",
  month =        jun,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2187671.2187678",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 13 16:57:49 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Behavioral interface specification languages provide
                 formal code-level annotations, such as preconditions,
                 postconditions, invariants, and assertions that allow
                 programmers to express the intended behavior of program
                 modules. Such specifications are useful for precisely
                 documenting program behavior, for guiding
                 implementation, and for facilitating agreement between
                 teams of programmers in modular development of
                 software. When used in conjunction with automated
                 analysis and program verification tools, such
                 specifications can support detection of common code
                 vulnerabilities, capture of light-weight
                 application-specific semantic properties, generation of
                 test cases and test oracles, and full formal program
                 verification. This article surveys behavioral interface
                 specification languages with a focus toward automatic
                 program verification and with a view towards aiding the
                 Verified Software Initiative --- a fifteen-year,
                 cooperative, international project directed at the
                 scientific challenges of large-scale software
                 verification.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Younan:2012:RCC,
  author =       "Yves Younan and Wouter Joosen and Frank Piessens",
  title =        "Runtime countermeasures for code injection attacks
                 against {C} and {C++} programs",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "3",
  pages =        "17:1--17:28",
  month =        jun,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2187671.2187679",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 13 16:57:49 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The lack of memory safety in C/C++ often leads to
                 vulnerabilities. Code injection attacks exploit these
                 vulnerabilities to gain control over the execution flow
                 of applications. These attacks have played a key role
                 in many major security incidents. Consequently, a huge
                 body of research on countermeasures exists. We provide
                 a comprehensive and structured survey of
                 vulnerabilities and countermeasures that operate at
                 runtime. These countermeasures make different
                 trade-offs in terms of performance, effectivity,
                 compatibility, etc., making it hard to evaluate and
                 compare countermeasures in a given context. We define a
                 classification and evaluation framework on the basis of
                 which countermeasures can be assessed.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Budzisz:2012:TSS,
  author =       "Lukasz Budzisz and Johan Garcia and Anna Brunstrom and
                 Ramon Ferr{\'u}s",
  title =        "A taxonomy and survey of {SCTP} research",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "4",
  pages =        "18:1--18:36",
  month =        aug,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2333112.2333113",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Sep 6 09:45:45 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Stream Control Transmission Protocol (SCTP) is a
                 relatively recent general-purpose transport layer
                 protocol for IP networks that has been introduced as a
                 complement to the well-established TCP and UDP
                 transport protocols. Although initially conceived for
                 the transport of PSTN signaling messages over IP
                 networks, the introduction of key features in SCTP,
                 such as multihoming and multistreaming, has spurred
                 considerable research interest surrounding SCTP and its
                 applicability to different networking scenarios. This
                 article aims to provide a detailed survey of one of
                 these new features-multihoming-which, as it is shown,
                 is the subject of evaluation in more than half of all
                 published SCTP-related articles. To this end, the
                 article first summarizes and organizes SCTP-related
                 research conducted so far by developing a
                 four-dimensional taxonomy reflecting the (1) protocol
                 feature examined, (2) application area, (3) network
                 environment, and (4) study approach. Over 430
                 SCTP-related publications have been analyzed and
                 classified according to the proposed taxonomy. As a
                 result, a clear perspective on this research area in
                 the decade since the first protocol standardization in
                 2000 is given, covering both current and future
                 research trends. On continuation, a detailed survey of
                 the SCTP multihoming feature is provided, examining
                 possible applications of multihoming, such as
                 robustness, handover support, and loadsharing.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Biddle:2012:GPL,
  author =       "Robert Biddle and Sonia Chiasson and P. C. {Van
                 Oorschot}",
  title =        "Graphical passwords: {Learning} from the first twelve
                 years",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "4",
  pages =        "19:1--19:41",
  month =        aug,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2333112.2333114",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Sep 6 09:45:45 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Starting around 1999, a great many graphical password
                 schemes have been proposed as alternatives to
                 text-based password authentication. We provide a
                 comprehensive overview of published research in the
                 area, covering both usability and security aspects as
                 well as system evaluation. The article first catalogues
                 existing approaches, highlighting novel features of
                 selected schemes and identifying key usability or
                 security advantages. We then review usability
                 requirements for knowledge-based authentication as they
                 apply to graphical passwords, identify security threats
                 that such systems must address and review known
                 attacks, discuss methodological issues related to
                 empirical evaluation, and identify areas for further
                 research and improved methodology.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wong:2012:OLT,
  author =       "Wilson Wong and Wei Liu and Mohammed Bennamoun",
  title =        "Ontology learning from text: a look back and into the
                 future",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "4",
  pages =        "20:1--20:36",
  month =        aug,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2333112.2333115",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Sep 6 09:45:45 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Ontologies are often viewed as the answer to the need
                 for interoperable semantics in modern information
                 systems. The explosion of textual information on the
                 Read/Write Web coupled with the increasing demand for
                 ontologies to power the Semantic Web have made
                 (semi-)automatic ontology learning from text a very
                 promising research area. This together with the
                 advanced state in related areas, such as natural
                 language processing, have fueled research into ontology
                 learning over the past decade. This survey looks at how
                 far we have come since the turn of the millennium and
                 discusses the remaining challenges that will define the
                 research directions in this area in the near future.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Liu:2012:SSM,
  author =       "Huaiyu Liu and Mic Bowman and Francis Chang",
  title =        "Survey of state melding in virtual worlds",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "4",
  pages =        "21:1--21:25",
  month =        aug,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2333112.2333116",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Sep 6 09:45:45 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The fundamental goal of virtual worlds is to provide
                 users with the illusion that they are all seeing and
                 interacting with each other in a consistent world.
                 State melding is the core of creating this illusion of
                 a shared reality. It includes two major parts:
                 consistency maintenance and state update dissemination.
                 Well-designed state melding technologies are also
                 critical for developing a virtual world that can scale
                 to a large number of concurrent users and provide
                 satisfying user experiences. In this article, we
                 present a taxonomy of consistency models and
                 categorization of state update dissemination
                 technologies for virtual worlds. To connect theories
                 and practices, we then apply the taxonomy to case study
                 several state-of-the-art virtual worlds. We also
                 discuss challenges and promising solutions of state
                 melding in large-scale virtual worlds. This survey aims
                 to provide a thorough understanding of existing
                 approaches and their strength and limitations and to
                 assist in developing solutions to improve scalability
                 and performance of virtual worlds.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gonnet:2012:REE,
  author =       "Pedro Gonnet",
  title =        "A review of error estimation in adaptive quadrature",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "4",
  pages =        "22:1--22:36",
  month =        aug,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2333112.2333117",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Sep 6 09:45:45 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The most critical component of any adaptive numerical
                 quadrature routine is the estimation of the integration
                 error. Since the publication of the first algorithms in
                 the 1960s, many error estimation schemes have been
                 presented, evaluated, and discussed. This article
                 presents a review of existing error estimation
                 techniques and discusses their differences and their
                 common features. Some common shortcomings of these
                 algorithms are discussed, and a new general error
                 estimation technique is presented.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sengul:2012:SAS,
  author =       "Cigdem Sengul and Aline Carneiro Viana and Artur
                 Ziviani",
  title =        "A survey of adaptive services to cope with dynamics in
                 wireless self-organizing networks",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "4",
  pages =        "23:1--23:35",
  month =        aug,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2333112.2333118",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Sep 6 09:45:45 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In this article, we consider different types of
                 wireless networks that benefit from and, in certain
                 cases, require self-organization. Taking mobile ad hoc,
                 wireless sensor, wireless mesh, and delay-tolerant
                 networks as examples of wireless self-organizing
                 networks (WSONs), we identify that the common
                 challenges these networks face are mainly due to lack
                 of centralized management, device heterogeneity,
                 unreliable wireless communication, mobility, resource
                 constraints, or the need to support different traffic
                 types. In this context, we survey several adaptive
                 services proposed to handle these challenges. In
                 particular, we group the adaptive services as core
                 services and network-level services. By categorizing
                 different types of services that handle adaptation and
                 the types of adaptations, we intend to provide useful
                 design guidelines for achieving self-organizing
                 behavior in network protocols. Finally, we discuss open
                 research problems to encourage the design of novel
                 protocols for WSONs.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bellavista:2012:SCD,
  author =       "Paolo Bellavista and Antonio Corradi and Mario Fanelli
                 and Luca Foschini",
  title =        "A survey of context data distribution for mobile
                 ubiquitous systems",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "4",
  pages =        "24:1--24:45",
  month =        aug,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2333112.2333119",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Sep 6 09:45:45 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The capacity to gather and timely deliver to the
                 service level any relevant information that can
                 characterize the service-provisioning environment, such
                 as computing resources/capabilities, physical device
                 location, user preferences, and time constraints,
                 usually defined as context-awareness, is widely
                 recognized as a core function for the development of
                 modern ubiquitous and mobile systems. Much work has
                 been done to enable context-awareness and to ease the
                 diffusion of context-aware services; at the same time,
                 several middleware solutions have been designed to
                 transparently implement context management and
                 provisioning in the mobile system. However, to the best
                 of our knowledge, an in-depth analysis of the context
                 data distribution, namely, the function in charge of
                 distributing context data to interested entities, is
                 still missing. Starting from the core assumption that
                 only effective and efficient context data distribution
                 can pave the way to the deployment of truly
                 context-aware services, this article aims at putting
                 together current research efforts to derive an original
                 and holistic view of the existing literature. We
                 present a unified architectural model and a new
                 taxonomy for context data distribution by considering
                 and comparing a large number of solutions. Finally,
                 based on our analysis, we draw some of the research
                 challenges still unsolved and identify some possible
                 directions for future work.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wang:2012:ATS,
  author =       "Meng Wang and Bingbing Ni and Xian-Sheng Hua and
                 Tat-Seng Chua",
  title =        "Assistive tagging: a survey of multimedia tagging with
                 human-computer joint exploration",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "4",
  pages =        "25:1--25:24",
  month =        aug,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2333112.2333120",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Sep 6 09:45:45 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Along with the explosive growth of multimedia data,
                 automatic multimedia tagging has attracted great
                 interest of various research communities, such as
                 computer vision, multimedia, and information retrieval.
                 However, despite the great progress achieved in the
                 past two decades, automatic tagging technologies still
                 can hardly achieve satisfactory performance on
                 real-world multimedia data that vary widely in genre,
                 quality, and content. Meanwhile, the power of human
                 intelligence has been fully demonstrated in the Web 2.0
                 era. If well motivated, Internet users are able to tag
                 a large amount of multimedia data. Therefore, a set of
                 new techniques has been developed by combining humans
                 and computers for more accurate and efficient
                 multimedia tagging, such as batch tagging, active
                 tagging, tag recommendation, and tag refinement. These
                 techniques are able to accomplish multimedia tagging by
                 jointly exploring humans and computers in different
                 ways. This article refers to them collectively as
                 assistive tagging and conducts a comprehensive survey
                 of existing research efforts on this theme. We first
                 introduce the status of automatic tagging and manual
                 tagging and then state why assistive tagging can be a
                 good solution. We categorize existing assistive tagging
                 techniques into three paradigms: (1) tagging with data
                 selection {\&} organization; (2) tag recommendation;
                 and (3) tag processing. We introduce the research
                 efforts on each paradigm and summarize the
                 methodologies. We also provide a discussion on several
                 future trends in this research direction.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cittadini:2012:SIR,
  author =       "Luca Cittadini and Giuseppe {Di Battista} and Massimo
                 Rimondini",
  title =        "On the stability of interdomain routing",
  journal =      j-COMP-SURV,
  volume =       "44",
  number =       "4",
  pages =        "26:1--26:40",
  month =        aug,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2333112.2333121",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Sep 6 09:45:45 MDT 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Most routing protocols guarantee convergence to a
                 stable routing state. That is, in the absence of
                 topology or configuration changes, each router will
                 eventually find a stable route to any destination.
                 However, this is not the case for policy-based routing
                 protocols, for example, the BGP protocol used as a de
                 facto standard for interdomain routing. The interaction
                 of not-so-complex BGP configurations can cause
                 permanent oscillations of routing. Several models and
                 algorithms have been proposed in the literature to
                 study routing oscillations. This article surveys
                 state-of-the-art contributions in this field, with a
                 special emphasis on algorithmic and combinatorial
                 aspects.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhou:2012:TTC,
  author =       "Dong Zhou and Mark Truran and Tim Brailsford and
                 Vincent Wade and Helen Ashman",
  title =        "Translation techniques in cross-language information
                 retrieval",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "1:1--1:44",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379777",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cross-language information retrieval (CLIR) is an
                 active sub-domain of information retrieval (IR). Like
                 IR, CLIR is centered on the search for documents and
                 for information contained within those documents.
                 Unlike IR, CLIR must reconcile queries and documents
                 that are written in different languages. The usual
                 solution to this mismatch involves translating the
                 query and/or the documents before performing the
                 search. Translation is therefore a pivotal activity for
                 CLIR engines. Over the last 15 years, the CLIR
                 community has developed a wide range of techniques and
                 models supporting free text translation. This article
                 presents an overview of those techniques, with a
                 special emphasis on recent developments.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bernardi:2012:DMA,
  author =       "Simona Bernardi and Jos{\'e} Merseguer and Dorina C.
                 Petriu",
  title =        "Dependability modeling and analysis of software
                 systems specified with {UML}",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "2:1--2:48",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379778",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The goal is to survey dependability modeling and
                 analysis of software and systems specified with UML,
                 with focus on reliability, availability,
                 maintainability, and safety (RAMS). From the literature
                 published in the last decade, 33 approaches presented
                 in 43 papers were identified. They are evaluated
                 according to three sets of criteria regarding UML
                 modeling issues, addressed dependability
                 characteristics, and quality assessment of the surveyed
                 approaches. The survey shows that more works are
                 devoted to reliability and safety, fewer to
                 availability and maintainability, and none to
                 integrity. Many methods support early life-cycle phases
                 (from requirements to design). More research is needed
                 for tool development to automate the derivation of
                 analysis models and to give feedback to designers.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Avancha:2012:PMT,
  author =       "Sasikanth Avancha and Amit Baxi and David Kotz",
  title =        "Privacy in mobile technology for personal healthcare",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "3:1--3:54",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379779",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Information technology can improve the quality,
                 efficiency, and cost of healthcare. In this survey, we
                 examine the privacy requirements of mobile computing
                 technologies that have the potential to transform
                 healthcare. Such mHealth technology enables physicians
                 to remotely monitor patients' health and enables
                 individuals to manage their own health more easily.
                 Despite these advantages, privacy is essential for any
                 personal monitoring technology. Through an extensive
                 survey of the literature, we develop a conceptual
                 privacy framework for mHealth, itemize the privacy
                 properties needed in mHealth systems, and discuss the
                 technologies that could support privacy-sensitive
                 mHealth systems. We end with a list of open research
                 questions.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhuravlev:2012:SST,
  author =       "Sergey Zhuravlev and Juan Carlos Saez and Sergey
                 Blagodurov and Alexandra Fedorova and Manuel Prieto",
  title =        "Survey of scheduling techniques for addressing shared
                 resources in multicore processors",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "4:1--4:28",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379780",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Chip multicore processors (CMPs) have emerged as the
                 dominant architecture choice for modern computing
                 platforms and will most likely continue to be dominant
                 well into the foreseeable future. As with any system,
                 CMPs offer a unique set of challenges. Chief among them
                 is the shared resource contention that results because
                 CMP cores are not independent processors but rather
                 share common resources among cores such as the last
                 level cache (LLC). Shared resource contention can lead
                 to severe and unpredictable performance impact on the
                 threads running on the CMP. Conversely, CMPs offer
                 tremendous opportunities for multithreaded
                 applications, which can take advantage of simultaneous
                 thread execution as well as fast inter thread data
                 sharing. Many solutions have been proposed to deal with
                 the negative aspects of CMPs and take advantage of the
                 positive. This survey focuses on the subset of these
                 solutions that exclusively make use of OS thread-level
                 scheduling to achieve their goals. These solutions are
                 particularly attractive as they require no changes to
                 hardware and minimal or no changes to the OS. The OS
                 scheduler has expanded well beyond its original role of
                 time-multiplexing threads on a single core into a
                 complex and effective resource manager. This article
                 surveys a multitude of new and exciting work that
                 explores the diverse new roles the OS scheduler can
                 successfully take on.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Al-Hafeedh:2012:CIB,
  author =       "Anisa Al-Hafeedh and Maxime Crochemore and Lucian Ilie
                 and Evguenia Kopylova and W. F. Smyth and German
                 Tischler and Munina Yusufu",
  title =        "A comparison of index-based {Lempel--Ziv LZ77}
                 factorization algorithms",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "5:1--5:17",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379781",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
  abstract =     "Since 1977, when Lempel and Ziv described a kind of
                 string factorization useful for text compression, there
                 has been a succession of algorithms proposed for
                 computing ``LZ factorization''. In particular, there
                 have been several recent algorithms proposed that
                 extend the usefulness of LZ factorization, for example,
                 to the calculation of maximal repetitions. In this
                 article, we provide an overview of these new algorithms
                 and compare their efficiency in terms of their usage of
                 time and space.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Danev:2012:PLI,
  author =       "Boris Danev and Davide Zanetti and Srdjan Capkun",
  title =        "On physical-layer identification of wireless devices",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "6:1--6:29",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379782",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Physical-layer device identification aims at
                 identifying wireless devices during radio communication
                 by exploiting unique characteristics of their analog
                 (radio) circuitry. This work systematizes the existing
                 knowledge on this topic in order to enable a better
                 understanding of device identification, its
                 implications on the analysis and design of security
                 solutions in wireless networks and possible
                 applications. We therefore present a systematic review
                 of physical-layer identification systems and provide a
                 summary of current state-of-the-art techniques. We
                 further present a classification of attacks and discuss
                 the feasibility, limitations, and implications in
                 selected applications. We also highlight issues that
                 are still open and need to be addressed in future
                 work.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhao:2012:SPM,
  author =       "Yi Zhi Zhao and Chunyan Miao and Maode Ma and Jing
                 Bing Zhang and Cyril Leung",
  title =        "A survey and projection on medium access control
                 protocols for wireless sensor networks",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "7:1--7:37",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379783",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recent advances in wireless communications and sensor
                 technologies have enabled the development of low-cost
                 wireless sensor networks (WSNs) for a wide range of
                 applications. Medium access control (MAC) protocols
                 play a crucial role in WSNs by enabling the sharing of
                 scarce wireless bandwidth efficiently and fairly. This
                 article provides a survey of the literature on MAC
                 protocols for WSNs. We first briefly describe the
                 unique features of WSNs. We then review representative
                 MAC protocols from the following four categories:
                 contention-based protocols, contention-free
                 (scheduled-based) protocols, hybrid protocols, and
                 preamble sampling protocols. Our discussions focus on
                 the background, main features, operation procedures,
                 major design issues, and the advantages and
                 disadvantages of these protocols. We also present an
                 analysis of the inherent and desirable features of the
                 protocols, and the key challenges of MAC technology for
                 WSNs. Finally, we present our view on future research
                 directions for WSN MAC protocols in a reader-friendly
                 way using illustrative diagrams.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hawe:2012:ABS,
  author =       "Glenn I. Hawe and Graham Coates and Duncan T. Wilson
                 and Roger S. Crouch",
  title =        "Agent-based simulation for large-scale emergency
                 response: a survey of usage and implementation",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "8:1--8:51",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379784",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "When attempting to determine how to respond optimally
                 to a large-scale emergency, the ability to predict the
                 consequences of certain courses of action in silico is
                 of great utility. Agent-based simulations (ABSs) have
                 become the de facto tool for this purpose; however,
                 they may be used and implemented in a variety of ways.
                 This article reviews existing implementations of ABSs
                 for large-scale emergency response, and presents a
                 taxonomy classifying them by usage. Opportunities for
                 improving ABS for large-scale emergency response are
                 identified.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Uthra:2012:QRW,
  author =       "R. Annie Uthra and S. V. Kasmir Raja",
  title =        "{QoS} routing in wireless sensor networks --- a
                 survey",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "9:1--9:12",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379785",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A wireless sensor network (WSN) is a one made up of
                 small sensing devices equipped with processors, memory,
                 and short-range wireless communication. Sensor nodes,
                 are autonomous nodes, which include smart dust sensors,
                 motes and so on. They co-operatively monitor physical
                 or environmental conditions and send the sensed data to
                 the sink node. They differ from traditional computer
                 networks due to resource constraints, unbalanced
                 mixture traffic, data redundancy, network dynamics, and
                 energy balance. These kinds of networks support a wide
                 range of applications that have strong requirements to
                 reduce end-to-end delay and losses during data
                 transmissions. When large numbers of sensors are
                 deployed in a sensor field and are active in
                 transmitting the data, there is a possibility of
                 congestion. Congestion may occur due to buffer
                 overflow, channel contention, packet collision, a high
                 data rate, many to one nature, and so on. This leads to
                 packet loss which causes a decrease in throughput and
                 lifetime. Maximum throughput, energy efficiency and
                 minimum error rate can be achieved by minimizing the
                 congestion. A number of quality of service (QoS)
                 techniques has been developed to improve the quality of
                 the network. This article gives an overview of existing
                 QoS techniques and a parametric comparison made with
                 recent developments. This article mainly concentrates
                 on network congestion in WSN environment.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mendes-Moreira:2012:EAR,
  author =       "Jo{\~a}o Mendes-Moreira and Carlos Soares and
                 Al{\'\i}pio M{\'a}rio Jorge and Jorge Freire De Sousa",
  title =        "Ensemble approaches for regression: a survey",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "10:1--10:40",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379786",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The goal of ensemble regression is to combine several
                 models in order to improve the prediction accuracy in
                 learning problems with a numerical target variable. The
                 process of ensemble learning can be divided into three
                 phases: the generation phase, the pruning phase, and
                 the integration phase. We discuss different approaches
                 to each of these phases that are able to deal with the
                 regression problem, categorizing them in terms of their
                 relevant characteristics and linking them to
                 contributions from different fields. Furthermore, this
                 work makes it possible to identify interesting areas
                 for future research.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Harman:2012:SBS,
  author =       "Mark Harman and S. Afshin Mansouri and Yuanyuan
                 Zhang",
  title =        "Search-based software engineering: Trends, techniques
                 and applications",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "11:1--11:61",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379787",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the past five years there has been a dramatic
                 increase in work on Search-Based Software Engineering
                 (SBSE), an approach to Software Engineering (SE) in
                 which Search-Based Optimization (SBO) algorithms are
                 used to address problems in SE. SBSE has been applied
                 to problems throughout the SE lifecycle, from
                 requirements and project planning to maintenance and
                 reengineering. The approach is attractive because it
                 offers a suite of adaptive automated and semiautomated
                 solutions in situations typified by large complex
                 problem spaces with multiple competing and conflicting
                 objectives. This article$^1$ provides a review and
                 classification of literature on SBSE. The work
                 identifies research trends and relationships between
                 the techniques applied and the applications to which
                 they have been applied and highlights gaps in the
                 literature and avenues for further research.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Esling:2012:TSD,
  author =       "Philippe Esling and Carlos Agon",
  title =        "Time-series data mining",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "1",
  pages =        "12:1--12:34",
  month =        nov,
  year =         "2012",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2379776.2379788",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 6 10:55:59 MST 2012",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In almost every scientific field, measurements are
                 performed over time. These observations lead to a
                 collection of organized data called time series. The
                 purpose of time-series data mining is to try to extract
                 all meaningful knowledge from the shape of data. Even
                 if humans have a natural capacity to perform these
                 tasks, it remains a complex problem for computers. In
                 this article we intend to provide a survey of the
                 techniques applied for time-series data mining. The
                 first part is devoted to an overview of the tasks that
                 have captured most of the interest of researchers.
                 Considering that in most cases, time-series task relies
                 on the same components for implementation, we divide
                 the literature depending on these common aspects,
                 namely representation techniques, distance measures,
                 and indexing methods. The study of the relevant
                 literature has been categorized for each individual
                 aspects. Four types of robustness could then be
                 formalized and any kind of distance could then be
                 classified. Finally, the study submits various research
                 trends and avenues that can be explored in the near
                 future. We hope that this article can provide a broad
                 and deep understanding of the time-series data mining
                 research field.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Faro:2013:EOS,
  author =       "Simone Faro and Thierry Lecroq",
  title =        "The exact online string matching problem: a review of
                 the most recent results",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "13:1--13:42",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431212",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  abstract =     "This article addresses the online exact string
                 matching problem which consists in finding all
                 occurrences of a given pattern $p$ in a text $t$. It is
                 an extensively studied problem in computer science,
                 mainly due to its direct applications to such diverse
                 areas as text, image and signal processing, speech
                 analysis and recognition, information retrieval, data
                 compression, computational biology and chemistry. In
                 the last decade more than 50 new algorithms have been
                 proposed for the problem, which add up to a wide set of
                 (almost 40) algorithms presented before 2000. In this
                 article we review the string matching algorithms
                 presented in the last decade and present experimental
                 results in order to bring order among the dozens of
                 articles published in this area.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kritikakou:2013:SAC,
  author =       "Angeliki Kritikakou and Francky Catthoor and Vasilios
                 Kelefouras and Costas Goutis",
  title =        "A systematic approach to classify design-time global
                 scheduling techniques",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "14:1--14:30",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431213",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The scheduling problem is an important partially
                 solved topic related to a wide range of scientific
                 fields. As it applies to design-time mapping on
                 multiprocessing platforms emphasizing on ordering in
                 time and assignment in place, significant improvements
                 can be achieved. To support this improvement, this
                 article presents a complete systematic classification
                 of the existing scheduling techniques solving this
                 problem in a (near-)optimal way. We show that the
                 proposed approach covers any global scheduling
                 technique, including also future ones. In our
                 systematic classification a technique may belong to one
                 primitive class or to a hybrid combination of such
                 classes. In the latter case the technique is
                 efficiently decomposed into more primitive components
                 each one belonging to a specific class. The systematic
                 classification assists in the in-depth understanding of
                 the diverse classes of techniques which is essential
                 for their further improvement. Their main
                 characteristics and structure, their similarities and
                 differences, and the interrelationships of the classes
                 are conceived. In this way, our classification provides
                 guidance for contributing in novel ways to the broad
                 domain of global scheduling techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Attene:2013:PMR,
  author =       "Marco Attene and Marcel Campen and Leif Kobbelt",
  title =        "Polygon mesh repairing: an application perspective",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "15:1--15:33",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431214",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Nowadays, digital 3D models are in widespread and
                 ubiquitous use, and each specific application dealing
                 with 3D geometry has its own quality requirements that
                 restrict the class of acceptable and supported models.
                 This article analyzes typical defects that make a 3D
                 model unsuitable for key application contexts, and
                 surveys existing algorithms that process, repair, and
                 improve its structure, geometry, and topology to make
                 it appropriate to case-by-case requirements. The
                 analysis is focused on polygon meshes, which constitute
                 by far the most common 3D object representation. In
                 particular, this article provides a structured overview
                 of mesh repairing techniques from the point of view of
                 the application context. Different types of mesh
                 defects are classified according to the upstream
                 application that produced the mesh, whereas mesh
                 quality requirements are grouped by representative sets
                 of downstream applications where the mesh is to be
                 used. The numerous mesh repair methods that have been
                 proposed during the last two decades are analyzed and
                 classified in terms of their capabilities, properties,
                 and guarantees. Based on these classifications,
                 guidelines can be derived to support the identification
                 of repairing algorithms best-suited to bridge the
                 compatibility gap between the quality provided by the
                 upstream process and the quality required by the
                 downstream applications in a given geometry processing
                 scenario.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lomax:2013:SCS,
  author =       "Susan Lomax and Sunil Vadera",
  title =        "A survey of cost-sensitive decision tree induction
                 algorithms",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "16:1--16:35",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431215",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The past decade has seen a significant interest on the
                 problem of inducing decision trees that take account of
                 costs of misclassification and costs of acquiring the
                 features used for decision making. This survey
                 identifies over 50 algorithms including approaches that
                 are direct adaptations of accuracy-based methods, use
                 genetic algorithms, use anytime methods and utilize
                 boosting and bagging. The survey brings together these
                 different studies and novel approaches to
                 cost-sensitive decision tree learning, provides a
                 useful taxonomy, a historical timeline of how the field
                 has developed and should provide a useful reference
                 point for future research in this field.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pearce:2013:VIS,
  author =       "Michael Pearce and Sherali Zeadally and Ray Hunt",
  title =        "Virtualization: Issues, security threats, and
                 solutions",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "17:1--17:39",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431216",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Although system virtualization is not a new paradigm,
                 the way in which it is used in modern system
                 architectures provides a powerful platform for system
                 building, the advantages of which have only been
                 realized in recent years, as a result of the rapid
                 deployment of commodity hardware and software systems.
                 In principle, virtualization involves the use of an
                 encapsulating software layer (Hypervisor or Virtual
                 Machine Monitor) which surrounds or underlies an
                 operating system and provides the same inputs, outputs,
                 and behavior that would be expected from an actual
                 physical device. This abstraction means that an ideal
                 Virtual Machine Monitor provides an environment to the
                 software equivalent to the host system, but which is
                 decoupled from the hardware state. Because a virtual
                 machine is not dependent on the state of the physical
                 hardware, multiple virtual machines may be installed on
                 a single set of hardware. The decoupling of physical
                 and logical states gives virtualization inherent
                 security benefits. However, the design, implementation,
                 and deployment of virtualization technology have also
                 opened up novel threats and security issues which,
                 while not particular to system virtualization, take on
                 new forms in relation to it. Reverse engineering
                 becomes easier due to introspection capabilities, as
                 encryption keys, security algorithms, low-level
                 protection, intrusion detection, or antidebugging
                 measures can become more easily compromised.
                 Furthermore, associated technologies such as virtual
                 routing and networking can create challenging issues
                 for security, intrusion control, and associated
                 forensic processes. We explain the security
                 considerations and some associated methodologies by
                 which security breaches can occur, and offer
                 recommendations for how virtualized environments can
                 best be protected. Finally, we offer a set of
                 generalized recommendations that can be applied to
                 achieve secure virtualized implementations.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Acevedo-Mosqueda:2013:BAM,
  author =       "Maria Elena Acevedo-Mosqueda and Cornelio
                 Y{\'a}{\~n}ez-M{\'a}rquez and Marco Antonio
                 Acevedo-Mosqueda",
  title =        "{Bidirectional Associative Memories}: Different
                 approaches",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "18:1--18:30",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431217",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Bidirectional Associative Memories (BAM) are systems
                 that allow to associate pairs of patterns. Once a
                 memory has learned, patterns can be recalled in two
                 directions. BAMs have many applications in pattern
                 recognition and image processing. The aim of this
                 survey is to present several models of BAM throughout
                 time, since Kosko [1988] proposed the first model;
                 followed by those works based on or inspired by it,
                 trying to improve recall capacity; to some recent
                 one-shot models-such as Morphological BAM and
                 Alpha-Beta BAM-which are of particular interest, given
                 their superior performance.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mooney:2013:SPM,
  author =       "Carl H. Mooney and John F. Roddick",
  title =        "Sequential pattern mining --- approaches and
                 algorithms",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "19:1--19:39",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431218",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  abstract =     "Sequences of events, items, or tokens occurring in an
                 ordered metric space appear often in data and the
                 requirement to detect and analyze frequent subsequences
                 is a common problem. Sequential Pattern Mining arose as
                 a subfield of data mining to focus on this field. This
                 article surveys the approaches and algorithms proposed
                 to date.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Koskela:2013:PGM,
  author =       "Timo Koskela and Otso Kassinen and Erkki Harjula and
                 Mika Ylianttila",
  title =        "{P2P} group management systems: a conceptual
                 analysis",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "20:1--20:25",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431219",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Peer-to-Peer (P2P) networks are becoming eminent
                 platforms for both distributed computing and
                 interpersonal communication. Their role in contemporary
                 multimedia content delivery and communication systems
                 is strong, as witnessed by many popular applications
                 and services. Groups in P2P systems can originate from
                 the relations between humans, or they can be defined
                 with purely technical criteria such as proximity. In
                 this article, we present a conceptual analysis of P2P
                 group management systems. We illustrate how groups are
                 formed using different P2P system architectures, and
                 analyze the advantages and disadvantages of using each
                 P2P system architecture for implementing P2P group
                 management. The evaluation criteria in the analysis are
                 performance, robustness, fairness, suitability for
                 battery-powered devices, scalability, and security. The
                 outcome of the analysis facilitates the selection of an
                 appropriate P2P system architecture for implementing
                 P2P group management in both further research and
                 prototype development.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Saeedi:2013:SOR,
  author =       "Mehdi Saeedi and Igor L. Markov",
  title =        "Synthesis and optimization of reversible circuits ---
                 a survey",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "21:1--21:34",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431220",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Reversible logic circuits have been historically
                 motivated by theoretical research in low-power
                 electronics as well as practical improvement of bit
                 manipulation transforms in cryptography and computer
                 graphics. Recently, reversible circuits have attracted
                 interest as components of quantum algorithms, as well
                 as in photonic and nano-computing technologies where
                 some switching devices offer no signal gain. Research
                 in generating reversible logic distinguishes between
                 circuit synthesis, postsynthesis optimization, and
                 technology mapping. In this survey, we review
                 algorithmic paradigms-search based, cycle based,
                 transformation based, and BDD based-as well as specific
                 algorithms for reversible synthesis, both exact and
                 heuristic. We conclude the survey by outlining key open
                 challenges in synthesis of reversible and quantum
                 logic, as well as most common misconceptions.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Abaza:2013:SEB,
  author =       "Ayman Abaza and Arun Ross and Christina Hebert and
                 Mary Ann F. Harrison and Mark S. Nixon",
  title =        "A survey on ear biometrics",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "22:1--22:35",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431221",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recognizing people by their ear has recently received
                 significant attention in the literature. Several
                 reasons account for this trend: first, ear recognition
                 does not suffer from some problems associated with
                 other non-contact biometrics, such as face recognition;
                 second, it is the most promising candidate for
                 combination with the face in the context of multi-pose
                 face recognition; and third, the ear can be used for
                 human recognition in surveillance videos where the face
                 may be occluded completely or in part. Further, the ear
                 appears to degrade little with age. Even though current
                 ear detection and recognition systems have reached a
                 certain level of maturity, their success is limited to
                 controlled indoor conditions. In addition to variation
                 in illumination, other open research problems include
                 hair occlusion, earprint forensics, ear symmetry, ear
                 classification, and ear individuality. This article
                 provides a detailed survey of research conducted in ear
                 detection and recognition. It provides an up-to-date
                 review of the existing literature revealing the current
                 state-of-art for not only those who are working in this
                 area but also for those who might exploit this new
                 approach. Furthermore, it offers insights into some
                 unsolved ear recognition problems as well as ear
                 databases available for researchers.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Parvez:2013:OAH,
  author =       "Mohammad Tanvir Parvez and Sabri A. Mahmoud",
  title =        "Offline {Arabic} handwritten text recognition: a
                 survey",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "23:1--23:35",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431222",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/spell.bib",
  abstract =     "Research in offline Arabic handwriting recognition has
                 increased considerably in the past few years. This is
                 evident from the numerous research results published
                 recently in major journals and conferences in the area
                 of handwriting recognition. Features and
                 classifications techniques utilized in recent research
                 work have diversified noticeably compared to the past.
                 Moreover, more efforts have been diverted, in last few
                 years, to construct different databases for Arabic
                 handwriting recognition. This article provides a
                 comprehensive survey of recent developments in Arabic
                 handwriting recognition. The article starts with a
                 summary of the characteristics of Arabic text, followed
                 by a general model for an Arabic text recognition
                 system. Then the used databases for Arabic text
                 recognition are discussed. Research works on
                 preprocessing phase, like text representation, baseline
                 detection, line, word, character, and subcharacter
                 segmentation algorithms, are presented. Different
                 feature extraction techniques used in Arabic
                 handwriting recognition are identified and discussed.
                 Different classification approaches, like HMM, ANN,
                 SVM, k-NN, syntactical methods, etc., are discussed in
                 the context of Arabic handwriting recognition. Works on
                 Arabic lexicon construction and spell checking are
                 presented in the postprocessing phase. Several summary
                 tables of published research work are provided for used
                 Arabic text databases and reported results on Arabic
                 character, word, numerals, and text recognition. These
                 tables summarize the features, classifiers, data, and
                 reported recognition accuracy for each technique.
                 Finally, we discuss some future research directions in
                 Arabic handwriting recognition.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Suomela:2013:SLA,
  author =       "Jukka Suomela",
  title =        "Survey of local algorithms",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "2",
  pages =        "24:1--24:40",
  month =        feb,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2431211.2431223",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 7 11:42:33 MST 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A local algorithm is a distributed algorithm that runs
                 in constant time, independently of the size of the
                 network. Being highly scalable and fault tolerant, such
                 algorithms are ideal in the operation of large-scale
                 distributed systems. Furthermore, even though the model
                 of local algorithms is very limited, in recent years we
                 have seen many positive results for nontrivial
                 problems. This work surveys the state-of-the-art in the
                 field, covering impossibility results, deterministic
                 local algorithms, randomized local algorithms, and
                 local algorithms for geometric graphs.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Manshaei:2013:GTM,
  author =       "Mohammad Hossein Manshaei and Quanyan Zhu and Tansu
                 Alpcan and Tamer Bacsar and Jean-Pierre Hubaux",
  title =        "Game theory meets network security and privacy",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "25:1--25:39",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480742",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This survey provides a structured and comprehensive
                 overview of research on security and privacy in
                 computer and communication networks that use
                 game-theoretic approaches. We present a selected set of
                 works to highlight the application of game theory in
                 addressing different forms of security and privacy
                 problems in computer networks and mobile applications.
                 We organize the presented works in six main categories:
                 security of the physical and MAC layers, security of
                 self-organizing networks, intrusion detection systems,
                 anonymity and privacy, economics of network security,
                 and cryptography. In each category, we identify
                 security problems, players, and game models. We
                 summarize the main results of selected works, such as
                 equilibrium analysis and security mechanism designs. In
                 addition, we provide a discussion on the advantages,
                 drawbacks, and future direction of using game theory in
                 this field. In this survey, our goal is to instill in
                 the reader an enhanced understanding of different
                 research approaches in applying game-theoretic methods
                 to network security. This survey can also help
                 researchers from various fields develop game-theoretic
                 solutions to current and emerging security problems in
                 computer networking.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Stanier:2013:IRI,
  author =       "James Stanier and Des Watson",
  title =        "Intermediate representations in imperative compilers:
                 a survey",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "26:1--26:27",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480743",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Compilers commonly translate an input program into an
                 intermediate representation (IR) before optimizing it
                 and generating code. Over time there have been a number
                 of different approaches to designing and implementing
                 IRs. Different IRs have varying benefits and drawbacks.
                 In this survey, we highlight key developments in the
                 area of IR for imperative compilers, group them by a
                 taxonomy and timeline, and comment on the divide
                 between academic research and real-world compiler
                 technology. We conclude that mainstream compilers,
                 especially in the multicore era, could benefit from
                 further IR innovations.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hoseini-Tabatabaei:2013:SSB,
  author =       "Seyed Amir Hoseini-Tabatabaei and Alexander Gluhak and
                 Rahim Tafazolli",
  title =        "A survey on smartphone-based systems for opportunistic
                 user context recognition",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "27:1--27:51",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480744",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The ever-growing computation and storage capability of
                 mobile phones have given rise to mobile-centric context
                 recognition systems, which are able to sense and
                 analyze the context of the carrier so as to provide an
                 appropriate level of service. As nonintrusive
                 autonomous sensing and context recognition are
                 desirable characteristics of a personal sensing system;
                 efforts have been made to develop opportunistic sensing
                 techniques on mobile phones. The resulting combination
                 of these approaches has ushered in a new realm of
                 applications, namely opportunistic user context
                 recognition with mobile phones. This article surveys
                 the existing research and approaches towards
                 realization of such systems. In doing so, the typical
                 architecture of a mobile-centric user context
                 recognition system as a sequential process of sensing,
                 preprocessing, and context recognition phases is
                 introduced. The main techniques used for the
                 realization of the respective processes during these
                 phases are described, and their strengths and
                 limitations are highlighted. In addition, lessons
                 learned from previous approaches are presented as
                 motivation for future research. Finally, several open
                 challenges are discussed as possible ways to extend the
                 capabilities of current systems and improve their
                 real-world experience.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Colombo:2013:RWL,
  author =       "Christian Colombo and Gordon J. Pace",
  title =        "Recovery within long-running transactions",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "28:1--28:35",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480745",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "As computer systems continue to grow in complexity,
                 the possibility of failure increases. At the same time,
                 the increase in computer system pervasiveness in
                 day-to-day activities bring along increased
                 expectations on their reliability. This has led to the
                 need for effective and automatic error-recovery
                 techniques to resolve failures. Transactions enable the
                 handling of failure propagation over concurrent systems
                 due to dependencies, restoring the system to the point
                 before the failure occurred. However, in various
                 settings, especially when interacting with the real
                 world, reversal is not possible. The notion of
                 compensations has been long advocated as a way of
                 addressing this issue, through the specification of
                 activities which can be executed to undo partial
                 transactions. Still, there is no accepted standard
                 theory; the literature offers a plethora of distinct
                 formalisms and approaches. In this survey, we review
                 the compensations from a theoretical point of view by
                 (i) giving a historic account of the evolution of
                 compensating transactions; (ii) delineating and
                 describing a number of design options involved; (iii)
                 presenting a number of formalisms found in the
                 literature, exposing similarities and differences; (iv)
                 comparing formal notions of compensation correctness;
                 (v) giving insights regarding the application of
                 compensations in practice; and (vi) discussing current
                 and future research trends in the area.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zilberberg:2013:PCM,
  author =       "Omer Zilberberg and Shlomo Weiss and Sivan Toledo",
  title =        "Phase-change memory: an architectural perspective",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "29:1--29:33",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480746",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article surveys the current state of phase-change
                 memory (PCM) as a nonvolatile memory technology set to
                 replace flash and DRAM in modern computerized systems.
                 It has been researched and developed in the last
                 decade, with researchers providing better architectural
                 designs which address the technology's main
                 challenges-its limited write endurance, potential long
                 latency, high energy writes, power dissipation, and
                 some concerns for memory privacy. Some physical
                 properties of the technology are also discussed,
                 providing a basis for architectural discussions. Also
                 briefly shown are other architectural alternatives,
                 such as FeRAM and MRAM. The designs surveyed in this
                 article include read before write, wear leveling, write
                 cancellation, write pausing, some encryption schemes,
                 and buffer organizations. These allow PCM to stand on
                 its own as a replacement for DRAM as main memory.
                 Designs for hybrid memory systems with both PCM and
                 DRAM are also shown and some designs for SSDs
                 incorporating PCM.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gomes:2013:DCP,
  author =       "Jo{\~a}o V. Gomes and Pedro R. M. In{\'a}cio and
                 Manuela Pereira and M{\'a}rio M. Freire and Paulo P.
                 Monteiro",
  title =        "Detection and classification of peer-to-peer traffic:
                 a survey",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "30:1--30:40",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480747",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The emergence of new Internet paradigms has changed
                 the common properties of network data, increasing the
                 bandwidth consumption and balancing traffic in both
                 directions. These facts raise important challenges,
                 making it necessary to devise effective solutions for
                 managing network traffic. Since traditional methods are
                 rather ineffective and easily bypassed, particular
                 attention has been paid to the development of new
                 approaches for traffic classification. This article
                 surveys the studies on peer-to-peer traffic detection
                 and classification, making an extended review of the
                 literature. Furthermore, it provides a comprehensive
                 analysis of the concepts and strategies for network
                 monitoring.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Serban:2013:SIA,
  author =       "Floarea Serban and Joaquin Vanschoren and J{\"o}rg-Uwe
                 Kietz and Abraham Bernstein",
  title =        "A survey of intelligent assistants for data analysis",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "31:1--31:35",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480748",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Research and industry increasingly make use of large
                 amounts of data to guide decision-making. To do this,
                 however, data needs to be analyzed in typically
                 nontrivial refinement processes, which require
                 technical expertise about methods and algorithms,
                 experience with how a precise analysis should proceed,
                 and knowledge about an exploding number of analytic
                 approaches. To alleviate these problems, a plethora of
                 different systems have been proposed that
                 ``intelligently'' help users to analyze their data.
                 This article provides a first survey to almost 30 years
                 of research on intelligent discovery assistants (IDAs).
                 It explicates the types of help IDAs can provide to
                 users and the kinds of (background) knowledge they
                 leverage to provide this help. Furthermore, it provides
                 an overview of the systems developed over the past
                 years, identifies their most important features, and
                 sketches an ideal future IDA as well as the challenges
                 on the road ahead.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zang:2013:SCT,
  author =       "Wei Zang and Ann Gordon-Ross",
  title =        "A survey on cache tuning from a power\slash energy
                 perspective",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "32:1--32:49",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480749",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Low power and/or energy consumption is a requirement
                 not only in embedded systems that run on batteries or
                 have limited cooling capabilities, but also in desktop
                 and mainframes where chips require costly cooling
                 techniques. Since the cache subsystem is typically the
                 most power/energy-consuming subsystem, caches are good
                 candidates for power/energy optimizations, and
                 therefore, cache tuning techniques are widely
                 researched. This survey focuses on state-of-the-art
                 offline static and online dynamic cache tuning
                 techniques and summarizes the techniques' attributes,
                 major challenges, and potential research trends to
                 inspire novel ideas and future research avenues.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bostoen:2013:PRT,
  author =       "Tom Bostoen and Sape Mullender and Yolande Berbers",
  title =        "Power-reduction techniques for data-center storage
                 systems",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "33:1--33:38",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480750",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "As data-intensive, network-based applications
                 proliferate, the power consumed by the data-center
                 storage subsystem surges. This survey summarizes,
                 organizes, and integrates a decade of research on
                 power-aware enterprise storage systems. All of the
                 existing power-reduction techniques are classified
                 according to the disk-power factor and storage-stack
                 layer addressed. A majority of power-reduction
                 techniques is based on dynamic power management. We
                 also consider alternative methods that reduce disk
                 access time, conserve space, or exploit
                 energy-efficient storage hardware. For every
                 energy-conservation technique, the fundamental
                 trade-offs between power, capacity, performance, and
                 dependability are uncovered. With this survey, we
                 intend to stimulate integration of different
                 power-reduction techniques in new energy-efficient file
                 and storage systems.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dionisio:2013:VWM,
  author =       "John David N. Dionisio and William G. {Burns III} and
                 Richard Gilbert",
  title =        "{$3$D} Virtual worlds and the metaverse: {Current}
                 status and future possibilities",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "34:1--34:38",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480751",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Moving from a set of independent virtual worlds to an
                 integrated network of 3D virtual worlds or Metaverse
                 rests on progress in four areas: immersive realism,
                 ubiquity of access and identity, interoperability, and
                 scalability. For each area, the current status and
                 needed developments in order to achieve a functional
                 Metaverse are described. Factors that support the
                 formation of a viable Metaverse, such as institutional
                 and popular interest and ongoing improvements in
                 hardware performance, and factors that constrain the
                 achievement of this goal, including limits in
                 computational methods and unrealized collaboration
                 among virtual world stakeholders and developers, are
                 also considered.",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Crepinsek:2013:EEE,
  author =       "Matej Crepinsek and Shih-Hsi Liu and Marjan Mernik",
  title =        "Exploration and exploitation in evolutionary
                 algorithms: a survey",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "35:1--35:33",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480752",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "``Exploration and exploitation are the two
                 cornerstones of problem solving by search.'' For more
                 than a decade, Eiben and Schippers' advocacy for
                 balancing between these two antagonistic cornerstones
                 still greatly influences the research directions of
                 evolutionary algorithms (EAs) [1998]. This article
                 revisits nearly 100 existing works and surveys how such
                 works have answered the advocacy. The article
                 introduces a fresh treatment that classifies and
                 discusses existing work within three rational aspects:
                 (1) what and how EA components contribute to
                 exploration and exploitation; (2) when and how
                 exploration and exploitation are controlled; and (3)
                 how balance between exploration and exploitation is
                 achieved. With a more comprehensive and systematic
                 understanding of exploration and exploitation, more
                 research in this direction may be motivated and
                 refined.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{SilvaGalvaoDeCarvalho:2013:SAL,
  author =       "Leandro {Silva Galv{\~a}o De Carvalho} and Edjair {De
                 Souza Mota}",
  title =        "Survey on application-layer mechanisms for speech
                 quality adaptation in {VoIP}",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "36:1--36:31",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480753",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "VoIP calls are sensitive to several impairments, such
                 as delay and packet loss. One way to overcome these
                 problems is by adaptively adjusting application-layer
                 parameters to keep a minimum speech quality level. At
                 the heart of self-adaptive systems lies a feedback
                 loop, which consists of four key activities:
                 monitoring, analysis, planning, and execution.
                 Nevertheless, the existing adaptive approaches to QoS
                 control of VoIP do not explicitly exhibit this feedback
                 loop. Bringing it to surface can help developers in
                 designing more robust and human-independent VoIP
                 systems. This survey presents a comprehensive review of
                 the current state-of-the-art research on speech quality
                 adaptation of VoIP systems at the application layer and
                 some research challenges on this subject.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Grehant:2013:STM,
  author =       "Xavier Grehant and Isabelle Demeure and Sverre Jarp",
  title =        "A survey of task mapping on production grids",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "37:1--37:25",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480754",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Grids designed for computationally demanding
                 scientific applications started experimental phases ten
                 years ago and have been continuously delivering
                 computing power to a wide range of applications for
                 more than half of this time. The observation of their
                 emergence and evolution reveals actual constraints and
                 successful approaches to task mapping across
                 administrative boundaries. Beyond differences in
                 distributions, services, protocols, and standards, a
                 common architecture is outlined. Application-agnostic
                 infrastructures built for resource registration,
                 identification, and access control dispatch delegation
                 to grid sites. Efficient task mapping is managed by
                 large, autonomous applications or collaborations that
                 temporarily infiltrate resources for their own
                 benefits.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kiasari:2013:MFP,
  author =       "Abbas Eslami Kiasari and Axel Jantsch and Zhonghai
                 Lu",
  title =        "Mathematical formalisms for performance evaluation of
                 networks-on-chip",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "38:1--38:41",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480755",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article reviews four popular mathematical
                 formalisms- queueing theory, network calculus,
                 schedulability analysis, and dataflow analysis -and how
                 they have been applied to the analysis of on-chip
                 communication performance in Systems-on-Chip. The
                 article discusses the basic concepts and results of
                 each formalism and provides examples of how they have
                 been used in Networks-on-Chip (NoCs) performance
                 analysis. Also, the respective strengths and weaknesses
                 of each technique and its suitability for a specific
                 purpose are investigated. An open research issue is a
                 unified analytical model for a comprehensive
                 performance evaluation of NoCs. To this end, this
                 article reviews the attempts that have been made to
                 bridge these formalisms.",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Newell:2013:PCD,
  author =       "Andrew Newell and Jing Dong and Cristina Nita-Rotaru",
  title =        "On the practicality of cryptographic defences against
                 pollution attacks in wireless network coding",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "39:1--39:26",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480756",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "Numerous practical systems based on network coding
                 have been proposed in recent years demonstrating the
                 wide range of benefits of network coding, such as
                 increased throughput, reliability, and energy
                 efficiency. However, network coding systems are
                 inherently vulnerable to a severe attack, known as
                 packet pollution, which presents a key obstacle to the
                 deployment of such systems. Several cryptographic
                 schemes have been proposed to defend against pollution
                 attacks. We conduct a detailed analysis and an
                 experimental evaluation in a realistic wireless network
                 coding setting of a set of representative cryptographic
                 defenses against pollution attacks. Our analysis
                 identifies severe limitations of asymmetric-based
                 schemes, which impose high communication overhead by
                 placing constraints on the basic network coding
                 parameters and high computation overhead by relying on
                 numerous operations over large fields. Our analysis
                 also shows that symmetric cryptographic schemes, while
                 having better performance than asymmetric
                 cryptographic-based schemes, impose prohibitive
                 overhead in the presence of multiple byzantine
                 adversaries. We further evaluate these schemes by using
                 a set of typical network coding system parameters on a
                 realistic topology. Our experimental evaluation shows
                 that all the schemes we compare induce a throughput
                 degradation that negates the performance benefits of
                 network coding in the presence of multiple colluding
                 adversaries.",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pek:2013:SSI,
  author =       "G{\'a}bor P{\'e}k and Levente Butty'an and
                 Boldizs{\'a}r Bencs{\'a}th",
  title =        "A survey of security issues in hardware
                 virtualization",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "3",
  pages =        "40:1--40:34",
  month =        jun,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2480741.2480757",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 1 18:21:14 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Virtualization is a powerful technology for increasing
                 the efficiency of computing services; however, besides
                 its advantages, it also raises a number of security
                 issues. In this article, we provide a thorough survey
                 of those security issues in hardware virtualization. We
                 focus on potential vulnerabilities and existing attacks
                 on various virtualization platforms, but we also
                 briefly sketch some possible countermeasures. To the
                 best of our knowledge, this is the first survey of
                 security issues in hardware virtualization with this
                 level of details. Moreover, the adversary model and the
                 structuring of the attack vectors are original
                 contributions, never published before.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bossuet:2013:AFS,
  author =       "Lilian Bossuet and Michael Grand and Lubos Gaspar and
                 Viktor Fischer and Guy Gogniat",
  title =        "Architectures of flexible symmetric key crypto engines
                 --- a survey: From hardware coprocessor to
                 multi-crypto-processor system on chip",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "41:1--41:32",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501655",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "Throughput, flexibility, and security form the design
                 trilogy of reconfigurable crypto engines; they must be
                 carefully considered without reducing the major role of
                 classical design constraints, such as surface, power
                 consumption, dependability, and cost. Applications such
                 as network security, Virtual Private Networks (VPN),
                 Digital Rights Management (DRM), and pay per view have
                 drawn attention to these three constraints. For more
                 than ten years, many studies in the field of
                 cryptographic engineering have focused on the design of
                 optimized high-throughput hardware cryptographic cores
                 (e.g., symmetric and asymmetric key block ciphers,
                 stream ciphers, and hash functions). The flexibility of
                 cryptographic systems plays a very important role in
                 their practical application. Reconfigurable hardware
                 systems can evolve with algorithms, face up to new
                 types of attacks, and guarantee interoperability
                 between countries and institutions. The flexibility of
                 reconfigurable crypto processors and crypto
                 coprocessors has reached new levels with the emergence
                 of dynamically reconfigurable hardware architectures
                 and tools. Last but not least, the security of systems
                 that handle confidential information needs to be
                 thoroughly evaluated at the design stage in order to
                 meet security objectives that depend on the importance
                 of the information to be protected and on the cost of
                 protection. Usually, designers tackle security problems
                 at the same time as other design constraints and in
                 many cases target only one security objective, for
                 example, a side-channel attack countermeasures, fault
                 tolerance capability, or the monitoring of the device
                 environment. Only a few authors have addressed all
                 three design constraints at the same time. In
                 particular, key management security (e.g., secure key
                 generation and transmission, the use of a hierarchical
                 key structure composed of session keys and master keys)
                 has frequently been neglected to the benefit of
                 performance and/or flexibility. Nevertheless, a few
                 authors propose original processor architectures based
                 on multi-crypto-processor structures and reconfigurable
                 cryptographic arrays. In this article, we review
                 published works on symmetric key crypto engines and
                 present current trends and design challenges.",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Parent:2013:STM,
  author =       "Christine Parent and Stefano Spaccapietra and Chiara
                 Renso and Gennady Andrienko and Natalia Andrienko and
                 Vania Bogorny and Maria Luisa Damiani and Aris
                 Gkoulalas-Divanis and Jose Macedo and Nikos Pelekis and
                 Yannis Theodoridis and Zhixian Yan",
  title =        "Semantic trajectories modeling and analysis",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "42:1--42:32",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501656",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Focus on movement data has increased as a consequence
                 of the larger availability of such data due to current
                 GPS, GSM, RFID, and sensors techniques. In parallel,
                 interest in movement has shifted from raw movement data
                 analysis to more application-oriented ways of analyzing
                 segments of movement suitable for the specific purposes
                 of the application. This trend has promoted
                 semantically rich trajectories, rather than raw
                 movement, as the core object of interest in mobility
                 studies. This survey provides the definitions of the
                 basic concepts about mobility data, an analysis of the
                 issues in mobility data management, and a survey of the
                 approaches and techniques for: (i) constructing
                 trajectories from movement tracks, (ii) enriching
                 trajectories with semantic information to enable the
                 desired interpretations of movements, and (iii) using
                 data mining to analyze semantic trajectories and
                 extract knowledge about their characteristics, in
                 particular the behavioral patterns of the moving
                 objects. Last but not least, the article surveys the
                 new privacy issues that arise due to the semantic
                 aspects of trajectories.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Xie:2013:OCD,
  author =       "Jierui Xie and Stephen Kelley and Boleslaw K.
                 Szymanski",
  title =        "Overlapping community detection in networks: The
                 state-of-the-art and comparative study",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "43:1--43:35",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501657",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article reviews the state-of-the-art in
                 overlapping community detection algorithms, quality
                 measures, and benchmarks. A thorough comparison of
                 different algorithms (a total of fourteen) is provided.
                 In addition to community-level evaluation, we propose a
                 framework for evaluating algorithms' ability to detect
                 overlapping nodes, which helps to assess overdetection
                 and underdetection. After considering community-level
                 detection performance measured by normalized mutual
                 information, the Omega index, and node-level detection
                 performance measured by F-score, we reached the
                 following conclusions. For low overlapping density
                 networks, SLPA, OSLOM, Game, and COPRA offer better
                 performance than the other tested algorithms. For
                 networks with high overlapping density and high
                 overlapping diversity, both SLPA and Game provide
                 relatively stable performance. However, test results
                 also suggest that the detection in such networks is
                 still not yet fully resolved. A common feature observed
                 by various algorithms in real-world networks is the
                 relatively small fraction of overlapping nodes
                 (typically less than 30\%), each of which belongs to
                 only 2 or 3 communities.",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Liu:2013:NDV,
  author =       "Jiajun Liu and Zi Huang and Hongyun Cai and Heng Tao
                 Shen and Chong Wah Ngo and Wei Wang",
  title =        "Near-duplicate video retrieval: Current research and
                 future trends",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "44:1--44:23",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501658",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The exponential growth of online videos, along with
                 increasing user involvement in video-related
                 activities, has been observed as a constant phenomenon
                 during the last decade. User's time spent on video
                 capturing, editing, uploading, searching, and viewing
                 has boosted to an unprecedented level. The massive
                 publishing and sharing of videos has given rise to the
                 existence of an already large amount of near-duplicate
                 content. This imposes urgent demands on near-duplicate
                 video retrieval as a key role in novel tasks such as
                 video search, video copyright protection, video
                 recommendation, and many more. Driven by its
                 significance, near-duplicate video retrieval has
                 recently attracted a lot of attention. As discovered in
                 recent works, latest improvements and progress in
                 near-duplicate video retrieval, as well as related
                 topics including low-level feature extraction,
                 signature generation, and high-dimensional indexing,
                 are employed to assist the process. As we survey the
                 works in near-duplicate video retrieval, we
                 comparatively investigate existing variants of the
                 definition of near-duplicate video, describe a generic
                 framework, summarize state-of-the-art practices, and
                 explore the emerging trends in this research topic.",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rodriguez-Gomez:2013:STB,
  author =       "Rafael A. Rodr{\'\i}guez-G{\'o}mez and Gabriel
                 Maci{\'a}-Fern{\'a}ndez and Pedro Garc{\'\i}a-Teodoro",
  title =        "Survey and taxonomy of botnet research through
                 life-cycle",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "45:1--45:33",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501659",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Of all current threats to cybersecurity, botnets are
                 at the top of the list. In consequence, interest in
                 this problem is increasing rapidly among the research
                 community and the number of publications on the
                 question has grown exponentially in recent years. This
                 article proposes a taxonomy of botnet research and
                 presents a survey of the field to provide a
                 comprehensive overview of all these contributions.
                 Furthermore, we hope to provide researchers with a
                 clear perspective of the gaps that remain to be filled
                 in our defenses against botnets. The taxonomy is based
                 upon the botnet's life-cycle, defined as the sequence
                 of stages a botnet needs to pass through in order to
                 reach its goal. This approach allows us to consider the
                 problem of botnets from a global perspective, which
                 constitutes a key difference from other taxonomies that
                 have been proposed. Under this novel taxonomy, we
                 conclude that all attempts to defeat botnets should be
                 focused on one or more stages of this life-cycle. In
                 fact, the sustained hindering of any of the stages
                 makes it possible to thwart a botnet's progress and
                 thus render it useless. We test the potential
                 capabilities of our taxonomy by means of a survey of
                 current botnet research, and find it genuinely useful
                 in understanding the focus of the different
                 contributions in this field.",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Basu:2013:SPP,
  author =       "Anirban Basu and Simon Fleming and James Stanier and
                 Stephen Naicken and Ian Wakeman and Vijay K. Gurbani",
  title =        "The state of peer-to-peer network simulators",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "46:1--46:25",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501660",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Networking research often relies on simulation in
                 order to test and evaluate new ideas. An important
                 requirement of this process is that results must be
                 reproducible so that other researchers can replicate,
                 validate, and extend existing work. We look at the
                 landscape of simulators for research in peer-to-peer
                 (P2P) networks by conducting a survey of a combined
                 total of over 280 papers from before and after 2007
                 (the year of the last survey in this area), and comment
                 on the large quantity of research using bespoke,
                 closed-source simulators. We propose a set of criteria
                 that P2P simulators should meet, and poll the P2P
                 research community for their agreement. We aim to drive
                 the community towards performing their experiments on
                 simulators that allow for others to validate their
                 results.",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sherchan:2013:STS,
  author =       "Wanita Sherchan and Surya Nepal and Cecile Paris",
  title =        "A survey of trust in social networks",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "47:1--47:33",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501661",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Web-based social networks have become popular as a
                 medium for disseminating information and connecting
                 like-minded people. The public accessibility of such
                 networks with the ability to share opinions, thoughts,
                 information, and experience offers great promise to
                 enterprises and governments. In addition to individuals
                 using such networks to connect to their friends and
                 families, governments and enterprises have started
                 exploiting these platforms for delivering their
                 services to citizens and customers. However, the
                 success of such attempts relies on the level of trust
                 that members have with each other as well as with the
                 service provider. Therefore, trust becomes an essential
                 and important element of a successful social network.
                 In this article, we present the first comprehensive
                 review of social and computer science literature on
                 trust in social networks. We first review the existing
                 definitions of trust and define social trust in the
                 context of social networks. We then discuss recent
                 works addressing three aspects of social trust: trust
                 information collection, trust evaluation, and trust
                 dissemination. Finally, we compare and contrast the
                 literature and identify areas for further research in
                 social trust.",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kalayappan:2013:SCA,
  author =       "Rajshekar Kalayappan and Smruti R. Sarangi",
  title =        "A survey of checker architectures",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "48:1--48:34",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501662",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Reliability is quickly becoming a primary design
                 constraint for high-end processors because of the
                 inherent limits of manufacturability, extreme
                 miniaturization of transistors, and the growing
                 complexity of large multicore chips. To achieve a high
                 degree of fault tolerance, we need to detect faults
                 quickly and try to rectify them. In this article, we
                 focus on the former aspect. We present a survey of
                 different kinds of fault detection mechanisms for
                 processors at circuit, architecture, and software
                 level. We collectively refer to such mechanisms as
                 checker architectures. First, we propose a novel
                 two-level taxonomy for different classes of checkers
                 based on their structure and functionality.
                 Subsequently, for each class we present the ideas in
                 some of the seminal papers that have defined the
                 direction of the area along with important extensions
                 published in later work.",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chang:2013:ADA,
  author =       "Jian Chang and Krishna K. Venkatasubramanian and
                 Andrew G. West and Insup Lee",
  title =        "Analyzing and defending against {Web}-based malware",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "49:1--49:35",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501663",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Web-based malware is a growing threat to today's
                 Internet security. Attacks of this type are prevalent
                 and lead to serious security consequences. Millions of
                 malicious URLs are used as distribution channels to
                 propagate malware all over the Web. After being
                 infected, victim systems fall in the control of
                 attackers, who can utilize them for various cyber
                 crimes such as stealing credentials, spamming, and
                 distributed denial-of-service attacks. Moreover, it has
                 been observed that traditional security technologies
                 such as firewalls and intrusion detection systems have
                 only limited capability to mitigate this new problem.
                 In this article, we survey the state-of-the-art
                 research regarding the analysis of-and defense
                 against-Web-based malware attacks. First, we study the
                 attack model, the root cause, and the vulnerabilities
                 that enable these attacks. Second, we analyze the
                 status quo of the Web-based malware problem. Third,
                 three categories of defense mechanisms are discussed in
                 detail: (1) building honeypots with virtual machines or
                 signature-based detection system to discover existing
                 threats; (2) using code analysis and testing techniques
                 to identify the vulnerabilities of Web applications;
                 and (3) constructing reputation-based blacklists or
                 smart sandbox systems to protect end-users from
                 attacks. We show that these three categories of
                 approaches form an extensive solution space to the
                 Web-based malware problem. Finally, we compare the
                 surveyed approaches and discuss possible future
                 research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Benoit:2013:SPW,
  author =       "Anne Benoit and {\"U}mit V. {\c{C}}ataly{\"u}rek and
                 Yves Robert and Erik Saule",
  title =        "A survey of pipelined workflow scheduling: {Models}
                 and algorithms",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "50:1--50:36",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501664",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A large class of applications need to execute the same
                 workflow on different datasets of identical size.
                 Efficient execution of such applications necessitates
                 intelligent distribution of the application components
                 and tasks on a parallel machine, and the execution can
                 be orchestrated by utilizing task, data, pipelined,
                 and/or replicated parallelism. The scheduling problem
                 that encompasses all of these techniques is called
                 pipelined workflow scheduling, and it has been widely
                 studied in the last decade. Multiple models and
                 algorithms have flourished to tackle various
                 programming paradigms, constraints, machine behaviors,
                 or optimization goals. This article surveys the field
                 by summing up and structuring known results and
                 approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hubaux:2013:SCF,
  author =       "Arnaud Hubaux and Thein Than Tun and Patrick Heymans",
  title =        "Separation of concerns in feature diagram languages: a
                 systematic survey",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "51:1--51:23",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501665",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The need for flexible customization of large
                 feature-rich software systems, according to
                 requirements of various stakeholders, has become an
                 important problem in software development. Among the
                 many software engineering approaches dealing with
                 variability management, the notion of Software Product
                 Line (SPL) has emerged as a major unifying concept.
                 Drawing from established disciplines of manufacturing,
                 SPL approaches aim to design repertoires of software
                 artifacts, from which customized software systems for
                 specific stakeholder requirements can be developed. A
                 major difficulty SPL approaches attempt to address is
                 the modularization of software artifacts, which
                 reconciles the user's needs for certain features and
                 the development and technical constraints. Towards this
                 end, many SPL approaches use feature diagrams to
                 describe possible configurations of a feature set.
                 There have been several proposals for feature diagram
                 languages with varying degrees of expressiveness,
                 intuitiveness, and precision. However, these feature
                 diagram languages have limited scalability when applied
                 to realistic software systems. This article provides a
                 systematic survey of various concerns of feature
                 diagrams and ways in which concerns have been
                 separated. The survey shows how the uncertainty in the
                 purpose of feature diagram languages creates both
                 conceptual and practical limitations to scalability of
                 those languages.",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bainomugisha:2013:SRP,
  author =       "Engineer Bainomugisha and Andoni Lombide Carreton and
                 Tom van Cutsem and Stijn Mostinckx and Wolfgang de
                 Meuter",
  title =        "A survey on reactive programming",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "52:1--52:34",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501666",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Reactive programming has recently gained popularity as
                 a paradigm that is well-suited for developing
                 event-driven and interactive applications. It
                 facilitates the development of such applications by
                 providing abstractions to express time-varying values
                 and automatically managing dependencies between such
                 values. A number of approaches have been recently
                 proposed embedded in various languages such as Haskell,
                 Scheme, JavaScript, Java, {.NET}, etc. This survey
                 describes and provides a taxonomy of existing reactive
                 programming approaches along six axes: representation
                 of time-varying values, evaluation model, lifting
                 operations, multidirectionality, glitch avoidance, and
                 support for distribution. From this taxonomy, we
                 observe that there are still open challenges in the
                 field of reactive programming. For instance,
                 multidirectionality is supported only by a small number
                 of languages, which do not automatically track
                 dependencies between time-varying values. Similarly,
                 glitch avoidance, which is subtle in reactive programs,
                 cannot be ensured in distributed reactive programs
                 using the current techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Androutsopoulos:2013:SBM,
  author =       "Kelly Androutsopoulos and David Clark and Mark Harman
                 and Jens Krinke and Laurence Tratt",
  title =        "State-based model slicing: a survey",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "53:1--53:36",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501667",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Slicing is a technique, traditionally applied to
                 programs, for extracting the parts of a program that
                 affect the values computed at a statement of interest.
                 In recent years authors have begun to consider slicing
                 at model level. We present a detailed review of
                 existing work on slicing at the level of
                 finite-state-machine-based models. We focus on
                 state-based modeling notations because these have
                 received sufficient attention from the slicing
                 community that there is now a coherent body of hitherto
                 unsurveyed work. We also identify the challenges that
                 state-based slicing presents and how the existing
                 literature has addressed these. We conclude by
                 identifying problems that remain open either because of
                 the challenges involved in addressing them or because
                 the community simply has yet to turn its attention to
                 solving them.",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lazaro:2013:DRD,
  author =       "Daniel Lazaro and Joan Manuel Marques and Josep Jorba
                 and Xavier Vilajosana",
  title =        "Decentralized resource discovery mechanisms for
                 distributed computing in peer-to-peer environments",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "54:1--54:54",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501668",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Resource discovery is an important part of distributed
                 computing and resource sharing systems, like grids and
                 utility computing. Because of the increasing importance
                 of decentralized and peer-to-peer environments,
                 characterized by high dynamism and churn, a number of
                 resource discovery mechanisms, mainly based on
                 peer-to-peer techniques, have been presented recently.
                 We present and classify them according to criteria like
                 their topology and the degree of achievement of various
                 common requirements of great importance for the
                 targeted environments, as well as compare their
                 reported performance. These classifications intend to
                 provide an intuitive vision of the strengths and
                 weaknesses of each system.",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shaul:2013:CSF,
  author =       "Levi Shaul and Doron Tauber",
  title =        "Critical success factors in enterprise resource
                 planning systems: Review of the last decade",
  journal =      j-COMP-SURV,
  volume =       "45",
  number =       "4",
  pages =        "55:1--55:39",
  month =        aug,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2501654.2501669",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Aug 26 17:21:41 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Organizations perceive ERP as a vital tool for
                 organizational competition as it integrates dispersed
                 organizational systems and enables flawless
                 transactions and production. This review examines
                 studies investigating Critical Success Factors (CSFs)
                 in implementing Enterprise Resource Planning (ERP)
                 systems. Keywords relating to the theme of this study
                 were defined and used to search known Web engines and
                 journal databases for studies on both implementing ERP
                 systems per se and integrating ERP systems with other
                 well- known systems (e.g., SCM, CRM) whose importance
                 to business organizations and academia is acknowledged
                 to work in a complementary fashion. A total of 341
                 articles were reviewed to address three main goals.
                 This study structures previous research by presenting a
                 comprehensive taxonomy of CSFs in the area of ERP.
                 Second, it maps studies, identified through an
                 exhaustive and comprehensive literature review, to
                 different dimensions and facets of ERP system
                 implementation. Third, it presents studies
                 investigating CSFs in terms of a specific ERP lifecycle
                 phase and across the entire ERP life cycle. This study
                 not only reviews articles in which an ERP system is the
                 sole or primary field of research, but also articles
                 that refer to an integration of ERP systems and other
                 popular systems (e.g., SCM, CRM). Finally it provides a
                 comprehensive bibliography of the articles published
                 during this period that can serve as a guide for future
                 research.",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kritikos:2013:SSQ,
  author =       "Kyriakos Kritikos and Barbara Pernici and Pierluigi
                 Plebani and Cinzia Cappiello and Marco Comuzzi and
                 Salima Benrernou and Ivona Brandic and Attila
                 Kert{\'e}sz and Michael Parkin and Manuel Carro",
  title =        "A survey on service quality description",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "1:1--1:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522969",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Quality of service (QoS) can be a critical element for
                 achieving the business goals of a service provider, for
                 the acceptance of a service by the user, or for
                 guaranteeing service characteristics in a composition
                 of services, where a service is defined as either a
                 software or a software-support (i.e., infrastructural)
                 service which is available on any type of network or
                 electronic channel. The goal of this article is to
                 compare the approaches to QoS description in the
                 literature, where several models and metamodels are
                 included. consider a large spectrum of models and
                 metamodels to describe service quality, ranging from
                 ontological approaches to define quality measures,
                 metrics, and dimensions, to metamodels enabling the
                 specification of quality-based service requirements and
                 capabilities as well as of SLAs (Service-Level
                 Agreements) and SLA templates for service provisioning.
                 Our survey is performed by inspecting the
                 characteristics of the available approaches to reveal
                 which are the consolidated ones and which are the ones
                 specific to given aspects and to analyze where the need
                 for further research and investigation lies. The
                 approaches here illustrated have been selected based on
                 a systematic review of conference proceedings and
                 journals spanning various research areas in computer
                 science and engineering, including: distributed,
                 information, and telecommunication systems, networks
                 and security, and service-oriented and grid
                 computing.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yenikaya:2013:KVR,
  author =       "Sibel Yenikaya and G{\"o}khan Yenikaya and Ekrem
                 D{\"u}ven",
  title =        "Keeping the vehicle on the road: a survey on on-road
                 lane detection systems",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "2:1--2:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522970",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The development of wireless sensor networks, such as
                 researchers Advanced Driver Assistance Systems (ADAS)
                 requires the ability to analyze the road scene just
                 like a human does. Road scene analysis is an essential,
                 complex, and challenging task and it consists of: road
                 detection (which includes the localization of the road,
                 the determination of the relative position between
                 vehicle and road, and the analysis of the vehicle's
                 heading direction) and obstacle detection (which is
                 mainly based on localizing possible obstacles on the
                 vehicle's path). The detection of the road borders, the
                 estimation of the road geometry, and the localization
                 of the vehicle are essential tasks in this context
                 since they are required for the lateral and
                 longitudinal control of the vehicle. Within this field,
                 on-board vision has been widely used since it has many
                 advantages (higher resolution, low power consumption,
                 low cost, easy aesthetic integration, and nonintrusive
                 nature) over other active sensors such as RADAR or
                 LIDAR. At first glance the problem of detecting the
                 road geometry from visual information seems simple and
                 early works in this field were quickly rewarded with
                 promising results. However, the large variety of
                 scenarios and the high rates of success demanded by the
                 industry have kept the lane detection research work
                 alive. In this article a comprehensive review of
                 vision-based road detection systems vision is
                 presented.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tamburri:2013:OSS,
  author =       "Damian A. Tamburri and Patricia Lago and Hans van
                 Vliet",
  title =        "Organizational social structures for software
                 engineering",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "3:1--3:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522971",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Software engineering evolved from a rigid process to a
                 dynamic interplay of people (e.g., stakeholders or
                 developers). Organizational and social literature call
                 this interplay an Organizational Social Structure
                 (OSS). Software practitioners still lack a systematic
                 way to select, analyze, and support OSSs best fitting
                 their problems (e.g., software development). We provide
                 the state-of-the-art in OSSs, and discuss mechanisms to
                 support OSS-related decisions in software engineering
                 (e.g., choosing the OSS best fitting development
                 scenarios). Our data supports two conclusions. First,
                 software engineering focused on building software using
                 project teams alone, yet these are one of thirteen OSS
                 flavors from literature. Second, an emerging OSS should
                 be further explored for software development: social
                 networks. This article represents a first glimpse at
                 OSS-aware software engineering, that is, to engineer
                 software using OSSs best fit for the problem.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Roundy:2013:BCO,
  author =       "Kevin A. Roundy and Barton P. Miller",
  title =        "Binary-code obfuscations in prevalent packer tools",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "4:1--4:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522972",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The first steps in analyzing defensive malware are
                 understanding what obfuscations are present in
                 real-world malware binaries, how these obfuscations
                 hinder analysis, and how they can be overcome. While
                 some obfuscations have been reported independently,
                 this survey consolidates the discussion while adding
                 substantial depth and breadth to it. This survey also
                 quantifies the relative prevalence of these
                 obfuscations by using the Dyninst binary analysis and
                 instrumentation tool that was recently extended for
                 defensive malware analysis. The goal of this survey is
                 to encourage analysts to focus on resolving the
                 obfuscations that are most prevalent in real-world
                 malware.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{deNicola:2013:UDS,
  author =       "Rocco de Nicola and Diego Latella and Michele Loreti
                 and Mieke Massink",
  title =        "A uniform definition of stochastic process calculi",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "5:1--5:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522973",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We introduce a unifying framework to provide the
                 semantics of process algebras, including their
                 quantitative variants useful for modeling quantitative
                 aspects of behaviors. The unifying framework is then
                 used to describe some of the most representative
                 stochastic process algebras. This provides a general
                 and clear support for an understanding of their
                 similarities and differences. The framework is based on
                 State to Function Labeled Transition Systems, FuTSs for
                 short, that are state transition structures where each
                 transition is a triple of the form {$ (s, \alpha, P)
                 $}. The first and the second components are the source
                 state, $s$, and the label, $ \alpha $, of the
                 transition, while the third component is the
                 continuation function, {$P$}, associating a value of a
                 suitable type to each state $ s' $. For example, in the
                 case of stochastic process algebras the value of the
                 continuation function on $ s' $ represents the rate of
                 the negative exponential distribution characterizing
                 the duration/delay of the action performed to reach
                 state $ s' $ from $s$. We first provide the semantics
                 of a simple formalism used to describe continuous-time
                 Markov chains, then we model a number of process
                 algebras that permit parallel composition of models
                 according to the two main interaction paradigms
                 (multiparty and one-to-one synchronization). Finally,
                 we deal with formalisms where actions and rates are
                 kept separate and address the issues related to the
                 coexistence of stochastic, probabilistic, and
                 nondeterministic behaviors. For each formalism, we
                 establish the formal correspondence between the FuTSs
                 semantics and its original semantics.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Esposito:2013:SES,
  author =       "Flavio Esposito and Ibrahim Matta and Vatche
                 Ishakian",
  title =        "Slice embedding solutions for distributed service
                 architectures",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "6:1--6:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522974",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Network virtualization provides a novel approach to
                 running multiple concurrent virtual networks over a
                 common physical network infrastructure. From a research
                 perspective, this enables the networking community to
                 concurrently experiment with new Internet architectures
                 and protocols. From a market perspective, on the other
                 hand, this paradigm is appealing as it enables
                 infrastructure service providers to experiment with new
                 business models that range from leasing virtual slices
                 of their infrastructure to hosting multiple concurrent
                 network services. In this article, we present the slice
                 embedding problem and recent developments in the area.
                 A slice is a set of virtual instances spanning a set of
                 physical resources. The embedding problem consists of
                 three main tasks: (1) resource discovery, which
                 involves monitoring the state of the physical
                 resources, (2) virtual network mapping, which involves
                 matching users' requests with the available resources,
                 and (3) allocation, which involves assigning the
                 resources that match the users' requests. We also
                 outline how these three tasks are tightly coupled, and
                 how there exists a wide spectrum of solutions that
                 either solve a particular task or jointly solve
                 multiple tasks along with the interactions among them.
                 To dissect the space of solutions, we introduce three
                 main classification criteria, namely: (1) the type of
                 constraints imposed by the user, (2) the type of
                 dynamics considered in the embedding process, and (3)
                 the allocation strategy adopted. Finally, we conclude
                 with a few interesting research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Araujo:2013:SOM,
  author =       "Aluizio F. R. Araujo and Renata L. M. E. Rego",
  title =        "Self-organizing maps with a time-varying structure",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "7:1--7:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522975",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A number of research studies considering a
                 self-organizing map have been developed since such a
                 map was proposed by Kohonen [1982]. Some of these
                 studies concern SOM-based models that do not use
                 pre-defined structures to produce their mappings. We
                 call these models Self-Organizing Maps with
                 Time-Varying Structure (SOM-TVS). Despite the large
                 number of SOM-TVS models there is not a standard way to
                 describe them. In this article, we propose a framework
                 to describe SOM-TVS models, which we use to describe
                 some of these models and to compare their algorithms,
                 and we present some real-world applications of the
                 models presented.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Radetzki:2013:MFT,
  author =       "Martin Radetzki and Chaochao Feng and Xueqian Zhao and
                 Axel Jantsch",
  title =        "Methods for fault tolerance in networks-on-chip",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "8:1--8:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522976",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Networks-on-Chip constitute the interconnection
                 architecture of future, massively parallel
                 multiprocessors that assemble hundreds to thousands of
                 processing cores on a single chip. Their integration is
                 enabled by ongoing miniaturization of chip
                 manufacturing technologies following Moore's Law. It
                 comes with the downside of the circuit elements'
                 increased susceptibility to failure. Research on
                 fault-tolerant Networks-on-Chip tries to mitigate
                 partial failure and its effect on network performance
                 and reliability by exploiting various forms of
                 redundancy at the suitable network layers. The article
                 at hand reviews the failure mechanisms, fault models,
                 diagnosis techniques, and fault-tolerance methods in
                 on-chip networks, and surveys and summarizes the
                 research of the last ten years. It is structured along
                 three communication layers: the data link, the network,
                 and the transport layers. The most important results
                 are summarized and open research problems and
                 challenges are highlighted to guide future research on
                 this topic.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yahyavi:2013:PPA,
  author =       "Amir Yahyavi and Bettina Kemme",
  title =        "Peer-to-peer architectures for massively multiplayer
                 online games: a survey",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "9:1--9:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522977",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Scalability, fast response time, and low cost are of
                 utmost importance in designing a successful massively
                 multiplayer online game. The underlying architecture
                 plays an important role in meeting these conditions.
                 Peer-to-peer architectures, due to their distributed
                 and collaborative nature, have low infrastructure costs
                 and can achieve high scalability. They can also achieve
                 fast response times by creating direct connections
                 between players. However, these architectures face many
                 challenges. Distributing a game among peers makes
                 maintaining control over the game more complex.
                 Peer-to-peer architectures also tend to be vulnerable
                 to churn and cheating. Moreover, different genres of
                 games have different requirements that should be met by
                 the underlying architecture, rendering the task of
                 designing a general-purpose architecture harder. Many
                 peer-to-peer gaming solutions have been proposed that
                 utilize a range of techniques while using somewhat
                 different and confusing terminologies. This article
                 presents a comprehensive overview of current
                 peer-to-peer solutions for massively multiplayer games
                 using a uniform terminology.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhang:2013:OCD,
  author =       "Xin Zhang and Yee-Hong Yang and Zhiguang Han and Hui
                 Wang and Chao Gao",
  title =        "Object class detection: a survey",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "10:1--10:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522978",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Object class detection, also known as category-level
                 object detection, has become one of the most focused
                 areas in computer vision in the new century. This
                 article attempts to provide a comprehensive survey of
                 the recent technical achievements in this area of
                 research. More than 270 major publications are included
                 in this survey covering different aspects of the
                 research, which include: (i) problem description: key
                 tasks and challenges; (ii) core techniques: appearance
                 modeling, localization strategies, and supervised
                 classification methods; (iii) evaluation issues:
                 approaches, metrics, standard datasets, and
                 state-of-the-art results; and (iv) new development:
                 particularly new approaches and applications motivated
                 by the recent boom of social images. Finally, in
                 retrospect of what has been achieved so far, the survey
                 also discusses what the future may hold for object
                 class detection research.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sakr:2013:FML,
  author =       "Sherif Sakr and Anna Liu and Ayman G. Fayoumi",
  title =        "The family of {MapReduce} and large-scale data
                 processing systems",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "11:1--11:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522979",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the last two decades, the continuous increase of
                 computational power has produced an overwhelming flow
                 of data which has called for a paradigm shift in the
                 computing architecture and large-scale data processing
                 mechanisms. MapReduce is a simple and powerful
                 programming model that enables easy development of
                 scalable parallel applications to process vast amounts
                 of data on large clusters of commodity machines. It
                 isolates the application from the details of running a
                 distributed program such as issues on data
                 distribution, scheduling, and fault tolerance. However,
                 the original implementation of the MapReduce framework
                 had some limitations that have been tackled by many
                 research efforts in several followup works after its
                 introduction. This article provides a comprehensive
                 survey for a family of approaches and mechanisms of
                 large-scale data processing mechanisms that have been
                 implemented based on the original idea of the MapReduce
                 framework and are currently gaining a lot of momentum
                 in both research and industrial communities. We also
                 cover a set of introduced systems that have been
                 implemented to provide declarative programming
                 interfaces on top of the MapReduce framework. In
                 addition, we review several large-scale data processing
                 systems that resemble some of the ideas of the
                 MapReduce framework for different purposes and
                 application scenarios. Finally, we discuss some of the
                 future research directions for implementing the next
                 generation of MapReduce-like solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Noor:2013:TMS,
  author =       "Talal H. Noor and Quan Z. Sheng and Sherali Zeadally
                 and Jian Yu",
  title =        "Trust management of services in cloud environments:
                 obstacles and solutions",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "12:1--12:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522980",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Trust management is one of the most challenging issues
                 in the emerging cloud computing area. Over the past few
                 years, many studies have proposed different techniques
                 to address trust management issues. However, despite
                 these past efforts, several trust management issues
                 such as identification, privacy, personalization,
                 integration, security, and scalability have been mostly
                 neglected and need to be addressed before cloud
                 computing can be fully embraced. In this article, we
                 present an overview of the cloud service models and we
                 survey the main techniques and research prototypes that
                 efficiently support trust management of services in
                 cloud environments. We present a generic analytical
                 framework that assesses existing trust management
                 research prototypes in cloud computing and relevant
                 areas using a set of assessment criteria. Open research
                 issues for trust management in cloud environments are
                 also discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Silva:2013:DSC,
  author =       "Jonathan A. Silva and Elaine R. Faria and Rodrigo C.
                 Barros and Eduardo R. Hruschka and Andr{\'e} C. P. L.
                 F. de Carvalho and Jo{\~a}o Gama",
  title =        "Data stream clustering: a survey",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "13:1--13:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522981",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Data stream mining is an active research area that has
                 recently emerged to discover knowledge from large
                 amounts of continuously generated data. In this
                 context, several data stream clustering algorithms have
                 been proposed to perform unsupervised learning.
                 Nevertheless, data stream clustering imposes several
                 challenges to be addressed, such as dealing with
                 nonstationary, unbounded data that arrive in an online
                 fashion. The intrinsic nature of stream data requires
                 the development of algorithms capable of performing
                 fast and incremental processing of data objects,
                 suitably addressing time and memory limitations. In
                 this article, we present a survey of data stream
                 clustering algorithms, providing a thorough discussion
                 of the main design components of state-of-the-art
                 algorithms. In addition, this work addresses the
                 temporal aspects involved in data stream clustering,
                 and presents an overview of the usually employed
                 experimental methodologies. A number of references are
                 provided that describe applications of data stream
                 clustering in different domains, such as network
                 intrusion detection, sensor networks, and stock market
                 analysis. Information regarding software packages and
                 data repositories are also available for helping
                 researchers and practitioners. Finally, some important
                 issues and open questions that can be subject of future
                 research are discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Vijayalayan:2013:DSS,
  author =       "Kanthaiah Sivapragasam Vijayalayan and Aaron Harwood
                 and Shanika Karunasekera",
  title =        "Distributed scheduling schemes for wireless mesh
                 networks: a survey",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "1",
  pages =        "14:1--14:??",
  month =        oct,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2522968.2522982",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 1 18:27:34 MDT 2013",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "An efficient scheduling scheme is a crucial part of
                 Wireless Mesh Networks (WMNs)-an emerging communication
                 infrastructure solution for autonomy, scalability,
                 higher throughput, lower delay metrics, energy
                 efficiency, and other service-level guarantees.
                 Distributed schedulers are preferred due to better
                 scalability, smaller setup delays, smaller management
                 overheads, no single point of failure, and for avoiding
                 bottlenecks. Based on the sequence in which nodes
                 access the shared medium, repetitiveness, and
                 determinism, distributed schedulers that are supported
                 by wireless mesh standards can be classified as either
                 random, pseudo-random, or cyclic schemes. We performed
                 qualitative and quantitative studies that show the
                 strengths and weaknesses of each category, and how the
                 schemes complement each other. We discuss how wireless
                 standards with mesh definitions have evolved by
                 incorporating and enhancing one or more of these
                 schemes. Emerging trends and research problems
                 remaining for future research also have been
                 identified.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sen:2013:SSD,
  author =       "Soumya Sen and Carlee Joe-Wong and Sangtae Ha and Mung
                 Chiang",
  title =        "A survey of smart data pricing: Past proposals,
                 current plans, and future trends",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "15:1--15:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543582",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Traditionally, network operators have used simple
                 flat-rate broadband data plans for both wired and
                 wireless network access. But today, with the popularity
                 of mobile devices and exponential growth of apps,
                 videos, and clouds, service providers are gradually
                 moving toward more sophisticated pricing schemes. This
                 decade will therefore likely witness a major change in
                 the ways in which network resources are managed, and
                 the role of economics in allocating these resources.
                 This survey reviews some of the well-known past
                 broadband pricing proposals (both static and dynamic),
                 including their current realizations in various
                 consumer data plans around the world, and discusses
                 several research problems and open questions. By
                 exploring the benefits and challenges of pricing data,
                 this article attempts to facilitate both the industrial
                 and the academic communities' efforts in understanding
                 the existing literature, recognizing new trends, and
                 shaping an appropriate and timely research agenda.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kermarrec:2013:XPP,
  author =       "Anne-Marie Kermarrec and Peter Triantafillou",
  title =        "{XL} peer-to-peer pub\slash sub systems",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "16:1--16:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543583",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Increasingly, one of the most prominent ways to
                 disseminate information on the Web is through
                 ``notifications'' (also known as alerts), and as such
                 they are at the core of many large-scale applications.
                 For instance, users are notified of articles in which
                 they are interested through RSS feeds, of posts from
                 their friends through social networks, or of
                 recommendation generated by various sites. Event
                 notification usually relies on the so-called
                 Publish-Subscribe (P ub/Sub) communication paradigm. In
                 Pub/Sub systems, subscribers sign up for events or
                 classes of events in order to be asynchronously
                 notified afterward by the system. The size of such
                 systems (with respect to events and subscriptions)
                 keeps growing, and providing scalable implementations
                 of Pub/Sub systems is extremely challenging. Although
                 there exist popular examples of centralized Pub/Sub
                 systems that currently support a large number of
                 subscribers, such as online social networks, they
                 periodically face formidable challenges due to peak
                 loads and do not always offer a support for fine-grain
                 subscriptions. In fact, providing scalability along
                 with expressiveness in the subscription patterns calls
                 for distributed implementations of Pub/Sub systems. In
                 parallel, peer-to-peer (P2P) overlay networks have
                 emerged, providing a sound and highly scalable network
                 foundation upon which to build distributed applications
                 including Pub/Sub systems. In this article, we focus on
                 fully decentralized (P2P), highly scalable, P ub/Sub
                 systems. More specifically, we investigate how Pub/Sub
                 and P2P research can be integrated. We define the
                 design space and explore it in a systematic way. We
                 expose an understanding of available design choices;
                 provide a comprehensive classification and
                 understanding of prominent P2P Pub/Sub systems,
                 positioning them against the design dimensions; and
                 highlight correlations between and implications,
                 benefits, and shortcomings of design alternatives.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Castro:2013:TGT,
  author =       "Pablo Samuel Castro and Daqing Zhang and Chao Chen and
                 Shijian Li and Gang Pan",
  title =        "From taxi {GPS} traces to social and community
                 dynamics: a survey",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "17:1--17:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543584",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Vehicles equipped with GPS localizers are an important
                 sensory device for examining people's movements and
                 activities. Taxis equipped with GPS localizers serve
                 the transportation needs of a large number of people
                 driven by diverse needs; their traces can tell us where
                 passengers were picked up and dropped off, which route
                 was taken, and what steps the driver took to find a new
                 passenger. In this article, we provide an exhaustive
                 survey of the work on mining these traces. We first
                 provide a formalization of the data sets, along with an
                 overview of different mechanisms for preprocessing the
                 data. We then classify the existing work into three
                 main categories: social dynamics, traffic dynamics and
                 operational dynamics. Social dynamics refers to the
                 study of the collective behaviour of a city's
                 population, based on their observed movements; Traffic
                 dynamics studies the resulting flow of the movement
                 through the road network; Operational dynamics refers
                 to the study and analysis of taxi driver's modus
                 operandi. We discuss the different problems currently
                 being researched, the various approaches proposed, and
                 suggest new avenues of research. Finally, we present a
                 historical overview of the research work in this field
                 and discuss which areas hold most promise for future
                 research.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wu:2013:CPC,
  author =       "Qiong Wu and Chunyan Miao",
  title =        "Curiosity: From psychology to computation",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "18:1--18:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543585",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Literature in psychology has shown that curiosity is
                 the intrinsic motivation for exploration, learning, and
                 creativity. Various forms of computational curiosity
                 have been developed to provide artificial beings with
                 desirable functions, such as detecting and adapting to
                 novel inputs, making decisions related to aesthetics,
                 and achieving pedagogical purposes. This article
                 reviews existing models of computational curiosity in
                 light of psychological theories that are beneficial to
                 building models of human cognition and designing
                 human-like agents. We first study theories in
                 psychology to shed light on the underpinnings of human
                 curiosity, where a two-step process is proposed to
                 serve as a general model for analyzing curiosity.
                 Subsequently, existing models of computational
                 curiosity are reviewed under the proposed framework. We
                 conclude the review by identifying 4 key research
                 issues in computational curiosity and 10 important
                 research areas where computational curiosity could
                 bring significant impact.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Csapo:2013:OAR,
  author =       "{\'A}d{\'a}m Csap{\'o} and Gy{\"o}rgy Wers{\'e}nyi",
  title =        "Overview of auditory representations in human-machine
                 interfaces",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "19:1--19:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543586",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In recent years, a large number of research projects
                 have focused on the use of auditory representations in
                 a broadened scope of application scenarios. Results in
                 such projects have shown that auditory elements can
                 effectively complement other modalities not only in the
                 traditional desktop computer environment but also in
                 virtual and augmented reality, mobile platforms, and
                 other kinds of novel computing environments. The
                 successful use of auditory representations in this
                 growing number of application scenarios has in turn
                 prompted researchers to rediscover the more basic
                 auditory representations and extend them in various
                 directions. The goal of this article is to survey both
                 classical auditory representations (e.g., auditory
                 icons and earcons) and those auditory representations
                 that have been created as extensions to earlier
                 approaches, including speech-based sounds (e.g.,
                 spearcons and spindex representations), emotionally
                 grounded sounds (e.g., auditory emoticons and
                 spemoticons), and various other sound types used to
                 provide sonifications in practical scenarios. The
                 article concludes by outlining the latest trends in
                 auditory interface design and providing examples of
                 these trends.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mazurczyk:2013:VSD,
  author =       "Wojciech Mazurczyk",
  title =        "{VoIP} steganography and its detection --- a survey",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "20:1--20:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543587",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Steganography is an ancient art that encompasses
                 various techniques of information hiding, the aim of
                 which is to embed secret information into a carrier
                 message. Steganographic methods are usually aimed at
                 hiding the very existence of the communication. Due to
                 the rise in popularity of IP telephony, together with
                 the large volume of data and variety of protocols
                 involved, it is currently attracting the attention of
                 the research community as a perfect carrier for
                 steganographic purposes. This article is a first survey
                 of the existing Voice over IP (VoIP) steganography
                 methods and their countermeasures.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gammie:2013:SDC,
  author =       "Peter Gammie",
  title =        "Synchronous digital circuits as functional programs",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "21:1--21:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543588",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Functional programming techniques have been used to
                 describe synchronous digital circuits since the early
                 1980s. Here we survey the systems and formal
                 underpinnings that constitute this tradition. We
                 situate these techniques with respect to other formal
                 methods for hardware design and discuss the work yet to
                 be done.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ghosh:2013:UPV,
  author =       "Subir K. Ghosh and Partha P. Goswami",
  title =        "Unsolved problems in visibility graphs of points,
                 segments, and polygons",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "22:1--22:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543589",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In this survey article, we present open problems and
                 conjectures on visibility graphs of points, segments,
                 and polygons along with necessary backgrounds for
                 understanding them.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Renner:2013:PED,
  author =       "Rebekka S. Renner and Boris M. Velichkovsky and Jens
                 R. Helmert",
  title =        "The perception of egocentric distances in virtual
                 environments --- a review",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "23:1--23:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543590",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Over the last 20 years research has been done on the
                 question of how egocentric distances, i.e., the
                 subjectively reported distance from a human observer to
                 an object, are perceived in virtual environments. This
                 review surveys the existing literature on empirical
                 user studies on this topic. In summary, there is a mean
                 estimation of egocentric distances in virtual
                 environments of about 74\% of the modeled distances.
                 Many factors possibly influencing distance estimates
                 were reported in the literature. We arranged these
                 factors into four groups, namely measurement methods,
                 technical factors, compositional factors, and human
                 factors. The research on these factors is summarized,
                 conclusions are drawn, and promising areas for future
                 research are outlined.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Barkati:2013:SPA,
  author =       "Karim Barkati and Pierre Jouvelot",
  title =        "Synchronous programming in audio processing: a lookup
                 table oscillator case study",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "24:1--24:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543591",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/pvm.bib",
  abstract =     "The adequacy of a programming language to a given
                 software project or application domain is often
                 considered a key factor of success in software
                 development and engineering, even though little
                 theoretical or practical information is readily
                 available to help make an informed decision. In this
                 article, we address a particular version of this issue
                 by comparing the adequacy of general-purpose
                 synchronous programming languages to more
                 Domain-Specific Languages (DSLs) in the field of
                 computer music. More precisely, we implemented and
                 tested the same lookup table oscillator example
                 program, one of the most classical algorithms for sound
                 synthesis, using a selection of significant synchronous
                 programming languages, half of which designed as
                 specific music languages-Csound, Pure Data,
                 SuperCollider, ChucK, Faust-and the other half being
                 general synchronous formalisms-Signal, Lustre, Esterel,
                 Lucid Synchrone and C with the OpenMP Stream Extension
                 (Matlab/Octave is used for the initial specification).
                 The advantages of these two approaches are discussed,
                 providing insights to language designers and possibly
                 software developers of both communities regarding
                 programming languages design for the audio domain.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yang:2013:RCI,
  author =       "Zheng Yang and Zimu Zhou and Yunhao Liu",
  title =        "From {RSSI} to {CSI}: Indoor localization via channel
                 response",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "25:1--25:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543592",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The spatial features of emitted wireless signals are
                 the basis of location distinction and determination for
                 wireless indoor localization. Available in mainstream
                 wireless signal measurements, the Received Signal
                 Strength Indicator (RSSI) has been adopted in vast
                 indoor localization systems. However, it suffers from
                 dramatic performance degradation in complex situations
                 due to multipath fading and temporal dynamics.
                 Break-through techniques resort to finer-grained
                 wireless channel measurement than RSSI. Different from
                 RSSI, the PHY layer power feature, channel response, is
                 able to discriminate multipath characteristics, and
                 thus holds the potential for the convergence of
                 accurate and pervasive indoor localization. Channel
                 State Information (CSI, reflecting channel response in
                 802.11 a/g/n) has attracted many research efforts and
                 some pioneer works have demonstrated submeter or even
                 centimeter-level accuracy. In this article, we survey
                 this new trend of channel response in localization. The
                 differences between CSI and RSSI are highlighted with
                 respect to network layering, time resolution, frequency
                 resolution, stability, and accessibility. Furthermore,
                 we investigate a large body of recent works and
                 classify them overall into three categories according
                 to how to use CSI. For each category, we emphasize the
                 basic principles and address future directions of
                 research in this new and largely open area.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pedro:2013:UGP,
  author =       "Ricardo Wandr{\'e} Dias Pedro and F{\'a}tima L. S.
                 Nunes and Ariane Machado-Lima",
  title =        "Using grammars for pattern recognition in images: a
                 systematic review",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "26:1--26:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543593",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Grammars are widely used to describe string languages
                 such as programming and natural languages and, more
                 recently, biosequences. Moreover, since the 1980s
                 grammars have been used in computer vision and related
                 areas. Some factors accountable for this increasing use
                 regard its relatively simple understanding and its
                 ability to represent some semantic pattern models found
                 in images, both spatially and temporally. The objective
                 of this article is to present an overview regarding the
                 use of syntactic pattern recognition methods in image
                 representations in several applications. To achieve
                 this purpose, we used a systematic review process to
                 investigate the main digital libraries in the area and
                 to document the phases of the study in order to allow
                 the auditing and further investigation. The results
                 indicated that in some of the studies retrieved,
                 manually created grammars were used to comply with a
                 particular purpose. Other studies performed a learning
                 process of the grammatical rules. In addition, this
                 article also points out still unexplored research
                 opportunities in the literature.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pereira:2013:SAC,
  author =       "Orlando R. E. Pereira and Joel J. P. C. Rodrigues",
  title =        "Survey and analysis of current mobile learning
                 applications and technologies",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "27:1--27:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543594",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Distance learning, electronic learning, and mobile
                 learning offer content, methods, and technologies that
                 decrease the limitations of traditional education.
                 Mobile learning (m-learning) is an extension of
                 distance education, supported by mobile devices
                 equipped with wireless technologies. It is an emerging
                 learning model and process that requires new forms of
                 teaching, learning, contents, and dynamics between
                 actors. In order to ascertain the current state of
                 knowledge and research, an extensive review of the
                 literature in m-learning has been undertaken to
                 identify and harness potential factors and gaps in
                 implementation. This article provides a critical
                 analysis of m-learning projects and related literature,
                 presenting the findings of this aforementioned
                 analysis. It seeks to facilitate the inquiry into the
                 following question: ``What is possible in m-learning
                 using recent technologies?'' The analysis will be
                 divided into two main parts: applications from the
                 recent online mobile stores and operating system
                 standalone applications.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Herraiz:2013:ELS,
  author =       "Israel Herraiz and Daniel Rodriguez and Gregorio
                 Robles and Jesus M. Gonzalez-Barahona",
  title =        "The evolution of the laws of software evolution: a
                 discussion based on a systematic literature review",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "28:1--28:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543595",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "After more than 40 years of life, software evolution
                 should be considered as a mature field. However,
                 despite such a long history, many research questions
                 still remain open, and controversial studies about the
                 validity of the laws of software evolution are common.
                 During the first part of these 40 years, the laws
                 themselves evolved to adapt to changes in both the
                 research and the software industry environments. This
                 process of adaption to new paradigms, standards, and
                 practices stopped about 15 years ago, when the laws
                 were revised for the last time. However, most
                 controversial studies have been raised during this
                 latter period. Based on a systematic and comprehensive
                 literature review, in this article, we describe how and
                 when the laws, and the software evolution field,
                 evolved. We also address the current state of affairs
                 about the validity of the laws, how they are perceived
                 by the research community, and the developments and
                 challenges that are likely to occur in the coming
                 years.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Vezzani:2013:PRS,
  author =       "Roberto Vezzani and Davide Baltieri and Rita
                 Cucchiara",
  title =        "People reidentification in surveillance and forensics:
                 a survey",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "2",
  pages =        "29:1--29:??",
  month =        nov,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2543581.2543596",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:35:29 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The field of surveillance and forensics research is
                 currently shifting focus and is now showing an ever
                 increasing interest in the task of people
                 reidentification. This is the task of assigning the
                 same identifier to all instances of a particular
                 individual captured in a series of images or videos,
                 even after the occurrence of significant gaps over time
                 or space. People reidentification can be a useful tool
                 for people analysis in security as a data association
                 method for long-term tracking in surveillance. However,
                 current identification techniques being utilized
                 present many difficulties and shortcomings. For
                 instance, they rely solely on the exploitation of
                 visual cues such as color, texture, and the object's
                 shape. Despite the many advances in this field,
                 reidentification is still an open problem. This survey
                 aims to tackle all the issues and challenging aspects
                 of people reidentification while simultaneously
                 describing the previously proposed solutions for the
                 encountered problems. This begins with the first
                 attempts of holistic descriptors and progresses to the
                 more recently adopted 2D and 3D model-based approaches.
                 The survey also includes an exhaustive treatise of all
                 the aspects of people reidentification, including
                 available datasets, evaluation metrics, and
                 benchmarking.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Medina:2013:SMM,
  author =       "Violeta Medina and Juan Manuel Garc{\'\i}a",
  title =        "A survey of migration mechanisms of virtual machines",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "30:1--30:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2492705",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "In the virtualization area, replication has been
                 considered as a mechanism to provide high availability.
                 A high-availability system should be active most of the
                 time, and this is the reason that its design should
                 consider almost zero downtime and a minimal human
                 intervention if a recovery process is demanded. Several
                 migration and replication mechanisms have been
                 developed to provide high availability inside
                 virtualized environments. In this article, a survey of
                 migration mechanisms is reported. These approaches are
                 classified in three main classes: process migration,
                 memory migration, and suspend/resume migration.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:2013:DDM,
  author =       "Feng Li and Beng Chin Ooi and M. Tamer {\"O}zsu and
                 Sai Wu",
  title =        "Distributed data management using {MapReduce}",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "31:1--31:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2503009",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "MapReduce is a framework for processing and managing
                 large-scale datasets in a distributed cluster, which
                 has been used for applications such as generating
                 search indexes, document clustering, access log
                 analysis, and various other forms of data analytics.
                 MapReduce adopts a flexible computation model with a
                 simple interface consisting of map and reduce functions
                 whose implementations can be customized by application
                 developers. Since its introduction, a substantial
                 amount of research effort has been directed toward
                 making it more usable and efficient for supporting
                 database-centric operations. In this article, we aim to
                 provide a comprehensive review of a wide range of
                 proposals and systems that focusing fundamentally on
                 the support of distributed data management and
                 processing using the MapReduce framework.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bellucci:2013:LHI,
  author =       "Andrea Bellucci and Alessio Malizia and Ignacio Aedo",
  title =        "Light on horizontal interactive surfaces: Input space
                 for tabletop computing",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "32:1--32:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2500467",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the last 25 years we have witnessed the rise and
                 growth of interactive tabletop research, both in
                 academic and in industrial settings. The rising demand
                 for the digital support of human activities motivated
                 the need to bring computational power to table
                 surfaces. In this article, we review the state of the
                 art of tabletop computing, highlighting core aspects
                 that frame the input space of interactive tabletops:
                 (a) developments in hardware technologies that have
                 caused the proliferation of interactive horizontal
                 surfaces and (b) issues related to new classes of
                 interaction modalities (multitouch, tangible, and
                 touchless). A classification is presented that aims to
                 give a detailed view of the current development of this
                 research area and define opportunities and challenges
                 for novel touch- and gesture-based interactions between
                 the human and the surrounding computational
                 environment.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bulling:2013:THA,
  author =       "Andreas Bulling and Ulf Blanke and Bernt Schiele",
  title =        "A tutorial on human activity recognition using
                 body-worn inertial sensors",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "33:1--33:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2499621",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The last 20 years have seen ever-increasing research
                 activity in the field of human activity recognition.
                 With activity recognition having considerably matured,
                 so has the number of challenges in designing,
                 implementing, and evaluating activity recognition
                 systems. This tutorial aims to provide a comprehensive
                 hands-on introduction for newcomers to the field of
                 human activity recognition. It specifically focuses on
                 activity recognition using on-body inertial sensors. We
                 first discuss the key research challenges that human
                 activity recognition shares with general pattern
                 recognition and identify those challenges that are
                 specific to human activity recognition. We then
                 describe the concept of an Activity Recognition Chain
                 (ARC) as a general-purpose framework for designing and
                 evaluating activity recognition systems. We detail each
                 component of the framework, provide references to
                 related research, and introduce the best practice
                 methods developed by the activity recognition research
                 community. We conclude with the educational example
                 problem of recognizing different hand gestures from
                 inertial sensors attached to the upper and lower arm.
                 We illustrate how each component of this framework can
                 be implemented for this specific activity recognition
                 problem and demonstrate how different implementations
                 compare and how they impact overall recognition
                 performance.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Furia:2013:LIA,
  author =       "Carlo A. Furia and Bertrand Meyer and Sergey Velder",
  title =        "Loop invariants: Analysis, classification, and
                 examples",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "34:1--34:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2506375",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Software verification has emerged as a key concern for
                 ensuring the continued progress of information
                 technology. Full verification generally requires, as a
                 crucial step, equipping each loop with a ``loop
                 invariant.'' Beyond their role in verification, loop
                 invariants help program understanding by providing
                 fundamental insights into the nature of algorithms. In
                 practice, finding sound and useful invariants remains a
                 challenge. Fortunately, many invariants seem
                 intuitively to exhibit a common flavor. Understanding
                 these fundamental invariant patterns could therefore
                 provide help for understanding and verifying a large
                 variety of programs. We performed a systematic
                 identification, validation, and classification of loop
                 invariants over a range of fundamental algorithms from
                 diverse areas of computer science. This article
                 analyzes the patterns, as uncovered in this study,
                 governing how invariants are derived from
                 postconditions; it proposes a taxonomy of invariants
                 according to these patterns; and it presents its
                 application to the algorithms reviewed. The discussion
                 also shows the need for high-level specifications based
                 on ``domain theory.'' It describes how the invariants
                 and the corresponding algorithms have been mechanically
                 verified using an automated program prover; the proof
                 source files are available. The contributions also
                 include suggestions for invariant inference and for
                 model-based specification.",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:2013:OPS,
  author =       "Bin Li and Steven C. H. Hoi",
  title =        "Online portfolio selection: a survey",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "35:1--35:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2512962",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Online portfolio selection is a fundamental problem in
                 computational finance, which has been extensively
                 studied across several research communities, including
                 finance, statistics, artificial intelligence, machine
                 learning, and data mining. This article aims to provide
                 a comprehensive survey and a structural understanding
                 of online portfolio selection techniques published in
                 the literature. From an online machine learning
                 perspective, we first formulate online portfolio
                 selection as a sequential decision problem, and then we
                 survey a variety of state-of-the-art approaches, which
                 are grouped into several major categories, including
                 benchmarks, Follow-the-Winner approaches,
                 Follow-the-Loser approaches, Pattern-Matching--based
                 approaches, and Meta-Learning Algorithms. In addition
                 to the problem formulation and related algorithms, we
                 also discuss the relationship of these algorithms with
                 the capital growth theory so as to better understand
                 the similarities and differences of their underlying
                 trading ideas. This article aims to provide a timely
                 and comprehensive survey for both machine learning and
                 data mining researchers in academia and quantitative
                 portfolio managers in the financial industry to help
                 them understand the state of the art and facilitate
                 their research and practical applications. We also
                 discuss some open issues and evaluate some emerging new
                 trends for future research.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ma:2013:SAT,
  author =       "Dongzhe Ma and Jianhua Feng and Guoliang Li",
  title =        "A survey of address translation technologies for flash
                 memories",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "36:1--36:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2512961",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Flash is a type of Electronically Erasable
                 Programmable Read-Only Memory (EEPROM). Different from
                 traditional magnetic disks, flash memories have no
                 moving parts and are purely electronic devices, giving
                 them unique advantages, such as lower access latency,
                 lower power consumption, higher density, shock
                 resistance, and lack of noise. However, existing
                 applications cannot run directly on flash memories due
                 to their special characteristics. Flash Translation
                 Layer (FTL) is a software layer built on raw flash
                 memories that emulates a normal block device like
                 magnetic disks. Primary functionalities of the FTL
                 include address translation, garbage collection, and
                 wear leveling. This survey focuses on address
                 translation technologies and provides a broad overview
                 of existing schemes described in patents, journals, and
                 conference proceedings.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Helbig:2013:BDM,
  author =       "Mard{\'e} Helbig and Andries P. Engelbrecht",
  title =        "Benchmarks for dynamic multi-objective optimisation
                 algorithms",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "37:1--37:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2517649",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Algorithms that solve Dynamic Multi-Objective
                 Optimisation Problems (DMOOPs) should be tested on
                 benchmark functions to determine whether the algorithm
                 can overcome specific difficulties that can occur in
                 real-world problems. However, for Dynamic
                 Multi-Objective Optimisation (DMOO), no standard
                 benchmark functions are used. A number of DMOOPs have
                 been proposed in recent years. However, no
                 comprehensive overview of DMOOPs exist in the
                 literature. Therefore, choosing which benchmark
                 functions to use is not a trivial task. This article
                 seeks to address this gap in the DMOO literature by
                 providing a comprehensive overview of proposed DMOOPs,
                 and proposing characteristics that an ideal DMOO
                 benchmark function suite should exhibit. In addition,
                 DMOOPs are proposed for each characteristic.
                 Shortcomings of current DMOOPs that do not address
                 certain characteristics of an ideal benchmark suite are
                 highlighted. These identified shortcomings are
                 addressed by proposing new DMOO benchmark functions
                 with complicated Pareto-Optimal Sets (POSs), and
                 approaches to develop DMOOPs with either an isolated or
                 deceptive Pareto-Optimal Front (POF). In addition, DMOO
                 application areas and real-world DMOOPs are
                 discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mei:2013:MSR,
  author =       "Tao Mei and Yong Rui and Shipeng Li and Qi Tian",
  title =        "Multimedia search reranking: a literature survey",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "38:1--38:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2536798",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The explosive growth and widespread accessibility of
                 community-contributed media content on the Internet
                 have led to a surge of research activity in multimedia
                 search. Approaches that apply text search techniques
                 for multimedia search have achieved limited success as
                 they entirely ignore visual content as a ranking
                 signal. Multimedia search reranking, which reorders
                 visual documents based on multimodal cues to improve
                 initial text-only searches, has received increasing
                 attention in recent years. Such a problem is
                 challenging because the initial search results often
                 have a great deal of noise. Discovering knowledge or
                 visual patterns from such a noisy ranked list to guide
                 the reranking process is difficult. Numerous techniques
                 have been developed for visual search re-ranking. The
                 purpose of this paper is to categorize and evaluate
                 these algorithms. We also discuss relevant issues such
                 as data collection, evaluation metrics, and
                 benchmarking. We conclude with several promising
                 directions for future research.",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fontana:2013:MTA,
  author =       "Peter Fontana and Rance Cleaveland",
  title =        "A menagerie of timed automata",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "40:1--40:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2518102",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See corrections \cite{Keiren:2017:CMT}.",
  abstract =     "Timed automata are state-machine--like structures used
                 to model real-time systems. Since their invention in
                 the early 1990s, a number of often subtly differing
                 variants have appeared in the literature; one of this
                 article's key contributions is defining, highlighting,
                 and reconciling these differences. The article achieves
                 this by defining a baseline theory of timed automata,
                 characterizing each variant both syntactically and
                 semantically, and giving, when possible, syntactic and
                 semantic conversion to and from the baseline version.
                 This article also surveys various extensions to the
                 basic timed-automaton framework.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kopliku:2013:ASN,
  author =       "Arlind Kopliku and Karen Pinel-Sauvagnat and Mohand
                 Boughanem",
  title =        "Aggregated search: a new information retrieval
                 paradigm",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "41:1--41:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2523817",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Traditional search engines return ranked lists of
                 search results. It is up to the user to scroll this
                 list, scan within different documents, and assemble
                 information that fulfill his/her information need.
                 Aggregated search represents a new class of approaches
                 where the information is not only retrieved but also
                 assembled. This is the current evolution in Web search,
                 where diverse content (images, videos, etc.) and
                 relational content (similar entities, features) are
                 included in search results. In this survey, we propose
                 a simple analysis framework for aggregated search and
                 an overview of existing work. We start with related
                 work in related domains such as federated search,
                 natural language generation, and question answering.
                 Then we focus on more recent trends, namely cross
                 vertical aggregated search and relational aggregated
                 search, which are already present in current Web
                 search.",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Costa-Jussa:2013:SMT,
  author =       "Marta R. Costa-Juss{\`a} and Mireia Farr{\'u}s",
  title =        "Statistical machine translation enhancements through
                 linguistic levels: a survey",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "3",
  pages =        "42:1--42:??",
  month =        jan,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2518130",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 6 07:33:31 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Machine translation can be considered a highly
                 interdisciplinary and multidisciplinary field because
                 it is approached from the point of view of human
                 translators, engineers, computer scientists,
                 mathematicians, and linguists. One of the most popular
                 approaches is the Statistical Machine Translation (smt)
                 approach, which tries to cover translation in a
                 holistic manner by learning from parallel corpus
                 aligned at the sentence level. However, with this basic
                 approach, there are some issues at each written
                 linguistic level (i.e., orthographic, morphological,
                 lexical, syntactic and semantic) that remain unsolved.
                 Research in smt has continuously been focused on
                 solving the different linguistic levels challenges.
                 This article represents a survey of how the smt has
                 been enhanced to perform translation correctly at all
                 linguistic levels.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rodriguez:2013:SOH,
  author =       "Natalia D{\'\i}az Rodr{\'\i}guez and M. P. Cu{\'e}llar
                 and Johan Lilius and Miguel Delgado Calvo-Flores",
  title =        "A survey on ontologies for human behavior
                 recognition",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "4",
  pages =        "43:1--43:??",
  month =        mar,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2523819",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Mar 21 18:13:35 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Describing user activity plays an essential role in
                 ambient intelligence. In this work, we review different
                 methods for human activity recognition, classified as
                 data-driven and knowledge-based techniques. We focus on
                 context ontologies whose ultimate goal is the tracking
                 of human behavior. After studying upper and domain
                 ontologies, both useful for human activity
                 representation and inference, we establish an
                 evaluation criterion to assess the suitability of the
                 different candidate ontologies for this purpose. As a
                 result, any missing features, which are relevant for
                 modeling daily human behaviors, are identified as
                 future challenges.",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hirzel:2013:CSP,
  author =       "Martin Hirzel and Robert Soul{\'e} and Scott Schneider
                 and Bugra Gedik and Robert Grimm",
  title =        "A catalog of stream processing optimizations",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "4",
  pages =        "46:1--46:??",
  month =        mar,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2528412",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Mar 21 18:13:35 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Various research communities have independently
                 arrived at stream processing as a programming model for
                 efficient and parallel computing. These communities
                 include digital signal processing, databases, operating
                 systems, and complex event processing. Since each
                 community faces applications with challenging
                 performance requirements, each of them has developed
                 some of the same optimizations, but often with
                 conflicting terminology and unstated assumptions. This
                 article presents a survey of optimizations for stream
                 processing. It is aimed both at users who need to
                 understand and guide the system's optimizer and at
                 implementers who need to make engineering tradeoffs. To
                 consolidate terminology, this article is organized as a
                 catalog, in a style similar to catalogs of design
                 patterns or refactorings. To make assumptions explicit
                 and help understand tradeoffs, each optimization is
                 presented with its safety constraints (when does it
                 preserve correctness?) and a profitability experiment
                 (when does it improve performance?). We hope that this
                 survey will help future streaming system builders to
                 stand on the shoulders of giants from not just their
                 own community.",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Orgerie:2013:STI,
  author =       "Anne-Cecile Orgerie and Marcos Dias de Assuncao and
                 Laurent Lefevre",
  title =        "A survey on techniques for improving the energy
                 efficiency of large-scale distributed systems",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "4",
  pages =        "47:1--47:??",
  month =        mar,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2532637",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Mar 21 18:13:35 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The great amounts of energy consumed by large-scale
                 computing and network systems, such as data centers and
                 supercomputers, have been a major source of concern in
                 a society increasingly reliant on information
                 technology. Trying to tackle this issue, the research
                 community and industry have proposed myriad techniques
                 to curb the energy consumed by IT systems. This article
                 surveys techniques and solutions that aim to improve
                 the energy efficiency of computing and network
                 resources. It discusses methods to evaluate and model
                 the energy consumed by these resources, and describes
                 techniques that operate at a distributed system level,
                 trying to improve aspects such as resource allocation,
                 scheduling, and network traffic management. This work
                 aims to review the state of the art on energy
                 efficiency and to foster research on schemes to make
                 network and computing resources more efficient.",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Krishna:2013:FTS,
  author =       "C. M. Krishna",
  title =        "Fault-tolerant scheduling in homogeneous real-time
                 systems",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "4",
  pages =        "48:1--48:??",
  month =        mar,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2534028",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Mar 21 18:13:35 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Real-time systems are one of the most important
                 applications of computers, both in commercial terms and
                 in terms of social impact. Increasingly, real-time
                 computers are used to control life-critical
                 applications and need to meet stringent reliability
                 conditions. Since the reliability of a real-time system
                 is related to the probability of meeting its hard
                 deadlines, these reliability requirements translate to
                 the need to meet critical task deadlines with a very
                 high probability. We survey the problem of how to
                 schedule tasks in such a way that deadlines continue to
                 be met despite processor (permanent or transient) or
                 software failure.",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Perez:2013:SSR,
  author =       "H{\'e}ctor P{\'e}rez and J. Javier Guti{\'e}rrez",
  title =        "A survey on standards for real-time distribution
                 middleware",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "4",
  pages =        "49:1--49:??",
  month =        mar,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2532636",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Mar 21 18:13:35 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This survey covers distribution standards oriented to
                 the development of distributed real-time systems.
                 Currently, there are many distribution standards that
                 provide a wide and different set of real-time
                 facilities to control the temporal aspects of
                 applications. Besides giving a general overview of
                 these standards, we describe the real-time mechanisms
                 proposed by each standard to manage both processor and
                 network resources, discuss whether the available
                 facilities are sufficient to guarantee determinism
                 throughout the whole application, and identify a set of
                 features and deployment options that would be desirable
                 in any real-time distribution middleware regardless of
                 its distribution model and standard. The survey
                 identifies open issues and key challenges for future
                 research.",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Navarro:2013:STC,
  author =       "Gonzalo Navarro",
  title =        "Spaces, Trees, and Colors: The algorithmic landscape
                 of document retrieval on sequences",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "4",
  pages =        "52:1--52:??",
  month =        mar,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2535933",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Mar 21 18:13:35 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Document retrieval is one of the best-established
                 information retrieval activities since the '60s,
                 pervading all search engines. Its aim is to obtain,
                 from a collection of text documents, those most
                 relevant to a pattern query. Current technology is
                 mostly oriented to ``natural language'' text
                 collections, where inverted indexes are the preferred
                 solution. As successful as this paradigm has been, it
                 fails to properly handle various East Asian languages
                 and other scenarios where the ``natural language''
                 assumptions do not hold. Inthis survey, we cover the
                 recent research in extending the document retrieval
                 techniques to a broader class of sequence collections,
                 which has applications in bioinformatics, data and web
                 mining, chemoinformatics, software engineering,
                 multimedia information retrieval, and many other
                 fields. We focus on the algorithmic aspects of the
                 techniques, uncovering a rich world of relations
                 between document retrieval challenges and fundamental
                 problems on trees, strings, range queries, discrete
                 geometry, and other areas.",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Henson:2013:MES,
  author =       "Michael Henson and Stephen Taylor",
  title =        "Memory encryption: a survey of existing techniques",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "4",
  pages =        "53:1--53:??",
  month =        mar,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2566673",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Mar 21 18:13:35 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "Memory encryption has yet to be used at the core of
                 operating system designs to provide confidentiality of
                 code and data. As a result, numerous vulnerabilities
                 exist at every level of the software stack. Three
                 general approaches have evolved to rectify this
                 problem. The most popular approach is based on complex
                 hardware enhancements; this allows all encryption and
                 decryption to be conducted within a well-defined
                 trusted boundary. Unfortunately, these designs have not
                 been integrated within commodity processors and have
                 primarily been explored through simulation with very
                 few prototypes. An alternative approach has been to
                 augment existing hardware with operating system
                 enhancements for manipulating keys, providing improved
                 trust. This approach has provided insights into the use
                 of encryption but has involved unacceptable overheads
                 and has not been adopted in commercial operating
                 systems. Finally, specialized industrial devices have
                 evolved, potentially adding coprocessors, to increase
                 security of particular operations in specific operating
                 environments. However, this approach lacks generality
                 and has introduced unexpected vulnerabilities of its
                 own. Recently, memory encryption primitives have been
                 integrated within commodity processors such as the
                 Intel i7, AMD bulldozer, and multiple ARM variants.
                 This opens the door for new operating system designs
                 that provide confidentiality across the entire software
                 stack outside the CPU. To date, little practical
                 experimentation has been conducted, and the
                 improvements in security and associated performance
                 degradation has yet to be quantified. This article
                 surveys the current memory encryption literature from
                 the viewpoint of these central issues.",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mitchell:2013:SID,
  author =       "Robert Mitchell and Ing-Ray Chen",
  title =        "A survey of intrusion detection techniques for
                 cyber-physical systems",
  journal =      j-COMP-SURV,
  volume =       "46",
  number =       "4",
  pages =        "55:1--55:??",
  month =        mar,
  year =         "2013",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2542049",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Mar 21 18:13:35 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Pervasive healthcare systems, smart grids, and
                 unmanned aircraft systems are examples of
                 Cyber-Physical Systems (CPSs) that have become highly
                 integrated in the modern world. As this integration
                 deepens, the importance of securing these systems
                 increases. In order to identify gaps and propose
                 research directions in CPS intrusion detection
                 research, we survey the literature of this area. Our
                 approach is to classify modern CPS Intrusion Detection
                 System (IDS) techniques based on two design dimensions:
                 detection technique and audit material. We summarize
                 advantages and drawbacks of each dimension's options.
                 We also summarize the most and least studied CPS IDS
                 techniques in the literature and provide insight on the
                 effectiveness of IDS techniques as they apply to CPSs.
                 Finally, we identify gaps in CPS IDS research and
                 suggest future research areas.",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chiang:2014:SDM,
  author =       "Yao-Yi Chiang and Stefan Leyk and Craig A. Knoblock",
  title =        "A Survey of Digital Map Processing Techniques",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "1:1--1:??",
  month =        may,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2557423",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed May 21 09:48:38 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Maps depict natural and human-induced changes on earth
                 at a fine resolution for large areas and over long
                 periods of time. In addition, maps-especially
                 historical maps-are often the only information source
                 about the earth as surveyed using geodetic techniques.
                 In order to preserve these unique documents, increasing
                 numbers of digital map archives have been established,
                 driven by advances in software and hardware
                 technologies. Since the early 1980s, researchers from a
                 variety of disciplines, including computer science and
                 geography, have been working on computational methods
                 for the extraction and recognition of geographic
                 features from archived images of maps (digital map
                 processing). The typical result from map processing is
                 geographic information that can be used in spatial and
                 spatiotemporal analyses in a Geographic Information
                 System environment, which benefits numerous research
                 fields in the spatial, social, environmental, and
                 health sciences. However, map processing literature is
                 spread across a broad range of disciplines in which
                 maps are included as a special type of image. This
                 article presents an overview of existing map processing
                 techniques, with the goal of bringing together the past
                 and current research efforts in this interdisciplinary
                 field, to characterize the advances that have been
                 made, and to identify future research directions and
                 opportunities.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Winkler:2014:SPP,
  author =       "Thomas Winkler and Bernhard Rinner",
  title =        "Security and Privacy Protection in Visual Sensor
                 Networks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "2:1--2:??",
  month =        may,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2545883",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed May 21 09:48:38 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Visual sensor networks (VSNs) are receiving a lot of
                 attention in research, and at the same time, commercial
                 applications are starting to emerge. VSN devices come
                 with image sensors, adequate processing power, and
                 memory. They use wireless communication interfaces to
                 collaborate and jointly solve tasks such as tracking
                 persons within the network. VSNs are expected to
                 replace not only many traditional, closed-circuit
                 surveillance systems but also to enable emerging
                 applications in scenarios such as elderly care, home
                 monitoring, or entertainment. In all of these
                 applications, VSNs monitor a potentially large group of
                 people and record sensitive image data that might
                 contain identities of persons, their behavior,
                 interaction patterns, or personal preferences. These
                 intimate details can be easily abused, for example, to
                 derive personal profiles. The highly sensitive nature
                 of images makes security and privacy in VSNs even more
                 important than in most other sensor and data networks.
                 However, the direct use of security techniques
                 developed for related domains might be misleading due
                 to the different requirements and design challenges.
                 This is especially true for aspects such as data
                 confidentiality and privacy protection against
                 insiders, generating awareness among monitored people,
                 and giving trustworthy feedback about recorded personal
                 data-all of these aspects go beyond what is typically
                 required in other applications. In this survey, we
                 present an overview of the characteristics of VSN
                 applications, the involved security threats and attack
                 scenarios, and the major security challenges. A central
                 contribution of this survey is our classification of
                 VSN security aspects into data-centric, node-centric,
                 network-centric, and user-centric security. We identify
                 and discuss the individual security requirements and
                 present a profound overview of related work for each
                 class. We then discuss privacy protection techniques
                 and identify recent trends in VSN security and privacy.
                 A discussion of open research issues concludes this
                 survey.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shi:2014:CFB,
  author =       "Yue Shi and Martha Larson and Alan Hanjalic",
  title =        "Collaborative Filtering beyond the User-Item Matrix: a
                 Survey of the State of the Art and Future Challenges",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "3:1--3:??",
  month =        may,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2556270",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed May 21 09:48:38 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Over the past two decades, a large amount of research
                 effort has been devoted to developing algorithms that
                 generate recommendations. The resulting research
                 progress has established the importance of the
                 user-item (U-I) matrix, which encodes the individual
                 preferences of users for items in a collection, for
                 recommender systems. The U-I matrix provides the basis
                 for collaborative filtering (CF) techniques, the
                 dominant framework for recommender systems. Currently,
                 new recommendation scenarios are emerging that offer
                 promising new information that goes beyond the U-I
                 matrix. This information can be divided into two
                 categories related to its source: rich side information
                 concerning users and items, and interaction information
                 associated with the interplay of users and items. In
                 this survey, we summarize and analyze recommendation
                 scenarios involving information sources and the CF
                 algorithms that have been recently developed to address
                 them. We provide a comprehensive introduction to a
                 large body of research, more than 200 key references,
                 with the aim of supporting the further development of
                 recommender systems exploiting information beyond the
                 U-I matrix. On the basis of this material, we identify
                 and discuss what we see as the central challenges lying
                 ahead for recommender system technology, both in terms
                 of extensions of existing techniques as well as of the
                 integration of techniques and technologies drawn from
                 other research areas.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Howard:2014:SDE,
  author =       "Catherine Howard and Markus Stumptner",
  title =        "A Survey of Directed Entity-Relation--Based
                 First-Order Probabilistic Languages",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "4:1--4:??",
  month =        may,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2560546",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed May 21 09:48:38 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Languages that combine aspects of probabilistic
                 representations with aspects of first-order logic are
                 referred to as first-order probabilistic languages
                 (FOPLs). FOPLs can be divided into three categories:
                 rule-based, procedural-based and entity-relation--based
                 languages. This article presents a survey of directed
                 entity-relation--based FOPLs and their associated model
                 construction and inference algorithms.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Toosi:2014:ICC,
  author =       "Adel Nadjaran Toosi and Rodrigo N. Calheiros and
                 Rajkumar Buyya",
  title =        "Interconnected Cloud Computing Environments:
                 Challenges, Taxonomy, and Survey",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "7:1--7:??",
  month =        may,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2593512",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed May 21 09:48:38 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A brief review of the Internet history reveals the
                 fact that the Internet evolved after the formation of
                 primarily independent networks. Similarly,
                 interconnected clouds, also called Inter-cloud, can be
                 viewed as a natural evolution of cloud computing.
                 Recent studies show the benefits in utilizing multiple
                 clouds and present attempts for the realization of an
                 Inter-cloud or federated cloud environment. However,
                 cloud vendors have not taken into account cloud
                 interoperability issues, and each cloud comes with its
                 own solution and interfaces for services. This survey
                 initially discusses all the relevant aspects motivating
                 cloud interoperability. Furthermore, it categorizes and
                 identifies possible cloud interoperability scenarios
                 and architectures. The spectrum of challenges and
                 obstacles that the Inter-cloud realization is faced
                 with are covered, a taxonomy of them is provided, and
                 fitting enablers that tackle each challenge are
                 identified. All these aspects require a comprehensive
                 review of the state of the art, including ongoing
                 projects and studies in the area. We conclude by
                 discussing future directions and trends toward the
                 holistic approach in this regard.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chong:2014:SUI,
  author =       "Ming Ki Chong and Rene Mayrhofer and Hans Gellersen",
  title =        "A Survey of User Interaction for Spontaneous Device
                 Association",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "8:1--8:??",
  month =        may,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2597768",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed May 21 09:48:38 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In a wireless world, users can establish ad hoc
                 virtual connections between devices that are unhampered
                 by cables. This process is known as spontaneous device
                 association. A wide range of interactive protocols and
                 techniques have been demonstrated in both research and
                 practice, predominantly with a focus on security
                 aspects. In this article, we survey spontaneous device
                 association with respect to the user interaction it
                 involves. We use a novel taxonomy to structure the
                 survey with respect to the different conceptual models
                 and types of user action employed for device
                 association. Within this framework, we provide an
                 in-depth survey of existing techniques discussing their
                 individual characteristics, benefits, and issues.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Akiki:2014:AMD,
  author =       "Pierre A. Akiki and Arosha K. Bandara and Yijun Yu",
  title =        "Adaptive Model-Driven User Interface Development
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "9:1--9:??",
  month =        may,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2597999",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed May 21 09:48:38 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Adaptive user interfaces (UIs) were introduced to
                 address some of the usability problems that plague many
                 software applications. Model-driven engineering formed
                 the basis for most of the systems targeting the
                 development of such UIs. An overview of these systems
                 is presented and a set of criteria is established to
                 evaluate the strengths and shortcomings of the state of
                 the art, which is categorized under architectures,
                 techniques, and tools. A summary of the evaluation is
                 presented in tables that visually illustrate the
                 fulfillment of each criterion by each system. The
                 evaluation identified several gaps in the existing art
                 and highlighted the areas of promising improvement.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Aggarwal:2014:ENA,
  author =       "Charu Aggarwal and Karthik Subbian",
  title =        "Evolutionary Network Analysis: a Survey",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "10:1--10:??",
  month =        may,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2601412",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed May 21 09:48:38 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Evolutionary network analysis has found an increasing
                 interest in the literature because of the importance of
                 different kinds of dynamic social networks, email
                 networks, biological networks, and social streams. When
                 a network evolves, the results of data mining
                 algorithms such as community detection need to be
                 correspondingly updated. Furthermore, the specific
                 kinds of changes to the structure of the network, such
                 as the impact on community structure or the impact on
                 network structural parameters, such as node degrees,
                 also needs to be analyzed. Some dynamic networks have a
                 much faster rate of edge arrival and are referred to as
                 network streams or graph streams. The analysis of such
                 networks is especially challenging, because it needs to
                 be performed with an online approach, under the
                 one-pass constraint of data streams. The incorporation
                 of content can add further complexity to the evolution
                 analysis process. This survey provides an overview of
                 the vast literature on graph evolution analysis and the
                 numerous applications that arise in different
                 contexts.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Paulo:2014:SCS,
  author =       "Jo{\~a}o Paulo and Jos{\'e} Pereira",
  title =        "A Survey and Classification of Storage Deduplication
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "11:1--11:??",
  month =        jul,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2611778",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 9 16:27:25 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The automatic elimination of duplicate data in a
                 storage system, commonly known as deduplication, is
                 increasingly accepted as an effective technique to
                 reduce storage costs. Thus, it has been applied to
                 different storage types, including archives and
                 backups, primary storage, within solid-state drives,
                 and even to random access memory. Although the general
                 approach to deduplication is shared by all storage
                 types, each poses specific challenges and leads to
                 different trade-offs and solutions. This diversity is
                 often misunderstood, thus underestimating the relevance
                 of new research and development. The first contribution
                 of this article is a classification of deduplication
                 systems according to six criteria that correspond to
                 key design decisions: granularity, locality, timing,
                 indexing, technique, and scope. This classification
                 identifies and describes the different approaches used
                 for each of them. As a second contribution, we describe
                 which combinations of these design decisions have been
                 proposed and found more useful for challenges in each
                 storage type. Finally, outstanding research challenges
                 and unexplored design points are identified and
                 discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wang:2014:MSN,
  author =       "You-Chiun Wang",
  title =        "Mobile Sensor Networks: System Hardware and Dispatch
                 Software",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "12:1--12:??",
  month =        jul,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2617662",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 9 16:27:25 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Wireless sensor networks (WSNs) provide a convenient
                 way to monitor the physical environment. They consist
                 of a large number of sensors that have sensing,
                 computing, and communication abilities. In the past,
                 sensors were considered as static, but the network
                 functionality would degrade when some sensors were
                 broken. Today, the emerging hardware techniques have
                 promoted the development of mobile sensors. Introducing
                 mobility to sensors not only improves their capability
                 but also gives them flexibility to deal with node
                 failure. The article studies the research progress of
                 mobile sensor networks, which embraces both system
                 hardware and dispatch software. For system hardware, we
                 review two popular types of mobile sensor platforms.
                 One is to integrate mobile robots with sensors, whereas
                 the other is to use existing conveyances to carry
                 sensors. Dispatch software includes two topics. We
                 first address how to solve different coverage problems
                 by using a purely mobile WSN and then investigate how
                 to dispatch mobile sensors in a hybrid WSN to perform
                 various missions including data collection, faulty
                 recovery, and event analysis. A discussion about
                 research challenges in mobile sensor networks is also
                 presented in the article.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Paola:2014:IMS,
  author =       "Alessandra {De Paola} and Marco Ortolani and Giuseppe
                 {Lo Re} and Giuseppe Anastasi and Sajal K. Das",
  title =        "Intelligent Management Systems for Energy Efficiency
                 in Buildings: a Survey",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "13:1--13:??",
  month =        jul,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2611779",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 9 16:27:25 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In recent years, reduction of energy consumption in
                 buildings has increasingly gained interest among
                 researchers mainly due to practical reasons, such as
                 economic advantages and long-term environmental
                 sustainability. Many solutions have been proposed in
                 the literature to address this important issue from
                 complementary perspectives, which are often hard to
                 capture in a comprehensive manner. This survey article
                 aims at providing a structured and unifying treatment
                 of the existing literature on intelligent energy
                 management systems in buildings, with a distinct focus
                 on available architectures and methodology supporting a
                 vision transcending the well-established smart home
                 vision, in favor of the novel Ambient Intelligence
                 paradigm. Our exposition will cover the main
                 architectural components of such systems, beginning
                 with the basic sensory infrastructure, moving on to the
                 data processing engine where energy-saving strategies
                 may be enacted, to the user interaction interface
                 subsystem, and finally to the actuation infrastructure
                 necessary to transfer the planned modifications to the
                 environment. For each component, we will analyze
                 different solutions, and we will provide qualitative
                 comparisons, also highlighting the impact that a single
                 design choice can have on the rest of the system.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Treurniet:2014:TSM,
  author =       "Joanne Treurniet",
  title =        "A Taxonomy and Survey of Microscopic Mobility Models
                 from the Mobile Networking Domain",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "1",
  pages =        "14:1--14:??",
  month =        jul,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2616973",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 9 16:27:25 MDT 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A mobility model is used to generate the trajectories
                 of mobile nodes in simulations when developing new
                 algorithms for mobile networks. A model must
                 realistically reflect the scenario in which the
                 technology will be used to reliably validate the
                 algorithm. Considerable progress has been made toward
                 realistic mobility models in the academic literature,
                 and models have become quite complex. A consistent
                 taxonomy has not yet been established for this field. A
                 new multifaceted taxonomy is presented in this work
                 that provides a framework for authors to clearly and
                 consistently describe their models, making them easier
                 to understand and reproduce. By surveying the
                 application field of mobile communication networks, a
                 common nomenclature and a high-level view of existing
                 literature are provided, which are required to reduce
                 duplication of effort and to enable a better sense of
                 the way forward. A tactical scenario demonstrates the
                 application of the taxonomy to model construction.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

%%% TO DO: The ACM Web site assigned v47n2 to November 2014, but
%%% later changed it to January 2015.  Resolve the problem after
%%% the printed issue arrives (v46n4 arrived 7-Jan-2015, so print
%%% volumes are seriously behind the electronic ones!).
@Article{Campos:2014:STI,
  author =       "Ricardo Campos and Ga{\"e}l Dias and Al{\'\i}pio M.
                 Jorge and Adam Jatowt",
  title =        "Survey of Temporal Information Retrieval and Related
                 Applications",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "15:1--15:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2619088",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Temporal information retrieval has been a topic of
                 great interest in recent years. Its purpose is to
                 improve the effectiveness of information retrieval
                 methods by exploiting temporal information in documents
                 and queries. In this article, we present a survey of
                 the existing literature on temporal information
                 retrieval. In addition to giving an overview of the
                 field, we categorize the relevant research, describe
                 the main contributions, and compare different
                 approaches. We organize existing research to provide a
                 coherent view, discuss several open issues, and point
                 out some possible future research directions in this
                 area. Despite significant advances, the area lacks a
                 systematic arrangement of prior efforts and an overview
                 of state-of-the-art approaches. Moreover, an effective
                 end-to-end temporal retrieval system that exploits
                 temporal information to improve the quality of the
                 presented results remains undeveloped.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gostner:2014:GMT,
  author =       "Roswitha Gostner and Bianca Baldacci and Melissa J.
                 Morine and Corrado Priami",
  title =        "Graphical Modeling Tools for Systems Biology",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "16:1--16:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2633461",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Modeling biological systems to understand their
                 mechanistic behavior is an important activity in
                 molecular systems biology. Mathematical modeling
                 typically requires deep mathematical or computing
                 knowledge, and this limits the spread of modeling tools
                 among biologists. Graphical modeling languages have
                 been introduced to minimize this limit. Here, we survey
                 the main graphical formalisms (supported by software
                 tools) available to model biological systems with a
                 primary focus on their usability, within the framework
                 of modeling reaction pathways with two-dimensional (2D)
                 (possibly nested) compartments. Considering the main
                 characteristics of the surveyed formalisms, we
                 synthesize a new proposal (Style) and report the
                 results of an online survey conducted among biologists
                 to assess usability of available graphical formalisms.
                 We consider this proposal a guideline developed from
                 what we learned in the survey, which can inform
                 development of graphical formalisms to model reaction
                 pathways in 2D space.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Thomasian:2014:AFJ,
  author =       "Alexander Thomasian",
  title =        "Analysis of Fork\slash Join and Related Queueing
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "17:1--17:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2628913",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Fork/join (F/J) requests arise in contexts such as
                 parallel computing, query processing in parallel
                 databases, and parallel disk access in RAID. F/J
                 requests spawn $K$ tasks that are sent to $K$ parallel
                 servers, and the completion of all $K$ tasks marks the
                 completion of an F/J request. The exact formula for the
                 mean response time of $ K = 2$-way F/J requests derived
                 under Markovian assumptions ($ R^{\rm F / J}_2$) served
                 as the starting point for an approximate expression for
                 $ R^{\rm F / J}_K$ for $ 2 < K \leq = 32$. When servers
                 process independent requests in addition to F/J
                 requests, the mean response time of F/J requests is
                 better approximated by $ R^{\rm max}_K$, which is the
                 maximum of the response times of tasks constituting F/J
                 requests. $ R^{\rm max}_K$ is easier to compute and
                 serves as an upper bound to $ R^{\rm F / J}_K$. We
                 discuss techniques to compute $ R^{\rm max}_K$ and
                 generally the maximum of $K$ random variables denoting
                 the processing times of the tasks of a parallel
                 computation $ \bar {X}^{\rm max}_K$. Graph models of
                 computations such as Petri nets --- a more general form
                 of parallelism than F/J requests --- are also discussed
                 in this work. Jobs with precedence constraints may
                 require multiple resources, which are represented by a
                 queueing network model. We also discuss various
                 queueing systems related to F/J queueing systems and
                 outline their analysis.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bosch:2014:SPS,
  author =       "Christoph B{\"o}sch and Pieter Hartel and Willem
                 Jonker and Andreas Peter",
  title =        "A Survey of Provably Secure Searchable Encryption",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "18:1--18:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2636328",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We survey the notion of provably secure searchable
                 encryption (SE) by giving a complete and comprehensive
                 overview of the two main SE techniques: searchable
                 symmetric encryption (SSE) and public key encryption
                 with keyword search (PEKS). Since the pioneering work
                 of Song, Wagner, and Perrig (IEEE S{\&}P '00), the
                 field of provably secure SE has expanded to the point
                 where we felt that taking stock would provide benefit
                 to the community. The survey has been written primarily
                 for the nonspecialist who has a basic information
                 security background. Thus, we sacrifice full details
                 and proofs of individual constructions in favor of an
                 overview of the underlying key techniques. We
                 categorize and compare the different SE schemes in
                 terms of their security, efficiency, and functionality.
                 For the experienced researcher, we point out
                 connections between the many approaches to SE and
                 identify open research problems. Two major conclusions
                 can be drawn from our work. While the so-called
                 IND-CKA2 security notion becomes prevalent in the
                 literature and efficient (sublinear) SE schemes meeting
                 this notion exist in the symmetric setting, achieving
                 this strong form of security efficiently in the
                 asymmetric setting remains an open problem. We observe
                 that in multirecipient SE schemes, regardless of their
                 efficiency drawbacks, there is a noticeable lack of
                 query expressiveness that hinders deployment in
                 practice.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mittal:2014:SMA,
  author =       "Sparsh Mittal and Jeffrey S. Vetter",
  title =        "A Survey of Methods for Analyzing and Improving {GPU}
                 Energy Efficiency",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "19:1--19:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2636342",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recent years have witnessed phenomenal growth in the
                 computational capabilities and applications of GPUs.
                 However, this trend has also led to a dramatic increase
                 in their power consumption. This article surveys
                 research works on analyzing and improving energy
                 efficiency of GPUs. It also provides a classification
                 of these techniques on the basis of their main research
                 idea. Further, it attempts to synthesize research works
                 that compare the energy efficiency of GPUs with other
                 computing systems (e.g., FPGAs and CPUs). The aim of
                 this survey is to provide researchers with knowledge of
                 the state of the art in GPU power management and
                 motivate them to architect highly energy-efficient GPUs
                 of tomorrow.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Abid:2014:SDB,
  author =       "Shahbaz Akhtar Abid and Mazliza Othman and Nadir
                 Shah",
  title =        "A Survey on {DHT}-Based Routing for Large-Scale Mobile
                 Ad Hoc Networks",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "20:1--20:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2632296",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Mobile ad hoc networks (MANETs) are infrastructureless
                 and distributed communication systems that require
                 sophisticated approaches to routing to cope with node
                 mobility and heterogeneous application requirements. In
                 the past few years, distributed hash table (DHT) has
                 come forth as a useful additional technique to the
                 design and specification of spontaneous and
                 self-organized networks. Researchers have exploited its
                 advantages by implementing it at the network layer and
                 developing scalable routing protocols for MANETs. The
                 implementation of DHT-based routing in a MANET requires
                 different algorithms and specifications compared to
                 routing in the Internet because a MANET has its unique
                 characteristics, such as node mobility, spontaneous
                 networking, decentralized architecture, limited
                 transmission range, dynamic topology, and frequent
                 network partitioning/merging. In this article, we
                 present a comprehensive survey of research related to
                 DHT-based routing that aims at enhancing the
                 scalability of MANETs. We present a vivid taxonomy of
                 DHT-based routing protocols and the guidelines to
                 design such protocols for MANETs. We compare the
                 features, strengths, and weaknesses of existing
                 DHT-based routing protocols and highlight key research
                 challenges that are vital to address. The outcome of
                 the analysis serves as a guide for anyone willing to
                 delve into research on DHT-based routing in MANETs.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Qiu:2014:RTW,
  author =       "Dong Qiu and Bixin Li and Shunhui Ji and Hareton
                 Leung",
  title =        "Regression Testing of {Web} Service: a Systematic
                 Mapping Study",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "21:1--21:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2631685",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Web service is a widely used implementation technique
                 under the paradigm of Service-Oriented Architecture
                 (SOA). A service-based system is subjected to
                 continuous evolution and regression testing is required
                 to check whether new faults have been introduced. Based
                 on the current scientific work of web service
                 regression testing, this survey aims to identify gaps
                 in current research and suggests some promising areas
                 for further study. To this end, we performed a broad
                 automatic search on publications in the selected
                 electronic databases published from 2000 to 2013.
                 Through our careful review and manual screening, a
                 total of 30 papers have been selected as primary
                 studies for answering our research questions. We
                 presented a qualitative analysis of the findings,
                 including stakeholders, challenges, standards,
                 techniques, and validations employed in these primary
                 studies. Our main results include the following: (1)
                 Service integrator is the key stakeholder that largely
                 impacts how regression testing is performed. (2)
                 Challenges of cost and autonomy issues have been
                 studied heavily. However, more emphasis should be put
                 on the other challenges, such as test timing, dynamics,
                 privacy, quota constraints, and concurrency issues. (3)
                 Orchestration-based services have been largely studied,
                 while little attention has been paid to either
                 choreography-based services or semantic-based services.
                 (4) An appreciable amount of web service regression
                 testing techniques have been proposed, including 48
                 test case prioritization techniques, 10 test selection
                 techniques, two test suite minimization techniques, and
                 another collaborative technique. (5) Many regression
                 test techniques have not been theoretically proven or
                 experimentally analyzed, which limits their application
                 in large-scale systems. We believe that our survey has
                 identified gaps in current research work and reveals
                 new insights for the future work.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Boukerche:2014:ORW,
  author =       "Azzedine Boukerche and Amir Darehshoorzadeh",
  title =        "Opportunistic Routing in Wireless Networks: Models,
                 Algorithms, and Classifications",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "22:1--22:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2635675",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Opportunistic Routing (OR) is a new promising paradigm
                 that has been proposed for wireless networks. OR has
                 gained a lot of attention from the research communities
                 for its ability to increase the performance of wireless
                 networks. It benefits from the broadcast characteristic
                 of wireless mediums to improve network performance. The
                 basic function of OR is its ability to overhear the
                 transmitted packet and to coordinate among relaying
                 nodes. In OR, a candidate set is a potential group of
                 nodes that is selected as the next-hop forwarders.
                 Hence, each node in OR can use different potential
                 paths to send packets toward the destination. Any of
                 the candidates of a node that have received the
                 transmitted packet may forward it. The decision of
                 choosing the next forwarder is made by coordination
                 between candidates that have successfully received the
                 transmitted packet. In OR, by using a dynamic relay
                 node to forward the packet, the transmission
                 reliability and network throughput can be increased. In
                 this article, we explain the fundamental idea of OR and
                 its important issues by providing some examples. We
                 then categorize each of the important issues and
                 explain them in detail. Furthermore, we illustrate
                 different protocols from each category and compare
                 their benefits and drawbacks. Finally, some potential
                 directions for future research in OR is explained.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Laszka:2014:SII,
  author =       "Aron Laszka and Mark Felegyhazi and Levente Buttyan",
  title =        "A Survey of Interdependent Information Security
                 Games",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "23:1--23:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2635673",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Risks faced by information system operators and users
                 are not only determined by their own security posture,
                 but are also heavily affected by the security-related
                 decisions of others. This interdependence between
                 information system operators and users is a fundamental
                 property that shapes the efficiency of security defense
                 solutions. Game theory is the most appropriate method
                 to model the strategic interactions between these
                 participants. In this survey, we summarize
                 game-theoretic interdependence models, characterize the
                 emerging security inefficiencies, and present
                 mechanisms to improve the security decisions of the
                 participants. We focus our attention on games with
                 interdependent defenders and do not discuss two-player
                 attacker-defender games. Our goal is to distill the
                 main insights from the state of the art and to identify
                 the areas that need more attention from the research
                 community.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Newell:2014:NCR,
  author =       "Andrew Newell and Hongyi Yao and Alex Ryker and Tracey
                 Ho and Cristina Nita-Rotaru",
  title =        "Node-Capture Resilient Key Establishment in Sensor
                 Networks: Design Space and New Protocols",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "24:1--24:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2636344",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Key management is required for basic security services
                 of confidentiality, integrity, and data source
                 authentication. Wireless sensor networks (WSNs) are a
                 challenging environment to provide such services due to
                 the resource constraints and the increased likelihood
                 of nodes to be captured. Various key management
                 techniques were proposed that trade off resilience to
                 node capture and overhead in terms of communication and
                 memory. We identify the main factors influencing the
                 design space of key management protocols for sensor
                 networks and describe representative protocols that
                 trade off the number of links established,
                 communication overhead, and resilience to node capture.
                 These trade-offs are due to using direct, path-based,
                 or multipath-based communication to establish secure
                 links. We propose a new multipath protocol relying on
                 an encoding scheme tailored for WSNs and analyze the
                 effects of key pre-distribution on multipath key
                 establishment. We provide extensive simulations to
                 understand the trade-offs between resilience to node
                 compromise and communication overhead under numerous
                 network scenarios. This comparison highlights the
                 trade-offs between these vastly different key
                 management schemes. For the newer class of key
                 management schemes-multipath based-we quantify
                 experimentally the additional communication overhead
                 required for extra paths and the improvement in
                 resilience from using these paths.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Calabrese:2014:USU,
  author =       "Francesco Calabrese and Laura Ferrari and Vincent D.
                 Blondel",
  title =        "Urban Sensing Using Mobile Phone Network Data: a
                 Survey of Research",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "25:1--25:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2655691",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The recent development of telecommunication networks
                 is producing an unprecedented wealth of information
                 and, as a consequence, an increasing interest in
                 analyzing such data both from telecoms and from other
                 stakeholders' points of view. In particular, mobile
                 phone datasets offer access to insights into urban
                 dynamics and human activities at an unprecedented scale
                 and level of detail, representing a huge opportunity
                 for research and real-world applications. This article
                 surveys the new ideas and techniques related to the use
                 of telecommunication data for urban sensing. We outline
                 the data that can be collected from telecommunication
                 networks as well as their strengths and weaknesses with
                 a particular focus on urban sensing. We survey existing
                 filtering and processing techniques to extract insights
                 from this data and summarize them to provide
                 recommendations on which datasets and techniques to use
                 for specific urban sensing applications. Finally, we
                 discuss a number of challenges and open research areas
                 currently being faced in this field. We strongly
                 believe the material and recommendations presented here
                 will become increasingly important as mobile phone
                 network datasets are becoming more accessible to the
                 research community.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bonnin:2014:AGM,
  author =       "Geoffray Bonnin and Dietmar Jannach",
  title =        "Automated Generation of Music Playlists: Survey and
                 Experiments",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "26:1--26:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2652481",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Most of the time when we listen to music on the radio
                 or on our portable devices, the order in which the
                 tracks are played is governed by so-called playlists.
                 These playlists are basically sequences of tracks that
                 traditionally are designed manually and whose
                 organization is based on some underlying logic or
                 theme. With the digitalization of music and the
                 availability of various types of additional
                 track-related information on the Web, new opportunities
                 have emerged on how to automate the playlist creation
                 process. Correspondingly, a number of proposals for
                 automated playlist generation have been made in the
                 literature during the past decade. These approaches
                 vary both with respect to which kind of data they rely
                 on and which types of algorithms they use. In this
                 article, we review the literature on automated playlist
                 generation and categorize the existing approaches.
                 Furthermore, we discuss the evaluation designs that are
                 used today in research to assess the quality of the
                 generated playlists. Finally, we report the results of
                 a comparative evaluation of typical playlist generation
                 schemes based on historical data. Our results show that
                 track and artist popularity can play a dominant role
                 and that additional measures are required to better
                 characterize and compare the quality of automatically
                 generated playlists.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jagadeesan:2014:SDN,
  author =       "Nachikethas A. Jagadeesan and Bhaskar Krishnamachari",
  title =        "Software-Defined Networking Paradigms in Wireless
                 Networks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "27:1--27:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2655690",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Software-defined networking (SDN) has generated
                 tremendous interest from both academia and industry.
                 SDN aims at simplifying network management while
                 enabling researchers to experiment with network
                 protocols on deployed networks. This article is a
                 distillation of the state of the art of SDN in the
                 context of wireless networks. We present an overview of
                 the major design trends and highlight key differences
                 between them.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Marasco:2014:SAS,
  author =       "Emanuela Marasco and Arun Ross",
  title =        "A Survey on Antispoofing Schemes for Fingerprint
                 Recognition Systems",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "28:1--28:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2617756",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "Several issues related to the vulnerability of
                 fingerprint recognition systems to attacks have been
                 highlighted in the biometrics literature. One such
                 vulnerability involves the use of artificial fingers,
                 where materials such as Play-Doh, silicone, and gelatin
                 are inscribed with fingerprint ridges. Researchers have
                 demonstrated that some commercial fingerprint
                 recognition systems can be deceived when these
                 artificial fingers are placed on the sensor; that is,
                 the system successfully processes the ensuing
                 fingerprint images, thereby allowing an adversary to
                 spoof the fingerprints of another individual. However,
                 at the same time, several countermeasures that
                 discriminate between live fingerprints and spoof
                 artifacts have been proposed. While some of these
                 antispoofing schemes are hardware based, several
                 software-based approaches have been proposed as well.
                 In this article, we review the literature and present
                 the state of the art in fingerprint antispoofing.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ziaie:2014:MCD,
  author =       "Pujan Ziaie",
  title =        "A Model for Context in the Design of Open Production
                 Communities",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "29:1--29:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2661642",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Open production communities (OPCs) provide technical
                 features and social norms for a vast but dispersed and
                 diverse crowd to collectively accumulate content. In
                 OPCs, certain mechanisms, policies, and technologies
                 are provided for voluntary users to participate in
                 community-related activities including content
                 generation, evaluation, qualification, and distribution
                 and in some cases even community governance. Due to the
                 known complexities and dynamism of online communities,
                 designing a successful community is deemed more an art
                 than a science. Numerous studies have investigated
                 different aspects of certain types of OPCs. Most of
                 these studies, however, fall short of delivering a
                 general view or prescription due to their narrow focus
                 on a certain type of OPCs. In contribution to theories
                 on technology-mediated social participation (TMSP),
                 this study synthesizes the streams of research in the
                 particular area of OPCs and delivers a theoretical
                 framework as a baseline for adapting findings from one
                 specific type of community on another. This framework
                 consists of four primary dimensions, namely, platform
                 features, content, user, and community. The
                 corresponding attributes of these dimensions and the
                 existing interdependencies are discussed in detail.
                 Furthermore, a decision diagram for selecting features
                 and a design guideline for ``decontextualizing''
                 findings are introduced as possible applications of the
                 framework. The framework also provides a new and
                 reliable foundation on which future research can extend
                 its findings and prescriptions in a systematic way.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kong:2014:SGE,
  author =       "Fanxin Kong and Xue Liu",
  title =        "A Survey on Green-Energy-Aware Power Management for
                 Datacenters",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "30:1--30:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2642708",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Megawatt-scale datacenters have emerged to meet the
                 increasing demand for IT applications and services. The
                 hunger for power brings large electricity bills to
                 datacenter operators and causes significant impacts to
                 the environment. To reduce costs and environmental
                 impacts, modern datacenters, such as those of Google
                 and Apple, are beginning to integrate renewable or
                 green energy sources into their power supply. This
                 article investigates the green-energy-aware power
                 management problem for these datacenters and surveys
                 and classifies works that explicitly consider renewable
                 energy and/or carbon emission. Our aim is to give a
                 full view of this problem. Hence, we first provide some
                 basic knowledge on datacenters (including datacenter
                 components, power infrastructure, power load
                 estimation, and energy sources' operations), the
                 electrical grid (including dynamic pricing, power
                 outages, and emission factor), and the carbon market
                 (including cap-and-trade and carbon tax). Then, we
                 categorize existing research works according to their
                 basic approaches used, including workload scheduling,
                 virtual machine management, and energy capacity
                 planning. Each category's discussion includes the
                 description of the shared core idea, qualitative
                 analysis, and quantitative analysis among works of this
                 category.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cockburn:2014:SNE,
  author =       "Andy Cockburn and Carl Gutwin and Joey Scarr and
                 Sylvain Malacria",
  title =        "Supporting Novice to Expert Transitions in User
                 Interfaces",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "31:1--31:??",
  month =        nov,
  year =         "2014",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2659796",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 15 15:22:35 MST 2014",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Interface design guidelines encourage designers to
                 provide high-performance mechanisms for expert users.
                 However, research shows that many expert interface
                 components are seldom used and that there is a tendency
                 for users to persistently fail to adopt faster methods
                 for completing their work. This article summarizes and
                 organizes research relevant to supporting users in
                 making successful transitions to expert levels of
                 performance. First, we provide a brief introduction to
                 the underlying human factors of skill acquisition
                 relevant to interaction with computer systems. We then
                 present our focus, which is a review of the state of
                 the art in user interfaces that promote expertise
                 development. The review of interface research is based
                 around four domains of performance improvement:
                 intramodal improvement that occurs as a factor of
                 repetition and practice with a single method of
                 interaction; intermodal improvement that occurs when
                 users switch from one method to another that has a
                 higher performance ceiling; vocabulary extension, in
                 which the user broadens his or her knowledge of the
                 range of functions available; and task mapping, which
                 examines the ways in which users perform their tasks.
                 The review emphasizes the relationship between
                 interface techniques and the human factors that explain
                 their relative success.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Caceres-Cruz:2015:RVR,
  author =       "Jose Caceres-Cruz and Pol Arias and Daniel Guimarans
                 and Daniel Riera and Angel A. Juan",
  title =        "Rich Vehicle Routing Problem: Survey",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "32:1--32:??",
  month =        jan,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2666003",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jan 8 16:52:33 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Vehicle Routing Problem (VRP) is a well-known
                 research line in the optimization research community.
                 Its different basic variants have been widely explored
                 in the literature. Even though it has been studied for
                 years, the research around it is still very active. The
                 new tendency is mainly focused on applying this study
                 case to real-life problems. Due to this trend, the Rich
                 VRP arises: combining multiple constraints for tackling
                 realistic problems. Nowadays, some studies have
                 considered specific combinations of real-life
                 constraints to define the emerging Rich VRP scopes.
                 This work surveys the state of the art in the field,
                 summarizing problem combinations, constraints defined,
                 and approaches found.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mastelic:2015:CCS,
  author =       "Toni Mastelic and Ariel Oleksiak and Holger Claussen
                 and Ivona Brandic and Jean-Marc Pierson and Athanasios
                 V. Vasilakos",
  title =        "Cloud Computing: Survey on Energy Efficiency",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "33:1--33:??",
  month =        jan,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2656204",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jan 8 16:52:33 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cloud computing is today's most emphasized Information
                 and Communications Technology (ICT) paradigm that is
                 directly or indirectly used by almost every online
                 user. However, such great significance comes with the
                 support of a great infrastructure that includes large
                 data centers comprising thousands of server units and
                 other supporting equipment. Their share in power
                 consumption generates between 1.1\% and 1.5\% of the
                 total electricity use worldwide and is projected to
                 rise even more. Such alarming numbers demand rethinking
                 the energy efficiency of such infrastructures. However,
                 before making any changes to infrastructure, an
                 analysis of the current status is required. In this
                 article, we perform a comprehensive analysis of an
                 infrastructure supporting the cloud computing paradigm
                 with regards to energy efficiency. First, we define a
                 systematic approach for analyzing the energy efficiency
                 of most important data center domains, including server
                 and network equipment, as well as cloud management
                 systems and appliances consisting of a software
                 utilized by end users. Second, we utilize this approach
                 for analyzing available scientific and industrial
                 literature on state-of-the-art practices in data
                 centers and their equipment. Finally, we extract
                 existing challenges and highlight future research
                 directions.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:2015:CMO,
  author =       "Xin Li and S. S. Iyengar",
  title =        "On Computing Mapping of {$3$D} Objects: a Survey",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "34:1--34:??",
  month =        jan,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2668020",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jan 8 16:52:33 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We review the computation of 3D geometric data
                 mapping, which establishes one-to-one correspondence
                 between or among spatial/spatiotemporal objects.
                 Effective mapping benefits many scientific and
                 engineering tasks that involve the modeling and
                 processing of correlated geometric or image data. We
                 model mapping computation as an optimization problem
                 with certain geometric constraints and go through its
                 general solving pipeline. Different mapping algorithms
                 are discussed and compared according to their
                 formulations of objective functions, constraints, and
                 optimization strategies.",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Borrajo:2015:PCB,
  author =       "Daniel Borrajo and Anna Roub{\'\i}ckov{\'a} and Ivan
                 Serina",
  title =        "Progress in Case-Based Planning",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "35:1--35:??",
  month =        jan,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2674024",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jan 8 16:52:33 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Case-based planning (CBP) is an approach to automated
                 planning that tries to save computational effort by
                 reusing previously found solutions. In 2001, Spalazzi
                 published a survey of work in CBP; here, we present an
                 updated overview of systems that have contributed to
                 the evolution of the field or addressed some issues
                 related to planning by reuse in a novel way. The
                 article presents relevant planners so that readers gain
                 insight into the operation of these systems. This
                 analysis will allow readers to understand the
                 approaches both in the quality of the solutions and in
                 the complexity of finding them.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhou:2015:LRM,
  author =       "Xiaowei Zhou and Can Yang and Hongyu Zhao and Weichuan
                 Yu",
  title =        "Low-Rank Modeling and Its Applications in Image
                 Analysis",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "36:1--36:??",
  month =        jan,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2674559",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jan 8 16:52:33 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Low-rank modeling generally refers to a class of
                 methods that solves problems by representing variables
                 of interest as low-rank matrices. It has achieved great
                 success in various fields including computer vision,
                 data mining, signal processing, and bioinformatics.
                 Recently, much progress has been made in theories,
                 algorithms, and applications of low-rank modeling, such
                 as exact low-rank matrix recovery via convex
                 programming and matrix completion applied to
                 collaborative filtering. These advances have brought
                 more and more attention to this topic. In this article,
                 we review the recent advances of low-rank modeling, the
                 state-of-the-art algorithms, and the related
                 applications in image analysis. We first give an
                 overview of the concept of low-rank modeling and the
                 challenging problems in this area. Then, we summarize
                 the models and algorithms for low-rank matrix recovery
                 and illustrate their advantages and limitations with
                 numerical experiments. Next, we introduce a few
                 applications of low-rank modeling in the context of
                 image analysis. Finally, we conclude this article with
                 some discussions.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Siegle:2015:MRE,
  author =       "Felix Siegle and Tanya Vladimirova and J{\o}rgen
                 Ilstad and Omar Emam",
  title =        "Mitigation of Radiation Effects in {SRAM}-Based
                 {FPGAs} for Space Applications",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "2",
  pages =        "37:1--37:??",
  month =        jan,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2671181",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jan 8 16:52:33 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The use of static random access memory (SRAM)-based
                 field programmable gate arrays (FPGAs) in harsh
                 radiation environments has grown in recent years. These
                 types of programmable devices require special
                 mitigation techniques targeting the configuration
                 memory, the user logic, and the embedded RAM blocks.
                 This article provides a comprehensive survey of the
                 literature published in this rich research field during
                 the past 10 years. Furthermore, it can also serve as a
                 tutorial for space engineers, scientists, and decision
                 makers who need an introduction to this topic.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rodopoulos:2015:CFA,
  author =       "Dimitrios Rodopoulos and Georgia Psychou and Mohamed
                 M. Sabry and Francky Catthoor and Antonis Papanikolaou
                 and Dimitrios Soudris and Tobias G. Noll and David
                 Atienza",
  title =        "Classification Framework for Analysis and Modeling of
                 Physically Induced Reliability Violations",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "38:1--38:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2678276",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Technology downscaling is expected to amplify a
                 variety of reliability concerns in future digital
                 systems. A good understanding of reliability threats is
                 crucial for the creation of efficient mitigation
                 techniques. This survey performs a systematic
                 classification of the state of the art on the analysis
                 and modeling of such threats, which are caused by
                 physical mechanisms to digital systems. The purpose of
                 this article is to provide a classification tool that
                 can aid with the navigation across the entire landscape
                 of reliability analysis and modeling. A classification
                 framework is constructed in a top-down fashion from
                 complementary categories, each one addressing an
                 approach on reliability analysis and modeling. In
                 comparison to other classifications, the proposed
                 methodology approaches the target research domain in a
                 complete way, without suppressing hybrid works that
                 fall under multiple categories. To substantiate the
                 usability of the classification framework,
                 representative works from the state of the art are
                 mapped to each appropriate category and are briefly
                 analyzed. Thus, research trends and opportunities for
                 novel approaches can be identified.",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chaudhry:2015:TAS,
  author =       "Muhammad Tayyab Chaudhry and Teck Chaw Ling and Atif
                 Manzoor and Syed Asad Hussain and Jongwon Kim",
  title =        "Thermal-Aware Scheduling in Green Data Centers",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "39:1--39:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2678278",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Data centers can go green by saving electricity in two
                 major areas: computing and cooling. Servers in data
                 centers require a constant supply of cold air from
                 on-site cooling mechanisms for reliability. An
                 increased computational load makes servers dissipate
                 more power as heat and eventually amplifies the cooling
                 load. In thermal-aware scheduling, computations are
                 scheduled with the objective of reducing the
                 data-center-wide thermal gradient, hotspots, and
                 cooling magnitude. Complemented by heat modeling and
                 thermal-aware monitoring and profiling, this scheduling
                 is energy efficient and economical. A survey is
                 presented henceforth of thermal-ware scheduling and
                 associated techniques for green data centers.",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fabry:2015:TDS,
  author =       "Johan Fabry and Tom Dinkelaker and Jacques Noy{\'e}
                 and {\'E}ric Tanter",
  title =        "A Taxonomy of Domain-Specific Aspect Languages",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "40:1--40:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2685028",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Domain-Specific Aspect Languages (DSALs) are
                 Domain-Specific Languages (DSLs) designed to express
                 crosscutting concerns. Compared to DSLs, their
                 aspectual nature greatly amplifies the language design
                 space. We structure this space in order to shed light
                 on and compare the different domain-specific approaches
                 to deal with crosscutting concerns. We report on a
                 corpus of 36 DSALs covering the space, discuss a set of
                 design considerations, and provide a taxonomy of DSAL
                 implementation approaches. This work serves as a frame
                 of reference to DSAL and DSL researchers, enabling
                 further advances in the field, and to developers as a
                 guide for DSAL implementations.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Roy:2015:SCP,
  author =       "Arpan Roy and Santonu Sarkar and Rajeshwari Ganesan
                 and Geetika Goel",
  title =        "Secure the Cloud: From the Perspective of a
                 Service-Oriented Organization",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "41:1--41:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2693841",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "In response to the revival of virtualized technology
                 by Rosenblum and Garfinkel [2005], NIST defined cloud
                 computing, a new paradigm in service computing
                 infrastructures. In cloud environments, the basic
                 security mechanism is ingrained in virtualization ---
                 that is, the execution of instructions at different
                 privilege levels. Despite its obvious benefits, the
                 caveat is that a crashed virtual machine (VM) is much
                 harder to recover than a crashed workstation. When
                 crashed, a VM is nothing but a giant corrupt binary
                 file and quite unrecoverable by standard disk-based
                 forensics. Therefore, VM crashes should be avoided at
                 all costs. Security is one of the major contributors to
                 such VM crashes. This includes compromising the
                 hypervisor, cloud storage, images of VMs used
                 infrequently, and remote cloud client used by the
                 customer as well as threat from malicious insiders.
                 Although using secure infrastructures such as private
                 clouds alleviate several of these security problems,
                 most cloud users end up using cheaper options such as
                 third-party infrastructures (i.e., private clouds),
                 thus a thorough discussion of all known security issues
                 is pertinent. Hence, in this article, we discuss
                 ongoing research in cloud security in order of the
                 attack scenarios exploited most often in the cloud
                 environment. We explore attack scenarios that call for
                 securing the hypervisor, exploiting co-residency of
                 VMs, VM image management, mitigating insider threats,
                 securing storage in clouds, abusing lightweight
                 software-as-a-service clients, and protecting data
                 propagation in clouds. Wearing a practitioner's
                 glasses, we explore the relevance of each attack
                 scenario to a service company like Infosys. At the same
                 time, we draw parallels between cloud security research
                 and implementation of security solutions in the form of
                 enterprise security suites for the cloud. We discuss
                 the state of practice in the form of enterprise
                 security suites that include cryptographic solutions,
                 access control policies in the cloud, new techniques
                 for attack detection, and security quality assurance in
                 clouds.",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Renesse:2015:PMM,
  author =       "Robbert {Van Renesse} and Deniz Altinbuken",
  title =        "{Paxos} Made Moderately Complex",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "42:1--42:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2673577",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article explains the full reconfigurable
                 multidecree Paxos (or multi-Paxos) protocol. Paxos is
                 by no means a simple protocol, even though it is based
                 on relatively simple invariants. We provide pseudocode
                 and explain it guided by invariants. We initially avoid
                 optimizations that complicate comprehension. Next we
                 discuss liveness, list various optimizations that make
                 the protocol practical, and present variants of the
                 protocol.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{DMello:2015:RMA,
  author =       "Sidney K. D'Mello and Jacqueline Kory",
  title =        "A Review and Meta-Analysis of Multimodal Affect
                 Detection Systems",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "43:1--43:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2682899",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Affect detection is an important pattern recognition
                 problem that has inspired researchers from several
                 areas. The field is in need of a systematic review due
                 to the recent influx of Multimodal (MM) affect
                 detection systems that differ in several respects and
                 sometimes yield incompatible results. This article
                 provides such a survey via a quantitative review and
                 meta-analysis of 90 peer-reviewed MM systems. The
                 review indicated that the state of the art mainly
                 consists of person-dependent models (62.2\% of systems)
                 that fuse audio and visual (55.6\%) information to
                 detect acted (52.2\%) expressions of basic emotions and
                 simple dimensions of arousal and valence (64.5\%) with
                 feature- (38.9\%) and decision-level (35.6\%) fusion
                 techniques. However, there were also person-independent
                 systems that considered additional modalities to detect
                 nonbasic emotions and complex dimensions using
                 model-level fusion techniques. The meta-analysis
                 revealed that MM systems were consistently (85\% of
                 systems) more accurate than their best unimodal
                 counterparts, with an average improvement of 9.83\%
                 (median of 6.60\%). However, improvements were three
                 times lower when systems were trained on natural
                 (4.59\%) versus acted data (12.7\%). Importantly, MM
                 accuracy could be accurately predicted (cross-validated
                 R$^2$ of 0.803) from unimodal accuracies and two
                 system-level factors. Theoretical and applied
                 implications and recommendations are discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Maglo:2015:MCS,
  author =       "Adrien Maglo and Guillaume Lavou{\'e} and Florent
                 Dupont and C{\'e}line Hudelot",
  title =        "{$3$D} Mesh Compression: Survey, Comparisons, and
                 Emerging Trends",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "44:1--44:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2693443",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
  abstract =     "3D meshes are commonly used to represent virtual
                 surface and volumes. However, their raw data
                 representations take a large amount of space. Hence, 3D
                 mesh compression has been an active research topic
                 since the mid 1990s. In 2005, two very good review
                 articles describing the pioneering works were
                 published. Yet, new technologies have emerged since
                 then. In this article, we summarize the early works and
                 put the focus on these novel approaches. We classify
                 and describe the algorithms, evaluate their
                 performance, and provide synthetic comparisons. We also
                 outline the emerging trends for future research.",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Diez:2015:QRC,
  author =       "Yago D{\'\i}ez and Ferran Roure and Xavier Llad{\'o}
                 and Joaquim Salvi",
  title =        "A Qualitative Review on {$3$D} Coarse Registration
                 Methods",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "45:1--45:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2692160",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "3D registration or matching is a crucial step in 3D
                 model reconstruction. Registration applications span
                 along a variety of research fields, including
                 computational geometry, computer vision, and geometric
                 modeling. This variety of applications produces many
                 diverse approaches to the problem but at the same time
                 yields divergent notations and a lack of standardized
                 algorithms and guidelines to classify existing methods.
                 In this article, we review the state of the art of the
                 3D rigid registration topic (focused on Coarse
                 Matching) and offer qualitative comparison between the
                 most relevant approaches. Furthermore, we propose a
                 pipeline to classify the existing methods and define a
                 standard formal notation, offering a global point of
                 view of the literature. Our discussion, based on the
                 results presented in the analyzed papers, shows how,
                 although certain aspects of the registration process
                 still need to be tested further in real application
                 situations, the registration pipeline as a whole has
                 progressed steadily. As a result of this progress in
                 all registration aspects, it is now possible to put
                 together algorithms that are able to tackle new and
                 challenging problems with unprecedented data sizes and
                 meeting strict precision criteria.",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ardito:2015:ILD,
  author =       "Carmelo Ardito and Paolo Buono and Maria Francesca
                 Costabile and Giuseppe Desolda",
  title =        "Interaction with Large Displays: a Survey",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "46:1--46:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2682623",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Large interactive displays are increasingly placed in
                 public (or semipublic) locations, including museums,
                 shops, various city settings, and offices. This article
                 discusses the evolution of such displays by looking at
                 their use and analyzing how they are changing the
                 concept of human-computer interaction through new
                 modalities. By surveying the literature on systems
                 using these displays, relevant features were identified
                 and used as classification dimensions. The analysis
                 provided may inform the design and development of
                 future installations. A discussion on research
                 challenges concludes the article.",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pejovic:2015:AMC,
  author =       "Veljko Pejovic and Mirco Musolesi",
  title =        "Anticipatory Mobile Computing: a Survey of the State
                 of the Art and Research Challenges",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "47:1--47:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2693843",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Today's mobile phones are far from the mere
                 communication devices they were 10 years ago. Equipped
                 with sophisticated sensors and advanced computing
                 hardware, phones can be used to infer users' location,
                 activity, social setting, and more. As devices become
                 increasingly intelligent, their capabilities evolve
                 beyond inferring context to predicting it, and then
                 reasoning and acting upon the predicted context. This
                 article provides an overview of the current state of
                 the art in mobile sensing and context prediction paving
                 the way for full-fledged anticipatory mobile computing.
                 We present a survey of phenomena that mobile phones can
                 infer and predict, and offer a description of machine
                 learning techniques used for such predictions. We then
                 discuss proactive decision making and decision delivery
                 via the user-device feedback loop. Finally, we discuss
                 the challenges and opportunities of anticipatory mobile
                 computing.",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zoidi:2015:GBL,
  author =       "Olga Zoidi and Eftychia Fotiadou and Nikos Nikolaidis
                 and Ioannis Pitas",
  title =        "Graph-Based Label Propagation in Digital Media: a
                 Review",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "48:1--48:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2700381",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The expansion of the Internet over the last decade and
                 the proliferation of online social communities, such as
                 Facebook, Google+, and Twitter, as well as multimedia
                 sharing sites, such as YouTube, Flickr, and Picasa, has
                 led to a vast increase of available information to the
                 user. In the case of multimedia data, such as images
                 and videos, fast querying and processing of the
                 available information requires the annotation of the
                 multimedia data with semantic descriptors, that is,
                 labels. However, only a small proportion of the
                 available data are labeled. The rest should undergo an
                 annotation-labeling process. The necessity for the
                 creation of automatic annotation algorithms gave birth
                 to label propagation and semi-supervised learning. In
                 this study, basic concepts in graph-based label
                 propagation methods are discussed. Methods for proper
                 graph construction based on the structure of the
                 available data and label inference methods for
                 spreading label information from a few labeled data to
                 a larger set of unlabeled data are reviewed.
                 Applications of label propagation algorithms in digital
                 media, as well as evaluation metrics for measuring
                 their performance, are presented.",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tiwari:2015:CFM,
  author =       "Nidhi Tiwari and Santonu Sarkar and Umesh Bellur and
                 Maria Indrawan",
  title =        "Classification Framework of {MapReduce} Scheduling
                 Algorithms",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "49:1--49:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2693315",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A MapReduce scheduling algorithm plays a critical role
                 in managing large clusters of hardware nodes and
                 meeting multiple quality requirements by controlling
                 the order and distribution of users, jobs, and tasks
                 execution. A comprehensive and structured survey of the
                 scheduling algorithms proposed so far is presented here
                 using a novel multidimensional classification
                 framework. These dimensions are (i) meeting quality
                 requirements, (ii) scheduling entities, and (iii)
                 adapting to dynamic environments; each dimension has
                 its own taxonomy. An empirical evaluation framework for
                 these algorithms is recommended. This survey identifies
                 various open issues and directions for future
                 research.",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wendzel:2015:PBS,
  author =       "Steffen Wendzel and Sebastian Zander and Bernhard
                 Fechner and Christian Herdin",
  title =        "Pattern-Based Survey and Categorization of Network
                 Covert Channel Techniques",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "50:1--50:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2684195",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Network covert channels are used to hide communication
                 inside network protocols. Various techniques for covert
                 channels have arisen in the past few decades. We
                 surveyed and analyzed 109 techniques developed between
                 1987 and 2013 and show that these techniques can be
                 reduced to only 11 different patterns. Moreover, the
                 majority (69.7\%) of techniques can be categorized into
                 only four different patterns (i.e., most techniques we
                 surveyed are similar). We represent the patterns in a
                 hierarchical catalog using a pattern language. Our
                 pattern catalog will serve as a base for future covert
                 channel novelty evaluation. Furthermore, we apply the
                 concept of pattern variations to network covert
                 channels. With pattern variations, the context of a
                 pattern can change. For example, a channel developed
                 for IPv4 can automatically be adapted to other network
                 protocols. We also propose the pattern-based covert
                 channel optimizations pattern hopping and pattern
                 combination. Finally, we lay the foundation for
                 pattern-based countermeasures: whereas many current
                 countermeasures were developed for specific channels, a
                 pattern-oriented approach allows application of one
                 countermeasure to multiple channels. Hence, future
                 countermeasure development can focus on patterns, and
                 the development of real-world protection against covert
                 channels is greatly simplified.",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hani:2015:RSL,
  author =       "Ahmad Fadzil M. Hani and Irving Vitra Paputungan and
                 Mohd Fadzil Hassan",
  title =        "Renegotiation in Service Level Agreement Management
                 for a Cloud-Based System",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "51:1--51:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2716319",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Managing Service Level Agreement (SLA) within a
                 cloud-based system is important to maintain service
                 continuity and improve trust due to cloud flexibility
                 and scalability. We conduct a general review on
                 cloud-based systems to understand how service
                 continuity and trust are addressed in cloud SLA
                 management. The review shows that SLA renegotiation is
                 necessary to improve trust and maintain service
                 continuity; however, research on SLA renegotiation is
                 limited. Of the two key approaches in renegotiation,
                 namely bargaining-based negotiation and offer
                 generation--based negotiation, the latter approach is
                 the most promising due to its ability to generate
                 optimized multiple-offer SLA parameters within one
                 round during renegotiation.",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gibaja:2015:TML,
  author =       "Eva Gibaja and Sebasti{\'a}n Ventura",
  title =        "A Tutorial on Multilabel Learning",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "52:1--52:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2716262",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Multilabel learning has become a relevant learning
                 paradigm in the past years due to the increasing number
                 of fields where it can be applied and also to the
                 emerging number of techniques that are being developed.
                 This article presents an up-to-date tutorial about
                 multilabel learning that introduces the paradigm and
                 describes the main contributions developed. Evaluation
                 measures, fields of application, trending topics, and
                 resources are also presented.",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sgora:2015:STS,
  author =       "Aggeliki Sgora and Dimitrios J. Vergados and Dimitrios
                 D. Vergados",
  title =        "A Survey of {TDMA} Scheduling Schemes in Wireless
                 Multihop Networks",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "53:1--53:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2677955",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "One of the major problems in wireless multihop
                 networks is the scheduling of transmissions in a fair
                 and efficient manner. Time Division Multiple Access
                 (TDMA) seems to be one of the dominant solutions to
                 achieve this goal since it is a simple scheme and can
                 prolong the devices' lifetime by allowing them to
                 transmit only a portion of the time during
                 conversation. For that reason, several TDMA scheduling
                 algorithms may be found in the literature. The scope of
                 this article is to classify the existing TDMA
                 scheduling algorithms based on several factors, such as
                 the entity that is scheduled, the network topology
                 information that is needed to produce or maintain the
                 schedule, and the entity or entities that perform the
                 computation that produces and maintains the schedules,
                 and to discuss the advantages and disadvantages of each
                 category.",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yang:2015:MIL,
  author =       "Zheng Yang and Chenshu Wu and Zimu Zhou and Xinglin
                 Zhang and Xu Wang and Yunhao Liu",
  title =        "Mobility Increases Localizability: a Survey on
                 Wireless Indoor Localization using Inertial Sensors",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "3",
  pages =        "54:1--54:??",
  month =        apr,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2676430",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 16 18:47:49 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Wireless indoor positioning has been extensively
                 studied for the past 2 decades and continuously
                 attracted growing research efforts in mobile computing
                 context. As the integration of multiple inertial
                 sensors (e.g., accelerometer, gyroscope, and
                 magnetometer) to nowadays smartphones in recent years,
                 human-centric mobility sensing is emerging and coming
                 into vogue. Mobility information, as a new dimension in
                 addition to wireless signals, can benefit localization
                 in a number of ways, since location and mobility are by
                 nature related in the physical world. In this article,
                 we survey this new trend of mobility enhancing
                 smartphone-based indoor localization. Specifically, we
                 first study how to measure human mobility: what types
                 of sensors we can use and what types of mobility
                 information we can acquire. Next, we discuss how
                 mobility assists localization with respect to enhancing
                 location accuracy, decreasing deployment cost, and
                 enriching location context. Moreover, considering the
                 quality and cost of smartphone built-in sensors,
                 handling measurement errors is essential and
                 accordingly investigated. Combining existing work and
                 our own working experiences, we emphasize the
                 principles and conduct comparative study of the
                 mainstream technologies. Finally, we conclude this
                 survey by addressing future research directions and
                 opportunities in this new and largely open area.",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Vasilomanolakis:2015:TSC,
  author =       "Emmanouil Vasilomanolakis and Shankar Karuppayah and
                 Max M{\"u}hlh{\"a}user and Mathias Fischer",
  title =        "Taxonomy and Survey of Collaborative Intrusion
                 Detection",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "55:1--55:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2716260",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The dependency of our society on networked computers
                 has become frightening: In the economy, all-digital
                 networks have turned from facilitators to drivers; as
                 cyber-physical systems are coming of age, computer
                 networks are now becoming the central nervous systems
                 of our physical world-even of highly critical
                 infrastructures such as the power grid. At the same
                 time, the 24/7 availability and correct functioning of
                 networked computers has become much more threatened:
                 The number of sophisticated and highly tailored attacks
                 on IT systems has significantly increased. Intrusion
                 Detection Systems (IDSs) are a key component of the
                 corresponding defense measures; they have been
                 extensively studied and utilized in the past. Since
                 conventional IDSs are not scalable to big company
                 networks and beyond, nor to massively parallel attacks,
                 Collaborative IDSs (CIDSs) have emerged. They consist
                 of several monitoring components that collect and
                 exchange data. Depending on the specific CIDS
                 architecture, central or distributed analysis
                 components mine the gathered data to identify attacks.
                 Resulting alerts are correlated among multiple monitors
                 in order to create a holistic view of the network
                 monitored. This article first determines relevant
                 requirements for CIDSs; it then differentiates distinct
                 building blocks as a basis for introducing a CIDS
                 design space and for discussing it with respect to
                 requirements. Based on this design space, attacks that
                 evade CIDSs and attacks on the availability of the
                 CIDSs themselves are discussed. The entire framework of
                 requirements, building blocks, and attacks as
                 introduced is then used for a comprehensive analysis of
                 the state of the art in collaborative intrusion
                 detection, including a detailed survey and comparison
                 of specific CIDS approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Karimi:2015:TDM,
  author =       "Sarvnaz Karimi and Chen Wang and Alejandro
                 Metke-Jimenez and Raj Gaire and Cecile Paris",
  title =        "Text and Data Mining Techniques in Adverse Drug
                 Reaction Detection",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "56:1--56:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2719920",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We review data mining and related computer science
                 techniques that have been studied in the area of drug
                 safety to identify signals of adverse drug reactions
                 from different data sources, such as spontaneous
                 reporting databases, electronic health records, and
                 medical literature. Development of such techniques has
                 become more crucial for public heath, especially with
                 the growth of data repositories that include either
                 reports of adverse drug reactions, which require fast
                 processing for discovering signals of adverse
                 reactions, or data sources that may contain such
                 signals but require data or text mining techniques to
                 discover them. In order to highlight the importance of
                 contributions made by computer scientists in this area
                 so far, we categorize and review the existing
                 approaches, and most importantly, we identify areas
                 where more research should be undertaken.",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shi:2015:SIR,
  author =       "Shu Shi and Cheng-Hsin Hsu",
  title =        "A Survey of Interactive Remote Rendering Systems",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "57:1--57:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2719921",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Remote rendering means rendering 3D graphics on a
                 computing device and displaying the results on another
                 computing device connected through a network. The
                 concept was originally developed for sharing computing
                 resources remotely. It has been receiving increasing
                 attention from researchers in both academia and
                 industry in recent years due to the proliferation of
                 cloud computing and mobile devices. In this article, we
                 survey the interactive remote rendering systems
                 proposed in the literature, analyze how to improve the
                 state of the art, and summarize the related
                 technologies. The readers of this article will
                 understand the history of remote rendering systems and
                 obtain some inspirations of the future research
                 directions in this area.",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sufatrio:2015:SAS,
  author =       "Sufatrio and Darell J. J. Tan and Tong-Wei Chua and
                 Vrizlynn L. L. Thing",
  title =        "Securing {Android}: a Survey, Taxonomy, and
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "58:1--58:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2733306",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recent years have seen a global adoption of smart
                 mobile devices, particularly those based on Android.
                 However, Android's widespread adoption is marred with
                 increasingly rampant malware threats. This article
                 gives a survey and taxonomy of existing works that
                 secure Android devices. Based on Android app deployment
                 stages, the taxonomy enables us to analyze schemes that
                 share similar objective and approach and to inspect
                 their key differences. Additionally, this article
                 highlights the limitations of existing works and
                 current challenges. It thus distills the state of the
                 art in Android security research and identifies
                 potential research directions for safeguarding billions
                 (and keep counting) of Android-run devices.",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{OCoileain:2015:AAC,
  author =       "Diarmuid {{\'O} Coile{\'a}in} and Donal O'Mahony",
  title =        "Accounting and Accountability in Content Distribution
                 Architectures: a Survey",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "59:1--59:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2723701",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Many content distribution architectures offer
                 desirable elements that lead to less bandwidth usage,
                 reduced network congestion, higher content
                 availability, and reduced costs. However, their level
                 of adoption and utilization in commercial environments
                 depends on the level of content accounting and
                 accountability they offer. Content accounting refers to
                 any information that a content distributor needs to
                 track relating to the delivery of content to its
                 intended consumers. In contrast, content accountability
                 refers to the willingness of the communicating
                 infrastructure to produce accurate and verifiable
                 information about the content distribution process.
                 This article surveys existing and proposed future
                 content delivery architectures detailing their
                 methodologies for providing efficient low-cost content
                 distribution, content accounting, and accountability
                 across trustworthy and untrustworthy infrastructures.
                 We use two methods to help identify the drawbacks and
                 merits of these architectures. The first is a taxonomy
                 for accounting information based on our analysis of
                 logging information gathered from the surveyed systems.
                 The second is a generic model for content distribution
                 based on a synthesis of desirable elements from the
                 surveyed architectures. These methods help highlight
                 key architectural elements required for efficient
                 low-cost content distribution. Finally, we identify
                 outstanding challenges related to establishing
                 accountability in accounting information produced for
                 content distributed across trusted and untrusted
                 infrastructures.",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{deAraujo:2015:SIS,
  author =       "B. R. de Ara{\'u}jo and Daniel S. Lopes and Pauline
                 Jepp and Joaquim A. Jorge and Brian Wyvill",
  title =        "A Survey on Implicit Surface Polygonization",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "60:1--60:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2732197",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Implicit surfaces (IS) are commonly used in image
                 creation, modeling environments, modeling objects, and
                 scientific data visualization. In this article, we
                 present a survey of different techniques for fast
                 visualization of IS. The main classes of visualization
                 algorithms are identified along with the advantages of
                 each in the context of the different types of IS
                 commonly used in computer graphics. We focus closely on
                 polygonization methods, as they are the most suited to
                 fast visualization. Classification and comparison of
                 existing approaches are presented using criteria
                 extracted from current research. This enables the
                 identification of the best strategies according to the
                 number of specific requirements, such as speed,
                 accuracy, quality, or stylization.",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mukhopadhyay:2015:SME,
  author =       "Anirban Mukhopadhyay and Ujjwal Maulik and Sanghamitra
                 Bandyopadhyay",
  title =        "A Survey of Multiobjective Evolutionary Clustering",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "61:1--61:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2742642",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Data clustering is a popular unsupervised data mining
                 tool that is used for partitioning a given dataset into
                 homogeneous groups based on some
                 similarity/dissimilarity metric. Traditional clustering
                 algorithms often make prior assumptions about the
                 cluster structure and adopt a corresponding suitable
                 objective function that is optimized either through
                 classical techniques or metaheuristic approaches. These
                 algorithms are known to perform poorly when the cluster
                 assumptions do not hold in the data. Multiobjective
                 clustering, in which multiple objective functions are
                 simultaneously optimized, has emerged as an attractive
                 and robust alternative in such situations. In
                 particular, application of multiobjective evolutionary
                 algorithms for clustering has become popular in the
                 past decade because of their population-based nature.
                 Here, we provide a comprehensive and critical survey of
                 the multitude of multiobjective evolutionary clustering
                 techniques existing in the literature. The techniques
                 are classified according to the encoding strategies
                 adopted, objective functions, evolutionary operators,
                 strategy for maintaining nondominated solutions, and
                 the method of selection of the final solution. The pros
                 and cons of the different approaches are mentioned.
                 Finally, we have discussed some real-life applications
                 of multiobjective clustering in the domains of image
                 segmentation, bioinformatics, web mining, and so
                 forth.",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wael:2015:PGA,
  author =       "Mattias {De Wael} and Stefan Marr and Bruno {De
                 Fraine} and Tom {Van Cutsem} and Wolfgang {De Meuter}",
  title =        "Partitioned Global Address Space Languages",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "62:1--62:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2716320",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Partitioned Global Address Space (PGAS) model is a
                 parallel programming model that aims to improve
                 programmer productivity while at the same time aiming
                 for high performance. The main premise of PGAS is that
                 a globally shared address space improves productivity,
                 but that a distinction between local and remote data
                 accesses is required to allow performance optimizations
                 and to support scalability on large-scale parallel
                 architectures. To this end, PGAS preserves the global
                 address space while embracing awareness of nonuniform
                 communication costs. Today, about a dozen languages
                 exist that adhere to the PGAS model. This survey
                 proposes a definition and a taxonomy along four axes:
                 how parallelism is introduced, how the address space is
                 partitioned, how data is distributed among the
                 partitions, and finally, how data is accessed across
                 partitions. Our taxonomy reveals that today's PGAS
                 languages focus on distributing regular data and
                 distinguish only between local and remote data access
                 cost, whereas the distribution of irregular data and
                 the adoption of richer data access cost models remain
                 open challenges.",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhan:2015:CCR,
  author =       "Zhi-Hui Zhan and Xiao-Fang Liu and Yue-Jiao Gong and
                 Jun Zhang and Henry Shu-Hung Chung and Yun Li",
  title =        "Cloud Computing Resource Scheduling and a Survey of
                 Its Evolutionary Approaches",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "63:1--63:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2788397",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A disruptive technology fundamentally transforming the
                 way that computing services are delivered, cloud
                 computing offers information and communication
                 technology users a new dimension of convenience of
                 resources, as services via the Internet. Because cloud
                 provides a finite pool of virtualized on-demand
                 resources, optimally scheduling them has become an
                 essential and rewarding topic, where a trend of using
                 Evolutionary Computation (EC) algorithms is emerging
                 rapidly. Through analyzing the cloud computing
                 architecture, this survey first presents taxonomy at
                 two levels of scheduling cloud resources. It then
                 paints a landscape of the scheduling problem and
                 solutions. According to the taxonomy, a comprehensive
                 survey of state-of-the-art approaches is presented
                 systematically. Looking forward, challenges and
                 potential future research directions are investigated
                 and invited, including real-time scheduling, adaptive
                 dynamic scheduling, large-scale scheduling,
                 multiobjective scheduling, and distributed and parallel
                 scheduling. At the dawn of Industry 4.0, cloud
                 computing scheduling for cyber-physical integration
                 with the presence of big data is also discussed.
                 Research in this area is only in its infancy, but with
                 the rapid fusion of information and data technology,
                 more exciting and agenda-setting topics are likely to
                 emerge on the horizon.",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Moghaddam:2015:EEN,
  author =       "Fahimeh Alizadeh Moghaddam and Patricia Lago and Paola
                 Grosso",
  title =        "Energy-Efficient Networking Solutions in Cloud-Based
                 Environments: a Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "64:1--64:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2764464",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The energy consumed by data centers hosting cloud
                 services is increasing enormously. This brings the need
                 to reduce energy consumption of different components in
                 data centers. In this work, we focus on energy
                 efficiency of the networking component. However, how
                 different networking solutions impact energy
                 consumption is still an open question. We investigate
                 the state of the art in energy-efficient networking
                 solutions in cloud-based environments. We follow a
                 systematic literature review method to select primary
                 studies. We create a metamodel based on the codes
                 extracted from our primary studies using the Coding
                 analytical method. Our findings show three abstraction
                 levels of the proposed networking solutions to achieve
                 energy efficiency in cloud-based environments:
                 Strategy, Solution, and Technology. We study the
                 historical trends in the investigated solutions and
                 conclude that the emerging and most widely adopted one
                 is the Decision framework.",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sookhak:2015:RDA,
  author =       "Mehdi Sookhak and Abdullah Gani and Hamid Talebian and
                 Adnan Akhunzada and Samee U. Khan and Rajkumar Buyya
                 and Albert Y. Zomaya",
  title =        "Remote Data Auditing in Cloud Computing Environments:
                 a Survey, Taxonomy, and Open Issues",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "65:1--65:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2764465",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cloud computing has emerged as a long-dreamt vision of
                 the utility computing paradigm that provides reliable
                 and resilient infrastructure for users to remotely
                 store data and use on-demand applications and services.
                 Currently, many individuals and organizations mitigate
                 the burden of local data storage and reduce the
                 maintenance cost by outsourcing data to the cloud.
                 However, the outsourced data is not always trustworthy
                 due to the loss of physical control and possession over
                 the data. As a result, many scholars have concentrated
                 on relieving the security threats of the outsourced
                 data by designing the Remote Data Auditing (RDA)
                 technique as a new concept to enable public
                 auditability for the stored data in the cloud. The RDA
                 is a useful technique to check the reliability and
                 integrity of data outsourced to a single or distributed
                 servers. This is because all of the RDA techniques for
                 single cloud servers are unable to support data
                 recovery; such techniques are complemented with
                 redundant storage mechanisms. The article also reviews
                 techniques of remote data auditing more comprehensively
                 in the domain of the distributed clouds in conjunction
                 with the presentation of classifying ongoing
                 developments within this specified area. The thematic
                 taxonomy of the distributed storage auditing is
                 presented based on significant parameters, such as
                 scheme nature, security pattern, objective functions,
                 auditing mode, update mode, cryptography model, and
                 dynamic data structure. The more recent remote auditing
                 approaches, which have not gained considerable
                 attention in distributed cloud environments, are also
                 critically analyzed and further categorized into three
                 different classes, namely, replication based, erasure
                 coding based, and network coding based, to present a
                 taxonomy. This survey also aims to investigate
                 similarities and differences of such a framework on the
                 basis of the thematic taxonomy to diagnose significant
                 and explore major outstanding issues.",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kamisinski:2015:ASC,
  author =       "Andrzej Kamisi{\'n}ski and Piotr Cholda and Andrzej
                 Jajszczyk",
  title =        "Assessing the Structural Complexity of Computer and
                 Communication Networks",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "66:1--66:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2755621",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In this tutorial, 17 structural complexity indices are
                 presented and compared, each representing one of the
                 following categories: adjacency- and distance-based
                 metrics, Shannon entropy-based metrics, product
                 measures, subgraph-based metrics, and path- and
                 walk-based metrics. The applicability of these indices
                 to computer and communication networks is evaluated
                 with the aid of different elementary, specifically
                 designed, random, and real network topologies. On the
                 grounds of the evaluation study, advantages and
                 disadvantages of particular metrics are identified. In
                 addition, their general properties and runtimes are
                 assessed, and a general view on the structural network
                 complexity is presented.",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Imran:2015:PSM,
  author =       "Muhammad Imran and Carlos Castillo and Fernando Diaz
                 and Sarah Vieweg",
  title =        "Processing Social Media Messages in Mass Emergency: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "67:1--67:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2771588",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Social media platforms provide active communication
                 channels during mass convergence and emergency events
                 such as disasters caused by natural hazards. As a
                 result, first responders, decision makers, and the
                 public can use this information to gain insight into
                 the situation as it unfolds. In particular, many social
                 media messages communicated during emergencies convey
                 timely, actionable information. Processing social media
                 messages to obtain such information, however, involves
                 solving multiple challenges including: parsing brief
                 and informal messages, handling information overload,
                 and prioritizing different types of information found
                 in messages. These challenges can be mapped to
                 classical information processing operations such as
                 filtering, classifying, ranking, aggregating,
                 extracting, and summarizing. We survey the state of the
                 art regarding computational methods to process social
                 media messages and highlight both their contributions
                 and shortcomings. In addition, we examine their
                 particularities, and methodically examine a series of
                 key subproblems ranging from the detection of events to
                 the creation of actionable and useful summaries.
                 Research thus far has, to a large extent, produced
                 methods to extract situational awareness information
                 from social media. In this survey, we cover these
                 various approaches, and highlight their benefits and
                 shortcomings. We conclude with research challenges that
                 go beyond situational awareness, and begin to look at
                 supporting decision making and coordinating
                 emergency-response actions.",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Huang:2015:SPI,
  author =       "Wei Huang and Afshar Ganjali and Beom Heyn Kim and
                 Sukwon Oh and David Lie",
  title =        "The State of Public Infrastructure-as-a-Service Cloud
                 Security",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "68:1--68:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2767181",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The public Infrastructure-as-a-Service (IaaS) cloud
                 industry has reached a critical mass in the past few
                 years, with many cloud service providers fielding
                 competing services. Despite the competition, we find
                 some of the security mechanisms offered by the services
                 to be similar, indicating that the cloud industry has
                 established a number of ``best-practices,'' while other
                 security mechanisms vary widely, indicating that there
                 is also still room for innovation and experimentation.
                 We investigate these differences and possible
                 underlying reasons for it. We also contrast the
                 security mechanisms offered by public IaaS cloud
                 offerings and with security mechanisms proposed by
                 academia over the same period. Finally, we speculate on
                 how industry and academia might work together to solve
                 the pressing security problems in public IaaS clouds
                 going forward.",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mittal:2015:SCG,
  author =       "Sparsh Mittal and Jeffrey S. Vetter",
  title =        "A Survey of {CPU--GPU} Heterogeneous Computing
                 Techniques",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "69:1--69:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2788396",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "As both CPUs and GPUs become employed in a wide range
                 of applications, it has been acknowledged that both of
                 these Processing Units (PUs) have their unique features
                 and strengths and hence, CPU-GPU collaboration is
                 inevitable to achieve high-performance computing. This
                 has motivated a significant amount of research on
                 heterogeneous computing techniques, along with the
                 design of CPU-GPU fused chips and petascale
                 heterogeneous supercomputers. In this article, we
                 survey Heterogeneous Computing Techniques (HCTs) such
                 as workload partitioning that enable utilizing both
                 CPUs and GPUs to improve performance and/or energy
                 efficiency. We review heterogeneous computing
                 approaches at runtime, algorithm, programming,
                 compiler, and application levels. Further, we review
                 both discrete and fused CPU-GPU systems and discuss
                 benchmark suites designed for evaluating Heterogeneous
                 Computing Systems (HCSs). We believe that this article
                 will provide insights into the workings and scope of
                 applications of HCTs to researchers and motivate them
                 to further harness the computational powers of CPUs and
                 GPUs to achieve the goal of exascale performance.",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Xu:2015:SAT,
  author =       "Tianyin Xu and Yuanyuan Zhou",
  title =        "Systems Approaches to Tackling Configuration Errors: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "47",
  number =       "4",
  pages =        "70:1--70:??",
  month =        jul,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2791577",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:09:40 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In recent years, configuration errors (i.e.,
                 misconfigurations) have become one of the dominant
                 causes of system failures, resulting in many severe
                 service outages and downtime. Unfortunately, it is
                 notoriously difficult for system users (e.g.,
                 administrators and operators) to prevent, detect, and
                 troubleshoot configuration errors due to the complexity
                 of the configurations as well as the systems under
                 configuration. As a result, the cost of resolving
                 configuration errors is often tremendous from the
                 aspects of both compensating the service disruptions
                 and diagnosing, recovering from the failures. The
                 prevalence, severity, and cost have made configuration
                 errors one of the most thorny system problems that
                 desire to be addressed. This survey article provides a
                 holistic and structured overview of the systems
                 approaches that tackle configuration errors. To
                 understand the problem fundamentally, we first discuss
                 the characteristics of configuration errors and the
                 challenges of tackling such errors. Then, we discuss
                 the state-of-the-art systems approaches that address
                 different types of configuration errors in different
                 scenarios. Our primary goal is to equip the stakeholder
                 with a better understanding of configuration errors and
                 the potential solutions for resolving configuration
                 errors in the spectrum of system development and
                 management. To inspire follow-up research, we further
                 discuss the open problems with regard to system
                 configuration. To the best of our knowledge, this is
                 the first survey on the topic of tackling configuration
                 errors.",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Meng:2015:CSS,
  author =       "Guozhu Meng and Yang Liu and Jie Zhang and Alexander
                 Pokluda and Raouf Boutaba",
  title =        "Collaborative Security: a Survey and Taxonomy",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "1:1--1:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2785733",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Security is oftentimes centrally managed. An
                 alternative trend of using collaboration in order to
                 improve security has gained momentum over the past few
                 years. Collaborative security is an abstract concept
                 that applies to a wide variety of systems and has been
                 used to solve security issues inherent in distributed
                 environments. Thus far, collaboration has been used in
                 many domains such as intrusion detection, spam
                 filtering, botnet resistance, and vulnerability
                 detection. In this survey, we focus on different
                 mechanisms of collaboration and defense in
                 collaborative security. We systematically investigate
                 numerous use cases of collaborative security by
                 covering six types of security systems. Aspects of
                 these systems are thoroughly studied, including their
                 technologies, standards, frameworks, strengths and
                 weaknesses. We then present a comprehensive study with
                 respect to their analysis target, timeliness of
                 analysis, architecture, network infrastructure,
                 initiative, shared information and interoperability. We
                 highlight five important topics in collaborative
                 security, and identify challenges and possible
                 directions for future research. Our work contributes
                 the following to the existing research on collaborative
                 security with the goal of helping to make collaborative
                 security systems more resilient and efficient. This
                 study (1) clarifies the scope of collaborative
                 security, (2) identifies the essential components of
                 collaborative security, (3) analyzes the multiple
                 mechanisms of collaborative security, and (4)
                 identifies challenges in the design of collaborative
                 security.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ardagna:2015:SAC,
  author =       "Claudio A. Ardagna and Rasool Asal and Ernesto Damiani
                 and Quang Hieu Vu",
  title =        "From Security to Assurance in the Cloud: a Survey",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "2:1--2:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2767005",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The cloud computing paradigm has become a mainstream
                 solution for the deployment of business processes and
                 applications. In the public cloud vision,
                 infrastructure, platform, and software services are
                 provisioned to tenants (i.e., customers and service
                 providers) on a pay-as-you-go basis. Cloud tenants can
                 use cloud resources at lower prices, and higher
                 performance and flexibility, than traditional
                 on-premises resources, without having to care about
                 infrastructure management. Still, cloud tenants remain
                 concerned with the cloud's level of service and the
                 nonfunctional properties their applications can count
                 on. In the last few years, the research community has
                 been focusing on the nonfunctional aspects of the cloud
                 paradigm, among which cloud security stands out.
                 Several approaches to security have been described and
                 summarized in general surveys on cloud security
                 techniques. The survey in this article focuses on the
                 interface between cloud security and cloud security
                 assurance. First, we provide an overview of the state
                 of the art on cloud security. Then, we introduce the
                 notion of cloud security assurance and analyze its
                 growing impact on cloud security approaches. Finally,
                 we present some recommendations for the development of
                 next-generation cloud security and assurance
                 solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mitsch:2015:LBM,
  author =       "Stefan Mitsch and Andr{\'e} Platzer and Werner
                 Retschitzegger and Wieland Schwinger",
  title =        "Logic-Based Modeling Approaches for Qualitative and
                 Hybrid Reasoning in Dynamic Spatial Systems",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "3:1--3:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2764901",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Autonomous agents that operate as components of
                 dynamic spatial systems are becoming increasingly
                 popular and mainstream. Applications can be found in
                 consumer robotics, in road, rail, and air
                 transportation, manufacturing, and military operations.
                 Unfortunately, the approaches to modeling and analyzing
                 the behavior of dynamic spatial systems are just as
                 diverse as these application domains. In this article,
                 we discuss reasoning approaches for the medium-term
                 control of autonomous agents in dynamic spatial
                 systems, which requires a sufficiently detailed
                 description of the agent's behavior and environment but
                 may still be conducted in a qualitative manner. We
                 survey logic-based qualitative and hybrid modeling and
                 commonsense reasoning approaches with respect to their
                 features for describing and analyzing dynamic spatial
                 systems in general, and the actions of autonomous
                 agents operating therein in particular. We introduce a
                 conceptual reference model, which summarizes the
                 current understanding of the characteristics of dynamic
                 spatial systems based on a catalog of evaluation
                 criteria derived from the model. We assess the modeling
                 features provided by logic-based qualitative
                 commonsense and hybrid approaches for projection,
                 planning, simulation, and verification of dynamic
                 spatial systems. We provide a comparative summary of
                 the modeling features, discuss lessons learned, and
                 introduce a research roadmap for integrating different
                 approaches of dynamic spatial system analysis to
                 achieve coverage of all required features.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ibidunmoye:2015:PAD,
  author =       "Olumuyiwa Ibidunmoye and Francisco
                 Hern{\'a}ndez-Rodriguez and Erik Elmroth",
  title =        "Performance Anomaly Detection and Bottleneck
                 Identification",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "4:1--4:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2791120",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In order to meet stringent performance requirements,
                 system administrators must effectively detect
                 undesirable performance behaviours, identify potential
                 root causes, and take adequate corrective measures. The
                 problem of uncovering and understanding performance
                 anomalies and their causes (bottlenecks) in different
                 system and application domains is well studied. In
                 order to assess progress, research trends, and identify
                 open challenges, we have reviewed major contributions
                 in the area and present our findings in this survey.
                 Our approach provides an overview of anomaly detection
                 and bottleneck identification research as it relates to
                 the performance of computing systems. By identifying
                 fundamental elements of the problem, we are able to
                 categorize existing solutions based on multiple factors
                 such as the detection goals, nature of applications and
                 systems, system observability, and detection methods.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Alsalibi:2015:IBI,
  author =       "Bisan Alsalibi and Ibrahim Venkat and K. G.
                 Subramanian and Syaheerah Lebai Lutfi and Philippe {De
                 Wilde}",
  title =        "The Impact of Bio-Inspired Approaches Toward the
                 Advancement of Face Recognition",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "5:1--5:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2791121",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "An increased number of bio-inspired face recognition
                 systems have emerged in recent decades owing to their
                 intelligent problem-solving ability, flexibility,
                 scalability, and adaptive nature. Hence, this survey
                 aims to present a detailed overview of bio-inspired
                 approaches pertaining to the advancement of face
                 recognition. Based on a well-classified taxonomy,
                 relevant bio-inspired techniques and their merits and
                 demerits in countering potential problems vital to face
                 recognition are analyzed. A synthesis of various
                 approaches in terms of key governing principles and
                 their associated performance analysis are
                 systematically portrayed. Finally, some intuitive
                 future directions are suggested on how bio-inspired
                 approaches can contribute to the advancement of face
                 biometrics in the years to come.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Naveed:2015:PGE,
  author =       "Muhammad Naveed and Erman Ayday and Ellen W. Clayton
                 and Jacques Fellay and Carl A. Gunter and Jean-Pierre
                 Hubaux and Bradley A. Malin and Xiaofeng Wang",
  title =        "Privacy in the Genomic Era",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "6:1--6:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2767007",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Genome sequencing technology has advanced at a rapid
                 pace and it is now possible to generate highly-detailed
                 genotypes inexpensively. The collection and analysis of
                 such data has the potential to support various
                 applications, including personalized medical services.
                 While the benefits of the genomics revolution are
                 trumpeted by the biomedical community, the increased
                 availability of such data has major implications for
                 personal privacy; notably because the genome has
                 certain essential features, which include (but are not
                 limited to) (i) an association with traits and certain
                 diseases, (ii) identification capability (e.g.,
                 forensics), and (iii) revelation of family
                 relationships. Moreover, direct-to-consumer DNA testing
                 increases the likelihood that genome data will be made
                 available in less regulated environments, such as the
                 Internet and for-profit companies. The problem of
                 genome data privacy thus resides at the crossroads of
                 computer science, medicine, and public policy. While
                 the computer scientists have addressed data privacy for
                 various data types, there has been less attention
                 dedicated to genomic data. Thus, the goal of this paper
                 is to provide a systematization of knowledge for the
                 computer science community. In doing so, we address
                 some of the (sometimes erroneous) beliefs of this field
                 and we report on a survey we conducted about genome
                 data privacy with biomedical specialists. Then, after
                 characterizing the genome privacy problem, we review
                 the state-of-the-art regarding privacy attacks on
                 genomic data and strategies for mitigating such
                 attacks, as well as contextualizing these attacks from
                 the perspective of medicine and public policy. This
                 paper concludes with an enumeration of the challenges
                 for genome data privacy and presents a framework to
                 systematize the analysis of threats and the design of
                 countermeasures as the field moves forward.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Guo:2015:MCS,
  author =       "Bin Guo and Zhu Wang and Zhiwen Yu and Yu Wang and
                 Neil Y. Yen and Runhe Huang and Xingshe Zhou",
  title =        "Mobile Crowd Sensing and Computing: The Review of an
                 Emerging Human-Powered Sensing Paradigm",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "7:1--7:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2794400",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "With the surging of smartphone sensing, wireless
                 networking, and mobile social networking techniques,
                 Mobile Crowd Sensing and Computing (MCSC) has become a
                 promising paradigm for cross-space and large-scale
                 sensing. MCSC extends the vision of participatory
                 sensing by leveraging both participatory sensory data
                 from mobile devices (offline) and user-contributed data
                 from mobile social networking services (online).
                 Further, it explores the complementary roles and
                 presents the fusion/collaboration of machine and human
                 intelligence in the crowd sensing and computing
                 processes. This article characterizes the unique
                 features and novel application areas of MCSC and
                 proposes a reference framework for building
                 human-in-the-loop MCSC systems. We further clarify the
                 complementary nature of human and machine intelligence
                 and envision the potential of deep-fused human--machine
                 systems. We conclude by discussing the limitations,
                 open issues, and research opportunities of MCSC.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ruiz:2015:SBA,
  author =       "Patricia Ruiz and Pascal Bouvry",
  title =        "Survey on Broadcast Algorithms for Mobile Ad Hoc
                 Networks",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "8:1--8:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2786005",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Networking at any time and any place paves the way for
                 a large number of possible applications in ad hoc
                 networks, from disaster relief in remote areas to
                 network extension. Thus, for the past decades, many
                 works have been proposed trying to make ad hoc networks
                 a reality. The importance of broadcasting in networking
                 and the broadcast nature of the wireless medium have
                 encouraged researchers to join their efforts on
                 designing efficient dissemination algorithms for Mobile
                 Ad Hoc Networks (MANETs). The many different challenges
                 that MANETs face, such as limited network resources,
                 network partitions, or energy restrictions, gave rise
                 to many different approaches to overcome one or more of
                 those problems. Therefore, literature reveals a huge
                 variety of techniques that have been proposed for
                 efficient message dissemination. In this article, we
                 make an in-depth review of the existing
                 state-of-the-art techniques, as well as propose a new
                 taxonomy that provides a global overview of the most
                 relevant existing algorithms.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hong:2015:LRE,
  author =       "Hyejeong Hong and Jaeil Lim and Hyunyul Lim and Sungho
                 Kang",
  title =        "Lifetime Reliability Enhancement of Microprocessors:
                 Mitigating the Impact of Negative Bias Temperature
                 Instability",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "9:1--9:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2785988",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Ensuring lifetime reliability of microprocessors has
                 become more critical. Continuous scaling and increasing
                 temperatures due to growing power density are
                 threatening lifetime reliability. Negative bias
                 temperature instability (NBTI) has been known for
                 decades, but its impact has been insignificant compared
                 to other factors. Aggressive scaling, however, makes
                 NBTI the most serious threat to chip lifetime
                 reliability in today's and future process technologies.
                 The delay of microprocessors gradually increases as
                 time goes by, due to stress and recovery phases. The
                 delay eventually becomes higher than the value required
                 to meet design constraints, which results in failed
                 systems. In this article, the mechanism of NBTI and its
                 effects on lifetime reliability are presented, then
                 various techniques to mitigate NBTI degradation on
                 microprocessors are introduced. The mitigation can be
                 addressed at either the circuit level or architectural
                 level. Circuit-level techniques include design-time
                 techniques such as transistor sizing and NBTI-aware
                 synthesis. Forward body biasing, and adaptive voltage
                 scaling are adaptive techniques that can mitigate NBTI
                 degradation at the circuit level by controlling the
                 threshold voltage or supply voltage to hide the
                 lengthened delay caused by NBTI degradation.
                 Reliability has been regarded as something to be
                 addressed by chip manufacturers. However, there are
                 recent attempts to bring lifetime reliability problems
                 to the architectural level. Architectural techniques
                 can reduce the cost added by circuit-level techniques,
                 which are based on the worst-case degradation
                 estimation. Traditional low-power and thermal
                 management techniques can be successfully extended to
                 deal with reliability problems since aging is dependent
                 on power consumption and temperature. Self-repair is
                 another option to enhance the lifetime of
                 microprocessors using either core-level or lower-level
                 redundancy. With a growing thermal crisis and constant
                 scaling, lifetime reliability requires more intensive
                 research in conjunction with other design issues.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bauman:2015:SHB,
  author =       "Erick Bauman and Gbadebo Ayoade and Zhiqiang Lin",
  title =        "A Survey on Hypervisor-Based Monitoring: Approaches,
                 Applications, and Evolutions",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "10:1--10:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2775111",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "When designing computer monitoring systems, one goal
                 has always been to have a complete view of the
                 monitored target and at the same time stealthily
                 protect the monitor itself. One way to achieve this is
                 to use hypervisor-based, or more generally out of
                 virtual machine (VM)-based, monitoring. There are,
                 however, challenges that limit the use of this
                 mechanism; the most significant of these is the
                 semantic gap problem. Over the past decade, a
                 considerable amount of research has been carried out to
                 bridge the semantic gap and develop all kinds of
                 out-of-VM monitoring techniques and applications. By
                 tracing the evolution of out-of-VM security solutions,
                 this article examines and classifies different
                 approaches that have been proposed to overcome the
                 semantic gap-the fundamental challenge in
                 hypervisor-based monitoring-and how they have been used
                 to develop various security applications. In
                 particular, we review how the past approaches address
                 different constraints, such as practicality,
                 flexibility, coverage, and automation, while bridging
                 the semantic gap; how they have developed different
                 monitoring systems; and how the monitoring systems have
                 been applied and deployed. In addition to systematizing
                 all of the proposed techniques, we also discuss the
                 remaining research problems and shed light on the
                 future directions of hypervisor-based monitoring.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mann:2015:AVM,
  author =       "Zolt{\'a}n {\'A}d{\'a}m Mann",
  title =        "Allocation of Virtual Machines in Cloud Data Centers
                 --- A Survey of Problem Models and Optimization
                 Algorithms",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "11:1--11:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2797211",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Data centers in public, private, and hybrid cloud
                 settings make it possible to provision virtual machines
                 (VMs) with unprecedented flexibility. However,
                 purchasing, operating, and maintaining the underlying
                 physical resources incurs significant monetary costs
                 and environmental impact. Therefore, cloud providers
                 must optimize the use of physical resources by a
                 careful allocation of VMs to hosts, continuously
                 balancing between the conflicting requirements on
                 performance and operational costs. In recent years,
                 several algorithms have been proposed for this
                 important optimization problem. Unfortunately, the
                 proposed approaches are hardly comparable because of
                 subtle differences in the used problem models. This
                 article surveys the used problem formulations and
                 optimization algorithms, highlighting their strengths
                 and limitations, and pointing out areas that need
                 further research.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Milenkoski:2015:ECI,
  author =       "Aleksandar Milenkoski and Marco Vieira and Samuel
                 Kounev and Alberto Avritzer and Bryan D. Payne",
  title =        "Evaluating Computer Intrusion Detection Systems: a
                 Survey of Common Practices",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "12:1--12:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2808691",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The evaluation of computer intrusion detection systems
                 (which we refer to as intrusion detection systems) is
                 an active research area. In this article, we survey and
                 systematize common practices in the area of evaluation
                 of such systems. For this purpose, we define a design
                 space structured into three parts: workload, metrics,
                 and measurement methodology. We then provide an
                 overview of the common practices in evaluation of
                 intrusion detection systems by surveying evaluation
                 approaches and methods related to each part of the
                 design space. Finally, we discuss open issues and
                 challenges focusing on evaluation methodologies for
                 novel intrusion detection systems.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:2015:MOE,
  author =       "Bingdong Li and Jinlong Li and Ke Tang and Xin Yao",
  title =        "Many-Objective Evolutionary Algorithms: a Survey",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "13:1--13:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2792984",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Multiobjective evolutionary algorithms (MOEAs) have
                 been widely used in real-world applications. However,
                 most MOEAs based on Pareto-dominance handle
                 many-objective problems (MaOPs) poorly due to a high
                 proportion of incomparable and thus mutually
                 nondominated solutions. Recently, a number of
                 many-objective evolutionary algorithms (MaOEAs) have
                 been proposed to deal with this scalability issue. In
                 this article, a survey of MaOEAs is reported. According
                 to the key ideas used, MaOEAs are categorized into
                 seven classes: relaxed dominance based,
                 diversity-based, aggregation-based, indicator-based,
                 reference set based, preference-based, and
                 dimensionality reduction approaches. Several future
                 research directions in this field are also discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Schoeffmann:2015:VIT,
  author =       "Klaus Schoeffmann and Marco A. Hudelist and Jochen
                 Huber",
  title =        "Video Interaction Tools: a Survey of Recent Work",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "14:1--14:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2808796",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Digital video enables manifold ways of multimedia
                 content interaction. Over the last decade, many
                 proposals for improving and enhancing video content
                 interaction were published. More recent work
                 particularly leverages on highly capable devices such
                 as smartphones and tablets that embrace novel
                 interaction paradigms, for example, touch,
                 gesture-based or physical content interaction. In this
                 article, we survey literature at the intersection of
                 Human-Computer Interaction and Multimedia. We integrate
                 literature from video browsing and navigation, direct
                 video manipulation, video content visualization, as
                 well as interactive video summarization and interactive
                 video retrieval. We classify the reviewed works by the
                 underlying interaction method and discuss the achieved
                 improvements so far. We also depict a set of open
                 problems that the video interaction community should
                 address in future.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Edwards:2015:SSO,
  author =       "Matthew Edwards and Awais Rashid and Paul Rayson",
  title =        "A Systematic Survey of Online Data Mining Technology
                 Intended for Law Enforcement",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "15:1--15:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2811403",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "As an increasing amount of crime takes on a digital
                 aspect, law enforcement bodies must tackle an online
                 environment generating huge volumes of data. With
                 manual inspections becoming increasingly infeasible,
                 law enforcement bodies are optimising online
                 investigations through data-mining technologies. Such
                 technologies must be well designed and rigorously
                 grounded, yet no survey of the online data-mining
                 literature exists which examines their techniques,
                 applications and rigour. This article remedies this gap
                 through a systematic mapping study describing online
                 data-mining literature which visibly targets law
                 enforcement applications, using evidence-based
                 practices in survey making to produce a replicable
                 analysis which can be methodologically examined for
                 deficiencies.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Baudry:2015:MFS,
  author =       "Benoit Baudry and Martin Monperrus",
  title =        "The Multiple Facets of Software Diversity: Recent
                 Developments in Year 2000 and Beyond",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "1",
  pages =        "16:1--16:??",
  month =        sep,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2807593",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Sep 30 17:08:21 MDT 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Early experiments with software diversity in the mid
                 1970s investigated N-version programming and recovery
                 blocks to increase the reliability of embedded systems.
                 Four decades later, the literature about software
                 diversity has expanded in multiple directions: goals
                 (fault tolerance, security, software engineering),
                 means (managed or automated diversity), and analytical
                 studies (quantification of diversity and its impact).
                 Our article contributes to the field of software
                 diversity as the first work that adopts an inclusive
                 vision of the area, with an emphasis on the most recent
                 advances in the field. This survey includes classical
                 work about design and data diversity for fault
                 tolerance, as well as the cybersecurity literature that
                 investigates randomization at different system levels.
                 It broadens this standard scope of diversity to include
                 the study and exploitation of natural diversity and the
                 management of diverse software products. Our survey
                 includes the most recent works, with an emphasis from
                 2000 to the present. The targeted audience is
                 researchers and practitioners in one of the surveyed
                 fields who miss the big picture of software diversity.
                 Assembling the multiple facets of this fascinating
                 topic sheds a new light on the field.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chen:2015:DRS,
  author =       "Yunji Chen and Shijin Zhang and Qi Guo and Ling Li and
                 Ruiyang Wu and Tianshi Chen",
  title =        "Deterministic Replay: a Survey",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "17:1--17:47",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2790077",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Deterministic replay is a type of emerging technique
                 dedicated to providing deterministic executions of
                 computer programs in the presence of nondeterministic
                 factors. The application scopes of deterministic replay
                 are very broad, making it an important research topic
                 in domains such as computer architecture, operating
                 systems, parallel computing, distributed computing,
                 programming languages, verification, and hardware
                 testing. In this survey, we comprehensively review
                 existing studies on deterministic replay by introducing
                 a taxonomy. Basically, existing deterministic replay
                 schemes can be classified into two categories,
                 single-processor (SP) schemes and multiprocessor (MP)
                 schemes. By reviewing the details of these two
                 categories of schemes respectively, we summarize and
                 compare how existing schemes address technical issues
                 such as log size, record slowdown, replay slowdown,
                 implementation cost, and probe effect, which may shed
                 some light on future studies on deterministic replay.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nielsen:2015:SSE,
  author =       "Claus Ballegaard Nielsen and Peter Gorm Larsen and
                 John Fitzgerald and Jim Woodcock and Jan Peleska",
  title =        "Systems of Systems Engineering: Basic Concepts,
                 Model-Based Techniques, and Research Directions",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "18:1--18:41",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2794381",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The term ``System of Systems'' (SoS) has been used
                 since the 1950s to describe systems that are composed
                 of independent constituent systems, which act jointly
                 towards a common goal through the synergism between
                 them. Examples of SoS arise in areas such as power grid
                 technology, transport, production, and military
                 enterprises. SoS engineering is challenged by the
                 independence, heterogeneity, evolution, and emergence
                 properties found in SoS. This article focuses on the
                 role of model-based techniques within the SoS
                 engineering field. A review of existing attempts to
                 define and classify SoS is used to identify several
                 dimensions that characterise SoS applications. The SoS
                 field is exemplified by a series of representative
                 systems selected from the literature on SoS
                 applications. Within the area of model-based techniques
                 the survey specifically reviews the state of the art
                 for SoS modelling, architectural description,
                 simulation, verification, and testing. Finally, the
                 identified dimensions of SoS characteristics are used
                 to identify research challenges and future research
                 areas of model-based SoS engineering.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dongol:2015:VLC,
  author =       "Brijesh Dongol and John Derrick",
  title =        "Verifying Linearisability: a Comparative Survey",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "19:1--19:43",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2796550",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Linearisability is a key correctness criterion for
                 concurrent data structures, ensuring that each history
                 of the concurrent object under consideration is
                 consistent with respect to a history of the
                 corresponding abstract data structure. Linearisability
                 allows concurrent (i.e., overlapping) operation calls
                 to take effect in any order, but requires the real-time
                 order of nonoverlapping to be preserved. The
                 sophisticated nature of concurrent objects means that
                 linearisability is difficult to judge, and hence, over
                 the years, numerous techniques for verifying
                 lineasizability have been developed using a variety of
                 formal foundations such as data refinement, shape
                 analysis, reduction, etc. However, because the
                 underlying framework, nomenclature, and terminology for
                 each method is different, it has become difficult for
                 practitioners to evaluate the differences between each
                 approach, and hence, evaluate the methodology most
                 appropriate for verifying the data structure at hand.
                 In this article, we compare the major of methods for
                 verifying linearisability, describe the main
                 contribution of each method, and compare their
                 advantages and limitations.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hassan:2015:IPU,
  author =       "Naveed {Ul Hassan} and Aqsa Naeem and Muhammad Adeel
                 Pasha and Tariq Jadoon and Chau Yuen",
  title =        "Indoor Positioning Using Visible {LED} Lights: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "20:1--20:32",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2835376",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Visible light LEDs, due to their numerous advantages,
                 are expected to become the dominant indoor lighting
                 technology. These lights can also be switched ON/OFF at
                 high frequency, enabling their additional use for
                 wireless communication and indoor positioning. In this
                 article, visible LED light--based indoor positioning
                 systems are surveyed and classified into two broad
                 categories based on the receiver structure. The basic
                 principle and architecture of each design category,
                 along with various position computation algorithms, are
                 discussed and compared. Finally, several new research,
                 implementation, commercialization, and standardization
                 challenges are identified and highlighted for this
                 relatively novel and interesting indoor localization
                 technology.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Velloso:2015:FHC,
  author =       "Eduardo Velloso and Dominik Schmidt and Jason
                 Alexander and Hans Gellersen and Andreas Bulling",
  title =        "The Feet in Human--Computer Interaction: a Survey of
                 Foot-Based Interaction",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "21:1--21:35",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2816455",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Foot-operated computer interfaces have been studied
                 since the inception of human--computer interaction.
                 Thanks to the miniaturisation and decreasing cost of
                 sensing technology, there is an increasing interest
                 exploring this alternative input modality, but no
                 comprehensive overview of its research landscape. In
                 this survey, we review the literature on interfaces
                 operated by the lower limbs. We investigate the
                 characteristics of users and how they affect the design
                 of such interfaces. Next, we describe and analyse
                 foot-based research prototypes and commercial systems
                 in how they capture input and provide feedback. We then
                 analyse the interactions between users and systems from
                 the perspective of the actions performed in these
                 interactions. Finally, we discuss our findings and use
                 them to identify open questions and directions for
                 future research.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kaur:2015:EET,
  author =       "Tarandeep Kaur and Inderveer Chana",
  title =        "Energy Efficiency Techniques in Cloud Computing: a
                 Survey and Taxonomy",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "22:1--22:46",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2742488",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The increase in energy consumption is the most
                 critical problem worldwide. The growth and development
                 of complex data-intensive applications have promulgated
                 the creation of huge data centers that have heightened
                 the energy demand. In this article, the need for energy
                 efficiency is emphasized by discussing the dual role of
                 cloud computing as a major contributor to increasing
                 energy consumption and as a method to reduce energy
                 wastage. This article comprehensively and comparatively
                 studies existing energy efficiency techniques in cloud
                 computing and provides the taxonomies for the
                 classification and evaluation of the existing studies.
                 The article concludes with a summary providing valuable
                 suggestions for future enhancements.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Guo:2015:NTP,
  author =       "Mingming Guo and Xinyu Jin and Niki Pissinou and
                 Sebastian Zanlongo and Bogdan Carbunar and S. S.
                 Iyengar",
  title =        "In-Network Trajectory Privacy Preservation",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "23:1--23:29",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2818183",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recent advances in mobile device, wireless networking,
                 and positional technologies have helped location-aware
                 applications become pervasive. However, location
                 trajectory privacy concerns hinder the adoptability of
                 such applications. In this article, we survey existing
                 trajectory privacy work in the context of wireless
                 sensor networks, location-based services, and geosocial
                 networks. In each context, we categorize and summarize
                 the main techniques according to their own feathers.
                 Furthermore, we discuss future trajectory privacy
                 research challenges and directions.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Illiano:2015:DMD,
  author =       "Vittorio P. Illiano and Emil C. Lupu",
  title =        "Detecting Malicious Data Injections in Wireless Sensor
                 Networks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "24:1--24:33",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2818184",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Wireless Sensor Networks are widely advocated to
                 monitor environmental parameters, structural integrity
                 of the built environment and use of urban spaces,
                 services and utilities. However, embedded sensors are
                 vulnerable to compromise by external actors through
                 malware but also through their wireless and physical
                 interfaces. Compromised sensors can be made to report
                 false measurements with the aim to produce
                 inappropriate and potentially dangerous responses. Such
                 malicious data injections can be particularly difficult
                 to detect if multiple sensors have been compromised as
                 they could emulate plausible sensor behaviour such as
                 failures or detection of events where none occur. This
                 survey reviews the related work on malicious data
                 injection in wireless sensor networks, derives general
                 principles and a classification of approaches within
                 this domain, compares related studies and identifies
                 areas that require further investigation.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{McCune:2015:TLV,
  author =       "Robert Ryan McCune and Tim Weninger and Greg Madey",
  title =        "Thinking Like a Vertex: a Survey of Vertex-Centric
                 Frameworks for Large-Scale Distributed Graph
                 Processing",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "25:1--25:39",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2818185",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The vertex-centric programming model is an established
                 computational paradigm recently incorporated into
                 distributed processing frameworks to address challenges
                 in large-scale graph processing. Billion-node graphs
                 that exceed the memory capacity of commodity machines
                 are not well supported by popular Big Data tools like
                 MapReduce, which are notoriously poor performing for
                 iterative graph algorithms such as PageRank. In
                 response, a new type of framework challenges one to
                 ``think like a vertex'' (TLAV) and implements
                 user-defined programs from the perspective of a vertex
                 rather than a graph. Such an approach improves
                 locality, demonstrates linear scalability, and provides
                 a natural way to express and compute many iterative
                 graph algorithms. These frameworks are simple to
                 program and widely applicable but, like an operating
                 system, are composed of several intricate,
                 interdependent components, of which a thorough
                 understanding is necessary in order to elicit top
                 performance at scale. To this end, the first
                 comprehensive survey of TLAV frameworks is presented.
                 In this survey, the vertex-centric approach to graph
                 processing is overviewed, TLAV frameworks are
                 deconstructed into four main components and
                 respectively analyzed, and TLAV implementations are
                 reviewed and categorized.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Delvaux:2015:SLE,
  author =       "Jeroen Delvaux and Roel Peeters and Dawu Gu and Ingrid
                 Verbauwhede",
  title =        "A Survey on Lightweight Entity Authentication with
                 Strong {PUFs}",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "26:1--26:42",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2818186",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Physically unclonable functions (PUFs) exploit the
                 unavoidable manufacturing variations of an Integrated
                 Circuit (IC). Their input-output behavior serves as a
                 unique IC ``fingerprint.'' Therefore, they have been
                 envisioned as an IC authentication mechanism, in
                 particular the subclass of so-called strong PUFs. The
                 protocol proposals are typically accompanied with two
                 PUF promises: lightweight and an increased resistance
                 against physical attacks. In this work, we review 19
                 proposals in chronological order: from the original
                 strong PUF proposal (2001) to the more complicated
                 noise bifurcation and system of PUF proposals (2014).
                 The assessment is aided by a unified notation and a
                 transparent framework of PUF protocol requirements.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Granatyr:2015:TRM,
  author =       "Jones Granatyr and Vanderson Botelho and Otto Robert
                 Lessing and Edson Em{\'\i}lio Scalabrin and Jean-Paul
                 Barth{\`e}s and Fabr{\'\i}cio Enembreck",
  title =        "Trust and Reputation Models for Multiagent Systems",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "27:1--27:42",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2816826",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Finding reliable partners to interact with in open
                 environments is a challenging task for software agents,
                 and trust and reputation mechanisms are used to handle
                 this issue. From this viewpoint, we can observe the
                 growing body of research on this subject, which
                 indicates that these mechanisms can be considered key
                 elements to design multiagent systems (MASs). Based on
                 that, this article presents an extensive but not
                 exhaustive review about the most significant trust and
                 reputation models published over the past two decades,
                 and hundreds of models were analyzed using two
                 perspectives. The first one is a combination of trust
                 dimensions and principles proposed by some relevant
                 authors in the field, and the models are discussed
                 using an MAS perspective. The second one is the
                 discussion of these dimensions taking into account some
                 types of interaction found in MASs, such as coalition,
                 argumentation, negotiation, and recommendation. By
                 these analyses, we aim to find significant relations
                 between trust dimensions and types of interaction so it
                 would be possible to construct MASs using the most
                 relevant dimensions according to the types of
                 interaction, which may help developers in the design of
                 MASs.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cho:2015:STM,
  author =       "Jin-Hee Cho and Kevin Chan and Sibel Adali",
  title =        "A Survey on Trust Modeling",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "28:1--28:40",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2815595",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The concept of trust and/or trust management has
                 received considerable attention in engineering research
                 communities as trust is perceived as the basis for
                 decision making in many contexts and the motivation for
                 maintaining long-term relationships based on
                 cooperation and collaboration. Even if substantial
                 research effort has been dedicated to addressing
                 trust-based mechanisms or trust metrics (or
                 computation) in diverse contexts, prior work has not
                 clearly solved the issue of how to model and quantify
                 trust with sufficient detail and context-based
                 adequateness. The issue of trust quantification has
                 become more complicated as we have the need to derive
                 trust from complex, composite networks that may involve
                 four distinct layers of communication protocols,
                 information exchange, social interactions, and
                 cognitive motivations. In addition, the diverse
                 application domains require different aspects of trust
                 for decision making such as emotional, logical, and
                 relational trust. This survey aims to outline the
                 foundations of trust models for applications in these
                 contexts in terms of the concept of trust, trust
                 assessment, trust constructs, trust scales, trust
                 properties, trust formulation, and applications of
                 trust. We discuss how different components of trust can
                 be mapped to different layers of a complex, composite
                 network; applicability of trust metrics and models;
                 research challenges; and future work directions.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Saini:2015:HCW,
  author =       "Mukesh Saini and Abdulhameed Alelaiwi and Abdulmotaleb
                 {El Saddik}",
  title =        "How Close are We to Realizing a Pragmatic {VANET}
                 Solution? {A} Meta-Survey",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "29:1--29:40",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2817552",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Vehicular Ad-hoc Networks (VANETs) are seen as the key
                 enabling technology of Intelligent Transportation
                 Systems (ITS). In addition to safety, VANETs also
                 provide a cost-effective platform for numerous comfort
                 and entertainment applications. A pragmatic solution of
                 VANETs requires synergistic efforts in
                 multidisciplinary areas of communication standards,
                 routings, security and trust. Furthermore, a realistic
                 VANET simulator is required for performance evaluation.
                 There have been many research efforts in these areas,
                 and consequently, a number of surveys have been
                 published on various aspects. In this article, we first
                 explain the key characteristics of VANETs, then provide
                 a meta-survey of research works. We take a tutorial
                 approach to introducing VANETs and gradually discuss
                 intricate details. Extensive listings of existing
                 surveys and research projects have been provided to
                 assess development efforts. The article is useful for
                 researchers to look at the big picture and channel
                 their efforts in an effective way.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shilkrot:2015:DDC,
  author =       "Roy Shilkrot and Jochen Huber and J{\"u}rgen Steimle
                 and Suranga Nanayakkara and Pattie Maes",
  title =        "Digital Digits: a Comprehensive Survey of Finger
                 Augmentation Devices",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "30:1--30:29",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2828993",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Finger augmentation devices, those that are worn and
                 operated by fingers, are a rapidly growing field in the
                 human--computer interaction domain. This field is
                 rooted in ancient history; however, still the academic
                 research arena is booming with new finger augmentations
                 every year. This article strives to survey the entire
                 body of work on finger augmentation devices and uncover
                 the trends and the underexplored territories. We
                 contribute a methodical classification of over 150
                 pieces of academic, product, patent, and concept work.
                 We discuss the underlying sensing and feedback
                 modalities and provide a definition, taxonomy, and
                 reference for researchers of finger augmentation
                 devices.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Souza:2015:MQT,
  author =       "Ramon Hugo {De Souza} and M{\'a}rio Ant{\^o}nio
                 {Ribeiro Dantas}",
  title =        "Mapping {QoE} through {QoS} in an Approach to {DDB}
                 Architectures: Research Analysis and
                 Conceptualization",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "31:1--31:41",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2828994",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the context of distributed databases (DDBs), the
                 absence of mathematically well defined equations to
                 evaluate quality of service (QoS), especially with
                 statistical models, seems to have taken database
                 community attention from the possible performance
                 guarantees that could be handled by concepts related to
                 quality of experience (QoE). In this article, we
                 targeted the definition of QoE based on completeness of
                 QoS to deal with decisions concerning with performance
                 correction in a system level. This study also presents
                 a statistical bibliometric analysis before the proposed
                 model. The idea was to show the origin of first studies
                 with correlated focus, which also have initial
                 conceptualizations, and then propose a new model. This
                 model concerns concise QoS definitions, grouped to
                 provide a basis for QoE analysis. Afterward, it is
                 foreseen that a DDB system will be able to autoevaluate
                 and be aware of recovering situations before they
                 happen.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gracioli:2015:SCM,
  author =       "Giovani Gracioli and Ahmed Alhammad and Renato Mancuso
                 and Ant{\^o}nio Augusto Fr{\"o}hlich and Rodolfo
                 Pellizzoni",
  title =        "A Survey on Cache Management Mechanisms for Real-Time
                 Embedded Systems",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "2",
  pages =        "32:1--32:36",
  month =        nov,
  year =         "2015",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2830555",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Nov 25 15:50:15 MST 2015",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Multicore processors are being extensively used by
                 real-time systems, mainly because of their demand for
                 increased computing power. However, multicore
                 processors have shared resources that affect the
                 predictability of real-time systems, which is the key
                 to correctly estimate the worst-case execution time of
                 tasks. One of the main factors for unpredictability in
                 a multicore processor is the cache memory hierarchy.
                 Recently, many research works have proposed different
                 techniques to deal with caches in multicore processors
                 in the context of real-time systems. Nevertheless, a
                 review and categorization of these techniques is still
                 an open topic and would be very useful for the
                 real-time community. In this article, we present a
                 survey of cache management techniques for real-time
                 embedded systems, from the first studies of the field
                 in 1990 up to the latest research published in 2014. We
                 categorize the main research works and provide a
                 detailed comparison in terms of similarities and
                 differences. We also identify key challenges and
                 discuss future research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lemos:2016:WSC,
  author =       "Angel Lagares Lemos and Florian Daniel and Boualem
                 Benatallah",
  title =        "{Web} Service Composition: a Survey of Techniques and
                 Tools",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "33:1--33:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2831270",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Web services are a consolidated reality of the modern
                 Web with tremendous, increasing impact on everyday
                 computing tasks. They turned the Web into the largest,
                 most accepted, and most vivid distributed computing
                 platform ever. Yet, the use and integration of Web
                 services into composite services or applications, which
                 is a highly sensible and conceptually non-trivial task,
                 is still not unleashing its full magnitude of power. A
                 consolidated analysis framework that advances the
                 fundamental understanding of Web service composition
                 building blocks in terms of concepts, models,
                 languages, productivity support techniques, and tools
                 is required. This framework is necessary to enable
                 effective exploration, understanding, assessing,
                 comparing, and selecting service composition models,
                 languages, techniques, platforms, and tools. This
                 article establishes such a framework and reviews the
                 state of the art in service composition from an
                 unprecedented, holistic perspective.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Benmansour:2016:MAR,
  author =       "Asma Benmansour and Abdelhamid Bouchachia and Mohammed
                 Feham",
  title =        "Multioccupant Activity Recognition in Pervasive Smart
                 Home Environments",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "34:1--34:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2835372",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Human activity recognition in ambient intelligent
                 environments like homes, offices, and classrooms has
                 been the center of a lot of research for many years
                 now. The aim is to recognize the sequence of actions by
                 a specific person using sensor readings. Most of the
                 research has been devoted to activity recognition of
                 single occupants in the environment. However, living
                 environments are usually inhabited by more than one
                 person and possibly with pets. Hence, human activity
                 recognition in the context of multioccupancy is more
                 general, but also more challenging. The difficulty
                 comes from mainly two aspects: resident identification,
                 known as data association, and diversity of human
                 activities. The present survey article provides an
                 overview of existing approaches and current practices
                 for activity recognition in multioccupant smart homes.
                 It presents the latest developments and highlights the
                 open issues in this field.",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Koutrouli:2016:RSE,
  author =       "Eleni Koutrouli and Aphrodite Tsalgatidou",
  title =        "Reputation Systems Evaluation Survey",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "35:1--35:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2835373",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Various reputation systems have been proposed for a
                 broad range of distributed applications, such as
                 peer-to-peer, ad-hoc, and multiagent systems. Their
                 evaluation has been mostly based on proprietary methods
                 due to the lack of widely acceptable evaluation
                 measures and methodologies. Differentiating factors in
                 various evaluation approaches include the evaluation
                 metrics, the consideration of the dynamic behavior of
                 peers, the use of social networks, or the study of
                 resilience to specific threat scenarios. The lack of a
                 generally accepted common evaluation framework hinders
                 the objective evaluation and comparison of different
                 reputation systems. Aiming at narrowing the gap in the
                 research area of objective evaluation of reputation
                 systems, in this article, we study the various
                 approaches to evaluating and comparing reputation
                 systems, present them in a taxonomy, and analyze their
                 strengths and limitations, with special focus on works
                 suggesting a Common Evaluation Framework (CEF). We
                 identify the challenges for a widely accepted CEF that
                 enables testing and benchmarking of reputation systems,
                 and we present the required properties for such a CEF;
                 we also present an analysis of current CEF-related
                 works in the context of the identified properties and
                 our related proposals.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Brienza:2016:SEE,
  author =       "Simone Brienza and Sena Efsun Cebeci and Seyed Saeid
                 Masoumzadeh and Helmut Hlavacs and {\"O}znur
                 {\"O}zkasap and Giuseppe Anastasi",
  title =        "A Survey on Energy Efficiency in {P2P} Systems: File
                 Distribution, Content Streaming, and Epidemics",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "36:1--36:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2835374",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Several Peer-to-Peer (P2P) protocols and applications
                 have been developed to allow file distribution/sharing,
                 video and music streaming, and data and information
                 dissemination. These P2P systems are regularly used by
                 a large number of users, both in desktop and mobile
                 environments, and they generate a remarkable portion of
                 the overall Internet traffic. However, many common P2P
                 protocols and applications were designed neglecting the
                 energy problem. In fact, they often require always-on
                 devices in order to work properly, thus producing
                 significant energy waste. The problem is even more
                 relevant in the mobile context, since the battery
                 lifetime of mobile devices is limited. Therefore,
                 energy efficiency in P2P systems is a highly debated
                 topic in the literature. New P2P approaches-more energy
                 efficient than traditional client/server solutions-have
                 been proposed. In addition, several improvements to
                 existing P2P protocols have been introduced to reduce
                 their energy consumption. In this article, we present a
                 general taxonomy to classify state-of-the-art
                 approaches to the energy problem in P2P systems and
                 applications. Then, we survey the main solutions
                 available in the literature, focusing on three relevant
                 classes of P2P systems and applications: file
                 sharing/distribution, content streaming, and epidemics.
                 Furthermore, we outline open issues and provide future
                 research guidelines for each class of P2P systems.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Heartfield:2016:TAS,
  author =       "Ryan Heartfield and George Loukas",
  title =        "A Taxonomy of Attacks and a Survey of Defence
                 Mechanisms for Semantic Social Engineering Attacks",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "37:1--37:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2835375",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Social engineering is used as an umbrella term for a
                 broad spectrum of computer exploitations that employ a
                 variety of attack vectors and strategies to
                 psychologically manipulate a user. Semantic attacks are
                 the specific type of social engineering attacks that
                 bypass technical defences by actively manipulating
                 object characteristics, such as platform or system
                 applications, to deceive rather than directly attack
                 the user. Commonly observed examples include obfuscated
                 URLs, phishing emails, drive-by downloads, spoofed
                 websites and scareware to name a few. This article
                 presents a taxonomy of semantic attacks, as well as a
                 survey of applicable defences. By contrasting the
                 threat landscape and the associated mitigation
                 techniques in a single comparative matrix, we identify
                 the areas where further research can be particularly
                 beneficial.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hess:2016:DDH,
  author =       "Andrea Hess and Karin Anna Hummel and Wilfried N.
                 Gansterer and G{\"u}nter Haring",
  title =        "Data-driven Human Mobility Modeling: a Survey and
                 Engineering Guidance for Mobile Networking",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "38:1--38:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2840722",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Over the last decades, modeling of user mobility has
                 become increasingly important in mobile networking
                 research and development. This has led to the adoption
                 of modeling techniques from other disciplines such as
                 kinetic theory or urban planning. Yet these techniques
                 generate movement behavior that is often perceived as
                 not ``realistic'' for humans or provides only a
                 macroscopic view on mobility. More recent approaches
                 infer mobility models from real traces provided by
                 positioning technologies or by the marks the mobile
                 users leave in the wireless network. However, there is
                 no common framework for assessing and comparing
                 mobility models. In an attempt to provide a solid
                 foundation for realistic mobility modeling in mobile
                 networking research, we take an engineering approach
                 and thoroughly discuss the required steps of model
                 creation and validation. In this context, we survey how
                 and to what extent existing mobility modeling
                 approaches implement the proposed steps. This also
                 summarizes helpful information for readers who do not
                 want to develop a new model, but rather intend to
                 choose among existing ones.",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hoque:2016:MPD,
  author =       "Mohammad Ashraful Hoque and Matti Siekkinen and Kashif
                 Nizam Khan and Yu Xiao and Sasu Tarkoma",
  title =        "Modeling, Profiling, and Debugging the Energy
                 Consumption of Mobile Devices",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "39:1--39:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2840723",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Software energy profilers are the tools to measure the
                 energy consumption of mobile devices, applications
                 running on those devices, and various hardware
                 components. They adopt different modeling and
                 measurement techniques. In this article, we aim to
                 review a wide range of such energy profilers for mobile
                 devices. First, we introduce the terminologies and
                 describe the power modeling and measurement
                 methodologies applied in model-based energy profiling.
                 Next, we classify the profilers according to their
                 implementation and deployment strategies, and compare
                 the profiling capabilities and performance between
                 different types. Finally, we point out their
                 limitations and the corresponding challenges.",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Narayan:2016:SAP,
  author =       "John Narayan and Sandeep K. Shukla and T. Charles
                 Clancy",
  title =        "A Survey of Automatic Protocol Reverse Engineering
                 Tools",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "40:1--40:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2840724",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Computer network protocols define the rules in which
                 two entities communicate over a network of unique
                 hosts. Many protocol specifications are unknown,
                 unavailable, or minimally documented, which prevents
                 thorough analysis of the protocol for security
                 purposes. For example, modern botnets often use
                 undocumented and unique application-layer communication
                 protocols to maintain command and control over numerous
                 distributed hosts. Inferring the specification of
                 closed protocols has numerous advantages, such as
                 intelligent deep packet inspection, enhanced intrusion
                 detection system algorithms for communications, and
                 integration with legacy software packages. The
                 multitude of closed protocols coupled with existing
                 time-intensive reverse engineering methodologies has
                 spawned investigation into automated approaches for
                 reverse engineering of closed protocols. This article
                 summarizes and organizes previously presented automatic
                 protocol reverse engineering tools by approach.
                 Approaches that focus on reverse engineering the finite
                 state machine of a target protocol are separated from
                 those that focus on reverse engineering the protocol
                 format.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Momeni:2016:SAR,
  author =       "Elaheh Momeni and Claire Cardie and Nicholas
                 Diakopoulos",
  title =        "A Survey on Assessment and Ranking Methodologies for
                 User-Generated Content on the {Web}",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "41:1--41:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2811282",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "User-generated content (UGC) on the Web, especially on
                 social media platforms, facilitates the association of
                 additional information with digital resources; thus, it
                 can provide valuable supplementary content. However,
                 UGC varies in quality and, consequently, raises the
                 challenge of how to maximize its utility for a variety
                 of end-users. This study aims to provide researchers
                 and Web data curators with comprehensive answers to the
                 following questions: What are the existing approaches
                 and methods for assessing and ranking UGC? What
                 features and metrics have been used successfully to
                 assess and predict UGC value across a range of
                 application domains? What methods can be effectively
                 employed to maximize that value? This survey is
                 composed of a systematic review of approaches for
                 assessing and ranking UGC: results are obtained by
                 identifying and comparing methodologies within the
                 context of short text-based UGC on the Web. Existing
                 assessment and ranking approaches adopt one of four
                 framework types: the community-based framework takes
                 into consideration the value assigned to content by a
                 crowd of humans, the end-user--based framework adapts
                 and personalizes the assessment and ranking process
                 with respect to a single end-user, the designer-based
                 framework encodes the software designer's values in the
                 assessment and ranking method, and the hybrid framework
                 employs methods from more than one of these types. This
                 survey suggests a need for further experimentation and
                 encourages the development of new approaches for the
                 assessment and ranking of UGC.",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Singh:2016:QAA,
  author =       "Sukhpal Singh and Inderveer Chana",
  title =        "{QoS}-Aware Autonomic Resource Management in Cloud
                 Computing: a Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "42:1--42:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2843889",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "As computing infrastructure expands, resource
                 management in a large, heterogeneous, and distributed
                 environment becomes a challenging task. In a cloud
                 environment, with uncertainty and dispersion of
                 resources, one encounters problems of allocation of
                 resources, which is caused by things such as
                 heterogeneity, dynamism, and failures. Unfortunately,
                 existing resource management techniques, frameworks,
                 and mechanisms are insufficient to handle these
                 environments, applications, and resource behaviors. To
                 provide efficient performance of workloads and
                 applications, the aforementioned characteristics should
                 be addressed effectively. This research depicts a broad
                 methodical literature analysis of autonomic resource
                 management in the area of the cloud in general and QoS
                 (Quality of Service)-aware autonomic resource
                 management specifically. The current status of
                 autonomic resource management in cloud computing is
                 distributed into various categories. Methodical
                 analysis of autonomic resource management in cloud
                 computing and its techniques are described as developed
                 by various industry and academic groups. Further,
                 taxonomy of autonomic resource management in the cloud
                 has been presented. This research work will help
                 researchers find the important characteristics of
                 autonomic resource management and will also help to
                 select the most suitable technique for autonomic
                 resource management in a specific application along
                 with significant future research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Faniyi:2016:SRS,
  author =       "Funmilade Faniyi and Rami Bahsoon",
  title =        "A Systematic Review of Service Level Management in the
                 Cloud",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "43:1--43:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2843890",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cloud computing make it possible to flexibly procure,
                 scale, and release computational resources on demand in
                 response to workload changes. Stakeholders in business
                 and academia are increasingly exploring cloud
                 deployment options for their critical applications. One
                 open problem is that service level agreements (SLAs) in
                 the cloud ecosystem are yet to mature to a state where
                 critical applications can be reliably deployed in
                 clouds. This article systematically surveys the
                 landscape of SLA-based cloud research to understand the
                 state of the art and identify open problems. The survey
                 is particularly aimed at the resource allocation phase
                 of the SLA life cycle while highlighting implications
                 on other phases. Results indicate that (i) minimal
                 number of SLA parameters are accounted for in most
                 studies; (ii) heuristics, policies, and optimisation
                 are the most commonly used techniques for resource
                 allocation; and (iii) the monitor-analysis-plan-execute
                 (MAPE) architecture style is predominant in autonomic
                 cloud systems. The results contribute to the
                 fundamentals of engineering cloud SLA and their
                 autonomic management, motivating further research and
                 industrial-oriented solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Natella:2016:ADS,
  author =       "Roberto Natella and Domenico Cotroneo and Henrique S.
                 Madeira",
  title =        "Assessing Dependability with Software Fault Injection:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "44:1--44:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2841425",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "With the rise of software complexity, software-related
                 accidents represent a significant threat for
                 computer-based systems. Software Fault Injection is a
                 method to anticipate worst-case scenarios caused by
                 faulty software through the deliberate injection of
                 software faults. This survey provides a comprehensive
                 overview of the state of the art on Software Fault
                 Injection to support researchers and practitioners in
                 the selection of the approach that best fits their
                 dependability assessment goals, and it discusses how
                 these approaches have evolved to achieve fault
                 representativeness, efficiency, and usability. The
                 survey includes a description of relevant applications
                 of Software Fault Injection in the context of
                 fault-tolerant systems.",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mittal:2016:STAa,
  author =       "Sparsh Mittal",
  title =        "A Survey of Techniques for Architecting and Managing
                 Asymmetric Multicore Processors",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "45:1--45:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2856125",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "To meet the needs of a diverse range of workloads,
                 asymmetric multicore processors (AMPs) have been
                 proposed, which feature cores of different
                 microarchitecture or ISAs. However, given the diversity
                 inherent in their design and application scenarios,
                 several challenges need to be addressed to effectively
                 architect AMPs and leverage their potential in
                 optimizing both sequential and parallel performance.
                 Several recent techniques address these challenges. In
                 this article, we present a survey of architectural and
                 system-level techniques proposed for designing and
                 managing AMPs. By classifying the techniques on several
                 key characteristics, we underscore their similarities
                 and differences. We clarify the terminology used in
                 this research field and identify challenges that are
                 worthy of future investigation. We hope that more than
                 just synthesizing the existing work on AMPs, the
                 contribution of this survey will be to spark novel
                 ideas for architecting future AMPs that can make a
                 definite impact on the landscape of next-generation
                 computing systems.",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sgandurra:2016:EAT,
  author =       "Daniele Sgandurra and Emil Lupu",
  title =        "Evolution of Attacks, Threat Models, and Solutions for
                 Virtualized Systems",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "46:1--46:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2856126",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Virtualization technology enables Cloud providers to
                 efficiently use their computing services and resources.
                 Even if the benefits in terms of performance,
                 maintenance, and cost are evident, however,
                 virtualization has also been exploited by attackers to
                 devise new ways to compromise a system. To address
                 these problems, research security solutions have
                 evolved considerably over the years to cope with new
                 attacks and threat models. In this work, we review the
                 protection strategies proposed in the literature and
                 show how some of the solutions have been invalidated by
                 new attacks, or threat models, that were previously not
                 considered. The goal is to show the evolution of the
                 threats, and of the related security and trust
                 assumptions, in virtualized systems that have given
                 rise to complex threat models and the corresponding
                 sophistication of protection strategies to deal with
                 such attacks. We also categorize threat models,
                 security and trust assumptions, and attacks against a
                 virtualized system at the different layers-in
                 particular, hardware, virtualization, OS, and
                 application.",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Avoine:2016:SSP,
  author =       "Gildas Avoine and Antonin Beaujeant and Julio
                 Hernandez-Castro and Louis Demay and Philippe Teuwen",
  title =        "A Survey of Security and Privacy Issues in {ePassport}
                 Protocols",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "47:1--47:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2825026",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "This article examines in great detail the most
                 relevant security and privacy issues affecting the
                 protocols used by contactless chips integrated in
                 ePassports, and presents all relevant literature
                 together with some new attacks and insights that could
                 help in improving future standards and the next
                 generations of ePassports.",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Calzarossa:2016:WCS,
  author =       "Maria Carla Calzarossa and Luisa Massari and Daniele
                 Tessera",
  title =        "Workload Characterization: a Survey Revisited",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "3",
  pages =        "48:1--48:??",
  month =        feb,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2856127",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Feb 9 09:29:36 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Workload characterization is a well-established
                 discipline that plays a key role in many performance
                 engineering studies. The large-scale social behavior
                 inherent in the applications and services being
                 deployed nowadays leads to rapid changes in workload
                 intensity and characteristics and opens new challenging
                 management and performance issues. A deep understanding
                 of user behavior and workload properties and patterns
                 is therefore compelling. This article presents a
                 comprehensive survey of the state of the art of
                 workload characterization by addressing its
                 exploitation in some popular application domains. In
                 particular, we focus on conventional web workloads as
                 well as on the workloads associated with online social
                 networks, video services, mobile apps, and cloud
                 computing infrastructures. We discuss the peculiarities
                 of these workloads and present the methodological
                 approaches and modeling techniques applied for their
                 characterization. The role of workload models in
                 various scenarios (e.g., performance evaluation,
                 capacity planning, content distribution, resource
                 provisioning) is also analyzed.",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ren:2016:SMO,
  author =       "Yi Ren and Ling Liu and Qi Zhang and Qingbo Wu and
                 Jianbo Guan and Jinzhu Kong and Huadong Dai and Lisong
                 Shao",
  title =        "Shared-Memory Optimizations for Inter-Virtual-Machine
                 Communication",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "49:1--49:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2847562",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Virtual machines (VMs) and virtualization are one of
                 the core computing technologies today. Inter-VM
                 communication is not only prevalent but also one of the
                 leading costs for data-intensive systems and
                 applications in most data centers and cloud computing
                 environments. One way to improve inter-VM communication
                 efficiency is to support coresident VM communication
                 using shared-memory-based methods and resort to the
                 traditional TCP/IP for communications between VMs that
                 are located on different physical machines. In recent
                 years, several independent kernel development efforts
                 have been dedicated to improving communication
                 efficiency between coresident VMs using shared-memory
                 channels, and the development efforts differ from one
                 another in terms of where and how the shared-memory
                 channel is established. In this article, we provide a
                 comprehensive overview of the design choices and
                 techniques for performance optimization of coresident
                 inter-VM communication. We examine the key issues for
                 improving inter-VM communication using
                 shared-memory-based mechanisms, such as implementation
                 choices in the software stack, seamless agility for
                 dynamic addition or removal of coresident VMs, and
                 multilevel transparency, as well as advanced
                 requirements in reliability, security, and stability.
                 An in-depth comparison of state-of-the-art research
                 efforts, implementation techniques, evaluation methods,
                 and performance is conducted. We conjecture that this
                 comprehensive survey will not only provide the
                 foundation for developing the next generation of
                 inter-VM communication optimization mechanisms but also
                 offers opportunities to both cloud infrastructure
                 providers and cloud service providers and consumers for
                 improving communication efficiency between coresident
                 VMs in virtualized computing platforms.",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mitra:2016:SRM,
  author =       "Barsha Mitra and Shamik Sural and Jaideep Vaidya and
                 Vijayalakshmi Atluri",
  title =        "A Survey of Role Mining",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "50:1--50:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2871148",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Role-Based Access Control (RBAC) is the most widely
                 used model for advanced access control deployed in
                 diverse enterprises of all sizes. RBAC critically
                 depends on defining roles, which are a functional
                 intermediate between users and permissions. Thus, for
                 RBAC to be effective, an appropriate set of roles needs
                 to be identified. Since many organizations already have
                 user-permission assignments defined in some form, it
                 makes sense to identify roles from this existing
                 information. This process, known as role mining, is one
                 of the critical steps for successful RBAC adoption in
                 any enterprise. In recent years, numerous role mining
                 techniques have been developed, which take into account
                 the characteristics of the core RBAC model, as well as
                 its various extended features. In this article, we
                 comprehensively study and classify the basic problem of
                 role mining along with its several variants and the
                 corresponding solution strategies. Categorization is
                 done on the basis of the nature of the target RBAC
                 system, the objective of role mining, and the type of
                 solution. We then discuss the limitations of existing
                 work and identify new areas of research that can lead
                 to further enrichment of this field.",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Farias:2016:SRS,
  author =       "Claudio M. De Farias and Wei Li and Fl{\'a}via C.
                 Delicato and Luci Pirmez and Albert Y. Zomaya and Paulo
                 F. Pires and Jos{\'e} N. {De Souza}",
  title =        "A Systematic Review of Shared Sensor Networks",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "51:1--51:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2851510",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "While Wireless Sensor Networks (WSNs) have been
                 traditionally tasked with single applications, in
                 recent years we have witnessed the emergence of Shared
                 Sensor Networks (SSNs) as integrated cyber-physical
                 system infrastructures for a multitude of applications.
                 Instead of assuming an application-specific network
                 design, SSNs allow the underlying infrastructure to be
                 shared among multiple applications that can potentially
                 belong to different users. On one hand, a potential
                 benefit of such a design approach is to increase the
                 utilization of sensing and communication resources,
                 whenever the underlying network infrastructure covers
                 the same geographic area and the sensor nodes monitor
                 the same physical variables of common interest for
                 different applications. On the other hand, compared
                 with the existing application-specific design, the SSNs
                 approach poses several research challenges with regard
                 to different aspects of WSNs. In this article, we
                 present a systematic literature survey on SSNs. The
                 main goal of the article is to provide the reader with
                 the opportunity to understand what has been done and
                 what remains as open issues in this field, as well as
                 which are the pivotal factors of this evolutionary
                 design and how this kind of design can be exploited by
                 a wide range of WSN applications.",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Crocco:2016:ASS,
  author =       "Marco Crocco and Marco Cristani and Andrea Trucco and
                 Vittorio Murino",
  title =        "Audio Surveillance: a Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "52:1--52:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2871183",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Despite surveillance systems becoming increasingly
                 ubiquitous in our living environment, automated
                 surveillance, currently based on video sensory modality
                 and machine intelligence, lacks most of the time the
                 robustness and reliability required in several real
                 applications. To tackle this issue, audio sensory
                 devices have been incorporated, both alone or in
                 combination with video, giving birth in the past
                 decade, to a considerable amount of research. In this
                 article, audio-based automated surveillance methods are
                 organized into a comprehensive survey: A general
                 taxonomy, inspired by the more widespread video
                 surveillance field, is proposed to systematically
                 describe the methods covering background subtraction,
                 event classification, object tracking, and situation
                 analysis. For each of these tasks, all the significant
                 works are reviewed, detailing their pros and cons and
                 the context for which they have been proposed.
                 Moreover, a specific section is devoted to audio
                 features, discussing their expressiveness and their
                 employment in the above-described tasks. Differing from
                 other surveys on audio processing and analysis, the
                 present one is specifically targeted to automated
                 surveillance, highlighting the target applications of
                 each described method and providing the reader with a
                 systematic and schematic view useful for retrieving the
                 most suited algorithms for each specific requirement.",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Maghdid:2016:SOI,
  author =       "Halgurd S. Maghdid and Ihsan Alshahib Lami and Kayhan
                 Zrar Ghafoor and Jaime Lloret",
  title =        "Seamless Outdoors-Indoors Localization Solutions on
                 Smartphones: Implementation and Challenges",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "53:1--53:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2871166",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The demand for more sophisticated Location-Based
                 Services (LBS) in terms of applications variety and
                 accuracy is tripling every year since the emergence of
                 the smartphone a few years ago. Equally, smartphone
                 manufacturers are mounting several wireless
                 communication and localization technologies, inertial
                 sensors as well as powerful processing capability, to
                 cater to such LBS applications. A hybrid of wireless
                 technologies is needed to provide seamless localization
                 solutions and to improve accuracy, to reduce time to
                 fix, and to reduce power consumption. The review of
                 localization techniques/technologies of this emerging
                 field is therefore important. This article reviews the
                 recent research-oriented and commercial localization
                 solutions on smartphones. The focus of this article is
                 on the implementation challenges associated with
                 utilizing these positioning solutions on Android-based
                 smartphones. Furthermore, the taxonomy of
                 smartphone-location techniques is highlighted with a
                 special focus on the detail of each technique and its
                 hybridization. The article compares the indoor
                 localization techniques based on accuracy, utilized
                 wireless technology, overhead, and localization
                 technique used. The pursuit of achieving ubiquitous
                 localization outdoors and indoors for critical LBS
                 applications such as security and safety shall dominate
                 future research efforts.",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mittal:2016:SAT,
  author =       "Sparsh Mittal",
  title =        "A Survey of Architectural Techniques for Managing
                 Process Variation",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "54:1--54:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2871167",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Process variation-deviation in parameters from their
                 nominal specifications-threatens to slow down and even
                 pause technological scaling, and mitigation of it is
                 the way to continue the benefits of chip
                 miniaturization. In this article, we present a survey
                 of architectural techniques for managing process
                 variation (PV) in modern processors. We also classify
                 these techniques based on several important parameters
                 to bring out their similarities and differences. The
                 aim of this article is to provide insights to
                 researchers into the state of the art in PV management
                 techniques and motivate them to further improve these
                 techniques for designing PV-resilient processors of
                 tomorrow.",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Stahl:2016:ECS,
  author =       "Bernd Carsten Stahl and Job Timmermans and Brent
                 Daniel Mittelstadt",
  title =        "The Ethics of Computing: a Survey of the
                 Computing-Oriented Literature",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "55:1--55:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2871196",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Computing technologies and artifacts are increasingly
                 integrated into most aspects of our professional,
                 social, and private lives. One consequence of this
                 growing ubiquity of computing is that it can have
                 significant ethical implications that computing
                 professionals need to be aware of. The relationship
                 between ethics and computing has long been discussed.
                 However, this is the first comprehensive survey of the
                 mainstream academic literature of the topic. Based on a
                 detailed qualitative analysis of the literature, the
                 article discusses ethical issues, technologies that
                 they are related to, and ethical theories, as well as
                 the methodologies that the literature employs, its
                 academic contribution, and resulting recommendations.
                 The article discusses general trends and argues that
                 the time has come for a transition to responsible
                 research and innovation to ensure that ethical
                 reflection of computing has practical and manifest
                 consequences.",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Murray:2016:OEM,
  author =       "Niall Murray and Brian Lee and Yuansong Qiao and
                 Gabriel-Miro Muntean",
  title =        "Olfaction-Enhanced Multimedia: a Survey of Application
                 Domains, Displays, and Research Challenges",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "56:1--56:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2816454",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recently, the concept of olfaction-enhanced multimedia
                 applications has gained traction as a step toward
                 further enhancing user quality of experience. The next
                 generation of rich media services will be immersive and
                 multisensory, with olfaction playing a key role. This
                 survey reviews current olfactory-related research from
                 a number of perspectives. It introduces and explains
                 relevant olfactory psychophysical terminology,
                 knowledge of which is necessary for working with
                 olfaction as a media component. In addition, it reviews
                 and highlights the use of, and potential for, olfaction
                 across a number of application domains, namely health,
                 tourism, education, and training. A taxonomy of
                 research and development of olfactory displays is
                 provided in terms of display type, scent generation
                 mechanism, application area, and strengths/weaknesses.
                 State of the art research works involving olfaction are
                 discussed and associated research challenges are
                 proposed.",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Palaghias:2016:SMS,
  author =       "Niklas Palaghias and Seyed Amir Hoseinitabatabaei and
                 Michele Nati and Alexander Gluhak and Klaus Moessner",
  title =        "A Survey on Mobile Social Signal Processing",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "57:1--57:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2893487",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Understanding human behavior in an automatic but
                 nonintrusive manner is an important area for various
                 applications. This requires the collaboration of
                 information technology with human sciences to transfer
                 existing knowledge of human behavior into self-acting
                 tools. These tools will reduce human error that is
                 introduced by current obtrusive methods such as
                 questionnaires. To achieve unobtrusiveness, we focus on
                 exploiting the pervasive and ubiquitous character of
                 mobile devices. In this article, a survey of existing
                 techniques for extracting social behavior through
                 mobile devices is provided. Initially, we expose the
                 terminology used in the area and introduce a concrete
                 architecture for social signal processing applications
                 on mobile phones, constituted by sensing, social
                 interaction detection, behavioral cues extraction,
                 social signal inference, and social behavior
                 understanding. Furthermore, we present state-of-the-art
                 techniques applied to each stage of the process.
                 Finally, potential applications are shown while arguing
                 about the main challenges of the area.",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Harrison:2016:RED,
  author =       "David C. Harrison and Winston K. G. Seah and Ramesh
                 Rayudu",
  title =        "Rare Event Detection and Propagation in Wireless
                 Sensor Networks",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "58:1--58:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2885508",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Rarely occurring events present unique challenges to
                 energy constrained systems designed for long term
                 sensing of their occurrence or effect. Unlike periodic
                 sampling or query based sensing systems, longevity
                 cannot be achieved simply by adjusting the sensing
                 nodes' duty cycle until an equitable balance between
                 data density and network lifetime is established. The
                 low probability of occurrence and random nature of rare
                 events makes it difficult to guarantee duty cycled
                 battery powered sensing nodes will be energised when
                 events occur. Equally, it is usually considered
                 impractical to leave the sensing nodes energised at all
                 times if the network is to have an acceptably long
                 operational life. In the past decade and a half,
                 wireless sensor network research has addressed this
                 aspect of rare event sensing by investigating
                 techniques including synchronised duty cycling of
                 redundant nodes, passive sensing, duplicate message
                 suppression, and energy efficient network protocols.
                 Researchers have also demonstrated the efficacy of
                 harvesting energy from the environment to extend
                 operational life. Here we survey existing rare event
                 detection and propagation techniques, and suggest areas
                 suitable for continued research.",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Werner:2016:SDA,
  author =       "Sebastian Werner and Javier Navaridas and Mikel
                 Luj{\'a}n",
  title =        "A Survey on Design Approaches to Circumvent Permanent
                 Faults in Networks-on-Chip",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "59:1--59:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2886781",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Increasing fault rates in current and future
                 technology nodes coupled with on-chip components in the
                 hundreds calls for robust and fault-tolerant
                 Network-on-Chip (NoC) designs. Given the central role
                 of NoCs in today's many-core chips, permanent faults
                 impeding their original functionality may significantly
                 influence performance, energy consumption, and correct
                 operation of the entire system. As a result,
                 fault-tolerant NoC design gained much attention in
                 recent years. In this article, we review the vast
                 research efforts regarding a NoC's components, namely,
                 topology, routing algorithm, router microarchitecture,
                 as well as system-level approaches combined with
                 reconfiguration; discuss the proposed architectures;
                 and identify outstanding research questions.",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hu:2016:CLG,
  author =       "Liang Hu and Xilong Che and Si-Qing Zheng",
  title =        "A Closer Look at {GPGPU}",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "60:1--60:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2873053",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The lack of detailed white box illustration leaves a
                 gap in the field of GPGPU (General-Purpose Computing on
                 the Graphic Processing Unit), thus hindering users and
                 researchers from exploring hardware potential while
                 improving application performance. This article bridges
                 the gap by demystifying the micro-architecture and
                 operating mechanism of GPGPU. We propose a descriptive
                 model that addresses key issues of most concerns,
                 including task organization, hardware structure,
                 scheduling mechanism, execution mechanism, and memory
                 access. We also validate the effectiveness of our model
                 by interpreting the software/hardware cooperation of
                 CUDA.",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Platania:2016:CSC,
  author =       "Marco Platania and Daniel Obenshain and Thomas
                 Tantillo and Yair Amir and Neeraj Suri",
  title =        "On Choosing Server- or Client-Side Solutions for
                 {BFT}",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "61:1--61:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2886780",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Byzantine Fault Tolerant (BFT) protocols have the
                 ability to work correctly even when up to a threshold f
                 of system servers are compromised. This makes them
                 appealing for the construction of critical systems
                 connected to the Internet, which are constantly a
                 target for cyber attacks. BFT protocols differ based on
                 the kind of application, deployment settings,
                 performance, access control mechanisms, number of
                 servers in the system, and protocol implementation. The
                 large number of protocols present in the literature and
                 their differences make it difficult for a system
                 builder to choose the solution that best satisfies the
                 requirements of the system that he wants to build. In
                 particular, the main difference among BFT protocols
                 lies in their system models: server-side versus
                 client-side. In the server-side model each client
                 relies on the system to consistently order and
                 replicate updates, while in the client-side model each
                 client actively participates in the protocol. In this
                 article, we classify BFT protocols as server-side or
                 client-side. We analyze the trade-offs between the two
                 models, describe systems that use these models and the
                 trade-offs they choose, highlight the research gaps,
                 and provide guidelines to system builders in order to
                 choose the solution that best satisfies their needs.",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mittal:2016:STAb,
  author =       "Sparsh Mittal",
  title =        "A Survey of Techniques for Approximate Computing",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "62:1--62:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2893356",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Approximate computing trades off computation quality
                 with effort expended, and as rising performance demands
                 confront plateauing resource budgets, approximate
                 computing has become not merely attractive, but even
                 imperative. In this article, we present a survey of
                 techniques for approximate computing (AC). We discuss
                 strategies for finding approximable program portions
                 and monitoring output quality, techniques for using AC
                 in different processing units (e.g., CPU, GPU, and
                 FPGA), processor components, memory technologies, and
                 so forth, as well as programming frameworks for AC. We
                 classify these techniques based on several key
                 characteristics to emphasize their similarities and
                 differences. The aim of this article is to provide
                 insights to researchers into working of AC techniques
                 and inspire more efforts in this area to make AC the
                 mainstream computing approach in future systems.",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{DeOliveiraSandes:2016:POP,
  author =       "Edans Flavius {De Oliveira Sandes} and Azzedine
                 Boukerche and Alba Cristina {Magalhaes Alves De Melo}",
  title =        "Parallel Optimal Pairwise Biological Sequence
                 Comparison: Algorithms, Platforms, and Classification",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "63:1--63:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2893488",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Many bioinformatics applications, such as the optimal
                 pairwise biological sequence comparison, demand a great
                 quantity of computing resource, thus are excellent
                 candidates to run in high-performance computing (HPC)
                 platforms. In the last two decades, a large number of
                 HPC-based solutions were proposed for this problem that
                 run in different platforms, targeting different types
                 of comparisons with slightly different algorithms and
                 making the comparative analysis of these approaches
                 very difficult. This article proposes a classification
                 of parallel optimal pairwise sequence comparison
                 solutions, in order to highlight their main
                 characteristics in a unified way. We then discuss
                 several HPC-based solutions, including clusters of
                 multicores and accelerators such as Cell Broadband
                 Engines (CellBEs), Field-Programmable Gate Arrays
                 (FPGAs), Graphics Processing Units (GPUs) and Intel
                 Xeon Phi, as well as hybrid solutions, which combine
                 two or more platforms, providing the actual landscape
                 of the main proposals in this area. Finally, we present
                 open questions and perspectives in this research
                 field.",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Schmidt:2016:SAG,
  author =       "Desmond Schmidt and Kenneth Radke and Seyit Camtepe
                 and Ernest Foo and Michal Ren",
  title =        "A Survey and Analysis of the {GNSS} Spoofing Threat
                 and Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "64:1--64:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2897166",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Detection and prevention of global navigation
                 satellite system (GNSS) ``spoofing'' attacks, or the
                 broadcast of false global navigation satellite system
                 services, has recently attracted much research
                 interest. This survey aims to fill three gaps in the
                 literature: first, to assess in detail the exact nature
                 of threat scenarios posed by spoofing against the most
                 commonly cited targets; second, to investigate the many
                 practical impediments, often underplayed, to carrying
                 out GNSS spoofing attacks in the field; and third, to
                 survey and assess the effectiveness of a wide range of
                 proposed defences against GNSS spoofing. Our conclusion
                 lists promising areas of future research.",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Caballero:2016:TIE,
  author =       "Juan Caballero and Zhiqiang Lin",
  title =        "Type Inference on Executables",
  journal =      j-COMP-SURV,
  volume =       "48",
  number =       "4",
  pages =        "65:1--65:??",
  month =        may,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2896499",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon May 2 16:19:12 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In many applications, source code and debugging
                 symbols of a target program are not available, and the
                 only thing that we can access is the program
                 executable. A fundamental challenge with executables is
                 that, during compilation, critical information such as
                 variables and types is lost. Given that typed variables
                 provide fundamental semantics of a program, for the
                 last 16 years, a large amount of research has been
                 carried out on binary code type inference, a
                 challenging task that aims to infer typed variables
                 from executables (also referred to as binary code). In
                 this article, we systematize the area of binary code
                 type inference according to its most important
                 dimensions: the applications that motivate its
                 importance, the approaches used, the types that those
                 approaches infer, the implementation of those
                 approaches, and how the inference results are
                 evaluated. We also discuss limitations, underdeveloped
                 problems and open challenges, and propose further
                 applications.",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shuja:2016:SMD,
  author =       "Junaid Shuja and Abdullah Gani and Kashif Bilal and
                 Atta Ur Rehman Khan and Sajjad A. Madani and Samee U.
                 Khan and Albert Y. Zomaya",
  title =        "A Survey of Mobile Device Virtualization: Taxonomy and
                 State of the Art",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "1:1--1:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2897164",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recent growth in the processing and memory resources
                 of mobile devices has fueled research within the field
                 of mobile virtualization. Mobile virtualization enables
                 multiple persona on a single mobile device by hosting
                 heterogeneous operating systems (OSs) concurrently.
                 However, adding a virtualization layer to
                 resource-constrained mobile devices with real-time
                 requirements can lead to intolerable performance
                 overheads. Hardware virtualization extensions that
                 support efficient virtualization have been incorporated
                 in recent mobile processors. Prior to hardware
                 virtualization extensions, virtualization techniques
                 that are enabled by performance prohibitive and
                 resource consuming software were adopted for mobile
                 devices. Moreover, mobile virtualization solutions lack
                 standard procedures for device component sharing and
                 interfacing between multiple OSSs. The objective of
                 this article is to survey software- and hardware-based
                 mobile virtualization techniques in light of the recent
                 advancements fueled by the hardware support for mobile
                 virtualization. Challenges and issues faced in
                 virtualization of CPU, memory, I/O, interrupt, and
                 network interfaces are highlighted. Moreover, various
                 performance parameters are presented in a detailed
                 comparative analysis to quantify the efficiency of
                 mobile virtualization techniques and solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Alam:2016:CMR,
  author =       "Muhammad Raisul Alam and Marc St-Hilaire and Thomas
                 Kunz",
  title =        "Computational Methods for Residential Energy Cost
                 Optimization in Smart Grids: a Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "2:1--2:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2897165",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A smart power grid transforms the traditional electric
                 grid into a user-centric, intelligent power network.
                 The cost-saving potential of smart homes is an
                 excellent motivating factor to involve users in smart
                 grid operations. To that end, this survey explores the
                 contemporary cost-saving strategies for smart grids
                 from the users' perspective. The study shows that
                 optimization methods are the most popular cost-saving
                 techniques reported in the literature. These methods
                 are used to plan scheduling and power utilization
                 schemes of household appliances, energy storages,
                 renewables, and other energy generation devices. The
                 survey shows that trading energy among neighborhoods is
                 one of the effective methods for cost optimization. It
                 also identifies the prediction methods that are used to
                 forecast energy price, generation, and consumption
                 profiles, which are required to optimize energy cost in
                 advance. The contributions of this article are
                 threefold. First, it discusses the computational
                 methods reported in the literature with their
                 significance and limitations. Second, it identifies the
                 components and their characteristics that may reduce
                 energy cost. Finally, it proposes a unified cost
                 optimization framework and addresses the challenges
                 that may influence the overall residential energy cost
                 optimization problem in smart grids.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Huttel:2016:FST,
  author =       "Hans H{\"u}ttel and Ivan Lanese and Vasco T.
                 Vasconcelos and Lu{\'\i}s Caires and Marco Carbone and
                 Pierre-Malo Deni{\'e}lou and Dimitris Mostrous and Luca
                 Padovani and Ant{\'o}nio Ravara and Emilio Tuosto and
                 Hugo Torres Vieira and Gianluigi Zavattaro",
  title =        "Foundations of Session Types and Behavioural
                 Contracts",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "3:1--3:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2873052",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Behavioural type systems, usually associated to
                 concurrent or distributed computations, encompass
                 concepts such as interfaces, communication protocols,
                 and contracts, in addition to the traditional
                 input/output operations. The behavioural type of a
                 software component specifies its expected patterns of
                 interaction using expressive type languages, so types
                 can be used to determine automatically whether the
                 component interacts correctly with other components.
                 Two related important notions of behavioural types are
                 those of session types and behavioural contracts. This
                 article surveys the main accomplishments of the last 20
                 years within these two approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Schrittwieser:2016:PST,
  author =       "Sebastian Schrittwieser and Stefan Katzenbeisser and
                 Johannes Kinder and Georg Merzdovnik and Edgar Weippl",
  title =        "Protecting Software through Obfuscation: Can It Keep
                 Pace with Progress in Code Analysis?",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "4:1--4:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2886012",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Software obfuscation has always been a controversially
                 discussed research area. While theoretical results
                 indicate that provably secure obfuscation in general is
                 impossible, its widespread application in malware and
                 commercial software shows that it is nevertheless
                 popular in practice. Still, it remains largely
                 unexplored to what extent today's software obfuscations
                 keep up with state-of-the-art code analysis and where
                 we stand in the arms race between software developers
                 and code analysts. The main goal of this survey is to
                 analyze the effectiveness of different classes of
                 software obfuscation against the continuously improving
                 deobfuscation techniques and off-the-shelf code
                 analysis tools. The answer very much depends on the
                 goals of the analyst and the available resources. On
                 the one hand, many forms of lightweight static analysis
                 have difficulties with even basic obfuscation schemes,
                 which explains the unbroken popularity of obfuscation
                 among malware writers. On the other hand, more
                 expensive analysis techniques, in particular when used
                 interactively by a human analyst, can easily defeat
                 many obfuscations. As a result, software obfuscation
                 for the purpose of intellectual property protection
                 remains highly challenging.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ao:2016:PBD,
  author =       "Buke Ao and Yongcai Wang and Lu Yu and Richard R.
                 Brooks and S. S. Iyengar",
  title =        "On Precision Bound of Distributed Fault-Tolerant
                 Sensor Fusion Algorithms",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "5:1--5:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2898984",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Sensors have limited precision and accuracy. They
                 extract data from the physical environment, which
                 contains noise. The goal of sensor fusion is to make
                 the final decision robust, minimizing the influence of
                 noise and system errors. One problem that has not been
                 adequately addressed is establishing the bounds of
                 fusion result precision. Precision is the maximum range
                 of disagreement that can be introduced by one or more
                 faulty inputs. This definition of precision is
                 consistent both with Lamport's Byzantine Generals
                 problem and the mini-max criteria commonly found in
                 game theory. This article considers the precision
                 bounds of several fault-tolerant information fusion
                 approaches, including Byzantine agreement, Marzullo's
                 interval-based approach, and the Brooks-Iyengar fusion
                 algorithm. We derive precision bounds for these fusion
                 algorithms. The analysis provides insight into the
                 limits imposed by fault tolerance and guidance for
                 applying fusion approaches to applications.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Liu:2016:RAC,
  author =       "Junbin Liu and Sridha Sridharan and Clinton Fookes",
  title =        "Recent Advances in Camera Planning for Large Area
                 Surveillance: a Comprehensive Review",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "6:1--6:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2906148",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "With recent advances in consumer electronics and the
                 increasingly urgent need for public security, camera
                 networks have evolved from their early role of
                 providing simple and static monitoring to current
                 complex systems capable of obtaining extensive video
                 information for intelligent processing, such as target
                 localization, identification, and tracking. In all
                 cases, it is of vital importance that the optimal
                 camera configuration (i.e., optimal location,
                 orientation, etc.) is determined before cameras are
                 deployed as a suboptimal placement solution will
                 adversely affect intelligent video surveillance and
                 video analytic algorithms. The optimal configuration
                 may also provide substantial savings on the total
                 number of cameras required to achieve the same level of
                 utility. In this article, we examine most, if not all,
                 of the recent approaches (post 2000) addressing camera
                 placement in a structured manner. We believe that our
                 work can serve as a first point of entry for readers
                 wishing to start researching into this area or
                 engineers who need to design a camera system in
                 practice. To this end, we attempt to provide a complete
                 study of relevant formulation strategies and brief
                 introductions to most commonly used optimization
                 techniques by researchers in this field. We hope our
                 work to be inspirational to spark new ideas in the
                 field.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Khan:2016:CLF,
  author =       "Suleman Khan and Abdullah Gani and Ainuddin Wahid
                 Abdul Wahab and Mustapha Aminu Bagiwa and Muhammad
                 Shiraz and Samee U. Khan and Rajkumar Buyya and Albert
                 Y. Zomaya",
  title =        "Cloud Log Forensics: Foundations, State of the Art,
                 and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "7:1--7:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2906149",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cloud log forensics (CLF) mitigates the investigation
                 process by identifying the malicious behavior of
                 attackers through profound cloud log analysis. However,
                 the accessibility attributes of cloud logs obstruct
                 accomplishment of the goal to investigate cloud logs
                 for various susceptibilities. Accessibility involves
                 the issues of cloud log access, selection of proper
                 cloud log file, cloud log data integrity, and
                 trustworthiness of cloud logs. Therefore, forensic
                 investigators of cloud log files are dependent on cloud
                 service providers (CSPs) to get access of different
                 cloud logs. Accessing cloud logs from outside the cloud
                 without depending on the CSP is a challenging research
                 area, whereas the increase in cloud attacks has
                 increased the need for CLF to investigate the malicious
                 activities of attackers. This paper reviews the state
                 of the art of CLF and highlights different challenges
                 and issues involved in investigating cloud log data.
                 The logging mode, the importance of CLF, and cloud
                 log-as-a-service are introduced. Moreover, case studies
                 related to CLF are explained to highlight the practical
                 implementation of cloud log investigation for analyzing
                 malicious behaviors. The CLF security requirements,
                 vulnerability points, and challenges are identified to
                 tolerate different cloud log susceptibilities. We
                 identify and introduce challenges and future directions
                 to highlight open research areas of CLF for motivating
                 investigators, academicians, and researchers to
                 investigate them.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gbenga:2016:ULP,
  author =       "Dada Emmanuel Gbenga and Effirul Ikhwan Ramlan",
  title =        "Understanding the Limitations of Particle Swarm
                 Algorithm for Dynamic Optimization Tasks: a Survey
                 Towards the Singularity of {PSO} for Swarm Robotic
                 Applications",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "8:1--8:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2906150",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "One of the most widely used biomimicry algorithms is
                 the Particle Swarm Optimization (PSO). Since its
                 introduction in 1995, it has caught the attention of
                 both researchers and academicians as a way of solving
                 various optimization problems, such as in the fields of
                 engineering and medicine, to computer image processing
                 and mission critical operations. PSO has been widely
                 applied in the field of swarm robotics, however, the
                 trend of creating a new variant PSO for each swarm
                 robotic project is alarming. We investigate the basic
                 properties of PSO algorithms relevant to the
                 implementation of swarm robotics and characterize the
                 limitations that promote this trend to manifest.
                 Experiments were conducted to investigate the
                 convergence properties of three PSO variants (original
                 PSO, SPSO and APSO) and the global optimum and local
                 optimal of these PSO algorithms were determined. We
                 were able to validate the existence of premature
                 convergence in these PSO variants by comparing 16
                 functions implemented alongside the PSO variant. This
                 highlighted the fundamental flaws in most variant PSOs,
                 and signifies the importance of developing a more
                 generalized PSO algorithm to support the implementation
                 of swarm robotics. This is critical in curbing the
                 influx of custom PSO and theoretically addresses the
                 fundamental flaws of the existing PSO algorithm.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zuo:2016:SSA,
  author =       "Xiang Zuo and Adriana Iamnitchi",
  title =        "A Survey of Socially Aware Peer-to-Peer Systems",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "9:1--9:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2894761",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Peer-to-peer technologies have proven their strength
                 in large-scale resource sharing and data transfer. Such
                 systems, however, still need to address a variety of
                 issues, including efficient routing, security, quality
                 of service, incentives, and reputation. Recent research
                 started leveraging social information to develop new
                 and effective techniques to improve the performance of
                 peer-to-peer systems. However, using social information
                 is a double-edged sword, which can bring benefits as
                 well as new challenges. This survey presents and
                 classifies the types of social information that have
                 been used so far in the design of peer-to-peer systems,
                 how the social fabric has been used to facilitate
                 transactions in the system, and some challenges caused
                 by using social information.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jiang:2016:UGB,
  author =       "Wenjun Jiang and Guojun Wang and Md Zakirul Alam
                 Bhuiyan and Jie Wu",
  title =        "Understanding Graph-Based Trust Evaluation in Online
                 Social Networks: Methodologies and Challenges",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "10:1--10:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2906151",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Online Social Networks (OSNs) are becoming a popular
                 method of meeting people and keeping in touch with
                 friends. OSNs resort to trust evaluation models and
                 algorithms to improve service quality and enhance user
                 experiences. Much research has been done to evaluate
                 trust and predict the trustworthiness of a target,
                 usually from the view of a source. Graph-based
                 approaches make up a major portion of the existing
                 works, in which the trust value is calculated through a
                 trusted graph (or trusted network, web of trust, or
                 multiple trust chains). In this article, we focus on
                 graph-based trust evaluation models in OSNs,
                 particularly in the computer science literature. We
                 first summarize the features of OSNs and the properties
                 of trust. Then we comparatively review two categories
                 of graph-simplification-based and graph-analogy-based
                 approaches and discuss their individual problems and
                 challenges. We also analyze the common challenges of
                 all graph-based models. To provide an integrated view
                 of trust evaluation, we conduct a brief review of its
                 pre- and postprocesses (i.e., the preparation and
                 validation of trust models, including information
                 collection, performance evaluation, and related
                 applications). Finally, we identify some open
                 challenges that all trust models are facing.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Silva:2016:VNN,
  author =       "Fabr{\'\i}cio A. Silva and Azzedine Boukerche and
                 Thais R. M. Braga Silva and Linnyer B. Ruiz and Eduardo
                 Cerqueira and Antonio A. F. Loureiro",
  title =        "Vehicular Networks: a New Challenge for
                 Content-Delivery-Based Applications",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "11:1--11:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2903745",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A significant number of promising applications for
                 vehicular ad hoc networks (VANETs) are becoming a
                 reality. Most of these applications require a variety
                 of heterogeneous content to be delivered to vehicles
                 and to their on-board users. However, the task of
                 content delivery in such dynamic and large-scale
                 networks is easier said than done. In this article, we
                 propose a classification of content delivery solutions
                 applied to VANETs while highlighting their new
                 characteristics and describing their underlying
                 architectural design. First, the two fundamental
                 building blocks that are part of an entire content
                 delivery system are identified: replica allocation and
                 content delivery. The related solutions are then
                 classified according to their architectural definition.
                 Within each category, solutions are described based on
                 the techniques and strategies that have been adopted.
                 As result, we present an in-depth discussion on the
                 architecture, techniques, and strategies adopted by
                 studies in the literature that tackle problems related
                 to vehicular content delivery networks.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fang:2016:CHI,
  author =       "Ruogu Fang and Samira Pouyanfar and Yimin Yang and
                 Shu-Ching Chen and S. S. Iyengar",
  title =        "Computational Health Informatics in the Big Data Age:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "12:1--12:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2932707",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The explosive growth and widespread accessibility of
                 digital health data have led to a surge of research
                 activity in the healthcare and data sciences fields.
                 The conventional approaches for health data management
                 have achieved limited success as they are incapable of
                 handling the huge amount of complex data with high
                 volume, high velocity, and high variety. This article
                 presents a comprehensive overview of the existing
                 challenges, techniques, and future directions for
                 computational health informatics in the big data age,
                 with a structured analysis of the historical and
                 state-of-the-art methods. We have summarized the
                 challenges into four Vs (i.e., volume, velocity,
                 variety, and veracity) and proposed a systematic
                 data-processing pipeline for generic big data in health
                 informatics, covering data capturing, storing, sharing,
                 analyzing, searching, and decision support.
                 Specifically, numerous techniques and algorithms in
                 machine learning are categorized and compared. On the
                 basis of this material, we identify and discuss the
                 essential prospects lying ahead for computational
                 health informatics in this big data age.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tang:2016:ESP,
  author =       "Jun Tang and Yong Cui and Qi Li and Kui Ren and
                 Jiangchuan Liu and Rajkumar Buyya",
  title =        "Ensuring Security and Privacy Preservation for Cloud
                 Data Services",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "13:1--13:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2906153",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "With the rapid development of cloud computing, more
                 and more enterprises/individuals are starting to
                 outsource local data to the cloud servers. However,
                 under open networks and not fully trusted cloud
                 environments, they face enormous security and privacy
                 risks (e.g., data leakage or disclosure, data
                 corruption or loss, and user privacy breach) when
                 outsourcing their data to a public cloud or using their
                 outsourced data. Recently, several studies were
                 conducted to address these risks, and a series of
                 solutions were proposed to enable data and privacy
                 protection in untrusted cloud environments. To fully
                 understand the advances and discover the research
                 trends of this area, this survey summarizes and
                 analyzes the state-of-the-art protection technologies.
                 We first present security threats and requirements of
                 an outsourcing data service to a cloud, and follow that
                 with a high-level overview of the corresponding
                 security technologies. We then dwell on existing
                 protection solutions to achieve secure, dependable, and
                 privacy-assured cloud data services including data
                 search, data computation, data sharing, data storage,
                 and data access. Finally, we propose open challenges
                 and potential research directions in each category of
                 solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:2016:SSG,
  author =       "Xirong Li and Tiberio Uricchio and Lamberto Ballan and
                 Marco Bertini and Cees G. M. Snoek and Alberto Del
                 Bimbo",
  title =        "Socializing the Semantic Gap: a Comparative Survey on
                 Image Tag Assignment, Refinement, and Retrieval",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "14:1--14:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2906152",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Where previous reviews on content-based image
                 retrieval emphasize what can be seen in an image to
                 bridge the semantic gap, this survey considers what
                 people tag about an image. A comprehensive treatise of
                 three closely linked problems (i.e., image tag
                 assignment, refinement, and tag-based image retrieval)
                 is presented. While existing works vary in terms of
                 their targeted tasks and methodology, they rely on the
                 key functionality of tag relevance, that is, estimating
                 the relevance of a specific tag with respect to the
                 visual content of a given image and its social context.
                 By analyzing what information a specific method
                 exploits to construct its tag relevance function and
                 how such information is exploited, this article
                 introduces a two-dimensional taxonomy to structure the
                 growing literature, understand the ingredients of the
                 main works, clarify their connections and difference,
                 and recognize their merits and limitations. For a
                 head-to-head comparison with the state of the art, a
                 new experimental protocol is presented, with training
                 sets containing 10,000, 100,000, and 1 million images,
                 and an evaluation on three test sets, contributed by
                 various research groups. Eleven representative works
                 are implemented and evaluated. Putting all this
                 together, the survey aims to provide an overview of the
                 past and foster progress for the near future.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Silva:2016:SCS,
  author =       "Nadia Felix F. Da Silva and Luiz F. S. Coletta and
                 Eduardo R. Hruschka",
  title =        "A Survey and Comparative Study of Tweet Sentiment
                 Analysis via Semi-Supervised Learning",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "15:1--15:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2932708",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Twitter is a microblogging platform in which users can
                 post status messages, called ``tweets,'' to their
                 friends. It has provided an enormous dataset of the
                 so-called sentiments, whose classification can take
                 place through supervised learning. To build supervised
                 learning models, classification algorithms require a
                 set of representative labeled data. However, labeled
                 data are usually difficult and expensive to obtain,
                 which motivates the interest in semi-supervised
                 learning. This type of learning uses unlabeled data to
                 complement the information provided by the labeled data
                 in the training process; therefore, it is particularly
                 useful in applications including tweet sentiment
                 analysis, where a huge quantity of unlabeled data is
                 accessible. Semi-supervised learning for tweet
                 sentiment analysis, although appealing, is relatively
                 new. We provide a comprehensive survey of
                 semi-supervised approaches applied to tweet
                 classification. Such approaches consist of graph-based,
                 wrapper-based, and topic-based methods. A comparative
                 study of algorithms based on self-training,
                 co-training, topic modeling, and distant supervision
                 highlights their biases and sheds light on aspects that
                 the practitioner should consider in real-world
                 applications.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Samant:2016:HBS,
  author =       "Durgesh Samant and Umesh Bellur",
  title =        "Handling Boot Storms in Virtualized Data Centers --- A
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "16:1--16:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2932709",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Large-scale virtual machine (VM) deployment in
                 virtualized data centers is a very slow process. This
                 is primarily due to the resource bottlenecks that are
                 created at the storage, network, and host physical
                 machines when a large number of VMs are requested
                 simultaneously. For companies that provide virtual
                 desktops to their employees, it is common to encounter
                 such requests each day, when their employees turn up
                 for work. In addition, a large number of VMs are often
                 required to be deployed instantly, in order to absorb a
                 spike in the workload, at online e-commerce websites.
                 In such scenarios, long deployment times are
                 unacceptable, and reducing them is of paramount
                 importance. In this article, we first abstract out the
                 key techniques suggested in the literature to speed up
                 this deployment process. We follow this with a
                 classification of these techniques into a taxonomy and
                 propose a framework that can be used to compare them.
                 Finally, we identify problem areas that warrant further
                 research and bring out the shortcomings of the current
                 state-of-the-art solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hassani:2016:VNL,
  author =       "Kaveh Hassani and Won-Sook Lee",
  title =        "Visualizing Natural Language Descriptions: a Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "17:1--17:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2932710",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A natural language interface exploits the conceptual
                 simplicity and naturalness of the language to create a
                 high-level user-friendly communication channel between
                 humans and machines. One of the promising applications
                 of such interfaces is generating visual interpretations
                 of semantic content of a given natural language that
                 can be then visualized either as a static scene or a
                 dynamic animation. This survey discusses requirements
                 and challenges of developing such systems and reports
                 26 graphical systems that exploit natural language
                 interfaces and addresses both artificial intelligence
                 and visualization aspects. This work serves as a frame
                 of reference to researchers and to enable further
                 advances in the field.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dan:2016:MPS,
  author =       "Ovidiu Dan and Brian D. Davison",
  title =        "Measuring and Predicting Search Engine Users'
                 Satisfaction",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "18:1--18:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2893486",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Search satisfaction is defined as the fulfillment of a
                 user's information need. Characterizing and predicting
                 the satisfaction of search engine users is vital for
                 improving ranking models, increasing user retention
                 rates, and growing market share. This article provides
                 an overview of the research areas related to user
                 satisfaction. First, we show that whenever users choose
                 to defect from one search engine to another they do so
                 mostly due to dissatisfaction with the search results.
                 We also describe several search engine switching
                 prediction methods, which could help search engines
                 retain more users. Second, we discuss research on the
                 difference between good and bad abandonment, which
                 shows that in approximately 30\% of all abandoned
                 searches the users are in fact satisfied with the
                 results. Third, we catalog techniques to determine
                 queries and groups of queries that are underperforming
                 in terms of user satisfaction. This can help improve
                 search engines by developing specialized rankers for
                 these query patterns. Fourth, we detail how task
                 difficulty affects user behavior and how task
                 difficulty can be predicted. Fifth, we characterize
                 satisfaction and we compare major satisfaction
                 prediction algorithms.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Viotti:2016:CNT,
  author =       "Paolo Viotti and Marko Vukoli{\'c}",
  title =        "Consistency in Non-Transactional Distributed Storage
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "19:1--19:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2926965",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Over the years, different meanings have been
                 associated with the word consistency in the distributed
                 systems community. While in the '80s ``consistency''
                 typically meant strong consistency, later defined also
                 as linearizability, in recent years, with the advent of
                 highly available and scalable systems, the notion of
                 ``consistency'' has been at the same time both weakened
                 and blurred. In this article, we aim to fill the void
                 in the literature by providing a structured and
                 comprehensive overview of different consistency notions
                 that appeared in distributed systems, and in particular
                 storage systems research, in the last four decades. We
                 overview more than 50 different consistency notions,
                 ranging from linearizability to eventual and weak
                 consistency, defining precisely many of these, in
                 particular where the previous definitions were
                 ambiguous. We further provide a partial order among
                 different consistency predicates, ordering them by
                 their semantic ``strength,'' which we believe will be
                 useful in future research. Finally, we map the
                 consistency semantics to different practical systems
                 and research prototypes. The scope of this article is
                 restricted to non-transactional semantics, that is,
                 those that apply to single storage object operations.
                 As such, our article complements the existing surveys
                 done in the context of transactional, database
                 consistency semantics.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Liang:2016:DIM,
  author =       "Junbin Liang and Jiannong Cao and Rui Liu and Tao Li",
  title =        "Distributed Intelligent {MEMS}: a Survey and a
                 Real-Time Programming Framework",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "20:1--20:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2926964",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In recent years, distributed intelligent
                 microelectromechanical systems (DiMEMSs) have appeared
                 as a new form of distributed embedded systems. DiMEMSs
                 contain thousands or millions of removable autonomous
                 devices, which will collaborate with each other to
                 achieve the final target of the whole system.
                 Programming such systems is becoming an extremely
                 difficult problem. The difficulty is due not only to
                 their inherent nature of distributed collaboration,
                 mobility, large scale, and limited resources of their
                 devices (e.g., in terms of energy, memory,
                 communication, and computation) but also to the
                 requirements of real-time control and tolerance for
                 uncertainties such as inaccurate actuation and
                 unreliable communications. As a result, existing
                 programming languages for traditional distributed and
                 embedded systems are not suitable for DiMEMSs. In this
                 article, we first introduce the origin and
                 characteristics of DiMEMSs and then survey typical
                 implementations of DiMEMSs and related research
                 hotspots. Finally, we propose a real-time programming
                 framework that can be used to design new real-time
                 programming languages for DiMEMSs. The framework is
                 composed of three layers: a real-time programming model
                 layer, a compilation layer, and a runtime system layer.
                 The design challenges and requirements of these layers
                 are investigated. The framework is then discussed in
                 further detail and suggestions for future research are
                 given.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Khwaja:2016:SSD,
  author =       "Salman Khwaja and Mohammad Alshayeb",
  title =        "Survey On Software Design-Pattern Specification
                 Languages",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "1",
  pages =        "21:1--21:??",
  month =        jul,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2926966",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:55 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A design pattern is a well-defined solution to a
                 recurrent problem. Over the years, the number of
                 patterns and domains of design patterns have expanded,
                 as the patterns are the experiences of the experts of
                 the domain captured in a higher-level abstraction. This
                 led others to work on languages for design patterns to
                 systematically document abstraction detailed in the
                 design pattern rather than capture algorithms and data.
                 These design-pattern specification languages come in
                 different flavors, targeting different aspects of
                 design patterns. Some design-pattern specification
                 languages tried to capture the description of the
                 design pattern in graphical or textual format, others
                 tried to discover design patterns in code or design
                 diagrams, and still other design-pattern specification
                 languages have other objectives. However, so far, no
                 effort has been made to compare these design-pattern
                 specification languages and identify their strengths
                 and weaknesses. This article provides a survey and a
                 comparison between existing design-pattern
                 specification languages using a design-pattern
                 specification language evaluation framework. Analysis
                 is done by grouping the design-pattern specification
                 languages into different categories. In addition, a
                 brief description is provided regarding the tools
                 available for the design-pattern specification
                 languages. Finally, we identify some open research
                 issues that still need to be resolved.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Estebanez:2016:STL,
  author =       "Alvaro Estebanez and Diego R. Llanos and Arturo
                 Gonzalez-Escribano",
  title =        "A Survey on Thread-Level Speculation Techniques",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "22:1--22:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2938369",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Thread-Level Speculation (TLS) is a promising
                 technique that allows the parallel execution of
                 sequential code without relying on a prior,
                 compile-time-dependence analysis. In this work, we
                 introduce the technique, present a taxonomy of TLS
                 solutions, and summarize and put into perspective the
                 most relevant advances in this field.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Carrara:2016:BCC,
  author =       "Brent Carrara and Carlisle Adams",
  title =        "Out-of-Band Covert Channels --- A Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "23:1--23:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2938370",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A novel class of covert channel, out-of-band covert
                 channels, is presented by extending Simmons' prisoners'
                 problem. This new class of covert channel is
                 established by surveying the existing covert channel,
                 device-pairing, and side-channel research. Terminology
                 as well as a taxonomy for out-of-band covert channels
                 is also given. Additionally, a more comprehensive
                 adversarial model based on a knowledgeable passive
                 adversary and a capable active adversary is proposed in
                 place of the current adversarial model, which relies on
                 an oblivious passive adversary. Last, general
                 protection mechanisms are presented, and an argument
                 for a general measure of ``covertness'' to effectively
                 compare covert channels is given.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Labati:2016:BRA,
  author =       "Ruggero Donida Labati and Angelo Genovese and Enrique
                 Mu{\~n}oz and Vincenzo Piuri and Fabio Scotti and
                 Gianluca Sforza",
  title =        "Biometric Recognition in Automated Border Control: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "24:1--24:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2933241",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The increasing demand for traveler clearance at
                 international border crossing points (BCPs) has
                 motivated research for finding more efficient
                 solutions. Automated border control (ABC) is emerging
                 as a solution to enhance the convenience of travelers,
                 the throughput of BCPs, and national security. This is
                 the first comprehensive survey on the biometric
                 techniques and systems that enable automatic identity
                 verification in ABC. We survey the biometric literature
                 relevant to identity verification and summarize the
                 best practices and biometric techniques applicable to
                 ABC, relying on real experience collected in the field.
                 Furthermore, we select some of the major biometric
                 issues raised and highlight the open research areas.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Xiao:2016:SWI,
  author =       "Jiang Xiao and Zimu Zhou and Youwen Yi and Lionel M.
                 Ni",
  title =        "A Survey on Wireless Indoor Localization from the
                 Device Perspective",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "25:1--25:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2933232",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "With the marvelous development of wireless techniques
                 and ubiquitous deployment of wireless systems indoors,
                 myriad indoor location-based services (ILBSs) have
                 permeated into numerous aspects of modern life. The
                 most fundamental functionality is to pinpoint the
                 location of the target via wireless devices. According
                 to how wireless devices interact with the target,
                 wireless indoor localization schemes roughly fall into
                 two categories: device based and device free. In
                 device-based localization, a wireless device (e.g., a
                 smartphone) is attached to the target and computes its
                 location through cooperation with other deployed
                 wireless devices. In device-free localization, the
                 target carries no wireless devices, while the wireless
                 infrastructure deployed in the environment determines
                 the target's location by analyzing its impact on
                 wireless signals. This article is intended to offer a
                 comprehensive state-of-the-art survey on wireless
                 indoor localization from the device perspective. In
                 this survey, we review the recent advances in both
                 modes by elaborating on the underlying wireless
                 modalities, basic localization principles, and data
                 fusion techniques, with special emphasis on emerging
                 trends in (1) leveraging smartphones to integrate
                 wireless and sensor capabilities and extend to the
                 social context for device-based localization, and (2)
                 extracting specific wireless features to trigger novel
                 human-centric device-free localization. We
                 comprehensively compare each scheme in terms of
                 accuracy, cost, scalability, and energy efficiency.
                 Furthermore, we take a first look at intrinsic
                 technical challenges in both categories and identify
                 several open research issues associated with these new
                 challenges.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kokkinos:2016:SLM,
  author =       "Panagiotis Kokkinos and Dimitris Kalogeras and Anna
                 Levin and Emmanouel Varvarigos",
  title =        "Survey: Live Migration and Disaster Recovery over
                 Long-Distance Networks",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "26:1--26:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2940295",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We study the virtual machine live migration (LM) and
                 disaster recovery (DR) from a networking perspective,
                 considering long-distance networks, for example,
                 between data centers. These networks are usually
                 constrained by limited available bandwidth, increased
                 latency and congestion, or high cost of use when
                 dedicated network resources are used, while their exact
                 characteristics cannot be controlled. LM and DR present
                 several challenges due to the large amounts of data
                 that need to be transferred over long-distance
                 networks, which increase with the number of migrated or
                 protected resources. In this context, our work presents
                 the way LM and DR are currently being performed and
                 their operation in long-distance networking
                 environments, discussing related issues and bottlenecks
                 and surveying other works. We also present the way
                 networks are evolving today and the new technologies
                 and protocols (e.g., software-defined networking, or
                 SDN, and flexible optical networks) that can be used to
                 boost the efficiency of LM and DR over long distances.
                 Traffic redirection in a long-distance environment is
                 also an important part of the whole equation, since it
                 directly affects the transparency of LM and DR. Related
                 works and solutions both from academia and the industry
                 are presented.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Onica:2016:CPP,
  author =       "Emanuel Onica and Pascal Felber and Hugues Mercier and
                 Etienne Rivi{\`e}re",
  title =        "Confidentiality-Preserving Publish\slash Subscribe: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "27:1--27:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2940296",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Publish/subscribe (pub/sub) is an attractive
                 communication paradigm for large-scale distributed
                 applications running across multiple administrative
                 domains. Pub/sub allows event-based information
                 dissemination based on constraints on the nature of the
                 data rather than on pre-established communication
                 channels. It is a natural fit for deployment in
                 untrusted environments such as public clouds linking
                 applications across multiple sites. However, pub/sub in
                 untrusted environments leads to major confidentiality
                 concerns stemming from the content-centric nature of
                 the communications. This survey classifies and analyzes
                 different approaches to confidentiality preservation
                 for pub/sub, from applications of trust and access
                 control models to novel encryption techniques. It
                 provides an overview of the current challenges posed by
                 confidentiality concerns and points to future research
                 directions in this promising field.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Giachanou:2016:LIS,
  author =       "Anastasia Giachanou and Fabio Crestani",
  title =        "Like It or Not: a Survey of {Twitter} Sentiment
                 Analysis Methods",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "28:1--28:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2938640",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Sentiment analysis in Twitter is a field that has
                 recently attracted research interest. Twitter is one of
                 the most popular microblog platforms on which users can
                 publish their thoughts and opinions. Sentiment analysis
                 in Twitter tackles the problem of analyzing the tweets
                 in terms of the opinion they express. This survey
                 provides an overview of the topic by investigating and
                 briefly describing the algorithms that have been
                 proposed for sentiment analysis in Twitter. The
                 presented studies are categorized according to the
                 approach they follow. In addition, we discuss fields
                 related to sentiment analysis in Twitter including
                 Twitter opinion retrieval, tracking sentiments over
                 time, irony detection, emotion detection, and tweet
                 sentiment quantification, tasks that have recently
                 attracted increasing attention. Resources that have
                 been used in the Twitter sentiment analysis literature
                 are also briefly presented. The main contributions of
                 this survey include the presentation of the proposed
                 approaches for sentiment analysis in Twitter, their
                 categorization according to the technique they use, and
                 the discussion of recent research trends of the topic
                 and its related fields.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kanvar:2016:HAS,
  author =       "Vini Kanvar and Uday P. Khedker",
  title =        "Heap Abstractions for Static Analysis",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "29:1--29:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2931098",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Heap data is potentially unbounded and seemingly
                 arbitrary. Hence, unlike stack and static data, heap
                 data cannot be abstracted in terms of a fixed set of
                 program variables. This makes it an interesting topic
                 of study and there is an abundance of literature
                 employing heap abstractions. Although most studies have
                 addressed similar concerns, insights gained in one
                 description of heap abstraction may not directly carry
                 over to some other description. In our search of a
                 unified theme, we view heap abstraction as consisting
                 of two steps: (a) heap modelling, which is the process
                 of representing a heap memory (i.e., an unbounded set
                 of concrete locations) as a heap model (i.e., an
                 unbounded set of abstract locations), and (b)
                 summarization, which is the process of bounding the
                 heap model by merging multiple abstract locations into
                 summary locations. We classify the heap models as
                 storeless, store based, and hybrid. We describe various
                 summarization techniques based on $k$-limiting,
                 allocation sites, patterns, variables, other generic
                 instrumentation predicates, and higher-order logics.
                 This approach allows us to compare the insights of a
                 large number of seemingly dissimilar heap abstractions
                 and also paves the way for creating new abstractions by
                 mix and match of models and summarization techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Souza:2016:TTS,
  author =       "{\'E}fren L. Souza and Eduardo F. Nakamura and Richard
                 W. Pazzi",
  title =        "Target Tracking for Sensor Networks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "30:1--30:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2938639",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Target-tracking algorithms typically organize the
                 network into a logical structure (e.g., tree, cluster,
                 or faces) to enable data fusion and reduce
                 communication costs. These algorithms often predict the
                 target's future position. In addition to using position
                 forecasts for decision making, we can also use such
                 information to save energy by activating only the set
                 of sensors nearby the target's trajectory. In this
                 work, we survey of the state of the art of
                 target-tracking techniques in sensor networks. We
                 identify three different formulations for the
                 target-tracking problem and classify the
                 target-tracking algorithms based on common
                 characteristics. Furthermore, for the sake of a better
                 understanding of the target-tracking process, we
                 organize this process in six components: target
                 detection, node cooperation, position computation,
                 future-position estimation, energy management, and
                 target recovery. Each component has different solutions
                 that affect the target-tracking performance.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Branco:2016:SPM,
  author =       "Paula Branco and Lu{\'\i}s Torgo and Rita P. Ribeiro",
  title =        "A Survey of Predictive Modeling on Imbalanced
                 Domains",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "31:1--31:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2907070",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Many real-world data-mining applications involve
                 obtaining predictive models using datasets with
                 strongly imbalanced distributions of the target
                 variable. Frequently, the least-common values of this
                 target variable are associated with events that are
                 highly relevant for end users (e.g., fraud detection,
                 unusual returns on stock markets, anticipation of
                 catastrophes, etc.). Moreover, the events may have
                 different costs and benefits, which, when associated
                 with the rarity of some of them on the available
                 training data, creates serious problems to predictive
                 modeling techniques. This article presents a survey of
                 existing techniques for handling these important
                 applications of predictive analytics. Although most of
                 the existing work addresses classification tasks
                 (nominal target variables), we also describe methods
                 designed to handle similar problems within regression
                 tasks (numeric target variables). In this survey, we
                 discuss the main challenges raised by imbalanced
                 domains, propose a definition of the problem, describe
                 the main approaches to these tasks, propose a taxonomy
                 of the methods, summarize the conclusions of existing
                 comparative studies as well as some theoretical
                 analyses of some methods, and refer to some related
                 problems within predictive modeling.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Alsabah:2016:PSI,
  author =       "Mashael Alsabah and Ian Goldberg",
  title =        "Performance and Security Improvements for {Tor}: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "32:1--32:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2946802",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Tor [Dingledine et al. 2004] is the most widely used
                 anonymity network today, serving millions of users on a
                 daily basis using a growing number of volunteer-run
                 routers. Since its deployment in 2003, there have been
                 more than three dozen proposals that aim to improve its
                 performance, security, and unobservability. Given the
                 significance of this research area, our goal is to
                 provide the reader with the state of current research
                 directions and challenges in anonymous communication
                 systems, focusing on the Tor network. We shed light on
                 the design weaknesses and challenges facing the network
                 and point out unresolved issues.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Khalifa:2016:SPB,
  author =       "Shadi Khalifa and Yehia Elshater and Kiran
                 Sundaravarathan and Aparna Bhat and Patrick Martin and
                 Fahim Imam and Dan Rope and Mike Mcroberts and Craig
                 Statchuk",
  title =        "The Six Pillars for Building Big Data Analytics
                 Ecosystems",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "33:1--33:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2963143",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "With almost everything now online, organizations look
                 at the Big Data collected to gain insights for
                 improving their services. In the analytics process,
                 derivation of such insights requires experimenting-with
                 and integrating different analytics techniques, while
                 handling the Big Data high arrival velocity and large
                 volumes. Existing solutions cover bits-and-pieces of
                 the analytics process, leaving it to organizations to
                 assemble their own ecosystem or buy an off-the-shelf
                 ecosystem that can have unnecessary components to them.
                 We build on this point by dividing the Big Data
                 Analytics problem into six main pillars. We
                 characterize and show examples of solutions designed
                 for each of these pillars. We then integrate these six
                 pillars into a taxonomy to provide an overview of the
                 possible state-of-the-art analytics ecosystems. In the
                 process, we highlight a number of ecosystems to meet
                 organizations different needs. Finally, we identify
                 possible areas of research for building future Big Data
                 Analytics Ecosystems.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mittal:2016:SRP,
  author =       "Sparsh Mittal",
  title =        "A Survey of Recent Prefetching Techniques for
                 Processor Caches",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "35:1--35:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2907071",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "As the trends of process scaling make memory systems
                 an even more crucial bottleneck, the importance of
                 latency hiding techniques such as prefetching grows
                 further. However, naively using prefetching can harm
                 performance and energy efficiency and, hence, several
                 factors and parameters need to be taken into account to
                 fully realize its potential. In this article, we survey
                 several recent techniques that aim to improve the
                 implementation and effectiveness of prefetching. We
                 characterize the techniques on several parameters to
                 highlight their similarities and differences. The aim
                 of this survey is to provide insights to researchers
                 into working of prefetching techniques and spark
                 interesting future work for improving the performance
                 advantages of prefetching even further.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kofler:2016:UIM,
  author =       "Christoph Kofler and Martha Larson and Alan Hanjalic",
  title =        "User Intent in Multimedia Search: a Survey of the
                 State of the Art and Future Challenges",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "36:1--36:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2954930",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Today's multimedia search engines are expected to
                 respond to queries reflecting a wide variety of
                 information needs from users with different goals. The
                 topical dimension (``what'' the user is searching for)
                 of these information needs is well studied; however,
                 the intent dimension (``why'' the user is searching)
                 has received relatively less attention. Specifically,
                 intent is the ``immediate reason, purpose, or goal''
                 that motivates a user to query a search engine. We
                 present a thorough survey of multimedia information
                 retrieval research directed at the problem of enabling
                 search engines to respond to user intent. The survey
                 begins by defining intent, including a differentiation
                 from related, often-confused concepts. It then presents
                 the key conceptual models of search intent. The core is
                 an overview of intent-aware approaches that operate at
                 each stage of the multimedia search engine pipeline
                 (i.e., indexing, query processing, ranking). We discuss
                 intent in conventional text-based search wherever it
                 provides insight into multimedia search intent or
                 intent-aware approaches. Finally, we identify and
                 discuss the most important future challenges for
                 intent-aware multimedia search engines. Facing these
                 challenges will allow multimedia information retrieval
                 to recognize and respond to user intent and, as a
                 result, fully satisfy the information needs of users.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Karydi:2016:PDC,
  author =       "Efthalia Karydi and Konstantinos Margaritis",
  title =        "Parallel and Distributed Collaborative Filtering: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "37:1--37:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2951952",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Collaborative filtering is among the most preferred
                 techniques when implementing recommender systems.
                 Recently, great interest has turned toward parallel and
                 distributed implementations of collaborative filtering
                 algorithms. This work is a survey of parallel and
                 distributed collaborative filtering implementations,
                 aiming to not only provide a comprehensive presentation
                 of the field's development but also offer future
                 research directions by highlighting the issues that
                 need to be developed further.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Xu:2016:TES,
  author =       "Meng Xu and Chengyu Song and Yang Ji and Ming-Wei Shih
                 and Kangjie Lu and Cong Zheng and Ruian Duan and
                 Yeongjin Jang and Byoungyoung Lee and Chenxiong Qian
                 and Sangho Lee and Taesoo Kim",
  title =        "Toward Engineering a Secure {Android} Ecosystem: a
                 Survey of Existing Techniques",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "38:1--38:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2963145",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The openness and extensibility of Android have made it
                 a popular platform for mobile devices and a strong
                 candidate to drive the Internet-of-Things.
                 Unfortunately, these properties also leave Android
                 vulnerable, attracting attacks for profit or fun. To
                 mitigate these threats, numerous issue-specific
                 solutions have been proposed. With the increasing
                 number and complexity of security problems and
                 solutions, we believe this is the right moment to step
                 back and systematically re-evaluate the Android
                 security architecture and security practices in the
                 ecosystem. We organize the most recent security
                 research on the Android platform into two categories:
                 the software stack and the ecosystem. For each
                 category, we provide a comprehensive narrative of the
                 problem space, highlight the limitations of the
                 proposed solutions, and identify open problems for
                 future research. Based on our collection of knowledge,
                 we envision a blueprint for engineering a secure,
                 next-generation Android ecosystem.",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Xavier:2016:SMM,
  author =       "Emerson M. A. Xavier and Francisco J. Ariza-L{\'o}pez
                 and Manuel A. Ure{\~n}a-C{\'a}mara",
  title =        "A Survey of Measures and Methods for Matching
                 Geospatial Vector Datasets",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "39:1--39:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2963147",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The field of Geographical Information Systems (GIS)
                 has experienced a rapid and ongoing growth of available
                 sources for geospatial data. This growth has demanded
                 more data integration in order to explore the benefits
                 of these data further. However, many data providers
                 implies many points of view for the same phenomena:
                 geospatial features. We need sophisticated procedures
                 aiming to find the correspondences between two vector
                 datasets, a process named geospatial data matching.
                 Similarity measures are key-tools for matching methods,
                 so it is interesting to review these concepts together.
                 This article provides a survey of 30 years of research
                 into the measures and methods facing geospatial data
                 matching. Our survey presents related work and develops
                 a common taxonomy that permits us to compare measures
                 and methods. This study points out relevant issues that
                 may help to discover the potential of these approaches
                 in many applications, like data integration,
                 conflation, quality evaluation, and data management.",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Maqsood:2016:SIO,
  author =       "Tahir Maqsood and Osman Khalid and Rizwana Irfan and
                 Sajjad A. Madani and Samee U. Khan",
  title =        "Scalability Issues in Online Social Networks",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "2",
  pages =        "40:1--40:??",
  month =        sep,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2968216",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The last decade witnessed a tremendous increase in
                 popularity and usage of social network services, such
                 as Facebook, Twitter, and YouTube. Moreover, advances
                 in Web technologies coupled with social networks has
                 enabled users to not only access, but also generate,
                 content in many forms. The overwhelming amount of
                 produced content and resulting network traffic gives
                 rise to precarious scalability issues for social
                 networks, such as handling a large number of users,
                 infrastructure management, internal network traffic,
                 content dissemination, and data storage. There are few
                 surveys conducted to explore the different dimensions
                 of social networks, such as security, privacy, and data
                 acquisition. Most of the surveys focus on privacy or
                 security-related issues and do not specifically address
                 scalability challenges faced by social networks. In
                 this survey, we provide a comprehensive study of social
                 networks along with their significant characteristics
                 and categorize social network architectures into three
                 broad categories: (a) centralized, (b) decentralized,
                 and (c) hybrid. We also highlight various scalability
                 issues faced by social network architectures. Finally,
                 a qualitative comparison of presented architectures is
                 provided, which is based on various scalability
                 metrics, such as availability, latency, interserver
                 communication, cost of resources, and energy
                 consumption, just to name a few.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bridges:2016:UGP,
  author =       "Robert A. Bridges and Neena Imam and Tiffany M.
                 Mintz",
  title =        "Understanding {GPU} Power: a Survey of Profiling,
                 Modeling, and Simulation Methods",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "41:1--41:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2962131",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Modern graphics processing units (GPUs) have complex
                 architectures that admit exceptional performance and
                 energy efficiency for high-throughput applications.
                 Although GPUs consume large amounts of power, their use
                 for high-throughput applications facilitate
                 state-of-the-art energy efficiency and performance.
                 Consequently, continued development relies on
                 understanding their power consumption. This work is a
                 survey of GPU power modeling and profiling methods with
                 increased detail on noteworthy efforts. As direct
                 measurement of GPU power is necessary for model
                 evaluation and parameter initiation, internal and
                 external power sensors are discussed. Hardware
                 counters, which are low-level tallies of hardware
                 events, share strong correlation to power use and
                 performance. Statistical correlation between power and
                 performance counters has yielded worthwhile GPU power
                 models, yet the complexity inherent to GPU
                 architectures presents new hurdles for power modeling.
                 Developments and challenges of counter-based GPU power
                 modeling are discussed. Often building on the
                 counter-based models, research efforts for GPU power
                 simulation, which make power predictions from input
                 code and hardware knowledge, provide opportunities for
                 optimization in programming or architectural design.
                 Noteworthy strides in power simulations for GPUs are
                 included along with their performance or functional
                 simulator counterparts when appropriate. Last, possible
                 directions for future research are discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tang:2016:SSN,
  author =       "Jiliang Tang and Yi Chang and Charu Aggarwal and Huan
                 Liu",
  title =        "A Survey of Signed Network Mining in Social Media",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "42:1--42:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2956185",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Many real-world relations can be represented by signed
                 networks with positive and negative links, as a result
                 of which signed network analysis has attracted
                 increasing attention from multiple disciplines. With
                 the increasing prevalence of social media networks,
                 signed network analysis has evolved from developing and
                 measuring theories to mining tasks. In this article, we
                 present a review of mining signed networks in the
                 context of social media and discuss some promising
                 research directions and new frontiers. We begin by
                 giving basic concepts and unique properties and
                 principles of signed networks. Then we classify and
                 review tasks of signed network mining with
                 representative algorithms. We also delineate some tasks
                 that have not been extensively studied with formal
                 definitions and also propose research directions to
                 expand the field of signed network mining.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Blasco:2016:SWB,
  author =       "Jorge Blasco and Thomas M. Chen and Juan Tapiador and
                 Pedro Peris-Lopez",
  title =        "A Survey of Wearable Biometric Recognition Systems",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "43:1--43:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2968215",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The growing popularity of wearable devices is leading
                 to new ways to interact with the environment, with
                 other smart devices, and with other people. Wearables
                 equipped with an array of sensors are able to capture
                 the owner's physiological and behavioural traits, thus
                 are well suited for biometric authentication to control
                 other devices or access digital services. However,
                 wearable biometrics have substantial differences from
                 traditional biometrics for computer systems, such as
                 fingerprints, eye features, or voice. In this article,
                 we discuss these differences and analyse how
                 researchers are approaching the wearable biometrics
                 field. We review and provide a categorization of
                 wearable sensors useful for capturing biometric
                 signals. We analyse the computational cost of the
                 different signal processing techniques, an important
                 practical factor in constrained devices such as
                 wearables. Finally, we review and classify the most
                 recent proposals in the field of wearable biometrics in
                 terms of the structure of the biometric system
                 proposed, their experimental setup, and their results.
                 We also present a critique of experimental issues such
                 as evaluation and feasibility aspects, and offer some
                 final thoughts on research directions that need
                 attention in future work.",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Trobec:2016:INP,
  author =       "Roman Trobec and Radivoje Vasiljevi{\'c} and Milo
                 Tomasevi{\'c} and Veljko Milutinovi{\'c} and Ramon
                 Beivide and Mateo Valero",
  title =        "Interconnection Networks in Petascale Computer
                 Systems: a Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "44:1--44:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2983387",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article provides background information about
                 interconnection networks, an analysis of previous
                 developments, and an overview of the state of the art.
                 The main contribution of this article is to highlight
                 the importance of the interpolation and extrapolation
                 of technological changes and physical constraints in
                 order to predict the optimum future interconnection
                 network. The technological changes are related to three
                 of the most important attributes of interconnection
                 networks: topology, routing, and flow-control
                 algorithms. On the other hand, the physical
                 constraints, that is, port counts, number of
                 communication nodes, and communication speed, determine
                 the realistic properties of the network. We present the
                 state-of-the-art technology for the most commonly used
                 interconnection networks and some background related to
                 often-used network topologies. The interconnection
                 networks of the best-performing petascale parallel
                 computers from past and present Top500 lists are
                 analyzed. The lessons learned from this analysis
                 indicate that computer networks need better performance
                 in future exascale computers. Such an approach leads to
                 the conclusion that a high-radix topology with optical
                 connections for longer links is set to become the
                 optimum interconnect for a number of relevant
                 application domains.",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Singh:2016:TSA,
  author =       "Jasmeet Singh and Vishal Gupta",
  title =        "Text Stemming: Approaches, Applications, and
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "45:1--45:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2975608",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Stemming is a process in which the variant word forms
                 are mapped to their base form. It is among the basic
                 text pre-processing approaches used in Language
                 Modeling, Natural Language Processing, and Information
                 Retrieval applications. In this article, we present a
                 comprehensive survey of text stemming techniques,
                 evaluation mechanisms, and application domains. The
                 main objective of this survey is to distill the main
                 insights and present a detailed assessment of the
                 current state of the art. The performance of some
                 well-known rule-based and statistical stemming
                 algorithms in different scenarios has been analyzed. In
                 the end, we highlighted some open issues and challenges
                 related to unsupervised statistical text stemming. This
                 research work will help the researchers to select the
                 most suitable text stemming technique in a specific
                 application and will also serve as a guide to identify
                 the areas that need attention from the research
                 community.",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Coppola:2016:CCT,
  author =       "Riccardo Coppola and Maurizio Morisio",
  title =        "Connected Car: Technologies, Issues, Future Trends",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "46:1--46:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2971482",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The connected car --- a vehicle capable of accessing
                 to the Internet, of communicating with smart devices as
                 well as other cars and road infrastructures, and of
                 collecting real-time data from multiple sources --- is
                 likely to play a fundamental role in the foreseeable
                 Internet of Things. In a context ruled by very strong
                 competitive forces, a significant amount of car
                 manufacturers and software and hardware developers have
                 already embraced the challenge of providing innovative
                 solutions for new-generation vehicles. Today's cars are
                 asked to relieve drivers from the most stressful
                 operations needed for driving, providing them with
                 interesting and updated entertainment functions. In the
                 meantime, they have to comply with the increasingly
                 stringent standards about safety and reliability. The
                 aim of this article is to provide an overview of the
                 possibilities offered by connected functionalities on
                 cars and the associated technological issues and
                 problems, as well as to enumerate the currently
                 available hardware and software solutions and their
                 main features.",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cho:2016:SRA,
  author =       "Keewon Cho and Wooheon Kang and Hyungjun Cho and
                 Changwook Lee and Sungho Kang",
  title =        "A Survey of Repair Analysis Algorithms for Memories",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "47:1--47:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2971481",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Current rapid advancements in deep submicron
                 technologies have enabled the implementation of very
                 large memory devices and embedded memories. However,
                 the memory growth increases the number of defects,
                 reducing the yield and reliability of such devices.
                 Faulty cells are commonly repaired by using redundant
                 cells, which are embedded in memory arrays by adding
                 spare rows and columns. The repair process requires an
                 efficient redundancy analysis (RA) algorithm. Spare
                 architectures for the repair of faulty memory include
                 one-dimensional (1D) spare architectures,
                 two-dimensional (2D) spare architectures, and
                 configurable spare architectures. Of these types, 2D
                 spare architectures, which prepare extra rows and
                 columns for repair, are popular because of their better
                 repairing efficiency than 1D spare architectures and
                 easier implementation than configurable spare
                 architectures. However, because the complexity of the
                 RA is NP-complete, the RA algorithm should consider
                 various factors in order to determine a repair
                 solution. The performance depends on three factors:
                 analysis time, repair rate, and area overhead. In this
                 article, we survey RA algorithms for memory devices as
                 well as built-in repair algorithms for improving these
                 performance factors. Built-in redundancy analysis
                 techniques for emergent three-dimensional integrated
                 circuits are also discussed. Based on this analysis, we
                 then discuss future research challenges for
                 faulty-memory repair studies.",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ribeiro:2016:TDU,
  author =       "Mateus L. Ribeiro and Henrique Manoel Lederman and
                 Simone Elias and F{\'a}tima L. S. Nunes",
  title =        "Techniques and Devices Used in Palpation Simulation
                 with Haptic Feedback",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "48:1--48:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2962723",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Palpation exam is a procedure in which a healthcare
                 professional presses a specific region of a patient's
                 body with the fingers in order to detect the presence
                 of features and abnormalities under the skin. A
                 simulator that aids the training of this procedure may
                 contribute to the learning of the technique and the
                 improvement of its implementation in real patients.
                 This article presents a systematic review conducted in
                 order to assess the state of the art of the simulation
                 of the palpation procedure, providing a categorization
                 of techniques and approaches used in systems with
                 haptic feedback. The results indicate that there are
                 existing gaps concerning the accessibility of the
                 haptic devices, innovative methods to calculate force
                 feedback and deformation caused by haptic devices, and
                 user experience improvement, since most of the studies
                 consider only one point of contact, which can limit the
                 simulation realism.",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pietri:2016:MVM,
  author =       "Ilia Pietri and Rizos Sakellariou",
  title =        "Mapping Virtual Machines onto Physical Machines in
                 Cloud Computing: a Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "49:1--49:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2983575",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Cloud computing enables users to provision resources
                 on demand and execute applications in a way that meets
                 their requirements by choosing virtual resources that
                 fit their application resource needs. Then, it becomes
                 the task of cloud resource providers to accommodate
                 these virtual resources onto physical resources. This
                 problem is a fundamental challenge in cloud computing
                 as resource providers need to map virtual resources
                 onto physical resources in a way that takes into
                 account the providers' optimization objectives. This
                 article surveys the relevant body of literature that
                 deals with this mapping problem and how it can be
                 addressed in different scenarios and through different
                 objectives and optimization techniques. The evaluation
                 aspects of different solutions are also considered. The
                 article aims at both identifying and classifying
                 research done in the area adopting a categorization
                 that can enhance understanding of the problem.",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shu:2016:SSI,
  author =       "Rui Shu and Peipei Wang and Sigmund A. {Gorski III}
                 and Benjamin Andow and Adwait Nadkarni and Luke
                 Deshotels and Jason Gionta and William Enck and Xiaohui
                 Gu",
  title =        "A Study of Security Isolation Techniques",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "50:1--50:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2988545",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Security isolation is a foundation of computing
                 systems that enables resilience to different forms of
                 attacks. This article seeks to understand existing
                 security isolation techniques by systematically
                 classifying different approaches and analyzing their
                 properties. We provide a hierarchical classification
                 structure for grouping different security isolation
                 techniques. At the top level, we consider two principal
                 aspects: mechanism and policy. Each aspect is broken
                 down into salient dimensions that describe key
                 properties. We break the mechanism into two dimensions,
                 enforcement location and isolation granularity, and
                 break the policy aspect down into three dimensions:
                 policy generation, policy configurability, and policy
                 lifetime. We apply our classification to a set of
                 representative articles that cover a breadth of
                 security isolation techniques and discuss tradeoffs
                 among different design choices and limitations of
                 existing approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Steiner:2016:AWS,
  author =       "Rodrigo Vieira Steiner and Emil Lupu",
  title =        "Attestation in Wireless Sensor Networks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "51:1--51:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2988546",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Attestation is a mechanism used by a trusted entity to
                 validate the software integrity of an untrusted
                 platform. Over the past few years, several attestation
                 techniques have been proposed. While they all use
                 variants of a challenge-response protocol, they make
                 different assumptions about what an attacker can and
                 cannot do. Thus, they propose intrinsically divergent
                 validation approaches. We survey in this article the
                 different approaches to attestation, focusing in
                 particular on those aimed at Wireless Sensor Networks.
                 We discuss the motivations, challenges, assumptions,
                 and attacks of each approach. We then organise them
                 into a taxonomy and discuss the state of the art,
                 carefully analysing the advantages and disadvantages of
                 each proposal. We also point towards the open research
                 problems and give directions on how to address them.",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Abreu:2016:PBC,
  author =       "Pedro Henriques Abreu and Miriam Seoane Santos and
                 Miguel Henriques Abreu and Bruno Andrade and Daniel
                 Castro Silva",
  title =        "Predicting Breast Cancer Recurrence Using Machine
                 Learning Techniques: a Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "52:1--52:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2988544",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Background: Recurrence is an important cornerstone in
                 breast cancer behavior, intrinsically related to
                 mortality. In spite of its relevance, it is rarely
                 recorded in the majority of breast cancer datasets,
                 which makes research in its prediction more difficult.
                 Objectives: To evaluate the performance of machine
                 learning techniques applied to the prediction of breast
                 cancer recurrence. Material and Methods: Revision of
                 published works that used machine learning techniques
                 in local and open source databases between 1997 and
                 2014. Results: The revision showed that it is difficult
                 to obtain a representative dataset for breast cancer
                 recurrence and there is no consensus on the best set of
                 predictors for this disease. High accuracy results are
                 often achieved, yet compromising sensitivity. The
                 missing data and class imbalance problems are rarely
                 addressed and most often the chosen performance metrics
                 are inappropriate for the context. Discussion and
                 Conclusions: Although different techniques have been
                 used, prediction of breast cancer recurrence is still
                 an open problem. The combination of different machine
                 learning techniques, along with the definition of
                 standard predictors for breast cancer recurrence seem
                 to be the main future directions to obtain better
                 results.",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Malik:2016:GRN,
  author =       "Jamshaid Sarwar Malik and Ahmed Hemani",
  title =        "{Gaussian} Random Number Generation: a Survey on
                 Hardware Architectures",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "53:1--53:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2980052",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  abstract =     "Some excellent surveys of the Gaussian random number
                 generators (GRNGs) from the algorithmic perspective
                 exist in the published literature to date (e.g., Thomas
                 et al. [2007]). In the last decade, however,
                 advancements in digital hardware have resulted in an
                 ever-decreasing hardware cost and increased design
                 flexibility. Additionally, recent advances in
                 applications like gaming, weather forecasting, and
                 simulations in physics and astronomy require faster,
                 cheaper, and statistically accurate GRNGs. These two
                 trends have contributed toward the development of a
                 number of novel GRNG architectures optimized for
                 hardware design. A detailed comparative study of these
                 hardware architectures has been somewhat missing in the
                 published literature. This work provides the potential
                 user a capsulization of the published hardware GRNG
                 architectures. We have provided the method and theory,
                 pros and cons, and a comparative summary of the speed,
                 statistical accuracy, and hardware resource utilization
                 of these architectures. Finally, we have complemented
                 this work by describing two novel hardware GRNG
                 architectures, namely, the CLT-inversion and the
                 multihat algorithm, respectively. These new
                 architectures provide high tail accuracy ($ 6 \sigma $
                 and $ 8 \sigma $, respectively) at a low hardware
                 cost.",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Brault-Baron:2016:HAR,
  author =       "Johann Brault-Baron",
  title =        "Hypergraph Acyclicity Revisited",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "54:1--54:??",
  month =        dec,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2983573",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:25:05 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The notion of graph acyclicity has been extended to
                 several notions of hypergraph acyclicity. In increasing
                 order of generality: gamma acyclicity, beta acyclicity,
                 and alpha acyclicity have met a great interest in many
                 fields. For each notion, we prove the equivalence
                 between the numerous characterizations with a new,
                 simpler proof, in a self-contained manner. For that
                 purpose, we introduce new notions of alpha, beta, and
                 gamma leaf that allow one to define new ``rule-based''
                 characterizations of each notion. The combined
                 presentation of the notions is completed with a study
                 of their respective closure properties. New closure
                 results are established, and alpha, beta, and gamma
                 acyclicity are proved optimal w.r.t. their closure
                 properties.",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Reaves:2016:DAE,
  author =       "Bradley Reaves and Jasmine Bowers and Sigmund Albert
                 {Gorski III} and Olabode Anise and Rahul Bobhate and
                 Raymond Cho and Hiranava Das and Sharique Hussain and
                 Hamza Karachiwala and Nolen Scaife and Byron Wright and
                 Kevin Butler and William Enck and Patrick Traynor",
  title =        "{*droid}: Assessment and Evaluation of {Android}
                 Application Analysis Tools",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "55:1--55:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2996358",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The security research community has invested
                 significant effort in improving the security of Android
                 applications over the past half decade. This effort has
                 addressed a wide range of problems and resulted in the
                 creation of many tools for application analysis. In
                 this article, we perform the first systematization of
                 Android security research that analyzes applications,
                 characterizing the work published in more than 17 top
                 venues since 2010. We categorize each paper by the
                 types of problems they solve, highlight areas that have
                 received the most attention, and note whether tools
                 were ever publicly released for each effort. Of the
                 released tools, we then evaluate a representative
                 sample to determine how well application developers can
                 apply the results of our community's efforts to improve
                 their products. We find not only that significant work
                 remains to be done in terms of research coverage but
                 also that the tools suffer from significant issues
                 ranging from lack of maintenance to the inability to
                 produce functional output for applications with known
                 vulnerabilities. We close by offering suggestions on
                 how the community can more successfully move forward.",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Aleti:2016:SLR,
  author =       "Aldeida Aleti and Irene Moser",
  title =        "A Systematic Literature Review of Adaptive Parameter
                 Control Methods for Evolutionary Algorithms",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "56:1--56:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2996355",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Evolutionary algorithms (EAs) are robust stochastic
                 optimisers that perform well over a wide range of
                 problems. Their robustness, however, may be affected by
                 several adjustable parameters, such as mutation rate,
                 crossover rate, and population size. Algorithm
                 parameters are usually problem-specific, and often have
                 to be tuned not only to the problem but even the
                 problem instance at hand to achieve ideal performance.
                 In addition, research has shown that different
                 parameter values may be optimal at different stages of
                 the optimisation process. To address these issues,
                 researchers have shifted their focus to adaptive
                 parameter control, in which parameter values are
                 adjusted during the optimisation process based on the
                 performance of the algorithm. These methods redefine
                 parameter values repeatedly based on implicit or
                 explicit rules that decide how to make the best use of
                 feedback from the optimisation algorithm. In this
                 survey, we systematically investigate the state of the
                 art in adaptive parameter control. The approaches are
                 classified using a new conceptual model that subdivides
                 the process of adapting parameter values into four
                 steps that are present explicitly or implicitly in all
                 existing approaches that tune parameters dynamically
                 during the optimisation process. The analysis reveals
                 the major focus areas of adaptive parameter control
                 research as well as gaps and potential directions for
                 further development in this area.",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:2016:PDS,
  author =       "Tuo Li and Jude Angelo Ambrose and Roshan Ragel and
                 Sri Parameswaran",
  title =        "Processor Design for Soft Errors: Challenges and State
                 of the Art",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "57:1--57:??",
  month =        nov,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2996357",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Nov 8 16:12:56 MST 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Today, soft errors are one of the major design
                 technology challenges at and beyond the 22nm technology
                 nodes. This article introduces the soft error problem
                 from the perspective of processor design. This article
                 also provides a survey of the existing soft error
                 mitigation methods across different levels of design
                 abstraction involved in processor design, including the
                 device level, the circuit level, the architectural
                 level, and the program level.",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dias:2016:SAP,
  author =       "Gabriel Martins Dias and Boris Bellalta and Simon
                 Oechsner",
  title =        "A Survey About Prediction-Based Data Reduction in
                 Wireless Sensor Networks",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "58:1--58:??",
  month =        dec,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2996356",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:25:05 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "One of the main characteristics of Wireless Sensor
                 Networks (WSNs) is the constrained energy resources of
                 their wireless sensor nodes. Although this issue has
                 been addressed in several works and received much
                 attention over the years, the most recent advances
                 pointed out that the energy harvesting and wireless
                 charging techniques may offer means to overcome such a
                 limitation. Consequently, an issue that had been put in
                 second place now emerges: the low availability of
                 spectrum resources. Because of it, the incorporation of
                 the WSNs into the Internet of Things and the
                 exponential growth of the latter may be hindered if no
                 control over the data generation is taken.
                 Alternatively, part of the sensed data can be predicted
                 without triggering transmissions that could congest the
                 wireless medium. In this work, we analyze and
                 categorize existing prediction-based data reduction
                 mechanisms that have been designed for WSNs. Our main
                 contribution is a systematic procedure for selecting a
                 scheme to make predictions in WSNs, based on WSNs'
                 constraints, characteristics of prediction methods, and
                 monitored data. Finally, we conclude the article with a
                 discussion about future challenges and open research
                 directions in the use of prediction methods to support
                 the WSNs' growth.",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gardiner:2016:SML,
  author =       "Joseph Gardiner and Shishir Nagaraja",
  title =        "On the Security of Machine Learning in Malware {C\&C}
                 Detection: a Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "3",
  pages =        "59:1--59:??",
  month =        dec,
  year =         "2016",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3003816",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:25:05 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "One of the main challenges in security today is
                 defending against malware attacks. As trends and
                 anecdotal evidence show, preventing these attacks,
                 regardless of their indiscriminate or targeted nature,
                 has proven difficult: intrusions happen and devices get
                 compromised, even at security-conscious organizations.
                 As a consequence, an alternative line of work has
                 focused on detecting and disrupting the individual
                 steps that follow an initial compromise and are
                 essential for the successful progression of the attack.
                 In particular, several approaches and techniques have
                 been proposed to identify the command and control (C8C)
                 channel that a compromised system establishes to
                 communicate with its controller. A major oversight of
                 many of these detection techniques is the design's
                 resilience to evasion attempts by the well-motivated
                 attacker. C8C detection techniques make widespread use
                 of a machine learning (ML) component. Therefore, to
                 analyze the evasion resilience of these detection
                 techniques, we first systematize works in the field of
                 C8C detection and then, using existing models from the
                 literature, go on to systematize attacks against the ML
                 components used in these approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bailly:2017:VMT,
  author =       "Gilles Bailly and Eric Lecolinet and Laurence Nigay",
  title =        "Visual Menu Techniques",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "60:1--60:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3002171",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Menus are used for exploring and selecting commands in
                 interactive applications. They are widespread in
                 current systems and used by a large variety of users.
                 As a consequence, they have motivated many studies in
                 Human-Computer Interaction (HCI). Facing the large
                 variety of menus, it is difficult to have a clear
                 understanding of the design possibilities and to
                 ascertain their similarities and differences. In this
                 article, we address a main challenge of menu design:
                 the need to characterize the design space of menus. To
                 do this, we propose a taxonomy of menu properties that
                 structures existing work on visual menus. As properties
                 have an impact on the performance of the menu, we start
                 by refining performance through a list of quality
                 criteria and by reviewing existing analytical and
                 empirical methods for quality evaluation. This taxonomy
                 of menu properties is a step toward the elaboration of
                 advanced predictive models of menu performance and the
                 optimization of menus. A key point of this work is to
                 focus both on menus and on the properties of menus, and
                 then enable a fine-grained analysis in terms of
                 performance.",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kiljan:2017:SAC,
  author =       "Sven Kiljan and Koen Simoens and Danny {De Cock} and
                 Marko {Van Eekelen} and Harald Vranken",
  title =        "A Survey of Authentication and Communications Security
                 in Online Banking",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "61:1--61:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3002170",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "A survey was conducted to provide a state of the art
                 of online banking authentication and communications
                 security implementations. Between global regions the
                 applied (single or multifactor) authentication schemes
                 differ greatly, as well as the security of SSL/TLS
                 implementations. Three phases for online banking
                 development are identified. It is predicted that mobile
                 banking will enter a third phase, characterized by the
                 use of standard web technologies to develop mobile
                 banking applications for different platforms. This has
                 the potential to make mobile banking a target for
                 attacks in a similar manner that home banking currently
                 is.",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pendleton:2017:SSS,
  author =       "Marcus Pendleton and Richard Garcia-Lebron and Jin-Hee
                 Cho and Shouhuai Xu",
  title =        "A Survey on Systems Security Metrics",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "62:1--62:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3005714",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "Security metrics have received significant attention.
                 However, they have not been systematically explored
                 based on the understanding of attack-defense
                 interactions, which are affected by various factors,
                 including the degree of system vulnerabilities, the
                 power of system defense mechanisms, attack (or threat)
                 severity, and situations a system at risk faces. This
                 survey particularly focuses on how a system security
                 state can evolve as an outcome of cyber attack-defense
                 interactions. This survey concerns how to measure
                 system-level security by proposing a security metrics
                 framework based on the following four sub-metrics: (1)
                 metrics of system vulnerabilities, (2) metrics of
                 defense power, (3) metrics of attack or threat
                 severity, and (4) metrics of situations. To investigate
                 the relationships among these four sub-metrics, we
                 propose a hierarchical ontology with four
                 sub-ontologies corresponding to the four sub-metrics
                 and discuss how they are related to each other. Using
                 the four sub-metrics, we discuss the state-of-art
                 existing security metrics and their advantages and
                 disadvantages (or limitations) to obtain lessons and
                 insight in order to achieve an ideal goal in developing
                 security metrics. Finally, we discuss open research
                 questions in the security metrics research domain and
                 we suggest key factors to enhance security metrics from
                 a system security perspective.",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Georgievski:2017:APU,
  author =       "Ilche Georgievski and Marco Aiello",
  title =        "Automated Planning for Ubiquitous Computing",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "63:1--63:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3004294",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The goal of ubiquitous computing is to create ambience
                 in which one's experiences and quality of life are
                 improved by monitoring and assisting people using
                 ubiquitous technologies and computation in coherence.
                 The continuous advancements of involved technologies,
                 such as wireless communications, mobile devices, and
                 sensors, imply fast evolution of ubiquitous computing
                 environments too. The complexity of these environments
                 is reaching a point where traditional solutions simply
                 no longer work. The environments are in need of
                 computational techniques that can deal with the
                 evolution and uncertainty of ubiquitous computing
                 environments dynamically and automatically. Artificial
                 Intelligence (AI) can contribute towards satisfying
                 this future scenario in many ways, while numerous
                 approaches inspired by work in the AI planning
                 community have already been designed for ubiquitous
                 computing. We devote this study to investigate the
                 current progress of AI planning for ubiquitous
                 computing by analysing those approaches. We rigorously
                 search for and select relevant literature out of which
                 we extract qualitative information. Using the extracted
                 qualities, we derive a generic framework that consists
                 of aspects important to planning for ubiquitous
                 computing. The framework's main purpose is to
                 facilitate the understanding of those aspects, and
                 classify the literature according to them. We then
                 analyse the literature in a consolidated way, and
                 identify future challenges of planning for ubiquitous
                 computing.",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Diener:2017:ABT,
  author =       "Matthias Diener and Eduardo H. M. Cruz and Marco A. Z.
                 Alves and Philippe O. A. Navaux and Israel Koren",
  title =        "Affinity-Based Thread and Data Mapping in Shared
                 Memory Systems",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "64:1--64:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3006385",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Shared memory architectures have recently experienced
                 a large increase in thread-level parallelism, leading
                 to complex memory hierarchies with multiple cache
                 memory levels and memory controllers. These new designs
                 created a Non-Uniform Memory Access (NUMA) behavior,
                 where the performance and energy consumption of memory
                 accesses depend on the place where the data is located
                 in the memory hierarchy. Accesses to local caches or
                 memory controllers are generally more efficient than
                 accesses to remote ones. A common way to improve the
                 locality and balance of memory accesses is to determine
                 the mapping of threads to cores and data to memory
                 controllers based on the affinity between threads and
                 data. Such mapping techniques can operate at different
                 hardware and software levels, which impacts their
                 complexity, applicability, and the resulting
                 performance and energy consumption gains. In this
                 article, we introduce a taxonomy to classify different
                 mapping mechanisms and provide a comprehensive overview
                 of existing solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Servos:2017:CRO,
  author =       "Daniel Servos and Sylvia L. Osborn",
  title =        "Current Research and Open Problems in Attribute-Based
                 Access Control",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "65:1--65:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3007204",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Attribute-based access control (ABAC) is a promising
                 alternative to traditional models of access control
                 (i.e., discretionary access control (DAC), mandatory
                 access control (MAC), and role-based access control
                 (RBAC)) that is drawing attention in both recent
                 academic literature and industry application. However,
                 formalization of a foundational model of ABAC and large
                 scale adoption is still in its infancy. The relatively
                 recent emergence of ABAC still leaves a number of
                 problems unexplored. Issues like delegation,
                 administration, auditability, scalability, hierarchical
                 representations, and the like, have been largely
                 ignored or left to future work. This article provides a
                 basic introduction to ABAC and a comprehensive review
                 of recent research efforts toward developing formal
                 models of ABAC. A taxonomy of ABAC research is
                 presented and used to categorize and evaluate surveyed
                 articles. Open problems are identified based on the
                 shortcomings of the reviewed works and potential
                 solutions discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Liew:2017:SWM,
  author =       "Chee Sun Liew and Malcolm P. Atkinson and Michelle
                 Galea and Tan Fong Ang and Paul Martin and Jano I. {Van
                 Hemert}",
  title =        "Scientific Workflows: Moving Across Paradigms",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "66:1--66:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3012429",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Modern scientific collaborations have opened up the
                 opportunity to solve complex problems that require both
                 multidisciplinary expertise and large-scale
                 computational experiments. These experiments typically
                 consist of a sequence of processing steps that need to
                 be executed on selected computing platforms. Execution
                 poses a challenge, however, due to (1) the complexity
                 and diversity of applications, (2) the diversity of
                 analysis goals, (3) the heterogeneity of computing
                 platforms, and (4) the volume and distribution of data.
                 A common strategy to make these in silico experiments
                 more manageable is to model them as workflows and to
                 use a workflow management system to organize their
                 execution. This article looks at the overall challenge
                 posed by a new order of scientific experiments and the
                 systems they need to be run on, and examines how this
                 challenge can be addressed by workflows and workflow
                 management systems. It proposes a taxonomy of workflow
                 management system (WMS) characteristics, including
                 aspects previously overlooked. This frames a review of
                 prevalent WMSs used by the scientific community,
                 elucidates their evolution to handle the challenges
                 arising with the emergence of the ``fourth paradigm,''
                 and identifies research needed to maintain progress in
                 this area.",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Capraro:2017:ISD,
  author =       "Maximilian Capraro and Dirk Riehle",
  title =        "Inner Source Definition, Benefits, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "67:1--67:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2856821",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Inner Source (IS) is the use of open source software
                 development practices and the establishment of an open
                 source-like culture within organizations. The
                 organization may still develop proprietary software but
                 internally opens up its development. A steady stream of
                 scientific literature and practitioner reports
                 indicates the interest in this research area. However,
                 the research area lacks a systematic assessment of
                 known research work: No model exists that defines IS
                 thoroughly. Various case studies provide insights into
                 IS programs in the context of specific organizations
                 but only few publications apply a broader perspective.
                 To resolve this, we performed an extensive literature
                 survey and analyzed 43 IS related publications plus
                 additional background literature. Using qualitative
                 data analysis methods, we developed a model of the
                 elements that constitute IS. We present a
                 classification framework for IS programs and projects
                 and apply it to lay out a map of known IS endeavors.
                 Further, we present qualitative models summarizing the
                 benefits and challenges of IS adoption. The survey
                 provides the first broad review of IS literature and
                 systematic arrangement of IS research results.",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jhaveri:2017:ARF,
  author =       "Mohammad Hanif Jhaveri and Orcun Cetin and Carlos
                 Ga{\~n}{\'a}n and Tyler Moore and Michel {Van Eeten}",
  title =        "Abuse Reporting and the Fight Against Cybercrime",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "68:1--68:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3003147",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cybercriminal activity has exploded in the past
                 decade, with diverse threats ranging from phishing
                 attacks to botnets and drive-by-downloads afflicting
                 millions of computers worldwide. In response, a
                 volunteer defense has emerged, led by security
                 companies, infrastructure operators, and vigilantes.
                 This reactionary force does not concern itself with
                 making proactive upgrades to the cyber infrastructure.
                 Instead, it operates on the front lines by remediating
                 infections as they appear. We construct a model of the
                 abuse reporting infrastructure in order to explain how
                 voluntary action against cybercrime functions today, in
                 hopes of improving our understanding of what works and
                 how to make remediation more effective in the future.
                 We examine the incentives to participate among data
                 contributors, affected resource owners, and
                 intermediaries. Finally, we present a series of key
                 attributes that differ among voluntary actions to
                 investigate further through experimentation, pointing
                 toward a research agenda that could establish causality
                 between interventions and outcomes.",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Martinez:2017:SLP,
  author =       "V{\'\i}ctor Mart{\'\i}nez and Fernando Berzal and
                 Juan-Carlos Cubero",
  title =        "A Survey of Link Prediction in Complex Networks",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "69:1--69:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3012704",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Networks have become increasingly important to model
                 complex systems composed of interacting elements.
                 Network data mining has a large number of applications
                 in many disciplines including protein-protein
                 interaction networks, social networks, transportation
                 networks, and telecommunication networks. Different
                 empirical studies have shown that it is possible to
                 predict new relationships between elements attending to
                 the topology of the network and the properties of its
                 elements. The problem of predicting new relationships
                 in networks is called link prediction. Link prediction
                 aims to infer the behavior of the network link
                 formation process by predicting missed or future
                 relationships based on currently observed connections.
                 It has become an attractive area of study since it
                 allows us to predict how networks will evolve. In this
                 survey, we will review the general-purpose techniques
                 at the heart of the link prediction problem, which can
                 be complemented by domain-specific heuristic methods in
                 practice.",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chang:2017:MCB,
  author =       "Chii Chang and Satish Narayana Srirama and Rajkumar
                 Buyya",
  title =        "Mobile Cloud Business Process Management System for
                 the {Internet of Things}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "70:1--70:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3012000",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Internet of Things (IoT) represents a
                 comprehensive environment that consists of a large
                 number of smart devices interconnecting heterogeneous
                 physical objects to the Internet. Many domains such as
                 logistics, manufacturing, agriculture, urban computing,
                 home automation, ambient assisted living, and various
                 ubiquitous computing applications have utilized IoT
                 technologies. Meanwhile, Business Process Management
                 Systems (BPMSs) have become a successful and efficient
                 solution for coordinated management and optimized
                 utilization of resources/entities. However, past BPMSs
                 have not considered many issues they will face in
                 managing large-scale connected heterogeneous IoT
                 entities. Without fully understanding the behavior,
                 capability, and state of the IoT entities, the BPMS can
                 fail to manage the IoT integrated information systems.
                 In this article, we analyze existing BPMSs for IoT and
                 identify the limitations and their drawbacks based on a
                 Mobile Cloud Computing perspective. Later, we discuss a
                 number of open challenges in BPMS for IoT.",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wiriyathammabhum:2017:CVN,
  author =       "Peratham Wiriyathammabhum and Douglas Summers-Stay and
                 Cornelia Ferm{\"u}ller and Yiannis Aloimonos",
  title =        "Computer Vision and Natural Language Processing:
                 Recent Approaches in Multimedia and Robotics",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "71:1--71:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3009906",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Integrating computer vision and natural language
                 processing is a novel interdisciplinary field that has
                 received a lot of attention recently. In this survey,
                 we provide a comprehensive introduction of the
                 integration of computer vision and natural language
                 processing in multimedia and robotics applications with
                 more than 200 key references. The tasks that we survey
                 include visual attributes, image captioning, video
                 captioning, visual question answering, visual
                 retrieval, human-robot interaction, robotic actions,
                 and robot navigation. We also emphasize strategies to
                 integrate computer vision and natural language
                 processing models as a unified theme of distributional
                 semantics. We make an analog of distributional
                 semantics in computer vision and natural language
                 processing as image embedding and word embedding,
                 respectively. We also present a unified view for the
                 field and propose possible future directions.",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pavai:2017:SCO,
  author =       "G. Pavai and T. V. Geetha",
  title =        "A Survey on Crossover Operators",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "72:1--72:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3009966",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Crossover is an important operation in the Genetic
                 Algorithms (GA). Crossover operation is responsible for
                 producing offspring for the next generation so as to
                 explore a much wider area of the solution space. There
                 are many crossover operators designed to cater to
                 different needs of different optimization problems.
                 Despite the many analyses, it is still difficult to
                 decide which crossover to use when. In this article, we
                 have considered the various existing crossover
                 operators based on the application for which they were
                 designed for and the purpose that they were designed
                 for. We have classified the existing crossover
                 operators into two broad categories, namely (1)
                 Crossover operators for representation of applications
                 --- where the crossover operators designed to suit the
                 representation aspect of applications are discussed
                 along with how the crossover operators work and (2)
                 Crossover operators for improving GA performance of
                 applications --- where crossover operators designed to
                 influence the quality of the solution and speed of GA
                 are discussed. We have also come up with some
                 interesting future directions in the area of designing
                 new crossover operators as a result of our survey.",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Boukerche:2017:MIH,
  author =       "Azzedine Boukerche and Alexander Magnano and Noura
                 Aljeri",
  title =        "Mobile {IP} Handover for Vehicular Networks: Methods,
                 Models, and Classifications",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "73:1--73:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/2996451",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The popularity and development of wireless devices has
                 led to a demand for widespread high-speed Internet
                 access, including access for vehicles and other modes
                 of high-speed transportation. The current widely
                 deployed method for providing Internet Protocol (IP)
                 services to mobile devices is the mobile IP. This
                 includes a handover process for a mobile device to
                 maintain its IP session while it switches between
                 points of access. However, the mobile IP handover
                 causes performance degradation due to its disruptive
                 latency and high packet drop rate. This is largely
                 problematic for vehicles, as they will be forced to
                 transition between access points more frequently due to
                 their higher speeds and frequent topological changes in
                 vehicular networks. In this article, we discuss the
                 different mobile IP handover solutions found within
                 related literature and their potential for resolving
                 issues pertinent to vehicular networks. First, we
                 provide an overview of the mobile IP handover and its
                 problematic components. This is followed by
                 categorization and comparison between different mobile
                 IP handover solutions, with an analysis of their
                 benefits and drawbacks.",
  acknowledgement = ack-nhfb,
  articleno =    "73",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shin:2017:SSD,
  author =       "Youngjoo Shin and Dongyoung Koo and Junbeom Hur",
  title =        "A Survey of Secure Data Deduplication Schemes for
                 Cloud Storage Systems",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "74:1--74:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3017428",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "Data deduplication has attracted many cloud service
                 providers (CSPs) as a way to reduce storage costs. Even
                 though the general deduplication approach has been
                 increasingly accepted, it comes with many security and
                 privacy problems due to the outsourced data delivery
                 models of cloud storage. To deal with specific security
                 and privacy issues, secure deduplication techniques
                 have been proposed for cloud data, leading to a diverse
                 range of solutions and trade-offs. Hence, in this
                 article, we discuss ongoing research on secure
                 deduplication for cloud data in consideration of the
                 attack scenarios exploited most widely in cloud
                 storage. On the basis of classification of
                 deduplication system, we explore security risks and
                 attack scenarios from both inside and outside
                 adversaries. We then describe state-of-the-art secure
                 deduplication techniques for each approach that deal
                 with different security issues under specific or
                 combined threat models, which include both
                 cryptographic and protocol solutions. We discuss and
                 compare each scheme in terms of security and efficiency
                 specific to different security goals. Finally, we
                 identify and discuss unresolved issues and further
                 research challenges for secure deduplication in cloud
                 storage.",
  acknowledgement = ack-nhfb,
  articleno =    "74",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Aburaed:2017:AQT,
  author =       "Nour Abura'ed and Faisal Shah Khan and Harish
                 Bhaskar",
  title =        "Advances in the Quantum Theoretical Approach to Image
                 Processing Applications",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "75:1--75:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3009965",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In this article, a detailed survey of the quantum
                 approach to image processing is presented. Recently, it
                 has been established that existing quantum algorithms
                 are applicable to image processing tasks allowing
                 quantum informational models of classical image
                 processing. However, efforts continue in identifying
                 the diversity of its applicability in various image
                 processing domains. Here, in addition to reviewing some
                 of the critical image processing applications that
                 quantum mechanics have targeted, such as denoising,
                 edge detection, image storage, retrieval, and
                 compression, this study will also highlight the
                 complexities in transitioning from the classical to the
                 quantum domain. This article shall establish
                 theoretical fundamentals, analyze performance and
                 evaluation, draw key statistical evidence to support
                 claims, and provide recommendations based on published
                 literature mostly during the period from 2010 to
                 2015.",
  acknowledgement = ack-nhfb,
  articleno =    "75",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tam:2017:EAM,
  author =       "Kimberly Tam and Ali Feizollah and Nor Badrul Anuar
                 and Rosli Salleh and Lorenzo Cavallaro",
  title =        "The Evolution of {Android} Malware and {Android}
                 Analysis Techniques",
  journal =      j-COMP-SURV,
  volume =       "49",
  number =       "4",
  pages =        "76:1--76:??",
  month =        feb,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3017427",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Feb 9 09:18:20 MST 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "With the integration of mobile devices into daily
                 life, smartphones are privy to increasing amounts of
                 sensitive information. Sophisticated mobile malware,
                 particularly Android malware, acquire or utilize such
                 data without user consent. It is therefore essential to
                 devise effective techniques to analyze and detect these
                 threats. This article presents a comprehensive survey
                 on leading Android malware analysis and detection
                 techniques, and their effectiveness against evolving
                 malware. This article categorizes systems by
                 methodology and date to evaluate progression and
                 weaknesses. This article also discusses evaluations of
                 industry solutions, malware statistics, and malware
                 evasion techniques and concludes by supporting future
                 research paths.",
  acknowledgement = ack-nhfb,
  articleno =    "76",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:2017:DDTa,
  author =       "Tao Li and Ning Xie and Chunqiu Zeng and Wubai Zhou
                 and Li Zheng and Yexi Jiang and Yimin Yang and Hsin-Yu
                 Ha and Wei Xue and Yue Huang and Shu-Ching Chen and
                 Jainendra Navlakha and S. S. Iyengar",
  title =        "Data-Driven Techniques in Disaster Information
                 Management",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "1:1--1:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3017678",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Improving disaster management and recovery techniques
                 is one of national priorities given the huge toll
                 caused by man-made and nature calamities. Data-driven
                 disaster management aims at applying advanced data
                 collection and analysis technologies to achieve more
                 effective and responsive disaster management, and has
                 undergone considerable progress in the last decade.
                 However, to the best of our knowledge, there is
                 currently no work that both summarizes recent progress
                 and suggests future directions for this emerging
                 research area. To remedy this situation, we provide a
                 systematic treatment of the recent developments in
                 data-driven disaster management. Specifically, we first
                 present a general overview of the requirements and
                 system architectures of disaster management systems and
                 then summarize state-of-the-art data-driven techniques
                 that have been applied on improving situation awareness
                 as well as in addressing users' information needs in
                 disaster management. We also discuss and categorize
                 general data-mining and machine-learning techniques in
                 disaster management. Finally, we recommend several
                 research directions for further investigations.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{LaRosa:2017:BPV,
  author =       "Marcello {La Rosa} and Wil M. P. {Van Der Aalst} and
                 Marlon Dumas and Fredrik P. Milani",
  title =        "Business Process Variability Modeling: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "2:1--2:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3041957",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "It is common for organizations to maintain multiple
                 variants of a given business process, such as multiple
                 sales processes for different products or multiple
                 bookkeeping processes for different countries.
                 Conventional business process modeling languages do not
                 explicitly support the representation of such families
                 of process variants. This gap triggered significant
                 research efforts over the past decade, leading to an
                 array of approaches to business process variability
                 modeling. In general, each of these approaches extends
                 a conventional process modeling language with
                 constructs to capture customizable process models. A
                 customizable process model represents a family of
                 process variants in a way that a model of each variant
                 can be derived by adding or deleting fragments
                 according to customization options or according to a
                 domain model. This survey draws up a systematic
                 inventory of approaches to customizable process
                 modeling and provides a comparative evaluation with the
                 aim of identifying common and differentiating modeling
                 features, providing criteria for selecting among
                 multiple approaches, and identifying gaps in the state
                 of the art. The survey puts into evidence an abundance
                 of customizable process-modeling languages, which
                 contrasts with a relative scarcity of available tool
                 support and empirical comparative evaluations.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Salayma:2017:WBA,
  author =       "Marwa Salayma and Ahmed Al-Dubai and Imed Romdhani and
                 Youssef Nasser",
  title =        "Wireless Body Area Network {(WBAN)}: a Survey on
                 Reliability, Fault Tolerance, and Technologies
                 Coexistence",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "3:1--3:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3041956",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Wireless Body Area Network (WBAN) has been a key
                 element in e-health to monitor bodies. This technology
                 enables new applications under the umbrella of
                 different domains, including the medical field, the
                 entertainment and ambient intelligence areas. This
                 survey paper places substantial emphasis on the concept
                 and key features of the WBAN technology. First, the
                 WBAN concept is introduced and a review of key
                 applications facilitated by this networking technology
                 is provided. The study then explores a wide variety of
                 communication standards and methods deployed in this
                 technology. Due to the sensitivity and criticality of
                 the data carried and handled by WBAN, fault tolerance
                 is a critical issue and widely discussed in this paper.
                 Hence, this survey investigates thoroughly the
                 reliability and fault tolerance paradigms suggested for
                 WBANs. Open research and challenging issues pertaining
                 to fault tolerance, coexistence and interference
                 management and power consumption are also discussed
                 along with some suggested trends in these aspects.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nath:2017:EKG,
  author =       "Sayantan Nath and Sonali Agarwal and G. N. Pandey",
  title =        "Evaluation of Knowledge Gaps in Mathematical
                 Applications of Thermal Image Processing Techniques for
                 Fire Prevention",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "4:1--4:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3009967",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In this article, we present literature reviews on fire
                 prevention methods, especially in mining industries,
                 using thermal image processing techniques. Fire
                 protection systems are crucial because of the increased
                 loss of human lives due to coal fires and fatal
                 explosions in coal mines across the world in the past
                 few decades. And with the growth in the demand for
                 energy and the mining of coal expected up to the year
                 2050, determining conditions leading up to a breakout
                 of fire is paramount. To detect uncertain fire breakout
                 conditions, thermal imaging is considered the most
                 significant among several early warning methods to
                 recognize spontaneous combustion of coal piles (e.g.,
                 temperature recordings by sensors, compaction testing
                 of ore seam, gas tests). The evolution of thermographic
                 imaging applied in various industrial sectors (e.g.,
                 coal furnaces, oil tankers, building inspections,
                 security) with numerous applications of mathematical
                 models will be presented in the light of safety
                 dimensions in the mining industry. The missing links or
                 unattended areas of mathematics in the application of
                 thermal image processing in mining, especially in the
                 coal industry, will be evolved as the gap in knowledge
                 suggested in our concluding statements.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Su:2017:SDF,
  author =       "Ting Su and Ke Wu and Weikai Miao and Geguang Pu and
                 Jifeng He and Yuting Chen and Zhendong Su",
  title =        "A Survey on Data-Flow Testing",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "5:1--5:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3020266",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Data-flow testing (DFT) is a family of testing
                 strategies designed to verify the interactions between
                 each program variable's definition and its uses. Such a
                 test objective of interest is referred to as a def-use
                 pair. DFT selects test data with respect to various
                 test adequacy criteria (i.e., data-flow coverage
                 criteria ) to exercise each pair. The original
                 conception of DFT was introduced by Herman in 1976.
                 Since then, a number of studies have been conducted,
                 both theoretically and empirically, to analyze DFT's
                 complexity and effectiveness. In the past four decades,
                 DFT has been continuously concerned, and various
                 approaches from different aspects are proposed to
                 pursue automatic and efficient data-flow testing. This
                 survey presents a detailed overview of data-flow
                 testing, including challenges and approaches in
                 enforcing and automating it: (1) it introduces the
                 data-flow analysis techniques that are used to identify
                 def-use pairs; (2) it classifies and discusses
                 techniques for data-flow-based test data generation,
                 such as search-based testing, random testing,
                 collateral-coverage-based testing,
                 symbolic-execution-based testing, and
                 model-checking-based testing; (3) it discusses
                 techniques for tracking data-flow coverage; (4) it
                 presents several DFT applications, including software
                 fault localization, web security testing, and
                 specification consistency checking; and (5) it
                 summarizes recent advances and discusses future
                 research directions toward more practical data-flow
                 testing.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Biswas:2017:STC,
  author =       "Arnab Kumar Biswas and Dipak Ghosal and Shishir
                 Nagaraja",
  title =        "A Survey of Timing Channels and Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "6:1--6:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3023872",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "A timing channel is a communication channel that can
                 transfer information to a receiver/decoder by
                 modulating the timing behavior of an entity. Examples
                 of this entity include the interpacket delays of a
                 packet stream, the reordering packets in a packet
                 stream, or the resource access time of a cryptographic
                 module. Advances in the information and coding theory
                 and the availability of high-performance computing
                 systems interconnected by high-speed networks have
                 spurred interest in and development of various types of
                 timing channels. With the emergence of complex timing
                 channels, novel detection and prevention techniques are
                 also being developed to counter them. In this article,
                 we provide a detailed survey of timing channels broadly
                 categorized into network timing channel, in which
                 communicating entities are connected by a network, and
                 in-system timing channel, in which the communicating
                 entities are within a computing system. This survey
                 builds on the last comprehensive survey by Zander et
                 al. [2007] and considers all three canonical
                 applications of timing channels, namely, covert
                 communication, timing side channel, and network flow
                 watermarking. We survey the theoretical foundations,
                 the implementation, and the various detection and
                 prevention techniques that have been reported in
                 literature. Based on the analysis of the current
                 literature, we discuss potential future research
                 directions both in the design and application of timing
                 channels and their detection and prevention
                 techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dylla:2017:SQS,
  author =       "Frank Dylla and Jae Hee Lee and Till Mossakowski and
                 Thomas Schneider and Andr{\'e} {Van Delden} and Jasper
                 {Van De Ven} and Diedrich Wolter",
  title =        "A Survey of Qualitative Spatial and Temporal Calculi:
                 Algebraic and Computational Properties",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "7:1--7:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3038927",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Qualitative spatial and temporal reasoning (QSTR) is
                 concerned with symbolic knowledge representation,
                 typically over infinite domains. The motivations for
                 employing QSTR techniques include exploiting
                 computational properties that allow efficient reasoning
                 to capture human cognitive concepts in a computational
                 framework. The notion of a qualitative calculus is one
                 of the most prominent QSTR formalisms. This article
                 presents the first overview of all qualitative calculi
                 developed to date and their computational properties,
                 together with generalized definitions of the
                 fundamental concepts and methods that now encompass all
                 existing calculi. Moreover, we provide a classification
                 of calculi according to their algebraic properties.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ramachandra:2017:PAD,
  author =       "Raghavendra Ramachandra and Christoph Busch",
  title =        "Presentation Attack Detection Methods for Face
                 Recognition Systems: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "8:1--8:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3038924",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The vulnerability of face recognition systems to
                 presentation attacks (also known as direct attacks or
                 spoof attacks) has received a great deal of interest
                 from the biometric community. The rapid evolution of
                 face recognition systems into real-time applications
                 has raised new concerns about their ability to resist
                 presentation attacks, particularly in unattended
                 application scenarios such as automated border control.
                 The goal of a presentation attack is to subvert the
                 face recognition system by presenting a facial
                 biometric artifact. Popular face biometric artifacts
                 include a printed photo, the electronic display of a
                 facial photo, replaying video using an electronic
                 display, and 3D face masks. These have demonstrated a
                 high security risk for state-of-the-art face
                 recognition systems. However, several presentation
                 attack detection (PAD) algorithms (also known as
                 countermeasures or antispoofing methods) have been
                 proposed that can automatically detect and mitigate
                 such targeted attacks. The goal of this survey is to
                 present a systematic overview of the existing work on
                 face presentation attack detection that has been
                 carried out. This paper describes the various aspects
                 of face presentation attacks, including different types
                 of face artifacts, state-of-the-art PAD algorithms and
                 an overview of the respective research labs working in
                 this domain, vulnerability assessments and performance
                 evaluation metrics, the outcomes of competitions, the
                 availability of public databases for benchmarking new
                 PAD algorithms in a reproducible manner, and finally a
                 summary of the relevant international standardization
                 in this field. Furthermore, we discuss the open
                 challenges and future work that need to be addressed in
                 this evolving field of biometrics.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Meixner:2017:HIM,
  author =       "Britta Meixner",
  title =        "Hypervideos and Interactive Multimedia Presentations",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "9:1--9:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3038925",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Hypervideos and interactive multimedia presentations
                 allow the creation of fully interactive and enriched
                 video. It is possible to organize video scenes in a
                 nonlinear way. Additional information can be added to
                 the video ranging from short descriptions to images and
                 more videos. Hypervideos are video-based but also
                 provide navigation between video scenes and additional
                 multimedia elements. Interactive multimedia
                 presentations consist of different media with a
                 temporal and spatial synchronization that can be
                 navigated via hyperlinks. Their creation and
                 description requires description formats, multimedia
                 models, and standards-as well as players. Specialized
                 authoring tools with advanced editing functions allow
                 authors to manage all media files, link and arrange
                 them to an overall presentation, and keep an overview
                 during the whole process. They considerably simplify
                 the creation process compared to writing and editing
                 description documents in simple text editors. Data
                 formats need features that describe interactivity and
                 nonlinear navigation while maintaining temporal and
                 spatial synchronization. Players should be easy to use
                 with extended feature sets keeping elements
                 synchronized. In this article, we analyzed more than
                 400 papers for relevant work in this field. From the
                 findings we discovered a set of trends and unsolved
                 problems, and propose directions for future research.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jukan:2017:SCS,
  author =       "Admela Jukan and Xavi Masip-Bruin and Nina Amla",
  title =        "Smart Computing and Sensing Technologies for Animal
                 Welfare: a Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "10:1--10:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3041960",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Animals play a profoundly important and intricate role
                 in our lives today. Dogs have been human companions for
                 thousands of years, but now they work to assist the
                 disabled, and in combat and search and rescue
                 situations. Farm animals are a critical part of
                 sustainable agriculture today, and there is increasing
                 consumer interest in humanely raised livestock, and how
                 it impacts our health and environmental footprint. Wild
                 animals are threatened with extinction by human induced
                 factors, and shrinking and compromised habitats. There
                 are many reasons, including societal and economic ones,
                 to explore how new computing technologies can be used
                 to ensure the welfare of animals in these settings. The
                 goal of this review is to systematically survey the
                 existing literature in smart computing and sensing
                 technologies for domestic, farm, and wild animal
                 welfare. We use a broad notion of animal welfare to
                 refer to an assessment of whether animals are healthy,
                 free of pain and suffering, and positively stimulated
                 in their environment. Smart computing and sensing is
                 also used in broad terms, to refer to systems that are
                 not isolated but interconnected with communication
                 networks, and capable of remote data collection,
                 processing, exchange, and analysis. The findings of
                 this review are expected to motivate future research in
                 computer science and engineering, as well as contribute
                 to data, information, and communication management for
                 animal welfare.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chi:2017:HTS,
  author =       "Lianhua Chi and Xingquan Zhu",
  title =        "Hashing Techniques: a Survey and Taxonomy",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "11:1--11:36",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3047307",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib",
  abstract =     "With the rapid development of information storage and
                 networking technologies, quintillion bytes of data are
                 generated every day from social networks, business
                 transactions, sensors, and many other domains. The
                 increasing data volumes impose significant challenges
                 to traditional data analysis tools in storing,
                 processing, and analyzing these extremely large-scale
                 data. For decades, hashing has been one of the most
                 effective tools commonly used to compress data for fast
                 access and analysis, as well as information integrity
                 verification. Hashing techniques have also evolved from
                 simple randomization approaches to advanced adaptive
                 methods considering locality, structure, label
                 information, and data security, for effective hashing.
                 This survey reviews and categorizes existing hashing
                 techniques as a taxonomy, in order to provide a
                 comprehensive view of mainstream hashing techniques for
                 different types of data and applications. The taxonomy
                 also studies the uniqueness of each method and
                 therefore can serve as technique references in
                 understanding the niche of different hashing mechanisms
                 for future development.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tsvetkova:2017:UHM,
  author =       "Milena Tsvetkova and Taha Yasseri and Eric T. Meyer
                 and J. Brian Pickering and Vegard Engen and Paul
                 Walland and Marika L{\"u}ders and Asbj{\o}rn F{\o}lstad
                 and George Bravos",
  title =        "Understanding Human-Machine Networks: a
                 Cross-Disciplinary Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "12:1--12:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3039868",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the current hyperconnected era, modern Information
                 and Communication Technology (ICT) systems form
                 sophisticated networks where not only do people
                 interact with other people, but also machines take an
                 increasingly visible and participatory role. Such
                 Human-Machine Networks (HMNs) are embedded in the daily
                 lives of people, both for personal and professional
                 use. They can have a significant impact by producing
                 synergy and innovations. The challenge in designing
                 successful HMNs is that they cannot be developed and
                 implemented in the same manner as networks of machines
                 nodes alone, or following a wholly human-centric view
                 of the network. The problem requires an
                 interdisciplinary approach. Here, we review current
                 research of relevance to HMNs across many disciplines.
                 Extending the previous theoretical concepts of
                 socio-technical systems, actor-network theory,
                 cyber-physical-social systems, and social machines, we
                 concentrate on the interactions among humans and
                 between humans and machines. We identify eight types of
                 HMNs: public-resource computing, crowdsourcing, web
                 search engines, crowdsensing, online markets, social
                 media, multiplayer online games and virtual worlds, and
                 mass collaboration. We systematically select literature
                 on each of these types and review it with a focus on
                 implications for designing HMNs. Moreover, we discuss
                 risks associated with HMNs and identify emerging design
                 and development trends.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Calzavara:2017:SWJ,
  author =       "Stefano Calzavara and Riccardo Focardi and Marco
                 Squarcina and Mauro Tempesta",
  title =        "Surviving the {Web}: a Journey into {Web} Session
                 Security",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "13:1--13:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3038923",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "In this article, we survey the most common attacks
                 against web sessions, that is, attacks that target
                 honest web browser users establishing an authenticated
                 session with a trusted web application. We then review
                 existing security solutions that prevent or mitigate
                 the different attacks by evaluating them along four
                 different axes: protection, usability, compatibility,
                 and ease of deployment. We also assess several
                 defensive solutions that aim at providing robust
                 safeguards against multiple attacks. Based on this
                 survey, we identify five guidelines that, to different
                 extents, have been taken into account by the designers
                 of the different proposals we reviewed. We believe that
                 these guidelines can be helpful for the development of
                 innovative solutions approaching web security in a more
                 systematic and comprehensive way.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bashroush:2017:CTS,
  author =       "Rabih Bashroush and Muhammad Garba and Rick Rabiser
                 and Iris Groher and Goetz Botterweck",
  title =        "{CASE} Tool Support for Variability Management in
                 Software Product Lines",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "14:1--14:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3034827",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Software product lines (SPL) aim at reducing
                 time-to-market and increasing software quality through
                 extensive, planned reuse of artifacts. An essential
                 activity in SPL is variability management, i.e.,
                 defining and managing commonality and variability among
                 member products. Due to the large scale and complexity
                 of today's software-intensive systems, variability
                 management has become increasingly complex to conduct.
                 Accordingly, tool support for variability management
                 has been gathering increasing momentum over the last
                 few years and can be considered a key success factor
                 for developing and maintaining SPLs. While several
                 studies have already been conducted on variability
                 management, none of these analyzed the available tool
                 support in detail. In this work, we report on a survey
                 in which we analyzed 37 existing variability management
                 tools identified using a systematic literature review
                 to understand the tools' characteristics, maturity, and
                 the challenges in the field. We conclude that while
                 most studies on variability management tools provide a
                 good motivation and description of the research context
                 and challenges, they often lack empirical data to
                 support their claims and findings. It was also found
                 that quality attributes important for the practical use
                 of tools such as usability, integration, scalability,
                 and performance were out of scope for most studies.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Soler-Dominguez:2017:SFA,
  author =       "Amparo Soler-Dominguez and Angel A. Juan and Renatas
                 Kizys",
  title =        "A Survey on Financial Applications of Metaheuristics",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "15:1--15:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3054133",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Modern heuristics or metaheuristics are optimization
                 algorithms that have been increasingly used during the
                 last decades to support complex decision-making in a
                 number of fields, such as logistics and transportation,
                 telecommunication networks, bioinformatics, finance,
                 and the like. The continuous increase in computing
                 power, together with advancements in metaheuristics
                 frameworks and parallelization strategies, are
                 empowering these types of algorithms as one of the best
                 alternatives to solve rich and real-life combinatorial
                 optimization problems that arise in a number of
                 financial and banking activities. This article reviews
                 some of the works related to the use of metaheuristics
                 in solving both classical and emergent problems in the
                 finance arena. A non-exhaustive list of examples
                 includes rich portfolio optimization, index tracking,
                 enhanced indexation, credit risk, stock investments,
                 financial project scheduling, option pricing, feature
                 selection, bankruptcy and financial distress
                 prediction, and credit risk assessment. This article
                 also discusses some open opportunities for researchers
                 in the field, and forecast the evolution of
                 metaheuristics to include real-life uncertainty
                 conditions into the optimization problems being
                 considered.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Burow:2017:CFI,
  author =       "Nathan Burow and Scott A. Carr and Joseph Nash and Per
                 Larsen and Michael Franz and Stefan Brunthaler and
                 Mathias Payer",
  title =        "Control-Flow Integrity: Precision, Security, and
                 Performance",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "1",
  pages =        "16:1--16:??",
  month =        apr,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3054924",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:19 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Memory corruption errors in C/C++ programs remain the
                 most common source of security vulnerabilities in
                 today's systems. Control-flow hijacking attacks exploit
                 memory corruption vulnerabilities to divert program
                 execution away from the intended control flow.
                 Researchers have spent more than a decade studying and
                 refining defenses based on Control-Flow Integrity
                 (CFI); this technique is now integrated into several
                 production compilers. However, so far, no study has
                 systematically compared the various proposed CFI
                 mechanisms nor is there any protocol on how to compare
                 such mechanisms. We compare a broad range of CFI
                 mechanisms using a unified nomenclature based on (i) a
                 qualitative discussion of the conceptual security
                 guarantees, (ii) a quantitative security evaluation,
                 and (iii) an empirical evaluation of their performance
                 in the same test environment. For each mechanism, we
                 evaluate (i) protected types of control-flow transfers
                 and (ii) precision of the protection for forward and
                 backward edges. For open-source, compiler-based
                 implementations, we also evaluate (iii) generated
                 equivalence classes and target sets and (iv) runtime
                 performance.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{ulMuram:2017:SRS,
  author =       "Faiz ul Muram and Huy Tran and Uwe Zdun",
  title =        "Systematic Review of Software Behavioral Model
                 Consistency Checking",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "17:1--17:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3037755",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In software development, models are often used to
                 represent multiple views of the same system. Such
                 models need to be properly related to each other in
                 order to provide a consistent description of the
                 developed system. Models may contain contradictory
                 system specifications, for instance, when they evolve
                 independently. Therefore, it is very crucial to ensure
                 that models conform to each other. In this context, we
                 focus on consistency checking of behavior models.
                 Several techniques and approaches have been proposed in
                 the existing literature to support behavioral model
                 consistency checking. This article presents a
                 Systematic Literature Review (SLR) that was carried out
                 to obtain an overview of the various consistency
                 concepts, problems, and solutions proposed regarding
                 behavior models. In our study, the identification and
                 selection of the primary studies was based on a
                 well-planned search strategy. The search process
                 identified a total of 1770 studies, out of which 96
                 have been thoroughly analyzed according to our
                 predefined SLR protocol. The SLR aims to highlight the
                 state-of-the-art of software behavior model consistency
                 checking and identify potential gaps for future
                 research. Based on research topics in selected studies,
                 we have identified seven main categories: targeted
                 software models, types of consistency checking,
                 consistency checking techniques, inconsistency
                 handling, type of study and evaluation, automation
                 support, and practical impact. The findings of the
                 systematic review also reveal suggestions for future
                 research, such as improving the quality of study design
                 and conducting evaluations, and application of research
                 outcomes in industrial settings. For this purpose,
                 appropriate strategy for inconsistency handling, better
                 tool support for consistency checking and/or
                 development tool integration should be considered in
                 future studies.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Soetens:2017:CFC,
  author =       "Quinten David Soetens and Romain Robbes and Serge
                 Demeyer",
  title =        "Changes as First-Class Citizens: a Research
                 Perspective on Modern Software Tooling",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "18:1--18:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3038926",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Software must evolve to keep up with an ever-changing
                 context, the real world. We discuss an emergent trend
                 in software evolution research revolving around the
                 central notion that drives evolution: Change. By
                 reifying change, and by modelling it as a first-class
                 entity, researchers can now analyse the complex
                 phenomenon known as software evolution with an
                 unprecedented degree of accuracy. We present a
                 Systematic Mapping Study of 86 articles to give an
                 overview on the state of the art in this area of
                 research and present a roadmap with open issues and
                 future directions.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Boyar:2017:OAA,
  author =       "Joan Boyar and Lene M. Favrholdt and Christian Kudahl
                 and Kim S. Larsen and Jesper W. Mikkelsen",
  title =        "Online Algorithms with Advice: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "19:1--19:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3056461",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In online scenarios requests arrive over time, and
                 each request must be serviced in an irrevocable manner
                 before the next request arrives. Online algorithms with
                 advice is an area of research where one attempts to
                 measure how much knowledge of future requests is
                 necessary to achieve a given performance level, as
                 defined by the competitive ratio. When this knowledge,
                 the advice, is obtainable, this leads to practical
                 algorithms, called semi-online algorithms. On the other
                 hand, each negative result gives robust results about
                 the limitations of a broad range of semi-online
                 algorithms. This survey explains the models for online
                 algorithms with advice, motivates the study in general,
                 presents some examples of the work that has been
                 carried out, and includes an extensive set of
                 references, organized by problem studied.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ioannidou:2017:DLA,
  author =       "Anastasia Ioannidou and Elisavet Chatzilari and Spiros
                 Nikolopoulos and Ioannis Kompatsiaris",
  title =        "Deep Learning Advances in Computer Vision with {$3$D}
                 Data: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "20:1--20:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3042064",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Deep learning has recently gained popularity achieving
                 state-of-the-art performance in tasks involving text,
                 sound, or image processing. Due to its outstanding
                 performance, there have been efforts to apply it in
                 more challenging scenarios, for example, 3D data
                 processing. This article surveys methods applying deep
                 learning on 3D data and provides a classification based
                 on how they exploit them. From the results of the
                 examined works, we conclude that systems employing 2D
                 views of 3D data typically surpass voxel-based (3D)
                 deep models, which however, can perform better with
                 more layers and severe data augmentation. Therefore,
                 larger-scale datasets and increased resolutions are
                 required.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hussein:2017:ILS,
  author =       "Ahmed Hussein and Mohamed Medhat Gaber and Eyad Elyan
                 and Chrisina Jayne",
  title =        "Imitation Learning: a Survey of Learning Methods",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "21:1--21:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3054912",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Imitation learning techniques aim to mimic human
                 behavior in a given task. An agent (a learning machine)
                 is trained to perform a task from demonstrations by
                 learning a mapping between observations and actions.
                 The idea of teaching by imitation has been around for
                 many years; however, the field is gaining attention
                 recently due to advances in computing and sensing as
                 well as rising demand for intelligent applications. The
                 paradigm of learning by imitation is gaining popularity
                 because it facilitates teaching complex tasks with
                 minimal expert knowledge of the tasks. Generic
                 imitation learning methods could potentially reduce the
                 problem of teaching a task to that of providing
                 demonstrations, without the need for explicit
                 programming or designing reward functions specific to
                 the task. Modern sensors are able to collect and
                 transmit high volumes of data rapidly, and processors
                 with high computational power allow fast processing
                 that maps the sensory data to actions in a timely
                 manner. This opens the door for many potential AI
                 applications that require real-time perception and
                 reaction such as humanoid robots, self-driving
                 vehicles, human computer interaction, and computer
                 games, to name a few. However, specialized algorithms
                 are needed to effectively and robustly learn models as
                 learning by imitation poses its own set of challenges.
                 In this article, we survey imitation learning methods
                 and present design options in different steps of the
                 learning process. We introduce a background and
                 motivation for the field as well as highlight
                 challenges specific to the imitation problem. Methods
                 for designing and evaluating imitation learning tasks
                 are categorized and reviewed. Special attention is
                 given to learning methods in robotics and games as
                 these domains are the most popular in the literature
                 and provide a wide array of problems and methodologies.
                 We extensively discuss combining imitation learning
                 approaches using different sources and methods, as well
                 as incorporating other motion learning methods to
                 enhance imitation. We also discuss the potential impact
                 on industry, present major applications, and highlight
                 current and future research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gudmundsson:2017:STA,
  author =       "Joachim Gudmundsson and Michael Horton",
  title =        "Spatio-Temporal Analysis of Team Sports",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "22:1--22:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3054132",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Team-based invasion sports such as football,
                 basketball, and hockey are similar in the sense that
                 the players are able to move freely around the playing
                 area and that player and team performance cannot be
                 fully analysed without considering the movements and
                 interactions of all players as a group.
                 State-of-the-art object tracking systems now produce
                 spatio-temporal traces of player trajectories with high
                 definition and high frequency, and this, in turn, has
                 facilitated a variety of research efforts, across many
                 disciplines, to extract insight from the trajectories.
                 We survey recent research efforts that use
                 spatio-temporal data from team sports as input and
                 involve non-trivial computation. This article
                 categorises the research efforts in a coherent
                 framework and identifies a number of open research
                 questions.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gomes:2017:SEL,
  author =       "Heitor Murilo Gomes and Jean Paul Barddal and
                 Fabr{\'\i}cio Enembreck and Albert Bifet",
  title =        "A Survey on Ensemble Learning for Data Stream
                 Classification",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "23:1--23:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3054925",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Ensemble-based methods are among the most widely used
                 techniques for data stream classification. Their
                 popularity is attributable to their good performance in
                 comparison to strong single learners while being
                 relatively easy to deploy in real-world applications.
                 Ensemble algorithms are especially useful for data
                 stream learning as they can be integrated with drift
                 detection algorithms and incorporate dynamic updates,
                 such as selective removal or addition of classifiers.
                 This work proposes a taxonomy for data stream ensemble
                 learning as derived from reviewing over 60 algorithms.
                 Important aspects such as combination, diversity, and
                 dynamic updates, are thoroughly discussed. Additional
                 contributions include a listing of popular open-source
                 tools and a discussion about current data stream
                 research challenges and how they relate to ensemble
                 learning (big data streams, concept evolution, feature
                 drifts, temporal dependencies, and others).",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Singh:2017:SCS,
  author =       "Amit Kumar Singh and Piotr Dziurzanski and Hashan
                 Roshantha Mendis and Leandro Soares Indrusiak",
  title =        "A Survey and Comparative Study of Hard and Soft
                 Real-Time Dynamic Resource Allocation Strategies for
                 {Multi-\slash} Many-Core Systems",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "24:1--24:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3057267",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Multi-/many-core systems are envisioned to satisfy the
                 ever-increasing performance requirements of complex
                 applications in various domains such as embedded and
                 high-performance computing. Such systems need to cater
                 to increasingly dynamic workloads, requiring efficient
                 dynamic resource allocation strategies to satisfy hard
                 or soft real-time constraints. This article provides an
                 extensive survey of hard and soft real-time dynamic
                 resource allocation strategies proposed since the
                 mid-1990s and highlights the emerging trends for
                 multi-/many-core systems. The survey covers a taxonomy
                 of the resource allocation strategies and considers
                 their various optimization objectives, which have been
                 used to provide comprehensive comparison. The
                 strategies employ various principles, such as market
                 and biological concepts, to perform the optimizations.
                 The trend followed by the resource allocation
                 strategies, open research challenges, and likely
                 emerging research directions have also been provided.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yadollahi:2017:CST,
  author =       "Ali Yadollahi and Ameneh Gholipour Shahraki and Osmar
                 R. Zaiane",
  title =        "Current State of Text Sentiment Analysis from Opinion
                 to Emotion Mining",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "25:1--25:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3057270",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Sentiment analysis from text consists of extracting
                 information about opinions, sentiments, and even
                 emotions conveyed by writers towards topics of
                 interest. It is often equated to opinion mining, but it
                 should also encompass emotion mining. Opinion mining
                 involves the use of natural language processing and
                 machine learning to determine the attitude of a writer
                 towards a subject. Emotion mining is also using similar
                 technologies but is concerned with detecting and
                 classifying writers emotions toward events or topics.
                 Textual emotion-mining methods have various
                 applications, including gaining information about
                 customer satisfaction, helping in selecting teaching
                 materials in e-learning, recommending products based on
                 users emotions, and even predicting mental-health
                 disorders. In surveys on sentiment analysis, which are
                 often old or incomplete, the strong link between
                 opinion mining and emotion mining is understated. This
                 motivates the need for a different and new perspective
                 on the literature on sentiment analysis, with a focus
                 on emotion mining. We present the state-of-the-art
                 methods and propose the following contributions: (1) a
                 taxonomy of sentiment analysis; (2) a survey on
                 polarity classification methods and resources,
                 especially those related to emotion mining; (3) a
                 complete survey on emotion theories and emotion-mining
                 research; and (4) some useful resources, including
                 lexicons and datasets.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Weerasiri:2017:TSC,
  author =       "Denis Weerasiri and Moshe Chai Barukh and Boualem
                 Benatallah and Quan Z. Sheng and Rajiv Ranjan",
  title =        "A Taxonomy and Survey of Cloud Resource Orchestration
                 Techniques",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "26:1--26:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3054177",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cloud services and applications prove indispensable
                 amid today's modern utility-based computing. The cloud
                 has displayed a disruptive and growing impact on
                 everyday computing tasks. However, facilitating the
                 orchestration of cloud resources to build such cloud
                 services and applications is yet to unleash its entire
                 magnitude of power. Accordingly, it is paramount to
                 devise a unified and comprehensive analysis framework
                 to accelerate fundamental understanding of cloud
                 resource orchestration in terms of concepts, paradigms,
                 languages, models, and tools. This framework is
                 essential to empower effective research, comprehension,
                 comparison, and selection of cloud resource
                 orchestration models, languages, platforms, and tools.
                 This article provides such a comprehensive framework
                 while analyzing the relevant state of the art in cloud
                 resource orchestration from a novel and holistic
                 viewpoint.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mittal:2017:STC,
  author =       "Sparsh Mittal",
  title =        "A Survey of Techniques for Cache Partitioning in
                 Multicore Processors",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "27:1--27:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3062394",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "As the number of on-chip cores and memory demands of
                 applications increase, judicious management of cache
                 resources has become not merely attractive but
                 imperative. Cache partitioning, that is, dividing cache
                 space between applications based on their memory
                 demands, is a promising approach to provide capacity
                 benefits of shared cache with performance isolation of
                 private caches. However, naively partitioning the cache
                 may lead to performance loss, unfairness, and lack of
                 quality-of-service guarantees. It is clear that
                 intelligent techniques are required for realizing the
                 full potential of cache partitioning. In this article,
                 we present a survey of techniques for partitioning
                 shared caches in multicore processors. We categorize
                 the techniques based on important characteristics and
                 provide a bird's eye view of the field of cache
                 partitioning.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Luo:2017:SEP,
  author =       "Hanjiang Luo and Kaishun Wu and Rukhsana Ruby and Feng
                 Hong and Zhongwen Guo and Lionel M. Ni",
  title =        "Simulation and Experimentation Platforms for
                 Underwater Acoustic Sensor Networks: Advancements and
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "28:1--28:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3040990",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Ocean and water basically cover the major parts of our
                 planet. To obtain the best utilization of the
                 underlying resources on these parts of the Earth,
                 people have made some research advancements.
                 Specifically, the research on underwater wireless
                 acoustic sensor networks (UWA-SNs) has made great
                 progress. However, wide deployment of UWA-SNs is far
                 from a reality due to several reasons. One important
                 reason is that offshore deployment and field-level
                 experiments of ocean-centric applications are both
                 expensive and labor intensive. Other alternatives to
                 attain this objective are to conduct simulation or
                 experimentation that can reduce cost and accelerate the
                 research activities and their outcomes. However,
                 designing efficient and reliable simulation and
                 experimentation platforms have proven to be more
                 challenging beyond the expectation. In this article, we
                 explore the main techniques (including their pros and
                 cons) and components to develop simulation and
                 experimentation platforms and provide a comprehensive
                 survey report in this area. We classify simulation and
                 experimentation platforms based on some typical
                 criteria and then provide useful guidelines for
                 researchers on choosing suitable platforms in
                 accordance with their requirements. Finally, we address
                 some open and un-resolved issues in this context and
                 provide some suggestions on future research.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kazmi:2017:ERT,
  author =       "Rafaqut Kazmi and Dayang N. A. Jawawi and Radziah
                 Mohamad and Imran Ghani",
  title =        "Effective Regression Test Case Selection: a Systematic
                 Literature Review",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "29:1--29:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3057269",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Regression test case selection techniques attempt to
                 increase the testing effectiveness based on the
                 measurement capabilities, such as cost, coverage, and
                 fault detection. This systematic literature review
                 presents state-of-the-art research in effective
                 regression test case selection techniques. We examined
                 47 empirical studies published between 2007 and 2015.
                 The selected studies are categorized according to the
                 selection procedure, empirical study design, and
                 adequacy criteria with respect to their effectiveness
                 measurement capability and methods used to measure the
                 validity of these results. The results showed that
                 mining and learning-based regression test case
                 selection was reported in 39\% of the studies, unit
                 level testing was reported in 18\% of the studies, and
                 object-oriented environment (Java) was used in 26\% of
                 the studies. Structural faults, the most common target,
                 was used in 55\% of the studies. Overall, only 39\% of
                 the studies conducted followed experimental guidelines
                 and are reproducible. There are 7 different cost
                 measures, 13 different coverage types, and 5
                 fault-detection metrics reported in these studies. It
                 is also observed that 70\% of the studies being
                 analyzed used cost as the effectiveness measure
                 compared to 31\% that used fault-detection capability
                 and 16\% that used coverage.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Do:2017:GTC,
  author =       "Cuong T. Do and Nguyen H. Tran and Choongseon Hong and
                 Charles A. Kamhoua and Kevin A. Kwiat and Erik Blasch
                 and Shaolei Ren and Niki Pissinou and Sundaraja
                 Sitharama Iyengar",
  title =        "Game Theory for Cyber Security and Privacy",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "30:1--30:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3057268",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In this survey, we review the existing game-theoretic
                 approaches for cyber security and privacy issues,
                 categorizing their application into two classes,
                 security and privacy. To show how game theory is
                 utilized in cyberspace security and privacy, we select
                 research regarding three main applications:
                 cyber-physical security, communication security, and
                 privacy. We present game models, features, and
                 solutions of the selected works and describe their
                 advantages and limitations from design to
                 implementation of the defense mechanisms. We also
                 identify some emerging trends and topics for future
                 research. This survey not only demonstrates how to
                 employ game-theoretic approaches to security and
                 privacy but also encourages researchers to employ game
                 theory to establish a comprehensive understanding of
                 emerging security and privacy problems in cyberspace
                 and potential solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kafi:2017:SRP,
  author =       "Mohamed Amine Kafi and Jalel Ben Othman and Nadjib
                 Badache",
  title =        "A Survey on Reliability Protocols in Wireless Sensor
                 Networks",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "2",
  pages =        "31:1--31:??",
  month =        jun,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3064004",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jul 24 18:12:20 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Wireless Sensor Network (WSN) applications have become
                 more and more attractive with the miniaturization of
                 circuits and the large variety of sensors. The
                 different application domains, especially critical
                 fields of WSN use, make the reliability of data
                 acquisition and communication a hot research field that
                 must be tackled efficiently. Indeed, the quality of
                 largely used, cheap-cost wireless sensors and their
                 scarce energy supply support these reliability
                 challenges that lead to data loss or corruption. For
                 solving this problem, the conception of a reliability
                 mechanism that detects these shortcomings and recovers
                 to them becomes necessary. In this article, we present
                 a survey on existing reliability protocols conceived
                 especially for WSNs due to their special features. The
                 deep classification and discussion in this study allow
                 for understanding the pros and cons of state-of-the-art
                 works in order to enhance the existing schemes and fill
                 the gaps. We have classified the works according to the
                 required level of reliability, the manner to identify
                 the origins of the lack of reliability, and the control
                 to recover this lack of reliability. Across the
                 discussion along this study, we deduce that the
                 cross-layer design between MAC, routing, and transport
                 layers presents a good concept to efficiently overcome
                 the different reliability holes.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Perera:2017:FCS,
  author =       "Charith Perera and Yongrui Qin and Julio C. Estrella
                 and Stephan Reiff-Marganiec and Athanasios V.
                 Vasilakos",
  title =        "Fog Computing for Sustainable Smart Cities: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "32:1--32:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3057266",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Internet of Things (IoT) aims to connect billions
                 of smart objects to the Internet, which can bring a
                 promising future to smart cities. These objects are
                 expected to generate large amounts of data and send the
                 data to the cloud for further processing, especially
                 for knowledge discovery, in order that appropriate
                 actions can be taken. However, in reality sensing all
                 possible data items captured by a smart object and then
                 sending the complete captured data to the cloud is less
                 useful. Further, such an approach would also lead to
                 resource wastage (e.g., network, storage, etc.). The
                 Fog (Edge) computing paradigm has been proposed to
                 counterpart the weakness by pushing processes of
                 knowledge discovery using data analytics to the edges.
                 However, edge devices have limited computational
                 capabilities. Due to inherited strengths and
                 weaknesses, neither Cloud computing nor Fog computing
                 paradigm addresses these challenges alone. Therefore,
                 both paradigms need to work together in order to build
                 a sustainable IoT infrastructure for smart cities. In
                 this article, we review existing approaches that have
                 been proposed to tackle the challenges in the Fog
                 computing domain. Specifically, we describe several
                 inspiring use case scenarios of Fog computing, identify
                 ten key characteristics and common features of Fog
                 computing, and compare more than 30 existing research
                 efforts in this domain. Based on our review, we further
                 identify several major functionalities that ideal Fog
                 computing platforms should support and a number of open
                 challenges toward implementing them, to shed light on
                 future research directions on realizing Fog computing
                 for building sustainable smart cities.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Al-Helali:2017:AOH,
  author =       "Baligh M. Al-Helali and Sabri A. Mahmoud",
  title =        "{Arabic Online Handwriting Recognition (AOHR)}: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "33:1--33:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3060620",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article comprehensively surveys Arabic Online
                 Handwriting Recognition (AOHR). We address the
                 challenges posed by online handwriting recognition,
                 including ligatures, dots and diacritic problems,
                 online/offline touching of text, and geometric
                 variations. Then we present a general model of an AOHR
                 system that incorporates the different phases of an
                 AOHR system. We summarize the main AOHR databases and
                 identify their uses and limitations. Preprocessing
                 techniques that are used in AOHR, viz. normalization,
                 smoothing, de-hooking, baseline identification, and
                 delayed stroke processing, are presented with
                 illustrative examples. We discuss different techniques
                 for Arabic online handwriting segmentation at the
                 character and morpheme levels and identify their
                 limitations. Feature extraction techniques that are
                 used in AOHR are discussed and their challenges
                 identified. We address the classification techniques of
                 non-cursive (characters and digits) and cursive Arabic
                 online handwriting and analyze their applications. We
                 discuss different classification techniques, viz.
                 structural approaches, Support Vector Machine (SVM),
                 Fuzzy SVM, Neural Networks, Hidden Markov Model,
                 Genetic algorithms, decision trees, and rule-based
                 systems, and analyze their performance. Post-processing
                 techniques are also discussed. Several tables that
                 summarize the surveyed publications are provided for
                 ease of reference and comparison. We summarize the
                 current limitations and difficulties of AOHR and future
                 directions of research.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yau:2017:SRL,
  author =       "Kok-Lim Alvin Yau and Junaid Qadir and Hooi Ling Khoo
                 and Mee Hong Ling and Peter Komisarczuk",
  title =        "A Survey on Reinforcement Learning Models and
                 Algorithms for Traffic Signal Control",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "34:1--34:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3068287",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Traffic congestion has become a vexing and complex
                 issue in many urban areas. Of particular interest are
                 the intersections where traffic bottlenecks are known
                 to occur despite being traditionally signalized.
                 Reinforcement learning (RL), which is an artificial
                 intelligence approach, has been adopted in traffic
                 signal control for monitoring and ameliorating traffic
                 congestion. RL enables autonomous decision makers
                 (e.g., traffic signal controllers) to observe, learn,
                 and select the optimal action (e.g., determining the
                 appropriate traffic phase and its timing) to manage
                 traffic such that system performance is improved. This
                 article reviews various RL models and algorithms
                 applied to traffic signal control in the aspects of the
                 representations of the RL model (i.e., state, action,
                 and reward), performance measures, and complexity to
                 establish a foundation for further investigation in
                 this research field. Open issues are presented toward
                 the end of this article to discover new research areas
                 with the objective to spark new interest in this
                 research field.",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hong:2017:GVS,
  author =       "Cheol-Ho Hong and Ivor Spence and Dimitrios S.
                 Nikolopoulos",
  title =        "{GPU} Virtualization and Scheduling Methods: a
                 Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "35:1--35:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3068281",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "The integration of graphics processing units (GPUs) on
                 high-end compute nodes has established a new
                 accelerator-based heterogeneous computing model, which
                 now permeates high-performance computing. The same
                 paradigm nevertheless has limited adoption in cloud
                 computing or other large-scale distributed computing
                 paradigms. Heterogeneous computing with GPUs can
                 benefit the Cloud by reducing operational costs and
                 improving resource and energy efficiency. However, such
                 a paradigm shift would require effective methods for
                 virtualizing GPUs, as well as other accelerators. In
                 this survey article, we present an extensive and
                 in-depth survey of GPU virtualization techniques and
                 their scheduling methods. We review a wide range of
                 virtualization techniques implemented at the GPU
                 library, driver, and hardware levels. Furthermore, we
                 review GPU scheduling methods that address performance
                 and fairness issues between multiple virtual machines
                 sharing GPUs. We believe that our survey delivers a
                 perspective on the challenges and opportunities for
                 virtualization of heterogeneous computing
                 environments.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Khan:2017:CDR,
  author =       "Muhammad Murad Khan and Roliana Ibrahim and Imran
                 Ghani",
  title =        "Cross Domain Recommender Systems: a Systematic
                 Literature Review",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "36:1--36:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3073565",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cross domain recommender systems (CDRS) can assist
                 recommendations in a target domain based on knowledge
                 learned from a source domain. CDRS consists of three
                 building blocks: domain, user-item overlap scenarios,
                 and recommendation tasks. The objective of this
                 research is to identify the most widely used CDRS
                 building-block definitions, identify common features
                 between them, classify current research in the frame of
                 identified definitions, group together research with
                 respect to algorithm types, present existing problems,
                 and recommend future directions for CDRS research. To
                 achieve this objective, we have conducted a systematic
                 literature review of 94 shortlisted studies. We
                 classified the selected studies using the tag-based
                 approach and designed classification grids. Using
                 classification grids, it was found that the
                 category-domain contributed a maximum of 62\%, whereas
                 the time domain contributed at least 3\%. User-item
                 overlaps were found to have equal contribution. Single
                 target domain recommendation task was found at a
                 maximum of 78\%, whereas cross-domain recommendation
                 task had a minor influence at only 10\%. MovieLens
                 contributed the most at 22\%, whereas Yahoo-music
                 provided 1\% between 29 datasets. Factorization-based
                 algorithms contributed a total of 37\%, whereas
                 semantics-based algorithms contributed 6\% among seven
                 types of identified algorithm groups. Finally, future
                 directions were grouped into five categories.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{OBrien:2017:SPE,
  author =       "Kenneth O'Brien and Ilia Pietri and Ravi Reddy and
                 Alexey Lastovetsky and Rizos Sakellariou",
  title =        "A Survey of Power and Energy Predictive Models in
                 {HPC} Systems and Applications",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "37:1--37:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3078811",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Power and energy efficiency are now critical concerns
                 in extreme-scale high-performance scientific computing.
                 Many extreme-scale computing systems today (for
                 example: Top500) have tight integration of multicore
                 CPU processors and accelerators (mix of Graphical
                 Processing Units, Intel Xeon Phis, or Field
                 Programmable Gate Arrays) empowering them to provide
                 not just unprecedented computational power but also to
                 address these concerns. However, such integration
                 renders these systems highly heterogeneous and
                 hierarchical, thereby necessitating design of novel
                 performance, power, and energy models to accurately
                 capture these inherent characteristics. There are now
                 several extensive research efforts focusing exclusively
                 on power and energy efficiency models and techniques
                 for the processors composing these extreme-scale
                 computing systems. This article synthesizes these
                 research efforts with absolute concentration on
                 predictive power and energy models and prime emphasis
                 on node architecture. Through this survey, we also
                 intend to highlight the shortcomings of these models to
                 correctly and comprehensively predict the power and
                 energy consumptions by taking into account the
                 hierarchical and heterogeneous nature of these tightly
                 integrated high-performance computing systems.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rheinlander:2017:OCD,
  author =       "Astrid Rheinl{\"a}nder and Ulf Leser and Goetz
                 Graefe",
  title =        "Optimization of Complex Dataflows with User-Defined
                 Functions",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "38:1--38:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3078752",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In many fields, recent years have brought a sharp rise
                 in the size of the data to be analyzed and the
                 complexity of the analysis to be performed. Such
                 analyses are often described as dataflows specified in
                 declarative dataflow languages. A key technique to
                 achieve scalability for such analyses is the
                 optimization of the declarative programs; however, many
                 real-life dataflows are dominated by user-defined
                 functions (UDFs) to perform, for instance, text
                 analysis, graph traversal, classification, or
                 clustering. This calls for specific optimization
                 techniques as the semantics of such UDFs are unknown to
                 the optimizer. In this article, we survey techniques
                 for optimizing dataflows with UDFs. We consider methods
                 developed over decades of research in relational
                 database systems as well as more recent approaches
                 spurred by the popularity of Map/Reduce-style data
                 processing frameworks. We present techniques for
                 syntactical dataflow modification, approaches for
                 inferring semantics and rewrite options for UDFs, and
                 methods for dataflow transformations both on the
                 logical and the physical levels. Furthermore, we give a
                 comprehensive overview on declarative dataflow
                 languages for Big Data processing systems from the
                 perspective of their build-in optimization techniques.
                 Finally, we highlight open research challenges with the
                 intention to foster more research into optimizing
                 dataflows that contain UDFs.",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Barforoush:2017:NCF,
  author =       "Ahmad Barforoush and Hossein Shirazi and Hojjat
                 Emami",
  title =        "A New Classification Framework to Evaluate the Entity
                 Profiling on the {Web}: Past, Present and Future",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "39:1--39:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3066904",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recently, we have witnessed entity profiling (EP)
                 becoming increasingly one of the most important topics
                 in information extraction, personalized applications,
                 and web data analysis. EP aims to identify, extract,
                 and represent a compact summary of valuable information
                 about an entity based on the data related to it. To
                 determine how EP systems have developed, during the
                 last few years, this article reviews EP systems through
                 a survey of the literature, from 2000 to 2015. To
                 fulfill this aim, we introduce a comparison framework
                 to compare and classify EP systems. Our comparison
                 framework is composed of thirteen criteria that
                 include: profiling source, the entity being modeled,
                 the information that constitutes the profile,
                 representation schema, profile construction technique,
                 scale, scope/target domain, language, updating
                 mechanism, enrichment technique, dynamicity, evaluation
                 method, and application among others. Then, using the
                 comparison framework, we discuss the recent development
                 of the field and list some of the open problems and
                 main trends that have emerged in EP to provide a proper
                 guideline for researchers to develop or use robust
                 profiling systems with suitable features according to
                 their needs.",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Poh:2017:SSE,
  author =       "Geong Sen Poh and Ji-Jian Chin and Wei-Chuen Yau and
                 Kim-Kwang Raymond Choo and Moesfa Soeheila Mohamad",
  title =        "Searchable Symmetric Encryption: Designs and
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "40:1--40:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3064005",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "Searchable Symmetric Encryption (SSE) when deployed in
                 the cloud allows one to query encrypted data without
                 the risk of data leakage. Despite the widespread
                 interest, existing surveys do not examine in detail how
                 SSE's underlying structures are designed and how these
                 result in the many properties of a SSE scheme. This is
                 the gap we seek to address, as well as presenting
                 recent state-of-the-art advances on SSE. Specifically,
                 we present a general framework and believe the
                 discussions may lead to insights for potential new
                 designs. We draw a few observations. First, most
                 schemes use index table, where optimal index size and
                 sublinear search can be achieved using an inverted
                 index. Straightforward updating can only be achieved
                 using direct index, but search time would be linear. A
                 recent trend is the combinations of index table, and
                 tree, deployed for efficient updating and storage.
                 Secondly, mechanisms from related fields such as
                 Oblivious RAM (ORAM) have been integrated to reduce
                 leakages. However, using these mechanisms to minimise
                 leakages in schemes with richer functionalities (e.g.,
                 ranked, range) is relatively unexplored. Thirdly, a new
                 approach (e.g., multiple servers) is required to
                 mitigate new and emerging attacks on leakage. Lastly,
                 we observe that a proposed index may not be practically
                 efficient when implemented, where I/O access must be
                 taken into consideration.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ye:2017:SMD,
  author =       "Yanfang Ye and Tao Li and Donald Adjeroh and S.
                 Sitharama Iyengar",
  title =        "A Survey on Malware Detection Using Data Mining
                 Techniques",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "41:1--41:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3073559",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the Internet age, malware (such as viruses,
                 trojans, ransomware, and bots) has posed serious and
                 evolving security threats to Internet users. To protect
                 legitimate users from these threats, anti-malware
                 software products from different companies, including
                 Comodo, Kaspersky, Kingsoft, and Symantec, provide the
                 major defense against malware. Unfortunately, driven by
                 the economic benefits, the number of new malware
                 samples has explosively increased: anti-malware vendors
                 are now confronted with millions of potential malware
                 samples per year. In order to keep on combating the
                 increase in malware samples, there is an urgent need to
                 develop intelligent methods for effective and efficient
                 malware detection from the real and large daily sample
                 collection. In this article, we first provide a brief
                 overview on malware as well as the anti-malware
                 industry, and present the industrial needs on malware
                 detection. We then survey intelligent malware detection
                 methods. In these methods, the process of detection is
                 usually divided into two stages: feature extraction and
                 classification/clustering. The performance of such
                 intelligent malware detection approaches critically
                 depend on the extracted features and the methods for
                 classification/clustering. We provide a comprehensive
                 investigation on both the feature extraction and the
                 classification/clustering techniques. We also discuss
                 the additional issues and the challenges of malware
                 detection using data mining techniques and finally
                 forecast the trends of malware development.",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Keiren:2017:CMT,
  author =       "Jeroen J. A. Keiren and Peter Fontana and Rance
                 Cleaveland",
  title =        "Corrections to {``A Menagerie of Timed Automata''}",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "42:1--42:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3078809",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Fontana:2013:MTA}.",
  abstract =     "This note corrects a technical error in the ACM
                 Computing Surveys article mentioned in the title. The
                 flaw involved constructions for showing that timed
                 automata with urgent locations have the same
                 expressiveness as timed automata that allow false
                 location invariants. Corrected constructions are
                 presented in this note, and the affected results are
                 reproved.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cao:2017:DSC,
  author =       "Longbing Cao",
  title =        "Data Science: a Comprehensive Overview",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "43:1--43:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3076253",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The 21st century has ushered in the age of big data
                 and data economy, in which data DNA, which carries
                 important knowledge, insights, and potential, has
                 become an intrinsic constituent of all data-based
                 organisms. An appropriate understanding of data DNA and
                 its organisms relies on the new field of data science
                 and its keystone, analytics. Although it is widely
                 debated whether big data is only hype and buzz, and
                 data science is still in a very early phase,
                 significant challenges and opportunities are emerging
                 or have been inspired by the research, innovation,
                 business, profession, and education of data science.
                 This article provides a comprehensive survey and
                 tutorial of the fundamental aspects of data science:
                 the evolution from data analysis to data science, the
                 data science concepts, a big picture of the era of data
                 science, the major challenges and directions in data
                 innovation, the nature of data analytics, new
                 industrialization and service opportunities in the data
                 economy, the profession and competency of data
                 education, and the future of data science. This article
                 is the first in the field to draw a comprehensive big
                 picture, in addition to offering rich observations,
                 lessons, and thinking about data science and
                 analytics.",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Acquisti:2017:NPS,
  author =       "Alessandro Acquisti and Idris Adjerid and Rebecca
                 Balebako and Laura Brandimarte and Lorrie Faith Cranor
                 and Saranga Komanduri and Pedro Giovanni Leon and
                 Norman Sadeh and Florian Schaub and Manya Sleeper and
                 Yang Wang and Shomir Wilson",
  title =        "Nudges for Privacy and Security: Understanding and
                 Assisting Users' Choices Online",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "44:1--44:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3054926",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Advancements in information technology often task
                 users with complex and consequential privacy and
                 security decisions. A growing body of research has
                 investigated individuals' choices in the presence of
                 privacy and information security tradeoffs, the
                 decision-making hurdles affecting those choices, and
                 ways to mitigate such hurdles. This article provides a
                 multi-disciplinary assessment of the literature
                 pertaining to privacy and security decision making. It
                 focuses on research on assisting individuals' privacy
                 and security choices with soft paternalistic
                 interventions that nudge users toward more beneficial
                 choices. The article discusses potential benefits of
                 those interventions, highlights their shortcomings, and
                 identifies key ethical, design, and research
                 challenges.",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:2017:DDTb,
  author =       "Tao Li and Chunqiu Zeng and Yexi Jiang and Wubai Zhou
                 and Liang Tang and Zheng Liu and Yue Huang",
  title =        "Data-Driven Techniques in Computing System
                 Management",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "45:1--45:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3092697",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Modern forms of computing systems are becoming
                 progressively more complex, with an increasing number
                 of heterogeneous hardware and software components. As a
                 result, it is quite challenging to manage these complex
                 systems and meet the requirements in manageability,
                 dependability, and performance that are demanded by
                 enterprise customers. This survey presents a variety of
                 data-driven techniques and applications with a focus on
                 computing system management. In particular, the survey
                 introduces intelligent methods for event generation
                 that can transform diverse log data sources into
                 structured events, reviews different types of event
                 patterns and the corresponding event-mining techniques,
                 and summarizes various event summarization methods and
                 data-driven approaches for problem diagnosis in system
                 management. We hope this survey will provide a good
                 overview for data-driven techniques in computing system
                 management.",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Morin:2017:EA,
  author =       "Pat Morin and Wolfgang Mulzer and Tommy Reddad",
  title =        "Encoding Arguments",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "3",
  pages =        "46:1--46:??",
  month =        oct,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3084288",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Many proofs in discrete mathematics and theoretical
                 computer science are based on the probabilistic method.
                 To prove the existence of a good object, we pick a
                 random object and show that it is bad with low
                 probability. This method is effective, but the
                 underlying probabilistic machinery can be daunting.
                 ``Encoding arguments'' provide an alternative
                 presentation in which probabilistic reasoning is
                 encapsulated in a ``uniform encoding lemma.'' This
                 lemma provides an upper bound on the probability of an
                 event using the fact that a uniformly random choice
                 from a set of size n cannot be encoded with fewer than
                 log$_2$ n bits on average. With the lemma, the argument
                 reduces to devising an encoding where bad objects have
                 short codewords. In this expository article, we
                 describe the basic method and provide a simple tutorial
                 on how to use it. After that, we survey many
                 applications to classic problems from discrete
                 mathematics and computer science. We also give a
                 generalization for the case of non-uniform
                 distributions, as well as a rigorous justification for
                 the use of non-integer codeword lengths in encoding
                 arguments. These latter two results allow encoding
                 arguments to be applied more widely and to produce
                 tighter results.",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Storer:2017:BCS,
  author =       "Tim Storer",
  title =        "Bridging the Chasm: a Survey of Software Engineering
                 Practice in Scientific Programming",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "47:1--47:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3084225",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The use of software is pervasive in all fields of
                 science. Associated software development efforts may be
                 very large, long lived, and complex, requiring the
                 commitment of significant resources. However, several
                 authors have argued that the ``gap'' or ``chasm''
                 between software engineering and scientific programming
                 is a serious risk to the production of reliable
                 scientific results, as demonstrated in a number of case
                 studies. This article reviews the research that
                 addresses the gap, exploring how both software
                 engineering and research practice may need to evolve to
                 accommodate the use of software in science.",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Granatyr:2017:NAT,
  author =       "Jones Granatyr and Nardine Osman and Jo{\~a}o Dias and
                 Maria Augusta {Silveira Netto Nunes} and Judith
                 Masthoff and Fabr{\'\i}cio Enembreck and Otto Robert
                 Lessing and Carles Sierra and Ana Maria Paiva and Edson
                 Em{\'\i}lio Scalabrin",
  title =        "The Need for Affective Trust Applied to Trust and
                 Reputation Models",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "48:1--48:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3078833",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Trust allows the behavior evaluation of individuals by
                 setting confidence values, which are used in decisions
                 about whether or not to interact. They have been used
                 in several fields, and many trust and reputation models
                 were developed recently. We perceived that most of them
                 were built upon the numeric and cognitive paradigms,
                 which do not use affective aspects to build trust or
                 help in decision making. Studies in psychology argued
                 that personality, emotions, and mood are important in
                 decision making and can change the behaviors of
                 individuals. Based on that, we present links between
                 trust and affective computing, showing relations of
                 trust dimensions found in trust models with affective
                 aspects, and presenting why affective computing
                 approaches fit trust issues often addressed by research
                 in this field. We also discuss trust relationships and
                 decision making, emotions, and personality. Affective
                 computing concepts have been used in a dispersed way
                 and specifically in some models, so we aim to bring
                 them together to encourage the growth of fuller trust
                 models similar to those used by humans. We aim to find
                 relations between both fields so it will be possible to
                 employ such concepts to develop trust models using this
                 new paradigm, defined as the affective paradigm.",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kaur:2017:IPA,
  author =       "Kiranbir Kaur and Sandeep Sharma and Karanjeet Singh
                 Kahlon",
  title =        "Interoperability and Portability Approaches in
                 Inter-Connected Clouds: a Review",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "49:1--49:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3092698",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Inter-connected cloud computing is an inherent
                 evolution of Cloud Computing. Numerous benefits
                 provided by connecting clouds have garnered attraction
                 from the academic as well as the industry sector. Just
                 as every new evolution faces challenges,
                 inter-connected clouds have their own set of challenges
                 such as security, monitoring, authorization and
                 identity management, vendor lock-in, and so forth. This
                 article considers the vendor lock-in problem, which is
                 a direct consequence of the lack of interoperability
                 and portability. An extensive literature review by
                 surveying more than 120 papers has been done to analyze
                 and categorize various solutions suggested in
                 literature for solving the interoperability and
                 portability issues of inter-connected clouds. After
                 categorizing the solutions, the literature has been
                 mapped to a specific solution and a comparative
                 analysis of the papers under the same solution has been
                 done. The term ``inter-connected clouds'' has been used
                 generically in this article to refer to any
                 collaboration of clouds which may be from the user side
                 (Multi-clouds or Aggregated service by Broker) or the
                 provider side (Federated clouds or Hybrid clouds).
                 Lastly, two closely related issues (Brokers and
                 Meta-scheduling) and the remaining challenges of
                 inter-connected clouds are discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Psychou:2017:CRT,
  author =       "Georgia Psychou and Dimitrios Rodopoulos and Mohamed
                 M. Sabry and Tobias Gemmeke and David Atienza and
                 Tobias G. Noll and Francky Catthoor",
  title =        "Classification of Resilience Techniques Against
                 Functional Errors at Higher Abstraction Layers of
                 Digital Systems",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "50:1--50:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3092699",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Nanoscale technology nodes bring reliability concerns
                 back to the center stage of digital system design. A
                 systematic classification of approaches that increase
                 system resilience in the presence of functional
                 hardware (HW)-induced errors is presented, dealing with
                 higher system abstractions, such as the
                 (micro)architecture, the mapping, and platform software
                 (SW). The field is surveyed in a systematic way based
                 on nonoverlapping categories, which add insight into
                 the ongoing work by exposing similarities and
                 differences. HW and SW solutions are discussed in a
                 similar fashion so that interrelationships become
                 apparent. The presented categories are illustrated by
                 representative literature examples to illustrate their
                 properties. Moreover, it is demonstrated how hybrid
                 schemes can be decomposed into their primitive
                 components.",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Soulier:2017:CSI,
  author =       "Laure Soulier and Lynda Tamine",
  title =        "On the Collaboration Support in Information
                 Retrieval",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "51:1--51:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3092696",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Collaborative Information Retrieval (CIR) is a
                 well-known setting in which explicit collaboration
                 occurs among a group of users working together to solve
                 a shared information need. This type of collaboration
                 has been deemed as beneficial for complex or
                 exploratory search tasks. With the multiplicity of
                 factors impacting on the search effectiveness (e.g.,
                 collaborators' interactions or the individual
                 perception of the shared information need), CIR gives
                 rise to several challenges in terms of collaboration
                 support through algorithmic approaches. More
                 particularly, CIR should allow us to satisfy the shared
                 information need by optimizing the collaboration within
                 the search session over all collaborators, while
                 ensuring that both mutually beneficial goals are
                 reached and that the cognitive cost of the
                 collaboration does not impact the search effectiveness.
                 In this survey, we propose an overview of CIR with a
                 particular focus on the collaboration support through
                 algorithmic approaches. The objective of this article
                 is (a) to organize previous empirical studies analyzing
                 collaborative search with the goal to provide useful
                 design implications for CIR models, (b) to give a
                 picture of the CIR area by distinguishing two main
                 categories of models using the collaboration mediation
                 axis, and (c) to point out potential perspectives in
                 the domain.",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Schoknecht:2017:SBP,
  author =       "Andreas Schoknecht and Tom Thaler and Peter Fettke and
                 Andreas Oberweis and Ralf Laue",
  title =        "Similarity of Business Process Models --- A
                 State-of-the-Art Analysis",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "52:1--52:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3092694",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Business process models play an important role in
                 today's enterprises, hence, model repositories may
                 contain hundreds of models. These models are, for
                 example, reused during process modeling activities or
                 utilized to check the conformance of processes with
                 legal regulations. With respect to the amount of
                 models, such applications benefit from or even require
                 detailed insights into the correspondences between
                 process models or between process models' nodes.
                 Therefore, various process similarity and matching
                 measures have been proposed during the past few years.
                 This article provides an overview of the
                 state-of-the-art regarding business process model
                 similarity measures and aims at analyzing which
                 similarity measures exist, how they are characterized,
                 and what kind of calculations are typically applied to
                 determine similarity values. Finally, the analysis of
                 123 similarity measures results in the suggestions to
                 conduct further comparative analyses of similarity
                 measures, to investigate the integration of human input
                 into similarity measurement, and to further analyze the
                 requirements of similarity measurement usage scenarios
                 as future research opportunities.",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Stein:2017:CLN,
  author =       "Michael Stein and Mathias Fischer and Immanuel
                 Schweizer and Max M{\"u}hlh{\"a}user",
  title =        "A Classification of Locality in Network Research",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "53:1--53:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3092693",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Limiting the knowledge of individual nodes is a major
                 concern for the design of distributed algorithms. With
                 the LOCAL model, theoretical research already
                 established a common model of locality that has gained
                 little practical relevance. As a result, practical
                 research de facto lacks any common locality model. The
                 only common denominator among practitioners is that a
                 local algorithm is distributed with a restricted scope
                 of interaction. This article closes the gap by
                 introducing four practically motivated classes of
                 locality that successively weaken the strict
                 requirements of the LOCAL model. These classes are
                 applied to categorize and survey 36 local algorithms
                 from 12 different application domains. A detailed
                 comparison shows the practicality of the classification
                 and provides interesting insights. For example, the
                 majority of algorithms limit the scope of interaction
                 to at most two hops, independent of their locality
                 class. Moreover, the application domain of algorithms
                 tends to influence their degree of locality.",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chakraborty:2017:MCA,
  author =       "Tanmoy Chakraborty and Ayushi Dalmia and Animesh
                 Mukherjee and Niloy Ganguly",
  title =        "Metrics for Community Analysis: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "54:1--54:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3091106",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Detecting and analyzing dense groups or communities
                 from social and information networks has attracted
                 immense attention over the last decade due to its
                 enormous applicability in different domains. Community
                 detection is an ill-defined problem, as the nature of
                 the communities is not known in advance. The problem
                 has turned even more complicated due to the fact that
                 communities emerge in the network in various forms such
                 as disjoint, overlapping, and hierarchical. Various
                 heuristics have been proposed to address these
                 challenges, depending on the application in hand. All
                 these heuristics have been materialized in the form of
                 new metrics, which in most cases are used as
                 optimization functions for detecting the community
                 structure, or provide an indication of the goodness of
                 detected communities during evaluation. Over the last
                 decade, a large number of such metrics have been
                 proposed. Thus, there arises a need for an organized
                 and detailed survey of the metrics proposed for
                 community detection and evaluation. Here, we present a
                 survey of the start-of-the-art metrics used for the
                 detection and the evaluation of community structure. We
                 also conduct experiments on synthetic and real networks
                 to present a comparative analysis of these metrics in
                 measuring the goodness of the underlying community
                 structure.",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tran:2017:SWT,
  author =       "Nguyen Khoi Tran and Quan Z. Sheng and Muhammad Ali
                 Babar and Lina Yao",
  title =        "Searching the {Web of Things}: State of the Art,
                 Challenges, and Solutions",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "55:1--55:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3092695",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Technological advances allow more physical objects to
                 connect to the Internet and provide their services on
                 the Web as resources. Search engines are the key to
                 fully utilize this emerging Web of Things, as they
                 bridge users and applications with resources needed for
                 their operation. Developing these systems is a
                 challenging and diverse endeavor due to the diversity
                 of Web of Things resources that they work with. Each
                 combination of resources in query resolution process
                 requires a different type of search engine with its own
                 technical challenges and usage scenarios. This
                 diversity complicates both the development of new
                 systems and assessment of the state of the art. In this
                 article, we present a systematic survey on Web of
                 Things Search Engines (WoTSE), focusing on the
                 diversity in forms of these systems. We collect and
                 analyze over 200 related academic works to build a
                 flexible conceptual model for WoTSE. We develop an
                 analytical framework on this model to review the
                 development of the field and its current status,
                 reflected by 30 representative works in the area. We
                 conclude our survey with a discussion on open issues to
                 bridge the gap between the existing progress and an
                 ideal WoTSE.",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ghaffarian:2017:SVA,
  author =       "Seyed Mohammad Ghaffarian and Hamid Reza Shahriari",
  title =        "Software Vulnerability Analysis and Discovery Using
                 Machine-Learning and Data-Mining Techniques: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "56:1--56:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3092566",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Software security vulnerabilities are one of the
                 critical issues in the realm of computer security. Due
                 to their potential high severity impacts, many
                 different approaches have been proposed in the past
                 decades to mitigate the damages of software
                 vulnerabilities. Machine-learning and data-mining
                 techniques are also among the many approaches to
                 address this issue. In this article, we provide an
                 extensive review of the many different works in the
                 field of software vulnerability analysis and discovery
                 that utilize machine-learning and data-mining
                 techniques. We review different categories of works in
                 this domain, discuss both advantages and shortcomings,
                 and point out challenges and some uncharted territories
                 in the field.",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tariq:2017:NGP,
  author =       "Zain Bin Tariq and Dost Muhammad Cheema and Muhammad
                 Zahir Kamran and Ijaz Haider Naqvi",
  title =        "Non-{GPS} Positioning Systems: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "57:1--57:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3098207",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "An enormous amount of research has been conducted in
                 the area of positioning systems and thus it calls for a
                 detailed literature review of recent localization
                 systems. This article focuses on recent developments of
                 non-Global Positioning System (GPS)
                 localization/positioning systems. We have presented a
                 new hierarchical method to classify various positioning
                 systems. A comprehensive performance comparison of the
                 techniques and technologies against multiple
                 performance metrics along with the limitations is
                 presented. A few indoor positioning systems have
                 emerged as more successful in particular application
                 environments than others, which are presented at the
                 end.",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Deng:2017:TRT,
  author =       "Yangdong Deng and Yufei Ni and Zonghui Li and Shuai Mu
                 and Wenjun Zhang",
  title =        "Toward Real-Time Ray Tracing: a Survey on Hardware
                 Acceleration and Microarchitecture Techniques",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "58:1--58:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3104067",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Ray tracing has long been considered as the
                 next-generation technology for graphics rendering.
                 Recently, there has been strong momentum to adopt ray
                 tracing--based rendering techniques on consumer-level
                 platforms due to the inability of further enhancing
                 user experience by increasing display resolution. On
                 the other hand, the computing workload of ray tracing
                 is still overwhelming. A 10-fold performance gap has to
                 be narrowed for real-time applications, even on the
                 latest graphics processing units (GPUs). As a result,
                 hardware acceleration techniques are critical to
                 delivering a satisfying level performance while at the
                 same time meeting an acceptable power budget. A large
                 body of research on ray-tracing hardware has been
                 proposed over the past decade. This article is aimed at
                 providing a timely survey on hardware techniques to
                 accelerate the ray-tracing algorithm. First, a
                 quantitative profiling on the ray-tracing workload is
                 presented. We then review hardware techniques for the
                 main functional blocks in a ray-tracing pipeline. On
                 such a basis, the ray-tracing microarchitectures for
                 both ASIC and processors are surveyed by following a
                 systematic taxonomy.",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sun:2017:AJP,
  author =       "Kwangwon Sun and Sukyoung Ryu",
  title =        "Analysis of {JavaScript} Programs: Challenges and
                 Research Trends",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "59:1--59:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3106741",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/java2010.bib",
  abstract =     "JavaScript has been a de facto standard language for
                 client-side web programs, and now it is expanding its
                 territory to general purpose programs. In this article,
                 we classify the client-side JavaScript research for the
                 last decade or so into six topics: static analysis,
                 dynamic analysis, formalization and reasoning, type
                 safety and JIT optimization, security for web
                 applications, and empirical studies. Because the
                 majority of the research has focused on static and
                 dynamic analyses of JavaScript, we evaluate research
                 trends in the analysis of JavaScript first and then the
                 other topics. Finally, we discuss possible future
                 research directions with open challenges.",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Caballero:2017:SAD,
  author =       "Rafael Caballero and Adri{\'a}n Riesco and Josep
                 Silva",
  title =        "A Survey of Algorithmic Debugging",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "60:1--60:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3106740",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Algorithmic debugging is a technique proposed in 1982
                 by E. Y. Shapiro in the context of logic programming.
                 This survey shows how the initial ideas have been
                 developed to become a widespread debugging schema
                 fitting many different programming paradigms and with
                 applications out of the program debugging field. We
                 describe the general framework and the main issues
                 related to the implementations in different programming
                 paradigms and discuss several proposed improvements and
                 optimizations. We also review the main algorithmic
                 debugger tools that have been implemented so far and
                 compare their features. From this comparison, we
                 elaborate a summary of desirable characteristics that
                 should be considered when implementing future
                 algorithmic debuggers.",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jayaraman:2017:SPS,
  author =       "Padma Jayaraman and Ranjani Parthasarathi",
  title =        "A Survey on Post-Silicon Functional Validation for
                 Multicore Architectures",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "4",
  pages =        "61:1--61:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3107615",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "During a processor development cycle, post-silicon
                 validation is performed on the first fabricated chip to
                 detect and fix design errors. Design errors occur due
                 to functional issues when a unit in a design does not
                 meet its specification. The chances of occurrence of
                 such errors are high when new features are added in a
                 processor. Thus, in multicore architectures, with new
                 features being added in core and uncore components, the
                 task of verifying the functionality independently and
                 in coordination with other units gains significance.
                 Several new techniques are being proposed in the field
                 of functional validation. In this article, we undertake
                 a survey of these techniques to identify areas that
                 need to be addressed for multicore designs. We start
                 with an analysis of design errors in multicore
                 architectures. We then survey different functional
                 validation techniques based on hardware, software, and
                 formal methods and propose a comprehensive taxonomy for
                 each of these approaches. We also perform a critical
                 analysis to identify gaps in existing research and
                 propose new research directions for validation of
                 multicore architectures.",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Boukerche:2017:AVD,
  author =       "Azzedine Boukerche and Abdul Jabbar Siddiqui and
                 Abdelhamid Mammeri",
  title =        "Automated Vehicle Detection and Classification:
                 Models, Methods, and Techniques",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "62:1--62:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3107614",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Automated Vehicle Classification (AVC) based on vision
                 sensors has received active attention from researchers,
                 due to heightened security concerns in Intelligent
                 Transportation Systems. In this work, we propose a
                 categorization of AVC studies based on the granularity
                 of classification, namely Vehicle Type Recognition,
                 Vehicle Make Recognition, and Vehicle Make and Model
                 Recognition. For each category of AVC systems, we
                 present a comprehensive review and comparison of
                 features extraction, global representation, and
                 classification techniques. We also present the accuracy
                 and speed-related performance metrics and discuss how
                 they can be used to compare and evaluate different AVC
                 works. The various datasets proposed over the years for
                 AVC are also compared in light of the real-world
                 challenges they represent, and those they do not. The
                 major challenges involved in each category of AVC
                 systems are presented, highlighting open problems in
                 this area of research. Finally, we conclude by
                 providing future directions of research in this area,
                 paving the way toward efficient large-scale AVC
                 systems. This survey shall help researchers interested
                 in the area to analyze works completed so far in each
                 category of AVC, focusing on techniques proposed for
                 each module, and to chalk out strategies to enhance
                 state-of-the-art technology.",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhong:2017:SAS,
  author =       "Changtao Zhong and Nishanth Sastry",
  title =        "Systems Applications of Social Networks",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "63:1--63:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3092742",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The aim of this article is to provide an understanding
                 of social networks as a useful addition to the standard
                 toolbox of techniques used by system designers. To this
                 end, we give examples of how data about social links
                 have been collected and used in different application
                 contexts. We develop a broad taxonomy-based overview of
                 common properties of social networks, review how they
                 might be used in different applications, and point out
                 potential pitfalls where appropriate. We propose a
                 framework, distinguishing between two main types of
                 social network-based user selection- personalised user
                 selection, which identifies target users who may be
                 relevant for a given source node, using the social
                 network around the source as a context, and generic
                 user selection or group delimitation, which filters for
                 a set of users who satisfy a set of application
                 requirements based on their social properties. Using
                 this framework, we survey applications of social
                 networks in three typical kinds of application
                 scenarios: recommender systems, content-sharing systems
                 (e.g., P2P or video streaming), and systems that defend
                 against users who abuse the system (e.g., spam or sybil
                 attacks). In each case, we discuss potential directions
                 for future research that involve using social network
                 properties.",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Baca:2017:SXQ,
  author =       "Radim Baca and Michal Kr{\'a}tk{\'y} and Irena
                 Holubov{\'a} and Martin Necask{\'y} and Tom{\'a}s
                 Skopal and Martin Svoboda and Sherif Sakr",
  title =        "Structural {XML} Query Processing",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "64:1--64:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3095798",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Since the boom in new proposals on techniques for
                 efficient querying of XML data is now over and the
                 research world has shifted its attention toward new
                 types of data formats, we believe that it is crucial to
                 review what has been done in the area to help users
                 choose an appropriate strategy and scientists exploit
                 the contributions in new areas of data processing. The
                 aim of this work is to provide a comprehensive study of
                 the state-of-the-art of approaches for the structural
                 querying of XML data. In particular, we start with a
                 description of labeling schemas to capture the
                 structure of the data and the respective storage
                 strategies. Then we deal with the key part of every XML
                 query processing: a twig query join, XML query
                 algebras, optimizations of query plans, and selectivity
                 estimation of XML queries. To the best of our
                 knowledge, this is the first work that provides such a
                 detailed description of XML query processing techniques
                 that are related to structural aspects and that
                 contains information about their theoretical and
                 practical features as well as about their mutual
                 compatibility and general usability.",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bagga:2017:MAS,
  author =       "Pallavi Bagga and Rahul Hans",
  title =        "Mobile Agents System Security: a Systematic Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "65:1--65:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3095797",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A pivotal cause for the boom of Mobile Agent paradigm
                 relies on the competence to ward off security attacks.
                 This article surveys the prevalent attacks on the
                 mobile agents and the agent platforms; the existing
                 countermeasures and their curbs, catering threefold
                 benefaction: First, to acquaint the researchers with
                 numerous security requirements and the objectives.
                 Second, to analyze the different detection and
                 prevention mechanisms mitigating the security
                 bottlenecks in Mobile Agents System. Third, to address
                 the future security challenges. In a nutshell, this
                 survey hands over a key to researchers who primarily
                 target the security concerns of the mobile agent-based
                 applications.",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Andreasen:2017:SDA,
  author =       "Esben Andreasen and Liang Gong and Anders M{\o}ller
                 and Michael Pradel and Marija Selakovic and Koushik Sen
                 and Cristian-Alexandru Staicu",
  title =        "A Survey of Dynamic Analysis and Test Generation for
                 {JavaScript}",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "66:1--66:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3106739",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/java2010.bib",
  abstract =     "JavaScript has become one of the most prevalent
                 programming languages. Unfortunately, some of the
                 unique properties that contribute to this popularity
                 also make JavaScript programs prone to errors and
                 difficult for program analyses to reason about. These
                 properties include the highly dynamic nature of the
                 language, a set of unusual language features, a lack of
                 encapsulation mechanisms, and the ``no crash''
                 philosophy. This article surveys dynamic program
                 analysis and test generation techniques for JavaScript
                 targeted at improving the correctness, reliability,
                 performance, security, and privacy of JavaScript-based
                 software.",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Murray:2017:TOB,
  author =       "Niall Murray and Oluwakemi A. Ademoye and Gheorghita
                 Ghinea and Gabriel-Miro Muntean",
  title =        "A Tutorial for Olfaction-Based Multisensorial Media
                 Application Design and Evaluation",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "67:1--67:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3108243",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recently, multimedia researchers have added several
                 so-called new media to the traditional multimedia
                 components (e.g., olfaction, haptic, and gustation).
                 Evaluating multimedia user-perceived Quality of
                 Experience (QoE) is already non-trivial and the
                 addition of multisensorial media components increases
                 this challenge. No standardized methodology exists to
                 conduct subjective quality assessments of
                 multisensorial media applications. To date, researchers
                 have employed different aspects of audiovisual
                 standards to assess user QoE of multisensorial media
                 applications and thus, a fragmented approach exists. In
                 this article, the authors highlight issues researchers
                 face from numerous perspectives including applicability
                 (or lack of) existing audiovisual standards to evaluate
                 user QoE and lack of result comparability due to
                 varying approaches, specific requirements of
                 olfactory-based multisensorial media applications, and
                 novelty associated with these applications. Finally,
                 based on the diverse approaches in the literature and
                 the collective experience of authors, this article
                 provides a tutorial and recommendations on the key
                 steps to conduct olfactory-based multisensorial media
                 QoE evaluation.",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Angles:2017:FMQ,
  author =       "Renzo Angles and Marcelo Arenas and Pablo Barcel{\'o}
                 and Aidan Hogan and Juan Reutter and Domagoj Vrgoc",
  title =        "Foundations of Modern Query Languages for Graph
                 Databases",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "68:1--68:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3104031",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  abstract =     "We survey foundational features underlying modern
                 graph query languages. We first discuss two popular
                 graph data models: edge-labelled graphs, where nodes
                 are connected by directed, labelled edges, and property
                 graphs, where nodes and edges can further have
                 attributes. Next we discuss the two most fundamental
                 graph querying functionalities: graph patterns and
                 navigational expressions. We start with graph patterns,
                 in which a graph-structured query is matched against
                 the data. Thereafter, we discuss navigational
                 expressions, in which patterns can be matched
                 recursively against the graph to navigate paths of
                 arbitrary length; we give an overview of what kinds of
                 expressions have been proposed and how they can be
                 combined with graph patterns. We also discuss several
                 semantics under which queries using the previous
                 features can be evaluated, what effects the selection
                 of features and semantics has on complexity, and offer
                 examples of such features in three modern languages
                 that are used to query graphs: SPARQL, Cypher, and
                 Gremlin. We conclude by discussing the importance of
                 formalisation for graph query languages; a summary of
                 what is known about SPARQL, Cypher, and Gremlin in
                 terms of expressivity and complexity; and an outline of
                 possible future directions for the area.",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Herremans:2017:FTM,
  author =       "Dorien Herremans and Ching-Hua Chuan and Elaine Chew",
  title =        "A Functional Taxonomy of Music Generation Systems",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "69:1--69:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3108242",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Digital advances have transformed the face of
                 automatic music generation since its beginnings at the
                 dawn of computing. Despite the many breakthroughs,
                 issues such as the musical tasks targeted by different
                 machines and the degree to which they succeed remain
                 open questions. We present a functional taxonomy for
                 music generation systems with reference to existing
                 systems. The taxonomy organizes systems according to
                 the purposes for which they were designed. It also
                 reveals the inter-relatedness amongst the systems. This
                 design-centered approach contrasts with predominant
                 methods-based surveys and facilitates the
                 identification of grand challenges to set the stage for
                 new breakthroughs.",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pulido-Prieto:2017:SNP,
  author =       "Oscar Pulido-Prieto and Ulises
                 Ju{\'a}rez-Mart{\'\i}nez",
  title =        "A Survey of Naturalistic Programming Technologies",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "70:1--70:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3109481",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Mainly focused on solving abstraction problems,
                 programming paradigms limit language expressiveness,
                 thus leaving unexplored natural language descriptions
                 that are implicitly expressive. Several authors have
                 developed tools for programming with a natural language
                 subset limited to specific domains to deal with the
                 ambiguity occurring with artificial intelligence
                 technique use. This article presents a review of tools
                 and languages with naturalistic features and highlights
                 the problems that authors have resolved and those they
                 have not addressed, going on to discuss the fact that a
                 ``naturalistic'' language based on a well-defined model
                 is not reported.",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Alevizos:2017:PCE,
  author =       "Elias Alevizos and Anastasios Skarlatidis and
                 Alexander Artikis and Georgios Paliouras",
  title =        "Probabilistic Complex Event Recognition: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "71:1--71:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3117809",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Complex event recognition (CER) applications exhibit
                 various types of uncertainty, ranging from incomplete
                 and erroneous data streams to imperfect complex event
                 patterns. We review CER techniques that handle, to some
                 extent, uncertainty. We examine techniques based on
                 automata, probabilistic graphical models, and
                 first-order logic, which are the most common ones, and
                 approaches based on Petri nets and grammars, which are
                 less frequently used. Several limitations are
                 identified with respect to the employed languages,
                 their probabilistic models, and their performance, as
                 compared to the purely deterministic cases. Based on
                 those limitations, we highlight promising directions
                 for future work.",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Martinez-Gil:2017:MES,
  author =       "Francisco Martinez-Gil and Miguel Lozano and Ignacio
                 Garc{\'\i}a-Fern{\'a}ndez and Fernando Fern{\'a}ndez",
  title =        "Modeling, Evaluation, and Scale on Artificial
                 Pedestrians: a Literature Review",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "72:1--72:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3117808",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Modeling pedestrian dynamics and their implementation
                 in a computer are challenging and important issues in
                 the knowledge areas of transportation and computer
                 simulation. The aim of this article is to provide a
                 bibliographic outlook so that the reader may have quick
                 access to the most relevant works related to this
                 problem. We have used three main axes to organize the
                 article's contents: pedestrian models, validation
                 techniques, and multiscale approaches. The backbone of
                 this work is the classification of existing pedestrian
                 models; we have organized the works in the literature
                 under five categories, according to the techniques used
                 for implementing the operational level in each
                 pedestrian model. Then the main existing validation
                 methods, oriented to evaluate the behavioral quality of
                 the simulation systems, are reviewed. Furthermore, we
                 review the key issues that arise when facing multiscale
                 pedestrian modeling, where we first focus on the
                 behavioral scale (combinations of micro and macro
                 pedestrian models) and second on the scale size (from
                 individuals to crowds). The article begins by
                 introducing the main characteristics of walking
                 dynamics and its analysis tools and concludes with a
                 discussion about the contributions that different
                 knowledge fields can make in the near future to this
                 exciting area.",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Joshi:2017:ASD,
  author =       "Aditya Joshi and Pushpak Bhattacharyya and Mark J.
                 Carman",
  title =        "Automatic Sarcasm Detection: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "73:1--73:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3124420",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Automatic sarcasm detection is the task of predicting
                 sarcasm in text. This is a crucial step to sentiment
                 analysis, considering prevalence and challenges of
                 sarcasm in sentiment-bearing text. Beginning with an
                 approach that used speech-based features, automatic
                 sarcasm detection has witnessed great interest from the
                 sentiment analysis community. This article is a
                 compilation of past work in automatic sarcasm
                 detection. We observe three milestones in the research
                 so far: semi-supervised pattern extraction to identify
                 implicit sentiment, use of hashtag-based supervision,
                 and incorporation of context beyond target text. In
                 this article, we describe datasets, approaches, trends,
                 and issues in sarcasm detection. We also discuss
                 representative performance values, describe shared
                 tasks, and provide pointers to future work, as given in
                 prior works. In terms of resources to understand the
                 state-of-the-art, the survey presents several useful
                 illustrations-most prominently, a table that summarizes
                 past papers along different dimensions such as the
                 types of features, annotation techniques, and datasets
                 used.",
  acknowledgement = ack-nhfb,
  articleno =    "73",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gonzalez:2017:RQL,
  author =       "Pablo Gonz{\'a}lez and Alberto Casta{\~n}o and Nitesh
                 V. Chawla and Juan Jos{\'e} {Del Coz}",
  title =        "A Review on Quantification Learning",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "74:1--74:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3117807",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The task of quantification consists in providing an
                 aggregate estimation (e.g., the class distribution in a
                 classification problem) for unseen test sets, applying
                 a model that is trained using a training set with a
                 different data distribution. Several real-world
                 applications demand this kind of method that does not
                 require predictions for individual examples and just
                 focuses on obtaining accurate estimates at an aggregate
                 level. During the past few years, several
                 quantification methods have been proposed from
                 different perspectives and with different goals. This
                 article presents a unified review of the main
                 approaches with the aim of serving as an introductory
                 tutorial for newcomers in the field.",
  acknowledgement = ack-nhfb,
  articleno =    "74",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Batalla:2017:SSH,
  author =       "Jordi Mongay Batalla and Athanasios Vasilakos and
                 Mariusz Gajewski",
  title =        "Secure Smart Homes: Opportunities and Challenges",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "75:1--75:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3122816",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Smart Home concept integrates smart applications
                 in the daily human life. In recent years, Smart Homes
                 have increased security and management challenges due
                 to the low capacity of small sensors, multiple
                 connectivity to the Internet for efficient applications
                 (use of big data and cloud computing), and
                 heterogeneity of home systems, which require inexpert
                 users to configure devices and micro-systems. This
                 article presents current security and management
                 approaches in Smart Homes and shows the good practices
                 imposed on the market for developing secure systems in
                 houses. At last, we propose future solutions for
                 efficiently and securely managing the Smart Homes.",
  acknowledgement = ack-nhfb,
  articleno =    "75",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{DeBoer:2017:SAO,
  author =       "Frank {De Boer} and Vlad Serbanescu and Reiner
                 H{\"a}hnle and Ludovic Henrio and Justine Rochas and
                 Crystal Chang Din and Einar Broch Johnsen and Marjan
                 Sirjani and Ehsan Khamespanah and Kiko Fernandez-Reyes
                 and Albert Mingkun Yang",
  title =        "A Survey of Active Object Languages",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "76:1--76:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3122848",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "To program parallel systems efficiently and easily, a
                 wide range of programming models have been proposed,
                 each with different choices concerning synchronization
                 and communication between parallel entities. Among
                 them, the actor model is based on loosely coupled
                 parallel entities that communicate by means of
                 asynchronous messages and mailboxes. Some actor
                 languages provide a strong integration with
                 object-oriented concepts; these are often called active
                 object languages. This article reviews four major actor
                 and active object languages and compares them according
                 to carefully chosen dimensions that cover central
                 aspects of the programming paradigms and their
                 implementation.",
  acknowledgement = ack-nhfb,
  articleno =    "76",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Laube:2017:SAC,
  author =       "Stefan Laube and Rainer B{\"o}hme",
  title =        "Strategic Aspects of Cyber Risk Information Sharing",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "5",
  pages =        "77:1--77:??",
  month =        nov,
  year =         "2017",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3124398",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:00 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cyber risk management largely reduces to a race for
                 information between defenders of ICT systems and
                 attackers. Defenders can gain advantage in this race by
                 sharing cyber risk information with each other. Yet,
                 they often exchange less information than is socially
                 desirable, because sharing decisions are guided by
                 selfish rather than altruistic reasons. A growing line
                 of research studies these strategic aspects that drive
                 defenders' sharing decisions. The present survey
                 systematizes these works in a novel framework. It
                 provides a consolidated understanding of defenders'
                 strategies to privately or publicly share information
                 and enables us to distill trends in the literature and
                 identify future research directions. We reveal that
                 many theoretical works assume cyber risk information
                 sharing to be beneficial, while empirical validations
                 are often missing.",
  acknowledgement = ack-nhfb,
  articleno =    "77",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Santana:2018:SPS,
  author =       "Eduardo Felipe Zambom Santana and Ana Paula Chaves and
                 Marco Aurelio Gerosa and Fabio Kon and Dejan S.
                 Milojicic",
  title =        "Software Platforms for Smart Cities: Concepts,
                 Requirements, Challenges, and a Unified Reference
                 Architecture",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "78:1--78:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3124391",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Information and communication technologies (ICT) can
                 be instrumental in progressing towards smarter city
                 environments, which improve city services,
                 sustainability, and citizens' quality of life. Smart
                 City software platforms can support the development and
                 integration of Smart City applications. However, the
                 ICT community must overcome current technological and
                 scientific challenges before these platforms can be
                 widely adopted. This article surveys the state of the
                 art in software platforms for Smart Cities. We analyzed
                 23 projects concerning the most used enabling
                 technologies, as well as functional and non-functional
                 requirements, classifying them into four categories:
                 Cyber-Physical Systems, Internet of Things, Big Data,
                 and Cloud Computing. Based on these results, we derived
                 a reference architecture to guide the development of
                 next-generation software platforms for Smart Cities.
                 Finally, we enumerated the most frequently cited open
                 research challenges and discussed future opportunities.
                 This survey provides important references to help
                 application developers, city managers, system
                 operators, end-users, and Smart City researchers make
                 project, investment, and research decisions.",
  acknowledgement = ack-nhfb,
  articleno =    "78",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tunali:2018:SFT,
  author =       "Onur Tunali and Mustafa Altun",
  title =        "A Survey of Fault-Tolerance Algorithms for
                 Reconfigurable Nano-Crossbar Arrays",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "79:1--79:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3125641",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Nano-crossbar arrays have emerged as a promising and
                 viable technology to improve computing performance of
                 electronic circuits beyond the limits of current CMOS.
                 Arrays offer both structural efficiency with
                 reconfiguration and prospective capability of
                 integration with different technologies. However,
                 certain problems need to be addressed, and the most
                 important one is the prevailing occurrence of faults.
                 Considering fault rate projections as high as 20\% that
                 is much higher than those of CMOS, it is fair to expect
                 sophisticated fault-tolerance methods. The focus of
                 this survey article is the assessment and evaluation of
                 these methods and related algorithms applied in logic
                 mapping and configuration processes. As a start, we
                 concisely explain reconfigurable nano-crossbar arrays
                 with their fault characteristics and models. Following
                 that, we demonstrate configuration techniques of the
                 arrays in the presence of permanent faults and
                 elaborate on two main fault-tolerance methodologies,
                 namely defect-unaware and defect-aware approaches, with
                 a short review on advantages and disadvantages. For
                 both methodologies, we present detailed experimental
                 results of related algorithms regarding their strengths
                 and weaknesses with a comprehensive yield, success rate
                 and runtime analysis. Next, we overview fault-tolerance
                 approaches for transient faults. As a conclusion, we
                 overview the proposed algorithms with future directions
                 and upcoming challenges.",
  acknowledgement = ack-nhfb,
  articleno =    "79",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tal:2018:TRV,
  author =       "Irina Tal and Gabriel-Miro Muntean",
  title =        "Towards Reasoning Vehicles: a Survey of Fuzzy
                 Logic-Based Solutions in Vehicular Networks",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "80:1--80:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3125640",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Vehicular networks and their associated technologies
                 enable an extremely varied plethora of applications and
                 therefore attract increasing attention from a wide
                 audience. However, vehicular networks also have many
                 challenges that arise mainly due to their dynamic and
                 complex environment. Fuzzy Logic, known for its ability
                 to deal with complexity, imprecision, and model
                 non-deterministic problems, is a very promising
                 technology for use in such a dynamic and complex
                 context. This article presents the first comprehensive
                 survey of research on Fuzzy Logic approaches in the
                 context of vehicular networks, and provides fundamental
                 information which enables readers to design their own
                 Fuzzy Logic systems in this context. As such, this
                 article describes the Fuzzy Logic concepts with
                 emphasis on their implementation in vehicular networks,
                 includes classification and thorough analysis of the
                 Fuzzy Logic-based solutions in vehicular networks, and
                 discusses how Fuzzy Logic could be employed in the
                 context of some of the key research directions in the
                 5G-enabled vehicular networks.",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shi:2018:GPG,
  author =       "Xuanhua Shi and Zhigao Zheng and Yongluan Zhou and Hai
                 Jin and Ligang He and Bo Liu and Qiang-Sheng Hua",
  title =        "Graph Processing on {GPUs}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "81:1--81:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3128571",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the big data era, much real-world data can be
                 naturally represented as graphs. Consequently, many
                 application domains can be modeled as graph processing.
                 Graph processing, especially the processing of the
                 large-scale graphs with the number of vertices and
                 edges in the order of billions or even hundreds of
                 billions, has attracted much attention in both industry
                 and academia. It still remains a great challenge to
                 process such large-scale graphs. Researchers have been
                 seeking for new possible solutions. Because of the
                 massive degree of parallelism and the high memory
                 access bandwidth in GPU, utilizing GPU to accelerate
                 graph processing proves to be a promising solution.
                 This article surveys the key issues of graph processing
                 on GPUs, including data layout, memory access pattern,
                 workload mapping, and specific GPU programming. In this
                 article, we summarize the state-of-the-art research on
                 GPU-based graph processing, analyze the existing
                 challenges in detail, and explore the research
                 opportunities for the future.",
  acknowledgement = ack-nhfb,
  articleno =    "81",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Burns:2018:SRM,
  author =       "Alan Burns and Robert I. Davis",
  title =        "A Survey of Research into Mixed Criticality Systems",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "82:1--82:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3131347",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This survey covers research into mixed criticality
                 systems that has been published since Vestal's seminal
                 paper in 2007, up until the end of 2016. The survey is
                 organised along the lines of the major research areas
                 within this topic. These include single processor
                 analysis (including fixed priority and Earliest
                 Deadline First (EDF) scheduling, shared resources, and
                 static and synchronous scheduling), multiprocessor
                 analysis, realistic models, and systems issues. The
                 survey also explores the relationship between research
                 into mixed criticality systems and other topics such as
                 hard and soft time constraints, fault tolerant
                 scheduling, hierarchical scheduling, cyber physical
                 systems, probabilistic real-time systems, and
                 industrial safety standards.",
  acknowledgement = ack-nhfb,
  articleno =    "82",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Martins:2018:SFH,
  author =       "Paulo Martins and Leonel Sousa and Artur Mariano",
  title =        "A Survey on Fully Homomorphic Encryption: an
                 Engineering Perspective",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "83:1--83:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3124441",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "It is unlikely that a hacker is able to compromise
                 sensitive data that is stored in an encrypted form.
                 However, when data is to be processed, it has to be
                 decrypted, becoming vulnerable to attacks. Homomorphic
                 encryption fixes this vulnerability by allowing one to
                 compute directly on encrypted data. In this survey,
                 both previous and current Somewhat Homomorphic
                 Encryption (SHE) schemes are reviewed, and the more
                 powerful and recent Fully Homomorphic Encryption (FHE)
                 schemes are comprehensively studied. The concepts that
                 support these schemes are presented, and their
                 performance and security are analyzed from an
                 engineering standpoint.",
  acknowledgement = ack-nhfb,
  articleno =    "83",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Torreno:2018:CMA,
  author =       "Alejandro Torre{\~n}o and Eva Onaindia and
                 Anton{\'\i}n Komenda and Michal Stolba",
  title =        "Cooperative Multi-Agent Planning: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "84:1--84:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3128584",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cooperative multi-agent planning (MAP) is a relatively
                 recent research field that combines technologies,
                 algorithms, and techniques developed by the Artificial
                 Intelligence Planning and Multi-Agent Systems
                 communities. While planning has been generally treated
                 as a single-agent task, MAP generalizes this concept by
                 considering multiple intelligent agents that work
                 cooperatively to develop a course of action that
                 satisfies the goals of the group. This article reviews
                 the most relevant approaches to MAP, putting the focus
                 on the solvers that took part in the 2015 Competition
                 of Distributed and Multi-Agent Planning, and classifies
                 them according to their key features and relative
                 performance.",
  acknowledgement = ack-nhfb,
  articleno =    "84",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Yadav:2018:MEH,
  author =       "Pranjul Yadav and Michael Steinbach and Vipin Kumar
                 and Gyorgy Simon",
  title =        "Mining Electronic Health Records {(EHRs)}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "85:1--85:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3127881",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The continuously increasing cost of the US healthcare
                 system has received significant attention. Central to
                 the ideas aimed at curbing this trend is the use of
                 technology in the form of the mandate to implement
                 electronic health records (EHRs). EHRs consist of
                 patient information such as demographics, medications,
                 laboratory test results, diagnosis codes, and
                 procedures. Mining EHRs could lead to improvement in
                 patient health management as EHRs contain detailed
                 information related to disease prognosis for large
                 patient populations. In this article, we provide a
                 structured and comprehensive overview of data mining
                 techniques for modeling EHRs. We first provide a
                 detailed understanding of the major application areas
                 to which EHR mining has been applied and then discuss
                 the nature of EHR data and its accompanying challenges.
                 Next, we describe major approaches used for EHR mining,
                 the metrics associated with EHRs, and the various study
                 designs. With this foundation, we then provide a
                 systematic and methodological organization of existing
                 data mining techniques used to model EHRs and discuss
                 ideas for future research.",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Neal:2018:SST,
  author =       "Tempestt Neal and Kalaivani Sundararajan and Aneez
                 Fatima and Yiming Yan and Yingfei Xiang and Damon
                 Woodard",
  title =        "Surveying Stylometry Techniques and Applications",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "86:1--86:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3132039",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The analysis of authorial style, termed stylometry,
                 assumes that style is quantifiably measurable for
                 evaluation of distinctive qualities. Stylometry
                 research has yielded several methods and tools over the
                 past 200 years to handle a variety of challenging
                 cases. This survey reviews several articles within five
                 prominent subtasks: authorship attribution, authorship
                 verification, authorship profiling, stylochronometry,
                 and adversarial stylometry. Discussions on datasets,
                 features, experimental techniques, and recent
                 approaches are provided. Further, a current research
                 challenge lies in the inability of authorship analysis
                 techniques to scale to a large number of authors with
                 few text samples. Here, we perform an extensive
                 performance analysis on a corpus of 1,000 authors to
                 investigate authorship attribution, verification, and
                 clustering using 14 algorithms from the literature.
                 Finally, several remaining research challenges are
                 discussed, along with descriptions of various
                 open-source and commercial software that may be useful
                 for stylometry subtasks.",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Voronkov:2018:SLR,
  author =       "Artem Voronkov and Leonardo Horn Iwaya and Leonardo A.
                 Martucci and Stefan Lindskog",
  title =        "Systematic Literature Review on Usability of Firewall
                 Configuration",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "87:1--87:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3130876",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Firewalls are network security components that handle
                 incoming and outgoing network traffic based on a set of
                 rules. The process of correctly configuring a firewall
                 is complicated and prone to error, and it worsens as
                 the network complexity grows. A poorly configured
                 firewall may result in major security threats; in the
                 case of a network firewall, an organization's security
                 could be endangered, and in the case of a personal
                 firewall, an individual computer's security is
                 threatened. A major reason for poorly configured
                 firewalls, as pointed out in the literature, is
                 usability issues. Our aim is to identify existing
                 solutions that help professional and non-professional
                 users to create and manage firewall configuration
                 files, and to analyze the proposals in respect of
                 usability. A systematic literature review with a focus
                 on the usability of firewall configuration is presented
                 in the article. Its main goal is to explore what has
                 already been done in this field. In the primary
                 selection procedure, 1,202 articles were retrieved and
                 then screened. The secondary selection led us to 35
                 articles carefully chosen for further investigation, of
                 which 14 articles were selected and summarized. As main
                 contributions, we propose a taxonomy of existing
                 solutions as well as a synthesis and in-depth
                 discussion about the state of the art in firewall
                 usability. Among the main findings, we perceived that
                 there is a lack (or even an absence) of usability
                 evaluation or user studies to validate the proposed
                 models. Although all articles are related to the topic
                 of usability, none of them clearly defines it, and only
                 a few actually employ usability design principles
                 and/or guidelines.",
  acknowledgement = ack-nhfb,
  articleno =    "87",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kavun:2018:SAE,
  author =       "Elif Bilge Kavun and Hristina Mihajloska and Tolga
                 Yal{\c{c}}in",
  title =        "A Survey on Authenticated Encryption--{ASIC}
                 Designer's Perspective",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "88:1--88:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3131276",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "Authenticated encryption (AE) has been a vital
                 operation in cryptography due to its ability to provide
                 confidentiality, integrity, and authenticity at the
                 same time. Its use has soared in parallel with
                 widespread use of the internet and has led to several
                 new schemes. There have been studies investigating
                 software performance of various schemes. However, the
                 same is yet to be done for hardware. We present a
                 comprehensive survey of hardware (specifically ASIC)
                 performance of the most commonly used AE schemes in the
                 literature. These schemes include encrypt-then-MAC
                 combination, block-cipher-based AE modes, and the
                 recently introduced permutation-based AE scheme. For
                 completeness, we implemented each scheme with various
                 standardized block ciphers and/or hash algorithms, and
                 their lightweight versions. Our evaluation targets
                 minimizing the time-area product while maximizing the
                 throughput on an ASIC platform. We used 45nm NANGATE
                 Open Cell Library for syntheses. We present area,
                 speed, time-area product, throughput, and power figures
                 for both standard and lightweight versions of each
                 scheme. We also provide an unbiased discussion on the
                 impact of the structure and complexity of each scheme
                 on hardware implementation. Our results reveal
                 13\%--30\% performance boost in permutation-based AE
                 compared to conventional schemes, and they can be used
                 as a benchmark in the ongoing AE competition CAESAR.",
  acknowledgement = ack-nhfb,
  articleno =    "88",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Werner:2018:SON,
  author =       "Sebastian Werner and Javier Navaridas and Mikel
                 Luj{\'a}n",
  title =        "A Survey on Optical Network-on-Chip Architectures",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "89:1--89:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3131346",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Optical on-chip data transmission enabled by silicon
                 photonics (SiP) is widely considered a key technology
                 to overcome the bandwidth and energy limitations of
                 electrical interconnects. The possibility of
                 integrating optical links into the on-chip
                 communication fabric has opened up a fascinating new
                 research field-Optical Networks-on-Chip (ONoCs)-which
                 has been gaining large interest by the community. SiP
                 devices and materials, however, are still evolving, and
                 dealing with optical data transmission on chip makes
                 designers and researchers face a whole new set of
                 obstacles and challenges. Designing efficient ONoCs is
                 a challenging task and requires a detailed knowledge
                 from on-chip traffic demands and patterns down to the
                 physical layout and implications of integrating both
                 electronic and photonic devices. In this paper, we
                 provide an exhaustive review of recently proposed ONoC
                 architectures, discuss their strengths and weaknesses,
                 and outline active research areas. Moreover, we discuss
                 recent research efforts in key enabling technologies,
                 such as on-chip and adaptive laser sources, automatic
                 synthesis tools, and ring heating techniques, which are
                 essential to enable a widespread commercial adoption of
                 ONoCs in the future.",
  acknowledgement = ack-nhfb,
  articleno =    "89",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hooshyar:2018:DDA,
  author =       "Danial Hooshyar and Moslem Yousefi and Heuiseok Lim",
  title =        "Data-Driven Approaches to Game Player Modeling: a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "90:1--90:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3145814",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Modeling and predicting player behavior is of the
                 utmost importance in developing games. Experience has
                 proven that, while theory-driven approaches are able to
                 comprehend and justify a model's choices, such models
                 frequently fail to encompass necessary features because
                 of a lack of insight of the model builders. In
                 contrast, data-driven approaches rely much less on
                 expertise, and thus offer certain potential advantages.
                 Hence, this study conducts a systematic review of the
                 extant research on data-driven approaches to game
                 player modeling. To this end, we have assessed
                 experimental studies of such approaches over a
                 nine-year period, from 2008 to 2016; this survey
                 yielded 46 research studies of significance. We found
                 that these studies pertained to three main areas of
                 focus concerning the uses of data-driven approaches in
                 game player modeling. One research area involved the
                 objectives of data-driven approaches in game player
                 modeling: behavior modeling and goal recognition.
                 Another concerned methods: classification, clustering,
                 regression, and evolutionary algorithm. The third was
                 comprised of the current challenges and promising
                 research directions for data-driven approaches in game
                 player modeling.",
  acknowledgement = ack-nhfb,
  articleno =    "90",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mansouri:2018:DSM,
  author =       "Yaser Mansouri and Adel Nadjaran Toosi and Rajkumar
                 Buyya",
  title =        "Data Storage Management in Cloud Environments:
                 Taxonomy, Survey, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "91:1--91:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3136623",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Storage as a Service (StaaS) is a vital component of
                 cloud computing by offering the vision of a virtually
                 infinite pool of storage resources. It supports a
                 variety of cloud-based data store classes in terms of
                 availability, scalability, ACID (Atomicity,
                 Consistency, Isolation, Durability) properties, data
                 models, and price options. Application providers deploy
                 these storage classes across different cloud-based data
                 stores not only to tackle the challenges arising from
                 reliance on a single cloud-based data store but also to
                 obtain higher availability, lower response time, and
                 more cost efficiency. Hence, in this article, we first
                 discuss the key advantages and challenges of
                 data-intensive applications deployed within and across
                 cloud-based data stores. Then, we provide a
                 comprehensive taxonomy that covers key aspects of
                 cloud-based data store: data model, data dispersion,
                 data consistency, data transaction service, and data
                 management cost. Finally, we map various cloud-based
                 data stores projects to our proposed taxonomy to
                 validate the taxonomy and identify areas for future
                 research.",
  acknowledgement = ack-nhfb,
  articleno =    "91",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shrestha:2018:ODE,
  author =       "Prakash Shrestha and Nitesh Saxena",
  title =        "An Offensive and Defensive Exposition of Wearable
                 Computing",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "92:1--92:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3133837",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Wearable computing is rapidly getting deployed in
                 many-commercial, medical, and personal-domains of
                 day-to-day life. Wearable devices appear in various
                 forms, shapes, and sizes and facilitate a wide variety
                 of applications in many domains of life. However,
                 wearables raise unique security and privacy concerns.
                 Wearables also hold the promise to help enhance the
                 existing security, privacy, and safety paradigms in
                 unique ways while preserving the system's usability.
                 The contribution of this research literature survey is
                 threefold. First, as a background, we identify a wide
                 range of existing as well as upcoming wearable devices
                 and investigate their broad applications. Second, we
                 provide an exposition of the security and privacy of
                 wearable computing, studying dual aspects, that is,
                 both attacks and defenses. Third, we provide a
                 comprehensive study of the potential security, privacy,
                 and safety enhancements to existing systems based on
                 the emergence of wearable technology. Although several
                 research works have emerged exploring different
                 offensive and defensive uses of wearables, there is a
                 lack of a broad and precise literature review
                 systematizing all those security and privacy aspects
                 and the underlying threat models. This research survey
                 also analyzes current and emerging research trends and
                 provides directions for future research.",
  acknowledgement = ack-nhfb,
  articleno =    "92",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{VanBerkel:2018:ESM,
  author =       "Niels {Van Berkel} and Denzil Ferreira and Vassilis
                 Kostakos",
  title =        "The Experience Sampling Method on Mobile Devices",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "93:1--93:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3123988",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Experience Sampling Method (ESM) is used by
                 scientists from various disciplines to gather insights
                 into the intra-psychic elements of human life.
                 Researchers have used the ESM in a wide variety of
                 studies, with the method seeing increased popularity.
                 Mobile technologies have enabled new possibilities for
                 the use of the ESM, while simultaneously leading to new
                 conceptual, methodological, and technological
                 challenges. In this survey, we provide an overview of
                 the history of the ESM, usage of this methodology in
                 the computer science discipline, as well as its
                 evolution over time. Next, we identify and discuss
                 important considerations for ESM studies on mobile
                 devices, and analyse the particular methodological
                 parameters scientists should consider in their study
                 design. We reflect on the existing tools that support
                 the ESM methodology and discuss the future development
                 of such tools. Finally, we discuss the effect of future
                 technological developments on the use of the ESM and
                 identify areas requiring further investigation.",
  acknowledgement = ack-nhfb,
  articleno =    "93",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:2018:FSD,
  author =       "Jundong Li and Kewei Cheng and Suhang Wang and Fred
                 Morstatter and Robert P. Trevino and Jiliang Tang and
                 Huan Liu",
  title =        "Feature Selection: a Data Perspective",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "94:1--94:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3136625",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Feature selection, as a data preprocessing strategy,
                 has been proven to be effective and efficient in
                 preparing data (especially high-dimensional data) for
                 various data-mining and machine-learning problems. The
                 objectives of feature selection include building
                 simpler and more comprehensible models, improving
                 data-mining performance, and preparing clean,
                 understandable data. The recent proliferation of big
                 data has presented some substantial challenges and
                 opportunities to feature selection. In this survey, we
                 provide a comprehensive and structured overview of
                 recent advances in feature selection research.
                 Motivated by current challenges and opportunities in
                 the era of big data, we revisit feature selection
                 research from a data perspective and review
                 representative feature selection algorithms for
                 conventional data, structured data, heterogeneous data
                 and streaming data. Methodologically, to emphasize the
                 differences and similarities of most existing feature
                 selection algorithms for conventional data, we
                 categorize them into four main groups:
                 similarity-based, information-theoretical-based,
                 sparse-learning-based, and statistical-based methods.
                 To facilitate and promote the research in this
                 community, we also present an open source feature
                 selection repository that consists of most of the
                 popular feature selection algorithms
                 (http://featureselection.asu.edu/). Also, we use it as
                 an example to show how to evaluate feature selection
                 algorithms. At the end of the survey, we present a
                 discussion about some open problems and challenges that
                 require more attention in future research.",
  acknowledgement = ack-nhfb,
  articleno =    "94",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Uurtio:2018:TCC,
  author =       "Viivi Uurtio and Jo{\~a}o M. Monteiro and Jaz Kandola
                 and John Shawe-Taylor and Delmiro Fernandez-Reyes and
                 Juho Rousu",
  title =        "A Tutorial on Canonical Correlation Methods",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "95:1--95:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3136624",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Canonical correlation analysis is a family of
                 multivariate statistical methods for the analysis of
                 paired sets of variables. Since its proposition,
                 canonical correlation analysis has, for instance, been
                 extended to extract relations between two sets of
                 variables when the sample size is insufficient in
                 relation to the data dimensionality, when the relations
                 have been considered to be non-linear, and when the
                 dimensionality is too large for human interpretation.
                 This tutorial explains the theory of canonical
                 correlation analysis, including its regularised,
                 kernel, and sparse variants. Additionally, the deep and
                 Bayesian CCA extensions are briefly reviewed. Together
                 with the numerical examples, this overview provides a
                 coherent compendium on the applicability of the
                 variants of canonical correlation analysis. By bringing
                 together techniques for solving the optimisation
                 problems, evaluating the statistical significance and
                 generalisability of the canonical correlation model,
                 and interpreting the relations, we hope that this
                 article can serve as a hands-on tool for applying
                 canonical correlation methods in data analysis.",
  acknowledgement = ack-nhfb,
  articleno =    "95",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Skarbez:2018:SPR,
  author =       "Richard Skarbez and Frederick P. {Brooks, Jr.} and
                 Mary C. Whitton",
  title =        "A Survey of Presence and Related Concepts",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "96:1--96:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3134301",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The presence construct, most commonly defined as the
                 sense of ``being there,'' has driven research and
                 development of virtual environments (VEs) for decades.
                 Despite that, there is not widespread agreement on how
                 to define or operationalize this construct. The
                 literature contains many different definitions of
                 presence and many proposed measures for it. This
                 article reviews many of the definitions, measures, and
                 models of presence from the literature. We also review
                 several related constructs, including social presence,
                 copresence, immersion, agency, transportation, reality
                 judgment, and embodiment. In addition, we present a
                 meta-analysis of existing presence models and propose a
                 model of presence informed by Slater's Place Illusion
                 and Plausibility Illusion constructs.",
  acknowledgement = ack-nhfb,
  articleno =    "96",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{He:2018:GSB,
  author =       "Suining He and Kang G. Shin",
  title =        "Geomagnetism for {Smartphone}-Based Indoor
                 Localization: Challenges, Advances, and Comparisons",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "97:1--97:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3139222",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Geomagnetism has recently attracted considerable
                 attention for indoor localization due to its
                 pervasiveness and independence from extra
                 infrastructure. Its location signature has been
                 observed to be temporally stable and spatially
                 discernible for localization purposes. This survey
                 examines and analyzes the recent challenges and
                 advances in geomagnetism-based indoor localization
                 using smartphones. We first study smartphone-based
                 geomagnetism measurements. We then review recent
                 efforts in database construction and computation
                 reduction, followed by state-of-the-art schemes in
                 localizing the target. For each category, we identify
                 practical deployment challenges and compare related
                 studies. Finally, we summarize future directions and
                 provide a guideline for new researchers in this
                 field.",
  acknowledgement = ack-nhfb,
  articleno =    "97",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mertz:2018:UAL,
  author =       "Jhonny Mertz and Ingrid Nunes",
  title =        "Understanding Application-Level Caching in {Web}
                 Applications: a Comprehensive Introduction and Survey
                 of State-of-the-Art Approaches",
  journal =      j-COMP-SURV,
  volume =       "50",
  number =       "6",
  pages =        "98:1--98:??",
  month =        jan,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3145813",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jan 20 09:25:01 MST 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A new form of caching, namely application-level
                 caching, has been recently employed in web applications
                 to improve their performance and increase scalability.
                 It consists of the insertion of caching logic into the
                 application base code to temporarily store processed
                 content in memory and then decrease the response time
                 of web requests by reusing this content. However,
                 caching at this level demands knowledge of the domain
                 and application specificities to achieve caching
                 benefits, given that this information supports
                 decisions such as what and when to cache content.
                 Developers thus must manually manage the cache,
                 possibly with the help of existing libraries and
                 frameworks. Given the increasing popularity of
                 application-level caching, we thus provide a survey of
                 approaches proposed in this context. We provide a
                 comprehensive introduction to web caching and
                 application-level caching, and present state-of-the-art
                 work on designing, implementing, and managing
                 application-level caching. Our focus is not only on
                 static solutions but also approaches that adaptively
                 adjust caching solutions to avoid the gradual
                 performance decay that caching can suffer over time.
                 This survey can be used as a start point for
                 researchers and developers, who aim to improve
                 application-level caching or need guidance in designing
                 application-level caching solutions, possibly with
                 humans out-of-the-loop.",
  acknowledgement = ack-nhfb,
  articleno =    "98",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Betzel:2018:ACT,
  author =       "Filipe Betzel and Karen Khatamifard and Harini Suresh
                 and David J. Lilja and John Sartori and Ulya Karpuzcu",
  title =        "Approximate Communication: Techniques for Reducing
                 Communication Bottlenecks in Large-Scale Parallel
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "1:1--1:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3145812",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
  abstract =     "Approximate computing has gained research attention
                 recently as a way to increase energy efficiency and/or
                 performance by exploiting some applications' intrinsic
                 error resiliency. However, little attention has been
                 given to its potential for tackling the communication
                 bottleneck that remains one of the looming challenges
                 to be tackled for efficient parallelism. This article
                 explores the potential benefits of approximate
                 computing for communication reduction by surveying
                 three promising techniques for approximate
                 communication: compression, relaxed synchronization,
                 and value prediction. The techniques are compared based
                 on an evaluation framework composed of communication
                 cost reduction, performance, energy reduction,
                 applicability, overheads, and output degradation.
                 Comparison results demonstrate that lossy link
                 compression and approximate value prediction show great
                 promise for reducing the communication bottleneck in
                 bandwidth-constrained applications. Meanwhile, relaxed
                 synchronization is found to provide large speedups for
                 select error-tolerant applications, but suffers from
                 limited general applicability and unreliable output
                 degradation guarantees. Finally, this article concludes
                 with several suggestions for future research on
                 approximate communication techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sturdee:2018:ACS,
  author =       "Miriam Sturdee and Jason Alexander",
  title =        "Analysis and Classification of Shape-Changing
                 Interfaces for Design and Application-based Research",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "2:1--2:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3143559",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Shape-changing interfaces are physically tangible,
                 interactive devices, surfaces, or spaces that allow for
                 rich, organic, and novel experiences with computational
                 devices. Over the last 15 years, research has produced
                 functional prototypes over many use applications;
                 reviews have identified themes and possible future
                 directions but have not yet looked at possible design
                 or application-based research. Here, we gather this
                 information together to provide a reference for
                 designers and researchers wishing to build upon
                 existing prototyping work, using synthesis and
                 discussion of existing shape-changing interface reviews
                 and comprehensive analysis and classification of 84
                 shape-changing interfaces. Eight categories of
                 prototype are identified alongside recommendations for
                 the field.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wasik:2018:SOJ,
  author =       "Szymon Wasik and Maciej Antczak and Jan Badura and
                 Artur Laskowski and Tomasz Sternal",
  title =        "A Survey on Online Judge Systems and Their
                 Applications",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "3:1--3:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3143560",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Online judges are systems designed for the reliable
                 evaluation of algorithm source code submitted by users,
                 which is next compiled and tested in a homogeneous
                 environment. Online judges are becoming popular in
                 various applications. Thus, we would like to review the
                 state of the art for these systems. We classify them
                 according to their principal objectives into systems
                 supporting organization of competitive programming
                 contests, enhancing education and recruitment
                 processes, facilitating the solving of data mining
                 challenges, online compilers and development platforms
                 integrated as components of other custom systems.
                 Moreover, we introduce a formal definition of an online
                 judge system and summarize the common evaluation
                 methodology supported by such systems. Finally, we
                 briefly discuss an Optil.io platform as an example of
                 an online judge system, which has been proposed for the
                 solving of complex optimization problems. We also
                 analyze the competition results conducted using this
                 platform. The competition proved that online judge
                 systems, strengthened by crowdsourcing concepts, can be
                 successfully applied to accurately and efficiently
                 solve complex industrial- and science-driven
                 challenges.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chen:2018:MTR,
  author =       "Tsong Yueh Chen and Fei-Ching Kuo and Huai Liu and
                 Pak-Lok Poon and Dave Towey and T. H. Tse and Zhi Quan
                 Zhou",
  title =        "Metamorphic Testing: a Review of Challenges and
                 Opportunities",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "4:1--4:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3143561",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Metamorphic testing is an approach to both test case
                 generation and test result verification. A central
                 element is a set of metamorphic relations, which are
                 necessary properties of the target function or
                 algorithm in relation to multiple inputs and their
                 expected outputs. Since its first publication, we have
                 witnessed a rapidly increasing body of work examining
                 metamorphic testing from various perspectives,
                 including metamorphic relation identification, test
                 case generation, integration with other software
                 engineering techniques, and the validation and
                 evaluation of software systems. In this article, we
                 review the current research of metamorphic testing and
                 discuss the challenges yet to be addressed. We also
                 present visions for further improvement of metamorphic
                 testing and highlight opportunities for new research.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Obaidellah:2018:SUE,
  author =       "Unaizah Obaidellah and Mohammed {Al Haek} and Peter
                 C.-H. Cheng",
  title =        "A Survey on the Usage of Eye-Tracking in Computer
                 Programming",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "5:1--5:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3145904",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/java2010.bib",
  abstract =     "Traditional quantitative research methods of data
                 collection in programming, such as questionnaires and
                 interviews, are the most common approaches for
                 researchers in this field. However, in recent years,
                 eye-tracking has been on the rise as a new method of
                 collecting evidence of visual attention and the
                 cognitive process of programmers. Eye-tracking has been
                 used by researchers in the field of programming to
                 analyze and understand a variety of tasks such as
                 comprehension and debugging. In this article, we will
                 focus on reporting how experiments that used
                 eye-trackers in programming research are conducted, and
                 the information that can be collected from these
                 experiments. In this mapping study, we identify and
                 report on 63 studies, published between 1990 and June
                 2017, collected and gathered via manual search on
                 digital libraries and databases related to computer
                 science and computer engineering. Among the five main
                 areas of research interest are program comprehension
                 and debugging, which received an increased interest in
                 recent years, non-code comprehension, collaborative
                 programming, and requirements traceability research,
                 which had the fewest number of publications due to
                 possible limitations of the eye-tracking technology in
                 this type of experiments. We find that most of the
                 participants in these studies were students and faculty
                 members from institutions of higher learning, and while
                 they performed programming tasks on a range of
                 programming languages and programming representations,
                 we find Java language and Unified Modeling Language
                 (UML) representation to be the most used materials. We
                 also report on a range of eye-trackers and attention
                 tracking tools that have been utilized, and find Tobii
                 eye-trackers to be the most used devices by
                 researchers.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Paci:2018:SAC,
  author =       "Federica Paci and Anna Squicciarini and Nicola
                 Zannone",
  title =        "Survey on Access Control for Community-Centered
                 Collaborative Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "6:1--6:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3146025",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The last decades have seen a growing interest and
                 demand for community-centered collaborative systems and
                 platforms. These systems and platforms aim to provide
                 an environment in which users can collaboratively
                 create, share, and manage resources. While offering
                 attractive opportunities for online collaboration and
                 information sharing, they also open several security
                 and privacy issues. This has attracted several research
                 efforts toward the design and implementation of novel
                 access control solutions that can handle the complexity
                 introduced by collaboration. Despite these efforts,
                 transition to practice has been hindered by the lack of
                 maturity of the proposed solutions. The access control
                 mechanisms typically adopted by commercial
                 collaborative systems like online social network
                 websites and collaborative editing platforms, are still
                 rather rudimentary and do not provide users with a
                 sufficient control over their resources. This survey
                 examines the growing literature on access control for
                 collaborative systems centered on communities, and
                 identifies the main challenges to be addressed in order
                 to facilitate the adoption of collaborative access
                 control solutions in real-life settings. Based on the
                 literature study, we delineate a roadmap for future
                 research in the area of access control for
                 community-centered collaborative systems.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Daniel:2018:QCC,
  author =       "Florian Daniel and Pavel Kucherbaev and Cinzia
                 Cappiello and Boualem Benatallah and Mohammad
                 Allahbakhsh",
  title =        "Quality Control in Crowdsourcing: a Survey of Quality
                 Attributes, Assessment Techniques, and Assurance
                 Actions",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "7:1--7:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3148148",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Crowdsourcing enables one to leverage on the
                 intelligence and wisdom of potentially large groups of
                 individuals toward solving problems. Common problems
                 approached with crowdsourcing are labeling images,
                 translating or transcribing text, providing opinions or
                 ideas, and similar-all tasks that computers are not
                 good at or where they may even fail altogether. The
                 introduction of humans into computations and/or
                 everyday work, however, also poses critical, novel
                 challenges in terms of quality control, as the crowd is
                 typically composed of people with unknown and very
                 diverse abilities, skills, interests, personal
                 objectives, and technological resources. This survey
                 studies quality in the context of crowdsourcing along
                 several dimensions, so as to define and characterize it
                 and to understand the current state of the art.
                 Specifically, this survey derives a quality model for
                 crowdsourcing tasks, identifies the methods and
                 techniques that can be used to assess the attributes of
                 the model, and the actions and strategies that help
                 prevent and mitigate quality problems. An analysis of
                 how these features are supported by the state of the
                 art further identifies open issues and informs an
                 outlook on hot future research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Netto:2018:HCS,
  author =       "Marco A. S. Netto and Rodrigo N. Calheiros and Eduardo
                 R. Rodrigues and Renato L. F. Cunha and Rajkumar
                 Buyya",
  title =        "{HPC} Cloud for Scientific and Business Applications:
                 Taxonomy, Vision, and Research Challenges",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "8:1--8:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3150224",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "High performance computing (HPC) clouds are becoming
                 an alternative to on-premise clusters for executing
                 scientific applications and business analytics
                 services. Most research efforts in HPC cloud aim to
                 understand the cost benefit of moving
                 resource-intensive applications from on-premise
                 environments to public cloud platforms. Industry trends
                 show that hybrid environments are the natural path to
                 get the best of the on-premise and cloud
                 resources-steady (and sensitive) workloads can run on
                 on-premise resources and peak demand can leverage
                 remote resources in a pay-as-you-go manner.
                 Nevertheless, there are plenty of questions to be
                 answered in HPC cloud, which range from how to extract
                 the best performance of an unknown underlying platform
                 to what services are essential to make its usage
                 easier. Moreover, the discussion on the right pricing
                 and contractual models to fit small and large users is
                 relevant for the sustainability of HPC clouds. This
                 article brings a survey and taxonomy of efforts in HPC
                 cloud and a vision on what we believe is ahead of us,
                 including a set of research challenges that, once
                 tackled, can help advance businesses and scientific
                 discoveries. This becomes particularly relevant due to
                 the fast increasing wave of new HPC applications coming
                 from big data and artificial intelligence.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Khalastchi:2018:FDD,
  author =       "Eliahu Khalastchi and Meir Kalech",
  title =        "On Fault Detection and Diagnosis in Robotic Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "9:1--9:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3146389",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The use of robots in our daily lives is increasing.
                 Different types of robots perform different tasks that
                 are too dangerous or too dull to be done by humans.
                 These sophisticated machines are susceptible to
                 different types of faults. These faults have to be
                 detected and diagnosed in time to allow recovery and
                 continuous operation. The field of Fault Detection and
                 Diagnosis (FDD) has been studied for many years. This
                 research has given birth to many approaches and
                 techniques that are applicable to different types of
                 physical machines. Yet the domain of robotics poses
                 unique requirements that are very challenging for
                 traditional FDD approaches. The study of FDD for
                 robotics is relatively new, and only few surveys were
                 presented. These surveys have focused on traditional
                 FDD approaches and how these approaches may broadly
                 apply to a generic type of robot. Yet robotic systems
                 can be identified by fundamental characteristics, which
                 pose different constraints and requirements from FDD.
                 In this article, we aim to provide the reader with
                 useful insights regarding the use of FDD approaches
                 that best suit the different characteristics of robotic
                 systems. We elaborate on the advantages these
                 approaches have and the challenges they must face. To
                 meet this aim, we use two perspectives: (1) we
                 elaborate on FDD from the perspective of the different
                 characteristics a robotic system may have and give
                 examples of successful FDD approaches, and (2) we
                 elaborate on FDD from the perspective of the different
                 FDD approaches and analyze the advantages and
                 disadvantages of each approach with respect to robotic
                 systems. Finally, we describe research opportunities
                 for robotic systems' FDD. With these three
                 contributions, readers from the FDD research
                 communities are introduced to FDD for robotic systems,
                 and the robotics research community is introduced to
                 the field of FDD.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pouyanfar:2018:MBD,
  author =       "Samira Pouyanfar and Yimin Yang and Shu-Ching Chen and
                 Mei-Ling Shyu and S. S. Iyengar",
  title =        "Multimedia Big Data Analytics: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "10:1--10:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3150226",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "With the proliferation of online services and mobile
                 technologies, the world has stepped into a multimedia
                 big data era. A vast amount of research work has been
                 done in the multimedia area, targeting different
                 aspects of big data analytics, such as the capture,
                 storage, indexing, mining, and retrieval of multimedia
                 big data. However, very few research work provides a
                 complete survey of the whole pine-line of the
                 multimedia big data analytics, including the management
                 and analysis of the large amount of data, the
                 challenges and opportunities, and the promising
                 research directions. To serve this purpose, we present
                 this survey, which conducts a comprehensive overview of
                 the state-of-the-art research work on multimedia big
                 data analytics. It also aims to bridge the gap between
                 multimedia challenges and big data solutions by
                 providing the current big data frameworks, their
                 applications in multimedia analyses, the strengths and
                 limitations of the existing methods, and the potential
                 future directions in multimedia big data analytics. To
                 the best of our knowledge, this is the first survey
                 that targets the most recent multimedia management
                 techniques for very large-scale data and also provides
                 the research studies and technologies advancing the
                 multimedia analyses in this big data era.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gritzalis:2018:ERA,
  author =       "Dimitris Gritzalis and Giulia Iseppi and Alexios
                 Mylonas and Vasilis Stavrou",
  title =        "Exiting the Risk Assessment Maze: a Meta-Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "11:1--11:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3145905",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Organizations are exposed to threats that increase the
                 risk factor of their ICT systems. The assurance of
                 their protection is crucial, as their reliance on
                 information technology is a continuing challenge for
                 both security experts and chief executives. As risk
                 assessment could be a necessary process in an
                 organization, one of its deliverables could be utilized
                 in addressing threats and thus facilitate the
                 development of a security strategy. Given the large
                 number of heterogeneous methods and risk assessment
                 tools that exist, comparison criteria can provide
                 better understanding of their options and
                 characteristics and facilitate the selection of a
                 method that best fits an organization's needs. This
                 article aims to address the problem of selecting an
                 appropriate risk assessment method to assess and manage
                 information security risks, by proposing a set of
                 comparison criteria, grouped into four categories.
                 Based upon them, it provides a comparison of the 10
                 popular risk assessment methods that could be utilized
                 by organizations to determine the method that is more
                 suitable for their needs. Finally, a case study is
                 presented to demonstrate the selection of a method
                 based on the proposed criteria.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nashat:2018:CTF,
  author =       "Dalia Nashat and Ali A. Amer",
  title =        "A Comprehensive Taxonomy of Fragmentation and
                 Allocation Techniques in Distributed Database Design",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "12:1--12:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3150223",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The need to design an optimally distributed database
                 is increasingly important with the growth of
                 information technology and computer networks. However,
                 designing a distributed database is an extremely
                 complex process due to a large number of geographically
                 distributed sites and database relations. Moreover,
                 decreasing communication costs and query response time
                 should be taken into consideration. There are three
                 main techniques applied to design a distributed
                 database, namely Fragmentation, Data allocation, and
                 Replication. It is notable that these techniques are
                 often treated separately and rarely processed together.
                 Some available allocation methods are applied
                 regardless of how the fragmentation technique is
                 performed or replication process is adopted. In
                 contrast, other fragmentation techniques do not
                 consider the allocation or the replication techniques.
                 Therefore, the first and foremost step for designing an
                 optimal database is to develop a comprehensive
                 understanding of the current fragmentation,
                 replication, and allocation techniques and their
                 disadvantages. This article presents an attempt to
                 fulfill this step by proposing a comprehensive taxonomy
                 of the available fragmentation and allocation
                 techniques in distributed database design. The article
                 also discusses some case studies of these techniques
                 for a deeper understanding of its achievements and
                 limitations.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhou:2018:ATM,
  author =       "Bowen Zhou and Rajkumar Buyya",
  title =        "Augmentation Techniques for Mobile Cloud Computing: a
                 Taxonomy, Survey, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "13:1--13:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3152397",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Despite the rapid growth of hardware capacity and
                 popularity in mobile devices, limited resources in
                 battery and processing capacity still lack the ability
                 to meet increasing mobile users' demands. Both
                 conventional techniques and emerging approaches are
                 brought together to fill this gap between user demand
                 and mobile devices' limited capabilities. Recent
                 research has focused on enhancing the performance of
                 mobile devices via augmentation techniques.
                 Augmentation techniques for mobile cloud computing
                 refer to the computing paradigms and solutions to
                 outsource mobile device computation and storage to more
                 powerful computing resources in order to enhance a
                 mobile device's computing capability and energy
                 efficiency (e.g., code offloading). Adopting
                 augmentation techniques in the heterogeneous and
                 intermittent mobile cloud computing environment creates
                 new challenges for computation management, energy
                 efficiency, and system reliability. In this article, we
                 aim to provide a comprehensive taxonomy and survey of
                 the existing techniques and frameworks for mobile cloud
                 augmentation regarding both computation and storage.
                 Different from the existing taxonomies in this field,
                 we focus on the techniques aspect, following the idea
                 of realizing a complete mobile cloud computing system.
                 The objective of this survey is to provide a guide on
                 what available augmentation techniques can be adopted
                 in mobile cloud computing systems as well as supporting
                 mechanisms such as decision-making and fault tolerance
                 policies for realizing reliable mobile cloud services.
                 We also present a discussion on the open challenges and
                 future research directions in this field.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Marvel:2018:MRA,
  author =       "Jeremy A. Marvel and Roger Bostelman and Joe Falco",
  title =        "Multi-Robot Assembly Strategies and Metrics",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "14:1--14:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3150225",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "We present a survey of multi-robot assembly
                 applications and methods and describe trends and
                 general insights into the multi-robot assembly problem
                 for industrial applications. We focus on fixtureless
                 assembly strategies featuring two or more robotic
                 systems. Such robotic systems include industrial robot
                 arms, dexterous robotic hands, and autonomous mobile
                 platforms, such as automated guided vehicles. In this
                 survey, we identify the types of assemblies that are
                 enabled by utilizing multiple robots, the algorithms
                 that synchronize the motions of the robots to complete
                 the assembly operations, and the metrics used to assess
                 the quality and performance of the assemblies.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gaziel-Yablowitz:2018:RAF,
  author =       "Michal Gaziel-Yablowitz and David G. Schwartz",
  title =        "A Review and Assessment Framework for Mobile-Based
                 Emergency Intervention Apps",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "15:1--15:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3145846",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Smartphone applications to support healthcare are
                 proliferating. A growing and important subset of these
                 apps supports emergency medical intervention to address
                 a wide range of illness-related emergencies to speed
                 the arrival of relevant treatment. The emergency
                 response characteristics and strategies employed by
                 these apps are the focus of this study, resulting in an
                 mHealth Emergency Strategy Index. While a growing body
                 of knowledge focuses on usability, safety, and privacy
                 aspects that characterize such apps, studies that map
                 the various emergency intervention strategies and
                 suggest assessment indicators to evaluate their role as
                 emergency agents are limited. We survey an extensive
                 range of mHealth apps designed for emergency response
                 along with the related assessment literature and
                 present an index for mobile-based medical emergency
                 intervention apps that can address future assessment
                 needs of mHealth apps.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Al-Garadi:2018:AOS,
  author =       "Mohammed Ali Al-Garadi and Kasturi Dewi Varathan and
                 Sri Devi Ravana and Ejaz Ahmed and Ghulam Mujtaba and
                 Muhammad Usman Shahid Khan and Samee U. Khan",
  title =        "Analysis of Online Social Network Connections for
                 Identification of Influential Users: Survey and Open
                 Research Issues",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "16:1--16:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3155897",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Online social networks (OSNs) are structures that help
                 users to interact, exchange, and propagate new ideas.
                 The identification of the influential users in OSNs is
                 a significant process for accelerating the propagation
                 of information that includes marketing applications or
                 hindering the dissemination of unwanted contents, such
                 as viruses, negative online behaviors, and rumors. This
                 article presents a detailed survey of influential
                 users' identification algorithms and their performance
                 evaluation approaches in OSNs. The survey covers recent
                 techniques, applications, and open research issues on
                 analysis of OSN connections for identification of
                 influential users.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Monperrus:2018:ASR,
  author =       "Martin Monperrus",
  title =        "Automatic Software Repair: a Bibliography",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "17:1--17:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3105906",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article presents a survey on automatic software
                 repair. Automatic software repair consists of
                 automatically finding a solution to software bugs
                 without human intervention. This article considers all
                 kinds of repairs. First, it discusses behavioral repair
                 where test suites, contracts, models, and crashing
                 inputs are taken as oracle. Second, it discusses state
                 repair, also known as runtime repair or runtime
                 recovery, with techniques such as checkpoint and
                 restart, reconfiguration, and invariant restoration.
                 The uniqueness of this article is that it spans the
                 research communities that contribute to this body of
                 knowledge: software engineering, dependability,
                 operating systems, programming languages, and security.
                 It provides a novel and structured overview of the
                 diversity of bug oracles and repair operators used in
                 the literature.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ding:2018:OSA,
  author =       "Zhijun Ding and Xiaolun Li and Changjun Jiang and
                 Mengchu Zhou",
  title =        "Objectives and State-of-the-Art of Location-Based
                 Social Network Recommender Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "18:1--18:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3154526",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Because of the widespread adoption of GPS-enabled
                 devices, such as smartphones and GPS navigation
                 devices, more and more location information is being
                 collected and available. Compared with traditional ones
                 (e.g., Amazon, Taobao, and Dangdang), recommender
                 systems built on location-based social networks (LBSNs)
                 have received much attention. The former mine users'
                 preferences through the relationship between users and
                 items, e.g., online commodity, movies and music. The
                 latter add location information as a new dimension to
                 the former, hence resulting in a three-dimensional
                 relationship among users, locations, and activities. In
                 this article, we summarize LBSN recommender systems
                 from the perspective of such a relationship. User,
                 activity, and location are called objects, and
                 recommender objectives are formed and achieved by
                 mining and using such 3D relationships. From the
                 perspective of the 3D relationship among these objects,
                 we summarize the state-of-the-art of LBSN recommender
                 systems to fulfill the related objectives. We finally
                 indicate some future research directions in this
                 area.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Coutinho:2018:UWS,
  author =       "Rodolfo W. L. Coutinho and Azzedine Boukerche and Luiz
                 F. M. Vieira and Antonio A. F. Loureiro",
  title =        "Underwater Wireless Sensor Networks: a New Challenge
                 for Topology Control-Based Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "19:1--19:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3154834",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Underwater wireless sensor networks (UWSNs) will pave
                 the way for a new era of underwater monitoring and
                 actuation applications. The envisioned landscape of
                 UWSN applications will help us learn more about our
                 oceans, as well as about what lies beneath them. They
                 are expected to change the current reality where no
                 more than 5\% of the volume of the oceans has been
                 observed by humans. However, to enable large
                 deployments of UWSNs, networking solutions toward
                 efficient and reliable underwater data collection need
                 to be investigated and proposed. In this context, the
                 use of topology control algorithms for a suitable,
                 autonomous, and on-the-fly organization of the UWSN
                 topology might mitigate the undesired effects of
                 underwater wireless communications and consequently
                 improve the performance of networking services and
                 protocols designed for UWSNs. This article presents and
                 discusses the intrinsic properties, potentials, and
                 current research challenges of topology control in
                 underwater sensor networks. We propose to classify
                 topology control algorithms based on the principal
                 methodology used to change the network topology. They
                 can be categorized in three major groups: power
                 control, wireless interface mode management, and
                 mobility assisted-based techniques. Using the proposed
                 classification, we survey the current state of the art
                 and present an in-depth discussion of topology control
                 solutions designed for UWSNs.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bruno:2018:SGC,
  author =       "Rodrigo Bruno and Paulo Ferreira",
  title =        "A Study on Garbage Collection Algorithms for Big Data
                 Environments",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "20:1--20:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3156818",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/java2010.bib",
  abstract =     "The need to process and store massive amounts of
                 data-Big Data-is a reality. In areas such as scientific
                 experiments, social networks management, credit card
                 fraud detection, targeted advertisement, and financial
                 analysis, massive amounts of information are generated
                 and processed daily to extract valuable, summarized
                 information. Due to its fast development cycle (i.e.,
                 less expensive to develop), mainly because of automatic
                 memory management, and rich community resources,
                 managed object-oriented programming languages (e.g.,
                 Java) are the first choice to develop Big Data
                 platforms (e.g., Cassandra, Spark) on which such Big
                 Data applications are executed. However, automatic
                 memory management comes at a cost. This cost is
                 introduced by the garbage collector, which is
                 responsible for collecting objects that are no longer
                 being used. Although current (classic) garbage
                 collection algorithms may be applicable to small-scale
                 applications, these algorithms are not appropriate for
                 large-scale Big Data environments, as they do not scale
                 in terms of throughput and pause times. In this work,
                 current Big Data platforms and their memory profiles
                 are studied to understand why classic algorithms (which
                 are still the most commonly used) are not appropriate,
                 and also to analyze recently proposed and relevant
                 memory management algorithms, targeted to Big Data
                 environments. The scalability of recent memory
                 management algorithms is characterized in terms of
                 throughput (improves the throughput of the application)
                 and pause time (reduces the latency of the application)
                 when compared to classic algorithms. The study is
                 concluded by presenting a taxonomy of the described
                 works and some open problems, with regard to Big Data
                 memory management, that could be addressed in future
                 works.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Draghici:2018:STA,
  author =       "Adriana Draghici and Maarten {Van Steen}",
  title =        "A Survey of Techniques for Automatically Sensing the
                 Behavior of a Crowd",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "21:1--21:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3129343",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Crowd-centric research is receiving increasingly more
                 attention as datasets on crowd behavior are becoming
                 readily available. We have come to a point where many
                 of the models on pedestrian analytics introduced in the
                 last decade, which have mostly not been validated, can
                 now be tested using real-world datasets. In this
                 survey, we concentrate exclusively on automatically
                 gathering such datasets, which we refer to as sensing
                 the behavior of pedestrians. We roughly distinguish two
                 approaches: one that requires users to explicitly use
                 local applications and wearables, and one that scans
                 the presence of handheld devices such as smartphones.
                 We come to the conclusion that despite the numerous
                 reports in popular media, relatively few groups have
                 been looking into practical solutions for sensing
                 pedestrian behavior. Moreover, we find that much work
                 is still needed, in particular when it comes to
                 combining privacy, transparency, scalability, and ease
                 of deployment. We report on over 90 relevant articles
                 and discuss and compare in detail 30 reports on sensing
                 pedestrian behavior.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bergmayr:2018:SRC,
  author =       "Alexander Bergmayr and Uwe Breitenb{\"u}cher and
                 Nicolas Ferry and Alessandro Rossini and Arnor Solberg
                 and Manuel Wimmer and Gerti Kappel and Frank Leymann",
  title =        "A Systematic Review of Cloud Modeling Languages",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "1",
  pages =        "22:1--22:??",
  month =        apr,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3150227",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:34 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Modern cloud computing environments support a
                 relatively high degree of automation in service
                 provisioning, which allows cloud service customers
                 (CSCs) to dynamically acquire services required for
                 deploying cloud applications. Cloud modeling languages
                 (CMLs) have been proposed to address the diversity of
                 features provided by cloud computing environments and
                 support different application scenarios, such as
                 migrating existing applications to the cloud,
                 developing new cloud applications, or optimizing them.
                 There is, however, still much debate in the research
                 community on what a CML is, and what aspects of a cloud
                 application and its target cloud computing environment
                 should be modeled by a CML. Furthermore, the
                 distinction between CMLs on a fine-grain level exposing
                 their modeling concepts is rarely made. In this
                 article, we investigate the diverse features currently
                 provided by existing CMLs. We classify and compare them
                 according to a common framework with the goal to
                 support CSCs in selecting the CML that fits the needs
                 of their application scenario and setting. As a result,
                 not only features of existing CMLs are pointed out for
                 which extensive support is already provided but also in
                 which existing CMLs are deficient, thereby suggesting a
                 research agenda.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Boito:2018:CRP,
  author =       "Francieli Zanon Boito and Eduardo C. Inacio and Jean
                 Luca Bez and Philippe O. A. Navaux and Mario A. R.
                 Dantas and Yves Denneulin",
  title =        "A Checkpoint of Research on Parallel {I/O} for
                 High-Performance Computing",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "23:1--23:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3152891",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/super.bib",
  abstract =     "We present a comprehensive survey on parallel I/O in
                 the high-performance computing (HPC) context. This is
                 an important field for HPC because of the historic gap
                 between processing power and storage latency, which
                 causes application performance to be impaired when
                 accessing or generating large amounts of data. As the
                 available processing power and amount of data increase,
                 I/O remains a central issue for the scientific
                 community. In this survey article, we focus on a
                 traditional I/O stack, with a POSIX parallel file
                 system. We present background concepts everyone could
                 benefit from. Moreover, through the comprehensive study
                 of publications from the most important conferences and
                 journals in a 5-year time window, we discuss the state
                 of the art in I/O optimization approaches, access
                 pattern extraction techniques, and performance
                 modeling, in addition to general aspects of parallel
                 I/O research. With this approach, we aim at identifying
                 the general characteristics of the field and the main
                 current and future research topics.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Brugere:2018:NSI,
  author =       "Ivan Brugere and Brian Gallagher and Tanya Y.
                 Berger-Wolf",
  title =        "Network Structure Inference, A Survey: Motivations,
                 Methods, and Applications",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "24:1--24:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3154524",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Networks represent relationships between entities in
                 many complex systems, spanning from online social
                 interactions to biological cell development and brain
                 connectivity. In many cases, relationships between
                 entities are unambiguously known: are two users
                 ``friends'' in a social network? Do two researchers
                 collaborate on a published article? Do two road
                 segments in a transportation system intersect? These
                 are directly observable in the system in question. In
                 most cases, relationships between nodes are not
                 directly observable and must be inferred: Does one gene
                 regulate the expression of another? Do two animals who
                 physically co-locate have a social bond? Who infected
                 whom in a disease outbreak in a population? Existing
                 approaches for inferring networks from data are found
                 across many application domains and use specialized
                 knowledge to infer and measure the quality of inferred
                 network for a specific task or hypothesis. However,
                 current research lacks a rigorous methodology that
                 employs standard statistical validation on inferred
                 models. In this survey, we examine (1) how network
                 representations are constructed from underlying data,
                 (2) the variety of questions and tasks on these
                 representations over several domains, and (3)
                 validation strategies for measuring the inferred
                 network's capability of answering questions on the
                 system of interest.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhang:2018:FEA,
  author =       "Ligang Zhang and Brijesh Verma and Dian Tjondronegoro
                 and Vinod Chandran",
  title =        "Facial Expression Analysis under Partial Occlusion: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "25:1--25:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3158369",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Automatic machine-based Facial Expression Analysis
                 (FEA) has made substantial progress in the past few
                 decades driven by its importance for applications in
                 psychology, security, health, entertainment, and
                 human-computer interaction. The vast majority of
                 completed FEA studies are based on nonoccluded faces
                 collected in a controlled laboratory environment.
                 Automatic expression recognition tolerant to partial
                 occlusion remains less understood, particularly in
                 real-world scenarios. In recent years, efforts
                 investigating techniques to handle partial occlusion
                 for FEA have seen an increase. The context is right for
                 a comprehensive perspective of these developments and
                 the state of the art from this perspective. This survey
                 provides such a comprehensive review of recent advances
                 in dataset creation, algorithm development, and
                 investigations of the effects of occlusion critical for
                 robust performance in FEA systems. It outlines existing
                 challenges in overcoming partial occlusion and
                 discusses possible opportunities in advancing the
                 technology. To the best of our knowledge, it is the
                 first FEA survey dedicated to occlusion and aimed at
                 promoting better-informed and benchmarked future
                 work.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gebai:2018:SAK,
  author =       "Mohamad Gebai and Michel R. Dagenais",
  title =        "Survey and Analysis of Kernel and Userspace Tracers on
                 {Linux}: Design, Implementation, and Overhead",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "26:1--26:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3158644",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "As applications and operating systems are becoming
                 more complex, the last decade has seen the rise of many
                 tracing tools all across the software stack. This
                 article presents a hands-on comparison of modern
                 tracers on Linux systems, both in user space and kernel
                 space. The authors implement microbenchmarks that not
                 only quantify the overhead of different tracers, but
                 also sample fine-grained metrics that unveil insights
                 into the tracers' internals and show the cause of each
                 tracer's overhead. Internal design choices and
                 implementation particularities are discussed, which
                 helps us to understand the challenges of developing
                 tracers. Furthermore, this analysis aims to help users
                 choose and configure their tracers based on their
                 specific requirements to reduce their overhead and get
                 the most of out of them.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rojas:2018:WRD,
  author =       "Elisa Rojas and Roberto Doriguzzi-Corin and Sergio
                 Tamurejo and Andres Beato and Arne Schwabe and Kevin
                 Phemius and Carmen Guerrero",
  title =        "Are We Ready to Drive Software-Defined Networks? {A}
                 Comprehensive Survey on Management Tools and
                 Techniques",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "27:1--27:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3165290",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the context of the emergent Software-Defined
                 Networking (SDN) paradigm, the attention is mostly
                 directed to the evolution of control protocols and
                 networking functionalities. However, network
                 professionals also need the right tools to reach the
                 same level-and beyond-of monitoring and control they
                 have in traditional networks. Current SDN tools are
                 developed on an ad hoc basis, for specific SDN
                 frameworks, while production environments demand
                 standard platforms and easy integration. This survey
                 aims to foster the definition of the next generation
                 SDN management framework by providing the readers a
                 thorough overview of existing SDN tools and main
                 research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lamb:2018:ECC,
  author =       "Carolyn Lamb and Daniel G. Brown and Charles L. A.
                 Clarke",
  title =        "Evaluating Computational Creativity: an
                 Interdisciplinary Tutorial",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "28:1--28:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3167476",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This article is a tutorial for researchers who are
                 designing software to perform a creative task and want
                 to evaluate their system using interdisciplinary
                 theories of creativity. Researchers who study human
                 creativity have a great deal to offer computational
                 creativity. We summarize perspectives from psychology,
                 philosophy, cognitive science, and computer science as
                 to how creativity can be measured both in humans and in
                 computers. We survey how these perspectives have been
                 used in computational creativity research and make
                 recommendations for how they should be used.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fathy:2018:LSI,
  author =       "Yasmin Fathy and Payam Barnaghi and Rahim Tafazolli",
  title =        "Large-Scale Indexing, Discovery, and Ranking for the
                 {Internet of Things (IoT)}",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "29:1--29:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3154525",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Network-enabled sensing and actuation devices are key
                 enablers to connect real-world objects to the cyber
                 world. The Internet of Things (IoT) consists of the
                 network-enabled devices and communication technologies
                 that allow connectivity and integration of physical
                 objects (Things) into the digital world (Internet).
                 Enormous amounts of dynamic IoT data are collected from
                 Internet-connected devices. IoT data are usually
                 multi-variant streams that are heterogeneous, sporadic,
                 multi-modal, and spatio-temporal. IoT data can be
                 disseminated with different granularities and have
                 diverse structures, types, and qualities. Dealing with
                 the data deluge from heterogeneous IoT resources and
                 services imposes new challenges on indexing, discovery,
                 and ranking mechanisms that will allow building
                 applications that require on-line access and retrieval
                 of ad-hoc IoT data. However, the existing IoT data
                 indexing and discovery approaches are complex or
                 centralised, which hinders their scalability. The
                 primary objective of this article is to provide a
                 holistic overview of the state-of-the-art on indexing,
                 discovery, and ranking of IoT data. The article aims to
                 pave the way for researchers to design, develop,
                 implement, and evaluate techniques and approaches for
                 on-line large-scale distributed IoT applications and
                 services.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Siabato:2018:SMT,
  author =       "Willington Siabato and Christophe Claramunt and Sergio
                 Ilarri and Miguel Angel Manso-Callejo",
  title =        "A Survey of Modelling Trends in Temporal {GIS}",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "30:1--30:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3141772",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The main achievements of spatio-temporal modelling in
                 the field of Geographic Information Science that spans
                 the past three decades are surveyed. This article
                 offers an overview of: (i) the origins and history of
                 Temporal Geographic Information Systems (T-GIS); (ii)
                 relevant spatio-temporal data models proposed; (iii)
                 the evolution of spatio-temporal modelling trends; and
                 (iv) an analysis of the future trends and developments
                 in T-GIS. It also presents some current theories and
                 concepts that have emerged from the research performed,
                 as well as a summary of the current progress and the
                 upcoming challenges and potential research directions
                 for T-GIS. One relevant result of this survey is the
                 proposed taxonomy of spatio-temporal modelling trends,
                 which classifies 186 modelling proposals surveyed from
                 more than 1,450 articles.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shan:2018:PSC,
  author =       "Zihao Shan and Kui Ren and Marina Blanton and Cong
                 Wang",
  title =        "Practical Secure Computation Outsourcing: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "31:1--31:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3158363",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The rapid development of cloud computing promotes a
                 wide deployment of data and computation outsourcing to
                 cloud service providers by resource-limited entities.
                 Based on a pay-per-use model, a client without enough
                 computational power can easily outsource large-scale
                 computational tasks to a cloud. Nonetheless, the issue
                 of security and privacy becomes a major concern when
                 the customer's sensitive or confidential data is not
                 processed in a fully trusted cloud environment.
                 Recently, a number of publications have been proposed
                 to investigate and design specific secure outsourcing
                 schemes for different computational tasks. The aim of
                 this survey is to systemize and present the
                 cutting-edge technologies in this area. It starts by
                 presenting security threats and requirements, followed
                 with other factors that should be considered when
                 constructing secure computation outsourcing schemes. In
                 an organized way, we then dwell on the existing secure
                 outsourcing solutions to different computational tasks
                 such as matrix computations, mathematical optimization,
                 and so on, treating data confidentiality as well as
                 computation integrity. Finally, we provide a discussion
                 of the literature and a list of open challenges in the
                 area.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zubiaga:2018:DRR,
  author =       "Arkaitz Zubiaga and Ahmet Aker and Kalina Bontcheva
                 and Maria Liakata and Rob Procter",
  title =        "Detection and Resolution of Rumours in Social Media: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "32:1--32:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3161603",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Despite the increasing use of social media platforms
                 for information and news gathering, its unmoderated
                 nature often leads to the emergence and spread of
                 rumours, i.e., items of information that are unverified
                 at the time of posting. At the same time, the openness
                 of social media platforms provides opportunities to
                 study how users share and discuss rumours, and to
                 explore how to automatically assess their veracity,
                 using natural language processing and data mining
                 techniques. In this article, we introduce and discuss
                 two types of rumours that circulate on social media:
                 long-standing rumours that circulate for long periods
                 of time, and newly emerging rumours spawned during
                 fast-paced events such as breaking news, where reports
                 are released piecemeal and often with an unverified
                 status in their early stages. We provide an overview of
                 research into social media rumours with the ultimate
                 goal of developing a rumour classification system that
                 consists of four components: rumour detection, rumour
                 tracking, rumour stance classification, and rumour
                 veracity classification. We delve into the approaches
                 presented in the scientific literature for the
                 development of each of these four components. We
                 summarise the efforts and achievements so far toward
                 the development of rumour classification systems and
                 conclude with suggestions for avenues for future
                 research in social media mining for the detection and
                 resolution of rumours.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dayarathna:2018:RAE,
  author =       "Miyuru Dayarathna and Srinath Perera",
  title =        "Recent Advancements in Event Processing",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "33:1--33:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3170432",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Event processing (EP) is a data processing technology
                 that conducts online processing of event information.
                 In this survey, we summarize the latest cutting-edge
                 work done on EP from both industrial and academic
                 research community viewpoints. We divide the entire
                 field of EP into three subareas: EP system
                 architectures, EP use cases, and EP open research
                 topics. Then we deep dive into the details of each
                 subsection. We investigate the system architecture
                 characteristics of novel EP platforms, such as Apache
                 Storm, Apache Spark, and Apache Flink. We found
                 significant advancements made on novel application
                 areas, such as the Internet of Things; streaming
                 machine learning (ML); and processing of complex data
                 types such as text, video data streams, and graphs.
                 Furthermore, there has been significant body of
                 contributions made on event ordering, system
                 scalability, development of EP languages and
                 exploration of use of heterogeneous devices for EP,
                 which we investigate in the latter half of this
                 article. Through our study, we found key areas that
                 require significant attention from the EP community,
                 such as Streaming ML, EP system benchmarking, and graph
                 stream processing.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Soo:2018:SLB,
  author =       "Wooi King Soo and Teck-Chaw Ling and Aung Htein Maw
                 and Su Thawda Win",
  title =        "Survey on Load-Balancing Methods in 802.11
                 Infrastructure Mode Wireless Networks for Improving
                 Quality of Service",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "34:1--34:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3172868",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Traffic load in any 802.11 infrastructure mode network
                 is typically distributed unevenly between access points
                 (APs), creating hotspots. This is due to the inherent
                 nature of wireless area networks (WLANs), where
                 stations are free to associate to any known AP they
                 desire, and the lack of control by the APs themselves.
                 This imbalance creates a condition where affected APs
                 in the network suffer traffic congestion while others
                 are underutilized, leading to stations experiencing
                 lower throughput, longer latency, and operating below
                 the network potential capacity. To alleviate this
                 problem, some form of load balancing is required to
                 redistribute the work load among other available APs in
                 the wireless network. This article presents a survey of
                 the various works done in performing load balancing in
                 an infrastructure mode wireless network and will cover
                 the common methods including admission control,
                 association management, cell breathing, and association
                 control. Updates to the IEEE standards are also
                 presented that support load-balancing efforts. Finally,
                 software-defined networks are investigated to determine
                 the extent of control integration to support managing
                 and load-balancing WLANs. Trends in load-balancing
                 research are also uncovered that indicate how the
                 introduction of new wireless standards influences the
                 amount of research.",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rossetti:2018:CDD,
  author =       "Giulio Rossetti and R{\'e}my Cazabet",
  title =        "Community Discovery in Dynamic Networks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "35:1--35:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3172867",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Several research studies have shown that complex
                 networks modeling real-world phenomena are
                 characterized by striking properties: (i) they are
                 organized according to community structure, and (ii)
                 their structure evolves with time. Many researchers
                 have worked on methods that can efficiently unveil
                 substructures in complex networks, giving birth to the
                 field of community discovery. A novel and fascinating
                 problem started capturing researcher interest recently:
                 the identification of evolving communities. Dynamic
                 networks can be used to model the evolution of a
                 system: nodes and edges are mutable, and their
                 presence, or absence, deeply impacts the community
                 structure that composes them. This survey aims to
                 present the distinctive features and challenges of
                 dynamic community discovery and propose a
                 classification of published approaches. As a ``user
                 manual,'' this work organizes state-of-the-art
                 methodologies into a taxonomy, based on their
                 rationale, and their specific instantiation. Given a
                 definition of network dynamics, desired community
                 characteristics, and analytical needs, this survey will
                 support researchers to identify the set of approaches
                 that best fit their needs. The proposed classification
                 could also help researchers choose in which direction
                 to orient their future research.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Toch:2018:PIC,
  author =       "Eran Toch and Claudio Bettini and Erez Shmueli and
                 Laura Radaelli and Andrea Lanzi and Daniele Riboni and
                 Bruno Lepri",
  title =        "The Privacy Implications of Cyber Security Systems: a
                 Technological Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "36:1--36:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3172869",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cyber-security systems, which protect networks and
                 computers against cyber attacks, are becoming common
                 due to increasing threats and government regulation. At
                 the same time, the enormous amount of data gathered by
                 cyber-security systems poses a serious threat to the
                 privacy of the people protected by those systems. To
                 ground this threat, we survey common and novel
                 cyber-security technologies and analyze them according
                 to the potential for privacy invasion. We suggest a
                 taxonomy for privacy risks assessment of information
                 security technologies, based on the level of data
                 exposure, the level of identification of individual
                 users, the data sensitivity and the user control over
                 the monitoring, and collection and analysis of the
                 data. We discuss our results in light of the recent
                 technological trends and suggest several new directions
                 for making these mechanisms more privacy-aware.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Saputra:2018:VSS,
  author =       "Muhamad Risqi U. Saputra and Andrew Markham and Niki
                 Trigoni",
  title =        "Visual {SLAM} and Structure from Motion in Dynamic
                 Environments: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "37:1--37:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3177853",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the last few decades, Structure from Motion (SfM)
                 and visual Simultaneous Localization and Mapping
                 (visual SLAM) techniques have gained significant
                 interest from both the computer vision and robotic
                 communities. Many variants of these techniques have
                 started to make an impact in a wide range of
                 applications, including robot navigation and augmented
                 reality. However, despite some remarkable results in
                 these areas, most SfM and visual SLAM techniques
                 operate based on the assumption that the observed
                 environment is static. However, when faced with moving
                 objects, overall system accuracy can be jeopardized. In
                 this article, we present for the first time a survey of
                 visual SLAM and SfM techniques that are targeted toward
                 operation in dynamic environments. We identify three
                 main problems: how to perform reconstruction (robust
                 visual SLAM), how to segment and track dynamic objects,
                 and how to achieve joint motion segmentation and
                 reconstruction. Based on this categorization, we
                 provide a comprehensive taxonomy of existing
                 approaches. Finally, the advantages and disadvantages
                 of each solution class are critically discussed from
                 the perspective of practicality and robustness.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ghanbari:2018:OQS,
  author =       "Hadi Ghanbari and Tero Vartiainen and Mikko Siponen",
  title =        "Omission of Quality Software Development Practices: a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "38:1--38:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3177746",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Software deficiencies are minimized by utilizing
                 recommended software development and quality assurance
                 practices. However, these recommended practices (i.e.,
                 quality practices) become ineffective if software
                 professionals purposefully ignore them. Conducting a
                 systematic literature review (n = 4,838), we discovered
                 that only a small number of previous studies, within
                 software engineering and information systems
                 literature, have investigated the omission of quality
                 practices. These studies explain the omission of
                 quality practices mainly as a result of organizational
                 decisions and trade-offs made under resource
                 constraints or market pressure. However, our study
                 indicates that different aspects of this phenomenon
                 deserve further research. In particular, future
                 research must investigate the conditions triggering the
                 omission of quality practices and the processes through
                 which this phenomenon occurs. Especially, since
                 software development is a human-centric phenomenon, the
                 psychological and behavioral aspects of this process
                 deserve in-depth empirical investigation. In addition,
                 futures research must clarify the social,
                 organizational, and economical consequences of ignoring
                 quality practices. Gaining in-depth theoretically sound
                 and empirically grounded understandings about different
                 aspects of this phenomenon enables research and
                 practice to suggest interventions to overcome this
                 issue.",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:2018:EOC,
  author =       "Chao Li and Yushu Xue and Jing Wang and Weigong Zhang
                 and Tao Li",
  title =        "Edge-Oriented Computing Paradigms: a Survey on
                 Architecture Design and System Management",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "39:1--39:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3154815",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "While cloud computing has brought paradigm shifts to
                 computing services, researchers and developers have
                 also found some problems inherent to its nature such as
                 bandwidth bottleneck, communication overhead, and
                 location blindness. The concept of fog/edge computing
                 is therefore coined to extend the services from the
                 core in cloud data centers to the edge of the network.
                 In recent years, many systems are proposed to better
                 serve ubiquitous smart devices closer to the user. This
                 article provides a complete and up-to-date review of
                 edge-oriented computing systems by encapsulating
                 relevant proposals on their architecture features,
                 management approaches, and design objectives.",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Davoudian:2018:SNS,
  author =       "Ali Davoudian and Liu Chen and Mengchi Liu",
  title =        "A Survey on {NoSQL} Stores",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "40:1--40:43",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3158661",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recent demands for storing and querying big data have
                 revealed various shortcomings of traditional relational
                 database systems. This, in turn, has led to the
                 emergence of a new kind of complementary nonrelational
                 data store, named as NoSQL. This survey mainly aims at
                 elucidating the design decisions of NoSQL stores with
                 regard to the four nonorthogonal design principles of
                 distributed database systems: data model, consistency
                 model, data partitioning, and the CAP theorem. For each
                 principle, its available strategies and corresponding
                 features, strengths, and drawbacks are explained.
                 Furthermore, various implementations of each strategy
                 are exemplified and crystallized through a collection
                 of representative academic and industrial NoSQL
                 technologies. Finally, we disclose some existing
                 challenges in developing effective NoSQL stores, which
                 need attention of the research community, application
                 designers, and architects.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rodrigues:2018:UGA,
  author =       "Davi Silva Rodrigues and M{\'a}rcio Eduardo Delamaro
                 and Cl{\'e}ber Gimenez Corr{\^e}a and F{\'a}tima L. S.
                 Nunes",
  title =        "Using Genetic Algorithms in Test Data Generation: a
                 Critical Systematic Mapping",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "41:1--41:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3182659",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Software testing activities account for a considerable
                 portion of systems development cost and, for this
                 reason, many studies have sought to automate these
                 activities. Test data generation has a high cost
                 reduction potential (especially for complex domain
                 systems), since it can decrease human effort. Although
                 several studies have been published about this subject,
                 articles of reviews covering this topic usually focus
                 only on specific domains. This article presents a
                 systematic mapping aiming at providing a broad, albeit
                 critical, overview of the literature in the topic of
                 test data generation using genetic algorithms. The
                 selected studies were categorized by software testing
                 technique (structural, functional, or mutation testing)
                 for which test data were generated and according to the
                 most significantly adapted genetic algorithms aspects.
                 The most used evaluation metrics and software testing
                 techniques were identified. The results showed that
                 genetic algorithms have been successfully applied to
                 simple test data generation, but are rarely used to
                 generate complex test data such as images, videos,
                 sounds, and 3D (three-dimensional) models. From these
                 results, we discuss some challenges and opportunities
                 for research in this area.",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Antunes:2018:SSH,
  author =       "Rodolfo S. Antunes and Lucas A. Seewald and Vinicius
                 F. Rodrigues and Cristiano A. {Da Costa} and Luiz
                 {Gonzaga, Jr.} and Rodrigo R. Righi and Andreas Maier
                 and Bj{\"o}rn Eskofier and Malte Ollenschl{\"a}ger and
                 Farzad Naderi and Rebecca Fahrig and Sebastian Bauer
                 and Sigrun Klein and Gelson Campanatti",
  title =        "A Survey of Sensors in Healthcare Workflow
                 Monitoring",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "42:1--42:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3177852",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Activities of a clinical staff in healthcare
                 environments must regularly be adapted to new treatment
                 methods, medications, and technologies. This constant
                 evolution requires the monitoring of the workflow, or
                 the sequence of actions from actors involved in a
                 procedure, to ensure quality of medical services. In
                 this context, recent advances in sensing technologies,
                 including Real-time Location Systems and Computer
                 Vision, enable high-precision tracking of actors and
                 equipment. The current state-of-the-art about
                 healthcare workflow monitoring typically focuses on a
                 single technology and does not discuss its integration
                 with others. Such an integration can lead to better
                 solutions to evaluate medical workflows. This study
                 aims to fill the gap regarding the analysis of
                 monitoring technologies with a systematic literature
                 review about sensors for capturing the workflow of
                 healthcare environments. Its main scientific
                 contribution is to identify both current technologies
                 used to track activities in a clinical environment and
                 gaps on their combination to achieve better results. It
                 also proposes a taxonomy to classify work regarding
                 sensing technologies and methods. The literature review
                 does not present proposals that combine data obtained
                 from Real-time Location Systems and Computer Vision
                 sensors. Further analysis shows that a multimodal
                 analysis is more flexible and could yield better
                 results.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Turilli:2018:CPP,
  author =       "Matteo Turilli and Mark Santcroos and Shantenu Jha",
  title =        "A Comprehensive Perspective on Pilot-Job Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "2",
  pages =        "43:1--43:??",
  month =        jun,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3177851",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Pilot-Job systems play an important role in supporting
                 distributed scientific computing. They are used to
                 execute millions of jobs on several
                 cyberinfrastructures worldwide, consuming billions of
                 CPU hours a year. With the increasing importance of
                 task-level parallelism in high-performance computing,
                 Pilot-Job systems are also witnessing an adoption
                 beyond traditional domains. Notwithstanding the growing
                 impact on scientific research, there is no agreement on
                 a definition of Pilot-Job system and no clear
                 understanding of the underlying abstraction and
                 paradigm. Pilot-Job implementations have proliferated
                 with no shared best practices or open interfaces and
                 little interoperability. Ultimately, this is hindering
                 the realization of the full impact of Pilot-Jobs by
                 limiting their robustness, portability, and
                 maintainability. This article offers a comprehensive
                 analysis of Pilot-Job systems critically assessing
                 their motivations, evolution, properties, and
                 implementation. The three main contributions of this
                 article are as follows: (1) an analysis of the
                 motivations and evolution of Pilot-Job systems; (2) an
                 outline of the Pilot abstraction, its distinguishing
                 logical components and functionalities, its
                 terminology, and its architecture pattern; and (3) the
                 description of core and auxiliary properties of
                 Pilot-Jobs systems and the analysis of six exemplar
                 Pilot-Job implementations. Together, these
                 contributions illustrate the Pilot paradigm, its
                 generality, and how it helps to address some challenges
                 in distributed scientific computing.",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Brandt:2018:GS,
  author =       "Tobias Brandt and Marco Grawunder",
  title =        "{GeoStreams}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "44:1--44:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3177848",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Positional data from small and mobile Global
                 Positioning Systems has become ubiquitous and allows
                 for many new applications such as road traffic or
                 vessel monitoring as well as location-based services.
                 To make these applications possible, for which
                 information on location is more important than ever,
                 streaming spatial data needs to be managed, mined, and
                 used intelligently. This article provides an overview
                 of previous work in this evolving research field and
                 discusses different applications as well as common
                 problems and solutions. The conclusion indicates
                 promising directions for future research.",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Murthy:2018:CBM,
  author =       "Y. V. Srinivasa Murthy and Shashidhar G. Koolagudi",
  title =        "Content-Based Music Information Retrieval {(CB-MIR)}
                 and Its Applications toward the Music Industry: a
                 Review",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "45:1--45:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3177849",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A huge increase in the number of digital music tracks
                 has created the necessity to develop an automated tool
                 to extract the useful information from these tracks. As
                 this information has to be extracted from the contents
                 of the music, it is known as content-based music
                 information retrieval (CB-MIR). In the past two
                 decades, several research outcomes have been observed
                 in the area of CB-MIR. There is a need to consolidate
                 and critically analyze these research findings to
                 evolve future research directions. In this survey
                 article, various tasks of CB-MIR and their applications
                 are critically reviewed. In particular, the article
                 focuses on eight MIR-related tasks such as
                 vocal/non-vocal segmentation, artist identification,
                 genre classification, raga identification,
                 query-by-humming, emotion recognition, instrument
                 recognition, and music clip annotation. The fundamental
                 concepts of Indian classical music are detailed to
                 attract future research on this topic. The article
                 elaborates on the signal-processing techniques to
                 extract useful features for performing specific tasks
                 mentioned above and discusses their strengths as well
                 as weaknesses. This article also points to some general
                 research issues in CB-MIR and probable approaches
                 toward their solutions so as to improve the efficiency
                 of the existing CB-MIR systems.",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Barmpatsalou:2018:CFT,
  author =       "Konstantia Barmpatsalou and Tiago Cruz and Edmundo
                 Monteiro and Paulo Simoes",
  title =        "Current and Future Trends in Mobile Device Forensics:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "46:1--46:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3177847",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Contemporary mobile devices are the result of an
                 evolution process, during which computational and
                 networking capabilities have been continuously pushed
                 to keep pace with the constantly growing workload
                 requirements. This has allowed devices such as
                 smartphones, tablets, and personal digital assistants
                 to perform increasingly complex tasks, up to the point
                 of efficiently replacing traditional options such as
                 desktop computers and notebooks. However, due to their
                 portability and size, these devices are more prone to
                 theft, to become compromised, or to be exploited for
                 attacks and other malicious activity. The need for
                 investigation of the aforementioned incidents resulted
                 in the creation of the Mobile Forensics (MF)
                 discipline. MF, a sub-domain of digital forensics, is
                 specialized in extracting and processing evidence from
                 mobile devices in such a way that attacking entities
                 and actions are identified and traced. Beyond its
                 primary research interest on evidence acquisition from
                 mobile devices, MF has recently expanded its scope to
                 encompass the organized and advanced evidence
                 representation and analysis of future malicious entity
                 behavior. Nonetheless, data acquisition still remains
                 its main focus. While the field is under continuous
                 research activity, new concepts such as the involvement
                 of cloud computing in the MF ecosystem and the
                 evolution of enterprise mobile solutions-particularly
                 mobile device management and bring your own
                 device-bring new opportunities and issues to the
                 discipline. The current article presents the research
                 conducted within the MF ecosystem during the last 7
                 years, identifies the gaps, and highlights the
                 differences from past research directions, and
                 addresses challenges and open issues in the field.",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Saeed:2018:SMS,
  author =       "Nasir Saeed and Haewoon Nam and Mian Imtiaz {Ul Haq}
                 and Dost Bhatti Muhammad Saqib",
  title =        "A Survey on Multidimensional Scaling",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "47:1--47:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3178155",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "This survey presents multidimensional scaling (MDS)
                 methods and their applications in real world. MDS is an
                 exploratory and multivariate data analysis technique
                 becoming more and more popular. MDS is one of the
                 multivariate data analysis techniques, which tries to
                 represent the higher dimensional data into lower space.
                 The input data for MDS analysis is measured by the
                 dissimilarity or similarity of the objects under
                 observation. Once the MDS technique is applied to the
                 measured dissimilarity or similarity, MDS results in a
                 spatial map. In the spatial map, the dissimilar objects
                 are far apart while objects which are similar are
                 placed close to each other. In this survey article, MDS
                 is described in comprehensive fashion by explaining the
                 basic notions of classical MDS and how MDS can be
                 helpful to analyze the multidimensional data. Later on,
                 various special models based on MDS are described in a
                 more mathematical way followed by comparisons of
                 various MDS techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Resende:2018:SRF,
  author =       "Paulo Angelo Alves Resende and Andr{\'e} Costa
                 Drummond",
  title =        "A Survey of Random Forest Based Methods for Intrusion
                 Detection Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "48:1--48:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3178582",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Over the past decades, researchers have been proposing
                 different Intrusion Detection approaches to deal with
                 the increasing number and complexity of threats for
                 computer systems. In this context, Random Forest models
                 have been providing a notable performance on their
                 applications in the realm of the behaviour-based
                 Intrusion Detection Systems. Specificities of the
                 Random Forest model are used to provide classification,
                 feature selection, and proximity metrics. This work
                 provides a comprehensive review of the general basic
                 concepts related to Intrusion Detection Systems,
                 including taxonomies, attacks, data collection,
                 modelling, evaluation metrics, and commonly used
                 methods. It also provides a survey of Random Forest
                 based methods applied in this context, considering the
                 particularities involved in these models. Finally, some
                 open questions and challenges are posed combined with
                 possible directions to deal with them, which may guide
                 future works on the area.",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gomes:2018:CSS,
  author =       "Cl{\'a}udio Gomes and Casper Thule and David Broman
                 and Peter Gorm Larsen and Hans Vangheluwe",
  title =        "Co-Simulation: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "49:1--49:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3179993",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Modeling and simulation techniques are today
                 extensively used both in industry and science. Parts of
                 larger systems are, however, typically modeled and
                 simulated by different techniques, tools, and
                 algorithms. In addition, experts from different
                 disciplines use various modeling and simulation
                 techniques. Both these facts make it difficult to study
                 coupled heterogeneous systems. Co-simulation is an
                 emerging enabling technique, where global simulation of
                 a coupled system can be achieved by composing the
                 simulations of its parts. Due to its potential and
                 interdisciplinary nature, co-simulation is being
                 studied in different disciplines but with limited
                 sharing of findings. In this survey, we study and
                 survey the state-of-the-art techniques for
                 co-simulation, with the goal of enhancing future
                 research and highlighting the main challenges. To study
                 this broad topic, we start by focusing on
                 discrete-event-based co-simulation, followed by
                 continuous-time-based co-simulation. Finally, we
                 explore the interactions between these two paradigms,
                 in hybrid co-simulation. To survey the current
                 techniques, tools, and research challenges, we
                 systematically classify recently published research
                 literature on co-simulation, and summarize it into a
                 taxonomy. As a result, we identify the need for finding
                 generic approaches for modular, stable, and accurate
                 coupling of simulation units, as well as expressing the
                 adaptations required to ensure that the coupling is
                 correct.",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Baldoni:2018:SSE,
  author =       "Roberto Baldoni and Emilio Coppa and Daniele Cono
                 D'Elia and Camil Demetrescu and Irene Finocchi",
  title =        "A Survey of Symbolic Execution Techniques",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "50:1--50:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3182657",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Many security and software testing applications
                 require checking whether certain properties of a
                 program hold for any possible usage scenario. For
                 instance, a tool for identifying software
                 vulnerabilities may need to rule out the existence of
                 any backdoor to bypass a program's authentication. One
                 approach would be to test the program using different,
                 possibly random inputs. As the backdoor may only be hit
                 for very specific program workloads, automated
                 exploration of the space of possible inputs is of the
                 essence. Symbolic execution provides an elegant
                 solution to the problem, by systematically exploring
                 many possible execution paths at the same time without
                 necessarily requiring concrete inputs. Rather than
                 taking on fully specified input values, the technique
                 abstractly represents them as symbols, resorting to
                 constraint solvers to construct actual instances that
                 would cause property violations. Symbolic execution has
                 been incubated in dozens of tools developed over the
                 past four decades, leading to major practical
                 breakthroughs in a number of prominent software
                 reliability applications. The goal of this survey is to
                 provide an overview of the main ideas, challenges, and
                 solutions developed in the area, distilling them for a
                 broad audience.",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Shirazi:2018:SRA,
  author =       "Fatemeh Shirazi and Milivoj Simeonovski and Muhammad
                 Rizwan Asghar and Michael Backes and Claudia Diaz",
  title =        "A Survey on Routing in Anonymous Communication
                 Protocols",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "51:1--51:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3182658",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Internet has undergone dramatic changes in the
                 past 2 decades and now forms a global communication
                 platform that billions of users rely on for their daily
                 activities. While this transformation has brought
                 tremendous benefits to society, it has also created new
                 threats to online privacy, such as omnipotent
                 governmental surveillance. As a result, public interest
                 in systems for anonymous communication has drastically
                 increased. In this work, we survey previous research on
                 designing, developing, and deploying systems for
                 anonymous communication. Our taxonomy and comparative
                 assessment provide important insights about the
                 differences between the existing classes of anonymous
                 communication protocols.",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{VanDijkhuizen:2018:SNT,
  author =       "Niels {Van Dijkhuizen} and Jeroen {Van Der Ham}",
  title =        "A Survey of Network Traffic Anonymisation Techniques
                 and Implementations",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "52:1--52:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3182660",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Many networking research activities are dependent on
                 the availability of network captures. Even outside
                 academic research, there is a need for sharing network
                 captures to cooperate on threat assessments or for
                 debugging. However, most network captures cannot be
                 shared due to privacy concerns. Anonymisation of
                 network captures has been a subject of research for
                 quite some time, and many different techniques exist.
                 In this article, we present an overview of the
                 currently available techniques and implementations for
                 network capture anonymisation. There have been many
                 advances in the understanding of anonymisation and
                 cryptographic methods, which have changed the
                 perspective on the effectiveness of many anonymisation
                 techniques. However, these advances, combined with the
                 increase of computational abilities, may have also made
                 it feasible to perform anonymisation in real time. This
                 may make it easier to collect and distribute network
                 captures both for research and for other applications.
                 This article surveys the literature over the period of
                 1998-2017 on network traffic anonymisation techniques
                 and implementations. The aim is to provide an overview
                 of the current state of the art and to highlight how
                 advances in related fields have shed new light on
                 anonymisation and pseudonimisation methodologies. The
                 few currently maintained implementations are also
                 reviewed. Last, we identify future research directions
                 to enable easier sharing of network traffic, which in
                 turn can enable new insights in network traffic
                 analysis.",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Oliveira:2018:PAW,
  author =       "Wellington Oliveira and Daniel {De Oliveira} and
                 Vanessa Braganholo",
  title =        "Provenance Analytics for Workflow-Based Computational
                 Experiments: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "53:1--53:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3184900",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Until not long ago, manually capturing and storing
                 provenance from scientific experiments were constant
                 concerns for scientists. With the advent of
                 computational experiments (modeled as scientific
                 workflows) and Scientific Workflow Management Systems,
                 produced and consumed data, as well as the provenance
                 of a given experiment, are automatically managed, so
                 provenance capturing and storing in such a context is
                 no longer a major concern. Similarly to several
                 existing big data problems, the bottom line is now on
                 how to analyze the large amounts of provenance data
                 generated by workflow executions and how to be able to
                 extract useful knowledge of this data. In this context,
                 this article surveys the current state of the art on
                 provenance analytics by presenting the key initiatives
                 that have been taken to support provenance data
                 analysis. We also contribute by proposing a taxonomy to
                 classify elements related to provenance analytics.",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hanford:2018:SES,
  author =       "Nathan Hanford and Vishal Ahuja and Matthew K. Farrens
                 and Brian Tierney and Dipak Ghosal",
  title =        "A Survey of End-System Optimizations for High-Speed
                 Networks",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "54:1--54:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3184899",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The gap is widening between the processor clock speed
                 of end-system architectures and network throughput
                 capabilities. It is now physically possible to provide
                 single-flow throughput of speeds up to 100 Gbps, and
                 400 Gbps will soon be possible. Most current research
                 into high-speed data networking focuses on managing
                 expanding network capabilities within datacenter Local
                 Area Networks (LANs) or efficiently multiplexing
                 millions of relatively small flows through a Wide Area
                 Network (WAN). However, datacenter hyper-convergence
                 places high-throughput networking workloads on
                 general-purpose hardware, and distributed
                 High-Performance Computing (HPC) applications require
                 time-sensitive, high-throughput end-to-end flows (also
                 referred to as ``elephant flows'') to occur over WANs.
                 For these applications, the bottleneck is often the
                 end-system and not the intervening network. Since the
                 problem of the end-system bottleneck was uncovered,
                 many techniques have been developed which address this
                 mismatch with varying degrees of effectiveness. In this
                 survey, we describe the most promising techniques,
                 beginning with network architectures and NIC design,
                 continuing with operating and end-system architectures,
                 and concluding with clean-slate protocol design.",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ramaki:2018:SMS,
  author =       "Ali Ahmadian Ramaki and Abbas Rasoolzadegan and Abbas
                 Ghaemi Bafghi",
  title =        "A Systematic Mapping Study on Intrusion Alert Analysis
                 in Intrusion Detection Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "55:1--55:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3184898",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Intrusion alert analysis is an attractive and active
                 topic in the area of intrusion detection systems. In
                 recent decades, many research communities have been
                 working in this field. The main objective of this
                 article is to achieve a taxonomy of research fields in
                 intrusion alert analysis by using a systematic mapping
                 study of 468 high-quality papers. The results show that
                 there are 10 different research topics in the field,
                 which can be classified into three broad groups:
                 pre-processing, processing, and post-processing. The
                 processing group contains most of the research works,
                 and the post-processing group is newer than others.",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Venieris:2018:TMC,
  author =       "Stylianos I. Venieris and Alexandros Kouris and
                 Christos-Savvas Bouganis",
  title =        "Toolflows for Mapping Convolutional Neural Networks on
                 {FPGAs}: a Survey and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "56:1--56:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3186332",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the past decade, Convolutional Neural Networks
                 (CNNs) have demonstrated state-of-the-art performance
                 in various Artificial Intelligence tasks. To accelerate
                 the experimentation and development of CNNs, several
                 software frameworks have been released, primarily
                 targeting power-hungry CPUs and GPUs. In this context,
                 reconfigurable hardware in the form of FPGAs
                 constitutes a potential alternative platform that can
                 be integrated in the existing deep-learning ecosystem
                 to provide a tunable balance between performance, power
                 consumption, and programmability. In this article, a
                 survey of the existing CNN-to-FPGA toolflows is
                 presented, comprising a comparative study of their key
                 characteristics, which include the supported
                 applications, architectural choices, design space
                 exploration methods, and achieved performance.
                 Moreover, major challenges and objectives introduced by
                 the latest trends in CNN algorithmic research are
                 identified and presented. Finally, a uniform evaluation
                 methodology is proposed, aiming at the comprehensive,
                 complete, and in-depth evaluation of CNN-to-FPGA
                 toolflows.",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wagner:2018:TPM,
  author =       "Isabel Wagner and David Eckhoff",
  title =        "Technical Privacy Metrics: a Systematic Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "57:1--57:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3168389",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The goal of privacy metrics is to measure the degree
                 of privacy enjoyed by users in a system and the amount
                 of protection offered by privacy-enhancing
                 technologies. In this way, privacy metrics contribute
                 to improving user privacy in the digital world. The
                 diversity and complexity of privacy metrics in the
                 literature make an informed choice of metrics
                 challenging. As a result, instead of using existing
                 metrics, new metrics are proposed frequently, and
                 privacy studies are often incomparable. In this survey,
                 we alleviate these problems by structuring the
                 landscape of privacy metrics. To this end, we explain
                 and discuss a selection of over 80 privacy metrics and
                 introduce categorizations based on the aspect of
                 privacy they measure, their required inputs, and the
                 type of data that needs protection. In addition, we
                 present a method on how to choose privacy metrics based
                 on nine questions that help identify the right privacy
                 metrics for a given scenario, and highlight topics
                 where additional work on privacy metrics is needed. Our
                 survey spans multiple privacy domains and can be
                 understood as a general framework for privacy
                 measurement.",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Meidan:2018:MSP,
  author =       "Ayman Meidan and Juli{\'a}n A. Garc{\'\i}a-Garc{\'\i}a
                 and Isabel Ramos and Mar{\'\i}a Jos{\'e} Escalona",
  title =        "Measuring Software Process: a Systematic Mapping
                 Study",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "58:1--58:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3186888",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Context: Measurement is essential to reach predictable
                 performance and high capability processes. It provides
                 support for better understanding, evaluation,
                 management, and control of the development process and
                 project, as well as the resulting product. It also
                 enables organizations to improve and predict its
                 process's performance, which places organizations in
                 better positions to make appropriate decisions.
                 Objective: This study aims to understand the
                 measurement of the software development process, to
                 identify studies, create a classification scheme based
                 on the identified studies, and then to map such studies
                 into the scheme to answer the research questions.
                 Method: Systematic mapping is the selected research
                 methodology for this study. Results: A total of 462
                 studies are included and classified into four topics
                 with respect to their focus and into three groups based
                 on the publishing date. Five abstractions and 64
                 attributes were identified, 25 methods/models and 17
                 contexts were distinguished. Conclusion: capability and
                 performance were the most measured process attributes,
                 while effort and performance were the most measured
                 project attributes. Goal Question Metric and Capability
                 Maturity Model Integration were the main methods and
                 models used in the studies, whereas agile/lean
                 development and small/medium-size enterprise were the
                 most frequently identified research contexts.",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Son:2018:TSD,
  author =       "Jungmin Son and Rajkumar Buyya",
  title =        "A Taxonomy of Software-Defined Networking
                 ({SDN})-Enabled Cloud Computing",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "59:1--59:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3190617",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Software-Defined Networking (SDN) opened up new
                 opportunities in networking with its concept of the
                 segregated control plane from the data-forwarding
                 hardware, which enables the network to be programmable,
                 adjustable, and reconfigurable dynamically. These
                 characteristics can bring numerous benefits to cloud
                 computing, where dynamic changes and reconfiguration
                 are necessary with its on-demand usage pattern.
                 Although researchers have studied utilizing SDN in
                 cloud computing, gaps still exist and need to be
                 explored further. In this article, we propose a
                 taxonomy to depict different aspects of SDN-enabled
                 cloud computing and explain each element in details.
                 The detailed survey of studies utilizing SDN for cloud
                 computing is presented with focus on data center power
                 optimization, traffic engineering, network
                 virtualization, and security. We also present various
                 simulation and empirical evaluation methods that have
                 been developed for SDN-enabled clouds. Finally, we
                 analyze the gap in current research and propose future
                 directions.",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Heidari:2018:SGP,
  author =       "Safiollah Heidari and Yogesh Simmhan and Rodrigo N.
                 Calheiros and Rajkumar Buyya",
  title =        "Scalable Graph Processing Frameworks: a Taxonomy and
                 Open Challenges",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "60:1--60:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3199523",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The world is becoming a more conjunct place and the
                 number of data sources such as social networks, online
                 transactions, web search engines, and mobile devices is
                 increasing even more than had been predicted. A large
                 percentage of this growing dataset exists in the form
                 of linked data, more generally, graphs, and of
                 unprecedented sizes. While today's data from social
                 networks contain hundreds of millions of nodes
                 connected by billions of edges, inter-connected data
                 from globally distributed sensors that forms the
                 Internet of Things can cause this to grow exponentially
                 larger. Although analyzing these large graphs is
                 critical for the companies and governments that own
                 them, big data tools designed for text and tuple
                 analysis such as MapReduce cannot process them
                 efficiently. So, graph distributed processing
                 abstractions and systems are developed to design
                 iterative graph algorithms and process large graphs
                 with better performance and scalability. These graph
                 frameworks propose novel methods or extend previous
                 methods for processing graph data. In this article, we
                 propose a taxonomy of graph processing systems and map
                 existing systems to this classification. This captures
                 the diversity in programming and computation models,
                 runtime aspects of partitioning and communication, both
                 for in-memory and distributed frameworks. Our effort
                 helps to highlight key distinctions in architectural
                 approaches, and identifies gaps for future research in
                 scalable graph systems.",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chen:2018:STS,
  author =       "Tao Chen and Rami Bahsoon and Xin Yao",
  title =        "A Survey and Taxonomy of Self-Aware and Self-Adaptive
                 Cloud Autoscaling Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "61:1--61:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3190507",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Autoscaling system can reconfigure cloud-based
                 services and applications, through various
                 configurations of cloud software and provisions of
                 hardware resources, to adapt to the changing
                 environment at runtime. Such a behavior offers the
                 foundation for achieving elasticity in a modern cloud
                 computing paradigm. Given the dynamic and uncertain
                 nature of the shared cloud infrastructure, the cloud
                 autoscaling system has been engineered as one of the
                 most complex, sophisticated, and intelligent artifacts
                 created by humans, aiming to achieve self-aware,
                 self-adaptive, and dependable runtime scaling. Yet the
                 existing Self-aware and Self-adaptive Cloud Autoscaling
                 System (SSCAS) is not at a state where it can be
                 reliably exploited in the cloud. In this article, we
                 survey the state-of-the-art research studies on SSCAS
                 and provide a comprehensive taxonomy for this field. We
                 present detailed analysis of the results and provide
                 insights on open challenges, as well as the promising
                 directions that are worth investigated in the future
                 work of this area of research. Our survey and taxonomy
                 contribute to the fundamentals of engineering more
                 intelligent autoscaling systems in the cloud.",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Liu:2018:GSM,
  author =       "Yike Liu and Tara Safavi and Abhilash Dighe and Danai
                 Koutra",
  title =        "Graph Summarization Methods and Applications: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "62:1--62:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3186727",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "While advances in computing resources have made
                 processing enormous amounts of data possible, human
                 ability to identify patterns in such data has not
                 scaled accordingly. Efficient computational methods for
                 condensing and simplifying data are thus becoming vital
                 for extracting actionable insights. In particular,
                 while data summarization techniques have been studied
                 extensively, only recently has summarizing
                 interconnected data, or graphs, become popular. This
                 survey is a structured, comprehensive overview of the
                 state-of-the-art methods for summarizing graph data. We
                 first broach the motivation behind and the challenges
                 of graph summarization. We then categorize
                 summarization approaches by the type of graphs taken as
                 input and further organize each category by core
                 methodology. Finally, we discuss applications of
                 summarization on real-world graphs and conclude by
                 describing some open problems in the field.",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ivie:2018:RSC,
  author =       "Peter Ivie and Douglas Thain",
  title =        "Reproducibility in Scientific Computing",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "63:1--63:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3186266",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Reproducibility is widely considered to be an
                 essential requirement of the scientific process.
                 However, a number of serious concerns have been raised
                 recently, questioning whether today's computational
                 work is adequately reproducible. In principle, it
                 should be possible to specify a computation to
                 sufficient detail that anyone should be able to
                 reproduce it exactly. But in practice, there are
                 fundamental, technical, and social barriers to doing
                 so. The many objectives and meanings of reproducibility
                 are discussed within the context of scientific
                 computing. Technical barriers to reproducibility are
                 described, extant approaches surveyed, and open areas
                 of research are identified.",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Qi:2018:CSQ,
  author =       "Jianzhong Qi and Rui Zhang and Christian S. Jensen and
                 Kotagiri Ramamohanarao and Jiayuan He",
  title =        "Continuous Spatial Query Processing: a Survey of Safe
                 Region Based Techniques",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "64:1--64:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3193835",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the past decade, positioning system-enabled devices
                 such as smartphones have become most prevalent. This
                 functionality brings the increasing popularity of
                 location-based services in business as well as daily
                 applications such as navigation, targeted advertising,
                 and location-based social networking. Continuous
                 spatial queries serve as a building block for
                 location-based services. As an example, an Uber driver
                 may want to be kept aware of the nearest customers or
                 service stations. Continuous spatial queries require
                 updates to the query result as the query or data
                 objects are moving. This poses challenges to the query
                 efficiency, which is crucial to the user experience of
                 a service. A large number of approaches address this
                 efficiency issue using the concept of safe region. A
                 safe region is a region within which arbitrary movement
                 of an object leaves the query result unchanged. Such a
                 region helps reduce the frequency of query result
                 update and hence improves query efficiency. As a
                 result, safe region-based approaches have been popular
                 for processing various types of continuous spatial
                 queries. Safe regions have interesting theoretical
                 properties and are worth in-depth analysis. We provide
                 a comparative study of safe region-based approaches. We
                 describe how safe regions are computed for different
                 types of continuous spatial queries, showing how they
                 improve query efficiency. We compare the different safe
                 region-based approaches and discuss possible further
                 improvements.",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sundararajan:2018:DLB,
  author =       "Kalaivani Sundararajan and Damon L. Woodard",
  title =        "Deep Learning for Biometrics: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "3",
  pages =        "65:1--65:??",
  month =        jul,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3190618",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "In the recent past, deep learning methods have
                 demonstrated remarkable success for supervised learning
                 tasks in multiple domains including computer vision,
                 natural language processing, and speech processing. In
                 this article, we investigate the impact of deep
                 learning in the field of biometrics, given its success
                 in other domains. Since biometrics deals with
                 identifying people by using their characteristics, it
                 primarily involves supervised learning and can leverage
                 the success of deep learning in other related domains.
                 In this article, we survey 100 different approaches
                 that explore deep learning for recognizing individuals
                 using various biometric modalities. We find that most
                 deep learning research in biometrics has been focused
                 on face and speaker recognition. Based on inferences
                 from these approaches, we discuss how deep learning
                 methods can benefit the field of biometrics and the
                 potential gaps that deep learning approaches need to
                 address for real-world biometric applications.",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Quadrana:2018:SAR,
  author =       "Massimo Quadrana and Paolo Cremonesi and Dietmar
                 Jannach",
  title =        "Sequence-Aware Recommender Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "66:1--66:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3190616",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Recommender systems are one of the most successful
                 applications of data mining and machine-learning
                 technology in practice. Academic research in the field
                 is historically often based on the matrix completion
                 problem formulation, where for each user-item-pair only
                 one interaction (e.g., a rating) is considered. In many
                 application domains, however, multiple user-item
                 interactions of different types can be recorded over
                 time. And, a number of recent works have shown that
                 this information can be used to build richer individual
                 user models and to discover additional behavioral
                 patterns that can be leveraged in the recommendation
                 process. In this work, we review existing works that
                 consider information from such sequentially ordered
                 user-item interaction logs in the recommendation
                 process. Based on this review, we propose a
                 categorization of the corresponding recommendation
                 tasks and goals, summarize existing algorithmic
                 solutions, discuss methodological approaches when
                 benchmarking what we call sequence-aware recommender
                 systems, and outline open challenges in the area.",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhauniarovich:2018:SMD,
  author =       "Yury Zhauniarovich and Issa Khalil and Ting Yu and
                 Marc Dacier",
  title =        "A Survey on Malicious Domains Detection through {DNS}
                 Data Analysis",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "67:1--67:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3191329",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Malicious domains are one of the major resources
                 required for adversaries to run attacks over the
                 Internet. Due to the important role of the Domain Name
                 System (DNS), extensive research has been conducted to
                 identify malicious domains based on their unique
                 behavior reflected in different phases of the life
                 cycle of DNS queries and responses. Existing approaches
                 differ significantly in terms of intuitions, data
                 analysis methods as well as evaluation methodologies.
                 This warrants a thorough systematization of the
                 approaches and a careful review of the advantages and
                 limitations of every group. In this article, we perform
                 such an analysis. To achieve this goal, we present the
                 necessary background knowledge on DNS and malicious
                 activities leveraging DNS. We describe a general
                 framework of malicious domain detection techniques
                 using DNS data. Applying this framework, we categorize
                 existing approaches using several orthogonal
                 viewpoints, namely (1) sources of DNS data and their
                 enrichment, (2) data analysis methods, and (3)
                 evaluation strategies and metrics. In each aspect, we
                 discuss the important challenges that the research
                 community should address in order to fully realize the
                 power of DNS data analysis to fight against attacks
                 leveraging malicious domains.",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{FarrUs:2018:VDA,
  author =       "Mireia Farr{\'U}s",
  title =        "Voice Disguise in Automatic Speaker Recognition",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "68:1--68:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3195832",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Humans are able to identify other people's voices even
                 in voice disguise conditions. However, we are not
                 immune to all voice changes when trying to identify
                 people from voice. Likewise, automatic speaker
                 recognition systems can also be deceived by voice
                 imitation and other types of disguise. Taking into
                 account the voice disguise classification into the
                 combination of two different categories
                 (deliberate/non-deliberate and
                 electronic/non-electronic), this survey provides a
                 literature review on the influence of voice disguise in
                 the automatic speaker recognition task and the
                 robustness of these systems to such voice changes.
                 Additionally, the survey addresses existing
                 applications dealing with voice disguise and analyzes
                 some issues for future research.",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Botacin:2018:WWW,
  author =       "Marcus Botacin and Paulo L{\'\i}cio {De Geus} and
                 Andr{\'e} Gr{\'e}gio",
  title =        "Who Watches the Watchmen: a Security-focused Review on
                 Current State-of-the-art Techniques, Tools, and Methods
                 for Systems and Binary Analysis on Modern Platforms",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "69:1--69:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3199673",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  abstract =     "Malicious software, a threat users face on a daily
                 basis, have evolved from simple bankers based on social
                 engineering to advanced persistent threats. Recent
                 research and discoveries reveal that malware developers
                 have been using a wide range of anti-analysis and
                 evasion techniques, in-memory attacks, and system
                 subversion, including BIOS and hypervisors. In
                 addition, code-reuse attacks like Returned Oriented
                 Programming emerge as highly potential remote code
                 execution threats. To counteract the broadness of
                 malicious codes, distinct techniques and tools have
                 been proposed, such as transparent malware tracers,
                 system-wide debuggers, live forensics tools, and
                 isolated execution rings. In this work, we present a
                 survey on state-of-the-art techniques that detect,
                 mitigate, and analyze the aforementioned attacks. We
                 show approaches based on Hardware Virtual Machines
                 introspection, System Management Mode instrumentation,
                 Hardware Performance Counters, isolated rings (e.g.,
                 Software Guard eXtensions), as well as others based on
                 external hardware. We also discuss upcoming threats
                 based on the very same technologies used for defense.
                 Our main goal is to provide the reader with a broader,
                 more comprehensive understanding of recently surfaced
                 tools and techniques aiming at binary analysis for
                 modern platforms.",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Huang:2018:SUC,
  author =       "Keman Huang and Michael Siegel and Stuart Madnick",
  title =        "Systematically Understanding the Cyber Attack
                 Business: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "70:1--70:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3199674",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Cyber attacks are increasingly menacing businesses.
                 Based on the literature review and publicly available
                 reports, this article conducts an extensive and
                 consistent survey of the services used by the
                 cybercrime business, organized using the value chain
                 perspective, to understand cyber attack in a systematic
                 way. Understanding the specialization,
                 commercialization, and cooperation for cyber attacks
                 helps us to identify 24 key value-added activities and
                 their relations. These can be offered ``as a service''
                 for use in a cyber attack. This framework helps to
                 understand the cybercriminal service ecosystem and
                 hacking innovations. Finally, a few examples are
                 provided showing how this framework can help to build a
                 more cyber immune system, like targeting cybercrime
                 control-points and assigning defense responsibilities
                 to encourage collaboration.",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Abdallah:2018:ARE,
  author =       "Zahraa S. Abdallah and Mohamed Medhat Gaber and Bala
                 Srinivasan and Shonali Krishnaswamy",
  title =        "Activity Recognition with Evolving Data Streams: a
                 Review",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "71:1--71:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3158645",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Activity recognition aims to provide accurate and
                 opportune information on people's activities by
                 leveraging sensory data available in today's sensory
                 rich environments. Nowadays, activity recognition has
                 become an emerging field in the areas of pervasive and
                 ubiquitous computing. A typical activity recognition
                 technique processes data streams that evolve from
                 sensing platforms such as mobile sensors, on body
                 sensors, and/or ambient sensors. This article surveys
                 the two overlapped areas of research of activity
                 recognition and data stream mining. The perspective of
                 this article is to review the adaptation capabilities
                 of activity recognition techniques in streaming
                 environment. Categories of techniques are identified
                 based on different features in both data streams and
                 activity recognition. The pros and cons of the
                 algorithms in each category are analysed, and the
                 possible directions of future research are indicated.",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Vipin:2018:FDP,
  author =       "Kizheppatt Vipin and Suhaib A. Fahmy",
  title =        "{FPGA} Dynamic and Partial Reconfiguration: a Survey
                 of Architectures, Methods, and Applications",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "72:1--72:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3193827",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Dynamic and partial reconfiguration are key
                 differentiating capabilities of field programmable gate
                 arrays (FPGAs). While they have been studied
                 extensively in academic literature, they find limited
                 use in deployed systems. We review FPGA
                 reconfiguration, looking at architectures built for the
                 purpose, and the properties of modern commercial
                 architectures. We then investigate design flows and
                 identify the key challenges in making reconfigurable
                 FPGA systems easier to design. Finally, we look at
                 applications where reconfiguration has found use, as
                 well as proposing new areas where this capability
                 places FPGAs in a unique position for adoption.",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Qu:2018:ASW,
  author =       "Chenhao Qu and Rodrigo N. Calheiros and Rajkumar
                 Buyya",
  title =        "Auto-Scaling {Web} Applications in Clouds: a Taxonomy
                 and Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "73:1--73:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3148149",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Web application providers have been migrating their
                 applications to cloud data centers, attracted by the
                 emerging cloud computing paradigm. One of the appealing
                 features of the cloud is elasticity. It allows cloud
                 users to acquire or release computing resources on
                 demand, which enables web application providers to
                 automatically scale the resources provisioned to their
                 applications without human intervention under a dynamic
                 workload to minimize resource cost while satisfying
                 Quality of Service (QoS) requirements. In this article,
                 we comprehensively analyze the challenges that remain
                 in auto-scaling web applications in clouds and review
                 the developments in this field. We present a taxonomy
                 of auto-scalers according to the identified challenges
                 and key properties. We analyze the surveyed works and
                 map them to the taxonomy to identify the weaknesses in
                 this field. Moreover, based on the analysis, we propose
                 new future directions that can be explored in this
                 area.",
  acknowledgement = ack-nhfb,
  articleno =    "73",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Siow:2018:AIT,
  author =       "Eugene Siow and Thanassis Tiropanis and Wendy Hall",
  title =        "Analytics for the {Internet of Things}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "74:1--74:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3204947",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Internet of Things (IoT) envisions a world-wide,
                 interconnected network of smart physical entities.
                 These physical entities generate a large amount of data
                 in operation, and as the IoT gains momentum in terms of
                 deployment, the combined scale of those data seems
                 destined to continue to grow. Increasingly,
                 applications for the IoT involve analytics. Data
                 analytics is the process of deriving knowledge from
                 data, generating value like actionable insights from
                 them. This article reviews work in the IoT and big data
                 analytics from the perspective of their utility in
                 creating efficient, effective, and innovative
                 applications and services for a wide spectrum of
                 domains. We review the broad vision for the IoT as it
                 is shaped in various communities, examine the
                 application of data analytics across IoT domains,
                 provide a categorisation of analytic approaches, and
                 propose a layered taxonomy from IoT data to analytics.
                 This taxonomy provides us with insights on the
                 appropriateness of analytical techniques, which in turn
                 shapes a survey of enabling technology and
                 infrastructure for IoT analytics. Finally, we look at
                 some tradeoffs for analytics in the IoT that can shape
                 future research.",
  acknowledgement = ack-nhfb,
  articleno =    "74",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ochieng:2018:LSO,
  author =       "Peter Ochieng and Swaib Kyanda",
  title =        "Large-Scale Ontology Matching: State-of-the-Art
                 Analysis",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "75:1--75:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3211871",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Ontologies have become a popular means of knowledge
                 sharing and reuse. This has motivated the development
                 of large-sized independent ontologies within the same
                 or different domains with some overlapping information
                 among them. To integrate such large ontologies,
                 automatic matchers become an inevitable solution.
                 However, the process of matching large ontologies has
                 high space and time complexities. Therefore, for a tool
                 to efficiently and accurately match these large
                 ontologies within the limited computing resources, it
                 must have techniques that can significantly reduce the
                 high space and time complexities associated with the
                 ontology matching process. This article provides a
                 review of the state-of-the-art techniques being applied
                 by ontology matching tools to achieve scalability and
                 produce high-quality mappings when matching large
                 ontologies. In addition, we provide a direct comparison
                 of the techniques to gauge their effectiveness in
                 achieving scalability. A review of the state-of-the-art
                 ontology matching tools that employ each strategy is
                 also provided. We also evaluate the state-of-the-art
                 tools to gauge the progress they have made over the
                 years in improving alignment's quality and reduction of
                 execution time when matching large ontologies.",
  acknowledgement = ack-nhfb,
  articleno =    "75",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Giraldo:2018:SPB,
  author =       "Jairo Giraldo and David Urbina and Alvaro Cardenas and
                 Junia Valente and Mustafa Faisal and Justin Ruths and
                 Nils Ole Tippenhauer and Henrik Sandberg and Richard
                 Candell",
  title =        "A Survey of Physics-Based Attack Detection in
                 Cyber-Physical Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "76:1--76:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3203245",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Monitoring the ``physics'' of cyber-physical systems
                 to detect attacks is a growing area of research. In its
                 basic form, a security monitor creates time-series
                 models of sensor readings for an industrial control
                 system and identifies anomalies in these measurements
                 to identify potentially false control commands or false
                 sensor readings. In this article, we review previous
                 work on physics-based anomaly detection based on a
                 unified taxonomy that allows us to identify limitations
                 and unexplored challenges and to propose new
                 solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "76",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Toth:2018:GDD,
  author =       "Edward Toth and Sanjay Chawla",
  title =        "Group Deviation Detection Methods: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "77:1--77:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3203246",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Pointwise anomaly detection and change detection focus
                 on the study of individual data instances; however, an
                 emerging area of research involves groups or
                 collections of observations. From applications of
                 high-energy particle physics to health care collusion,
                 group deviation detection techniques result in novel
                 research discoveries, mitigation of risks, prevention
                 of malicious collaborative activities, and other
                 interesting explanatory insights. In particular, static
                 group anomaly detection is the process of identifying
                 groups that are not consistent with regular group
                 patterns, while dynamic group change detection assesses
                 significant differences in the state of a group over a
                 period of time. Since both group anomaly detection and
                 group change detection share fundamental ideas, this
                 survey article provides a clearer and deeper
                 understanding of group deviation detection research in
                 static and dynamic situations.",
  acknowledgement = ack-nhfb,
  articleno =    "77",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tamine:2018:ECI,
  author =       "Lynda Tamine and Mariam Daoud",
  title =        "Evaluation in Contextual Information Retrieval:
                 Foundations and Recent Advances within the Challenges
                 of Context Dynamicity and Data Privacy",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "78:1--78:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3204940",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Context such as the user's search history,
                 demographics, devices, and surroundings, has become
                 prevalent in various domains of information seeking and
                 retrieval such as mobile search, task-based search, and
                 social search. While evaluation is central and has a
                 long history in information retrieval, it faces the big
                 challenge of designing an appropriate methodology that
                 embeds the context into evaluation settings. In this
                 article, we present a unified summary of a wide range
                 of main and recent progress in contextual information
                 retrieval evaluation that leverages diverse context
                 dimensions and uses different principles,
                 methodologies, and levels of measurements. More
                 specifically, this survey article aims to fill two main
                 gaps in the literature: First, it provides a critical
                 summary and comparison of existing contextual
                 information retrieval evaluation methodologies and
                 metrics according to a simple stratification model;
                 second, it points out the impact of context dynamicity
                 and data privacy on the evaluation design. Finally, we
                 recommend promising research directions for future
                 investigations.",
  acknowledgement = ack-nhfb,
  articleno =    "78",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Acar:2018:SHE,
  author =       "Abbas Acar and Hidayet Aksu and A. Selcuk Uluagac and
                 Mauro Conti",
  title =        "A Survey on Homomorphic Encryption Schemes: Theory and
                 Implementation",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "79:1--79:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3214303",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  abstract =     "Legacy encryption systems depend on sharing a key
                 (public or private) among the peers involved in
                 exchanging an encrypted message. However, this approach
                 poses privacy concerns. The users or service providers
                 with the key have exclusive rights on the data.
                 Especially with popular cloud services, control over
                 the privacy of the sensitive data is lost. Even when
                 the keys are not shared, the encrypted material is
                 shared with a third party that does not necessarily
                 need to access the content. Moreover, untrusted
                 servers, providers, and cloud operators can keep
                 identifying elements of users long after users end the
                 relationship with the services. Indeed, Homomorphic
                 Encryption (HE), a special kind of encryption scheme,
                 can address these concerns as it allows any third party
                 to operate on the encrypted data without decrypting it
                 in advance. Although this extremely useful feature of
                 the HE scheme has been known for over 30 years, the
                 first plausible and achievable Fully Homomorphic
                 Encryption (FHE) scheme, which allows any computable
                 function to perform on the encrypted data, was
                 introduced by Craig Gentry in 2009. Even though this
                 was a major achievement, different implementations so
                 far demonstrated that FHE still needs to be improved
                 significantly to be practical on every platform.
                 Therefore, this survey focuses on HE and FHE schemes.
                 First, we present the basics of HE and the details of
                 the well-known Partially Homomorphic Encryption (PHE)
                 and Somewhat Homomorphic Encryption (SWHE), which are
                 important pillars for achieving FHE. Then, the main FHE
                 families, which have become the base for the other
                 follow-up FHE schemes, are presented. Furthermore, the
                 implementations and recent improvements in Gentry-type
                 FHE schemes are also surveyed. Finally, further
                 research directions are discussed. This survey is
                 intended to give a clear knowledge and foundation to
                 researchers and practitioners interested in knowing,
                 applying, and extending the state-of-the-art HE, PHE,
                 SWHE, and FHE systems.",
  acknowledgement = ack-nhfb,
  articleno =    "79",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Han:2018:DTC,
  author =       "Xiao Han and Nizar Kheir and Davide Balzarotti",
  title =        "Deception Techniques in Computer Security: a Research
                 Perspective",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "80:1--80:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3214305",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "A recent trend both in academia and industry is to
                 explore the use of deception techniques to achieve
                 proactive attack detection and defense-to the point of
                 marketing intrusion deception solutions as
                 zero-false-positive intrusion detection. However, there
                 is still a general lack of understanding of deception
                 techniques from a research perspective, and it is not
                 clear how the effectiveness of these solutions can be
                 measured and compared with other security approaches.
                 To shed light on this topic, we introduce a
                 comprehensive classification of existing solutions and
                 survey the current application of deception techniques
                 in computer security. Furthermore, we discuss the
                 limitations of existing solutions, and we analyze
                 several open research directions, including the design
                 of strategies to help defenders to design and integrate
                 deception within a target architecture, the study of
                 automated ways to deploy deception in complex systems,
                 the update and re-deployment of deception, and, most
                 importantly, the design of new techniques and
                 experiments to evaluate the effectiveness of the
                 existing deception techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Allamanis:2018:SML,
  author =       "Miltiadis Allamanis and Earl T. Barr and Premkumar
                 Devanbu and Charles Sutton",
  title =        "A Survey of Machine Learning for Big Code and
                 Naturalness",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "81:1--81:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3212695",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Research at the intersection of machine learning,
                 programming languages, and software engineering has
                 recently taken important steps in proposing learnable
                 probabilistic models of source code that exploit the
                 abundance of patterns of code. In this article, we
                 survey this work. We contrast programming languages
                 against natural languages and discuss how these
                 similarities and differences drive the design of
                 probabilistic models. We present a taxonomy based on
                 the underlying design principles of each model and use
                 it to navigate the literature. Then, we review how
                 researchers have adapted these models to application
                 areas and discuss cross-cutting and
                 application-specific challenges and opportunities.",
  acknowledgement = ack-nhfb,
  articleno =    "81",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Singh:2018:SMM,
  author =       "Harcharan Jit Singh and Seema Bawa",
  title =        "Scalable Metadata Management Techniques for
                 Ultra-Large Distributed Storage Systems --- A
                 Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "82:1--82:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3212686",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The provisioning of an efficient ultra-large scalable
                 distributed storage system for expanding cloud
                 applications has been a challenging job for researchers
                 in academia and industry. In such an ultra-large-scale
                 storage system, data are distributed on multiple
                 storage nodes for performance, scalability, and
                 availability. The access to this distributed data is
                 through its metadata, maintained by multiple metadata
                 servers. The metadata carries information about the
                 physical address of data and access privileges. The
                 efficiency of a storage system highly depends on
                 effective metadata management. This research presents
                 an extensive systematic literature analysis of metadata
                 management techniques in storage systems. This research
                 work will help researchers to find the significance of
                 metadata management and important parameters of
                 metadata management techniques for storage systems.
                 Methodical examination of metadata management
                 techniques developed by various industry and research
                 groups is described. The different metadata
                 distribution techniques lead to various taxonomies.
                 Furthermore, the article investigates techniques based
                 on distribution structures and key parameters of
                 metadata management. It also presents strengths and
                 weaknesses of individual existing techniques that will
                 help researchers to select the most appropriate
                 technique for specific applications. Finally, it
                 discusses existing challenges and significant research
                 directions in metadata management for researchers.",
  acknowledgement = ack-nhfb,
  articleno =    "82",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Atluri:2018:STD,
  author =       "Gowtham Atluri and Anuj Karpatne and Vipin Kumar",
  title =        "Spatio-Temporal Data Mining: a Survey of Problems and
                 Methods",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "83:1--83:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3161602",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Large volumes of spatio-temporal data are increasingly
                 collected and studied in diverse domains, including
                 climate science, social sciences, neuroscience,
                 epidemiology, transportation, mobile health, and Earth
                 sciences. Spatio-temporal data differ from relational
                 data for which computational approaches are developed
                 in the data-mining community for multiple decades in
                 that both spatial and temporal attributes are available
                 in addition to the actual measurements/attributes. The
                 presence of these attributes introduces additional
                 challenges that needs to be dealt with. Approaches for
                 mining spatio-temporal data have been studied for over
                 a decade in the data-mining community. In this article,
                 we present a broad survey of this relatively young
                 field of spatio-temporal data mining. We discuss
                 different types of spatio-temporal data and the
                 relevant data-mining questions that arise in the
                 context of analyzing each of these datasets. Based on
                 the nature of the data-mining problem studied, we
                 classify literature on spatio-temporal data mining into
                 six major categories: clustering, predictive learning,
                 change detection, frequent pattern mining, anomaly
                 detection, and relationship mining. We discuss the
                 various forms of spatio-temporal data-mining problems
                 in each of these categories.",
  acknowledgement = ack-nhfb,
  articleno =    "83",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wylot:2018:RDS,
  author =       "Marcin Wylot and Manfred Hauswirth and Philippe
                 Cudr{\'e}-Mauroux and Sherif Sakr",
  title =        "{RDF} Data Storage and Query Processing Schemes: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "84:1--84:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3177850",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The Resource Description Framework (RDF) represents a
                 main ingredient and data representation format for
                 Linked Data and the Semantic Web. It supports a generic
                 graph-based data model and data representation format
                 for describing things, including their relationships
                 with other things. As the size of RDF datasets is
                 growing fast, RDF data management systems must be able
                 to cope with growing amounts of data. Even though
                 physically handling RDF data using a relational table
                 is possible, querying a giant triple table becomes very
                 expensive because of the multiple nested joins required
                 for answering graph queries. In addition, the
                 heterogeneity of RDF Data poses entirely new challenges
                 to database systems. This article provides a
                 comprehensive study of the state of the art in handling
                 and querying RDF data. In particular, we focus on data
                 storage techniques, indexing strategies, and query
                 execution mechanisms. Moreover, we provide a
                 classification of existing systems and approaches. We
                 also provide an overview of the various benchmarking
                 efforts in this context and discuss some of the open
                 problems in this domain.",
  acknowledgement = ack-nhfb,
  articleno =    "84",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fortuna:2018:SAD,
  author =       "Paula Fortuna and S{\'e}rgio Nunes",
  title =        "A Survey on Automatic Detection of Hate Speech in
                 Text",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "85:1--85:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3232676",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "The scientific study of hate speech, from a computer
                 science point of view, is recent. This survey organizes
                 and describes the current state of the field, providing
                 a structured overview of previous approaches, including
                 core algorithms, methods, and main features used. This
                 work also discusses the complexity of the concept of
                 hate speech, defined in many platforms and contexts,
                 and provides a unifying definition. This area has an
                 unquestionable potential for societal impact,
                 particularly in online communities and digital media
                 platforms. The development and systematization of
                 shared resources, such as guidelines, annotated
                 datasets in multiple languages, and algorithms, is a
                 crucial step in advancing the automatic detection of
                 hate speech.",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Czajka:2018:PAD,
  author =       "Adam Czajka and Kevin W. Bowyer",
  title =        "Presentation Attack Detection for Iris Recognition: an
                 Assessment of the State-of-the-Art",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "86:1--86:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3232849",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Iris recognition is increasingly used in large-scale
                 applications. As a result, presentation attack
                 detection for iris recognition takes on fundamental
                 importance. This survey covers the diverse research
                 literature on this topic. Different categories of
                 presentation attack are described and placed in an
                 application-relevant framework, and the state of the
                 art in detecting each category of attack is summarized.
                 One conclusion from this is that presentation attack
                 detection for iris recognition is not yet a solved
                 problem. Datasets available for research are described,
                 research directions for the near- and medium-term
                 future are outlined, and a short list of recommended
                 readings is suggested.",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gupta:2018:ART,
  author =       "Nishant Gupta and Vibhash Yadav and Mayank Singh",
  title =        "Automated Regression Test Case Generation for {Web}
                 Application: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "4",
  pages =        "87:1--87:??",
  month =        sep,
  year =         "2018",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3232520",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:35 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Testing is one of the most important phases in the
                 development of any product or software. Various types
                 of software testing exist that have to be done to meet
                 the need of the software. Regression testing is one of
                 the crucial phases of testing where testing of a
                 program is done for the original test build along with
                 the modifications. In this article, various studies
                 proposed by the authors have been analysed focusing on
                 test cases generation and their approach toward web
                 application. A detailed study was conducted on
                 Regression Test Case Generation and its approaches
                 toward web application. From our detailed study, we
                 have found that very few approaches and methodologies
                 have been found that provide the real tool for test
                 case generation. There is a need of an automated
                 regression testing tool to generate the regression test
                 cases directly based on user requirements. These test
                 cases have to be generated and implemented by the tool
                 so that the reduction in the overall effort and cost
                 can be achieved. From our study, we have also found
                 that regression testing for web applications was not
                 investigated much, but in today's scenario web
                 applications are an integral part of our daily life and
                 so that needs to be tested for regression testing.",
  acknowledgement = ack-nhfb,
  articleno =    "87",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rastgoo:2019:CRP,
  author =       "Mohammad Naim Rastgoo and Bahareh Nakisa and Andry
                 Rakotonirainy and Vinod Chandran and Dian
                 Tjondronegoro",
  title =        "A Critical Review of Proactive Detection of Driver
                 Stress Levels Based on Multimodal Measurements",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "88:1--88:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3186585",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3186585",
  abstract =     "Stress is a major concern in daily life, as it imposes
                 significant and growing health and economic costs on
                 society every year. Stress and driving are a dangerous
                 combination and can lead to life-threatening
                 situations, evidenced by the large number of road
                 traffic crashes that occur every year due to driver
                 stress. In addition, the rate of general health issues
                 caused by work-related chronic stress in drivers who
                 work in public and private transport is greater than in
                 many other occupational groups. An in-vehicle warning
                 system for driver stress levels is needed to
                 continuously predict dangerous driving situations and
                 proactively alert drivers to ensure safe and
                 comfortable driving. As a result of the recent
                 developments in ambient intelligence, such as sensing
                 technologies, pervasive devices, context recognition,
                 and communications, driver stress can be automatically
                 detected using multimodal measurements. This critical
                 review investigates the state of the art of techniques
                 and achievements for automatic driver stress level
                 detection based on multimodal sensors and data. In this
                 work, the most widely used data followed by frequent
                 and highly performed selected features to detect driver
                 stress levels are analyzed and presented. This review
                 also discusses key methodological issues and gaps that
                 hinder the implementation of driver stress detection
                 systems and offers insights into future research
                 directions.",
  acknowledgement = ack-nhfb,
  articleno =    "88",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wan:2019:SGR,
  author =       "Changsheng Wan and Li Wang and Vir V. Phoha",
  title =        "A Survey on Gait Recognition",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "89:1--89:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3230633",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3230633",
  abstract =     "Recognizing people by their gait has become more and
                 more popular nowadays due to the following reasons.
                 First, gait recognition can work well remotely. Second,
                 gait recognition can be done from low-resolution videos
                 and with simple instrumentation. Third, gait
                 recognition can be done without the cooperation of
                 individuals. Fourth, gait recognition can work well
                 while other features such as faces and fingerprints are
                 hidden. Finally, gait features are typically difficult
                 to be impersonated. Recent ubiquity of smartphones that
                 capture gait patterns through accelerometers and
                 gyroscope and advances in machine learning have opened
                 new research directions and applications in gait
                 recognition. A timely survey that addresses current
                 advances is missing. In this article, we survey
                 research works in gait recognition. In addition to
                 recognition based on video, we address new modalities,
                 such as recognition based on floor sensors, radars, and
                 accelerometers; new approaches that include machine
                 learning methods; and examine challenges and
                 vulnerabilities in this field. In addition, we propose
                 a set of future research directions. Our review reveals
                 the current state-of-art and can be helpful to both
                 experts and newcomers of gait recognition. Moreover, it
                 lists future works and publicly available databases in
                 gait recognition for researchers.",
  acknowledgement = ack-nhfb,
  articleno =    "89",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kiennert:2019:SGT,
  author =       "Christophe Kiennert and Ziad Ismail and Herve Debar
                 and Jean Leneutre",
  title =        "A Survey on Game-Theoretic Approaches for Intrusion
                 Detection and Response Optimization",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "90:1--90:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3232848",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3232848",
  abstract =     "Intrusion Detection Systems (IDS) are key components
                 for securing critical infrastructures, capable of
                 detecting malicious activities on networks or hosts.
                 However, the efficiency of an IDS depends primarily on
                 both its configuration and its precision. The large
                 amount of network traffic that needs to be analyzed, in
                 addition to the increase in attacks' sophistication,
                 renders the optimization of intrusion detection an
                 important requirement for infrastructure security, and
                 a very active research subject. In the state of the
                 art, a number of approaches have been proposed to
                 improve the efficiency of intrusion detection and
                 response systems. In this article, we review the works
                 relying on decision-making techniques focused on game
                 theory and Markov decision processes to analyze the
                 interactions between the attacker and the defender, and
                 classify them according to the type of the optimization
                 problem they address. While these works provide
                 valuable insights for decision-making, we discuss the
                 limitations of these solutions as a whole, in
                 particular regarding the hypotheses in the models and
                 the validation methods. We also propose future research
                 directions to improve the integration of game-theoretic
                 approaches into IDS optimization techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "90",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Covaci:2019:MMR,
  author =       "Alexandra Covaci and Longhao Zou and Irina Tal and
                 Gabriel-Miro Muntean and Gheorghita Ghinea",
  title =        "Is Multimedia Multisensorial? --- {A} Review of
                 Mulsemedia Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "91:1--91:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3233774",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3233774",
  abstract =     "Mulsemedia-multiple sensorial media-makes possible the
                 inclusion of layered sensory stimulation and
                 interaction through multiple sensory channels. The
                 recent upsurge in technology and wearables provides
                 mulsemedia researchers a vehicle for potentially
                 boundless choice. However, in order to build systems
                 that integrate various senses, there are still some
                 issues that need to be addressed. This review deals
                 with mulsemedia topics that remain insufficiently
                 explored by previous work, with a focus on the
                 multi-multi (multiple media-multiple senses)
                 perspective, where multiple types of media engage
                 multiple senses. Moreover, it addresses the evolution
                 of previously identified challenges in this area and
                 formulates new exploration directions.",
  acknowledgement = ack-nhfb,
  articleno =    "91",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pouyanfar:2019:SDL,
  author =       "Samira Pouyanfar and Saad Sadiq and Yilin Yan and
                 Haiman Tian and Yudong Tao and Maria Presa Reyes and
                 Mei-Ling Shyu and Shu-Ching Chen and S. S. Iyengar",
  title =        "A Survey on Deep Learning: Algorithms, Techniques, and
                 Applications",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "92:1--92:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3234150",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3234150",
  abstract =     "The field of machine learning is witnessing its golden
                 era as deep learning slowly becomes the leader in this
                 domain. Deep learning uses multiple layers to represent
                 the abstractions of data to build computational models.
                 Some key enabler deep learning algorithms such as
                 generative adversarial networks, convolutional neural
                 networks, and model transfers have completely changed
                 our perception of information processing. However,
                 there exists an aperture of understanding behind this
                 tremendously fast-paced domain, because it was never
                 previously represented from a multiscope perspective.
                 The lack of core understanding renders these powerful
                 methods as black-box machines that inhibit development
                 at a fundamental level. Moreover, deep learning has
                 repeatedly been perceived as a silver bullet to all
                 stumbling blocks in machine learning, which is far from
                 the truth. This article presents a comprehensive review
                 of historical and recent state-of-the-art approaches in
                 visual, audio, and text processing; social network
                 analysis; and natural language processing, followed by
                 the in-depth analysis on pivoting and groundbreaking
                 advances in deep learning applications. It was also
                 undertaken to review the issues faced in deep learning
                 such as unsupervised learning, black-box models, and
                 online learning and to illustrate how these challenges
                 can be transformed into prolific future research
                 avenues.",
  acknowledgement = ack-nhfb,
  articleno =    "92",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Guidotti:2019:SME,
  author =       "Riccardo Guidotti and Anna Monreale and Salvatore
                 Ruggieri and Franco Turini and Fosca Giannotti and Dino
                 Pedreschi",
  title =        "A Survey of Methods for Explaining Black Box Models",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "93:1--93:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3236009",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3236009",
  abstract =     "In recent years, many accurate decision support
                 systems have been constructed as black boxes, that is
                 as systems that hide their internal logic to the user.
                 This lack of explanation constitutes both a practical
                 and an ethical issue. The literature reports many
                 approaches aimed at overcoming this crucial weakness,
                 sometimes at the cost of sacrificing accuracy for
                 interpretability. The applications in which black box
                 decision systems can be used are various, and each
                 approach is typically developed to provide a solution
                 for a specific problem and, as a consequence, it
                 explicitly or implicitly delineates its own definition
                 of interpretability and explanation. The aim of this
                 article is to provide a classification of the main
                 problems addressed in the literature with respect to
                 the notion of explanation and the type of black box
                 system. Given a problem definition, a black box type,
                 and a desired explanation, this survey should help the
                 researcher to find the proposals more useful for his
                 own work. The proposed classification of approaches to
                 open black box models should also be useful for putting
                 the many research open questions in perspective.",
  acknowledgement = ack-nhfb,
  articleno =    "93",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Avoine:2019:SDB,
  author =       "Gildas Avoine and Muhammed Ali Bing{\"o}l and Ioana
                 Boureanu and Srdjan Capkun and Gerhard Hancke and
                 S{\"u}leyman Kardas and Chong Hee Kim and C{\'e}dric
                 Lauradoux and Benjamin Martin and Jorge Munilla and
                 Alberto Peinado and Kasper Bonne Rasmussen and Dave
                 Singel{\'e}e and Aslan Tchamkerten and Rolando
                 Trujillo-Rasua and Serge Vaudenay",
  title =        "Security of Distance-Bounding: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "94:1--94:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3264628",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3264628",
  abstract =     "Distance-bounding protocols allow a verifier to both
                 authenticate a prover and evaluate whether the latter
                 is located in his vicinity. These protocols are of
                 particular interest in contactless systems, e.g.,
                 electronic payment or access control systems, which are
                 vulnerable to distance-based frauds. This survey
                 analyzes and compares in a unified manner many existing
                 distance-bounding protocols with respect to several key
                 security and complexity features.",
  acknowledgement = ack-nhfb,
  articleno =    "94",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Henriques:2019:TAT,
  author =       "Rui Henriques and Sara C. Madeira",
  title =        "Triclustering Algorithms for Three-Dimensional Data
                 Analysis: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "95:1--95:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3195833",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3195833",
  abstract =     "Three-dimensional data are increasingly prevalent
                 across biomedical and social domains. Notable examples
                 are gene-sample-time, individual-feature-time, or
                 node-node-time data, generally referred to as
                 observation-attribute-context data. The unsupervised
                 analysis of three-dimensional data can be pursued to
                 discover putative biological modules, disease
                 progression profiles, and communities of individuals
                 with coherent behavior, among other patterns of
                 interest. It is thus key to enhance the understanding
                 of complex biological, individual, and societal
                 systems. In this context, although clustering can be
                 applied to group observations, its relevance is limited
                 since observations in three-dimensional data domains
                 are typically only meaningfully correlated on subspaces
                 of the overall space. Biclustering tackles this
                 challenge but disregards the third dimension. In this
                 scenario, triclustering-the discovery of coherent
                 subspaces within three-dimensional data-has been
                 largely researched to tackle these problems. Despite
                 the diversity of contributions in this field, there
                 still lacks a structured view on the major requirements
                 of triclustering, desirable forms of homogeneity
                 (including coherency, structure, quality, locality, and
                 orthonormality criteria), and algorithmic approaches.
                 This work formalizes the triclustering task and its
                 scope, introduces a taxonomy to categorize the
                 contributions in the field, provides a comprehensive
                 comparison of state-of-the-art triclustering algorithms
                 according to their behavior and output, and lists
                 relevant real-world applications. Finally, it
                 highlights challenges and opportunities to advance the
                 field of triclustering and its applicability to complex
                 three-dimensional data analysis.",
  acknowledgement = ack-nhfb,
  articleno =    "95",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ashouri:2019:SCA,
  author =       "Amir H. Ashouri and William Killian and John Cavazos
                 and Gianluca Palermo and Cristina Silvano",
  title =        "A Survey on Compiler Autotuning using Machine
                 Learning",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "96:1--96:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3197978",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3197978",
  abstract =     "Since the mid-1990s, researchers have been trying to
                 use machine-learning-based approaches to solve a number
                 of different compiler optimization problems. These
                 techniques primarily enhance the quality of the
                 obtained results and, more importantly, make it
                 feasible to tackle two main compiler optimization
                 problems: optimization selection (choosing which
                 optimizations to apply) and phase-ordering (choosing
                 the order of applying optimizations). The compiler
                 optimization space continues to grow due to the
                 advancement of applications, increasing number of
                 compiler optimizations, and new target architectures.
                 Generic optimization passes in compilers cannot fully
                 leverage newly introduced optimizations and, therefore,
                 cannot keep up with the pace of increasing options.
                 This survey summarizes and classifies the recent
                 advances in using machine learning for the compiler
                 optimization field, particularly on the two major
                 problems of (1) selecting the best optimizations, and
                 (2) the phase-ordering of optimizations. The survey
                 highlights the approaches taken so far, the obtained
                 results, the fine-grain classification among different
                 approaches, and finally, the influential papers of the
                 field.",
  acknowledgement = ack-nhfb,
  articleno =    "96",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kumar:2019:KAC,
  author =       "Dileep Kumar and Akash Gandhamal and Sanjay Talbar and
                 Ahmad Fadzil Mohd Hani",
  title =        "Knee Articular Cartilage Segmentation from {MR}
                 Images: a Review",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "97:1--97:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3230631",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3230631",
  abstract =     "Articular cartilage (AC) is a flexible and soft yet
                 stiff tissue that can be visualized and interpreted
                 using magnetic resonance (MR) imaging for the
                 assessment of knee osteoarthritis. Segmentation of AC
                 from MR images is a challenging task that has been
                 investigated widely. The development of computational
                 methods to segment AC is highly dependent on various
                 image parameters, quality, tissue structure, and
                 acquisition protocol involved. This review focuses on
                 the challenges faced during AC segmentation from MR
                 images followed by the discussion on computational
                 methods for semi/fully automated approaches, whilst
                 performances parameters and their significances have
                 also been explored. Furthermore, hybrid approaches used
                 to segment AC are reviewed. This review indicates that
                 despite the challenges in AC segmentation, the
                 semi-automated method utilizing advanced computational
                 methods such as active contour and clustering have
                 shown significant accuracy. Fully automated AC
                 segmentation methods have obtained moderate accuracy
                 and show suitability for extensive clinical studies
                 whilst advanced methods are being investigated that
                 have led to achieving significantly better sensitivity.
                 In conclusion, this review indicates that research in
                 AC segmentation from MR images is moving towards the
                 development of fully automated methods using advanced
                 multi-level, multi-data, and multi-approach techniques
                 to provide assistance in clinical studies.",
  acknowledgement = ack-nhfb,
  articleno =    "97",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Liu:2019:HBI,
  author =       "Ming Liu and Zhi Xue and Xianghua Xu and Changmin
                 Zhong and Jinjun Chen",
  title =        "Host-Based Intrusion Detection System with System
                 Calls: Review and Future Trends",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "98:1--98:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3214304",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3214304",
  abstract =     "In a contemporary data center, Linux applications
                 often generate a large quantity of real-time system
                 call traces, which are not suitable for traditional
                 host-based intrusion detection systems deployed on
                 every single host. Training data mining models with
                 system calls on a single host that has static computing
                 and storage capacity is time-consuming, and
                 intermediate datasets are not capable of being
                 efficiently handled. It is cumbersome for the
                 maintenance and updating of host-based intrusion
                 detection systems (HIDS) installed on every physical or
                 virtual host, and comprehensive system call analysis
                 can hardly be performed to detect complex and
                 distributed attacks among multiple hosts. Considering
                 these limitations of current system-call-based HIDS, in
                 this article, we provide a review of the development of
                 system-call-based HIDS and future research trends.
                 Algorithms and techniques relevant to system-call-based
                 HIDS are investigated, including feature extraction
                 methods and various data mining algorithms. The HIDS
                 dataset issues are discussed, including currently
                 available datasets with system calls and approaches for
                 researchers to generate new datasets. The application
                 of system-call-based HIDS on current embedded systems
                 is studied, and related works are investigated.
                 Finally, future research trends are forecast regarding
                 three aspects, namely, the reduction of the
                 false-positive rate, the improvement of detection
                 efficiency, and the enhancement of collaborative
                 security.",
  acknowledgement = ack-nhfb,
  articleno =    "98",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Doherty:2019:EHC,
  author =       "Kevin Doherty and Gavin Doherty",
  title =        "Engagement in {HCI}: Conception, Theory and
                 Measurement",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "99:1--99:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3234149",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3234149",
  abstract =     "Engaging users is a priority for designers of products
                 and services of every kind. The need to understand
                 users' experiences has motivated a focus on user
                 engagement across computer science. However, to date,
                 there has been limited review of how Human--Computer
                 Interaction and computer science research interprets
                 and employs the concept. Questions persist concerning
                 its conception, abstraction, and measurement. This
                 article presents a systematic review of engagement
                 spanning a corpus of 351 articles and 102 definitions.
                 We map the current state of engagement research,
                 including the diverse interpretation, theory, and
                 measurement of the concept. We describe the ecology of
                 engagement and strategies for the design of engaging
                 experiences, discuss the value of the concept and its
                 relationship to other terms, and present a set of
                 guidelines and opportunities for future research.",
  acknowledgement = ack-nhfb,
  articleno =    "99",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tziakouris:2019:SSA,
  author =       "Giannis Tziakouris and Rami Bahsoon and Muhammad Ali
                 Babar",
  title =        "A Survey on Self-Adaptive Security for Large-scale
                 Open Environments",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "100:1--100:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3234148",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3234148",
  abstract =     "Contemporary software systems operate in
                 heterogeneous, dynamic, and distributed environments,
                 where security needs change at runtime. The security
                 solutions for such systems need to be adaptive for the
                 continuous satisfaction of the software systems'
                 security goals. Whilst the existing research on
                 self-adaptive security has made notable advancement
                 towards designing and engineering self-adaptive
                 security solutions, there exists little work on the
                 taxonomic analysis of the architectures of the reported
                 research and its applicability for open and ultra-large
                 environments. We propose an architecture-centric
                 taxonomy for mapping and comparing the current research
                 and identifying the future research directions in this
                 field. The proposed taxonomy has been used to review
                 the representative work on the architectural
                 characteristics that self-adaptive security systems
                 must maintain for their effective application in
                 large-scale open environments. We reflect on the
                 findings from the taxonomic analysis and discuss the
                 design principles, research challenges and limitations
                 reported in the state of the art and practice. We
                 outline the directions for the future research on
                 architectural level support for self-adaptive security
                 systems for large-scale open environments.",
  acknowledgement = ack-nhfb,
  articleno =    "100",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{DeSiqueiraBraga:2019:SCT,
  author =       "Diego {De Siqueira Braga} and Marco Niemann and Bernd
                 Hellingrath and Fernando Buarque {De Lima Neto}",
  title =        "Survey on Computational Trust and Reputation Models",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "101:1--101:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3236008",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3236008",
  abstract =     "Over the recent years, computational trust and
                 reputation models have become an invaluable method to
                 improve computer-computer and human-computer
                 interaction. As a result, a considerable amount of
                 research has been published trying to solve open
                 problems and improving existing models. This survey
                 will bring additional structure into the already
                 conducted research on both topics. After recapitulating
                 the major underlying concepts, a new integrated review
                 and analysis scheme for reputation and trust models is
                 put forward. Using highly recognized review papers in
                 this domain as a basis, this article will also
                 introduce additional evaluation metrics to account for
                 characteristics so far unstudied. A subsequent
                 application of the new review schema on 40 top recent
                 publications in this scientific field revealed
                 interesting insights. While the area of computational
                 trust and reputation models is still a very active
                 research branch, the analysis carried out here was able
                 to show that some aspects have already started to
                 converge, whereas others are still subject to vivid
                 discussions.",
  acknowledgement = ack-nhfb,
  articleno =    "101",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Grando:2019:MLN,
  author =       "Felipe Grando and Lisandro Z. Granville and Luis C.
                 Lamb",
  title =        "Machine Learning in Network Centrality Measures:
                 Tutorial and Outlook",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "102:1--102:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3237192",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3237192",
  abstract =     "Complex networks are ubiquitous to several computer
                 science domains. Centrality measures are an important
                 analysis mechanism to uncover vital elements of complex
                 networks. However, these metrics have high
                 computational costs and requirements that hinder their
                 applications in large real-world networks. In this
                 tutorial, we explain how the use of neural network
                 learning algorithms can render the application of the
                 metrics in complex networks of arbitrary size.
                 Moreover, the tutorial describes how to identify the
                 best configuration for neural network training and
                 learning such for tasks, besides presenting an easy way
                 to generate and acquire training data. We do so by
                 means of a general methodology, using complex network
                 models adaptable to any application. We show that a
                 regression model generated by the neural network
                 successfully approximates the metric values and
                 therefore is a robust, effective alternative in
                 real-world applications. The methodology and proposed
                 machine-learning model use only a fraction of time with
                 respect to other approximation algorithms, which is
                 crucial in complex network applications.",
  acknowledgement = ack-nhfb,
  articleno =    "102",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Moustaka:2019:SRS,
  author =       "Vaia Moustaka and Athena Vakali and Leonidas G.
                 Anthopoulos",
  title =        "A Systematic Review for Smart City Data Analytics",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "103:1--103:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3239566",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3239566",
  abstract =     "Smart cities (SCs) are becoming highly sophisticated
                 ecosystems at which innovative solutions and smart
                 services are being deployed. These ecosystems consider
                 SCs as data production and sharing engines, setting new
                 challenges for building effective SC architectures and
                 novel services. The aim of this article is to ``connect
                 the pieces'' among Data Science and SC domains, with a
                 systematic literature review which identifies the core
                 topics, services, and methods applied in SC data
                 monitoring. The survey focuses on data harvesting and
                 data mining processes over repeated SC data cycles. A
                 survey protocol is followed to reach both quantitative
                 and semantically important entities. The review results
                 generate useful taxonomies for data scientists in the
                 SC context, which offers clear guidelines for
                 corresponding future works. In particular, a taxonomy
                 is proposed for each of the main SC data entities,
                 namely, the ``D Taxonomy'' for the data production, the
                 ``M Taxonomy'' for data analytics methods, and the ``S
                 Taxonomy'' for smart services. Each of these taxonomies
                 clearly places entities in a classification which is
                 beneficial for multiple stakeholders and for multiple
                 domains in urban smartness targeting. Such indicative
                 scenarios are outlined and conclusions are quite
                 promising for systemizing.",
  acknowledgement = ack-nhfb,
  articleno =    "103",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gill:2019:TFD,
  author =       "Sukhpal Singh Gill and Rajkumar Buyya",
  title =        "A Taxonomy and Future Directions for Sustainable Cloud
                 Computing: 360 Degree View",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "104:1--104:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3241038",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3241038",
  abstract =     "The cloud-computing paradigm offers on-demand services
                 over the Internet and supports a wide variety of
                 applications. With the recent growth of Internet of
                 Things (IoT)--based applications, the use of cloud
                 services is increasing exponentially. The next
                 generation of cloud computing must be energy efficient
                 and sustainable to fulfill end-user requirements, which
                 are changing dynamically. Presently, cloud providers
                 are facing challenges to ensure the energy efficiency
                 and sustainability of their services. The use of a
                 large number of cloud datacenters increases cost as
                 well as carbon footprints, which further affects the
                 sustainability of cloud services. In this article, we
                 propose a comprehensive taxonomy of sustainable cloud
                 computing. The taxonomy is used to investigate the
                 existing techniques for sustainability that need
                 careful attention and investigation as proposed by
                 several academic and industry groups. The current
                 research on sustainable cloud computing is organized
                 into several categories: application design,
                 sustainability metrics, capacity planning, energy
                 management, virtualization, thermal-aware scheduling,
                 cooling management, renewable energy, and waste heat
                 utilization. The existing techniques have been compared
                 and categorized based on common characteristics and
                 properties. A conceptual model for sustainable cloud
                 computing has been presented along with a discussion on
                 future research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "104",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Buyya:2019:MFG,
  author =       "Rajkumar Buyya and Satish Narayana Srirama and
                 Giuliano Casale and Rodrigo Calheiros and Yogesh
                 Simmhan and Blesson Varghese and Erol Gelenbe and
                 Bahman Javadi and Luis Miguel Vaquero and Marco A. S.
                 Netto and Adel Nadjaran Toosi and Maria Alejandra
                 Rodriguez and Ignacio M. Llorente and Sabrina {De
                 Capitani Di Vimercati} and Pierangela Samarati and
                 Dejan Milojicic and Carlos Varela and Rami Bahsoon and
                 Marcos {Dias De Assun{\c{c}}{\~a}o} and Omer Rana and
                 Wanlei Zhou and Hai Jin and Wolfgang Gentzsch and
                 Albert Y. Zomaya and Haiying Shen",
  title =        "A Manifesto for Future Generation Cloud Computing:
                 Research Directions for the Next Decade",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "105:1--105:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3241737",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3241737",
  abstract =     "The Cloud computing paradigm has revolutionised the
                 computer science horizon during the past decade and has
                 enabled the emergence of computing as the fifth
                 utility. It has captured significant attention of
                 academia, industries, and government bodies. Now, it
                 has emerged as the backbone of modern economy by
                 offering subscription-based services anytime, anywhere
                 following a pay-as-you-go model. This has instigated
                 (1) shorter establishment times for start-ups, (2)
                 creation of scalable global enterprise applications,
                 (3) better cost-to-value associativity for scientific
                 and high-performance computing applications, and (4)
                 different invocation/execution models for pervasive and
                 ubiquitous applications. The recent technological
                 developments and paradigms such as serverless
                 computing, software-defined networking, Internet of
                 Things, and processing at network edge are creating new
                 opportunities for Cloud computing. However, they are
                 also posing several new challenges and creating the
                 need for new approaches and research strategies, as
                 well as the re-evaluation of the models that were
                 developed to address issues such as scalability,
                 elasticity, reliability, security, sustainability, and
                 application models. The proposed manifesto addresses
                 them by identifying the major open challenges in Cloud
                 computing, emerging trends, and impact areas. It then
                 offers research directions for the next decade, thus
                 helping in the realisation of Future Generation Cloud
                 Computing.",
  acknowledgement = ack-nhfb,
  articleno =    "105",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Smirnova:2019:REU,
  author =       "Alisa Smirnova and Philippe Cudr{\'e}-Mauroux",
  title =        "Relation Extraction Using Distant Supervision: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "106:1--106:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3241741",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3241741",
  abstract =     "Relation extraction is a subtask of information
                 extraction where semantic relationships are extracted
                 from natural language text and then classified. In
                 essence, it allows us to acquire structured knowledge
                 from unstructured text. In this article, we present a
                 survey of relation extraction methods that leverage
                 pre-existing structured or semi-structured data to
                 guide the extraction process. We introduce a taxonomy
                 of existing methods and describe distant supervision
                 approaches in detail. We describe, in addition, the
                 evaluation methodologies and the datasets commonly used
                 for quality assessment. Finally, we give a high-level
                 outlook on the field, highlighting open problems as
                 well as the most promising research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "106",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nayyer:2019:SCB,
  author =       "M. Ziad Nayyer and Imran Raza and Syed Asad Hussain",
  title =        "A Survey of Cloudlet-Based Mobile Augmentation
                 Approaches for Resource Optimization",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "107:1--107:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3241738",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3241738",
  abstract =     "Mobile devices (MDs) face resource scarcity challenges
                 owing to limited energy and computational resources.
                 Mobile cloud computing (MCC) offers a resource-rich
                 environment to MDs for offloading compute-intensive
                 tasks encountering resource scarcity challenges.
                 However, users are unable to exploit its full potential
                 owing to challenges of distance, limited bandwidth, and
                 seamless connectivity between the remote cloud (RC) and
                 MDs in the conventional MCC model. The cloudlet-based
                 solution is widely used to address these challenges.
                 The response of the cloudlet-based solution is faster
                 than the conventional mobile cloud-computing model,
                 rendering it suitable for the Internet of Things (IoT)
                 and Smart Cities (SC). However, with the increase in
                 devices and workloads, the cloudlet-based solution has
                 to deal with resource-scarcity challenges, thus,
                 forwarding the requests to remote clouds. This study
                 has been carried out to provide an insight into
                 existing cloudlet-based mobile augmentation (CtMA)
                 approaches and highlights the underlying limitations
                 for resource optimization. Furthermore, numerous
                 performance parameters have been identified and their
                 detailed comparative analysis has been used to quantify
                 the efficiency of CtMA approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "107",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Biorn-Hansen:2019:STC,
  author =       "Andreas Bi{\o}rn-Hansen and Tor-Morten Gr{\o}nli and
                 Gheorghita Ghinea",
  title =        "A Survey and Taxonomy of Core Concepts and Research
                 Challenges in Cross-Platform Mobile Development",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "108:1--108:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3241739",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3241739",
  abstract =     "Developing applications targeting mobile devices is a
                 complex task involving numerous options, technologies,
                 and trade-offs, mostly due to the proliferation and
                 fragmentation of devices and platforms. As a result of
                 this, cross-platform app development has enjoyed the
                 attention of practitioners and academia for the
                 previous decade. Throughout this review, we assess the
                 academic body of knowledge and report on the state of
                 research on the field. We do so with a particular
                 emphasis on core concepts, including those of user
                 experience, device features, performance, and security.
                 Our findings illustrate that the state of research
                 demand for empirical verification of an array of
                 unbacked claims, and that a particular focus on
                 qualitative user-oriented research is essential.
                 Through our outlined taxonomy and state of research
                 overview, we identify research gaps and challenges, and
                 provide numerous suggestions for further research.",
  acknowledgement = ack-nhfb,
  articleno =    "108",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Khan:2019:SPN,
  author =       "Yasir Imtiaz Khan and Alexandros Konios and Nicolas
                 Guelfi",
  title =        "A Survey of {Petri} Nets Slicing",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "5",
  pages =        "109:1--109:??",
  month =        jan,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3241736",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3241736",
  abstract =     "Petri nets slicing is a technique that aims to improve
                 the verification of systems modeled in Petri nets.
                 Petri nets slicing was first developed to facilitate
                 debugging, but then was used for the alleviation of the
                 state space explosion problem for the model checking of
                 Petri nets. In this article, different slicing
                 techniques are studied along with their algorithms
                 introducing: (i) a classification of Petri nets slicing
                 algorithms based on their construction methodology and
                 objective (such as improving state space analysis or
                 testing); (ii) a qualitative and quantitative
                 discussion and comparison of major differences such as
                 accuracy and efficiency: (iii) a syntactic unification
                 of slicing algorithms that improve state space analysis
                 for easy and clear understanding; and (iv) applications
                 of slicing for multiple perspectives. Furthermore, some
                 recent improvements to slicing algorithms are
                 presented, which can certainly reduce the slice size
                 even for strongly connected nets. A noteworthy use of
                 this survey is for the selection and improvement of
                 slicing techniques for optimizing the verification of
                 state event models.",
  acknowledgement = ack-nhfb,
  articleno =    "109",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wang:2019:MLS,
  author =       "Ping Wang and Yan Li and Chandan K. Reddy",
  title =        "Machine Learning for Survival Analysis: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "110:1--110:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3214306",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3214306",
  abstract =     "Survival analysis is a subfield of statistics where
                 the goal is to analyze and model data where the outcome
                 is the time until an event of interest occurs. One of
                 the main challenges in this context is the presence of
                 instances whose event outcomes become unobservable
                 after a certain time point or when some instances do
                 not experience any event during the monitoring period.
                 This so-called censoring can be handled most
                 effectively using survival analysis techniques.
                 Traditionally, statistical approaches have been widely
                 developed in the literature to overcome the issue of
                 censoring. In addition, many machine learning
                 algorithms have been adapted to deal with such censored
                 data and tackle other challenging problems that arise
                 in real-world data. In this survey, we provide a
                 comprehensive and structured review of the statistical
                 methods typically used and the machine learning
                 techniques developed for survival analysis, along with
                 a detailed taxonomy of the existing methods. We also
                 discuss several topics that are closely related to
                 survival analysis and describe several successful
                 applications in a variety of real-world application
                 domains. We hope that this article will give readers a
                 more comprehensive understanding of recent advances in
                 survival analysis and offer some guidelines for
                 applying these approaches to solve new problems arising
                 in applications involving censored data.",
  acknowledgement = ack-nhfb,
  articleno =    "110",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ferrer:2019:TDC,
  author =       "Ana Juan Ferrer and Joan Manuel Marqu{\`e}s and Josep
                 Jorba",
  title =        "Towards the Decentralised Cloud: Survey on Approaches
                 and Challenges for Mobile, Ad hoc, and Edge Computing",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "111:1--111:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3243929",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3243929",
  abstract =     "Cloud computing emerged as a centralised paradigm that
                 made ``infinite'' computing resources available on
                 demand. Nevertheless, the ever-increasing computing
                 capacities present on smart connected things and
                 devices calls for the decentralisation of Cloud
                 computing to avoid unnecessary latencies and fully
                 exploit accessible computing capacities at the edges of
                 the network. Whilst these decentralised Cloud models
                 represent a significant breakthrough from a Cloud
                 perspective, they are rooted in existing research areas
                 such as Mobile Cloud Computing, Mobile Ad hoc
                 Computing, and Edge computing. This article analyses
                 the pre-existing works to determine their role in
                 Decentralised Cloud and future computing development.",
  acknowledgement = ack-nhfb,
  articleno =    "111",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gui:2019:SBB,
  author =       "Qiong Gui and Maria V. Ruiz-Blondet and Sarah Laszlo
                 and Zhanpeng Jin",
  title =        "A Survey on Brain Biometrics",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "112:1--112:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3230632",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3230632",
  abstract =     "Brainwaves, which reflect brain electrical activity
                 and have been studied for a long time in the domain of
                 cognitive neuroscience, have recently been proposed as
                 a promising biometric approach due to their unique
                 advantages of confidentiality, resistance to
                 spoofing/circumvention, sensitivity to emotional and
                 mental state, continuous nature, and cancelability.
                 Recent research efforts have explored many possible
                 ways of using brain biometrics and demonstrated that
                 they are a promising candidate for more robust and
                 secure personal identification and authentication.
                 Although existing research on brain biometrics has
                 obtained some intriguing insights, much work is still
                 necessary to achieve a reliable ready-to-deploy brain
                 biometric system. This article aims to provide a
                 detailed survey of the current literature and outline
                 the scientific work conducted on brain biometric
                 systems. It provides an up-to-date review of
                 state-of-the-art acquisition, collection, processing,
                 and analysis of brainwave signals, publicly available
                 databases, feature extraction and selection, and
                 classifiers. Furthermore, it highlights some of the
                 emerging open research problems for brain biometrics,
                 including multimodality, security, permanence, and
                 stability.",
  acknowledgement = ack-nhfb,
  articleno =    "112",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Israelsen:2019:DCA,
  author =       "Brett W. Israelsen and Nisar R. Ahmed",
  title =        "``{Dave} \ldots{} {I} can assure you \ldots{} that
                 it's going to be all right \ldots{}'' {A} Definition,
                 Case for, and Survey of Algorithmic Assurances in
                 Human--Autonomy Trust Relationships",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "113:1--113:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3267338",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3267338",
  abstract =     "People who design, use, and are affected by autonomous
                 artificially intelligent agents want to be able to
                 trust such agents-that is, to know that these agents
                 will perform correctly, to understand the reasoning
                 behind their actions, and to know how to use them
                 appropriately. Many techniques have been devised to
                 assess and influence human trust in artificially
                 intelligent agents. However, these approaches are
                 typically ad hoc and have not been formally related to
                 each other or to formal trust models. This article
                 presents a survey of algorithmic assurances, i.e.,
                 programmed components of agent operation that are
                 expressly designed to calibrate user trust in
                 artificially intelligent agents. Algorithmic assurances
                 are first formally defined and classified from the
                 perspective of formally modeled human-artificially
                 intelligent agent trust relationships. Building on
                 these definitions, a synthesis of research across
                 communities such as machine learning, human-computer
                 interaction, robotics, e-commerce, and others reveals
                 that assurance algorithms naturally fall along a
                 spectrum in terms of their impact on an agent's core
                 functionality, with seven notable classes ranging from
                 integral assurances (which impact an agent's core
                 functionality) to supplemental assurances (which have
                 no direct effect on agent performance). Common
                 approaches within each of these classes are identified
                 and discussed; benefits and drawbacks of different
                 approaches are also investigated.",
  acknowledgement = ack-nhfb,
  articleno =    "113",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bonfim:2019:INS,
  author =       "Michel S. Bonfim and Kelvin L. Dias and Stenio F. L.
                 Fernandes",
  title =        "Integrated {NFV\slash SDN} Architectures: a Systematic
                 Literature Review",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "114:1--114:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3172866",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3172866",
  abstract =     "Network Functions Virtualization (NFV) and
                 Software-Defined Networking (SDN) are new paradigms in
                 the move towards open software and network hardware.
                 While NFV aims to virtualize network functions and
                 deploy them into general purpose hardware, SDN makes
                 networks programmable by separating the control and
                 data planes. NFV and SDN are complementary technologies
                 capable of providing one network solution. SDN can
                 provide connectivity between Virtual Network Functions
                 (VNFs) in a flexible and automated way, whereas NFV can
                 use SDN as part of a service function chain. There are
                 many studies designing NFV/SDN architectures in
                 different environments. Researchers have been trying to
                 address reliability, performance, and scalability
                 problems using different architectural designs. This
                 Systematic Literature Review (SLR) focuses on
                 integrated NFV/SDN architectures, with the following
                 goals: (i) to investigate and provide an in-depth
                 review of the state of the art of NFV/SDN
                 architectures, (ii) to synthesize their architectural
                 designs, and (iii) to identify areas for further
                 improvements. Broadly, this SLR will encourage
                 researchers to advance the current stage of development
                 (i.e., the state of the practice) of integrated NFV/SDN
                 architectures and shed some light on future research
                 efforts and the challenges faced.",
  acknowledgement = ack-nhfb,
  articleno =    "114",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bashir:2019:SCO,
  author =       "Janibul Bashir and Eldhose Peter and Smruti R.
                 Sarangi",
  title =        "A Survey of On-Chip Optical Interconnects",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "115:1--115:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3267934",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3267934",
  abstract =     "Numerous challenges present themselves when scaling
                 traditional on-chip electrical networks to large
                 manycore processors. Some of these challenges include
                 high latency, limitations on bandwidth, and power
                 consumption. Researchers have therefore been looking
                 for alternatives. As a result, on-chip nanophotonics
                 has emerged as a strong substitute for traditional
                 electrical NoCs. As of 2017, on-chip optical networks
                 have moved out of textbooks and found commercial
                 applicability in short-haul networks such as links
                 between servers on the same rack or between two
                 components on the motherboard. It is widely
                 acknowledged that in the near future, optical
                 technologies will move beyond research prototypes and
                 find their way into the chip. Optical networks already
                 feature in the roadmaps of major processor
                 manufacturers and most on-chip optical devices are
                 beginning to show signs of maturity. This article is
                 designed to provide a survey of on-chip optical
                 technologies covering the basic physics underlying the
                 operation of optical technologies, optical devices,
                 popular architectures, power reduction techniques, and
                 applications. The aim of this survey article is to
                 start from the fundamental concepts and move on to the
                 latest in the field of on-chip optical interconnects.",
  acknowledgement = ack-nhfb,
  articleno =    "115",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dizdarevic:2019:SCP,
  author =       "Jasenka Dizdarevi{\'c} and Francisco Carpio and Admela
                 Jukan and Xavi Masip-Bruin",
  title =        "A Survey of Communication Protocols for {Internet of
                 Things} and Related Challenges of Fog and Cloud
                 Computing Integration",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "116:1--116:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3292674",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3292674",
  abstract =     "The fast increment in the number of IoT (Internet of
                 Things) devices is accelerating the research on new
                 solutions to make cloud services scalable. In this
                 context, the novel concept of fog computing as well as
                 the combined fog-to-cloud computing paradigm is
                 becoming essential to decentralize the cloud, while
                 bringing the services closer to the end-system. This
                 article surveys e application layer communication
                 protocols to fulfill the IoT communication
                 requirements, and their potential for implementation in
                 fog- and cloud-based IoT systems. To this end, the
                 article first briefly presents potential protocol
                 candidates, including request-reply and
                 publish-subscribe protocols. After that, the article
                 surveys these protocols based on their main
                 characteristics, as well as the main performance
                 issues, including latency, energy consumption, and
                 network throughput. These findings are thereafter used
                 to place the protocols in each segment of the system
                 (IoT, fog, cloud), and thus opens up the discussion on
                 their choice, interoperability, and wider system
                 integration. The survey is expected to be useful to
                 system architects and protocol designers when choosing
                 the communication protocols in an integrated
                 IoT-to-fog-to-cloud system architecture.",
  acknowledgement = ack-nhfb,
  articleno =    "116",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Diaz:2019:PAH,
  author =       "Moises Diaz and Miguel A. Ferrer and Donato Impedovo
                 and Muhammad Imran Malik and Giuseppe Pirlo and
                 R{\'e}jean Plamondon",
  title =        "A Perspective Analysis of Handwritten Signature
                 Technology",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "117:1--117:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3274658",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3274658",
  abstract =     "Handwritten signatures are biometric traits at the
                 center of debate in the scientific community. Over the
                 last 40 years, the interest in signature studies has
                 grown steadily, having as its main reference the
                 application of automatic signature verification, as
                 previously published reviews in 1989, 2000, and 2008
                 bear witness. Ever since, and over the last 10 years,
                 the application of handwritten signature technology has
                 strongly evolved and much research has focused on the
                 possibility of applying systems based on handwritten
                 signature analysis and processing to a multitude of new
                 fields. After several years of haphazard growth of this
                 research area, it is time to assess its current
                 developments for their applicability in order to draw a
                 structured way forward. This perspective reports a
                 systematic review of the last 10 years of the
                 literature on handwritten signatures with respect to
                 the new scenario, focusing on the most promising
                 domains of research and trying to elicit possible
                 future research directions in this subject.",
  acknowledgement = ack-nhfb,
  articleno =    "117",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hossain:2019:CSD,
  author =       "MD. Zakir Hossain and Ferdous Sohel and Mohd Fairuz
                 Shiratuddin and Hamid Laga",
  title =        "A Comprehensive Survey of Deep Learning for Image
                 Captioning",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "118:1--118:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3295748",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3295748",
  abstract =     "Generating a description of an image is called image
                 captioning. Image captioning requires recognizing the
                 important objects, their attributes, and their
                 relationships in an image. It also needs to generate
                 syntactically and semantically correct sentences.
                 Deep-learning-based techniques are capable of handling
                 the complexities and challenges of image captioning. In
                 this survey article, we aim to present a comprehensive
                 review of existing deep-learning-based image captioning
                 techniques. We discuss the foundation of the techniques
                 to analyze their performances, strengths, and
                 limitations. We also discuss the datasets and the
                 evaluation metrics popularly used in
                 deep-learning-based automatic image captioning.",
  acknowledgement = ack-nhfb,
  articleno =    "118",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Elhabbash:2019:CBS,
  author =       "Abdessalam Elhabbash and Faiza Samreen and James
                 Hadley and Yehia Elkhatib",
  title =        "Cloud Brokerage: a Systematic Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "119:1--119:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3274657",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3274657",
  abstract =     "Background -The proliferation of cloud services has
                 opened a space for cloud brokerage services. Brokers
                 intermediate between cloud customers and providers to
                 assist the customer in selecting the most suitable
                 service, helping to manage the dimensionality,
                 heterogeneity, and uncertainty associated with cloud
                 services. Objective -Unlike other surveys, this survey
                 focuses on the customer perspective. The survey
                 systematically analyses the literature to identify and
                 classify approaches to realise cloud brokerage,
                 presenting an understanding of the state-of-the-art and
                 a novel taxonomy to characterise cloud brokers. Method
                 -A systematic literature survey was conducted to
                 compile studies related to cloud brokerage and explore
                 how cloud brokers are engineered. These studies are
                 then analysed from multiple perspectives, such as
                 motivation, functionality, engineering approach, and
                 evaluation methodology. Results -The survey resulted in
                 a knowledge base of current proposals for realising
                 cloud brokers. The survey identified differences
                 between the studies' implementations, with engineering
                 efforts directed at combinations of market-based
                 solutions, middlewares, toolkits, algorithms, semantic
                 frameworks, and conceptual frameworks. Conclusion -Our
                 comprehensive meta-analysis shows that cloud brokerage
                 is still a formative field. Although significant
                 progress has been achieved in this field, considerable
                 challenges remain to be addressed, which are also
                 identified in this survey.",
  acknowledgement = ack-nhfb,
  articleno =    "119",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kumar:2019:ICL,
  author =       "Pawan Kumar and Rakesh Kumar",
  title =        "Issues and Challenges of Load Balancing Techniques in
                 Cloud Computing: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "120:1--120:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3281010",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3281010",
  abstract =     "With the growth in computing technologies, cloud
                 computing has added a new paradigm to user services
                 that allows accessing Information Technology services
                 on the basis of pay-per-use at any time and any
                 location. Owing to flexibility in cloud services,
                 numerous organizations are shifting their business to
                 the cloud and service providers are establishing more
                 data centers to provide services to users. However, it
                 is essential to provide cost-effective execution of
                 tasks and proper utilization of resources. Several
                 techniques have been reported in the literature to
                 improve performance and resource use based on load
                 balancing, task scheduling, resource management,
                 quality of service, and workload management. Load
                 balancing in the cloud allows data centers to avoid
                 overloading/underloading in virtual machines, which
                 itself is a challenge in the field of cloud computing.
                 Therefore, it becomes a necessity for developers and
                 researchers to design and implement a suitable load
                 balancer for parallel and distributed cloud
                 environments. This survey presents a state-of-the-art
                 review of issues and challenges associated with
                 existing load-balancing techniques for researchers to
                 develop more effective algorithms.",
  acknowledgement = ack-nhfb,
  articleno =    "120",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jabal:2019:MTP,
  author =       "Amani Abu Jabal and Maryam Davari and Elisa Bertino
                 and Christian Makaya and Seraphin Calo and Dinesh Verma
                 and Alessandra Russo and Christopher Williams",
  title =        "Methods and Tools for Policy Analysis",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "121:1--121:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3295749",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3295749",
  abstract =     "Policy-based management of computer systems, computer
                 networks and devices is a critical technology
                 especially for present and future systems characterized
                 by large-scale systems with autonomous devices, such as
                 robots and drones. Maintaining reliable policy systems
                 requires efficient and effective analysis approaches to
                 ensure that the policies verify critical properties,
                 such as correctness and consistency. In this paper, we
                 present an extensive overview of methods for policy
                 analysis. Then, we survey policy analysis systems and
                 frameworks that have been proposed and compare them
                 under various dimensions. We conclude the paper by
                 outlining novel research directions in the area of
                 policy analysis.",
  acknowledgement = ack-nhfb,
  articleno =    "121",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Manazir:2019:RDC,
  author =       "Abdul Manazir and Khalid Raza",
  title =        "Recent Developments in {Cartesian} Genetic Programming
                 and its Variants",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "122:1--122:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3275518",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3275518",
  abstract =     "Cartesian Genetic Programming (CGP) is a variant of
                 Genetic Programming with several advantages. During the
                 last one and a half decades, CGP has been further
                 extended to several other forms with lots of promising
                 advantages and applications. This article formally
                 discusses the classical form of CGP and its six
                 different variants proposed so far, which include
                 Embedded CGP, Self-Modifying CGP, Recurrent CGP,
                 Mixed-Type CGP, Balanced CGP, and Differential CGP.
                 Also, this article makes a comparison among these
                 variants in terms of population representations,
                 various constraints in representation, operators and
                 functions applied, and algorithms used. Further, future
                 work directions and open problems in the area have been
                 discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "122",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Tavara:2019:PCS,
  author =       "Shirin Tavara",
  title =        "Parallel Computing of Support Vector Machines: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "123:1--123:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3280989",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3280989",
  abstract =     "The immense amount of data created by digitalization
                 requires parallel computing for machine-learning
                 methods. While there are many parallel implementations
                 for support vector machines (SVMs), there is no clear
                 suggestion for every application scenario. Many
                 factor-including optimization algorithm, problem size
                 and dimension, kernel function, parallel programming
                 stack, and hardware architecture-impact the efficiency
                 of implementations. It is up to the user to balance
                 trade-offs, particularly between computation time and
                 classification accuracy. In this survey, we review the
                 state-of-the-art implementations of SVMs, their pros
                 and cons, and suggest possible avenues for future
                 research.",
  acknowledgement = ack-nhfb,
  articleno =    "123",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Testa:2019:SFE,
  author =       "Rafael Luiz Testa and Cl{\'e}ber Gimenez Corr{\^e}a
                 and Ariane Machado-Lima and F{\'a}tima L. S. Nunes",
  title =        "Synthesis of Facial Expressions in Photographs:
                 Characteristics, Approaches, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "124:1--124:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3292652",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3292652",
  abstract =     "The synthesis of facial expressions has applications
                 in areas such as interactive games, biometrics systems,
                 and training of people with disorders, among others.
                 Although this is an area relatively well explored in
                 the literature, there are no recent studies proposing
                 to systematize an overview of research in the area.
                 This systematic review analyzes the approaches to the
                 synthesis of facial expressions in photographs, as well
                 as important aspects of the synthesis process, such as
                 preprocessing techniques, databases, and evaluation
                 metrics. Forty-eight studies from three different
                 scientific databases were analyzed. From these studies,
                 we established an overview of the process, including
                 all the stages used to synthesize expressions in facial
                 images. We also analyze important aspects involved in
                 these stages such as methods and techniques of each
                 stage, databases, and evaluation metrics. We observed
                 that machine learning approaches are the most widely
                 used to synthesize expressions. Landmark
                 identification, deformation, mapping, fusion, and
                 training are common tasks considered in the approaches.
                 We also found that few studies used metrics to evaluate
                 the results, and most studies used public databases.
                 Although the studies analyzed generated consistent and
                 realistic results while preserving the identity of the
                 subject, there are still research themes to be
                 exploited.",
  acknowledgement = ack-nhfb,
  articleno =    "124",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Patrignani:2019:FAS,
  author =       "Marco Patrignani and Amal Ahmed and Dave Clarke",
  title =        "Formal Approaches to Secure Compilation: a Survey of
                 Fully Abstract Compilation and Related Work",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "125:1--125:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3280984",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3280984",
  abstract =     "Secure compilation is a discipline aimed at developing
                 compilers that preserve the security properties of the
                 source programs they take as input in the target
                 programs they produce as output. This discipline is
                 broad in scope, targeting languages with a variety of
                 features (including objects, higher-order functions,
                 dynamic memory allocation, call/cc, concurrency) and
                 employing a range of different techniques to ensure
                 that source-level security is preserved at the target
                 level. This article provides a survey of the existing
                 literature on formal approaches to secure compilation
                 with a focus on those that prove fully abstract
                 compilation, which has been the criterion adopted by
                 much of the literature thus far. This article then
                 describes the formal techniques employed to prove
                 secure compilation in existing work, introducing
                 relevant terminology, and discussing the merits and
                 limitations of each work. Finally, this article
                 discusses open challenges and possible directions for
                 future work in secure compilation.",
  acknowledgement = ack-nhfb,
  articleno =    "125",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rico-Gallego:2019:SCP,
  author =       "Juan A. Rico-Gallego and Juan C. D{\'\i}az-Mart{\'\i}n
                 and Ravi Reddy Manumachu and Alexey L. Lastovetsky",
  title =        "A Survey of Communication Performance Models for
                 High-Performance Computing",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "126:1--126:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3284358",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3284358",
  abstract =     "This survey aims to present the state of the art in
                 analytic communication performance models, providing
                 sufficiently detailed descriptions of particularly
                 noteworthy efforts. Modeling the cost of communications
                 in computer clusters is an important and challenging
                 problem. It provides insights into the design of the
                 communication pattern of parallel scientific
                 applications and mathematical kernels and sets a clear
                 ground for optimization of their deployment in the
                 increasingly complex high-performance computing
                 infrastructure. The survey provides background
                 information on how different performance models
                 represent the underlying platform and shows the
                 evolution of these models over time from early clusters
                 of single-core processors to present-day multi-core and
                 heterogeneous platforms. Prospective directions for
                 future research in the area of analytic communication
                 performance modeling conclude the survey.",
  acknowledgement = ack-nhfb,
  articleno =    "126",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kolbe:2019:LVR,
  author =       "Niklas Kolbe and Sylvain Kubler and J{\'e}r{\'e}my
                 Robert and Yves {Le Traon} and Arkady Zaslavsky",
  title =        "Linked Vocabulary Recommendation Tools for {Internet
                 of Things}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "127:1--127:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3284316",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3284316",
  abstract =     "The Semantic Web emerged with the vision of eased
                 integration of heterogeneous, distributed data on the
                 Web. The approach fundamentally relies on the linkage
                 between and reuse of previously published vocabularies
                 to facilitate semantic interoperability. In recent
                 years, the Semantic Web has been perceived as a
                 potential enabling technology to overcome
                 interoperability issues in the Internet of Things
                 (IoT), especially for service discovery and
                 composition. Despite the importance of making
                 vocabulary terms discoverable and selecting the most
                 suitable ones in forthcoming IoT applications, no
                 state-of-the-art survey of tools achieving such
                 recommendation tasks exists to date. This survey covers
                 this gap by specifying an extensive evaluation
                 framework and assessing linked vocabulary
                 recommendation tools. Furthermore, we discuss
                 challenges and opportunities of vocabulary
                 recommendation and related tools in the context of
                 emerging IoT ecosystems. Overall, 40 recommendation
                 tools for linked vocabularies were evaluated, both
                 empirically and experimentally. Some of the key
                 findings include that (i) many tools neglect to
                 thoroughly address both the curation of a vocabulary
                 collection and effective selection mechanisms, (ii)
                 modern information retrieval techniques are
                 underrepresented, and (iii) the reviewed tools that
                 emerged from Semantic Web use cases are not yet
                 sufficiently extended to fit today's IoT projects.",
  acknowledgement = ack-nhfb,
  articleno =    "127",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cho:2019:SMT,
  author =       "Jin-Hee Cho and Shouhuai Xu and Patrick M. Hurley and
                 Matthew Mackay and Trevor Benjamin and Mark Beaumont",
  title =        "{STRAM}: Measuring the Trustworthiness of
                 Computer-Based Systems",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "128:1--128:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3277666",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3277666",
  abstract =     "Various system metrics have been proposed for
                 measuring the quality of computer-based systems, such
                 as dependability and security metrics for estimating
                 their performance and security characteristics. As
                 computer-based systems grow in complexity with many
                 subsystems or components, measuring their quality in
                 multiple dimensions is a challenging task. In this
                 work, we tackle the problem of measuring the quality of
                 computer-based systems based on the four key attributes
                 of trustworthiness we developed: security, trust,
                 resilience, and agility. In addition to conducting a
                 systematic survey on metrics, measurements, attributes
                 of metrics, and associated ontologies, we propose a
                 system-level trustworthiness metric framework that
                 accommodates four submetrics, called STRAM (Security,
                 Trust, Resilience, and Agility Metrics). The proposed
                 STRAM framework offers a hierarchical ontology
                 structure where each submetric is defined as a
                 sub-ontology. Moreover, this work proposes developing
                 and incorporating metrics describing key assessment
                 tools, including vulnerability assessment, risk
                 assessment, and red teaming, to provide additional
                 evidence in the measurement and quality of trustworthy
                 systems. We further discuss how assessment tools are
                 related to measuring the quality of computer-based
                 systems and the limitations of the state-of-the-art
                 metrics and measurements. Finally, we suggest future
                 research directions for system-level metrics research
                 toward measuring fundamental attributes of the quality
                 of computer-based systems and improving the current
                 metric and measurement methodologies.",
  acknowledgement = ack-nhfb,
  articleno =    "128",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nejatollahi:2019:PQL,
  author =       "Hamid Nejatollahi and Nikil Dutt and Sandip Ray and
                 Francesco Regazzoni and Indranil Banerjee and Rosario
                 Cammarota",
  title =        "Post-Quantum Lattice-Based Cryptography
                 Implementations: a Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "129:1--129:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3292548",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3292548",
  abstract =     "The advent of quantum computing threatens to break
                 many classical cryptographic schemes, leading to
                 innovations in public key cryptography that focus on
                 post-quantum cryptography primitives and protocols
                 resistant to quantum computing threats. Lattice-based
                 cryptography is a promising post-quantum cryptography
                 family, both in terms of foundational properties as
                 well as in its application to both traditional and
                 emerging security problems such as encryption, digital
                 signature, key exchange, and homomorphic encryption.
                 While such techniques provide guarantees, in theory,
                 their realization on contemporary computing platforms
                 requires careful design choices and tradeoffs to manage
                 both the diversity of computing platforms (e.g.,
                 high-performance to resource constrained), as well as
                 the agility for deployment in the face of emerging and
                 changing standards. In this work, we survey trends in
                 lattice-based cryptographic schemes, some recent
                 fundamental proposals for the use of lattices in
                 computer security, challenges for their implementation
                 in software and hardware, and emerging needs for their
                 adoption. The survey means to be informative about the
                 math to allow the reader to focus on the mechanics of
                 the computation ultimately needed for mapping schemes
                 on existing hardware or synthesizing part or all of a
                 scheme on special-purpose hardware.",
  acknowledgement = ack-nhfb,
  articleno =    "129",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pinto:2019:DAT,
  author =       "Sandro Pinto and Nuno Santos",
  title =        "Demystifying {Arm TrustZone}: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "130:1--130:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3291047",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3291047",
  abstract =     "The world is undergoing an unprecedented technological
                 transformation, evolving into a state where ubiquitous
                 Internet-enabled ``things'' will be able to generate
                 and share large amounts of security- and
                 privacy-sensitive data. To cope with the security
                 threats that are thus foreseeable, system designers can
                 find in Arm TrustZone hardware technology a most
                 valuable resource. TrustZone is a System-on-Chip and
                 CPU system-wide security solution, available on today's
                 Arm application processors and present in the new
                 generation Arm microcontrollers, which are expected to
                 dominate the market of smart ``things.'' Although this
                 technology has remained relatively underground since
                 its inception in 2004, over the past years, numerous
                 initiatives have significantly advanced the state of
                 the art involving Arm TrustZone. Motivated by this
                 revival of interest, this paper presents an in-depth
                 study of TrustZone technology. We provide a
                 comprehensive survey of relevant work from academia and
                 industry, presenting existing systems into two main
                 areas, namely, Trusted Execution Environments and
                 hardware-assisted virtualization. Furthermore, we
                 analyze the most relevant weaknesses of existing
                 systems and propose new research directions within the
                 realm of tiniest devices and the Internet of Things,
                 which we believe to have potential to yield high-impact
                 contributions in the future.",
  acknowledgement = ack-nhfb,
  articleno =    "130",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Xiao:2019:SAB,
  author =       "Jiajian Xiao and Philipp Andelfinger and David Eckhoff
                 and Wentong Cai and Alois Knoll",
  title =        "A Survey on Agent-based Simulation Using Hardware
                 Accelerators",
  journal =      j-COMP-SURV,
  volume =       "51",
  number =       "6",
  pages =        "131:1--131:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3291048",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:36 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3291048",
  abstract =     "Due to decelerating gains in single-core CPU
                 performance, computationally expensive simulations are
                 increasingly executed on highly parallel hardware
                 platforms. Agent-based simulations, where simulated
                 entities act with a certain degree of autonomy,
                 frequently provide ample opportunities for
                 parallelisation. Thus, a vast variety of approaches
                 proposed in the literature demonstrated considerable
                 performance gains using hardware platforms such as
                 many-core CPUs and GPUs, merged CPU-GPU chips as well
                 as Field Programmable Gate Arrays. Typically, a
                 combination of techniques is required to achieve high
                 performance for a given simulation model, putting
                 substantial burden on modellers. To the best of our
                 knowledge, no systematic overview of techniques for
                 agent-based simulations on hardware accelerators has
                 been given in the literature. To close this gap, we
                 provide an overview and categorisation of the
                 literature according to the applied techniques. Since,
                 at the current state of research, challenges such as
                 the partitioning of a model for execution on
                 heterogeneous hardware are still addressed in a largely
                 manual process, we sketch directions for future
                 research towards automating the hardware mapping and
                 execution. This survey targets modellers seeking an
                 overview of suitable hardware platforms and execution
                 techniques for a specific simulation model, as well as
                 methodology researchers interested in potential
                 research gaps requiring further exploration.",
  acknowledgement = ack-nhfb,
  articleno =    "131",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Malla:2019:SPM,
  author =       "Sulav Malla and Ken Christensen",
  title =        "A Survey on Power Management Techniques for
                 Oversubscription of Multi-Tenant Data Centers",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "1:1--1:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3291049",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3291049",
  abstract =     "Power management for data centers has been extensively
                 studied in the past 10 years. Most research has focused
                 on owner-operated data centers with less focus on
                 Multi-Tenant Data Centers (MTDC) or colocation data
                 centers. In an MTDC, an operator owns the building and
                 leases out space, power, and cooling to tenants to
                 install their own IT equipment. MTDC's present new
                 challenges for data center power management due to an
                 inherent lack of coordination between the operator and
                 tenants. In this article, we conduct a comprehensive
                 survey of existing MTDC power management techniques for
                 demand response programs, sustainability, and/or power
                 hierarchy oversubscription. Power oversubscription is
                 of particular interest, as it can maximize resource
                 utilization, increase operator profit, and reduce
                 tenant costs. We create a taxonomy to classify and
                 compare key works. Our taxonomy and review differ from
                 existing works in that our emphasis is on safe power
                 oversubscription, which has been neglected in previous
                 surveys. We propose future research for prediction and
                 control of power overload events in an oversubscribed
                 MTDC.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wang:2019:ECO,
  author =       "Jianyu Wang and Jianli Pan and Flavio Esposito and
                 Prasad Calyam and Zhicheng Yang and Prasant Mohapatra",
  title =        "Edge Cloud Offloading Algorithms: Issues, Methods, and
                 Perspectives",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "2:1--2:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3284387",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3284387",
  abstract =     "Mobile devices supporting the ``Internet of Things''
                 often have limited capabilities in computation, battery
                 energy, and storage space, especially to support
                 resource-intensive applications involving virtual
                 reality, augmented reality, multimedia delivery, and
                 artificial intelligence, which could require broad
                 bandwidth, low response latency, and large
                 computational power. Edge cloud or edge computing is an
                 emerging topic and a technology that can tackle the
                 deficiencies of the currently centralized-only cloud
                 computing model and move the computation and storage
                 resources closer to the devices in support of the
                 above-mentioned applications. To make this happen,
                 efficient coordination mechanisms and ``offloading''
                 algorithms are needed to allow mobile devices and the
                 edge cloud to work together smoothly. In this survey
                 article, we investigate the key issues, methods, and
                 various state-of-the-art efforts related to the
                 offloading problem. We adopt a new characterizing model
                 to study the whole process of offloading from mobile
                 devices to the edge cloud. Through comprehensive
                 discussions, we aim to draw an overall ``big picture''
                 on the existing efforts and research directions. Our
                 study also indicates that the offloading algorithms in
                 the edge cloud have demonstrated profound potentials
                 for future technology and application development.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kalgutkar:2019:CAA,
  author =       "Vaibhavi Kalgutkar and Ratinder Kaur and Hugo Gonzalez
                 and Natalia Stakhanova and Alina Matyukhina",
  title =        "Code Authorship Attribution: Methods and Challenges",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "3:1--3:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3292577",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3292577",
  abstract =     "Code authorship attribution is the process of
                 identifying the author of a given code. With increasing
                 numbers of malware and advanced mutation techniques,
                 the authors of malware are creating a large number of
                 malware variants. To better deal with this problem,
                 methods for examining the authorship of malicious code
                 are necessary. Code authorship attribution techniques
                 can thus be utilized to identify and categorize the
                 authors of malware. This information can help predict
                 the types of tools and techniques that the author of a
                 specific malware uses, as well as the manner in which
                 the malware spreads and evolves. In this article, we
                 present the first comprehensive review of research on
                 code authorship attribution. The article summarizes
                 various methods of authorship attribution and
                 highlights challenges in the field.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Didimo:2019:SGD,
  author =       "Walter Didimo and Giuseppe Liotta and Fabrizio
                 Montecchiani",
  title =        "A Survey on Graph Drawing Beyond Planarity",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "4:1--4:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3301281",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3301281",
  abstract =     "Graph Drawing Beyond Planarity is a rapidly growing
                 research area that classifies and studies geometric
                 representations of nonplanar graphs in terms of
                 forbidden crossing configurations. The aim of this
                 survey is to describe the main research directions in
                 this area, the most prominent known results, and some
                 of the most challenging open problems.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhang:2019:DLB,
  author =       "Shuai Zhang and Lina Yao and Aixin Sun and Yi Tay",
  title =        "Deep Learning Based Recommender System: a Survey and
                 New Perspectives",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "5:1--5:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3285029",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3285029",
  abstract =     "With the growing volume of online information,
                 recommender systems have been an effective strategy to
                 overcome information overload. The utility of
                 recommender systems cannot be overstated, given their
                 widespread adoption in many web applications, along
                 with their potential impact to ameliorate many problems
                 related to over-choice. In recent years, deep learning
                 has garnered considerable interest in many research
                 fields such as computer vision and natural language
                 processing, owing not only to stellar performance but
                 also to the attractive property of learning feature
                 representations from scratch. The influence of deep
                 learning is also pervasive, recently demonstrating its
                 effectiveness when applied to information retrieval and
                 recommender systems research. The field of deep
                 learning in recommender system is flourishing. This
                 article aims to provide a comprehensive review of
                 recent research efforts on deep learning-based
                 recommender systems. More concretely, we provide and
                 devise a taxonomy of deep learning-based recommendation
                 models, along with a comprehensive summary of the state
                 of the art. Finally, we expand on current trends and
                 provide new perspectives pertaining to this new and
                 exciting development of the field.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{MendonCa:2019:GBS,
  author =       "Matheus R. F. Mendon{\c{C}}a and Artur Ziviani and
                 Andr{\'E} M. S. Barreto",
  title =        "Graph-Based Skill Acquisition For Reinforcement
                 Learning",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "6:1--6:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3291045",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3291045",
  abstract =     "In machine learning, Reinforcement Learning (RL) is an
                 important tool for creating intelligent agents that
                 learn solely through experience. One particular subarea
                 within the RL domain that has received great attention
                 is how to define macro-actions, which are temporal
                 abstractions composed of a sequence of primitive
                 actions. This subarea, loosely called skill
                 acquisition, has been under development for several
                 years and has led to better results in a diversity of
                 RL problems. Among the many skill acquisition
                 approaches, graph-based methods have received
                 considerable attention. This survey presents an
                 overview of graph-based skill acquisition methods for
                 RL. We cover a diversity of these approaches and
                 discuss how they evolved throughout the years. Finally,
                 we also discuss the current challenges and open issues
                 in the area of graph-based skill acquisition for RL.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhang:2019:RAT,
  author =       "Jing Zhang and Wanqing Li and Philip Ogunbona and Dong
                 Xu",
  title =        "Recent Advances in Transfer Learning for Cross-Dataset
                 Visual Recognition: a Problem-Oriented Perspective",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "7:1--7:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3291124",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3291124",
  abstract =     "This article takes a problem-oriented perspective and
                 presents a comprehensive review of transfer-learning
                 methods, both shallow and deep, for cross-dataset
                 visual recognition. Specifically, it categorises the
                 cross-dataset recognition into 17 problems based on a
                 set of carefully chosen data and label attributes. Such
                 a problem-oriented taxonomy has allowed us to examine
                 how different transfer-learning approaches tackle each
                 problem and how well each problem has been researched
                 to date. The comprehensive problem-oriented review of
                 the advances in transfer learning with respect to the
                 problem has not only revealed the challenges in
                 transfer learning for visual recognition but also the
                 problems (e.g., 8 of the 17 problems) that have been
                 scarcely studied. This survey not only presents an
                 up-to-date technical review for researchers but also a
                 systematic approach and a reference for a
                 machine-learning practitioner to categorise a real
                 problem and to look up for a possible solution
                 accordingly.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Xu:2019:BAA,
  author =       "Minxian Xu and Rajkumar Buyya",
  title =        "Brownout Approach for Adaptive Management of Resources
                 and Applications in Cloud Computing Systems: a Taxonomy
                 and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "8:1--8:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3234151",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3234151",
  abstract =     "Cloud computing has been regarded as an emerging
                 approach to provisioning resources and managing
                 applications. It provides attractive features, such as
                 an on-demand model, scalability enhancement, and
                 management cost reduction. However, cloud computing
                 systems continue to face problems such as hardware
                 failures, overloads caused by unexpected workloads, or
                 the waste of energy due to inefficient resource
                 utilization, which all result in resource shortages and
                 application issues such as delays or saturation. A
                 paradigm, the brownout, has been applied to handle
                 these issues by adaptively activating or deactivating
                 optional parts of applications or services to manage
                 resource usage in cloud computing system. Brownout has
                 successfully shown that it can avoid overloads due to
                 changes in workload and achieve better load balancing
                 and energy saving effects. This article proposes a
                 taxonomy of the brownout approach for managing
                 resources and applications adaptively in cloud
                 computing systems and carries out a comprehensive
                 survey. It identifies open challenges and offers future
                 research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Xiao:2019:CRC,
  author =       "Ping Xiao and Hannu Toivonen and Oskar Gross and
                 Am{\'\i}lcar Cardoso and Jo{\~a}o Correia and Penousal
                 Machado and Pedro Martins and Hugo Goncalo Oliveira and
                 Rahul Sharma and Alexandre Miguel Pinto and Alberto
                 D{\'\i}az and Virginia Francisco and Pablo Gerv{\'a}s
                 and Raquel Herv{\'a}s and Carlos Le{\'o}n and Jamie
                 Forth and Matthew Purver and Geraint A. Wiggins and
                 Dragana Miljkovi{\'c} and Vid Podpecan and Senja Pollak
                 and Jan Kralj and Martin Znidarsic and Marko Bohanec
                 and Nada Lavrac and Tanja Urbancic and Frank {Van Der
                 Velde} and Stuart Battersby",
  title =        "Conceptual Representations for Computational Concept
                 Creation",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "9:1--9:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3186729",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3186729",
  abstract =     "Computational creativity seeks to understand
                 computational mechanisms that can be characterized as
                 creative. The creation of new concepts is a central
                 challenge for any creative system. In this article, we
                 outline different approaches to computational concept
                 creation and then review conceptual representations
                 relevant to concept creation, and therefore to
                 computational creativity. The conceptual
                 representations are organized in accordance with two
                 important perspectives on the distinctions between
                 them. One distinction is between symbolic, spatial and
                 connectionist representations. The other is between
                 descriptive and procedural representations.
                 Additionally, conceptual representations used in
                 particular creative domains, such as language, music,
                 image and emotion, are reviewed separately. For every
                 representation reviewed, we cover the inference it
                 affords, the computational means of building it, and
                 its application in concept creation.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hong:2019:HGA,
  author =       "Yongjun Hong and Uiwon Hwang and Jaeyoon Yoo and
                 Sungroh Yoon",
  title =        "How Generative Adversarial Networks and Their Variants
                 Work: an Overview",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "10:1--10:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3301282",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3301282",
  abstract =     "Generative Adversarial Networks (GANs) have received
                 wide attention in the machine learning field for their
                 potential to learn high-dimensional, complex real data
                 distribution. Specifically, they do not rely on any
                 assumptions about the distribution and can generate
                 real-like samples from latent space in a simple manner.
                 This powerful property allows GANs to be applied to
                 various applications such as image synthesis, image
                 attribute editing, image translation, domain
                 adaptation, and other academic fields. In this article,
                 we discuss the details of GANs for those readers who
                 are familiar with, but do not comprehend GANs deeply or
                 who wish to view GANs from various perspectives. In
                 addition, we explain how GANs operates and the
                 fundamental meaning of various objective functions that
                 have been suggested recently. We then focus on how the
                 GAN can be combined with an autoencoder framework.
                 Finally, we enumerate the GAN variants that are applied
                 to various tasks and other fields for those who are
                 interested in exploiting GANs for their research.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Boukerche:2019:SOM,
  author =       "Azzedine Boukerche and Shichao Guan and Robson E. {De
                 Grande}",
  title =        "Sustainable Offloading in Mobile Cloud Computing:
                 Algorithmic Design and Implementation",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "11:1--11:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3286688",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3286688",
  abstract =     "Mobile Cloud Computing (MCC) has been extensively
                 explored to be applied as a vital tool to enhance the
                 capabilities of mobile devices, increasing computing
                 power, expanding storage capacity, and prolonging
                 battery life. Offloading works as the fundamental
                 feature that enables MCC to relieve task load and
                 extend data storage through an accessible cloud
                 resource pool. Several initiatives have drawn attention
                 to delivering MCC-supported energy-oriented offloading
                 as a method to cope with a lately steep increase in the
                 number of rich mobile applications and the enduring
                 limitations of battery technologies. However, MCC
                 offloading relieves only the burden of energy
                 consumption of mobile devices; performance concerns
                 about Cloud resources, in most cases, are not
                 considered when dynamically allocating them for dealing
                 with mobile tasks. The application context of MCC,
                 encompassing urban computing, aggravates the situation
                 with very large-scale scenarios, posing as a challenge
                 for achieving greener solutions in the scope of Cloud
                 resources. Thus, this article gathers and analyzes
                 recent energy-aware offloading protocols and
                 architectures, as well as scheduling and balancing
                 algorithms employed toward Cloud green computing. This
                 survey provides a comparison among system architectures
                 by identifying their most notable advantages and
                 disadvantages. The existing enabling frameworks are
                 categorized and compared based on the stage of the task
                 offloading process and resource management types,
                 describing current open challenges and future research
                 directions.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Patil:2019:ESS,
  author =       "Rajendra Patil and Chirag Modi",
  title =        "An Exhaustive Survey on Security Concerns and
                 Solutions at Different Components of Virtualization",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "12:1--12:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3287306",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3287306",
  abstract =     "Virtualization is a key enabler of various modern
                 computing technologies. However, it brings additional
                 vulnerabilities that can be exploited to affect the
                 availability, integrity, and confidentiality of the
                 underlying resources and services. The dynamic and
                 shared nature of the virtualization poses additional
                 challenges to the traditional security solutions. This
                 article explores the vulnerabilities, threats, and
                 attacks relevant to virtualization. We analyze the
                 existing security solutions and identify the research
                 gaps that can help the research community to develop a
                 secured virtualization platform for current and future
                 computing technologies.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Xuan:2019:SBN,
  author =       "Junyu Xuan and Jie Lu and Guangquan Zhang",
  title =        "A Survey on {Bayesian} Nonparametric Learning",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "13:1--13:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3291044",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3291044",
  abstract =     "Bayesian (machine) learning has been playing a
                 significant role in machine learning for a long time
                 due to its particular ability to embrace uncertainty,
                 encode prior knowledge, and endow interpretability. On
                 the back of Bayesian learning's great success, Bayesian
                 nonparametric learning (BNL) has emerged as a force for
                 further advances in this field due to its greater
                 modelling flexibility and representation power. Instead
                 of playing with the fixed-dimensional probabilistic
                 distributions of Bayesian learning, BNL creates a new
                 ``game'' with infinite-dimensional stochastic
                 processes. BNL has long been recognised as a research
                 subject in statistics, and, to date, several
                 state-of-the-art pilot studies have demonstrated that
                 BNL has a great deal of potential to solve real-world
                 machine-learning tasks. However, despite these
                 promising results, BNL has not created a huge wave in
                 the machine-learning community. Esotericism may account
                 for this. The books and surveys on BNL written by
                 statisticians are overcomplicated and filled with
                 tedious theories and proofs. Each is certainly
                 meaningful but may scare away new researchers,
                 especially those with computer science backgrounds.
                 Hence, the aim of this article is to provide a
                 plain-spoken, yet comprehensive, theoretical survey of
                 BNL in terms that researchers in the machine-learning
                 community can understand. It is hoped this survey will
                 serve as a starting point for understanding and
                 exploiting the benefits of BNL in our current scholarly
                 endeavours. To achieve this goal, we have collated the
                 extant studies in this field and aligned them with the
                 steps of a standard BNL procedure-from selecting the
                 appropriate stochastic processes through manipulation
                 to executing the model inference algorithms. At each
                 step, past efforts have been thoroughly summarised and
                 discussed. In addition, we have reviewed the common
                 methods for implementing BNL in various
                 machine-learning tasks along with its diverse
                 applications in the real world as examples to motivate
                 future studies.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cazorla:2019:PWC,
  author =       "Francisco J. Cazorla and Leonidas Kosmidis and Enrico
                 Mezzetti and Carles Hernandez and Jaume Abella and
                 Tullio Vardanega",
  title =        "Probabilistic Worst-Case Timing Analysis: Taxonomy and
                 Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "14:1--14:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3301283",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3301283",
  abstract =     "The unabated increase in the complexity of the
                 hardware and software components of modern embedded
                 real-time systems has given momentum to a host of
                 research in the use of probabilistic and statistical
                 techniques for timing analysis. In the last few years,
                 that front of investigation has yielded a body of
                 scientific literature vast enough to warrant some
                 comprehensive taxonomy of motivations, strategies of
                 application, and directions of research. This survey
                 addresses this very need, singling out the principal
                 techniques in the state of the art of timing analysis
                 that employ probabilistic reasoning at some level,
                 building a taxonomy of them, discussing their relative
                 merit and limitations, and the relations among them. In
                 addition to offering a comprehensive foundation to
                 savvy probabilistic timing analysis, this article also
                 identifies the key challenges to be addressed to
                 consolidate the scientific soundness and industrial
                 viability of this emerging field.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Abdulahhad:2019:MIR,
  author =       "Karam Abdulahhad and Catherine Berrut and Jean-Pierre
                 Chevallet and Gabriella Pasi",
  title =        "Modeling Information Retrieval by Formal Logic: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "15:1--15:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3291043",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3291043",
  abstract =     "Several mathematical frameworks have been used to
                 model the information retrieval (IR) process, among
                 them, formal logics. Logic-based IR models upgrade the
                 IR process from document-query comparison to an
                 inference process, in which both documents and queries
                 are expressed as sentences of the selected formal
                 logic. The underlying formal logic also permits one to
                 represent and integrate knowledge in the IR process.
                 One of the main obstacles that has prevented the
                 adoption and large-scale diffusion of logic-based IR
                 systems is their complexity. However, several
                 logic-based IR models have been recently proposed that
                 are applicable to large-scale data collections. In this
                 survey, we present an overview of the most prominent
                 logical IR models that have been proposed in the
                 literature. The considered logical models are
                 categorized under different axes, which include the
                 considered logics and the way in which uncertainty has
                 been modeled, for example, degrees of belief or degrees
                 of truth. Accordingly, the main contribution of the
                 article is to categorize the state-of-the-art logical
                 models on a fine-grained basis, and for the considered
                 models the related implementation aspects are
                 described. Consequently, the proposed survey is
                 finalized to better understand and compare the
                 different logical IR models. Last, but not least, this
                 article aims at reconsidering the potentials of logical
                 approaches to IR by outlining the advances of
                 logic-based approaches in close research areas.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Cormode:2019:STA,
  author =       "Graham Cormode and Hossein Jowhari",
  title =        "{$ L_p $} Samplers and Their Applications: a Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "16:1--16:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3297715",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3297715",
  abstract =     "The notion of L$_p$ sampling, and corresponding
                 algorithms known as L$_p$ samplers, has found a wide
                 range of applications in the design of data stream
                 algorithms and beyond. In this survey, we present some
                 of the core algorithms to achieve this sampling
                 distribution based on ideas from hashing, sampling, and
                 sketching. We give results for the special cases of
                 insertion-only inputs, lower bounds for the sampling
                 problems, and ways to efficiently sample multiple
                 elements. We describe a range of applications of L$_p$
                 sampling, drawing on problems across the domain of
                 computer science, from matrix and graph computations,
                 as well as to geometric and vector streaming
                 problems.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Silva:2019:UCL,
  author =       "Thiago H. Silva and Aline Carneiro Viana and
                 Fabr{\'\i}cio Benevenuto and Leandro Villas and Juliana
                 Salles and Antonio Loureiro and Daniele Quercia",
  title =        "Urban Computing Leveraging Location-Based Social
                 Network Data: a Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "17:1--17:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3301284",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3301284",
  abstract =     "Urban computing is an emerging area of investigation
                 in which researchers study cities using digital data.
                 Location-Based Social Networks (LBSNs) generate one
                 specific type of digital data that offers unprecedented
                 geographic and temporal resolutions. We discuss
                 fundamental concepts of urban computing leveraging LBSN
                 data and present a survey of recent urban computing
                 studies that make use of LBSN data. We also point out
                 the opportunities and challenges that those studies
                 open.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Reghenzani:2019:RTL,
  author =       "Federico Reghenzani and Giuseppe Massari and William
                 Fornaciari",
  title =        "The Real-Time {Linux} Kernel: a Survey on
                 {PREEMPT\_RT}",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "18:1--18:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3297714",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3297714",
  abstract =     "The increasing functional and nonfunctional
                 requirements of real-time applications, the advent of
                 mixed criticality computing, and the necessity of
                 reducing costs are leading to an increase in the
                 interest for employing COTS hardware in real-time
                 domains. In this scenario, the Linux kernel is emerging
                 as a valuable solution on the software side, thanks to
                 the rich support for hardware devices and peripherals,
                 along with a well-established programming environment.
                 However, Linux has been developed as a general-purpose
                 operating system, followed by several approaches to
                 introduce actual real-time capabilities in the kernel.
                 Among these, the PREEMPT\_RT patch, developed by the
                 kernel maintainers, has the goal to increase the
                 predictability and reduce the latencies of the kernel
                 directly modifying the existent kernel code. This
                 article aims at providing a survey of the
                 state-of-the-art approaches for building real-time
                 Linux-based systems, with a focus on PREEMPT\_RT, its
                 evolution, and the challenges that should be addressed
                 in order to move PREEMPT\_RT one step ahead. Finally,
                 we present some applications and use cases that have
                 already benefited from the introduction of this
                 patch.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ahmed:2019:TEC,
  author =       "Usama Ahmed and Imran Raza and Syed Asad Hussain",
  title =        "Trust Evaluation in Cross-Cloud Federation: Survey and
                 Requirement Analysis",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "19:1--19:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3292499",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3292499",
  abstract =     "Cross-Cloud Federation (CCF) is beneficial for
                 heterogeneous Cloud Service Providers (CSPs) for
                 leasing additional resources from each other. Despite
                 the benefits of on-demand scalability and enhanced
                 service footprints for better service quality, the
                 adoption of CCF is however mainly hindered due to the
                 lack of a comprehensive trust model. The basic aim of
                 such a model should be to address the security and
                 performance concerns of a home CSP on its foreign peers
                 before placing its users' data and applications in
                 their premises. A transitivity of users' trust on home
                 CSP and home CSP's trust on its foreign CSPs marks the
                 uniqueness of trust paradigm in CCF. Addressing the
                 concerns of cloud-to-cloud trust paradigm is inevitable
                 to achieve users' trust in a federation. Various trust
                 models have been proposed in literature for
                 conventional and multi-cloud computing environments.
                 They focus on user requirements but none on federation
                 perspective. Their applicability to CCF for addressing
                 the concerns of cloud-to-cloud trust paradigm requires
                 further consideration. For this reason, we have first
                 outlined the general characteristics of CCF as being
                 dynamic, multi-level and heterogeneous. Afterwards,
                 cloud-to-cloud trust paradigm is proposed based on a
                 set of unique principles identified as (i) trust
                 bi-directionality, (ii) trust composition, (iii)
                 delegation control, and (iv) Resource awareness. An
                 insightful review of Trust Management Systems (TMS)
                 proposed in literature reveals their shortcomings in
                 addressing the requirements of cloud-to-cloud trust
                 paradigm. To overcome these shortcomings, we suggest
                 that some challenges can be merely addressed by
                 aligning the existing methods to the nature of CCF. The
                 remaining challenges require entirely new mechanisms to
                 be introduced. A demonstration of this concept is
                 presented in the form of a requirement matrix
                 suggesting how the characteristics and properties of
                 both CCF and the TMS are influenced by each other. This
                 requirement matrix reveals the potential avenues of
                 research for a TMS aimed specifically for CCF.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bablani:2019:SBC,
  author =       "Annushree Bablani and Damodar Reddy Edla and Diwakar
                 Tripathi and Ramalingaswamy Cheruku",
  title =        "Survey on Brain-Computer Interface: an Emerging
                 Computational Intelligence Paradigm",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "20:1--20:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3297713",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3297713",
  abstract =     "A brain-computer interface (BCI) provides a way to
                 develop interaction between a brain and a computer. The
                 communication is developed as a result of neural
                 responses generated in the brain because of motor
                 movements or cognitive activities. The means of
                 communication here includes muscular and non-muscular
                 actions. These actions generate brain activities or
                 brain waves that are directed to a hardware device to
                 perform a specific task. BCI initially was developed as
                 the communication device for patients suffering from
                 neuromuscular disorders. Owing to recent advancements
                 in BCI devices-such as passive electrodes, wireless
                 headsets, adaptive software, and decreased costs-it is
                 also being used for developing communication between
                 the general public. The BCI device records brain
                 responses using various invasive and non-invasive
                 acquisition techniques such as electrocorticography
                 (ECoG), electroencephalography (EEG),
                 magnetoencephalography (MEG), and magnetic resonance
                 imaging (MRI). In this article, a survey on these
                 techniques has been provided. The brain response needs
                 to be translated using machine learning and pattern
                 recognition methods to control any application. A brief
                 review of various existing feature extraction
                 techniques and classification algorithms applied on
                 data recorded from the brain has been included in this
                 article. A significant comparative analysis of popular
                 existing BCI techniques is presented and possible
                 future directives are provided.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bhat:2019:SVT,
  author =       "Parnika Bhat and Kamlesh Dutta",
  title =        "A Survey on Various Threats and Current State of
                 Security in {Android} Platform",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "21:1--21:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3301285",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3301285",
  abstract =     "The advent of the Android system has brought
                 smartphone technology to the doorsteps of the masses.
                 The latest technologies have made it affordable for
                 every section of the society. However, the emergence of
                 the Android platform has also escalated the growth of
                 cybercrime through the mobile platform. Its open source
                 operating system has made it a center of attraction for
                 the attackers. This article provides a comprehensive
                 study of the state of the Android Security domain. This
                 article classifies the attacks on the Android system in
                 four categories (i) hardware-based attacks, (ii)
                 kernel-based attacks, (iii) hardware abstraction
                 layer-based attacks, and (iv) application-based
                 attacks. The study deals with various threats and
                 security measures relating to these categories and
                 presents an in-depth analysis of the underlying
                 problems in the Android security domain. The article
                 also stresses the role of Android application
                 developers in realizing a more secure Android
                 environment. This article attempts to provide a
                 comparative analysis of various malware detection
                 techniques concerning their methods and limitations.
                 The study can help researchers gain knowledge of the
                 Android security domain from various aspects and build
                 a more comprehensive, robust, and efficient solution to
                 the threats that Android is facing.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bian:2019:ITK,
  author =       "Ranran Bian and Yun Sing Koh and Gillian Dobbie and
                 Anna Divoli",
  title =        "Identifying Top-$k$ Nodes in Social Networks: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "1",
  pages =        "22:1--22:??",
  month =        feb,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3301286",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3301286",
  abstract =     "Top- k nodes are the important actors for a
                 subjectively determined topic in a social network. To
                 some extent, a topic is taken as a ranking criteria for
                 identifying top- k nodes. Within a viral marketing
                 network, subjectively selected topics can include the
                 following: Who can promote a new product to the largest
                 number of people, and who are the highest spending
                 customers? Based on these questions, there has been a
                 growing interest in top- k nodes research to
                 effectively identify key players. In this article, we
                 review and classify existing literature on top- k nodes
                 identification into two major categories: top- k
                 influential nodes and top- k significant nodes. We
                 survey both theoretical and applied work in the field
                 and describe promising research directions based on our
                 review. This research area has proven to be beneficial
                 for data analysis on online social networks as well as
                 practical applications on real-life networks.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dinakarrao:2019:CAA,
  author =       "Sai Manoj Pudukotai Dinakarrao and Axel Jantsch and
                 Muhammad Shafique",
  title =        "Computer-aided Arrhythmia Diagnosis with Bio-signal
                 Processing: a Survey of Trends and Techniques",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "23:1--23:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3297711",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3297711",
  abstract =     "Signals obtained from a patient, i.e., bio-signals,
                 are utilized to analyze the health of patient. One such
                 bio-signal of paramount importance is the
                 electrocardiogram (ECG), which represents the
                 functioning of the heart. Any abnormal behavior in the
                 ECG signal is an indicative measure of a malfunctioning
                 of the heart, termed an arrhythmia condition. Due to
                 the involved complexities such as lack of human
                 expertise and high probability to misdiagnose,
                 long-term monitoring based on computer-aided diagnosis
                 (CADiag) is preferred. There exist various CADiag
                 techniques for arrhythmia diagnosis with their own
                 benefits and limitations. In this work, we classify the
                 arrhythmia detection approaches that make use of CADiag
                 based on the utilized technique. A vast number of
                 techniques useful for arrhythmia detection, their
                 performances, the involved complexities, and comparison
                 among different variants of same technique and across
                 different techniques are discussed. The comparison of
                 different techniques in terms of their performance for
                 arrhythmia detection and its suitability for hardware
                 implementation toward body-wearable devices is
                 discussed in this work.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Djenouri:2019:MLS,
  author =       "Djamel Djenouri and Roufaida Laidi and Youcef Djenouri
                 and Ilangko Balasingham",
  title =        "Machine Learning for Smart Building Applications:
                 Review and Taxonomy",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "24:1--24:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3311950",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3311950",
  abstract =     "The use of machine learning (ML) in smart building
                 applications is reviewed in this article. We split
                 existing solutions into two main classes:
                 occupant-centric versus energy/devices-centric. The
                 first class groups solutions that use ML for aspects
                 related to the occupants, including (1) occupancy
                 estimation and identification, (2) activity
                 recognition, and (3) estimating preferences and
                 behavior. The second class groups solutions that use ML
                 to estimate aspects related either to energy or
                 devices. They are divided into three categories: (1)
                 energy profiling and demand estimation, (2) appliances
                 profiling and fault detection, and (3) inference on
                 sensors. Solutions in each category are presented,
                 discussed, and compared; open perspectives and research
                 trends are discussed as well. Compared to related
                 state-of-the-art survey papers, the contribution herein
                 is to provide a comprehensive and holistic review from
                 the ML perspectives rather than architectural and
                 technical aspects of existing building management
                 systems. This is by considering all types of ML tools,
                 buildings, and several categories of applications, and
                 by structuring the taxonomy accordingly. The article
                 ends with a summary discussion of the presented works,
                 with focus on lessons learned, challenges, open and
                 future directions of research in this field.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Constantin:2019:CUV,
  author =       "Mihai Gabriel Constantin and Miriam Redi and Gloria
                 Zen and Bogdan Ionescu",
  title =        "Computational Understanding of Visual Interestingness
                 Beyond Semantics: Literature Survey and Analysis of
                 Covariates",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "25:1--25:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3301299",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3301299",
  abstract =     "Understanding visual interestingness is a challenging
                 task addressed by researchers in various disciplines
                 ranging from humanities and psychology to, more
                 recently, computer vision and multimedia. The rise of
                 infographics and the visual information overload that
                 we are facing today have given this task a crucial
                 importance. Automatic systems are increasingly needed
                 to help users navigate through the growing amount of
                 visual information available, either on the web or our
                 personal devices, for instance by selecting relevant
                 and interesting content. Previous studies indicate that
                 visual interest is highly related to concepts like
                 arousal, unusualness, or complexity, where these
                 connections are found based on psychological theories,
                 user studies, or computational approaches. However, the
                 link between visual interestingness and other related
                 concepts has been only partially explored so far, for
                 example, by considering only a limited subset of
                 covariates at a time. In this article, we present a
                 comprehensive survey on visual interestingness and
                 related concepts, aiming to bring together works based
                 on different approaches, highlighting controversies,
                 and identifying links that have not been fully
                 investigated yet. Finally, we present some open
                 questions that may be addressed in future works. Our
                 work aims to support researchers interested in visual
                 interestingness and related subjective or abstract
                 concepts, providing an in-depth overlook at
                 state-of-the-art theories in humanities and methods in
                 computational approaches, as well as providing an
                 extended list of datasets.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Li:2019:QES,
  author =       "Miqing Li and Xin Yao",
  title =        "Quality Evaluation of Solution Sets in Multiobjective
                 Optimisation: a Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "26:1--26:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3300148",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3300148",
  abstract =     "Complexity and variety of modern multiobjective
                 optimisation problems result in the emergence of
                 numerous search techniques, from traditional
                 mathematical programming to various randomised
                 heuristics. A key issue raised consequently is how to
                 evaluate and compare solution sets generated by these
                 multiobjective search techniques. In this article, we
                 provide a comprehensive review of solution set quality
                 evaluation. Starting with an introduction of basic
                 principles and concepts of set quality evaluation, this
                 article summarises and categorises 100 state-of-the-art
                 quality indicators, with the focus on what quality
                 aspects these indicators reflect. This is accompanied
                 in each category by detailed descriptions of several
                 representative indicators and in-depth analyses of
                 their strengths and weaknesses. Furthermore, issues
                 regarding attributes that indicators possess and
                 properties that indicators are desirable to have are
                 discussed, in the hope of motivating researchers to
                 look into these important issues when designing quality
                 indicators and of encouraging practitioners to bear
                 these issues in mind when selecting/using quality
                 indicators. Finally, future trends and potential
                 research directions in the area are suggested, together
                 with some guidelines on these directions.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Oz:2019:SMA,
  author =       "Isil Oz and Sanem Arslan",
  title =        "A Survey on Multithreading Alternatives for Soft Error
                 Fault Tolerance",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "27:1--27:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3302255",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/multithreading.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3302255",
  abstract =     "Smaller transistor sizes and reduction in voltage
                 levels in modern microprocessors induce higher soft
                 error rates. This trend makes reliability a primary
                 design constraint for computer systems. Redundant
                 multithreading (RMT) makes use of parallelism in modern
                 systems by employing thread-level time redundancy for
                 fault detection and recovery. RMT can detect faults by
                 running identical copies of the program as separate
                 threads in parallel execution units with identical
                 inputs and comparing their outputs. In this article, we
                 present a survey of RMT implementations at different
                 architectural levels with several design
                 considerations. We explain the implementations in
                 seminal papers and their extensions and discuss the
                 design choices employed by the techniques. We review
                 both hardware and software approaches by presenting the
                 main characteristics and analyze the studies with
                 different design choices regarding their strengths and
                 weaknesses. We also present a classification to help
                 potential users find a suitable method for their
                 requirement and to guide researchers planning to work
                 on this area by providing insights into the future
                 trend.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Swami:2019:SDN,
  author =       "Rochak Swami and Mayank Dave and Virender Ranga",
  title =        "Software-defined Networking-based {DDoS} Defense
                 Mechanisms",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "28:1--28:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3301614",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3301614",
  abstract =     "Distributed Denial of Service attack (DDoS) is
                 recognized to be one of the most catastrophic attacks
                 against various digital communication entities.
                 Software-defined networking (SDN) is an emerging
                 technology for computer networks that uses open
                 protocols for controlling switches and routers placed
                 at the network edges by using specialized open
                 programmable interfaces. In this article, a detailed
                 study on DDoS threats prevalent in SDN is presented.
                 First, SDN features are examined from the perspective
                 of security, and then a discussion on SDN security
                 features is done. Further, two viewpoints on protecting
                 networks against DDoS attacks are presented. In the
                 first view, SDN utilizes its abilities to secure
                 conventional networks. In the second view, SDN may
                 become a victim of the threat itself because of the
                 centralized control mechanism. The main focus of this
                 research work is on discovering critical security
                 implications in SDN while reviewing the current ongoing
                 research studies. By emphasizing the available
                 state-of-the-art techniques, an extensive review of the
                 advancement of SDN security is provided to the research
                 and IT communities.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rizk:2019:CHM,
  author =       "Yara Rizk and Mariette Awad and Edward W. Tunstel",
  title =        "Cooperative Heterogeneous Multi-Robot Systems: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "29:1--29:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3303848",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3303848",
  abstract =     "The emergence of the Internet of things and the
                 widespread deployment of diverse computing systems have
                 led to the formation of heterogeneous multi-agent
                 systems (MAS) to complete a variety of tasks. Motivated
                 to highlight the state of the art on existing MAS while
                 identifying their limitations, remaining challenges,
                 and possible future directions, we survey recent
                 contributions to the field. We focus on robot agents
                 and emphasize the challenges of MAS sub-fields
                 including task decomposition, coalition formation, task
                 allocation, perception, and multi-agent planning and
                 control. While some components have seen more
                 advancements than others, more research is required
                 before effective autonomous MAS can be deployed in real
                 smart city settings that are less restrictive than the
                 assumed validation environments of MAS. Specifically,
                 more autonomous end-to-end solutions need to be
                 experimentally tested and developed while incorporating
                 natural language ontology and dictionaries to automate
                 complex task decomposition and leveraging big data
                 advancements to improve perception algorithms for
                 robotics.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Homoliak:2019:III,
  author =       "Ivan Homoliak and Flavio Toffalini and Juan Guarnizo
                 and Yuval Elovici and Mart{\'\i}n Ochoa",
  title =        "Insight Into Insiders and {IT}: a Survey of Insider
                 Threat Taxonomies, Analysis, Modeling, and
                 Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "30:1--30:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3303771",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3303771",
  abstract =     "Insider threats are one of today's most challenging
                 cybersecurity issues that are not well addressed by
                 commonly employed security solutions. In this work, we
                 propose structural taxonomy and novel categorization of
                 research that contribute to the organization and
                 disambiguation of insider threat incidents and the
                 defense solutions used against them. The objective of
                 our categorization is to systematize knowledge in
                 insider threat research while using an existing
                 grounded theory method for rigorous literature review.
                 The proposed categorization depicts the workflow among
                 particular categories that include incidents and
                 datasets, analysis of incidents, simulations, and
                 defense solutions. Special attention is paid to the
                 definitions and taxonomies of the insider threat; we
                 present a structural taxonomy of insider threat
                 incidents that is based on existing taxonomies and the
                 5W1H questions of the information gathering problem.
                 Our survey will enhance researchers' efforts in the
                 domain of insider threat because it provides (1) a
                 novel structural taxonomy that contributes to
                 orthogonal classification of incidents and defining the
                 scope of defense solutions employed against them, (2)
                 an overview on publicly available datasets that can be
                 used to test new detection solutions against other
                 works, (3) references of existing case studies and
                 frameworks modeling insiders' behaviors for the purpose
                 of reviewing defense solutions or extending their
                 coverage, and (4) a discussion of existing trends and
                 further research directions that can be used for
                 reasoning in the insider threat domain.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rateke:2019:PVR,
  author =       "Thiago Rateke and Karla A. Justen and Vito F.
                 Chiarella and Antonio C. Sobieranski and Eros Comunello
                 and Aldo {Von Wangenheim}",
  title =        "Passive Vision Region-Based Road Detection: a
                 Literature Review",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "31:1--31:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3311951",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3311951",
  abstract =     "We present a literature review to analyze the state of
                 the art in the area of road detection based upon
                 frontal images. For this purpose, a systematic
                 literature review (SLR) was conducted that focuses on
                 analyzing region-based works, since they can adapt to
                 different surface types and do not depend on road
                 geometry or lane markings. Through the comprehensive
                 study of publications in a 11-year time frame, we
                 analyze the methods that are being used, on which types
                 of surface they are applied, whether they are adaptive
                 in relation to surface changes, and whether they are
                 able to distinguish possible faults or changes in the
                 road, such as potholes, shadows, and puddles.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wang:2019:NSA,
  author =       "Wei Wang and Longbing Cao",
  title =        "Negative Sequence Analysis: a Review",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "32:1--32:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3311952",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3311952",
  abstract =     "Negative sequential patterns (NSPs) produced by
                 negative sequence analysis (NSA) capture more
                 informative and actionable knowledge than classic
                 positive sequential patterns (PSPs) due to involving
                 both occurring and nonoccurring items, which appear in
                 many applications. However, the research on NSA is
                 still at an early stage, and NSP mining involves very
                 high computational complexity and a very large search
                 space, there is no widely accepted problem statement on
                 NSP mining, and different settings on constraints and
                 negative containment have been proposed in existing
                 work. Among existing NSP mining algorithms, there are
                 no general and systemic evaluation criteria available
                 to assess them comprehensively. This article conducts a
                 comprehensive technical review of existing NSA
                 research. We explore and formalize a generic problem
                 statement of NSA; investigate, compare, and consolidate
                 the definitions of constraints and negative
                 containment; and compare the working mechanisms and
                 efficiency of existing NSP mining algorithms. The
                 review is concluded by discussing new research
                 opportunities in NSA.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Nambiar:2019:GBP,
  author =       "Athira Nambiar and Alexandre Bernardino and Jacinto C.
                 Nascimento",
  title =        "Gait-based Person Re-identification: a Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "33:1--33:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3243043",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3243043",
  abstract =     "The way people walk is a strong correlate of their
                 identity. Several studies have shown that both humans
                 and machines can recognize individuals just by their
                 gait, given that proper measurements of the observed
                 motion patterns are available. For surveillance
                 applications, gait is also attractive, because it does
                 not require active collaboration from users and is hard
                 to fake. However, the acquisition of good-quality
                 measures of a person's motion patterns in unconstrained
                 environments, (e.g., in person re-identification
                 applications) has proved very challenging in practice.
                 Existing technology (video cameras) suffer from changes
                 in viewpoint, daylight, clothing, accessories, and
                 other variations in the person's appearance. Novel
                 three-dimensional sensors are bringing new promises to
                 the field, but still many research issues are open.
                 This article presents a survey of the work done in gait
                 analysis for re-identification in the past decade,
                 looking at the main approaches, datasets, and
                 evaluation methodologies. We identify several relevant
                 dimensions of the problem and provide a taxonomic
                 analysis of the current state of the art. Finally, we
                 discuss the levels of performance achievable with the
                 current technology and give a perspective of the most
                 challenging and promising directions of research for
                 the future.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Boukerche:2019:CAW,
  author =       "Azzedine Boukerche and Qi Zhang",
  title =        "Countermeasures against Worm Spreading: a New
                 Challenge for Vehicular Networks",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "34:1--34:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3284748",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3284748",
  abstract =     "Vehicular ad hoc networks (VANETs) are essential
                 components of the intelligent transport systems. They
                 are attracting an increasing amount of interest in
                 research and industrial sectors. Vehicular nodes are
                 capable of transporting, sensing, processing
                 information, and wireless communication, which makes
                 them more vulnerable to worm infections than
                 conventional hosts. This survey provides an overview on
                 worm spreading over VANETs. We first briefly introduce
                 the computer worms. Then the V2X communication and
                 applications are discussed from malware and worms
                 propagation perspective to show the indispensability of
                 studying the characteristics of worm propagating on
                 VANETs. The recent literature on worm spreading and
                 containment on VANETs are categorized based on their
                 research methods. The improvements and limitations of
                 the existing studies are discussed. Next, the main
                 factors influencing worm spreading in vehicular
                 networks are discussed followed by a summary of
                 countermeasure strategies designed to deal with these
                 worms.",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Afzalan:2019:IPB,
  author =       "Milad Afzalan and Farrokh Jazizadeh",
  title =        "Indoor Positioning Based on Visible Light
                 Communication: a Performance-based Survey of Real-world
                 Prototypes",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "35:1--35:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3299769",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3299769",
  abstract =     "The emergent context-aware applications in ubiquitous
                 computing demands for obtaining accurate location
                 information of humans or objects in real-time. Indoor
                 location-based services can be delivered through
                 implementing different types of technology, among which
                 is a recent approach that utilizes LED lighting as a
                 medium for Visible Light Communication (VLC). The
                 ongoing development of solid-state lighting (SSL) is
                 resulting in the wide increase of using LED lights and
                 thereby building the ground for a ubiquitous wireless
                 communication network from lighting systems.
                 Considering the recent advances in implementing Visible
                 Light Positioning (VLP) systems, this article presents
                 a review of VLP systems and focuses on the performance
                 evaluation of experimental achievements on location
                 sensing through LED lights. We have outlined the
                 performance evaluation of different prototypes by
                 introducing new performance metrics, their underlying
                 principles, and their notable findings. Furthermore,
                 the study synthesizes the fundamental characteristics
                 of VLC-based positioning systems that need to be
                 considered, presents several technology gaps based on
                 the current state-of-the-art for future research
                 endeavors, and summarizes our lessons learned towards
                 the standardization of the performance evaluation.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Roger:2019:CSP,
  author =       "Henriette R{\"o}ger and Ruben Mayer",
  title =        "A Comprehensive Survey on Parallelization and
                 Elasticity in Stream Processing",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "36:1--36:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3303849",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3303849",
  abstract =     "Stream Processing (SP) has evolved as the leading
                 paradigm to process and gain value from the high volume
                 of streaming data produced, e.g., in the domain of the
                 Internet of Things. An SP system is a middleware that
                 deploys a network of operators between data sources,
                 such as sensors, and the consuming applications. SP
                 systems typically face intense and highly dynamic data
                 streams. Parallelization and elasticity enable SP
                 systems to process these streams with continuous high
                 quality of service. The current research landscape
                 provides a broad spectrum of methods for
                 parallelization and elasticity in SP. Each method makes
                 specific assumptions and focuses on particular aspects.
                 However, the literature lacks a comprehensive overview
                 and categorization of the state of the art in SP
                 parallelization and elasticity, which is necessary to
                 consolidate the state of the research and to plan
                 future research directions on this basis. Therefore, in
                 this survey, we study the literature and develop a
                 classification of current methods for both
                 parallelization and elasticity in SP systems.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Islam:2019:MVR,
  author =       "Chadni Islam and Muhammad Ali Babar and Surya Nepal",
  title =        "A Multi-Vocal Review of Security Orchestration",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "37:1--37:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3305268",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3305268",
  abstract =     "Organizations use diverse types of security solutions
                 to prevent cyber-attacks. Multiple vendors provide
                 security solutions developed using heterogeneous
                 technologies and paradigms. Hence, it is a challenging
                 rather impossible to easily make security solutions to
                 work an integrated fashion. Security orchestration aims
                 at smoothly integrating multivendor security tools that
                 can effectively and efficiently interoperate to support
                 security staff of a Security Operation Centre (SOC).
                 Given the increasing role and importance of security
                 orchestration, there has been an increasing amount of
                 literature on different aspects of security
                 orchestration solutions. However, there has been no
                 effort to systematically review and analyze the
                 reported solutions. We report a Multivocal Literature
                 Review that has systematically selected and reviewed
                 both academic and grey (blogs, web pages, white papers)
                 literature on different aspects of security
                 orchestration published from January 2007 until July
                 2017. The review has enabled us to provide a working
                 definition of security orchestration and classify the
                 main functionalities of security orchestration into
                 three main areas-unification, orchestration, and
                 automation. We have also identified the core components
                 of a security orchestration platform and categorized
                 the drivers of security orchestration based on
                 technical and socio-technical aspects. We also provide
                 a taxonomy of security orchestration based on the
                 execution environment, automation strategy, deployment
                 type, mode of task and resource type. This review has
                 helped us to reveal several areas of further research
                 and development in security orchestration.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Taha:2019:ADM,
  author =       "Ayman Taha and Ali S. Hadi",
  title =        "Anomaly Detection Methods for Categorical Data: a
                 Review",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "38:1--38:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3312739",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3312739",
  abstract =     "Anomaly detection has numerous applications in diverse
                 fields. For example, it has been widely used for
                 discovering network intrusions and malicious events. It
                 has also been used in numerous other applications such
                 as identifying medical malpractice or credit fraud.
                 Detection of anomalies in quantitative data has
                 received a considerable attention in the literature and
                 has a venerable history. By contrast, and despite the
                 widespread availability use of categorical data in
                 practice, anomaly detection in categorical data has
                 received relatively little attention as compared to
                 quantitative data. This is because detection of
                 anomalies in categorical data is a challenging problem.
                 Some anomaly detection techniques depend on identifying
                 a representative pattern then measuring distances
                 between objects and this pattern. Objects that are far
                 from this pattern are declared as anomalies. However,
                 identifying patterns and measuring distances are not
                 easy in categorical data compared with quantitative
                 data. Fortunately, several papers focussing on the
                 detection of anomalies in categorical data have been
                 published in the recent literature. In this article, we
                 provide a comprehensive review of the research on the
                 anomaly detection problem in categorical data. Previous
                 review articles focus on either the statistics
                 literature or the machine learning and computer science
                 literature. This review article combines both
                 literatures. We review 36 methods for the detection of
                 anomalies in categorical data in both literatures and
                 classify them into 12 different categories based on the
                 conceptual definition of anomalies they use. For each
                 approach, we survey anomaly detection methods, and then
                 show the similarities and differences among them. We
                 emphasize two important issues, the number of
                 parameters each method requires and its time
                 complexity. The first issue is critical, because the
                 performance of these methods are sensitive to the
                 choice of these parameters. The time complexity is also
                 very important in real applications especially in big
                 data applications. We report the time complexity if it
                 is reported by the authors of the methods. If it is
                 not, then we derive it ourselves and report it in this
                 article. In addition, we discuss the common problems
                 and the future directions of the anomaly detection in
                 categorical data.",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sundararajan:2019:SMC,
  author =       "Aditya Sundararajan and Arif I. Sarwat and Alexander
                 Pons",
  title =        "A Survey on Modality Characteristics, Performance
                 Evaluation Metrics, and Security for Traditional and
                 Wearable Biometric Systems",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "39:1--39:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3309550",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3309550",
  abstract =     "Biometric research is directed increasingly toward
                 Wearable Biometric Systems (WBS) for user
                 authentication and identification. However, prior to
                 engaging in WBS research, how their operational
                 dynamics and design considerations differ from those of
                 Traditional Biometric Systems (TBS) must be understood.
                 While the current literature is cognizant of those
                 differences, there is no effective work that summarizes
                 the factors where TBS and WBS differ, namely, their
                 modality characteristics, performance, security, and
                 privacy. To bridge the gap, this article accordingly
                 reviews and compares the key characteristics of
                 modalities, contrasts the metrics used to evaluate
                 system performance, and highlights the divergence in
                 critical vulnerabilities, attacks, and defenses for TBS
                 and WBS. It further discusses how these factors affect
                 the design considerations for WBS, the open challenges,
                 and future directions of research in these areas. In
                 doing so, the article provides a big-picture overview
                 of the important avenues of challenges and potential
                 solutions that researchers entering the field should be
                 aware of. Hence, this survey aims to be a starting
                 point for researchers in comprehending the fundamental
                 differences between TBS and WBS before understanding
                 the core challenges associated with WBS and its
                 design.",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wang:2019:DNN,
  author =       "Erwei Wang and James J. Davis and Ruizhe Zhao and
                 Ho-Cheung Ng and Xinyu Niu and Wayne Luk and Peter Y.
                 K. Cheung and George A. Constantinides",
  title =        "Deep Neural Network Approximation for Custom Hardware:
                 Where We've Been, Where We're Going",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "40:1--40:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3309551",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3309551",
  abstract =     "Deep neural networks have proven to be particularly
                 effective in visual and audio recognition tasks.
                 Existing models tend to be computationally expensive
                 and memory intensive, however, and so methods for
                 hardware-oriented approximation have become a hot
                 topic. Research has shown that custom hardware-based
                 neural network accelerators can surpass their
                 general-purpose processor equivalents in terms of both
                 throughput and energy efficiency. Application-tailored
                 accelerators, when co-designed with approximation-based
                 network training methods, transform large, dense, and
                 computationally expensive networks into small, sparse,
                 and hardware-efficient alternatives, increasing the
                 feasibility of network deployment. In this article, we
                 provide a comprehensive evaluation of approximation
                 methods for high-performance network inference along
                 with in-depth discussion of their effectiveness for
                 custom hardware implementation. We also include
                 proposals for future research based on a thorough
                 analysis of current trends. This article represents the
                 first survey providing detailed comparisons of custom
                 hardware accelerators featuring approximation for both
                 convolutional and recurrent neural networks, through
                 which we hope to inspire exciting new developments in
                 the field.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Habibzadeh:2019:SCS,
  author =       "Hadi Habibzadeh and Cem Kaptan and Tolga Soyata and
                 Burak Kantarci and Azzedine Boukerche",
  title =        "Smart City System Design: a Comprehensive Study of the
                 Application and Data Planes",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "41:1--41:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3309545",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3309545",
  abstract =     "Recent global smart city efforts resemble the
                 establishment of electricity networks when electricity
                 was first invented, which meant the start of a new era
                 to sell electricity as a utility. A century later, in
                 the smart era, the network to deliver services goes far
                 beyond a single entity like electricity. Supplemented
                 by a well-established Internet infrastructure that can
                 run an endless number of applications, abundant
                 processing and storage capabilities of clouds,
                 resilient edge computing, and sophisticated data
                 analysis like machine learning and deep learning, an
                 already-booming Internet of Things movement makes this
                 new era far more exciting. In this article, we present
                 a multi-faceted survey of machine intelligence in
                 modern implementations. We partition smart city
                 infrastructure into application, sensing,
                 communication, security, and data planes and put an
                 emphasis on the data plane as the mainstay of computing
                 and data storage. We investigate (i) a centralized and
                 distributed implementation of data plane's physical
                 infrastructure and (ii) a complementary application of
                 data analytics, machine learning, deep learning, and
                 data visualization to implement robust machine
                 intelligence in a smart city software core. We finalize
                 our article with pointers to open issues and
                 challenges.",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Sultan:2019:SCL,
  author =       "Hameedah Sultan and Anjali Chauhan and Smruti R.
                 Sarangi",
  title =        "A Survey of Chip-level Thermal Simulators",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "42:1--42:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3309544",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3309544",
  abstract =     "Thermal modeling and simulation have become imperative
                 in recent years owing to the increased power density of
                 high performance microprocessors. Temperature is a
                 first-order design criteria, and hence special
                 consideration has to be given to it in every stage of
                 the design process. If not properly accounted for,
                 temperature can have disastrous effects on the
                 performance of the chip, often leading to failure. To
                 streamline research efforts, there is a strong need for
                 a comprehensive survey of the techniques and tools
                 available for thermal simulation. This will help new
                 researchers entering the field to quickly familiarize
                 themselves with the state of the art and enable
                 existing researchers to further improve upon their
                 proposed techniques. In this article, we present a
                 survey of the package level thermal simulation
                 techniques developed over the past two decades.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fiaz:2019:HDT,
  author =       "Mustansar Fiaz and Arif Mahmood and Sajid Javed and
                 Soon Ki Jung",
  title =        "Handcrafted and Deep Trackers: Recent Visual Object
                 Tracking Approaches and Trends",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "2",
  pages =        "43:1--43:??",
  month =        may,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3309665",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3309665",
  abstract =     "In recent years, visual object tracking has become a
                 very active research area. An increasing number of
                 tracking algorithms are being proposed each year. It is
                 because tracking has wide applications in various
                 real-world problems such as human-computer interaction,
                 autonomous vehicles, robotics, surveillance, and
                 security just to name a few. In the current study, we
                 review latest trends and advances in the tracking area
                 and evaluate the robustness of different trackers based
                 on the feature extraction methods. The first part of
                 this work includes a comprehensive survey of the
                 recently proposed trackers. We broadly categorize
                 trackers into Correlation Filter based Trackers (CFTs)
                 and Non-CFTs. Each category is further classified into
                 various types based on the architecture and the
                 tracking mechanism. In the second part of this work, we
                 experimentally evaluated 24 recent trackers for
                 robustness and compared handcrafted and deep feature
                 based trackers. We observe that trackers using deep
                 features performed better, though in some cases a
                 fusion of both increased performance significantly. To
                 overcome the drawbacks of the existing benchmarks, a
                 new benchmark Object Tracking and Temple Color (OTTC)
                 has also been proposed and used in the evaluation of
                 different algorithms. We analyze the performance of
                 trackers over 11 different challenges in OTTC and 3
                 other benchmarks. Our study concludes that
                 Discriminative Correlation Filter (DCF) based trackers
                 perform better than the others. Our study also reveals
                 that inclusion of different types of regularizations
                 over DCF often results in boosted tracking performance.
                 Finally, we sum up our study by pointing out some
                 insights and indicating future trends in the visual
                 object tracking field.",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mannes:2019:NCN,
  author =       "Elisa Mannes and Carlos Maziero",
  title =        "Naming Content on the Network Layer: a Security
                 Analysis of the Information-Centric Network Model",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "44:1--44:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3311888",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3311888",
  abstract =     "The Information-Centric Network (ICN) paradigm is a
                 future Internet approach aiming to tackle the Internet
                 architectural problems and inefficiencies, by swapping
                 the main entity of the network architecture from hosts
                 to content items. In ICN, content names play a central
                 role: Each content gets a unique name at the network
                 layer, and this name is used for routing the content
                 over the network. This paradigm change potentially
                 enables a future Internet with better performance,
                 reliability, scalability, and suitability for wireless
                 and mobile communication. It also provides new
                 intrinsic means to deal with some popular attacks on
                 the Internet architecture, such as denial of service.
                 However, this new paradigm also represents new
                 challenges related to security that need to be
                 addressed, to ensure its capability to support current
                 and future Internet requirements. This article surveys
                 and summarizes ongoing research concerning security
                 aspects of ICNs, discussing vulnerabilities, attacks,
                 and proposed solutions to mitigate them. We also
                 discuss open challenges and propose future directions
                 regarding research in ICN security.",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Grondahl:2019:TAA,
  author =       "Tommi Gr{\"o}ndahl and N. Asokan",
  title =        "Text Analysis in Adversarial Settings: Does Deception
                 Leave a Stylistic Trace?",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "45:1--45:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3310331",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3310331",
  abstract =     "Textual deception constitutes a major problem for
                 online security. Many studies have argued that
                 deceptiveness leaves traces in writing style, which
                 could be detected using text classification techniques.
                 By conducting an extensive literature review of
                 existing empirical work, we demonstrate that while
                 certain linguistic features have been indicative of
                 deception in certain corpora, they fail to generalize
                 across divergent semantic domains. We suggest that
                 deceptiveness as such leaves no content-invariant
                 stylistic trace, and textual similarity measures
                 provide a superior means of classifying texts as
                 potentially deceptive. Additionally, we discuss forms
                 of deception beyond semantic content, focusing on
                 hiding author identity by writing style obfuscation.
                 Surveying the literature on both author identification
                 and obfuscation techniques, we conclude that current
                 style transformation methods fail to achieve reliable
                 obfuscation while simultaneously ensuring semantic
                 faithfulness to the original text. We propose that
                 future work in style transformation should pay
                 particular attention to disallowing semantically
                 drastic changes.",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ma:2019:WSC,
  author =       "Yongsen Ma and Gang Zhou and Shuangquan Wang",
  title =        "{WiFi} Sensing with Channel State Information: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "46:1--46:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3310194",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3310194",
  abstract =     "With the high demand for wireless data traffic, WiFi
                 networks have experienced very rapid growth, because
                 they provide high throughput and are easy to deploy.
                 Recently, Channel State Information (CSI) measured by
                 WiFi networks is widely used for different sensing
                 purposes. To get a better understanding of existing
                 WiFi sensing technologies and future WiFi sensing
                 trends, this survey gives a comprehensive review of the
                 signal processing techniques, algorithms, applications,
                 and performance results of WiFi sensing with CSI.
                 Different WiFi sensing algorithms and signal processing
                 techniques have their own advantages and limitations
                 and are suitable for different WiFi sensing
                 applications. The survey groups CSI-based WiFi sensing
                 applications into three categories, detection,
                 recognition, and estimation, depending on whether the
                 outputs are binary/multi-class classifications or
                 numerical values. With the development and deployment
                 of new WiFi technologies, there will be more WiFi
                 sensing opportunities wherein the targets may go beyond
                 from humans to environments, animals, and objects. The
                 survey highlights three challenges for WiFi sensing:
                 robustness and generalization, privacy and security,
                 and coexistence of WiFi sensing and networking.
                 Finally, the survey presents three future WiFi sensing
                 trends, i.e., integrating cross-layer network
                 information, multi-device cooperation, and fusion of
                 different sensors, for enhancing existing WiFi sensing
                 capabilities and enabling new WiFi sensing
                 opportunities.",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pimentel:2019:SCM,
  author =       "Jo{\~a}o Felipe Pimentel and Juliana Freire and
                 Leonardo Murta and Vanessa Braganholo",
  title =        "A Survey on Collecting, Managing, and Analyzing
                 Provenance from Scripts",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "47:1--47:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3311955",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3311955",
  abstract =     "Scripts are widely used to design and run scientific
                 experiments. Scripting languages are easy to learn and
                 use, and they allow complex tasks to be specified and
                 executed in fewer steps than with traditional
                 programming languages. However, they also have
                 important limitations for reproducibility and data
                 management. As experiments are iteratively refined, it
                 is challenging to reason about each experiment run (or
                 trial), to keep track of the association between trials
                 and experiment instances as well as the differences
                 across trials, and to connect results to specific input
                 data and parameters. Approaches have been proposed that
                 address these limitations by collecting, managing, and
                 analyzing the provenance of scripts. In this article,
                 we survey the state of the art in provenance for
                 scripts. We have identified the approaches by following
                 an exhaustive protocol of forward and backward
                 literature snowballing. Based on a detailed study, we
                 propose a taxonomy and classify the approaches using
                 this taxonomy.",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goncales:2019:CSD,
  author =       "Lucian Jos{\'e} Gon{\c{c}}ales and Kleinner Farias and
                 Toacy {Cavalcante De Oliveira} and Murilo Scholl",
  title =        "Comparison of Software Design Models: an Extended
                 Systematic Mapping Study",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "48:1--48:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3313801",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3313801",
  abstract =     "Model comparison has been widely used to support many
                 tasks in model-driven software development. For this
                 reason, many techniques of comparing them have been
                 proposed in the last few decades. However, academia and
                 industry have overlooked a classification of currently
                 available approaches to the comparison of design
                 models. Hence, a thorough understanding of
                 state-of-the-art techniques remains limited and
                 inconclusive. This article, therefore, focuses on
                 providing a classification and a thematic analysis of
                 studies on the comparison of software design models. We
                 carried out a systematic mapping study following
                 well-established guidelines to answer nine research
                 questions. In total, 56 primary studies (out of 4,132)
                 were selected from 10 widely recognized electronic
                 databases after a careful filtering process. The main
                 results are that a majority of the primary studies (1)
                 provide coarse-grained techniques of the comparison of
                 general-purpose diagrams, (2) adopt graphs as principal
                 data structure and compare software design models
                 considering structural properties only, (3) pinpoint
                 commonalities and differences between software design
                 models rather than assess their similarity, and (4)
                 propose new techniques while neglecting the production
                 of empirical knowledge from experimental studies.
                 Finally, this article highlights some challenges and
                 directions that can be explored in upcoming studies.",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wenzl:2019:HET,
  author =       "Matthias Wenzl and Georg Merzdovnik and Johanna
                 Ullrich and Edgar Weippl",
  title =        "From Hack to Elaborate Technique --- a Survey on
                 Binary Rewriting",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "49:1--49:37",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3316415",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3316415",
  abstract =     "Binary rewriting is changing the semantics of a
                 program without having the source code at hand. It is
                 used for diverse purposes, such as emulation (e.g.,
                 QEMU), optimization (e.g., DynInst), observation (e.g.,
                 Valgrind), and hardening (e.g., Control flow integrity
                 enforcement). This survey gives detailed insight into
                 the development and state-of-the-art in binary
                 rewriting by reviewing 67 publications from 1966 to
                 2018. Starting from these publications, we provide an
                 in-depth investigation of the challenges and respective
                 solutions to accomplish binary rewriting. Based on our
                 findings, we establish a thorough categorization of
                 binary rewriting approaches with respect to their
                 use-case, applied analysis technique,
                 code-transformation method, and code generation
                 techniques. We contribute a comprehensive mapping
                 between binary rewriting tools, applied techniques, and
                 their domain of application. Our findings emphasize
                 that although much work has been done over the past
                 decades, most of the effort was put into improvements
                 aiming at rewriting general purpose applications but
                 ignoring other challenges like altering
                 throughput-oriented programs or software with real-time
                 requirements, which are often used in the emerging
                 field of the Internet of Things. To the best of our
                 knowledge, our survey is the first comprehensive
                 overview on the complete binary rewriting process.",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{ElRaheb:2019:DIL,
  author =       "Katerina {El Raheb} and Marina Stergiou and Akrivi
                 Katifori and Yannis Ioannidis",
  title =        "Dance Interactive Learning Systems: a Study on
                 Interaction Workflow and Teaching Approaches",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "50:1--50:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3323335",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3323335",
  abstract =     "Motion Capture and whole-body interaction technologies
                 have been experimentally proven to contribute to the
                 enhancement of dance learning and to the investigation
                 of bodily knowledge, innovating at the same time the
                 practice of dance. Designing and implementing a dance
                 interactive learning system with the aim to achieve
                 effective, enjoyable, and meaningful educational
                 experiences is, however, a highly demanding
                 interdisciplinary and complex problem. In this work, we
                 examine the interactive dance training systems that are
                 described in the recent bibliography, proposing a
                 framework of the most important design parameters,
                 which we present along with particular examples of
                 implementations. We discuss the way that the different
                 phases of a common workflow are designed and
                 implemented in these systems, examining aspects such as
                 the visualization of feedback to the learner, the
                 movement qualities involved, the technological
                 approaches used, as well as the general context of use
                 and learning approaches. Our aim is to identify common
                 patterns and areas that require further research and
                 development toward creating more effective and
                 meaningful digital dance learning tools.",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Zhang:2019:SPB,
  author =       "Rui Zhang and Rui Xue and Ling Liu",
  title =        "Security and Privacy on Blockchain",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "51:1--51:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3316481",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3316481",
  abstract =     "Blockchain offers an innovative approach to storing
                 information, executing transactions, performing
                 functions, and establishing trust in an open
                 environment. Many consider blockchain as a technology
                 breakthrough for cryptography and cybersecurity, with
                 use cases ranging from globally deployed cryptocurrency
                 systems like Bitcoin, to smart contracts, smart grids
                 over the Internet of Things, and so forth. Although
                 blockchain has received growing interests in both
                 academia and industry in the recent years, the security
                 and privacy of blockchains continue to be at the center
                 of the debate when deploying blockchain in different
                 applications. This article presents a comprehensive
                 overview of the security and privacy of blockchain. To
                 facilitate the discussion, we first introduce the
                 notion of blockchains and its utility in the context of
                 Bitcoin-like online transactions. Then, we describe the
                 basic security properties that are supported as the
                 essential requirements and building blocks for
                 Bitcoin-like cryptocurrency systems, followed by
                 presenting the additional security and privacy
                 properties that are desired in many blockchain
                 applications. Finally, we review the security and
                 privacy techniques for achieving these security
                 properties in blockchain-based systems, including
                 representative consensus algorithms, hash chained
                 storage, mixing protocols, anonymous signatures,
                 non-interactive zero-knowledge proof, and so forth. We
                 conjecture that this survey can help readers to gain an
                 in-depth understanding of the security and privacy of
                 blockchain with respect to concept, attributes,
                 techniques, and systems.",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bakhshalipour:2019:EHD,
  author =       "Mohammad Bakhshalipour and Seyedali Tabaeiaghdaei and
                 Pejman Lotfi-Kamran and Hamid Sarbazi-Azad",
  title =        "Evaluation of Hardware Data Prefetchers on Server
                 Processors",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "52:1--52:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3312740",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3312740",
  abstract =     "Data prefetching, i.e., the act of predicting an
                 application's future memory accesses and fetching those
                 that are not in the on-chip caches, is a well-known and
                 widely used approach to hide the long latency of memory
                 accesses. The fruitfulness of data prefetching is
                 evident to both industry and academy: Nowadays, almost
                 every high-performance processor incorporates a few
                 data prefetchers for capturing various access patterns
                 of applications; besides, there is a myriad of
                 proposals for data prefetching in the research
                 literature, where each proposal enhances the efficiency
                 of prefetching in a specific way. In this survey, we
                 evaluate the effectiveness of data prefetching in the
                 context of server applications and shed light on its
                 design trade-offs. To do so, we choose a target
                 architecture based on a contemporary server processor
                 and stack various state-of-the-art data prefetchers on
                 top of it. We analyze the prefetchers in terms of their
                 ability to predict memory accesses and enhance overall
                 system performance, as well as their imposed overheads.
                 Finally, by comparing the state-of-the-art prefetchers
                 with impractical ideal prefetchers, we motivate further
                 work on improving data prefetching techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gonzalez-Manzano:2019:LUR,
  author =       "Lorena Gonzalez-Manzano and Jose M. {De Fuentes} and
                 Arturo Ribagorda",
  title =        "Leveraging User-related {Internet of Things} for
                 Continuous Authentication: a Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "53:1--53:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3314023",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3314023",
  abstract =     "Among all Internet of Things (IoT) devices, a subset
                 of them are related to users. Leveraging these
                 user-related IoT elements, it is possible to ensure the
                 identity of the user for a period of time, thus
                 avoiding impersonation. This need is known as
                 Continuous Authentication (CA). Since 2009, a plethora
                 of IoT-based CA academic research and industrial
                 contributions have been proposed. We offer a
                 comprehensive overview of 58 research papers regarding
                 the main components of such a CA system. The status of
                 the industry is studied as well, covering 32 market
                 contributions, research projects, and related
                 standards. Lessons learned, challenges, and open issues
                 to foster further research in this area are finally
                 presented.",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Usman:2019:SBM,
  author =       "Muhammad Usman and Mian Ahmad Jan and Xiangjian He and
                 Jinjun Chen",
  title =        "A Survey on Big Multimedia Data Processing and
                 Management in Smart Cities",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "54:1--54:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3323334",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3323334",
  abstract =     "Integration of embedded multimedia devices with
                 powerful computing platforms, e.g., machine learning
                 platforms, helps to build smart cities and transforms
                 the concept of Internet of Things into Internet of
                 Multimedia Things (IoMT). To provide different services
                 to the residents of smart cities, the IoMT technology
                 generates big multimedia data. The management of big
                 multimedia data is a challenging task for IoMT
                 technology. Without proper management, it is hard to
                 maintain consistency, reusability, and reconcilability
                 of generated big multimedia data in smart cities.
                 Various machine learning techniques can be used for
                 automatic classification of raw multimedia data and to
                 allow machines to learn features and perform specific
                 tasks. In this survey, we focus on various machine
                 learning platforms that can be used to process and
                 manage big multimedia data generated by different
                 applications in smart cities. We also highlight various
                 limitations and research challenges that need to be
                 considered when processing big multimedia data in
                 real-time.",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lu:2019:MMD,
  author =       "Jiaheng Lu and Irena Holubov{\'a}",
  title =        "Multi-model Databases: a New Journey to Handle the
                 Variety of Data",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "55:1--55:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3323214",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3323214",
  abstract =     "The variety of data is one of the most challenging
                 issues for the research and practice in data management
                 systems. The data are naturally organized in different
                 formats and models, including structured data,
                 semi-structured data, and unstructured data. In this
                 survey, we introduce the area of multi-model DBMSs that
                 build a single database platform to manage multi-model
                 data. Even though multi-model databases are a newly
                 emerging area, in recent years, we have witnessed many
                 database systems to embrace this category. We provide a
                 general classification and multi-dimensional
                 comparisons for the most popular multi-model databases.
                 This comprehensive introduction on existing approaches
                 and open problems, from the technique and application
                 perspective, make this survey useful for motivating new
                 multi-model database approaches, as well as serving as
                 a technical reference for developing multi-model
                 database applications.",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Maiza:2019:STV,
  author =       "Claire Maiza and Hamza Rihani and Juan M. Rivas and
                 Jo{\"e}l Goossens and Sebastian Altmeyer and Robert I.
                 Davis",
  title =        "A Survey of Timing Verification Techniques for
                 Multi-Core Real-Time Systems",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "56:1--56:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3323212",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3323212",
  abstract =     "This survey provides an overview of the scientific
                 literature on timing verification techniques for
                 multi-core real-time systems. It reviews the key
                 results in the field from its origins around 2006 to
                 the latest research published up to the end of 2018.
                 The survey highlights the key issues involved in
                 providing guarantees of timing correctness for
                 multi-core systems. A detailed review is provided
                 covering four main categories: full integration,
                 temporal isolation, integrating interference effects
                 into schedulability analysis, and mapping and
                 allocation. The survey concludes with a discussion of
                 the advantages and disadvantages of these different
                 approaches, identifying open issues, key challenges,
                 and possible directions for future research.",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Xiong:2019:SGK,
  author =       "Hu Xiong and Yan Wu and Zhenyu Lu",
  title =        "A Survey of Group Key Agreement Protocols with
                 Constant Rounds",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "57:1--57:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3318460",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3318460",
  abstract =     "Group key agreement (shorten as GKA) protocol enables
                 a group of users to negotiate a one-time session key
                 and protect the thereafter group-oriented communication
                 with this session key across an unreliable network. The
                 number of communication rounds is one of the main
                 concern for practical applications where the
                 cardinality of group participants involved is
                 considerable. It is critical to have fixed constant
                 rounds in GKA protocols to secure these applications.
                 In light of overwhelming variety and multitude of
                 constant-round GKA protocols, this article surveys
                 these protocols from a series of perspectives to supply
                 better comprehension for researchers and scholars.
                 Concretely, this article captures the state of the art
                 of constant-round GKA protocols by analyzing the design
                 rationale, examining the framework and security model,
                 and evaluating all discussed protocols in terms of
                 efficiency and security properties. In addition, this
                 article discusses the extension of constant-round GKA
                 protocols including dynamic membership updating,
                 password-based, affiliation-hiding, and
                 fault-tolerance. In conclusion, this article also
                 points out a number of interesting future directions.",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Saleme:2019:MDS,
  author =       "Est{\^e}v{\~a}o B. Saleme and Alexandra Covaci and
                 Gebremariam Mesfin and Celso A. S. Santos and
                 Gheorghita Ghinea",
  title =        "Mulsemedia {DIY}: a Survey of Devices and a Tutorial
                 for Building Your Own Mulsemedia Environment",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "58:1--58:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3319853",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3319853",
  abstract =     "Multisensory experiences have been increasingly
                 applied in Human-Computer Interaction (HCI). In recent
                 years, it is commonplace to notice the development of
                 haptic, olfactory, and even gustatory displays to
                 create more immersive experiences. Companies are
                 proposing new additions to the multisensory world and
                 are unveiling new products that promise to offer
                 amazing experiences exploiting mulsemedia-multiple
                 sensorial media-where users can perceive odors, tastes,
                 and the sensation of wind blowing against their face.
                 Whilst researchers, practitioners and users alike are
                 faced with a wide range of such new devices, relatively
                 little work has been undertaken to summarize efforts
                 and initiatives in this area. The current article
                 addresses this shortcoming in two ways: first, by
                 presenting a survey of devices targeting senses beyond
                 that of sight and hearing and, second, by describing an
                 approach to guide newcomers and experienced
                 practitioners alike to build their own mulsemedia
                 environment, both in a desktop setting and in an
                 immersive 360${}^\circ $ environment.",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mengistu:2019:STV,
  author =       "Tessema M. Mengistu and Dunren Che",
  title =        "Survey and Taxonomy of Volunteer Computing",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "59:1--59:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3320073",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3320073",
  abstract =     "Volunteer Computing is a kind of distributed computing
                 that harnesses the aggregated spare computing resources
                 of volunteer devices. It provides a cheaper and greener
                 alternative computing infrastructure that can
                 complement the dedicated, centralized, and expensive
                 data centres. The aggregated idle computing resources
                 of devices ranging from desktop computers to routers
                 and smart TVs are being utilized to provide the much
                 needed computing infrastructure for compute intensive
                 tasks such as scientific simulations and big data
                 analysis. However, the use of Volunteer Computing is
                 still dominated by scientific applications and only a
                 very small fraction of the potential volunteer nodes
                 are participating. This article provides a
                 comprehensive survey of Volunteer Computing, covering
                 key technical and operational issues such as security,
                 task distribution, resource management, and incentive
                 models. The article also presents a taxonomy of
                 Volunteer Computing systems, together with discussions
                 of the characteristics of specific systems in each
                 category. To harness the full potentials of Volunteer
                 Computing and make it a reliable alternative computing
                 infrastructure for general applications, we need to
                 improve the existing techniques and device new
                 mechanisms. Thus, this article also sheds light on
                 important issues regarding the future research and
                 development of Volunteer Computing systems with the aim
                 of making them a viable alternative computing
                 infrastructure.",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Oukemeni:2019:PAM,
  author =       "Samia Oukemeni and Helena Rif{\`a}-Pous and Joan
                 Manuel Marqu{\`e}s Puig",
  title =        "Privacy Analysis on Microblogging Online Social
                 Networks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "60:1--60:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3321481",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3321481",
  abstract =     "Online Social Networks (OSNs) incorporate different
                 forms of interactive communication, including
                 microblogging services, multimedia sharing, business
                 networking, and so on. They allow users to create
                 profiles, connect with friends, and share their daily
                 activities and thoughts. However, this ease of use of
                 OSNs comes with a cost in terms of users' privacy and
                 security. The big amount of personal data shared in the
                 users' profiles or correlated from their activities can
                 be stored, processed, and sold for advertisement or
                 statistical purposes. It attracts also malicious users
                 who can collect and exploit the data and target
                 different types of attacks. In this article, we review
                 the state of the art of OSNs existing either in the
                 literature or deployed for use. We focus on the OSN
                 systems that offer, but not exclusively, microblogging
                 services. We analyze and evaluate each system based on
                 a set of characteristics, and we compare them based on
                 their usability and the level of protection of privacy
                 and security they provide. This study is a first step
                 toward understanding the security and privacy controls
                 and measuring their level in an OSN.",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Winter:2019:III,
  author =       "Stephan Winter and Martin Tomko and Maria Vasardani
                 and Kai-Florian Richter and Kourosh Khoshelham and
                 Mohsen Kalantari",
  title =        "Infrastructure-Independent Indoor Localization and
                 Navigation",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "61:1--61:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3321516",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3321516",
  abstract =     "In the absence of any global positioning
                 infrastructure for indoor environments, research on
                 supporting human indoor localization and navigation
                 trails decades behind research on outdoor localization
                 and navigation. The major barrier to broader progress
                 has been the dependency of indoor positioning on
                 environment-specific infrastructure and resulting
                 tailored technical solutions. Combined with the
                 fragmentation and compartmentalization of indoor
                 environments, this poses significant challenges to
                 widespread adoption of indoor location-based services.
                 This article puts aside all approaches of
                 infrastructure-based support for human indoor
                 localization and navigation and instead reviews
                 technical concepts that are independent of sensors
                 embedded in the environment. The reviewed concepts rely
                 on a mobile computing platform with sensing capability
                 and a human interaction interface (``smartphone'').
                 This platform may or may not carry a stored map of the
                 environment, but does not require in situ internet
                 access. In this regard, the presented approaches are
                 more challenging than any localization and navigation
                 solutions specific to a particular,
                 infrastructure-equipped indoor space, since they are
                 not adapted to local context, and they may lack some of
                 the accuracy achievable with those tailored solutions.
                 However, only these approaches have the potential to be
                 universally applicable.",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lozano:2019:SCR,
  author =       "Roberto Casta{\~n}eda Lozano and Christian Schulte",
  title =        "Survey on Combinatorial Register Allocation and
                 Instruction Scheduling",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "62:1--62:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3200920",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3200920",
  abstract =     "Register allocation (mapping variables to processor
                 registers or memory) and instruction scheduling
                 (reordering instructions to increase instruction-level
                 parallelism) are essential tasks for generating
                 efficient assembly code in a compiler. In the past
                 three decades, combinatorial optimization has emerged
                 as an alternative to traditional, heuristic algorithms
                 for these two tasks. Combinatorial optimization
                 approaches can deliver optimal solutions according to a
                 model, can precisely capture trade-offs between
                 conflicting decisions, and are more flexible at the
                 expense of increased compilation time. This article
                 provides an exhaustive literature review and a
                 classification of combinatorial optimization approaches
                 to register allocation and instruction scheduling, with
                 a focus on the techniques that are most applied in this
                 context: integer programming, constraint programming,
                 partitioned Boolean quadratic programming, and
                 enumeration. Researchers in compilers and combinatorial
                 optimization can benefit from identifying developments,
                 trends, and challenges in the area; compiler
                 practitioners may discern opportunities and grasp the
                 potential benefit of applying combinatorial
                 optimization.",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Chandrakala:2019:EAS,
  author =       "S. Chandrakala and S. L. Jayalakshmi",
  title =        "Environmental Audio Scene and Sound Event Recognition
                 for Autonomous Surveillance: a Survey and Comparative
                 Studies",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "63:1--63:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3322240",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3322240",
  abstract =     "Monitoring of human and social activities is becoming
                 increasingly pervasive in our living environment for
                 public security and safety applications. The
                 recognition of suspicious events is important in both
                 indoor and outdoor environments, such as child-care
                 centers, smart-homes, old-age homes, residential areas,
                 office environments, elevators, and smart cities.
                 Environmental audio scene and sound event recognition
                 are the fundamental tasks involved in many audio
                 surveillance applications. Although numerous approaches
                 have been proposed, robust environmental audio
                 surveillance remains a huge challenge due to various
                 reasons, such as various types of overlapping audio
                 sounds, background noises, and lack of universal and
                 multi-modal datasets. The goal of this article is to
                 review various features of representing audio scenes
                 and sound events and provide appropriate machine
                 learning algorithms for audio surveillance tasks.
                 Benchmark datasets are categorized based on the
                 real-world scenarios of audio surveillance
                 applications. To have a quantitative understanding,
                 some of the state-of-the-art approaches are evaluated
                 based on two benchmark datasets for audio scenes and
                 sound event recognition tasks. Finally, we outline the
                 possible future directions for improving the
                 recognition of environmental audio scenes and sound
                 events.",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Gu:2019:ILI,
  author =       "Fuqiang Gu and Xuke Hu and Milad Ramezani and
                 Debaditya Acharya and Kourosh Khoshelham and Shahrokh
                 Valaee and Jianga Shang",
  title =        "Indoor Localization Improved by Spatial Context --- a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "3",
  pages =        "64:1--64:??",
  month =        jul,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3322241",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 31 09:04:37 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3322241",
  abstract =     "Indoor localization is essential for healthcare,
                 security, augmented reality gaming, and many other
                 location-based services. There is currently a wealth of
                 relevant literature on indoor localization. This
                 article focuses on recent advances in indoor
                 localization methods that use spatial context to
                 improve the location estimation. Spatial context in the
                 form of maps and spatial models have been used to
                 improve the localization by constraining location
                 estimates in the navigable parts of indoor
                 environments. Landmarks such as doors and corners,
                 which are also one form of spatial context, have proved
                 useful in assisting indoor localization by correcting
                 the localization error. This survey gives a
                 comprehensive review of state-of-the-art indoor
                 localization methods and localization improvement
                 methods using maps, spatial models, and landmarks.",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ben-Nun:2019:DPD,
  author =       "Tal Ben-Nun and Torsten Hoefler",
  title =        "Demystifying Parallel and Distributed Deep Learning:
                 an In-depth Concurrency Analysis",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "65:1--65:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3320060",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3320060",
  abstract =     "Deep Neural Networks (DNNs) are becoming an important
                 tool in modern computing applications. Accelerating
                 their training is a major challenge and techniques
                 range from distributed algorithms to low-level circuit
                 design. In this survey, we describe the problem from a
                 theoretical perspective, followed by approaches for its
                 parallelization. We present trends in DNN architectures
                 and the resulting implications on parallelization
                 strategies. We then review and model the different
                 types of concurrency in DNNs: from the single operator,
                 through parallelism in network inference and training,
                 to distributed deep learning. We discuss asynchronous
                 stochastic optimization, distributed system
                 architectures, communication schemes, and neural
                 architecture search. Based on those approaches, we
                 extrapolate potential directions for parallelism in
                 deep learning.",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Liao:2019:UAT,
  author =       "Xiaofeng Liao and Zhiming Zhao",
  title =        "Unsupervised Approaches for Textual Semantic
                 Annotation, A Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "66:1--66:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3324473",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3324473",
  abstract =     "Semantic annotation is a crucial part of achieving the
                 vision of the Semantic Web and has long been a research
                 topic among various communities. The most challenging
                 problem in reaching the Semantic Web's real potential
                 is the gap between a large amount of unlabeled
                 existing/new data and the limited annotation capability
                 available. To resolve this problem, numerous works have
                 been carried out to increase the degree of automation
                 of semantic annotation from manual to semi-automatic to
                 fully automatic. The richness of these works has been
                 well-investigated by numerous surveys focusing on
                 different aspects of the problem. However, a
                 comprehensive survey targeting unsupervised approaches
                 for semantic annotation is still missing and is
                 urgently needed. To better understand the
                 state-of-the-art of semantic annotation in the textual
                 domain adopting unsupervised approaches, this article
                 investigates existing literature and presents a survey
                 to answer three research questions: (1) To what extent
                 can semantic annotation be performed in a fully
                 automatic manner by using an unsupervised way? (2) What
                 kind of unsupervised approaches for semantic annotation
                 already exist in literature? (3) What characteristics
                 and relationships do these approaches have? In contrast
                 to existing surveys, this article helps the reader get
                 an insight into the state-of-art of semantic annotation
                 using unsupervised approaches. While examining the
                 literature, this article also addresses the
                 inconsistency in the terminology used in the literature
                 to describe the various semantic annotation tools'
                 degree of automation and provides more consistent
                 terminology. Based on this, a uniform summary of the
                 degree of automation of the many semantic annotation
                 tools that were previously investigated can now be
                 presented.",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kaur:2019:CSC,
  author =       "Parminder Kaur and Husanbir Singh Pannu and Avleen
                 Kaur Malhi",
  title =        "Comprehensive Study of Continuous Orthogonal Moments
                 --- a Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "67:1--67:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3331167",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3331167",
  abstract =     "Orthogonal moments provide an efficient mathematical
                 framework for computer vision, image analysis, and
                 pattern recognition. They are derived from the
                 polynomials that are relatively perpendicular to each
                 other. Orthogonal moments are more efficient than
                 non-orthogonal moments for image representation with
                 minimum attribute redundancy, robustness to noise,
                 invariance to rotation, translation, and scaling.
                 Orthogonal moments can be both continuous and discrete.
                 Prominent continuous moments are Zernike,
                 Pseudo-Zernike, Legendre, and Gaussian-Hermite. This
                 article provides a comprehensive and comparative review
                 for continuous orthogonal moments along with their
                 applications.",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Adhikari:2019:SSS,
  author =       "Mainak Adhikari and Tarachand Amgoth and Satish
                 Narayana Srirama",
  title =        "A Survey on Scheduling Strategies for Workflows in
                 Cloud Environment and Emerging Trends",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "68:1--68:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3325097",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3325097",
  abstract =     "Workflow scheduling is one of the challenging issues
                 in emerging trends of the distributed environment that
                 focuses on satisfying various quality of service (QoS)
                 constraints. The cloud receives the applications as a
                 form of a workflow, consisting of a set of
                 interdependent tasks, to solve the large-scale
                 scientific or enterprise problems. Workflow scheduling
                 in the cloud environment has been studied extensively
                 over the years, and this article provides a
                 comprehensive review of the approaches. This article
                 analyses the characteristics of various workflow
                 scheduling techniques and classifies them based on
                 their objectives and execution model. In addition, the
                 recent technological developments and paradigms such as
                 serverless computing and Fog computing are creating new
                 requirements/opportunities for workflow scheduling in a
                 distributed environment. The serverless infrastructures
                 are mainly designed for processing background tasks
                 such as Internet-of-Things (IoT), web applications, or
                 event-driven applications. To address the
                 ever-increasing demands of resources and to overcome
                 the drawbacks of the cloud-centric IoT, the Fog
                 computing paradigm has been developed. This article
                 also discusses workflow scheduling in the context of
                 these emerging trends of cloud computing.",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{VanGlabbeek:2019:PJF,
  author =       "Rob {Van Glabbeek} and Peter H{\"o}fner",
  title =        "Progress, Justness, and Fairness",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "69:1--69:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3329125",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3329125",
  abstract =     "Fairness assumptions are a valuable tool when
                 reasoning about systems. In this article, we classify
                 several fairness properties found in the literature and
                 argue that most of them are too restrictive for many
                 applications. As an alternative, we introduce the
                 concept of justness.",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{McDaniel:2019:EDO,
  author =       "Melinda McDaniel and Veda C. Storey",
  title =        "Evaluating Domain Ontologies: Clarification,
                 Classification, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "70:1--70:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3329124",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3329124",
  abstract =     "The number of applications being developed that
                 require access to knowledge about the real world has
                 increased rapidly over the past two decades. Domain
                 ontologies, which formalize the terms being used in a
                 discipline, have become essential for research in areas
                 such as Machine Learning, the Internet of Things,
                 Robotics, and Natural Language Processing, because they
                 enable separate systems to exchange information. The
                 quality of these domain ontologies, however, must be
                 ensured for meaningful communication. Assessing the
                 quality of domain ontologies for their suitability to
                 potential applications remains difficult, even though a
                 variety of frameworks and metrics have been developed
                 for doing so. This article reviews domain ontology
                 assessment efforts to highlight the work that has been
                 carried out and to clarify the important issues that
                 remain. These assessment efforts are classified into
                 five distinct evaluation approaches and the state of
                 the art of each described. Challenges associated with
                 domain ontology assessment are outlined and
                 recommendations are made for future research and
                 applications.",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fan:2019:SVS,
  author =       "Ching-Ling Fan and Wen-Chih Lo and Yu-Tung Pai and
                 Cheng-Hsin Hsu",
  title =        "A Survey on $ 360^\circ $ Video Streaming:
                 Acquisition, Transmission, and Display",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "71:1--71:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3329119",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3329119",
  abstract =     "Head-mounted displays and 360${}^\circ $ videos have
                 become increasingly more popular, delivering a more
                 immersive viewing experience to end users. Streaming
                 360${}^\circ $ videos over the best-effort Internet,
                 however, faces tremendous challenges, because of the
                 high resolution and the short response time
                 requirements. This survey presents the current
                 literature related to 360${}^\circ $ video streaming.
                 We start with 360${}^\circ $ video streaming systems
                 built for real experiments to investigate the
                 practicality and efficiency of 360${}^\circ $ video
                 streaming. We then present the video and viewer
                 datasets, which may be used to drive large-scale
                 simulations and experiments. Different optimization
                 tools in various stages of the 360${}^\circ $ video
                 streaming pipeline are discussed in detail. We also
                 present various applications enabled by 360${}^\circ $
                 video streaming. In the appendices, we review the
                 off-the-shelf hardware available at the time of writing
                 and the open research problems.",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ribeiro:2019:RAC,
  author =       "Madalena Ribeiro and Abel J. P. Gomes",
  title =        "Recoloring Algorithms for Colorblind People: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "72:1--72:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3329118",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3329118",
  abstract =     "Color is a powerful communication component, not only
                 as part of the message meaning but also as a way of
                 discriminating contents therein. However, 5\% of the
                 world's population suffers from color vision deficiency
                 (CVD), commonly known as colorblindness. This handicap
                 adulterates the way the color is perceived,
                 compromising the reading and understanding of the
                 message contents. This issue becomes even more
                 pertinent due to the increasing availability of
                 multimedia contents in computational environments
                 (e.g., web browsers). Aware of this problem, a
                 significant number of CVD research works came up in the
                 literature in the past two decades to improve color
                 perception in text documents, still images, video, and
                 so forth. This survey mainly addresses recoloring
                 algorithms toward still images for colorblind people,
                 including the current trends in the field of color
                 adaptation.",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Ghosh:2019:UDL,
  author =       "Swarnendu Ghosh and Nibaran Das and Ishita Das and
                 Ujjwal Maulik",
  title =        "Understanding Deep Learning Techniques for Image
                 Segmentation",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "73:1--73:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3329784",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3329784",
  abstract =     "The machine learning community has been overwhelmed by
                 a plethora of deep learning--based approaches. Many
                 challenging computer vision tasks, such as detection,
                 localization, recognition, and segmentation of objects
                 in an unconstrained environment, are being efficiently
                 addressed by various types of deep neural networks,
                 such as convolutional neural networks, recurrent
                 networks, adversarial networks, and autoencoders.
                 Although there have been plenty of analytical studies
                 regarding the object detection or recognition domain,
                 many new deep learning techniques have surfaced with
                 respect to image segmentation techniques. This article
                 approaches these various deep learning techniques of
                 image segmentation from an analytical perspective. The
                 main goal of this work is to provide an intuitive
                 understanding of the major techniques that have made a
                 significant contribution to the image segmentation
                 domain. Starting from some of the traditional image
                 segmentation approaches, the article progresses by
                 describing the effect that deep learning has had on the
                 image segmentation domain. Thereafter, most of the
                 major segmentation algorithms have been logically
                 categorized with paragraphs dedicated to their unique
                 contribution. With an ample amount of intuitive
                 explanations, the reader is expected to have an
                 improved ability to visualize the internal dynamics of
                 these processes.",
  acknowledgement = ack-nhfb,
  articleno =    "73",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Celik:2019:PAC,
  author =       "Z. Berkay Celik and Earlence Fernandes and Eric Pauley
                 and Gang Tan and Patrick McDaniel",
  title =        "Program Analysis of Commodity {IoT} Applications for
                 Security and Privacy: Challenges and Opportunities",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "74:1--74:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3333501",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3333501",
  abstract =     "Recent advances in Internet of Things (IoT) have
                 enabled myriad domains such as smart homes, personal
                 monitoring devices, and enhanced manufacturing. IoT is
                 now pervasive-new applications are being used in nearly
                 every conceivable environment, which leads to the
                 adoption of device-based interaction and automation.
                 However, IoT has also raised issues about the security
                 and privacy of these digitally augmented spaces.
                 Program analysis is crucial in identifying those
                 issues, yet the application and scope of program
                 analysis in IoT remains largely unexplored by the
                 technical community. In this article, we study privacy
                 and security issues in IoT that require
                 program-analysis techniques with an emphasis on
                 identified attacks against these systems and defenses
                 implemented so far. Based on a study of five IoT
                 programming platforms, we identify the key insights
                 that result from research efforts in both the program
                 analysis and security communities and relate the
                 efficacy of program-analysis techniques to security and
                 privacy issues. We conclude by studying recent IoT
                 analysis systems and exploring their implementations.
                 Through these explorations, we highlight key challenges
                 and opportunities in calibrating for the environments
                 in which IoT systems will be used.",
  acknowledgement = ack-nhfb,
  articleno =    "74",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Widel:2019:BFM,
  author =       "Wojciech Wide{\l} and Maxime Audinot and Barbara Fila
                 and Sophie Pinchinat",
  title =        "Beyond 2014: Formal Methods for Attack Tree-based
                 Security Modeling",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "75:1--75:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3331524",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3331524",
  abstract =     "Attack trees are a well established and commonly used
                 framework for security modeling. They provide a
                 readable and structured representation of possible
                 attacks against a system to protect. Their hierarchical
                 structure reveals common features of the attacks and
                 enables quantitative evaluation of security, thus
                 highlighting the most severe vulnerabilities to focus
                 on while implementing countermeasures. Since in
                 real-life studies attack trees have a large number of
                 nodes, their manual creation is a tedious and
                 error-prone process, and their analysis is a
                 computationally challenging task. During the last half
                 decade, the attack tree community witnessed a growing
                 interest in employing formal methods to deal with the
                 aforementioned difficulties. We survey recent advances
                 in graphical security modeling with focus on the
                 application of formal methods to the interpretation,
                 (semi-)automated creation, and quantitative analysis of
                 attack trees and their extensions. We provide a unified
                 description of existing frameworks, compare their
                 features, and outline interesting open questions.",
  acknowledgement = ack-nhfb,
  articleno =    "75",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rashidi:2019:SPL,
  author =       "Saeed Rashidi and Majid Jalili and Hamid
                 Sarbazi-Azad",
  title =        "A Survey on {PCM} Lifetime Enhancement Schemes",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "76:1--76:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3332257",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3332257",
  abstract =     "Phase Change Memory (PCM) is an emerging memory
                 technology that has the capability to address the
                 growing demand for memory capacity and bridge the gap
                 between the main memory and the secondary storage. As a
                 resistive memory, PCM is able to store data based on
                 its resistance values. The wide resistance range of PCM
                 makes it possible to store even multiple bits per cell
                 (MLC) rather than a single bit per cell (SLC).
                 Unfortunately, PCM cells suffer from short lifetime.
                 That means PCM cells could tolerate a limited number of
                 write operations, and afterward they tend to
                 permanently stick at a constant value. Limited lifetime
                 is an issue related to PCM memory; hence, in recent
                 years, many studies have been conducted to prolong PCM
                 lifetime. These schemes have vast variety and are
                 applied at different architectural levels. In this
                 survey, we review the important works of such schemes
                 to give insights to those starting to research on
                 non-volatile memories (NVMs). These schemes are not
                 limited to PCM and are applicable on other NVM
                 technologies due to the similarities between them and
                 the generality of lifetime-prolonging schemes.",
  acknowledgement = ack-nhfb,
  articleno =    "76",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bergstrom:2019:HCI,
  author =       "Joanna Bergstr{\"o}m and Kasper Hornb{\ae}k",
  title =        "Human--Computer Interaction on the Skin",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "77:1--77:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3332166",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3332166",
  abstract =     "The skin offers exciting possibilities for
                 human--computer interaction by enabling new types of
                 input and feedback. We survey 42 research papers on
                 interfaces that allow users to give input on their
                 skin. Skin-based interfaces have developed rapidly over
                 the past 8 years but most work consists of individual
                 prototypes, with limited overview of possibilities or
                 identification of research directions. The purpose of
                 this article is to synthesize what skin input is, which
                 technologies can sense input on the skin, and how to
                 give feedback to the user. We discuss challenges for
                 research in each of these areas.",
  acknowledgement = ack-nhfb,
  articleno =    "77",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Maiorca:2019:TAM,
  author =       "Davide Maiorca and Battista Biggio and Giorgio
                 Giacinto",
  title =        "Towards Adversarial Malware Detection: Lessons Learned
                 from {PDF}-based Attacks",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "78:1--78:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3332184",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3332184",
  abstract =     "Malware still constitutes a major threat in the
                 cybersecurity landscape, also due to the widespread use
                 of infection vectors such as documents. These infection
                 vectors hide embedded malicious code to the victim
                 users, facilitating the use of social engineering
                 techniques to infect their machines. Research showed
                 that machine-learning algorithms provide effective
                 detection mechanisms against such threats, but the
                 existence of an arms race in adversarial settings has
                 recently challenged such systems. In this work, we
                 focus on malware embedded in PDF files as a
                 representative case of such an arms race. We start by
                 providing a comprehensive taxonomy of the different
                 approaches used to generate PDF malware and of the
                 corresponding learning-based detection systems. We then
                 categorize threats specifically targeted against
                 learning-based PDF malware detectors using a
                 well-established framework in the field of adversarial
                 machine learning. This framework allows us to
                 categorize known vulnerabilities of learning-based PDF
                 malware detectors and to identify novel attacks that
                 may threaten such systems, along with the potential
                 defense mechanisms that can mitigate the impact of such
                 threats. We conclude the article by discussing how such
                 findings highlight promising research directions
                 towards tackling the more general challenge of
                 designing robust malware detectors in adversarial
                 settings.",
  acknowledgement = ack-nhfb,
  articleno =    "78",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Kaur:2019:SRI,
  author =       "Harsurinder Kaur and Husanbir Singh Pannu and Avleen
                 Kaur Malhi",
  title =        "A Systematic Review on Imbalanced Data Challenges in
                 Machine Learning: Applications and Solutions",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "79:1--79:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3343440",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3343440",
  abstract =     "In machine learning, the data imbalance imposes
                 challenges to perform data analytics in almost all
                 areas of real-world research. The raw primary data
                 often suffers from the skewed perspective of data
                 distribution of one class over the other as in the case
                 of computer vision, information security, marketing,
                 and medical science. The goal of this article is to
                 present a comparative analysis of the approaches from
                 the reference of data pre-processing, algorithmic and
                 hybrid paradigms for contemporary imbalance data
                 analysis techniques, and their comparative study in
                 lieu of different data distribution and their
                 application areas.",
  acknowledgement = ack-nhfb,
  articleno =    "79",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Arias-Cabarcos:2019:SAA,
  author =       "Patricia Arias-Cabarcos and Christian Krupitzer and
                 Christian Becker",
  title =        "A Survey on Adaptive Authentication",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "80:1--80:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3336117",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3336117",
  abstract =     "Adaptive Authentication allows a system to dynamically
                 select the best mechanism(s) for authenticating a user
                 depending on contextual factors, such as location,
                 proximity to devices, and other attributes. Though this
                 technology has the potential to change the current
                 password-dominated authentication landscape, research
                 to date has not led to practical solutions that
                 transcend to our daily lives. Motivated to find out how
                 to improve adaptive authentication design, we provide a
                 structured survey of the existing literature to date
                 and analyze it to identify and discuss current research
                 challenges and future directions.",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Georgiou:2019:SDL,
  author =       "Stefanos Georgiou and Stamatia Rizou and Diomidis
                 Spinellis",
  title =        "Software Development Lifecycle for Energy Efficiency:
                 Techniques and Tools",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "81:1--81:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3337773",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3337773",
  abstract =     "Motivation: In modern it systems, the increasing
                 demand for computational power is tightly coupled with
                 ever higher energy consumption. Traditionally, energy
                 efficiency research has focused on reducing energy
                 consumption at the hardware level. Nevertheless, the
                 software itself provides numerous opportunities for
                 improving energy efficiency. Goal: Given that energy
                 efficiency for it systems is a rising concern, we
                 investigate existing work in the area of energy-aware
                 software development and identify open research
                 challenges. Our goal is to reveal limitations,
                 features, and tradeoffs regarding energy-performance
                 for software development and provide insights on
                 existing approaches, tools, and techniques for
                 energy-efficient programming. Method: We analyze and
                 categorize research work mostly extracted from top-tier
                 conferences and journals concerning energy efficiency
                 across the software development lifecycle phases.
                 Results: Our analysis shows that related work in this
                 area has focused mainly on the implementation and
                 verification phases of the software development
                 lifecycle. Existing work shows that the use of parallel
                 and approximate programming, source code analyzers,
                 efficient data structures, coding practices, and
                 specific programming languages can significantly
                 increase energy efficiency. Moreover, the utilization
                 of energy monitoring tools and benchmarks can provide
                 insights for the software practitioners and raise
                 energy-awareness during the development phase.",
  acknowledgement = ack-nhfb,
  articleno =    "81",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pawlick:2019:GTT,
  author =       "Jeffrey Pawlick and Edward Colbert and Quanyan Zhu",
  title =        "A Game-theoretic Taxonomy and Survey of Defensive
                 Deception for Cybersecurity and Privacy",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "82:1--82:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3337772",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3337772",
  abstract =     "Cyberattacks on both databases and critical
                 infrastructure have threatened public and private
                 sectors. Ubiquitous tracking and wearable computing
                 have infringed upon privacy. Advocates and engineers
                 have recently proposed using defensive deception as a
                 means to leverage the information asymmetry typically
                 enjoyed by attackers as a tool for defenders. The term
                 deception, however, has been employed broadly and with
                 a variety of meanings. In this article, we survey 24
                 articles from 2008 to 2018 that use game theory to
                 model defensive deception for cybersecurity and
                 privacy. Then, we propose a taxonomy that defines six
                 types of deception: perturbation, moving target
                 defense, obfuscation, mixing, honey-x, and attacker
                 engagement. These types are delineated by their
                 information structures, agents, actions, and duration:
                 precisely concepts captured by game theory. Our aims
                 are to rigorously define types of defensive deception,
                 to capture a snapshot of the state of the literature,
                 to provide a menu of models that can be used for
                 applied research, and to identify promising areas for
                 future work. Our taxonomy provides a systematic
                 foundation for understanding different types of
                 defensive deception commonly encountered in
                 cybersecurity and privacy.",
  acknowledgement = ack-nhfb,
  articleno =    "82",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Fletcher:2019:DTC,
  author =       "Sam Fletcher and Md. Zahidul Islam",
  title =        "Decision Tree Classification with Differential
                 Privacy: a Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "83:1--83:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3337064",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3337064",
  abstract =     "Data mining information about people is becoming
                 increasingly important in the data-driven society of
                 the 21st century. Unfortunately, sometimes there are
                 real-world considerations that conflict with the goals
                 of data mining; sometimes the privacy of the people
                 being data mined needs to be considered. This
                 necessitates that the output of data mining algorithms
                 be modified to preserve privacy while simultaneously
                 not ruining the predictive power of the outputted
                 model. Differential privacy is a strong, enforceable
                 definition of privacy that can be used in data mining
                 algorithms, guaranteeing that nothing will be learned
                 about the people in the data that could not already be
                 discovered without their participation. In this survey,
                 we focus on one particular data mining
                 algorithm-decision trees-and how differential privacy
                 interacts with each of the components that constitute
                 decision tree algorithms. We analyze both greedy and
                 random decision trees, and the conflicts that arise
                 when trying to balance privacy requirements with the
                 accuracy of the model.",
  acknowledgement = ack-nhfb,
  articleno =    "83",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Moghaddam:2019:PAM,
  author =       "Sara Kardani Moghaddam and Rajkumar Buyya and Kotagiri
                 Ramamohanarao",
  title =        "Performance-Aware Management of Cloud Resources: a
                 Taxonomy and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "84:1--84:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3337956",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3337956",
  abstract =     "The dynamic nature of the cloud environment has made
                 the distributed resource management process a challenge
                 for cloud service providers. The importance of
                 maintaining quality of service in accordance with
                 customer expectations and the highly dynamic nature of
                 cloud-hosted applications add new levels of complexity
                 to the process. Advances in big-data learning
                 approaches have shifted conventional static capacity
                 planning solutions to complex performance-aware
                 resource management methods. It is shown that the
                 process of decision-making for resource adjustment is
                 closely related to the behavior of the system,
                 including the utilization of resources and application
                 components. Therefore, a continuous monitoring of
                 system attributes and performance metrics provides the
                 raw data for the analysis of problems affecting the
                 performance of the application. Data analytic methods,
                 such as statistical and machine-learning approaches,
                 offer the required concepts, models, and tools to dig
                 into the data and find general rules, patterns, and
                 characteristics that define the functionality of the
                 system. Obtained knowledge from the data analysis
                 process helps to determine the changes in the
                 workloads, faulty components, or problems that can
                 cause system performance to degrade. A timely reaction
                 to performance degradation can avoid violations of
                 service level agreements, including performing proper
                 corrective actions such as auto-scaling or other
                 resource adjustment solutions. In this article, we
                 investigate the main requirements and limitations of
                 cloud resource management, including a study of the
                 approaches to workload and anomaly analysis in the
                 context of performance management in the cloud. A
                 taxonomy of the works on this problem is presented that
                 identifies main approaches in existing research from
                 the data analysis side to resource adjustment
                 techniques. Finally, considering the observed gaps in
                 the general direction of the reviewed works, a list of
                 these gaps is proposed for future researchers to
                 pursue.",
  acknowledgement = ack-nhfb,
  articleno =    "84",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Moffat:2019:HC,
  author =       "Alistair Moffat",
  title =        "{Huffman} Coding",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "85:1--85:35",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3342555",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3342555",
  abstract =     "Huffman's algorithm for computing minimum-redundancy
                 prefix-free codes has almost legendary status in the
                 computing disciplines. Its elegant blend of simplicity
                 and applicability has made it a favorite example in
                 algorithms courses, and as a result it is perhaps one
                 of the most commonly implemented algorithmic
                 techniques. This article presents a tutorial on Huffman
                 coding and surveys some of the developments that have
                 flowed as a consequence of Huffman's original
                 discovery, including details of code calculation and of
                 encoding and decoding operations. We also survey
                 related mechanisms, covering both arithmetic coding and
                 the recently developed asymmetric numeral systems
                 approach and briefly discuss other Huffman-coding
                 variants, including length-limited codes.",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{DeMarsico:2019:SGR,
  author =       "Maria {De Marsico} and Alessio Mecca",
  title =        "A Survey on Gait Recognition via Wearable Sensors",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "4",
  pages =        "86:1--86:??",
  month =        sep,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3340293",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:56 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3340293",
  abstract =     "Gait is a biometric trait that can allow user
                 authentication, though it is classified as a ``soft''
                 one due to a certain lack in permanence and to
                 sensibility to specific conditions. The earliest
                 research relies on computer vision, especially applied
                 in video surveillance. More recently, the spread of
                 wearable sensors, especially those embedded in mobile
                 devices, has spurred a different research line. In
                 fact, they are able to capture the dynamics of the
                 walking pattern through simpler one-dimensional
                 signals. This capture modality can avoid some problems
                 related to computer vision-based techniques but suffers
                 from specific limitations. Related research is still in
                 a less advanced phase with respect to other biometric
                 traits. However, many factors --- the promising results
                 achieved so far, the increasing accuracy of sensors,
                 the ubiquitous presence of mobile devices, and the low
                 cost of related techniques --- contribute to making
                 this biometrics attractive and suggest continuing
                 investigating. This survey provides interested readers
                 with a reasoned and systematic overview of problems,
                 approaches, and available benchmarks.",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Almoqbel:2019:CMS,
  author =       "Mashael Almoqbel and Songhua Xu",
  title =        "Computational Mining of Social Media to Curb
                 Terrorism",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "87:1--87:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3342101",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3342101",
  abstract =     "In the ever-connected social networking era,
                 terrorists exploit social media platforms via
                 sophisticated approaches. To curb these activities, a
                 rich collection of computational methods was developed.
                 This article surveys the use of social media by
                 terrorists, followed by a temporal classification
                 framework that overviews computational countermeasures
                 at four major stages, including inception of an attack,
                 immediately before an attack, onset of an attack, and
                 after an attack. The literature surveyed was organized
                 around the four temporal stages. The resulting survey
                 is summarized in a table with the main technology used
                 in each stage based on the time of the attack.",
  acknowledgement = ack-nhfb,
  articleno =    "87",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Or-Meir:2019:DMA,
  author =       "Ori Or-Meir and Nir Nissim and Yuval Elovici and Lior
                 Rokach",
  title =        "Dynamic Malware Analysis in the Modern Era --- a State
                 of the Art Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "88:1--88:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3329786",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3329786",
  abstract =     "Although malicious software (malware) has been around
                 since the early days of computers, the sophistication
                 and innovation of malware has increased over the years.
                 In particular, the latest crop of ransomware has drawn
                 attention to the dangers of malicious software, which
                 can cause harm to private users as well as
                 corporations, public services (hospitals and
                 transportation systems), governments, and security
                 institutions. To protect these institutions and the
                 public from malware attacks, malicious activity must be
                 detected as early as possible, preferably before it
                 conducts its harmful acts. However, it is not always
                 easy to know what to look for-especially when dealing
                 with new and unknown malware that has never been seen.
                 Analyzing a suspicious file by static or dynamic
                 analysis methods can provide relevant and valuable
                 information regarding a file's impact on the hosting
                 system and help determine whether the file is malicious
                 or not, based on the method's predefined rules. While
                 various techniques (e.g., code obfuscation, dynamic
                 code loading, encryption, and packing) can be used by
                 malware writers to evade static analysis (including
                 signature-based anti-virus tools), dynamic analysis is
                 robust to these techniques and can provide greater
                 understanding regarding the analyzed file and
                 consequently can lead to better detection capabilities.
                 Although dynamic analysis is more robust than static
                 analysis, existing dynamic analysis tools and
                 techniques are imperfect, and there is no single tool
                 that can cover all aspects of malware behavior. The
                 most recent comprehensive survey performed in this area
                 was published in 2012. Since that time, the computing
                 environment has changed dramatically with new types of
                 malware (ransomware, cryptominers), new analysis
                 methods (volatile memory forensics, side-channel
                 analysis), new computing environments (cloud computing,
                 IoT devices), new machine-learning algorithms, and
                 more. The goal of this survey is to provide a
                 comprehensive and up-to-date overview of existing
                 methods used to dynamically analyze malware, which
                 includes a description of each method, its strengths
                 and weaknesses, and its resilience against malware
                 evasion techniques. In addition, we include an overview
                 of prominent studies presenting the usage of
                 machine-learning methods to enhance dynamic malware
                 analysis capabilities aimed at detection,
                 classification, and categorization.",
  acknowledgement = ack-nhfb,
  articleno =    "88",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Labatut:2019:EAF,
  author =       "Vincent Labatut and Xavier Bost",
  title =        "Extraction and Analysis of Fictional Character
                 Networks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "89:1--89:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3344548",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3344548",
  abstract =     "A character network is a graph extracted from a
                 narrative in which vertices represent characters and
                 edges correspond to interactions between them. A number
                 of narrative-related problems can be addressed
                 automatically through the analysis of character
                 networks, such as summarization, classification, or
                 role detection. Character networks are particularly
                 relevant when considering works of fiction (e.g.,
                 novels, plays, movies, TV series), as their
                 exploitation allows developing information retrieval
                 and recommendation systems. However, works of fiction
                 possess specific properties that make these tasks
                 harder. This survey aims at presenting and organizing
                 the scientific literature related to the extraction of
                 character networks from works of fiction, as well as
                 their analysis. We first describe the extraction
                 process in a generic way and explain how its
                 constituting steps are implemented in practice,
                 depending on the medium of the narrative, the goal of
                 the network analysis, and other factors. We then review
                 the descriptive tools used to characterize character
                 networks, with a focus on the way they are interpreted
                 in this context. We illustrate the relevance of
                 character networks by also providing a review of
                 applications derived from their analysis. Finally, we
                 identify the limitations of the existing approaches and
                 the most promising perspectives.",
  acknowledgement = ack-nhfb,
  articleno =    "89",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Rejiba:2019:SMI,
  author =       "Zeineb Rejiba and Xavier Masip-Bruin and Eva
                 Mar{\'\i}n-Tordera",
  title =        "A Survey on Mobility-Induced Service Migration in the
                 Fog, Edge, and Related Computing Paradigms",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "90:1--90:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3326540",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3326540",
  abstract =     "With the advent of fog and edge computing paradigms,
                 computation capabilities have been moved toward the
                 edge of the network to support the requirements of
                 highly demanding services. To ensure that the quality
                 of such services is still met in the event of users'
                 mobility, migrating services across different computing
                 nodes becomes essential. Several studies have emerged
                 recently to address service migration in different
                 edge-centric research areas, including fog computing,
                 multi-access edge computing (MEC), cloudlets, and
                 vehicular clouds. Since existing surveys in this area
                 focus on either VM migration in general or migration in
                 a single research field (e.g., MEC), the objective of
                 this survey is to bring together studies from
                 different, yet related, edge-centric research fields
                 while capturing the different facets they addressed.
                 More specifically, we examine the diversity
                 characterizing the landscape of migration scenarios at
                 the edge, present an objective-driven taxonomy of the
                 literature, and highlight contributions that rather
                 focused on architectural design and implementation.
                 Finally, we identify a list of gaps and research
                 opportunities based on the observation of the current
                 state of the literature. One such opportunity lies in
                 joining efforts from both networking and computing
                 research communities to facilitate future research in
                 this area.",
  acknowledgement = ack-nhfb,
  articleno =    "90",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Jahan:2019:SMA,
  author =       "Farha Jahan and Weiqing Sun and Quamar Niyaz and
                 Mansoor Alam",
  title =        "Security Modeling of Autonomous Systems: a Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "91:1--91:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3337791",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3337791",
  abstract =     "Autonomous systems will soon be integrating into our
                 lives as home assistants, delivery drones, and
                 driverless cars. The implementation of the level of
                 automation in these systems from being manually
                 controlled to fully autonomous would depend upon the
                 autonomy approach chosen to design these systems. This
                 article reviews the historical evolution of autonomy,
                 its approaches, and the current trends in related
                 fields to build robust autonomous systems. Toward such
                 a goal and with the increased number of cyberattacks,
                 the security of these systems needs special attention
                 from the research community. To gauge the extent to
                 which research has been done in this area, we discuss
                 the cybersecurity of these systems. It is essential to
                 model the system from a security perspective, identify
                 the threats and vulnerabilities, and then model the
                 attacks. A survey in this direction explores the
                 theoretical/analytical system and attack models that
                 have been proposed over the years and identifies the
                 research gap that needs to be addressed by the research
                 community.",
  acknowledgement = ack-nhfb,
  articleno =    "91",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Min:2019:SFC,
  author =       "Weiqing Min and Shuqiang Jiang and Linhu Liu and Yong
                 Rui and Ramesh Jain",
  title =        "A Survey on Food Computing",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "92:1--92:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3329168",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3329168",
  abstract =     "Food is essential for human life and it is fundamental
                 to the human experience. Food-related study may support
                 multifarious applications and services, such as guiding
                 human behavior, improving human health, and
                 understanding the culinary culture. With the rapid
                 development of social networks, mobile networks, and
                 Internet of Things (IoT), people commonly upload,
                 share, and record food images, recipes, cooking videos,
                 and food diaries, leading to large-scale food data.
                 Large-scale food data offers rich knowledge about food
                 and can help tackle many central issues of human
                 society. Therefore, it is time to group several
                 disparate issues related to food computing. Food
                 computing acquires and analyzes heterogeneous food data
                 from different sources for perception, recognition,
                 retrieval, recommendation, and monitoring of food. In
                 food computing, computational approaches are applied to
                 address food-related issues in medicine, biology,
                 gastronomy, and agronomy. Both large-scale food data
                 and recent breakthroughs in computer science are
                 transforming the way we analyze food data. Therefore, a
                 series of works has been conducted in the food area,
                 targeting different food-oriented tasks and
                 applications. However, there are very few systematic
                 reviews that shape this area well and provide a
                 comprehensive and in-depth summary of current efforts
                 or detail open problems in this area. In this article,
                 we formalize food computing and present such a
                 comprehensive overview of various emerging concepts,
                 methods, and tasks. We summarize key challenges and
                 future directions ahead for food computing. This is the
                 first comprehensive survey that targets the study of
                 computing technology for the food area and also offers
                 a collection of research studies and technologies to
                 benefit researchers and practitioners working in
                 different food-related fields.",
  acknowledgement = ack-nhfb,
  articleno =    "92",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Bertolino:2019:SRC,
  author =       "Antonia Bertolino and Guglielmo {De Angelis} and
                 Micael Gallego and Boni Garc{\'\i}a and Francisco
                 Gort{\'a}zar and Francesca Lonetti and Eda Marchetti",
  title =        "A Systematic Review on Cloud Testing",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "93:1--93:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3331447",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3331447",
  abstract =     "A systematic literature review is presented that
                 surveyed the topic of cloud testing over the period
                 2012--2017. Cloud testing can refer either to testing
                 cloud-based systems (testing of the cloud) or to
                 leveraging the cloud for testing purposes (testing in
                 the cloud): both approaches (and their combination into
                 testing of the cloud in the cloud) have drawn research
                 interest. An extensive paper search was conducted by
                 both automated query of popular digital libraries and
                 snowballing, which resulted in the final selection of
                 147 primary studies. Along the survey, a framework has
                 been incrementally derived that classifies cloud
                 testing research among six main areas and their topics.
                 The article includes a detailed analysis of the
                 selected primary studies to identify trends and gaps,
                 as well as an extensive report of the state-of-the-art
                 as it emerges by answering the identified Research
                 Questions. We find that cloud testing is an active
                 research field, although not all topics have received
                 enough attention and conclude by presenting the most
                 relevant open research challenges for each area of the
                 classification framework.",
  acknowledgement = ack-nhfb,
  articleno =    "93",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Duc:2019:MLM,
  author =       "Thang Le Duc and Rafael Garc{\'\i}a Leiva and Paolo
                 Casari and Per-Olov {\"O}stberg",
  title =        "Machine Learning Methods for Reliable Resource
                 Provisioning in Edge-Cloud Computing: a Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "94:1--94:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3341145",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3341145",
  abstract =     "Large-scale software systems are currently designed as
                 distributed entities and deployed in cloud data
                 centers. To overcome the limitations inherent to this
                 type of deployment, applications are increasingly being
                 supplemented with components instantiated closer to the
                 edges of networks-a paradigm known as edge computing.
                 The problem of how to efficiently orchestrate combined
                 edge-cloud applications is, however, incompletely
                 understood, and a wide range of techniques for resource
                 and application management are currently in use. This
                 article investigates the problem of reliable resource
                 provisioning in joint edge-cloud environments, and
                 surveys technologies, mechanisms, and methods that can
                 be used to improve the reliability of distributed
                 applications in diverse and heterogeneous network
                 environments. Due to the complexity of the problem,
                 special emphasis is placed on solutions to the
                 characterization, management, and control of complex
                 distributed applications using machine learning
                 approaches. The survey is structured around a
                 decomposition of the reliable resource provisioning
                 problem into three categories of techniques: workload
                 characterization and prediction, component placement
                 and system consolidation, and application elasticity
                 and remediation. Survey results are presented along
                 with a problem-oriented discussion of the
                 state-of-the-art. A summary of identified challenges
                 and an outline of future research directions are
                 presented to conclude the article.",
  acknowledgement = ack-nhfb,
  articleno =    "94",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Barika:2019:OBD,
  author =       "Mutaz Barika and Saurabh Garg and Albert Y. Zomaya and
                 Lizhe Wang and Aad {Van Moorsel} and Rajiv Ranjan",
  title =        "Orchestrating Big Data Analysis Workflows in the
                 Cloud: Research Challenges, Survey, and Future
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "95:1--95:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3332301",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3332301",
  abstract =     "Interest in processing big data has increased rapidly
                 to gain insights that can transform businesses,
                 government policies, and research outcomes. This has
                 led to advancement in communication, programming, and
                 processing technologies, including cloud computing
                 services and technologies such as Hadoop, Spark, and
                 Storm. This trend also affects the needs of analytical
                 applications, which are no longer monolithic but
                 composed of several individual analytical steps running
                 in the form of a workflow. These big data workflows are
                 vastly different in nature from traditional workflows.
                 Researchers are currently facing the challenge of how
                 to orchestrate and manage the execution of such
                 workflows. In this article, we discuss in detail
                 orchestration requirements of these workflows as well
                 as the challenges in achieving these requirements. We
                 also survey current trends and research that supports
                 orchestration of big data workflows and identify open
                 research challenges to guide future developments in
                 this area.",
  acknowledgement = ack-nhfb,
  articleno =    "95",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Goncalves:2019:AER,
  author =       "Rodrigo Gon{\c{c}}alves and Carina Friedrich
                 Dorneles",
  title =        "Automated Expertise Retrieval: a Taxonomy-Based Survey
                 and Open Issues",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "96:1--96:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3331000",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3331000",
  abstract =     "Understanding people's expertise is not a trivial task
                 since it is time-consuming when manually executed.
                 Automated approaches have become a topic of research in
                 recent years in various scientific fields, such as
                 information retrieval, databases, and machine learning.
                 This article carries out a survey on automated
                 expertise retrieval, i.e., finding data linked to a
                 person that describes the person's expertise, which
                 allows tasks such as profiling or finding people with a
                 certain expertise. A faceted taxonomy is introduced
                 that covers many of the existing approaches and
                 classifies them on the basis of features chosen from
                 studying the state-of-the-art. A list of open issues,
                 with suggestions for future research topics, is
                 introduced as well. It is hoped that our taxonomy and
                 review of related works on expertise retrieval will be
                 useful when analyzing different proposals and will
                 allow a better understanding of existing work and a
                 systematic classification of future work on the
                 topic.",
  acknowledgement = ack-nhfb,
  articleno =    "96",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hong:2019:RMF,
  author =       "Cheol-Ho Hong and Blesson Varghese",
  title =        "Resource Management in Fog\slash Edge Computing: a
                 Survey on Architectures, Infrastructure, and
                 Algorithms",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "97:1--97:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3326066",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3326066",
  abstract =     "Contrary to using distant and centralized cloud data
                 center resources, employing decentralized resources at
                 the edge of a network for processing data closer to
                 user devices, such as smartphones and tablets, is an
                 upcoming computing paradigm, referred to as fog/edge
                 computing. Fog/edge resources are typically
                 resource-constrained, heterogeneous, and dynamic
                 compared to the cloud, thereby making resource
                 management an important challenge that needs to be
                 addressed. This article reviews publications as early
                 as 1991, with 85\% of the publications between 2013 and
                 2018, to identify and classify the architectures,
                 infrastructure, and underlying algorithms for managing
                 resources in fog/edge computing.",
  acknowledgement = ack-nhfb,
  articleno =    "97",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wong:2019:DST,
  author =       "Ka-Chun Wong and Jiao Zhang and Shankai Yan and
                 Xiangtao Li and Qiuzhen Lin and Sam Kwong and Cheng
                 Liang",
  title =        "{DNA} Sequencing Technologies: Sequencing Data
                 Protocols and Bioinformatics Tools",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "98:1--98:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3340286",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3340286",
  abstract =     "The recent advances in DNA sequencing technology, from
                 first-generation sequencing (FGS) to third-generation
                 sequencing (TGS), have constantly transformed the
                 genome research landscape. Its data throughput is
                 unprecedented and severalfold as compared with past
                 technologies. DNA sequencing technologies generate
                 sequencing data that are big, sparse, and
                 heterogeneous. This results in the rapid development of
                 various data protocols and bioinformatics tools for
                 handling sequencing data. In this review, a historical
                 snapshot of DNA sequencing is taken with an emphasis on
                 data manipulation and tools. The technological history
                 of DNA sequencing is described and reviewed in thorough
                 detail. To manipulate the sequencing data generated,
                 different data protocols are introduced and reviewed.
                 In particular, data compression methods are highlighted
                 and discussed to provide readers a practical
                 perspective in the real-world setting. A large variety
                 of bioinformatics tools are also reviewed to help
                 readers extract the most from their sequencing data in
                 different aspects, such as sequencing quality control,
                 genomic visualization, single-nucleotide variant
                 calling, INDEL calling, structural variation calling,
                 and integrative analysis. Toward the end of the
                 article, we critically discuss the existing DNA
                 sequencing technologies for their pitfalls and
                 potential solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "98",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Dai:2019:BDA,
  author =       "Hong-Ning Dai and Raymond Chi-Wing Wong and Hao Wang
                 and Zibin Zheng and Athanasios V. Vasilakos",
  title =        "Big Data Analytics for Large-scale Wireless Networks:
                 Challenges and Opportunities",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "99:1--99:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3337065",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3337065",
  abstract =     "The wide proliferation of various wireless
                 communication systems and wireless devices has led to
                 the arrival of big data era in large-scale wireless
                 networks. Big data of large-scale wireless networks has
                 the key features of wide variety, high volume,
                 real-time velocity, and huge value leading to the
                 unique research challenges that are different from
                 existing computing systems. In this article, we present
                 a survey of the state-of-art big data analytics (BDA)
                 approaches for large-scale wireless networks. In
                 particular, we categorize the life cycle of BDA into
                 four consecutive stages: Data Acquisition, Data
                 Preprocessing, Data Storage, and Data Analytics. We
                 then present a detailed survey of the technical
                 solutions to the challenges in BDA for large-scale
                 wireless networks according to each stage in the life
                 cycle of BDA. Moreover, we discuss the open research
                 issues and outline the future directions in this
                 promising area.",
  acknowledgement = ack-nhfb,
  articleno =    "99",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Luckcuck:2019:FSV,
  author =       "Matt Luckcuck and Marie Farrell and Louise A. Dennis
                 and Clare Dixon and Michael Fisher",
  title =        "Formal Specification and Verification of Autonomous
                 Robotic Systems: a Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "100:1--100:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3342355",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3342355",
  abstract =     "Autonomous robotic systems are complex, hybrid, and
                 often safety critical; this makes their formal
                 specification and verification uniquely challenging.
                 Though commonly used, testing and simulation alone are
                 insufficient to ensure the correctness of, or provide
                 sufficient evidence for the certification of,
                 autonomous robotics. Formal methods for autonomous
                 robotics have received some attention in the
                 literature, but no resource provides a current
                 overview. This article systematically surveys the state
                 of the art in formal specification and verification for
                 autonomous robotics. Specially, it identifies and
                 categorizes the challenges posed by, the formalisms
                 aimed at, and the formal approaches for the
                 specification and verification of autonomous
                 robotics.",
  acknowledgement = ack-nhfb,
  articleno =    "100",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Maksimov:2019:STS,
  author =       "Mike Maksimov and Sahar Kokaly and Marsha Chechik",
  title =        "A Survey of Tool-supported Assurance Case Assessment
                 Techniques",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "101:1--101:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3342481",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3342481",
  abstract =     "Systems deployed in regulated safety-critical domains
                 (e.g., the medical, nuclear, and automotive domains)
                 are often required to undergo a stringent safety
                 assessment procedure, as prescribed by a certification
                 body, to demonstrate their compliance to one or more
                 certification standards. Assurance cases are an
                 emerging way of communicating safety, security, and
                 dependability, as well as other properties of
                 safety-critical systems in a structured and
                 comprehensive manner. The significant size and
                 complexity of these documents, however, makes the
                 process of evaluating and assessing their validity a
                 non-trivial task and an active area of research. Due to
                 this, efforts have been made to develop and utilize
                 software tools for the purpose of aiding developers and
                 third party assessors in the act of assessing and
                 analyzing assurance cases. This article presents a
                 survey of the various assurance case assessment
                 features contained in 10 assurance case software tools,
                 all of which identified and selected by us via a
                 previously conducted systematic literature review. We
                 describe the various assessment techniques implemented,
                 discuss their strengths and weaknesses, and identify
                 possible areas in need of further research.",
  acknowledgement = ack-nhfb,
  articleno =    "101",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Pisani:2019:ABS,
  author =       "Paulo Henrique Pisani and Abir Mhenni and Romain Giot
                 and Estelle Cherrier and Norman Poh and Andr{\'e}
                 Carlos Ponce de Leon {Ferreira de Carvalho} and
                 Christophe Rosenberger and Najoua Essoukri {Ben
                 Amara}",
  title =        "Adaptive Biometric Systems: Review and Perspectives",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "102:1--102:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3344255",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3344255",
  abstract =     "With the widespread of computing and mobile devices,
                 authentication using biometrics has received greater
                 attention. Although biometric systems usually provide
                 good solutions, the recognition performance tends to be
                 affected over time due to changing conditions and aging
                 of biometric data, which results in intra-class
                 variability. Adaptive biometric systems, which adapt
                 the biometric reference over time, have been proposed
                 to deal with such intra-class variability. This article
                 provides the most up-to-date and complete discussion on
                 adaptive biometrics systems we are aware of, including
                 formalization, terminology, sources or variations that
                 motivates the use of adaptation, adaptation strategies,
                 evaluation methodology, and open challenges. This field
                 of research is sometimes referred to as template
                 update.",
  acknowledgement = ack-nhfb,
  articleno =    "102",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mountantonakis:2019:LSS,
  author =       "Michalis Mountantonakis and Yannis Tzitzikas",
  title =        "Large-scale Semantic Integration of Linked Data: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "103:1--103:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3345551",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3345551",
  abstract =     "A large number of published datasets (or sources) that
                 follow Linked Data principles is currently available
                 and this number grows rapidly. However, the major
                 target of Linked Data, i.e., linking and integration,
                 is not easy to achieve. In general, information
                 integration is difficult, because (a) datasets are
                 produced, kept, or managed by different organizations
                 using different models, schemas, or formats, (b) the
                 same real-world entities or relationships are referred
                 with different URIs or names and in different natural
                 languages, (c) datasets usually contain complementary
                 information, (d) datasets can contain data that are
                 erroneous, out-of-date, or conflicting, (e) datasets
                 even about the same domain may follow different
                 conceptualizations of the domain, (f) everything can
                 change (e.g., schemas, data) as time passes. This
                 article surveys the work that has been done in the area
                 of Linked Data integration, it identifies the main
                 actors and use cases, it analyzes and factorizes the
                 integration process according to various dimensions,
                 and it discusses the methods that are used in each
                 step. Emphasis is given on methods that can be used for
                 integrating several datasets. Based on this analysis,
                 the article concludes with directions that are worth
                 further research.",
  acknowledgement = ack-nhfb,
  articleno =    "103",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Barua:2019:CSC,
  author =       "Hrishav Bakul Barua and Kartick Chandra Mondal",
  title =        "A Comprehensive Survey on Cloud Data Mining {(CDM)}
                 Frameworks and Algorithms",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "104:1--104:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3349265",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3349265",
  abstract =     "Data mining is used for finding meaningful information
                 out of a vast expanse of data. With the advent of Big
                 Data concept, data mining has come to much more
                 prominence. Discovering knowledge out of a gigantic
                 volume of data efficiently is a major concern as the
                 resources are limited. Cloud computing plays a major
                 role in such a situation. Cloud data mining fuses the
                 applicability of classical data mining with the
                 promises of cloud computing. This allows it to perform
                 knowledge discovery out of huge volumes of data with
                 efficiency. This article presents the existing
                 frameworks, services, platforms, and algorithms for
                 cloud data mining. The frameworks and platforms are
                 compared among each other based on similarity, data
                 mining task support, parallelism, distribution,
                 streaming data processing support, fault tolerance,
                 security, memory types, storage systems, and others.
                 Similarly, the algorithms are grouped on the basis of
                 parallelism type, scalability, streaming data mining
                 support, and types of data managed. We have also
                 provided taxonomies on the basis of data mining
                 techniques such as clustering, classification, and
                 association rule mining. We also have attempted to
                 discuss and identify the major applications of cloud
                 data mining. The various taxonomies for cloud data
                 mining frameworks, platforms, and algorithms have been
                 identified. This article aims at gaining better insight
                 into the present research realm and directing the
                 future research toward efficient cloud data mining in
                 future cloud systems.",
  acknowledgement = ack-nhfb,
  articleno =    "104",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Mademlis:2019:AUC,
  author =       "Ioannis Mademlis and Nikos Nikolaidis and Anastasios
                 Tefas and Ioannis Pitas and Tilman Wagner and Alberto
                 Messina",
  title =        "Autonomous {UAV} Cinematography: a Tutorial and a
                 Formalized Shot-Type Taxonomy",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "105:1--105:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3347713",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3347713",
  abstract =     "The emerging field of autonomous UAV cinematography is
                 examined through a tutorial for non-experts, which also
                 presents the required underlying technologies and
                 connections with different UAV application domains.
                 Current industry practices are formalized by presenting
                 a UAV shot-type taxonomy composed of framing shot
                 types, single-UAV camera motion types, and multiple-UAV
                 camera motion types. Visually pleasing combinations of
                 framing shot types and camera motion types are
                 identified, while the presented camera motion types are
                 modeled geometrically and graded into distinct energy
                 consumption classes and required technology complexity
                 levels for autonomous capture. Two specific strategies
                 are prescribed, namely focal length compensation and
                 multidrone compensation, for partially overcoming a
                 number of issues arising in UAV live outdoor event
                 coverage, deemed as the most complex UAV cinematography
                 scenario. Finally, the shot types compatible with each
                 compensation strategy are explicitly identified.
                 Overall, this tutorial both familiarizes readers coming
                 from different backgrounds with the topic in a
                 structured manner and lays necessary groundwork for
                 future advancements.",
  acknowledgement = ack-nhfb,
  articleno =    "105",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{K:2019:VST,
  author =       "Vivekraj V. K. and Debashis Sen and Balasubramanian
                 Raman",
  title =        "Video Skimming: Taxonomy and Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "106:1--106:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3347712",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3347712",
  abstract =     "Video skimming, also known as dynamic video
                 summarization, generates a temporally abridged version
                 of a given video. Skimming can be achieved by
                 identifying significant components either in uni-modal
                 or multi-modal features extracted from the video. Being
                 dynamic in nature, video skimming, through temporal
                 connectivity, allows better understanding of the video
                 from its summary. Having this obvious advantage,
                 recently, video skimming has drawn the focus of many
                 researchers benefiting from the easy availability of
                 the required computing resources. In this article, we
                 provide a comprehensive survey on video skimming
                 focusing on the substantial amount of literature from
                 the past decade. We present a taxonomy of video
                 skimming approaches and discuss their evolution
                 highlighting key advances. We also provide a study on
                 the components required for the evaluation of a video
                 skimming performance.",
  acknowledgement = ack-nhfb,
  articleno =    "106",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Lorena:2019:HCY,
  author =       "Ana C. Lorena and Lu{\'\i}s P. F. Garcia and Jens
                 Lehmann and Marcilio C. P. Souto and Tin Kam Ho",
  title =        "How Complex Is Your Classification Problem?: a Survey
                 on Measuring Classification Complexity",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "5",
  pages =        "107:1--107:??",
  month =        oct,
  year =         "2019",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3347711",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3347711",
  abstract =     "Characteristics extracted from the training datasets
                 of classification problems have proven to be effective
                 predictors in a number of meta-analyses. Among them,
                 measures of classification complexity can be used to
                 estimate the difficulty in separating the data points
                 into their expected classes. Descriptors of the spatial
                 distribution of the data and estimates of the shape and
                 size of the decision boundary are among the known
                 measures for this characterization. This information
                 can support the formulation of new data-driven
                 pre-processing and pattern recognition techniques,
                 which can in turn be focused on challenges highlighted
                 by such characteristics of the problems. This article
                 surveys and analyzes measures that can be extracted
                 from the training datasets to characterize the
                 complexity of the respective classification problems.
                 Their use in recent literature is also reviewed and
                 discussed, allowing to prospect opportunities for
                 future work in the area. Finally, descriptions are
                 given on an R package named Extended Complexity Library
                 (ECoL) that implements a set of complexity measures and
                 is made publicly available.",
  acknowledgement = ack-nhfb,
  articleno =    "107",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wu:2020:CPM,
  author =       "Caesar Wu and Rajkumar Buyya and Kotagiri
                 Ramamohanarao",
  title =        "Cloud Pricing Models: Taxonomy, Survey, and
                 Interdisciplinary Challenges",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "108:1--108:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3342103",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3342103",
  abstract =     "This article provides a systematic review of cloud
                 pricing in an interdisciplinary approach. It examines
                 many historical cases of pricing in practice and tracks
                 down multiple roots of pricing in research. The aim is
                 to help both cloud service provider (CSP) and cloud
                 customers to capture the essence of cloud pricing when
                 they need to make a critical decision either to achieve
                 competitive advantages or to manage cloud resource
                 effectively. Currently, the number of available pricing
                 schemes in the cloud market is overwhelming. It is an
                 intricate issue to understand these schemes and
                 associated pricing models clearly due to involving
                 several domains of knowledge, such as cloud
                 technologies, microeconomics, operations research, and
                 value theory. Some earlier studies have introduced this
                 topic unsystematically. Their approaches inevitably
                 lead to much confusion for many cloud decision-makers.
                 To address their weaknesses, we present a comprehensive
                 taxonomy of cloud pricing, which is driven by a
                 framework of three fundamental pricing strategies that
                 are built on nine cloud pricing categories. These
                 categories can be further mapped onto a total of 60
                 pricing models. Many of the pricing models have been
                 already adopted by CSPs. Others have been widespread
                 across in other industries. We give descriptions of
                 these model categories and highlight both advantages
                 and disadvantages. Moreover, this article offers an
                 extensive survey of many cloud pricing models that were
                 proposed by many researchers during the past decade.
                 Based on the survey, we identify four trends of cloud
                 pricing and the general direction, which is moving from
                 intrinsic value per physical box to extrinsic value per
                 serverless sandbox. We conclude that hyper-converged
                 cloud resources pool supported by cloud orchestration,
                 virtual machine, Open Application Programming
                 Interface, and serverless sandbox will drive the future
                 of cloud pricing.",
  acknowledgement = ack-nhfb,
  articleno =    "108",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Binmakhashen:2020:DLA,
  author =       "Galal M. Binmakhashen and Sabri A. Mahmoud",
  title =        "Document Layout Analysis: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "109:1--109:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3355610",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3355610",
  abstract =     "Document layout analysis (DLA) is a preprocessing step
                 of document understanding systems. It is responsible
                 for detecting and annotating the physical structure of
                 documents. DLA has several important applications such
                 as document retrieval, content categorization, text
                 recognition, and the like. The objective of DLA is to
                 ease the subsequent analysis/recognition phases by
                 identifying the document-homogeneous blocks and by
                 determining their relationships. The DLA pipeline
                 consists of several phases that could vary among DLA
                 methods, depending on the documents' layouts and final
                 analysis objectives. In this regard, a universal DLA
                 algorithm that fits all types of document-layouts or
                 that satisfies all analysis objectives has not been
                 developed, yet. In this survey paper, we present a
                 critical study of different document layout analysis
                 techniques. The study highlights the motivational
                 reasons for pursuing DLA and discusses comprehensively
                 the different phases of the DLA algorithms based on a
                 general framework that is formed as an outcome of
                 reviewing the research in the field. The DLA framework
                 consists of preprocessing, layout analysis strategies,
                 post-processing, and performance evaluation phases.
                 Overall, the article delivers an essential baseline for
                 pursuing further research in document layout
                 analysis.",
  acknowledgement = ack-nhfb,
  articleno =    "109",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{DeGuzman:2020:SPA,
  author =       "Jaybie A. {De Guzman} and Kanchana Thilakarathna and
                 Aruna Seneviratne",
  title =        "Security and Privacy Approaches in Mixed Reality: a
                 Literature Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "110:1--110:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3359626",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3359626",
  abstract =     "Mixed reality (MR) technology development is now
                 gaining momentum due to advances in computer vision,
                 sensor fusion, and realistic display technologies. With
                 most of the research and development focused on
                 delivering the promise of MR, the privacy and security
                 implications of this technology are yet to be
                 thoroughly investigated. This survey article aims to
                 put in to light these risks and to look into the latest
                 security and privacy work on MR. Specifically, we list
                 and review the different protection approaches that
                 have been proposed to ensure user and data security and
                 privacy in MR. We extend the scope to include work on
                 related technologies such as augmented reality, virtual
                 reality, and human-computer interaction as crucial
                 components, if not the origins, of MR, as well as
                 numerous related work from the larger area of mobile
                 devices, wearables, and Internet-of-Things. We
                 highlight the lack of investigation, implementation,
                 and evaluation of data protection approaches in MR.
                 Further challenges and directions on MR security and
                 privacy are also discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "110",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Usman:2020:SRL,
  author =       "Muhammad Usman and Mian Ahmad Jan and Xiangjian He and
                 Jinjun Chen",
  title =        "A Survey on Representation Learning Efforts in
                 Cybersecurity Domain",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "111:1--111:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3331174",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3331174",
  abstract =     "In this technology-based era, network-based systems
                 are facing new cyber-attacks on daily bases.
                 Traditional cybersecurity approaches are based on old
                 threat-knowledge databases and need to be updated on a
                 daily basis to stand against new generation of
                 cyber-threats and protect underlying network-based
                 systems. Along with updating threat-knowledge
                 databases, there is a need for proper management and
                 processing of data generated by sensitive real-time
                 applications. In recent years, various computing
                 platforms based on representation learning algorithms
                 have emerged as a useful resource to manage and exploit
                 the generated data to extract meaningful information.
                 If these platforms are properly utilized, then strong
                 cybersecurity systems can be developed to protect the
                 underlying network-based systems and support sensitive
                 real-time applications. In this survey, we highlight
                 various cyber-threats, real-life examples, and
                 initiatives taken by various international
                 organizations. We discuss various computing platforms
                 based on representation learning algorithms to process
                 and analyze the generated data. We highlight various
                 popular datasets introduced by well-known global
                 organizations that can be used to train the
                 representation learning algorithms to predict and
                 detect threats. We also provide an in-depth analysis of
                 research efforts based on representation learning
                 algorithms made in recent years to protect the
                 underlying network-based systems against current
                 cyber-threats. Finally, we highlight various
                 limitations and challenges in these efforts and
                 available datasets that need to be considered when
                 using them to build cybersecurity systems.",
  acknowledgement = ack-nhfb,
  articleno =    "111",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Foltynek:2020:APD,
  author =       "Tom{\'a}s Folt{\'y}nek and Norman Meuschke and Bela
                 Gipp",
  title =        "Academic Plagiarism Detection: a Systematic Literature
                 Review",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "112:1--112:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3345317",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3345317",
  abstract =     "This article summarizes the research on computational
                 methods to detect academic plagiarism by systematically
                 reviewing 239 research papers published between 2013
                 and 2018. To structure the presentation of the research
                 contributions, we propose novel technically oriented
                 typologies for plagiarism prevention and detection
                 efforts, the forms of academic plagiarism, and
                 computational plagiarism detection methods. We show
                 that academic plagiarism detection is a highly active
                 research field. Over the period we review, the field
                 has seen major advances regarding the automated
                 detection of strongly obfuscated and thus
                 hard-to-identify forms of academic plagiarism. These
                 improvements mainly originate from better semantic text
                 analysis methods, the investigation of non-textual
                 content features, and the application of machine
                 learning. We identify a research gap in the lack of
                 methodologically thorough performance evaluations of
                 plagiarism detection systems. Concluding from our
                 analysis, we see the integration of heterogeneous
                 analysis methods for textual and non-textual content
                 features using machine learning as the most promising
                 area for future research contributions to improve the
                 detection of academic plagiarism further.",
  acknowledgement = ack-nhfb,
  articleno =    "112",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lilis:2020:SML,
  author =       "Yannis Lilis and Anthony Savidis",
  title =        "A Survey of Metaprogramming Languages",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "113:1--113:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3354584",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3354584",
  abstract =     "Metaprogramming is the process of writing computer
                 programs that treat programs as data, enabling them to
                 analyze or transform existing programs or generate new
                 ones. While the concept of metaprogramming has existed
                 for several decades, activities focusing on
                 metaprogramming have been increasing rapidly over the
                 past few years, with most languages offering some
                 metaprogramming support and the amount of metacode
                 being developed growing exponentially. In this article,
                 we introduce a taxonomy of metaprogramming languages
                 and present a survey of metaprogramming languages and
                 systems based on the taxonomy. Our classification is
                 based on the metaprogramming model adopted by the
                 language, the phase of the metaprogram evaluation, the
                 metaprogram source location, and the relation between
                 the metalanguage and the object language.",
  acknowledgement = ack-nhfb,
  articleno =    "113",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ngo:2020:SIS,
  author =       "Anh Cat Le Ngo and Rapha{\"e}l C.-W. Phan",
  title =        "Seeing the Invisible: Survey of Video Motion
                 Magnification and Small Motion Analysis",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "114:1--114:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3355389",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3355389",
  abstract =     "The latest techniques in video motion magnification
                 and relevant small motion analysis are surveyed. The
                 main motion magnification techniques are discussed in
                 chronological fashion, highlighting the inherent
                 limitations of predecessor techniques in comparison
                 with subsequent variants. The focus is then shifted to
                 the specific stages within the motion magnification
                 framework to discuss advancements that have been
                 proposed in the literature, namely for spatial
                 decomposition and for emphasizing, representing, and
                 distinguishing different motion signals. The survey
                 concludes with a treatment of different problems in
                 varying application contexts that have benefited from
                 motion magnification and small motion analysis.",
  acknowledgement = ack-nhfb,
  articleno =    "114",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Aafaq:2020:VDS,
  author =       "Nayyer Aafaq and Ajmal Mian and Wei Liu and Syed
                 Zulqarnain Gilani and Mubarak Shah",
  title =        "Video Description: a Survey of Methods, Datasets, and
                 Evaluation Metrics",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "115:1--115:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3355390",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3355390",
  abstract =     "Video description is the automatic generation of
                 natural language sentences that describe the contents
                 of a given video. It has applications in human-robot
                 interaction, helping the visually impaired and video
                 subtitling. The past few years have seen a surge of
                 research in this area due to the unprecedented success
                 of deep learning in computer vision and natural
                 language processing. Numerous methods, datasets, and
                 evaluation metrics have been proposed in the
                 literature, calling the need for a comprehensive survey
                 to focus research efforts in this flourishing new
                 direction. This article fills the gap by surveying the
                 state-of-the-art approaches with a focus on deep
                 learning models; comparing benchmark datasets in terms
                 of their domains, number of classes, and repository
                 size; and identifying the pros and cons of various
                 evaluation metrics, such as SPICE, CIDEr, ROUGE, BLEU,
                 METEOR, and WMD. Classical video description approaches
                 combined subject, object, and verb detection with
                 template-based language models to generate sentences.
                 However, the release of large datasets revealed that
                 these methods cannot cope with the diversity in
                 unconstrained open domain videos. Classical approaches
                 were followed by a very short era of statistical
                 methods that were soon replaced with deep learning, the
                 current state-of-the-art in video description. Our
                 survey shows that despite the fast-paced developments,
                 video description research is still in its infancy due
                 to the following reasons: Analysis of video description
                 models is challenging, because it is difficult to
                 ascertain the contributions towards accuracy or errors
                 of the visual features and the adopted language model
                 in the final description. Existing datasets neither
                 contain adequate visual diversity nor complexity of
                 linguistic structures. Finally, current evaluation
                 metrics fall short of measuring the agreement between
                 machine-generated descriptions with that of humans. We
                 conclude our survey by listing promising future
                 research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "115",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Basavarajaiah:2020:SCD,
  author =       "Madhushree Basavarajaiah and Priyanka Sharma",
  title =        "Survey of Compressed Domain Video Summarization
                 Techniques",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "116:1--116:29",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3355398",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3355398",
  abstract =     "Video summarization is the method of extracting key
                 frames or clips from a video to generate a synopsis of
                 the content of the video. Generally, video is
                 compressed before storing or transmitting it in most of
                 the practical applications. Traditional techniques
                 require the videos to be decoded to summarize them,
                 which is a tedious job. Instead, compressed domain
                 video processing can be used for summarizing videos by
                 partially decoding them. A classification and analysis
                 of various summarization techniques are presented in
                 this article with special focus on compressed domain
                 techniques along with a discussion on
                 machine-learning-based techniques that can be applied
                 to summarize the videos.",
  acknowledgement = ack-nhfb,
  articleno =    "116",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gleirscher:2020:NOI,
  author =       "Mario Gleirscher and Simon Foster and Jim Woodcock",
  title =        "New Opportunities for Integrated Formal Methods",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "117:1--117:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3357231",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3357231",
  abstract =     "Formal methods have provided approaches for
                 investigating software engineering fundamentals and
                 also have high potential to improve current practices
                 in dependability assurance. In this article, we
                 summarise known strengths and weaknesses of formal
                 methods. From the perspective of the assurance of
                 robots and autonomous systems (RAS), we highlight new
                 opportunities for integrated formal methods and
                 identify threats to the adoption of such methods. Based
                 on these opportunities and threats, we develop an
                 agenda for fundamental and empirical research on
                 integrated formal methods and for successful transfer
                 of validated research to RAS assurance. Furthermore, we
                 outline our expectations on useful outcomes of such an
                 agenda.",
  acknowledgement = ack-nhfb,
  articleno =    "117",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2020:SCG,
  author =       "Leibo Liu and Jianfeng Zhu and Zhaoshi Li and Yanan Lu
                 and Yangdong Deng and Jie Han and Shouyi Yin and
                 Shaojun Wei",
  title =        "A Survey of Coarse-Grained Reconfigurable Architecture
                 and Design: Taxonomy, Challenges, and Applications",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "118:1--118:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3357375",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3357375",
  abstract =     "As general-purpose processors have hit the power wall
                 and chip fabrication cost escalates alarmingly,
                 coarse-grained reconfigurable architectures (CGRAs) are
                 attracting increasing interest from both academia and
                 industry, because they offer the performance and energy
                 efficiency of hardware with the flexibility of
                 software. However, CGRAs are not yet mature in terms of
                 programmability, productivity, and adaptability. This
                 article reviews the architecture and design of CGRAs
                 thoroughly for the purpose of exploiting their full
                 potential. First, a novel multidimensional taxonomy is
                 proposed. Second, major challenges and the
                 corresponding state-of-the-art techniques are surveyed
                 and analyzed. Finally, the future development is
                 discussed.",
  acknowledgement = ack-nhfb,
  articleno =    "118",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Joshi:2020:STB,
  author =       "Aditya Joshi and Sarvnaz Karimi and Ross Sparks and
                 C{\'e}cile Paris and C. Raina Macintyre",
  title =        "Survey of Text-based Epidemic Intelligence: a
                 Computational Linguistics Perspective",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "119:1--119:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3361141",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3361141",
  abstract =     "Epidemic intelligence deals with the detection of
                 outbreaks using formal (such as hospital records) and
                 informal sources (such as user-generated text on the
                 web) of information. In this survey, we discuss
                 approaches for epidemic intelligence that use textual
                 datasets, referring to it as ``text-based epidemic
                 intelligence.'' We view past work in terms of two broad
                 categories: health mention classification (selecting
                 relevant text from a large volume) and health event
                 detection (predicting epidemic events from a collection
                 of relevant text). The focus of our discussion is the
                 underlying computational linguistic techniques in the
                 two categories. The survey also provides details of the
                 state of the art in annotation techniques, resources,
                 and evaluation strategies for epidemic intelligence.",
  acknowledgement = ack-nhfb,
  articleno =    "119",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Humbert:2020:SIP,
  author =       "Mathias Humbert and Benjamin Trubert and K{\'e}vin
                 Huguenin",
  title =        "A Survey on Interdependent Privacy",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "122:1--122:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3360498",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3360498",
  abstract =     "The privacy of individuals does not only depend on
                 their own actions and data but may also be affected by
                 the privacy decisions and by the data shared by other
                 individuals. This interdependence is an essential
                 aspect of privacy and ignoring it can lead to serious
                 privacy violations. In this survey, we summarize and
                 analyze research on interdependent privacy risks and on
                 the associated (cooperative and non-cooperative)
                 solutions. We also demonstrate that interdependent
                 privacy has been studied in isolation in different
                 research communities. By doing so, we systematize
                 knowledge on interdependent privacy research and
                 provide insights on how this research should be
                 conducted and which challenges it should address.",
  acknowledgement = ack-nhfb,
  articleno =    "122",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ren:2020:SEE,
  author =       "Ju Ren and Deyu Zhang and Shiwen He and Yaoxue Zhang
                 and Tao Li",
  title =        "A Survey on End-Edge-Cloud Orchestrated Network
                 Computing Paradigms: Transparent Computing, Mobile Edge
                 Computing, Fog Computing, and Cloudlet",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "125:1--125:??",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3362031",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 29 09:52:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/ft_gateway.cfm?id=3362031",
  abstract =     "Sending data to the cloud for analysis was a prominent
                 trend during the past decades, driving cloud computing
                 as a dominant computing paradigm. However, the
                 dramatically increasing number of devices and data
                 traffic in the Internet-of-Things (IoT) era are posing
                 significant burdens on the capacity-limited Internet
                 and uncontrollable service delay. It becomes difficult
                 to meet the delay-sensitive and context-aware service
                 requirements of IoT applications by using cloud
                 computing alone. Facing these challenges, computing
                 paradigms are shifting from the centralized cloud
                 computing to distributed edge computing. Several new
                 computing paradigms, including Transparent Computing,
                 Mobile Edge Computing, Fog Computing, and Cloudlet,
                 have emerged to leverage the distributed resources at
                 network edge to provide timely and context-aware
                 services. By integrating end devices, edge servers, and
                 cloud, they form a hierarchical IoT architecture, i.e.,
                 End-Edge-Cloud orchestrated architecture to improve the
                 performance of IoT systems. This article presents a
                 comprehensive survey of these emerging computing
                 paradigms from the perspective of end-edge-cloud
                 orchestration. Specifically, we first introduce and
                 compare the architectures and characteristics of
                 different computing paradigms. Then, a comprehensive
                 survey is presented to discuss state-of-the-art
                 research in terms of computation offloading, caching,
                 security, and privacy. Finally, some potential research
                 directions are envisioned for fostering continuous
                 research efforts.",
  acknowledgement = ack-nhfb,
  articleno =    "125",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Afianian:2020:MDA,
  author =       "Amir Afianian and Salman Niksefat and Babak Sadeghiyan
                 and David Baptiste",
  title =        "Malware Dynamic Analysis Evasion Techniques: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "1--28",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3365001",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jan 22 11:51:16 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3365001",
  abstract =     "The cyber world is plagued with ever-evolving malware
                 that readily infiltrate all defense mechanisms, operate
                 viciously unbeknownst to the user, and surreptitiously
                 exfiltrate sensitive data. Understanding the inner
                 workings of such malware provides a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "126",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Leite:2020:SDC,
  author =       "Leonardo Leite and Carla Rocha and Fabio Kon and Dejan
                 Milojicic and Paulo Meirelles",
  title =        "A Survey of {DevOps} Concepts and Challenges",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "1--35",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3359981",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jan 22 11:51:16 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3359981",
  abstract =     "DevOpsis a collaborative and multidisciplinary
                 organizational effort to automate continuous delivery
                 of new software updates while guaranteeing their
                 correctness and reliability. The present survey
                 investigates and discusses DevOps challenges from the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "127",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bridges:2020:SID,
  author =       "Robert A. Bridges and Tarrah R. Glass-Vanderlan and
                 Michael D. Iannacone and Maria S. Vincent and Qian
                 (Guenevere) Chen",
  title =        "A Survey of Intrusion Detection Systems Leveraging
                 Host Data",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "1--35",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3344382",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jan 22 11:51:16 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3344382",
  abstract =     "This survey focuses on intrusion detection systems
                 (IDS) that leverage host-based data sources for
                 detecting attacks on enterprise network. The host-based
                 IDS (HIDS) literature is organized by the input data
                 source, presenting targeted sub-surveys of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "128",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Thilakaratne:2020:SRL,
  author =       "Menasha Thilakaratne and Katrina Falkner and Thushari
                 Atapattu",
  title =        "A Systematic Review on Literature-based Discovery:
                 General Overview, Methodology, \& Statistical
                 Analysis",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "1--34",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3365756",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jan 22 11:51:16 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3365756",
  abstract =     "The vast nature of scientific publications brings out
                 the importance of Literature-Based Discovery (LBD)
                 research that is highly beneficial to accelerate
                 knowledge acquisition and the research development
                 process. LBD is a knowledge discovery workflow
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "129",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Saini:2020:HSS,
  author =       "Mukesh Kumar Saini and Neeraj Goel",
  title =        "How Smart Are Smart Classrooms? {A} Review of Smart
                 Classroom Technologies",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "1--28",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3365757",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jan 22 11:51:16 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3365757",
  abstract =     "There has been a large amount of work on smart
                 classrooms spanning over a wide range of research areas
                 including information communication technology, machine
                 learning, sensor networks, mobile computing, and
                 hardware. Consequently, there have been \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "130",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Drobyshevskiy:2020:RGM,
  author =       "Mikhail Drobyshevskiy and Denis Turdakov",
  title =        "Random Graph Modeling: a Survey of the Concepts",
  journal =      j-COMP-SURV,
  volume =       "52",
  number =       "6",
  pages =        "1--36",
  month =        jan,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3369782",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jan 22 11:51:16 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3369782",
  abstract =     "Random graph (RG) models play a central role in
                 complex networks analysis. They help us to understand,
                 control, and predict phenomena occurring, for instance,
                 in social networks, biological networks, the Internet,
                 and so on. Despite a large number of RG \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "131",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bae:2020:ICC,
  author =       "Juhee Bae and Tove Helldin and Maria Riveiro and
                 S{\l}awomir Nowaczyk and Mohamed-Rafik Bouguelia and
                 G{\"o}ran Falkman",
  title =        "Interactive Clustering: a Comprehensive Review",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "1:1--1:39",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3340960",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3340960",
  abstract =     "In this survey, 105 papers related to interactive
                 clustering were reviewed according to seven
                 perspectives: (1) on what level is the interaction
                 happening, (2) which interactive operations are
                 involved, (3) how user feedback is incorporated, (4)
                 how \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fan:2020:DTM,
  author =       "Xinxin Fan and Ling Liu and Rui Zhang and Quanliang
                 Jing and Jingping Bi",
  title =        "Decentralized Trust Management: Risk Analysis and
                 Trust Aggregation",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "2:1--2:33",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3362168",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3362168",
  abstract =     "Decentralized trust management is used as a referral
                 benchmark for assisting decision making by human or
                 intelligence machines in open collaborative systems.
                 During any given period of time, each participant may
                 only interact with a few other \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mayer:2020:SDL,
  author =       "Ruben Mayer and Hans-Arno Jacobsen",
  title =        "Scalable Deep Learning on Distributed Infrastructures:
                 Challenges, Techniques, and Tools",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "3:1--3:37",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3363554",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3363554",
  abstract =     "Deep Learning (DL) has had an immense success in the
                 recent past, leading to state-of-the-art results in
                 various domains, such as image recognition and natural
                 language processing. One of the reasons for this
                 success is the increasing size of DL models \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2020:SCT,
  author =       "Junjie Chen and Jibesh Patra and Michael Pradel and
                 Yingfei Xiong and Hongyu Zhang and Dan Hao and Lu
                 Zhang",
  title =        "A Survey of Compiler Testing",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "4:1--4:36",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3363562",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3363562",
  abstract =     "Virtually any software running on a computer has been
                 processed by a compiler or a compiler-like tool.
                 Because compilers are such a crucial piece of
                 infrastructure for building software, their correctness
                 is of paramount importance. To validate and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Randal:2020:IVR,
  author =       "Allison Randal",
  title =        "The Ideal Versus the Real: Revisiting the History of
                 Virtual Machines and Containers",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "5:1--5:31",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3365199",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3365199",
  abstract =     "The common perception in both academic literature and
                 industry today is that virtual machines offer better
                 security, whereas containers offer better performance.
                 However, a detailed review of the history of these
                 technologies and the current threats they face reveals
                 a different story. This survey covers key developments
                 in the evolution of virtual machines and containers
                 from the 1950s to today, with an emphasis on countering
                 modern misperceptions with accurate historical details
                 and providing a solid foundation for ongoing research
                 into the future of secure isolation for multitenant
                 infrastructures, such as cloud and container
                 deployments.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Paulino:2020:IPE,
  author =       "Nuno Paulino and Jo{\~a}o Canas Ferreira and Jo{\~a}o
                 M. P. Cardoso",
  title =        "Improving Performance and Energy Consumption in
                 Embedded Systems via Binary Acceleration: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "6:1--6:36",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3369764",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3369764",
  abstract =     "The breakdown of Dennard scaling has resulted in a
                 decade-long stall of the maximum operating clock
                 frequencies of processors. To mitigate this issue,
                 computing shifted to multi-core devices. This
                 introduced the need for programming flows and tools
                 that \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Razis:2020:MIS,
  author =       "Gerasimos Razis and Ioannis Anagnostopoulos and
                 Sherali Zeadally",
  title =        "Modeling Influence with Semantics in Social Networks:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "7:1--7:38",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3369780",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3369780",
  abstract =     "The discovery of influential entities in all kinds of
                 networks (e.g., social, digital, or computer) has
                 always been an important field of study. In recent
                 years, Online Social Networks (OSNs) have been
                 established as a basic means of communication and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Etemad:2020:GDD,
  author =       "Mohammad Etemad and Alptekin K{\"u}p{\c{c}}{\"u}",
  title =        "Generic Dynamic Data Outsourcing Framework for
                 Integrity Verification",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "8:1--8:32",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3365998",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3365998",
  abstract =     "Ateniese et al. proposed the Provable Data Possession
                 (PDP) model in 2007. Following that, Erway et al.
                 adapted the model for dynamically updatable data and
                 called it the Dynamic Provable Data Possession (DPDP)
                 model. The idea is that a client \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kolb:2020:CCC,
  author =       "John Kolb and Moustafa AbdelBaky and Randy H. Katz and
                 David E. Culler",
  title =        "Core Concepts, Challenges, and Future Directions in
                 Blockchain: a Centralized Tutorial",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "9:1--9:39",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3366370",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3366370",
  abstract =     "Blockchains are a topic of immense interest in
                 academia and industry, but their true nature is often
                 obscured by marketing and hype. In this tutorial, we
                 explain the fundamental elements of blockchains. We
                 discuss their ability to achieve availability,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hilman:2020:MWS,
  author =       "Muhammad H. Hilman and Maria A. Rodriguez and Rajkumar
                 Buyya",
  title =        "Multiple Workflows Scheduling in Multi-tenant
                 Distributed Systems: a Taxonomy and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "10:1--10:39",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3368036",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3368036",
  abstract =     "Workflows are an application model that enables the
                 automated execution of multiple interdependent and
                 interconnected tasks. They are widely used by the
                 scientific community to manage the distributed
                 execution and dataflow of complex simulations and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2020:DLB,
  author =       "Dong Liu and Yue Li and Jianping Lin and Houqiang Li
                 and Feng Wu",
  title =        "Deep Learning-Based Video Coding: a Review and a Case
                 Study",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "11:1--11:35",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3368405",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3368405",
  abstract =     "The past decade has witnessed the great success of
                 deep learning in many disciplines, especially in
                 computer vision and image processing. However, deep
                 learning-based video coding remains in its infancy. We
                 review the representative works about using \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kucuk:2020:SDS,
  author =       "Dilek K{\"u}{\c{c}}{\"u}k and Fazli Can",
  title =        "Stance Detection: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "12:1--12:37",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3369026",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3369026",
  abstract =     "Automatic elicitation of semantic information from
                 natural language texts is an important research problem
                 with many practical application areas. Especially after
                 the recent proliferation of online content through
                 channels such as social media sites, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yasuda:2020:AVN,
  author =       "Yuri D. V. Yasuda and Luiz Eduardo G. Martins and
                 Fabio A. M. Cappabianco",
  title =        "Autonomous Visual Navigation for Mobile Robots: a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "13:1--13:34",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3368961",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3368961",
  abstract =     "Autonomous mobile robots are required to move
                 throughout map the environment, locate themselves, and
                 plan paths between positions. Vision stands out among
                 the other senses for its richness and practicality.
                 Even though there are well-established \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Suran:2020:FCI,
  author =       "Shweta Suran and Vishwajeet Pattanaik and Dirk
                 Draheim",
  title =        "Frameworks for Collective Intelligence: a Systematic
                 Literature Review",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "14:1--14:36",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3368986",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3368986",
  abstract =     "Over the last few years, Collective Intelligence (CI)
                 platforms have become a vital resource for learning,
                 problem solving, decision-making, and predictions. This
                 rising interest in the topic has to led to the
                 development of several models and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mallawaarachchi:2020:CDN,
  author =       "Vijini Mallawaarachchi and Lakmal Meegahapola and
                 Roshan Madhushanka and Eranga Heshan and Dulani
                 Meedeniya and Sampath Jayarathna",
  title =        "Change Detection and Notification of {Web} Pages: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "15:1--15:35",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3369876",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3369876",
  abstract =     "The majority of currently available webpages are
                 dynamic in nature and are changing frequently. New
                 content gets added to webpages, and existing content
                 gets updated or deleted. Hence, people find it useful
                 to be alert for changes in webpages that \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Vieira:2020:FPP,
  author =       "Marcos A. M. Vieira and Matheus S. Castanho and Racyus
                 D. G. Pac{\'\i}fico and Elerson R. S. Santos and
                 Eduardo P. M. C{\^a}mara J{\'u}nior and Luiz F. M.
                 Vieira",
  title =        "Fast Packet Processing with {eBPF} and {XDP}:
                 Concepts, Code, Challenges, and Applications",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "16:1--16:36",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3371038",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3371038",
  abstract =     "Extended Berkeley Packet Filter (eBPF) is an
                 instruction set and an execution environment inside the
                 Linux kernel. It enables modification, interaction, and
                 kernel programmability at runtime. eBPF can be used to
                 program the eXpress Data Path (XDP), a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Landau:2020:MYM,
  author =       "Ofir Landau and Rami Puzis and Nir Nissim",
  title =        "Mind Your Mind: {EEG}-Based Brain--Computer Interfaces
                 and Their Security in Cyber Space",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "17:1--17:38",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3372043",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3372043",
  abstract =     "A brain-computer interface (BCI) system is a system
                 that leverages brainwave information acquired by a
                 designated brain monitoring device to interact with a
                 computerized system. Over the past 40 years, many BCI
                 applications have been developed in a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lao:2020:SIA,
  author =       "Laphou Lao and Zecheng Li and Songlin Hou and Bin Xiao
                 and Songtao Guo and Yuanyuan Yang",
  title =        "A Survey of {IoT} Applications in Blockchain Systems:
                 Architecture, Consensus, and Traffic Modeling",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "18:1--18:32",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3372136",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3372136",
  abstract =     "Blockchain technology can be extensively applied in
                 diverse services, including online micro-payments,
                 supply chain tracking, digital forensics, health-care
                 record sharing, and insurance payments. Extending the
                 technology to the Internet of things (IoT),. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Brais:2020:SCS,
  author =       "Hadi Brais and Rajshekar Kalayappan and Preeti Ranjan
                 Panda",
  title =        "A Survey of Cache Simulators",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "19:1--19:32",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3372393",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3372393",
  abstract =     "Computer architecture simulation tools are essential
                 for implementing and evaluating new ideas in the domain
                 and can be useful for understanding the behavior of
                 programs and finding microarchitectural bottlenecks.
                 One particularly important part of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kaloudi:2020:ABC,
  author =       "Nektaria Kaloudi and Jingyue Li",
  title =        "The {AI}-Based Cyber Threat Landscape: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "20:1--20:34",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3372823",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3372823",
  abstract =     "Recent advancements in artificial intelligence (AI)
                 technologies have induced tremendous growth in
                 innovation and automation. Although these AI
                 technologies offer significant benefits, they can be
                 used maliciously. Highly targeted and evasive attacks
                 in \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Luo:2020:SCS,
  author =       "Chu Luo and Jorge Goncalves and Eduardo Velloso and
                 Vassilis Kostakos",
  title =        "A Survey of Context Simulation for Testing Mobile
                 Context-Aware Applications",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "21:1--21:39",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3372788",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3372788",
  abstract =     "Equipped with an abundance of small-scale
                 microelectromechanical sensors, modern mobile devices
                 such as smartphones and smartwatches can now offer
                 context-aware services to users in mobile environments.
                 Although advances in mobile context-aware \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cini:2020:MCR,
  author =       "Nevin Cini and Gulay Yalcin",
  title =        "A Methodology for Comparing the Reliability of
                 {GPU}-Based and {CPU}-Based {HPCs}",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "1",
  pages =        "22:1--22:33",
  month =        may,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3372790",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat May 30 20:55:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3372790",
  abstract =     "Today, GPUs are widely used as
                 coprocessors/accelerators in High-Performance
                 Heterogeneous Computing due to their many advantages.
                 However, many researches emphasize that GPUs are not as
                 reliable as desired yet. Despite the fact that GPUs are
                 more \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Heldens:2020:LER,
  author =       "Stijn Heldens and Pieter Hijma and Ben {Van Werkhoven}
                 and Jason Maassen and Adam S. Z. Belloum and Rob V.
                 {Van Nieuwpoort}",
  title =        "The Landscape of Exascale Research: a Data-Driven
                 Literature Analysis",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "23:1--23:43",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3372390",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3372390",
  abstract =     "The next generation of supercomputers will break the
                 exascale barrier. Soon we will have systems capable of
                 at least one quintillion (billion billion)
                 floating-point operations per second (10$^{18}$ FLOPS).
                 Tremendous amounts of work have been invested into
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sahni:2020:MED,
  author =       "Sartaj Sahni and Albert Y. Zomaya",
  title =        "In Memoriam {Eliezer Dekel} (1948--2020)",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "23:1--23:2",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3389414",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3389414",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rai:2020:SCM,
  author =       "Sunny Rai and Shampa Chakraverty",
  title =        "A Survey on Computational Metaphor Processing",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "24:1--24:37",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3373265",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3373265",
  abstract =     "In the last decade, the problem of computational
                 metaphor processing has garnered immense attention from
                 the domains of computational linguistics and cognition.
                 A wide panorama of approaches, ranging from a
                 hand-coded rule system to deep learning \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sequeiros:2020:ASM,
  author =       "Jo{\~a}o B. F. Sequeiros and Francisco T. Chimuco and
                 Musa G. Samaila and M{\'a}rio M. Freire and Pedro R. M.
                 In{\'a}cio",
  title =        "Attack and System Modeling Applied to {IoT}, Cloud,
                 and Mobile Ecosystems: Embedding Security by Design",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "25:1--25:32",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3376123",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3376123",
  abstract =     "Over the years, pervasive computing and communication
                 technologies have enabled the emergence of new
                 computing paradigms that have gained importance across
                 a wide spectrum of domains. The three most notable that
                 have witnessed significant advancements \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cong:2020:SPO,
  author =       "Peijin Cong and Guo Xu and Tongquan Wei and Keqin Li",
  title =        "A Survey of Profit Optimization Techniques for Cloud
                 Providers",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "26:1--26:35",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3376917",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3376917",
  abstract =     "As the demand for computing resources grows, cloud
                 computing becomes more and more popular as a
                 pay-as-you-go model, in which the computing resources
                 and services are provided to cloud users efficiently.
                 For cloud providers, the typical goal is to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{DeAguiar:2020:SBB,
  author =       "Erikson J{\'u}lio {De Aguiar} and Bruno S.
                 Fai{\c{c}}al and Bhaskar Krishnamachari and J{\'o}
                 Ueyama",
  title =        "A Survey of Blockchain-Based Strategies for
                 Healthcare",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "27:1--27:27",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3376915",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3376915",
  abstract =     "Blockchain technology has been gaining visibility
                 owing to its ability to enhance the security,
                 reliability, and robustness of distributed systems.
                 Several areas have benefited from research based on
                 this technology, such as finance, remote sensing, data
                 analysis, and healthcare. Data immutability, privacy,
                 transparency, decentralization, and distributed ledgers
                 are the main features that make blockchain an
                 attractive technology. However, healthcare records that
                 contain confidential patient data make this system very
                 complicated because there is a risk of a privacy
                 breach. This study aims to address research into the
                 applications of the blockchain healthcare area. It sets
                 out by discussing the management of medical
                 information, as well as the sharing of medical records,
                 image sharing, and log management. We also discuss
                 papers that intersect with other areas, such as the
                 Internet of Things, the management of information,
                 tracking of drugs along their supply chain, and aspects
                 of security and privacy. As we are aware that there are
                 other surveys of blockchain in healthcare, we analyze
                 and compare both the positive and negative aspects of
                 their papers. Finally, we seek to examine the concepts
                 of blockchain in the medical area, by assessing their
                 benefits and drawbacks and thus giving guidance to
                 other researchers in the area. Additionally, we
                 summarize the methods used in healthcare per
                 application area and show their pros and cons.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wu:2020:MLA,
  author =       "Jian Wu and Victor S. Sheng and Jing Zhang and Hua Li
                 and Tetiana Dadakova and Christine Leon Swisher and
                 Zhiming Cui and Pengpeng Zhao",
  title =        "Multi-Label Active Learning Algorithms for Image
                 Classification: Overview and Future Promise",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "28:1--28:35",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3379504",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3379504",
  abstract =     "Image classification is a key task in image
                 understanding, and multi-label image classification has
                 become a popular topic in recent years. However, the
                 success of multi-label image classification is closely
                 related to the way of constructing a training
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Falcon-Cardona:2020:IBM,
  author =       "Jes{\'u}s Guillermo Falc{\'o}n-Cardona and Carlos A.
                 Coello Coello",
  title =        "Indicator-based Multi-objective Evolutionary
                 Algorithms: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "29:1--29:35",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3376916",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3376916",
  abstract =     "For over 25 years, most multi-objective evolutionary
                 algorithms (MOEAs) have adopted selection criteria
                 based on Pareto dominance. However, the performance of
                 Pareto-based MOEAs quickly degrades when solving
                 multi-objective optimization problems (MOPs) \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Verbraeken:2020:SDM,
  author =       "Joost Verbraeken and Matthijs Wolting and Jonathan
                 Katzy and Jeroen Kloppenburg and Tim Verbelen and Jan
                 S. Rellermeyer",
  title =        "A Survey on Distributed Machine Learning",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "30:1--30:33",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3377454",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3377454",
  abstract =     "The demand for artificial intelligence has grown
                 significantly over the past decade, and this growth has
                 been fueled by advances in machine learning techniques
                 and the ability to leverage hardware acceleration.
                 However, to increase the quality of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Papadakis:2020:BFT,
  author =       "George Papadakis and Dimitrios Skoutas and Emmanouil
                 Thanos and Themis Palpanas",
  title =        "Blocking and Filtering Techniques for Entity
                 Resolution: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "31:1--31:42",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3377455",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3377455",
  abstract =     "Entity Resolution (ER), a core task of Data
                 Integration, detects different entity profiles that
                 correspond to the same real-world object. Due to its
                 inherently quadratic complexity, a series of techniques
                 accelerate it so that it scales to voluminous
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sahin:2020:CGH,
  author =       "Erdem Sahin and Elena Stoykova and Jani M{\"a}kinen
                 and Atanas Gotchev",
  title =        "Computer-Generated Holograms for {$3$D} Imaging: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "32:1--32:35",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3378444",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3378444",
  abstract =     "Holography is usually considered as the ultimate way
                 to visually reproduce a three-dimensional scene.
                 Computer-generated holography constitutes an important
                 branch of holography, which enables visualization of
                 artificially generated scenes as well as \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cherubin:2020:TRP,
  author =       "Stefano Cherubin and Giovanni Agosta",
  title =        "Tools for Reduced Precision Computation: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "33:1--33:35",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3381039",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3381039",
  abstract =     "The use of reduced precision to improve performance
                 metrics such as computation latency and power
                 consumption is a common practice in the embedded
                 systems field. This practice is emerging as a new trend
                 in High Performance Computing (HPC), especially when
                 new error-tolerant applications are considered.
                 However, standard compiler frameworks do not support
                 automated precision customization, and manual tuning
                 and code transformation is the approach usually adopted
                 in most domains. In recent years, research have been
                 studying ways to improve the automation of this
                 process. This article surveys this body of work,
                 identifying the critical steps of this process, the
                 most advanced tools available, and the open challenges
                 in this research area. We conclude that, while several
                 mature tools exist, there is still a gap to close,
                 especially for tools based on static analysis rather
                 than profiling, as well as for integration within
                 mainstream, industry-strength compiler frameworks.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zolfaghari:2020:CDN,
  author =       "Behrouz Zolfaghari and Gautam Srivastava and
                 Swapnoneel Roy and Hamid R. Nemati and Fatemeh Afghah
                 and Takeshi Koshiba and Abolfazl Razi and Khodakhast
                 Bibak and Pinaki Mitra and Brijesh Kumar Rai",
  title =        "Content Delivery Networks: State of the Art, Trends,
                 and Future Roadmap",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "34:1--34:34",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3380613",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3380613",
  abstract =     "Recently, Content Delivery Networks (CDN) have become
                 more and more popular. The technology itself is ahead
                 of academic research in this area. Several dimensions
                 of the technology have not been adequately investigated
                 by academia. These dimensions \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alam:2020:SNV,
  author =       "Iqbal Alam and Kashif Sharif and Fan Li and Zohaib
                 Latif and M. M. Karim and Sujit Biswas and Boubakr Nour
                 and Yu Wang",
  title =        "A Survey of Network Virtualization Techniques for
                 {Internet of Things} Using {SDN} and {NFV}",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "35:1--35:40",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3379444",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3379444",
  abstract =     "Internet of Things (IoT) and Network Softwarization
                 are fast becoming core technologies of information
                 systems and network management for the next-generation
                 Internet. The deployment and applications of IoT range
                 from smart cities to urban computing and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bonifati:2020:GGS,
  author =       "Angela Bonifati and Irena Holubov{\'a} and Arnau
                 Prat-P{\'e}rez and Sherif Sakr",
  title =        "Graph Generators: State of the Art and Open
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "36:1--36:30",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3379445",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3379445",
  abstract =     "The abundance of interconnected data has fueled the
                 design and implementation of graph generators
                 reproducing real-world linking properties or gauging
                 the effectiveness of graph algorithms, techniques, and
                 applications manipulating these data. We \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lu:2020:KTV,
  author =       "Ying Lu and Lingkun Luo and Di Huang and Yunhong Wang
                 and Liming Chen",
  title =        "Knowledge Transfer in Vision Recognition: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "37:1--37:35",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3379344",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3379344",
  abstract =     "In this survey, we propose to explore and discuss the
                 common rules behind knowledge transfer works for vision
                 recognition tasks. To achieve this, we firstly discuss
                 the different kinds of reusable knowledge existing in a
                 vision recognition task, and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cong:2020:SHE,
  author =       "Peijin Cong and Junlong Zhou and Liying Li and Kun Cao
                 and Tongquan Wei and Keqin Li",
  title =        "A Survey of Hierarchical Energy Optimization for
                 Mobile Edge Computing: a Perspective from End Devices
                 to the Cloud",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "38:1--38:44",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3378935",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3378935",
  abstract =     "With the development of wireless technology, various
                 emerging mobile applications are attracting significant
                 attention and drastically changing our daily lives.
                 Applications such as augmented reality and object
                 recognition demand stringent delay and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Valejo:2020:CSM,
  author =       "Alan Valejo and Vin{\'\i}cius Ferreira and Renato
                 Fabbri and Maria Cristina Ferreira de Oliveira and
                 Alneu de Andrade Lopes",
  title =        "A Critical Survey of the Multilevel Method in Complex
                 Networks",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "39:1--39:35",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3379347",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3379347",
  abstract =     "Multilevel optimization aims at reducing the cost of
                 executing a target network-based algorithm by
                 exploiting coarsened, i.e., reduced or simplified,
                 versions of the network. There is a growing interest in
                 multilevel algorithms in networked systems, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Suaboot:2020:TSL,
  author =       "Jakapan Suaboot and Adil Fahad and Zahir Tari and John
                 Grundy and Abdun Naser Mahmood and Abdulmohsen Almalawi
                 and Albert Y. Zomaya and Khalil Drira",
  title =        "A Taxonomy of Supervised Learning for {IDSs} in
                 {SCADA} Environments",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "40:1--40:37",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3379499",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3379499",
  abstract =     "Supervisory Control and Data Acquisition (SCADA)
                 systems play an important role in monitoring industrial
                 processes such as electric power distribution,
                 transport systems, water distribution, and wastewater
                 collection systems. Such systems require a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2020:SRS,
  author =       "Guangjie Li and Hui Liu and Ally S. Nyamawe",
  title =        "A Survey on Renamings of Software Entities",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "41:1--41:38",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3379443",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3379443",
  abstract =     "More than 70\% of characters in the source code are
                 used to label identifiers. Consequently, identifiers
                 are one of the most important source for program
                 comprehension. Meaningful identifiers are crucial to
                 understand and maintain programs. However, for
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kannengiesser:2020:TOB,
  author =       "Niclas Kannengie{\ss}er and Sebastian Lins and Tobias
                 Dehling and Ali Sunyaev",
  title =        "Trade-offs between Distributed Ledger Technology
                 Characteristics",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "42:1--42:37",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3379463",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3379463",
  abstract =     "When developing peer-to-peer applications on
                 distributed ledger technology (DLT), a crucial decision
                 is the selection of a suitable DLT design (e.g.,
                 Ethereum), because it is hard to change the underlying
                 DLT design post hoc. To facilitate the selection
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Herodotou:2020:SAP,
  author =       "Herodotos Herodotou and Yuxing Chen and Jiaheng Lu",
  title =        "A Survey on Automatic Parameter Tuning for Big Data
                 Processing Systems",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "43:1--43:37",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3381027",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3381027",
  abstract =     "Big data processing systems (e.g., Hadoop, Spark,
                 Storm) contain a vast number of configuration
                 parameters controlling parallelism, I/O behavior,
                 memory settings, and compression. Improper parameter
                 settings can cause significant performance degradation
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Figueroa-Lorenzo:2020:SIP,
  author =       "Santiago Figueroa-Lorenzo and Javier A{\~n}orga and
                 Saioa Arrizabalaga",
  title =        "A Survey of {IIoT} Protocols: a Measure of
                 Vulnerability Risk Analysis Based on {CVSS}",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "44:1--44:53",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3381038",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3381038",
  abstract =     "Industrial Internet of Things (IIoT) is present in
                 many participants from the energy, health,
                 manufacturing, transport, and public sectors. Many
                 factors catalyze IIoT, such as robotics, artificial
                 intelligence, and intelligent decentralized \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sierra-Arriaga:2020:SIC,
  author =       "Federico Sierra-Arriaga and Rodrigo Branco and Ben
                 Lee",
  title =        "Security Issues and Challenges for Virtualization
                 Technologies",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "2",
  pages =        "45:1--45:37",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3382190",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:43 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3382190",
  abstract =     "Virtualization-based technologies have become
                 ubiquitous in computing. While they provide an
                 easy-to-implement platform for scalable,
                 high-availability services, they also introduce new
                 security issues. Traditionally, discussions on security
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zeng:2020:SMB,
  author =       "Xuezhi Zeng and Saurabh Garg and Mutaz Barika and
                 Albert Y. Zomaya and Lizhe Wang and Massimo Villari and
                 Dan Chen and Rajiv Ranjan",
  title =        "{SLA} Management for Big Data Analytical Applications
                 in Clouds: a Taxonomy Study",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "46:1--46:40",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3383464",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3383464",
  abstract =     "Recent years have witnessed the booming of big data
                 analytical applications (BDAAs). This trend provides
                 unrivaled opportunities to reveal the latent patterns
                 and correlations embedded in the data, and thus
                 productive decisions may be made. This was \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Patil:2020:VQG,
  author =       "Charulata Patil and Manasi Patwardhan",
  title =        "Visual Question Generation: The State of the Art",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "47:1--47:22",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3383465",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3383465",
  abstract =     "Visual question generation (VQG) is an interesting
                 problem that has recently received attention. The task
                 of VQG involves generating meaningful questions based
                 on the input image. It is a multi-modal problem
                 involving image understanding and natural \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Macedo:2020:SCS,
  author =       "Ricardo Macedo and Jo{\~a}o Paulo and Jos{\'e} Pereira
                 and Alysson Bessani",
  title =        "A Survey and Classification of Software-Defined
                 Storage Systems",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "48:1--48:38",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3385896",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3385896",
  abstract =     "The exponential growth of digital information is
                 imposing increasing scale and efficiency demands on
                 modern storage infrastructures. As infrastructure
                 complexity increases, so does the difficulty in
                 ensuring quality of service, maintainability, and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alhakamy:2020:RTI,
  author =       "A'Aeshah Alhakamy and Mihran Tuceryan",
  title =        "Real-time Illumination and Visual Coherence for
                 Photorealistic Augmented\slash Mixed Reality",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "49:1--49:34",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3386496",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3386496",
  abstract =     "A realistically inserted virtual object in the
                 real-time physical environment is a desirable feature
                 in augmented reality (AR) applications and mixed
                 reality (MR) in general. This problem is considered a
                 vital research area in computer graphics, a field
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2020:RMS,
  author =       "Xunyun Liu and Rajkumar Buyya",
  title =        "Resource Management and Scheduling in Distributed
                 Stream Processing Systems: a Taxonomy, Review, and
                 Future Directions",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "50:1--50:41",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3355399",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3355399",
  abstract =     "Stream processing is an emerging paradigm to handle
                 data streams upon arrival, powering latency-critical
                 application such as fraud detection, algorithmic
                 trading, and health surveillance. Though there are a
                 variety of Distributed Stream Processing \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Stanley-Marbell:2020:EEE,
  author =       "Phillip Stanley-Marbell and Armin Alaghi and Michael
                 Carbin and Eva Darulova and Lara Dolecek and Andreas
                 Gerstlauer and Ghayoor Gillani and Djordje Jevdjic and
                 Thierry Moreau and Mattia Cacciotti and Alexandros
                 Daglis and Natalie Enright Jerger and Babak Falsafi and
                 Sasa Misailovic and Adrian Sampson and Damien
                 Zufferey",
  title =        "Exploiting Errors for Efficiency: a Survey from
                 Circuits to Applications",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "51:1--51:39",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3394898",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3394898",
  abstract =     "When a computational task tolerates a relaxation of
                 its specification or when an algorithm tolerates the
                 effects of noise in its execution, hardware, system
                 software, and programming language compilers or their
                 runtime systems can trade deviations from \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Akpinar:2020:ECS,
  author =       "Elg{\i}n Akpinar and Yel{\i}z Yes{\i}lada and Sel{\i}m
                 Tem{\i}zer",
  title =        "The Effect of Context on Small Screen and Wearable
                 Device Users' Performance --- A Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "52:1--52:44",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3386370",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3386370",
  abstract =     "Small screen and wearable devices play a key role in
                 most of our daily tasks and activities. However,
                 depending on the context, users can easily experience
                 situationally induced impairments and disabilities
                 (SIIDs). Previous studies have defined SIIDs \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Warford:2020:CDS,
  author =       "J. Stanley Warford and David Vega and Scott M.
                 Staley",
  title =        "A Calculational Deductive System for Linear Temporal
                 Logic",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "53:1--53:38",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3387109",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3387109",
  abstract =     "This article surveys the linear temporal logic (LTL)
                 literature and presents all the LTL theorems from the
                 survey, plus many new ones, in a calculational
                 deductive system. Calculational deductive systems,
                 developed by Dijkstra and Scholten and extended
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Das:2020:SFD,
  author =       "Rangan Das and Sagnik Sen and Ujjwal Maulik",
  title =        "A Survey on Fuzzy Deep Neural Networks",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "54:1--54:25",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3369798",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3369798",
  abstract =     "Deep neural networks are a class of powerful machine
                 learning model that uses successive layers of
                 non-linear processing units to extract features from
                 data. However, the training process of such networks is
                 quite computationally intensive and uses \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Boukerche:2020:ODM,
  author =       "Azzedine Boukerche and Lining Zheng and Omar Alfandi",
  title =        "Outlier Detection: Methods, Models, and
                 Classification",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "55:1--55:37",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3381028",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3381028",
  abstract =     "Over the past decade, we have witnessed an enormous
                 amount of research effort dedicated to the design of
                 efficient outlier detection techniques while taking
                 into consideration efficiency, accuracy,
                 high-dimensional data, and distributed environments,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Beaumont:2020:STT,
  author =       "Olivier Beaumont and Louis-Claude Canon and Lionel
                 Eyraud-Dubois and Giorgio Lucarelli and Loris Marchal
                 and Cl{\'e}ment Mommessin and Bertrand Simon and Denis
                 Trystram",
  title =        "Scheduling on Two Types of Resources: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "56:1--56:36",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3387110",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3387110",
  abstract =     "The evolution in the design of modern parallel
                 platforms leads to revisit the scheduling jobs on
                 distributed heterogeneous resources. The goal of this
                 survey is to present the main existing algorithms, to
                 classify them based on their underlying \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Prenkaj:2020:SML,
  author =       "Bardh Prenkaj and Paola Velardi and Giovanni Stilo and
                 Damiano Distante and Stefano Faralli",
  title =        "A Survey of Machine Learning Approaches for Student
                 Dropout Prediction in Online Courses",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "57:1--57:34",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3388792",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3388792",
  abstract =     "The recent diffusion of online education (both MOOCs
                 and e-courses) has led to an increased economic and
                 scientific interest in e-learning environments. As
                 widely documented, online students have a much higher
                 chance of dropping out than those attending \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ismail:2020:CSP,
  author =       "Leila Ismail and Huned Materwala",
  title =        "Computing Server Power Modeling in a Data Center:
                 Survey, Taxonomy, and Performance Evaluation",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "58:1--58:34",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3390605",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3390605",
  abstract =     "Data centers are large-scale, energy-hungry
                 infrastructure serving the increasing computational
                 demands as the world is becoming more connected in
                 smart cities. The emergence of advanced technologies
                 such as cloud-based services, internet of things (IoT).
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Welsh:2020:RCC,
  author =       "Thomas Welsh and Elhadj Benkhelifa",
  title =        "On Resilience in Cloud Computing: a Survey of
                 Techniques across the Cloud Domain",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "59:1--59:36",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3388922",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3388922",
  abstract =     "Cloud infrastructures are highly favoured as a
                 computing delivery model worldwide, creating a strong
                 societal dependence. It is therefore vital to enhance
                 their resilience, providing persistent service delivery
                 under a variety of conditions. Cloud \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Anwar:2020:DJS,
  author =       "Saeed Anwar and Salman Khan and Nick Barnes",
  title =        "A Deep Journey into Super-resolution: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "60:1--60:34",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3390462",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3390462",
  abstract =     "Deep convolutional networks-based super-resolution is
                 a fast-growing field with numerous practical
                 applications. In this exposition, we extensively
                 compare more than 30 state-of-the-art super-resolution
                 Convolutional Neural Networks (CNNs) over three
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Butijn:2020:BSM,
  author =       "Bert-Jan Butijn and Damian A. Tamburri and Willem-Jan
                 van den Heuvel",
  title =        "Blockchains: a Systematic Multivocal Literature
                 Review",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "61:1--61:37",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3369052",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3369052",
  abstract =     "Blockchain technology has gained tremendous popularity
                 both in practice and academia. The goal of this article
                 is to develop a coherent overview of the state of the
                 art in blockchain technology, using a systematic (i.e.,
                 protocol-based, replicable), multivocal (i.e.,
                 featuring both white and grey literature alike)
                 literature review to (1) define blockchain technology,
                 (2) elaborate on its architecture options and (3)
                 tradeoffs, as well as to understand (4) the current
                 applications and challenges, as evident from the state
                 of the art. We derive a systematic definition of
                 blockchain technology, based on a formal concept
                 analysis. Further, we flesh out an overview of
                 blockchain technology elaborated by means of
                 Grounded-Theory.",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Le:2020:DLS,
  author =       "Triet H. M. Le and Hao Chen and Muhammad Ali Babar",
  title =        "Deep Learning for Source Code Modeling and Generation:
                 Models, Applications, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "62:1--62:38",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3383458",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3383458",
  abstract =     "Deep Learning (DL) techniques for Natural Language
                 Processing have been evolving remarkably fast.
                 Recently, the DL advances in language modeling, machine
                 translation, and paragraph understanding are so
                 prominent that the potential of DL in Software
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2020:GFE,
  author =       "Yaqing Wang and Quanming Yao and James T. Kwok and
                 Lionel M. Ni",
  title =        "Generalizing from a Few Examples: a Survey on Few-shot
                 Learning",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "63:1--63:34",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3386252",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3386252",
  abstract =     "Machine learning has been highly successful in
                 data-intensive applications but is often hampered when
                 the data set is small. Recently, Few-shot Learning
                 (FSL) is proposed to tackle this problem. Using prior
                 knowledge, FSL can rapidly generalize to new \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zepf:2020:DER,
  author =       "Sebastian Zepf and Javier Hernandez and Alexander
                 Schmitt and Wolfgang Minker and Rosalind W. Picard",
  title =        "Driver Emotion Recognition for Intelligent Vehicles: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "64:1--64:30",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3388790",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3388790",
  abstract =     "Driving can occupy a large portion of daily life and
                 often can elicit negative emotional states like anger
                 or stress, which can significantly impact road safety
                 and long-term human health. In recent decades, the
                 arrival of new tools to help recognize \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Salaht:2020:OSP,
  author =       "Farah A{\"\i}t Salaht and Fr{\'e}d{\'e}ric Desprez and
                 Adrien Lebre",
  title =        "An Overview of Service Placement Problem in Fog and
                 Edge Computing",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "65:1--65:35",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3391196",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3391196",
  abstract =     "To support the large and various applications
                 generated by the Internet of Things (IoT), Fog
                 Computing was introduced to complement the Cloud
                 Computing and offer Cloud-like services at the edge of
                 the network with low latency and real-time responses.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Serban:2020:AEO,
  author =       "Alex Serban and Erik Poll and Joost Visser",
  title =        "Adversarial Examples on Object Recognition: a
                 Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "66:1--66:38",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3398394",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3398394",
  abstract =     "Deep neural networks are at the forefront of machine
                 learning research. However, despite achieving
                 impressive performance on complex tasks, they can be
                 very sensitive: Small perturbations of inputs can be
                 sufficient to induce incorrect behavior. Such
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2020:SES,
  author =       "Huashan Chen and Marcus Pendleton and Laurent Njilla
                 and Shouhuai Xu",
  title =        "A Survey on {Ethereum} Systems Security:
                 Vulnerabilities, Attacks, and Defenses",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "3",
  pages =        "67:1--67:43",
  month =        jul,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3391195",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jul 8 17:24:44 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3391195",
  abstract =     "Blockchain technology is believed by many to be a game
                 changer in many application domains. While the first
                 generation of blockchain technology (i.e., Blockchain
                 1.0) is almost exclusively used for cryptocurrency, the
                 second generation (i.e., Blockchain 2.0), as
                 represented by Ethereum, is an open and decentralized
                 platform enabling a new paradigm of computing
                 Decentralized Applications (DApps) running on top of
                 blockchains. The rich applications and semantics of
                 DApps inevitably introduce many security
                 vulnerabilities, which have no counterparts in pure
                 cryptocurrency systems like Bitcoin. Since Ethereum is
                 a new, yet complex, system, it is imperative to have a
                 systematic and comprehensive understanding on its
                 security from a holistic perspective, which was
                 previously unavailable in the literature. To the best
                 of our knowledge, the present survey, which can also be
                 used as a tutorial, fills this void. We systematize
                 three aspects of Ethereum systems security:
                 vulnerabilities, attacks, and defenses. We draw
                 insights into vulnerability root causes, attack
                 consequences, and defense capabilities, which shed
                 light on future research directions.",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Guo:2020:FFI,
  author =       "Bin Guo and Yasan Ding and Lina Yao and Yunji Liang
                 and Zhiwen Yu",
  title =        "The Future of False Information Detection on Social
                 Media: New Perspectives and Trends",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "68:1--68:36",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3393880",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3393880",
  abstract =     "The massive spread of false information on social
                 media has become a global risk, implicitly influencing
                 public opinion and threatening social/political
                 development. False information detection (FID) has thus
                 become a surging research topic in recent \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Emami:2020:MLM,
  author =       "Patrick Emami and Panos M. Pardalos and Lily
                 Elefteriadou and Sanjay Ranka",
  title =        "Machine Learning Methods for Data Association in
                 Multi-Object Tracking",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "69:1--69:34",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3394659",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3394659",
  abstract =     "Data association is a key step within the multi-object
                 tracking pipeline that is notoriously challenging due
                 to its combinatorial nature. A popular and general way
                 to formulate data association is as the NP-hard
                 multi-dimensional assignment problem. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wood:2020:HEM,
  author =       "Alexander Wood and Kayvan Najarian and Delaram
                 Kahrobaei",
  title =        "Homomorphic Encryption for Machine Learning in
                 Medicine and Bioinformatics",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "70:1--70:35",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3394658",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3394658",
  abstract =     "Machine learning and statistical techniques are
                 powerful tools for analyzing large amounts of medical
                 and genomic data. On the other hand, ethical concerns
                 and privacy regulations prevent free sharing of this
                 data. Encryption techniques such as fully \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ngamakeur:2020:SDF,
  author =       "Kan Ngamakeur and Sira Yongchareon and Jian Yu and
                 Saeed Ur Rehman",
  title =        "A Survey on Device-free Indoor Localization and
                 Tracking in the Multi-resident Environment",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "71:1--71:29",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3396302",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3396302",
  abstract =     "Indoor device-free localization and tracking can bring
                 both convenience and privacy to users compared with
                 traditional solutions such as camera-based surveillance
                 and RFID tag-based tracking. Technologies such as
                 Wi-Fi, wireless sensor, and infrared \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ali:2020:FPS,
  author =       "Isra Mohamed Ali and Maurantonio Caprolu and Roberto
                 {Di Pietro}",
  title =        "Foundations, Properties, and Security Applications of
                 Puzzles: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "72:1--72:38",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3396374",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3396374",
  abstract =     "Cryptographic algorithms have been used not only to
                 create robust ciphertexts but also to generate
                 cryptograms that, contrary to the classic goal of
                 cryptography, are meant to be broken. These
                 cryptograms, generally called puzzles, require the use
                 of a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fei:2020:PWN,
  author =       "Xincai Fei and Fangming Liu and Qixia Zhang and Hai
                 Jin and Hongxin Hu",
  title =        "Paving the Way for {NFV} Acceleration: a Taxonomy,
                 Survey and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "73:1--73:42",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3397022",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3397022",
  abstract =     "As a recent innovation, network functions
                 virtualization (NFV) --- with its core concept of
                 replacing hardware middleboxes with software network
                 functions (NFs) implemented in commodity servers ---
                 promises cost savings and flexibility benefits.
                 However, transitioning NFs from special-purpose
                 hardware to commodity servers has turned out to be more
                 challenging than expected, as it inevitably incurs
                 performance penalties due to bottlenecks in both
                 software and hardware. To achieve performance
                 comparable to hardware middleboxes, there is a strong
                 demand for a speedup in NF processing, which plays a
                 crucial role in the success of NFV. In this article, we
                 study the performance challenges that exist in
                 general-purpose servers and simultaneously summarize
                 the typical performance bottlenecks in NFV. Through
                 reviewing the progress in the field of NFV
                 acceleration, we present a new taxonomy of the
                 state-of-the-art efforts according to various
                 acceleration approaches. We discuss the surveyed works
                 and identify the respective advantages and
                 disadvantages in each category. We then discuss the
                 products, solutions, and projects emerged in industry.
                 We also present a gap analysis to improve current
                 solutions and highlight promising research trends that
                 can be explored in the future.",
  acknowledgement = ack-nhfb,
  articleno =    "73",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Feldmann:2020:SAS,
  author =       "Michael Feldmann and Christian Scheideler and Stefan
                 Schmid",
  title =        "Survey on Algorithms for Self-stabilizing Overlay
                 Networks",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "74:1--74:24",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3397190",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3397190",
  abstract =     "The maintenance of efficient and robust overlay
                 networks is one of the most fundamental and reoccurring
                 themes in networking. This article presents a survey of
                 state-of-the-art algorithms to design and repair
                 overlay networks in a distributed manner. In \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "74",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Guo:2020:SLC,
  author =       "Ruocheng Guo and Lu Cheng and Jundong Li and P.
                 Richard Hahn and Huan Liu",
  title =        "A Survey of Learning Causality with Data: Problems and
                 Methods",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "75:1--75:37",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3397269",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3397269",
  abstract =     "This work considers the question of how convenient
                 access to copious data impacts our ability to learn
                 causal effects and relations. In what ways is learning
                 causality in the era of big data different from-or the
                 same as-the traditional one? To answer \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "75",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kritikakou:2020:BTC,
  author =       "Angeliki Kritikakou and Rafail Psiakis and Francky
                 Catthoor and Olivier Sentieys",
  title =        "Binary Tree Classification of Rigid Error Detection
                 and Correction Techniques",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "76:1--76:38",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3397268",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3397268",
  abstract =     "Due to technology scaling and harsh environments, a
                 wide range of fault-tolerant techniques exists to deal
                 with the error occurrences. Selecting a fault-tolerant
                 technique is not trivial, whereas more than the
                 necessary overhead is usually inserted \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "76",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Calvo-Zaragoza:2020:UOM,
  author =       "Jorge Calvo-Zaragoza and Jan {Hajic Jr.} and Alexander
                 Pacha",
  title =        "Understanding Optical Music Recognition",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "77:1--77:35",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3397499",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3397499",
  abstract =     "For over 50 years, researchers have been trying to
                 teach computers to read music notation, referred to as
                 Optical Music Recognition (OMR). However, this field is
                 still difficult to access for new researchers,
                 especially those without a significant \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "77",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lucas:2020:CSR,
  author =       "Salvador Lucas",
  title =        "Context-sensitive Rewriting",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "78:1--78:36",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3397677",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3397677",
  abstract =     "The appropriate selection of the arguments of
                 functions that can be evaluated in function calls is
                 often useful to improve efficiency, speed, termination
                 behavior, and so on. This is essential, e.g., in the
                 conditional if --- then --- else operator. We can
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "78",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cerrolaza:2020:MCD,
  author =       "Jon Perez Cerrolaza and Roman Obermaisser and Jaume
                 Abella and Francisco J. Cazorla and Kim Gr{\"u}ttner
                 and Irune Agirre and Hamidreza Ahmadian and Imanol
                 Allende",
  title =        "Multi-core Devices for Safety-critical Systems: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "79:1--79:38",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3398665",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3398665",
  abstract =     "Multi-core devices are envisioned to support the
                 development of next-generation safety-critical systems,
                 enabling the on-chip integration of functions of
                 different criticality. This integration provides
                 multiple system-level potential benefits such as
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "79",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Boukerche:2020:COR,
  author =       "Azzedine Boukerche and Victor Soto",
  title =        "Computation Offloading and Retrieval for Vehicular
                 Edge Computing: Algorithms, Models, and
                 Classification",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "80:1--80:35",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3392064",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392064",
  abstract =     "The rapid evolution of mobile devices, their
                 applications, and the amount of data generated by them
                 causes a significant increase in bandwidth consumption
                 and congestions in the network core. Edge Computing
                 offers a solution to these performance \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Weisenburger:2020:SMP,
  author =       "Pascal Weisenburger and Johannes Wirth and Guido
                 Salvaneschi",
  title =        "A Survey of Multitier Programming",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "81:1--81:35",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3397495",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3397495",
  abstract =     "Multitier programming deals with developing the
                 components that pertain to different tiers in the
                 system (e.g., client and server), mixing them in the
                 same compilation unit. In this paradigm, the code for
                 different tiers is then either generated at run
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "81",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Qian:2020:ODL,
  author =       "Bin Qian and Jie Su and Zhenyu Wen and Devki Nandan
                 Jha and Yinhao Li and Yu Guan and Deepak Puthal and
                 Philip James and Renyu Yang and Albert Y. Zomaya and
                 Omer Rana and Lizhe Wang and Maciej Koutny and Rajiv
                 Ranjan",
  title =        "Orchestrating the Development Lifecycle of Machine
                 Learning-based {IoT} Applications: a Taxonomy and
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "82:1--82:47",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3398020",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3398020",
  abstract =     "Machine Learning (ML) and Internet of Things (IoT) are
                 complementary advances: ML techniques unlock the
                 potential of IoT with intelligence, and IoT
                 applications increasingly feed data collected by
                 sensors into ML models, thereby employing results to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "82",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2020:ABE,
  author =       "Yinghui Zhang and Robert H. Deng and Shengmin Xu and
                 Jianfei Sun and Qi Li and Dong Zheng",
  title =        "Attribute-based Encryption for Cloud Computing Access
                 Control: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "83:1--83:41",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3398036",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3398036",
  abstract =     "Attribute-based encryption (ABE) for cloud computing
                 access control is reviewed in this article. A taxonomy
                 and comprehensive assessment criteria of ABE are first
                 proposed. In the taxonomy, ABE schemes are assorted
                 into key-policy ABE (KP-ABE) schemes, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "83",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2020:DLM,
  author =       "Yanjiao Chen and Baolin Zheng and Zihan Zhang and Qian
                 Wang and Chao Shen and Qian Zhang",
  title =        "Deep Learning on Mobile and Embedded Devices:
                 State-of-the-art, Challenges, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "84:1--84:37",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3398209",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3398209",
  abstract =     "Recent years have witnessed an exponential increase in
                 the use of mobile and embedded devices. With the great
                 success of deep learning in many fields, there is an
                 emerging trend to deploy deep learning on mobile and
                 embedded devices to better meet the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "84",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Khan:2020:BSU,
  author =       "Saad Khan and Simon Parkinson and Liam Grant and Na
                 Liu and Stephen Mcguire",
  title =        "Biometric Systems Utilising Health Data from Wearable
                 Devices: Applications and Future Challenges in Computer
                 Security",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "85:1--85:29",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3400030",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3400030",
  abstract =     "Health data are being increasingly sensed from the
                 health-based wearable Internet of Things (IoT) devices,
                 providing much-needed fitness and health tracking.
                 However, data generated also present opportunities
                 within computer security, specifically with \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Harada:2020:PGA,
  author =       "Tomohiro Harada and Enrique Alba",
  title =        "Parallel Genetic Algorithms: a Useful Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "86:1--86:39",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3400031",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3400031",
  abstract =     "In this article, we encompass an analysis of the
                 recent advances in parallel genetic algorithms (PGAs).
                 We have selected these algorithms because of the deep
                 interest in many research fields for techniques that
                 can face complex applications where \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pekar:2020:ADB,
  author =       "Adrian Pekar and Jozef Mocnej and Winston K. G. Seah
                 and Iveta Zolotova",
  title =        "Application Domain-Based Overview of {IoT} Network
                 Traffic Characteristics",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "87:1--87:33",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3399669",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3399669",
  abstract =     "Over the past decade, the Internet of Things (IoT) has
                 advanced rapidly. New technologies have been proposed
                 and existing approaches optimised to meet user, society
                 and industry requirements. However, as the complexity
                 and heterogeneity of the traffic \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "87",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mahmud:2020:AMF,
  author =       "Redowan Mahmud and Kotagiri Ramamohanarao and Rajkumar
                 Buyya",
  title =        "Application Management in Fog Computing Environments:
                 a Taxonomy, Review and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "88:1--88:43",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3403955",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3403955",
  abstract =     "The Internet of Things (IoT) paradigm is being rapidly
                 adopted for the creation of smart environments in
                 various domains. The IoT-enabled cyber-physical systems
                 associated with smart city, healthcare, Industry 4.0
                 and Agtech handle a huge volume of data \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "88",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sharma:2020:BTC,
  author =       "Pratima Sharma and Rajni Jindal and Malaya Dutta
                 Borah",
  title =        "Blockchain Technology for Cloud Storage: a Systematic
                 Literature Review",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "89:1--89:32",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3403954",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3403954",
  abstract =     "The demand for Blockchain innovation and the
                 significance of its application has inspired
                 ever-progressing exploration in various scientific and
                 practical areas. Even though it is still in the initial
                 testing stage, the blockchain is being viewed as a
                 progressive solution to address present-day technology
                 concerns, such as decentralization, identity, trust,
                 character, ownership of data, and information-driven
                 choices. Simultaneously, the world is facing an
                 increase in the diversity and quantity of digital
                 information produced by machines and users. While
                 effectively looking for the ideal approach to storing
                 and processing cloud data, the blockchain innovation
                 provides significant inputs. This article reviews the
                 application of blockchain technology for securing cloud
                 storage.",
  acknowledgement = ack-nhfb,
  articleno =    "89",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2020:OHI,
  author =       "Gexiang Zhang and Zeyi Shang and Sergey Verlan and
                 Miguel {\'A}. Mart{\'\i}nez-del-Amor and Chengxun Yuan
                 and Luis Valencia-Cabrera and Mario J.
                 P{\'e}rez-Jim{\'e}nez",
  title =        "An Overview of Hardware Implementation of Membrane
                 Computing Models",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "90:1--90:38",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3402456",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3402456",
  abstract =     "The model of membrane computing, also known under the
                 name of P systems, is a bio-inspired large-scale
                 parallel computing paradigm having a good potential for
                 the design of massively parallel algorithms. For its
                 implementation it is very natural to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "90",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alvarez-Garcia:2020:SEE,
  author =       "Juan A. {\'A}lvarez-Garc{\'\i}a and Bozidara
                 Cvetkovi{\'c} and Mitja Lustrek",
  title =        "A Survey on Energy Expenditure Estimation Using
                 Wearable Devices",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "91:1--91:35",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3404482",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3404482",
  abstract =     "Human Energy Expenditure (EE) is a valuable tool for
                 measuring physical activity and its impact on our body
                 in an objective way. To accurately measure the EE,
                 there are methods such as doubly labeled water and
                 direct and indirect calorimetry, but their \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "91",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Aljeri:2020:MME,
  author =       "Noura Aljeri and Azzedine Boukerche",
  title =        "Mobility Management in {$5$G}-enabled Vehicular
                 Networks: Models, Protocols, and Classification",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "92:1--92:35",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3403953",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3403953",
  abstract =     "Over the past few years, the next generation of
                 vehicular networks is envisioned to play an essential
                 part in autonomous driving, traffic management, and
                 infotainment applications. The next generation of
                 intelligent vehicular networks enabled by 5G \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "92",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Khader:2020:DBA,
  author =       "Mariam Khader and Ghazi Al-Naymat",
  title =        "Density-based Algorithms for Big Data Clustering Using
                 {MapReduce} Framework: a Comprehensive Study",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "93:1--93:38",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3403951",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3403951",
  abstract =     "Clustering is used to extract hidden patterns and
                 similar groups from data. Therefore, clustering as a
                 method of unsupervised learning is a crucial technique
                 for big data analysis owing to the massive number of
                 unlabeled objects involved. Density-based \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "93",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{DeSousa:2020:VTS,
  author =       "Roniel S. {De Sousa} and Azzedine Boukerche and
                 Antonio A. F. Loureiro",
  title =        "Vehicle Trajectory Similarity: Models, Methods, and
                 Applications",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "94:1--94:32",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3406096",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406096",
  abstract =     "The increasing availability of vehicular trajectory
                 data is at the core of smart mobility solutions. Such
                 data offer us unprecedented information for the
                 development of trajectory data mining-based
                 applications. An essential task of trajectory analysis
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "94",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Canal:2020:PRF,
  author =       "Ramon Canal and Carles Hernandez and Rafa Tornero and
                 Alessandro Cilardo and Giuseppe Massari and Federico
                 Reghenzani and William Fornaciari and Marina Zapater
                 and David Atienza and Ariel Oleksiak and Wojciech
                 PiAtek and Jaume Abella",
  title =        "Predictive Reliability and Fault Management in
                 Exascale Systems: State of the Art and Perspectives",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "95:1--95:32",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3403956",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3403956",
  abstract =     "Performance and power constraints come together with
                 Complementary Metal Oxide Semiconductor technology
                 scaling in future Exascale systems. Technology scaling
                 makes each individual transistor more prone to faults
                 and, due to the exponential increase in \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "95",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mehic:2020:QKD,
  author =       "Miralem Mehic and Marcin Niemiec and Stefan Rass and
                 Jiajun Ma and Momtchil Peev and Alejandro Aguado and
                 Vicente Martin and Stefan Schauer and Andreas Poppe and
                 Christoph Pacher and Miroslav Voznak",
  title =        "Quantum Key Distribution: a Networking Perspective",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "96:1--96:41",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3402192",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3402192",
  abstract =     "The convergence of quantum cryptography with
                 applications used in everyday life is a topic drawing
                 attention from the industrial and academic worlds. The
                 development of quantum electronics has led to the
                 practical achievement of quantum devices that are
                 already available on the market and waiting for their
                 first application on a broader scale. A major aspect of
                 quantum cryptography is the methodology of Quantum Key
                 Distribution (QKD), which is used to generate and
                 distribute symmetric cryptographic keys between two
                 geographically separate users using the principles of
                 quantum physics. In previous years, several successful
                 QKD networks have been created to test the
                 implementation and interoperability of different
                 practical solutions. This article surveys previously
                 applied methods, showing techniques for deploying QKD
                 networks and current challenges of QKD networking.
                 Unlike studies focusing on optical channels and optical
                 equipment, this survey focuses on the network aspect by
                 considering network organization, routing and signaling
                 protocols, simulation techniques, and a
                 software-defined QKD networking approach.",
  acknowledgement = ack-nhfb,
  articleno =    "96",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Al-Odat:2020:SHA,
  author =       "Zeyad A. Al-Odat and Mazhar Ali and Assad Abbas and
                 Samee U. Khan",
  title =        "Secure Hash Algorithms and the Corresponding {FPGA}
                 Optimization Techniques",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "97:1--97:36",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3311724",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3311724",
  abstract =     "Cryptographic hash functions are widely used
                 primitives with a purpose to ensure the integrity of
                 data. Hash functions are also utilized in conjunction
                 with digital signatures to provide authentication and
                 non-repudiation services. The SHA has been developed
                 over time by the National Institute of Standards and
                 Technology for security, optimal performance, and
                 robustness. The best-known hash standards are SHA-1,
                 SHA-2, and SHA-3. Security is the most notable
                 criterion for evaluating the hash functions. However,
                 the hardware performance of an algorithm serves as a
                 tiebreaker among the contestants when all other
                 parameters (security, software performance, and
                 flexibility) have equal strength. Field Programmable
                 Gateway Array (FPGA) is a reconfigurable hardware that
                 supports a variety of design options, making it the
                 best choice for implementing the hash standards. In
                 this survey, particular attention is devoted to the
                 FPGA optimization techniques for the three hash
                 standards. The study covers several types of
                 optimization techniques and their contributions to the
                 performance of FPGAs. Moreover, the article highlights
                 the strengths and weaknesses of each of the
                 optimization methods and their influence on
                 performance. We are optimistic that the study will be a
                 useful resource encompassing the efforts carried out on
                 the SHAs and FPGA optimization techniques in a
                 consolidated form.",
  acknowledgement = ack-nhfb,
  articleno =    "97",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Uprety:2020:SQT,
  author =       "Sagar Uprety and Dimitris Gkoumas and Dawei Song",
  title =        "A Survey of Quantum Theory Inspired Approaches to
                 Information Retrieval",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "98:1--98:39",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3402179",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3402179",
  abstract =     "Since 2004, researchers have been using the
                 mathematical framework of quantum theory in information
                 retrieval (IR). Quantum theory offers a generalized
                 probability and logic framework. Such a framework has
                 been shown to be capable of unifying the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "98",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dabre:2020:SMN,
  author =       "Raj Dabre and Chenhui Chu and Anoop Kunchukuttan",
  title =        "A Survey of Multilingual Neural Machine Translation",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "99:1--99:38",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3406095",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406095",
  abstract =     "We present a survey on multilingual neural machine
                 translation (MNMT), which has gained a lot of traction
                 in recent years. MNMT has been useful in improving
                 translation quality as a result of translation
                 knowledge transfer (transfer learning). MNMT is
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "99",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lin:2020:TSP,
  author =       "Weiwei Lin and Fang Shi and Wentai Wu and Keqin Li and
                 Guangxin Wu and Al-Alas Mohammed",
  title =        "A Taxonomy and Survey of Power Models and Power
                 Modeling for Cloud Servers",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "100:1--100:41",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3406208",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406208",
  abstract =     "Due to the increasing demand of cloud resources, the
                 ever-increasing number and scale of cloud data centers
                 make their massive power consumption a prominent issue
                 today. Evidence reveals that the behaviors of cloud
                 servers make the major impact on data \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "100",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chatterjee:2020:CSS,
  author =       "Deya Chatterjee and Shrisha Rao",
  title =        "Computational Sustainability: a Socio-technical
                 Perspective",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "101:1--101:29",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3409797",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3409797",
  abstract =     "This is a consolidated look at computational
                 techniques for sustainability, and their limits and
                 possibilities. Sustainability is already well
                 established as a concern and a topic of study and
                 practice, given the alarming increase of environmental
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "101",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Younes:2020:TEA,
  author =       "Maram Bani Younes and Azzedine Boukerche",
  title =        "Traffic Efficiency Applications over Downtown Roads: a
                 New Challenge for Intelligent Connected Vehicles",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "102:1--102:30",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3403952",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3403952",
  abstract =     "Vehicular network technology is frequently used to
                 provide several services and applications for drivers
                 on road networks. The proposed applications in the
                 environment of road networks are classified into three
                 main categories based on their functions: \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "102",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cornejo-Lupa:2020:SOS,
  author =       "Mar{\'\i}a A. Cornejo-Lupa and Regina P.
                 Ticona-Herrera and Yudith Cardinale and Dennis
                 Barrios-Aranibar",
  title =        "A Survey of Ontologies for Simultaneous Localization
                 and Mapping in Mobile Robots",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "103:1--103:26",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3408316",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3408316",
  abstract =     "Autonomous robots are playing important roles in
                 academic, technological, and scientific activities.
                 Thus, their behavior is getting more complex,
                 particularly, in tasks related to mapping an
                 environment and localizing themselves. These tasks
                 comprise \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "103",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bu:2020:UMI,
  author =       "Kai Bu and Avery Laird and Yutian Yang and Linfeng
                 Cheng and Jiaqing Luo and Yingjiu Li and Kui Ren",
  title =        "Unveiling the Mystery of {Internet} Packet Forwarding:
                 a Survey of Network Path Validation",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "104:1--104:34",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3409796",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3409796",
  abstract =     "Validating the network paths taken by packets is
                 critical in constructing a secure Internet
                 architecture. Any feasible solution must both enforce
                 packet forwarding along end-host specified paths and
                 verify whether packets have taken those paths.
                 However,. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "104",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Navarro:2020:PS,
  author =       "Gonzalo Navarro and Javiel Rojas-Ledesma",
  title =        "Predecessor Search",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "105:1--105:35",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3409371",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3409371",
  abstract =     "The predecessor problem is a key component of the
                 fundamental sorting-and-searching core of algorithmic
                 problems. While binary search is the optimal solution
                 in the comparison model, more realistic machine models
                 on integer sets open the door to a rich \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "105",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Deldjoo:2020:RSL,
  author =       "Yashar Deldjoo and Markus Schedl and Paolo Cremonesi
                 and Gabriella Pasi",
  title =        "Recommender Systems Leveraging Multimedia Content",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "106:1--106:38",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3407190",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3407190",
  abstract =     "Recommender systems have become a popular and
                 effective means to manage the ever-increasing amount of
                 multimedia content available today and to help users
                 discover interesting new items. Today's recommender
                 systems suggest items of various media types,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "106",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2020:STE,
  author =       "Jingwen Wang and Xuyang Jing and Zheng Yan and Yulong
                 Fu and Witold Pedrycz and Laurence T. Yang",
  title =        "A Survey on Trust Evaluation Based on Machine
                 Learning",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "107:1--107:36",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3408292",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3408292",
  abstract =     "Trust evaluation is the process of quantifying trust
                 with attributes that influence trust. It faces a number
                 of severe issues such as lack of essential evaluation
                 data, demand of big data process, request of simple
                 trust relationship expression, and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "107",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2020:SBD,
  author =       "Hao Wang and Dit-Yan Yeung",
  title =        "A Survey on {Bayesian} Deep Learning",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "108:1--108:37",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3409383",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3409383",
  abstract =     "A comprehensive artificial intelligence system needs
                 to not only perceive the environment with different
                 ``senses'' (e.g., seeing and hearing) but also infer
                 the world's conditional (or even causal) relations and
                 corresponding uncertainty. The past decade \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "108",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhou:2020:SFN,
  author =       "Xinyi Zhou and Reza Zafarani",
  title =        "A Survey of Fake News: Fundamental Theories, Detection
                 Methods, and Opportunities",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "109:1--109:40",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3395046",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3395046",
  abstract =     "The explosive growth in fake news and its erosion to
                 democracy, justice, and public trust has increased the
                 demand for fake news detection and intervention. This
                 survey reviews and evaluates methods that can detect
                 fake news from four perspectives: the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "109",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Davoudian:2020:BDS,
  author =       "Ali Davoudian and Mengchi Liu",
  title =        "Big Data Systems: a Software Engineering Perspective",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "110:1--110:39",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3408314",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3408314",
  abstract =     "Big Data Systems (BDSs) are an emerging class of
                 scalable software technologies whereby massive amounts
                 of heterogeneous data are gathered from multiple
                 sources, managed, analyzed (in batch, stream or hybrid
                 fashion), and served to end-users and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "110",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yu:2020:CBF,
  author =       "Kui Yu and Xianjie Guo and Lin Liu and Jiuyong Li and
                 Hao Wang and Zhaolong Ling and Xindong Wu",
  title =        "Causality-based Feature Selection: Methods and
                 Evaluations",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "111:1--111:36",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3409382",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3409382",
  abstract =     "Feature selection is a crucial preprocessing step in
                 data analytics and machine learning. Classical feature
                 selection algorithms select features based on the
                 correlations between predictive features and the class
                 variable and do not attempt to capture \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "111",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alaca:2020:CAF,
  author =       "Furkan Alaca and Paul C. {Van Oorschot}",
  title =        "Comparative Analysis and Framework Evaluating {Web}
                 Single Sign-on Systems",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "112:1--112:34",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3409452",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3409452",
  abstract =     "We perform a comprehensive analysis and comparison of
                 14 web single sign-on (SSO) systems proposed and/or
                 deployed over the past decade, including federated
                 identity and credential/password management schemes. We
                 identify common design properties and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "112",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Denning:2021:WSA,
  author =       "Peter J. Denning",
  title =        "Working Set Analytics",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "113:1--113:36",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3399709",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3399709",
  abstract =     "The working set model for program behavior was
                 invented in 1965. It has stood the test of time in
                 virtual memory management for over 50 years. It is
                 considered the ideal for managing memory in operating
                 systems and caches. Its superior performance was
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "113",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zomaya:2021:MSS,
  author =       "Albert Y. Zomaya",
  title =        "In Memoriam {Sherif Sakr} (1979--2020)",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "113e:1--113e:1",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3436208",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3436208",
  acknowledgement = ack-nhfb,
  articleno =    "113e",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rathore:2021:SHB,
  author =       "Aditya Singh Rathore and Zhengxiong Li and Weijin Zhu
                 and Zhanpeng Jin and Wenyao Xu",
  title =        "A Survey on Heart Biometrics",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "114:1--114:38",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3410158",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3410158",
  abstract =     "In recent years, biometrics (e.g., fingerprint or face
                 recognition) has replaced traditional passwords and
                 PINs as a widely used method for user authentication,
                 particularly in personal or mobile devices. Differing
                 from state-of-the-art biometrics, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "114",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Matheu:2021:SCC,
  author =       "Sara N. Matheu and Jos{\'e} L. Hern{\'a}ndez-Ramos and
                 Antonio F. Skarmeta and Gianmarco Baldini",
  title =        "A Survey of Cybersecurity Certification for the
                 {Internet of Things}",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "115:1--115:36",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3410160",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3410160",
  abstract =     "In recent years, cybersecurity certification is
                 gaining momentum as the baseline to build a structured
                 approach to mitigate cybersecurity risks in the
                 Internet of Things (IoT). This initiative is driven by
                 industry, governmental institutions, and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "115",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Edu:2021:SHP,
  author =       "Jide S. Edu and Jose M. Such and Guillermo
                 Suarez-Tangil",
  title =        "Smart Home Personal Assistants: a Security and Privacy
                 Review",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "116:1--116:36",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3412383",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3412383",
  abstract =     "Smart Home Personal Assistants (SPA) are an emerging
                 innovation that is changing the means by which home
                 users interact with technology. However, several
                 elements expose these systems to various risks: (i) the
                 open nature of the voice channel they use, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "116",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{C:2021:EDA,
  author =       "Marimuthu C. and K. Chandrasekaran and Sridhar
                 Chimalakonda",
  title =        "Energy Diagnosis of {Android} Applications: a Thematic
                 Taxonomy and Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "117:1--117:36",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3417986",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3417986",
  abstract =     "The abnormal energy consumption of Android
                 applications is a significant problem faced by
                 developers and users. In recent years, researchers have
                 invested their efforts to develop energy diagnosis
                 tools that pinpoint and fix the energy bugs from source
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "117",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zave:2021:PIN,
  author =       "Pamela Zave and Jennifer Rexford",
  title =        "Patterns and Interactions in Network Security",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "118:1--118:37",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3417988",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3417988",
  abstract =     "Networks play a central role in cyber-security:
                 networks deliver security attacks, suffer from them,
                 defend against them, and sometimes even cause them.
                 This article is a concise tutorial on the large subject
                 of networks and security, written for all \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "118",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Santhosh:2021:ADR,
  author =       "K. K. Santhosh and D. P. Dogra and P. P. Roy",
  title =        "Anomaly Detection in Road Traffic Using Visual
                 Surveillance: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "119:1--119:26",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3417989",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3417989",
  abstract =     "Computer vision has evolved in the last decade as a
                 key technology for numerous applications replacing
                 human supervision. Timely detection of traffic
                 violations and abnormal behavior of pedestrians at
                 public places through computer vision and visual
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "119",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ellavarason:2021:TDB,
  author =       "Elakkiya Ellavarason and Richard Guest and Farzin
                 Deravi and Raul Sanchez-Riello and Barbara Corsetti",
  title =        "Touch-dynamics based Behavioural Biometrics on Mobile
                 Devices --- A Review from a Usability and Performance
                 Perspective",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "120:1--120:36",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3394713",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3394713",
  abstract =     "Over the past few years, there has been an exponential
                 increase in the percentage of people owning and using a
                 smart phone. These devices have sensor-rich
                 touchscreens that can capture sensitive biometric
                 features such as keystroke typing and finger-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "120",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zimmerling:2021:STL,
  author =       "Marco Zimmerling and Luca Mottola and Silvia Santini",
  title =        "Synchronous Transmissions in Low-Power Wireless: a
                 Survey of Communication Protocols and Network
                 Services",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "121:1--121:39",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3410159",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3410159",
  abstract =     "Low-power wireless communication is a central building
                 block of cyber-physical systems and the Internet of
                 Things. Conventional low-power wireless protocols make
                 avoiding packet collisions a cornerstone design choice.
                 The concept of synchronous \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "121",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Waheed:2021:SPI,
  author =       "Nazar Waheed and Xiangjian He and Muhammad Ikram and
                 Muhammad Usman and Saad Sajid Hashmi and Muhammad
                 Usman",
  title =        "Security and Privacy in {IoT} Using Machine Learning
                 and Blockchain: Threats and Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "122:1--122:37",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3417987",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3417987",
  abstract =     "Security and privacy of users have become significant
                 concerns due to the involvement of the Internet of
                 Things (IoT) devices in numerous applications. Cyber
                 threats are growing at an explosive pace making the
                 existing security and privacy measures inadequate.
                 Hence, everyone on the Internet is a product for
                 hackers. Consequently, Machine Learning (ML) algorithms
                 are used to produce accurate outputs from large complex
                 databases, where the generated outputs can be used to
                 predict and detect vulnerabilities in IoT-based
                 systems. Furthermore, Blockchain (BC) techniques are
                 becoming popular in modern IoT applications to solve
                 security and privacy issues. Several studies have been
                 conducted on either ML algorithms or BC techniques.
                 However, these studies target either security or
                 privacy issues using ML algorithms or BC techniques,
                 thus posing a need for a combined survey on efforts
                 made in recent years addressing both security and
                 privacy issues using ML algorithms and BC techniques.
                 In this article, we provide a summary of research
                 efforts made in the past few years, from 2008 to 2019,
                 addressing security and privacy issues using ML
                 algorithms and BC techniques in the IoT domain. First,
                 we discuss and categorize various security and privacy
                 threats reported in the past 12 years in the IoT
                 domain. We then classify the literature on security and
                 privacy efforts based on ML algorithms and BC
                 techniques in the IoT domain. Finally, we identify and
                 illuminate several challenges and future research
                 directions using ML algorithms and BC techniques to
                 address security and privacy issues in the IoT
                 domain.",
  acknowledgement = ack-nhfb,
  articleno =    "122",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{vanRozen:2021:LGP,
  author =       "Riemer van Rozen",
  title =        "Languages of Games and Play: a Systematic Mapping
                 Study",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "123:1--123:37",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3412843",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3412843",
  abstract =     "Digital games are a powerful means for creating
                 enticing, beautiful, educational, and often highly
                 addictive interactive experiences that impact the lives
                 of billions of players worldwide. We explore what
                 informs the design and construction of good \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "123",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Coscia:2021:NVD,
  author =       "Michele Coscia and Andres Gomez-Lievano and James
                 Mcnerney and Frank Neffke",
  title =        "The Node Vector Distance Problem in Complex Networks",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "124:1--124:27",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3416509",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3416509",
  abstract =     "We describe a problem in complex networks we call the
                 Node Vector Distance (NVD) problem, and we survey
                 algorithms currently able to address it. Complex
                 networks are a useful tool to map a non-trivial set of
                 relationships among connected entities, or \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "124",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pibiri:2021:TII,
  author =       "Giulio Ermanno Pibiri and Rossano Venturini",
  title =        "Techniques for Inverted Index Compression",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "125:1--125:36",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3415148",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3415148",
  abstract =     "The data structure at the core of large-scale search
                 engines is the inverted index, which is essentially a
                 collection of sorted integer sequences called inverted
                 lists. Because of the many documents indexed by such
                 engines and stringent performance \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "125",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Qiu:2021:SAM,
  author =       "Junyang Qiu and Jun Zhang and Wei Luo and Lei Pan and
                 Surya Nepal and Yang Xiang",
  title =        "A Survey of {Android} Malware Detection with Deep
                 Neural Models",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "126:1--126:36",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3417978",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3417978",
  abstract =     "Deep Learning (DL) is a disruptive technology that has
                 changed the landscape of cyber security research. Deep
                 learning models have many advantages over traditional
                 Machine Learning (ML) models, particularly when there
                 is a large amount of data \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "126",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Christophides:2021:OEE,
  author =       "Vassilis Christophides and Vasilis Efthymiou and
                 Themis Palpanas and George Papadakis and Kostas
                 Stefanidis",
  title =        "An Overview of End-to-End Entity Resolution for Big
                 Data",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "127:1--127:42",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3418896",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3418896",
  abstract =     "One of the most critical tasks for improving data
                 quality and increasing the reliability of data
                 analytics is Entity Resolution (ER), which aims to
                 identify different descriptions that refer to the same
                 real-world entity. Despite several decades of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "127",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Turan:2021:TFA,
  author =       "Furkan Turan and Ingrid Verbauwhede",
  title =        "Trust in {FPGA}-accelerated Cloud Computing",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "128:1--128:28",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3419100",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3419100",
  abstract =     "Platforms combining Central Processing Systems (CPUs)
                 with Field Programmable Gate Arrays (FPGAs) have become
                 popular, as they promise high performance with energy
                 efficiency. This is the result of the combination of
                 FPGA accelerators tuned to the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "128",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Skaik:2021:USM,
  author =       "Ruba Skaik and Diana Inkpen",
  title =        "Using Social Media for Mental Health Surveillance: a
                 Review",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "129:1--129:31",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3422824",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3422824",
  abstract =     "Data on social media contain a wealth of user
                 information. Big data research of social media data may
                 also support standard surveillance approaches and
                 provide decision-makers with usable information. These
                 data can be analyzed using Natural Language \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "129",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Preum:2021:RCA,
  author =       "Sarah Masud Preum and Sirajum Munir and Meiyi Ma and
                 Mohammad Samin Yasar and David J. Stone and Ronald
                 Williams and Homa Alemzadeh and John A. Stankovic",
  title =        "A Review of Cognitive Assistants for Healthcare:
                 Trends, Prospects, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "130:1--130:37",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3419368",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3419368",
  abstract =     "Healthcare cognitive assistants (HCAs) are intelligent
                 systems or agents that interact with users in a
                 context-aware and adaptive manner to improve their
                 health outcomes by augmenting their cognitive abilities
                 or complementing a cognitive impairment. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "130",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bansal:2021:SIB,
  author =       "Maggi Bansal and Inderveer Chana and Siobh{\'a}n
                 Clarke",
  title =        "A Survey on {IoT} Big Data: Current Status, 13 {V}'s
                 Challenges, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "131:1--131:59",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3419634",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3419634",
  abstract =     "Driven by the core technologies, i.e., sensor-based
                 autonomous data acquisition and the cloud-based big
                 data analysis, IoT automates the actuation of
                 data-driven intelligent actions on the connected
                 objects. This automation enables numerous useful real-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "131",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tolmeijer:2021:IME,
  author =       "Suzanne Tolmeijer and Markus Kneer and Cristina
                 Sarasua and Markus Christen and Abraham Bernstein",
  title =        "Implementations in Machine Ethics: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "132:1--132:38",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3419633",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3419633",
  abstract =     "Increasingly complex and autonomous systems require
                 machine ethics to maximize the benefits and minimize
                 the risks to society arising from the new technology.
                 It is challenging to decide which type of ethical
                 theory to employ and how to implement it \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "132",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhu:2021:SCC,
  author =       "Liehuang Zhu and Md M. Karim and Kashif Sharif and
                 Chang Xu and Fan Li and Xiaojiang Du and Mohsen
                 Guizani",
  title =        "{SDN} Controllers: a Comprehensive Analysis and
                 Performance Evaluation Study",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "133:1--133:40",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3421764",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3421764",
  abstract =     "Software-defined networks offer flexible and
                 intelligent network operations by splitting a
                 traditional network into a centralized control plane
                 and a programmable data plane. The controller in the
                 control plane is the fundamental element used to manage
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "133",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Boukerche:2021:DAP,
  author =       "Azzedine Boukerche and Peng Sun",
  title =        "Design of Algorithms and Protocols for Underwater
                 Acoustic Wireless Sensor Networks",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "134:1--134:34",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3421763",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3421763",
  abstract =     "Nowadays, with the recent advances of wireless
                 underwater communication and acoustic sensor devices
                 technology, we are witnessing a surge in the
                 exploration and exploitation of the ocean's abundant
                 natural resources. Accordingly, to fulfill the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "134",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mladenovic:2021:CAC,
  author =       "Miljana Mladenovi{\'c} and Vera Osmjanski and Stasa
                 Vujici{\'c} Stankovi{\'c}",
  title =        "Cyber-aggression, Cyberbullying, and Cyber-grooming: a
                 Survey and Research Challenges",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "1:1--1:42",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3424246",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3424246",
  abstract =     "Cyber-aggression, cyberbullying, and cyber-grooming
                 are distinctive and similar phenomena that represent
                 the objectionable content appearing on online social
                 media. Timely detection of the objectionable content is
                 very important for its prevention and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Vyas:2021:RBC,
  author =       "Avani Vyas and Sujata Pal and Barun Kumar Saha",
  title =        "Relay-based Communications in {WBANs}: a Comprehensive
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "2:1--2:34",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3423164",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3423164",
  abstract =     "Wireless Body Area Networks (WBANs) constitute an
                 emerging technology in the field of health care that
                 makes health monitoring possible from one's home
                 itself. WBANs open many challenges by placing sensors
                 on/inside human bodies for collecting various
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Varela-Vaca:2021:SCL,
  author =       "{\'A}ngel Jes{\'u}s Varela-Vaca and Antonia M. Reina
                 Quintero",
  title =        "Smart Contract Languages: a Multivocal Mapping Study",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "3:1--3:38",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3423166",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3423166",
  abstract =     "Blockchain is a disruptive technology that has
                 attracted the attention of the scientific community and
                 companies, as proven by the exponential growth of
                 publications on this topic in recent years. This
                 growing interest is mainly due to the promise that
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jiang:2021:LPP,
  author =       "Hongbo Jiang and Jie Li and Ping Zhao and Fanzi Zeng
                 and Zhu Xiao and Arun Iyengar",
  title =        "Location Privacy-preserving Mechanisms in
                 Location-based Services: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "4:1--4:36",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3423165",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3423165",
  abstract =     "Location-based services (LBSs) provide enhanced
                 functionality and convenience of ubiquitous computing,
                 but they open up new vulnerabilities that can be
                 utilized to violate the users' privacy. The leakage of
                 private location data in the LBS context has \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wright:2021:CFR,
  author =       "Christopher Wright and William A. Moeglein and Saurabh
                 Bagchi and Milind Kulkarni and Abraham A. Clements",
  title =        "Challenges in Firmware Re-Hosting, Emulation, and
                 Analysis",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "5:1--5:36",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3423167",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3423167",
  abstract =     "System emulation and firmware re-hosting have become
                 popular techniques to answer various security and
                 performance related questions, such as determining
                 whether a firmware contain security vulnerabilities or
                 meet timing requirements when run on a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gu:2021:SBC,
  author =       "Renjie Gu and Chaoyue Niu and Fan Wu and Guihai Chen
                 and Chun Hu and Chengfei Lyu and Zhihua Wu",
  title =        "From Server-Based to Client-Based Machine Learning: a
                 Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "6:1--6:36",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3424660",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3424660",
  abstract =     "In recent years, mobile devices have gained increasing
                 development with stronger computation capability and
                 larger storage space. Some of the computation-intensive
                 machine learning tasks can now be run on mobile
                 devices. To exploit the resources \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mirsky:2021:CDD,
  author =       "Yisroel Mirsky and Wenke Lee",
  title =        "The Creation and Detection of Deepfakes: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "7:1--7:41",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3425780",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3425780",
  abstract =     "Generative deep learning algorithms have progressed to
                 a point where it is difficult to tell the difference
                 between what is real and what is fake. In 2018, it was
                 discovered how easy it is to use this technology for
                 unethical and malicious applications, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Boyar:2021:RWO,
  author =       "Joan Boyar and Lene M. Favrholdt and Kim S. Larsen",
  title =        "Relative Worst-order Analysis: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "8:1--8:21",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3425910",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3425910",
  abstract =     "The standard measure for the quality of online
                 algorithms is the competitive ratio. This measure is
                 generally applicable, and for some problems it works
                 well, but for others it fails to distinguish between
                 algorithms that have very different \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ravi:2021:LBK,
  author =       "Prasanna Ravi and James Howe and Anupam Chattopadhyay
                 and Shivam Bhasin",
  title =        "Lattice-based Key-sharing Schemes: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "9:1--9:39",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3422178",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3422178",
  abstract =     "Public-key cryptography is an indispensable component
                 used in almost all of our present-day digital
                 infrastructure. However, most if not all of it is
                 predominantly built upon hardness guarantees of number
                 theoretic problems that can be broken by large-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mirza:2021:PDL,
  author =       "Behroz Mirza and Tahir Q. Syed and Behraj Khan and
                 Yameen Malik",
  title =        "Potential Deep Learning Solutions to Persistent and
                 Emerging Big Data Challenges --- a Practitioners'
                 Cookbook",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "10:1--10:39",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3427476",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427476",
  abstract =     "The phenomenon of Big Data continues to present moving
                 targets for the scientific and technological
                 state-of-the-art. This work demonstrates that the
                 solution space of these challenges has expanded with
                 deep learning now moving beyond traditional \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bernal:2021:SBC,
  author =       "Sergio L{\'o}pez Bernal and Alberto Huertas
                 Celdr{\'a}n and Gregorio Mart{\'\i}nez P{\'e}rez and
                 Michael Taynnan Barros and Sasitharan Balasubramaniam",
  title =        "Security in Brain-Computer Interfaces:
                 State-of-the-Art, Opportunities, and Future
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "11:1--11:35",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3427376",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427376",
  abstract =     "Brain-Computer Interfaces (BCIs) have significantly
                 improved the patients' quality of life by restoring
                 damaged hearing, sight, and movement capabilities.
                 After evolving their application scenarios, the current
                 trend of BCI is to enable new innovative \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang-Kennedy:2021:SRM,
  author =       "Leah Zhang-Kennedy and Sonia Chiasson",
  title =        "A Systematic Review of Multimedia Tools for
                 Cybersecurity Awareness and Education",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "12:1--12:39",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3427920",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427920",
  abstract =     "We conduct a comprehensive review covering academic
                 publications and industry products relating to tools
                 for cybersecurity awareness and education aimed at
                 non-expert end-users developed in the past 20 years.
                 Through our search criteria, we identified \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jiang:2021:NOS,
  author =       "Shengming Jiang",
  title =        "Networking in Oceans: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "13:1--13:33",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3428147",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428147",
  abstract =     "The ocean is a huge saltwater body that is different
                 from terrestrial environments in terms of deployment
                 circumstance, weather conditions, and user
                 distributions. Therefore, it is difficult to apply
                 terrestrial networking technologies directly in
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xu:2021:KGI,
  author =       "Weitao Xu and Junqing Zhang and Shunqi Huang and
                 Chengwen Luo and Wei Li",
  title =        "Key Generation for {Internet of Things}: a
                 Contemporary Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "14:1--14:37",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3429740",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3429740",
  abstract =     "Key generation is a promising technique to bootstrap
                 secure communications for the Internet of Things
                 devices that have no prior knowledge between each
                 other. In the past few years, a variety of key
                 generation protocols and systems have been proposed.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bellavista:2021:DLF,
  author =       "Paolo Bellavista and Luca Foschini and Alessio Mora",
  title =        "Decentralised Learning in Federated Deployment
                 Environments: a System-Level Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "15:1--15:38",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3429252",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3429252",
  abstract =     "Decentralised learning is attracting more and more
                 interest because it embodies the principles of data
                 minimisation and focused data collection, while
                 favouring the transparency of purpose specification
                 (i.e., the objective for which a model is built).
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sandhie:2021:IMV,
  author =       "Zarin Tasnim Sandhie and Jill Arvindbhai Patel and
                 Farid Uddin Ahmed and Masud H. Chowdhury",
  title =        "Investigation of Multiple-valued Logic Technologies
                 for Beyond-binary Era",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "16:1--16:30",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3431230",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3431230",
  abstract =     "Computing technologies are currently based on the
                 binary logic/number system, which is dependent on the
                 simple on and off switching mechanism of the prevailing
                 transistors. With the exponential increase of data
                 processing and storage needs, there is a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chikhi:2021:DSR,
  author =       "Rayan Chikhi and Jan Holub and Paul Medvedev",
  title =        "Data Structures to Represent a Set of $k$-long {DNA}
                 Sequences",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "17:1--17:22",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3445967",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3445967",
  abstract =     "The analysis of biological sequencing data has been
                 one of the biggest applications of string algorithms.
                 The approaches used in many such applications are based
                 on the analysis of k -mers, which are short
                 fixed-length strings present in a dataset. While
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hernandez:2021:PTD,
  author =       "V{\'\i}ctor Adri{\'a}n Sosa Hern{\'a}ndez and Ra{\'u}l
                 Monroy and Miguel Angel Medina-P{\'e}rez and Octavio
                 Loyola-Gonz{\'a}lez and Francisco Herrera",
  title =        "A Practical Tutorial for Decision Tree Induction:
                 Evaluation Measures for Candidate Splits and
                 Opportunities",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "18:1--18:38",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3429739",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3429739",
  abstract =     "Experts from different domains have resorted to
                 machine learning techniques to produce explainable
                 models that support decision-making. Among existing
                 techniques, decision trees have been useful in many
                 application domains for classification. Decision
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mariani:2021:CAV,
  author =       "Stefano Mariani and Giacomo Cabri and Franco
                 Zambonelli",
  title =        "Coordination of Autonomous Vehicles: Taxonomy and
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "19:1--19:33",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3431231",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3431231",
  abstract =     "In the near future, our streets will be populated by
                 myriads of autonomous self-driving vehicles to serve
                 our diverse mobility needs. This will raise the need to
                 coordinate their movements in order to properly handle
                 both access to shared resources \ldots{}.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nasar:2021:NER,
  author =       "Zara Nasar and Syed Waqar Jaffry and Muhammad Kamran
                 Malik",
  title =        "Named Entity Recognition and Relation Extraction:
                 State-of-the-Art",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "20:1--20:39",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3445965",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3445965",
  abstract =     "With the advent of Web 2.0, there exist many online
                 platforms that result in massive textual-data
                 production. With ever-increasing textual data at hand,
                 it is of immense importance to extract information
                 nuggets from this data. One approach towards \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Aliwa:2021:CCV,
  author =       "Emad Aliwa and Omer Rana and Charith Perera and Peter
                 Burnap",
  title =        "Cyberattacks and Countermeasures for In-Vehicle
                 Networks",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "21:1--21:37",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3431233",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3431233",
  abstract =     "As connectivity between and within vehicles increases,
                 so does concern about safety and security. Various
                 automotive serial protocols are used inside vehicles
                 such as Controller Area Network (CAN), Local
                 Interconnect Network (LIN), and FlexRay. CAN Bus
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Song:2021:SNI,
  author =       "Bosheng Song and Kenli Li and David
                 Orellana-Mart{\'\i}n and Mario J. P{\'e}rez-Jim{\'e}nez
                 and Ignacio P{\'e}Rez-Hurtado",
  title =        "A Survey of Nature-Inspired Computing: Membrane
                 Computing",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "22:1--22:31",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3431234",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3431234",
  abstract =     "Nature-inspired computing is a type of human-designed
                 computing motivated by nature, which is based on the
                 employ of paradigms, mechanisms, and principles
                 underlying natural systems. In this article, a
                 versatile and vigorous bio-inspired branch of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Minaeva:2021:SPS,
  author =       "Anna Minaeva and Zdenek Hanz{\'a}lek",
  title =        "Survey on Periodic Scheduling for Time-triggered Hard
                 Real-time Systems",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "23:1--23:32",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3431232",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3431232",
  abstract =     "This survey covers the basic principles and related
                 works addressing the time-triggered scheduling of
                 periodic tasks with deadlines. The wide range of
                 applications and the increasing complexity of modern
                 real-time systems result in the continually \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Distler:2021:BFT,
  author =       "Tobias Distler",
  title =        "{Byzantine} Fault-tolerant State-machine Replication
                 from a Systems Perspective",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "24:1--24:38",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3436728",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3436728",
  abstract =     "Byzantine fault-tolerant (BFT) state-machine
                 replication makes it possible to design systems that
                 are resilient against arbitrary faults, a requirement
                 considered crucial for an increasing number of use
                 cases such as permissioned blockchains, firewalls,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Qasem:2021:AVD,
  author =       "Abdullah Qasem and Paria Shirani and Mourad Debbabi
                 and Lingyu Wang and Bernard Lebel and Basile L. Agba",
  title =        "Automatic Vulnerability Detection in Embedded Devices
                 and Firmware: Survey and Layered Taxonomies",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "25:1--25:42",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3432893",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3432893",
  abstract =     "In the era of the internet of things (IoT),
                 software-enabled inter-connected devices are of
                 paramount importance. The embedded systems are very
                 frequently used in both security and privacy-sensitive
                 applications. However, the underlying software (a.k.a.
                 \ldots{}).",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Navarro:2021:IHRa,
  author =       "Gonzalo Navarro",
  title =        "Indexing Highly Repetitive String Collections, {Part
                 II}: Compressed Indexes",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "26:1--26:32",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3432999",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3432999",
  abstract =     "Two decades ago, a breakthrough in indexing string
                 collections made it possible to represent them within
                 their compressed space while at the same time offering
                 indexed search functionalities. As this new technology
                 permeated through applications like bioinformatics, the
                 string collections experienced a growth that
                 outperforms Moore's Law and challenges our ability of
                 handling them even in compressed form. It turns out,
                 fortunately, that many of these rapidly growing string
                 collections are highly repetitive, so that their
                 information content is orders of magnitude lower than
                 their plain size. The statistical compression methods
                 used for classical collections, however, are blind to
                 this repetitiveness, and therefore a new set of
                 techniques has been developed to properly exploit it.
                 The resulting indexes form a new generation of data
                 structures able to handle the huge repetitive string
                 collections that we are facing. In this survey, formed
                 by two parts, we cover the algorithmic developments
                 that have led to these data structures.\par

                 In this second part, we describe the fundamental
                 algorithmic ideas and data structures that form the
                 base of all the existing indexes, and the various
                 concrete structures that have been proposed, comparing
                 them both in theoretical and practical aspects, and
                 uncovering some new combinations. We conclude with the
                 current challenges in this fascinating field.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhou:2021:SIC,
  author =       "Fan Zhou and Xovee Xu and Goce Trajcevski and Kunpeng
                 Zhang",
  title =        "A Survey of Information Cascade Analysis: Models,
                 Predictions, and Recent Advances",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "27:1--27:36",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3433000",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3433000",
  abstract =     "The deluge of digital information in our daily
                 life-from user-generated content, such as microblogs
                 and scientific papers, to online business, such as
                 viral marketing and advertising-offers unprecedented
                 opportunities to explore and exploit the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ribeiro:2021:SSC,
  author =       "Pedro Ribeiro and Pedro Paredes and Miguel E. P. Silva
                 and David Aparicio and Fernando Silva",
  title =        "A Survey on Subgraph Counting: Concepts, Algorithms,
                 and Applications to Network Motifs and Graphlets",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "28:1--28:36",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3433652",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3433652",
  abstract =     "Computing subgraph frequencies is a fundamental task
                 that lies at the core of several network analysis
                 methodologies, such as network motifs and
                 graphlet-based metrics, which have been widely used to
                 categorize and compare networks from multiple
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Navarro:2021:IHRb,
  author =       "Gonzalo Navarro",
  title =        "Indexing Highly Repetitive String Collections, Part I:
                 Repetitiveness Measures",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "29:1--29:31",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3434399",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3434399",
  abstract =     "Two decades ago, a breakthrough in indexing string
                 collections made it possible to represent them within
                 their compressed space while at the same time offering
                 indexed search functionalities. As this new technology
                 permeated through applications like bioinformatics, the
                 string collections experienced a growth that
                 outperforms Moore's Law and challenges our ability to
                 handle them even in compressed form. It turns out,
                 fortunately, that many of these rapidly growing string
                 collections are highly repetitive, so that their
                 information content is orders of magnitude lower than
                 their plain size. The statistical compression methods
                 used for classical collections, however, are blind to
                 this repetitiveness, and therefore a new set of
                 techniques has been developed to properly exploit it.
                 The resulting indexes form a new generation of data
                 structures able to handle the huge repetitive string
                 collections that we are facing. In this survey, formed
                 by two parts, we cover the algorithmic developments
                 that have led to these data structures.

                 In this first part, we describe the distinct
                 compression paradigms that have been used to exploit
                 repetitiveness, and the algorithmic techniques that
                 provide direct access to the compressed strings. In the
                 quest for an ideal measure of repetitiveness, we
                 uncover a fascinating web of relations between those
                 measures, as well as the limits up to which the data
                 can be recovered, and up to which direct access to the
                 compressed data can be provided. This is the basic
                 aspect of indexability, which is covered in the second
                 part of this survey.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Boukerche:2021:ODU,
  author =       "Azzedine Boukerche and Zhijun Hou",
  title =        "Object Detection Using Deep Learning Methods in
                 Traffic Scenarios",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "30:1--30:35",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3434398",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3434398",
  abstract =     "The recent boom of autonomous driving nowadays has
                 made object detection in traffic scenes a hot topic of
                 research. Designed to classify and locate instances in
                 the image, this is a basic but challenging task in the
                 computer vision field. With its \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2021:WML,
  author =       "Bo Liu and Ming Ding and Sina Shaham and Wenny Rahayu
                 and Farhad Farokhi and Zihuai Lin",
  title =        "When Machine Learning Meets Privacy: a Survey and
                 Outlook",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "31:1--31:36",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3436755",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3436755",
  abstract =     "The newly emerged machine learning (e.g., deep
                 learning) methods have become a strong driving force to
                 revolutionize a wide range of industries, such as smart
                 healthcare, financial technology, and surveillance
                 systems. Meanwhile, privacy has emerged as \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2021:DAE,
  author =       "Chenning Li and Zhichao Cao and Yunhao Liu",
  title =        "Deep {AI} Enabled Ubiquitous Wireless Sensing: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "32:1--32:35",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3436729",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3436729",
  abstract =     "With the development of the Internet of Things (IoT),
                 many kinds of wireless signals (e.g., Wi-Fi, LoRa,
                 RFID) are filling our living and working spaces
                 nowadays. Beyond communication, wireless signals can
                 sense the status of surrounding objects, known
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Harley:2021:IIW,
  author =       "Kelsey Harley and Rodney Cooper",
  title =        "Information Integrity: Are We There Yet?",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "33:1--33:35",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3436817",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3436817",
  abstract =     "The understanding and promotion of integrity in
                 information security has traditionally been
                 underemphasized or even ignored. From implantable
                 medical devices and electronic voting to vehicle
                 control, the critical importance of information
                 integrity to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Talbi:2021:ADD,
  author =       "El-Ghazali Talbi",
  title =        "Automated Design of Deep Neural Networks: a Survey and
                 Unified Taxonomy",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "34:1--34:37",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3439730",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3439730",
  abstract =     "In recent years, research in applying optimization
                 approaches in the automatic design of deep neural
                 networks has become increasingly popular. Although
                 various approaches have been proposed, there is a lack
                 of a comprehensive survey and taxonomy on this
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Deldjoo:2021:SAR,
  author =       "Yashar Deldjoo and Tommaso {Di Noia} and Felice
                 Antonio Merra",
  title =        "A Survey on Adversarial Recommender Systems: From
                 Attack\slash Defense Strategies to Generative
                 Adversarial Networks",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "35:1--35:38",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3439729",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3439729",
  abstract =     "Latent-factor models (LFM) based on collaborative
                 filtering (CF), such as matrix factorization (MF) and
                 deep CF methods, are widely used in modern recommender
                 systems (RS) due to their excellent performance and
                 recommendation accuracy. However, success \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bouhenni:2021:SDG,
  author =       "Sarra Bouhenni and Sa{\"\i}d Yahiaoui and Nadia
                 Nouali-Taboudjemat and Hamamache Kheddouci",
  title =        "A Survey on Distributed Graph Pattern Matching in
                 Massive Graphs",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "36:1--36:35",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3439724",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3439724",
  abstract =     "Besides its NP-completeness, the strict constraints of
                 subgraph isomorphism are making it impractical for
                 graph pattern matching (GPM) in the context of big
                 data. As a result, relaxed GPM models have emerged as
                 they yield interesting results in a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2021:GAN,
  author =       "Zhengwei Wang and Qi She and Tom{\'a}s E. Ward",
  title =        "Generative Adversarial Networks in Computer Vision: a
                 Survey and Taxonomy",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "37:1--37:38",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3439723",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3439723",
  abstract =     "Generative adversarial networks (GANs) have been
                 extensively studied in the past few years. Arguably
                 their most significant impact has been in the area of
                 computer vision where great advances have been made in
                 challenges such as plausible image \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pang:2021:DLA,
  author =       "Guansong Pang and Chunhua Shen and Longbing Cao and
                 Anton {Van Den Hengel}",
  title =        "Deep Learning for Anomaly Detection: a Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "38:1--38:38",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3439950",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3439950",
  abstract =     "Anomaly detection, a.k.a. outlier detection or novelty
                 detection, has been a lasting yet active research area
                 in various research communities for several decades.
                 There are still some unique problem complexities and
                 challenges that require advanced \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2021:STD,
  author =       "Sheng Wang and Zhifeng Bao and J. Shane Culpepper and
                 Gao Cong",
  title =        "A Survey on Trajectory Data Management, Analytics, and
                 Learning",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "39:1--39:36",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3440207",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3440207",
  abstract =     "Recent advances in sensor and mobile devices have
                 enabled an unprecedented increase in the availability
                 and collection of urban trajectory data, thus
                 increasing the demand for more efficient ways to manage
                 and analyze the data being produced. In this \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Meurisch:2021:DPA,
  author =       "Christian Meurisch and Max M{\"u}hlh{\"a}user",
  title =        "Data Protection in {AI} Services: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "40:1--40:38",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3440754",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3440754",
  abstract =     "Advances in artificial intelligence (AI) have shaped
                 today's user services, enabling enhanced
                 personalization and better support. As such AI-based
                 services inevitably require user data, the resulting
                 privacy implications are de facto the unacceptable
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chandrasekaran:2021:ESS,
  author =       "Dhivya Chandrasekaran and Vijay Mago",
  title =        "Evolution of Semantic Similarity --- a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "41:1--41:37",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3440755",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3440755",
  abstract =     "Estimating the semantic similarity between text data
                 is one of the challenging and open research problems in
                 the field of Natural Language Processing (NLP). The
                 versatility of natural language makes it difficult to
                 define rule-based methods for \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2021:TRW,
  author =       "Xiaoxue Chen and Lianwen Jin and Yuanzhi Zhu and
                 Canjie Luo and Tianwei Wang",
  title =        "Text Recognition in the Wild: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "42:1--42:35",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3440756",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3440756",
  abstract =     "The history of text can be traced back over thousands
                 of years. Rich and precise semantic information carried
                 by text is important in a wide range of vision-based
                 application scenarios. Therefore, text recognition in
                 natural scenes has been an active research topic in
                 computer vision and pattern recognition. In recent
                 years, with the rise and development of deep learning,
                 numerous methods have shown promising results in terms
                 of innovation, practicality, and efficiency. This
                 article aims to (1) summarize the fundamental problems
                 and the state-of-the-art associated with scene text
                 recognition, (2) introduce new insights and ideas, (3)
                 provide a comprehensive review of publicly available
                 resources, and (4) point out directions for future
                 work. In summary, this literature review attempts to
                 present an entire picture of the field of scene text
                 recognition. It provides a comprehensive reference for
                 people entering this field and could be helpful in
                 inspiring future research. Related resources are
                 available at our GitHub repository:
                 https://github.com/HCIILAB/Scene-Text-Recognition.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Al-Thanyyan:2021:ATS,
  author =       "Suha S. Al-Thanyyan and Aqil M. Azmi",
  title =        "Automated Text Simplification: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "43:1--43:36",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3442695",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3442695",
  abstract =     "Text simplification (TS) reduces the complexity of the
                 text to improve its readability and understandability,
                 while possibly retaining its original information
                 content. Over time, TS has become an essential tool in
                 helping those with low literacy levels,. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Huang:2021:SSA,
  author =       "Huawei Huang and Wei Kong and Sicong Zhou and Zibin
                 Zheng and Song Guo",
  title =        "A Survey of State-of-the-Art on Blockchains: Theories,
                 Modelings, and Tools",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "44:1--44:42",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3441692",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3441692",
  abstract =     "To draw a roadmap of current research activities of
                 the blockchain community, we first conduct a brief
                 overview of state-of-the-art blockchain surveys
                 published in the past 5 years. We found that those
                 surveys are basically studying the blockchain-based
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Maruf:2021:SDL,
  author =       "Sameen Maruf and Fahimeh Saleh and Gholamreza
                 Haffari",
  title =        "A Survey on Document-level Neural Machine Translation:
                 Methods and Evaluation",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "45:1--45:36",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3441691",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3441691",
  abstract =     "Machine translation (MT) is an important task in
                 natural language processing (NLP), as it automates the
                 translation process and reduces the reliance on human
                 translators. With the resurgence of neural networks,
                 the translation quality surpasses that of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Magalhaes:2021:MMD,
  author =       "Arlino Magalhaes and Jose Maria Monteiro and Angelo
                 Brayner",
  title =        "Main Memory Database Recovery: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "2",
  pages =        "46:1--46:36",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3442197",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3442197",
  abstract =     "Many of today's applications need massive real-time
                 data processing. In-memory database systems have become
                 a good alternative for these requirements. These
                 systems maintain the primary copy of the database in
                 the main memory to achieve high throughput \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hassanin:2021:VAF,
  author =       "Mohammed Hassanin and Salman Khan and Murat Tahtali",
  title =        "Visual Affordance and Function Understanding: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "47:1--47:35",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3446370",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3446370",
  abstract =     "Nowadays, robots are dominating the manufacturing,
                 entertainment, and healthcare industries. Robot vision
                 aims to equip robots with the capabilities to discover
                 information, understand it, and interact with the
                 environment, which require an agent to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Magnani:2021:CDM,
  author =       "Matteo Magnani and Obaida Hanteer and Roberto
                 Interdonato and Luca Rossi and Andrea Tagarelli",
  title =        "Community Detection in Multiplex Networks",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "48:1--48:35",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3444688",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444688",
  abstract =     "A multiplex network models different modes of
                 interaction among same-type entities. In this article,
                 we provide a taxonomy of community detection algorithms
                 in multiplex networks. We characterize the different
                 algorithms based on various properties and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Celes:2021:MTA,
  author =       "Clayson Celes and Azzedine Boukerche and Antonio A. F.
                 Loureiro",
  title =        "Mobility Trace Analysis for Intelligent Vehicular
                 Networks: Methods, Models, and Applications",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "49:1--49:38",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3446679",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3446679",
  abstract =     "Intelligent vehicular networks emerge as a promising
                 technology to provide efficient data communication in
                 transportation systems and smart cities. At the same
                 time, the popularization of devices with attached
                 sensors has allowed the obtaining of a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sabir:2021:MLD,
  author =       "Bushra Sabir and Faheem Ullah and M. Ali Babar and Raj
                 Gaire",
  title =        "Machine Learning for Detecting Data Exfiltration: a
                 Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "50:1--50:47",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3442181",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3442181",
  abstract =     "Context: Research at the intersection of
                 cybersecurity, Machine Learning (ML), and Software
                 Engineering (SE) has recently taken significant steps
                 in proposing countermeasures for detecting
                 sophisticated data exfiltration attacks. It is
                 important to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{UlHaq:2021:SBC,
  author =       "Irfan {Ul Haq} and Juan Caballero",
  title =        "A Survey of Binary Code Similarity",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "51:1--51:38",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3446371",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3446371",
  abstract =     "Binary code similarity approaches compare two or more
                 pieces of binary code to identify their similarities
                 and differences. The ability to compare binary code
                 enables many real-world applications on scenarios where
                 source code may not be available such \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mitra:2021:CIA,
  author =       "Shyamali Mitra and Nibaran Das and Soumyajyoti Dey and
                 Sukanta Chakraborty and Mita Nasipuri and Mrinal Kanti
                 Naskar",
  title =        "Cytology Image Analysis Techniques Toward Automation:
                 Systematically Revisited",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "52:1--52:41",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447238",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447238",
  abstract =     "Cytology is a branch of pathology that deals with the
                 microscopic examination of cells for diagnosis of
                 carcinoma or inflammatory conditions. In the present
                 work, the term cytology is used to indicate solid organ
                 cytology. Automation in cytology started \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bluemke:2021:STE,
  author =       "Ilona Bluemke and Agnieszka Malanowska",
  title =        "Software Testing Effort Estimation and Related
                 Problems: a Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "53:1--53:38",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3442694",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3442694",
  abstract =     "Although testing effort estimation is a very important
                 task in software project management, it is rarely
                 described in the literature. There are many
                 difficulties in finding any useful methods or tools for
                 this purpose. Solutions to many other problems
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xiong:2021:STE,
  author =       "Wenjie Xiong and Jakub Szefer",
  title =        "Survey of Transient Execution Attacks and Their
                 Mitigations",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "54:1--54:36",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3442479",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3442479",
  abstract =     "Transient execution attacks, also known as speculative
                 execution attacks, have drawn much interest in the last
                 few years as they can cause critical data leakage.
                 Since the first disclosure of Spectre and Meltdown
                 attacks in January 2018, a number of new \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhao:2021:NLP,
  author =       "Liping Zhao and Waad Alhoshan and Alessio Ferrari and
                 Keletso J. Letsholo and Muideen A. Ajagbe and
                 Erol-Valeriu Chioasca and Riza T. Batista-Navarro",
  title =        "Natural Language Processing for Requirements
                 Engineering: a Systematic Mapping Study",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "55:1--55:41",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3444689",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444689",
  abstract =     "Natural Language Processing for Requirements
                 Engineering (NLP4RE) is an area of research and
                 development that seeks to apply natural language
                 processing (NLP) techniques, tools, and resources to
                 the requirements engineering (RE) process, to support
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Blazquez-Garcia:2021:ROA,
  author =       "Ane Bl{\'a}zquez-Garc{\'\i}a and Angel Conde and Usue
                 Mori and Jose A. Lozano",
  title =        "A Review on Outlier\slash Anomaly Detection in Time
                 Series Data",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "56:1--56:33",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3444690",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444690",
  abstract =     "Recent advances in technology have brought major
                 breakthroughs in data collection, enabling a large
                 amount of data to be gathered over time and thus
                 generating time series. Mining this data has become an
                 important task for researchers and practitioners
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hamdani:2021:CSC,
  author =       "Syed Wasif Abbas Hamdani and Haider Abbas and Abdul
                 Rehman Janjua and Waleed Bin Shahid and Muhammad Faisal
                 Amjad and Jahanzaib Malik and Malik Hamza Murtaza and
                 Mohammed Atiquzzaman and Abdul Waheed Khan",
  title =        "Cybersecurity Standards in the Context of Operating
                 System: Practical Aspects, Analysis, and Comparisons",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "57:1--57:36",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3442480",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3442480",
  abstract =     "Cyber threats have been growing tremendously in recent
                 years. There are significant advancements in the threat
                 space that have led towards an essential need for the
                 strengthening of digital infrastructure security.
                 Better security can be achieved by \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2021:BED,
  author =       "Xi Li and Zehua Wang and Victor C. M. Leung and Hong
                 Ji and Yiming Liu and Heli Zhang",
  title =        "Blockchain-empowered Data-driven Networks: a Survey
                 and Outlook",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "58:1--58:38",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3446373",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3446373",
  abstract =     "The paths leading to future networks are pointing
                 towards a data-driven paradigm to better cater to the
                 explosive growth of mobile services as well as the
                 increasing heterogeneity of mobile devices, many of
                 which generate and consume large volumes and variety of
                 data. These paths are also hampered by significant
                 challenges in terms of security, privacy, services
                 provisioning, and network management. Blockchain, which
                 is a technology for building distributed ledgers that
                 provide an immutable log of transactions recorded in a
                 distributed network, has become prominent recently as
                 the underlying technology of cryptocurrencies and is
                 revolutionizing data storage and processing in computer
                 network systems. For future data-driven networks
                 (DDNs), blockchain is considered as a promising
                 solution to enable the secure storage, sharing, and
                 analytics of data, privacy protection for users,
                 robust, trustworthy network control, and decentralized
                 routing and resource managements. However, many
                 important challenges and open issues remain to be
                 addressed before blockchain can be deployed widely to
                 enable future DDNs. In this article, we present a
                 survey on the existing research works on the
                 application of blockchain technologies in computer
                 networks and identify challenges and potential
                 solutions in the applications of blockchains in future
                 DDNs. We identify application scenarios in which future
                 blockchain-empowered DDNs could improve the efficiency
                 and security, and generally the effectiveness of
                 network services.",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Spelda:2021:HIM,
  author =       "Petr Spelda and Vit Stritecky",
  title =        "Human Induction in Machine Learning: a Survey of the
                 Nexus",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "59:1--59:18",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3444691",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444691",
  abstract =     "As our epistemic ambitions grow, the common and
                 scientific endeavours are becoming increasingly
                 dependent on Machine Learning (ML). The field rests on
                 a single experimental paradigm, which consists of
                 splitting the available data into a training and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Huang:2021:ABT,
  author =       "Jun Huang and Debiao He and Mohammad S. Obaidat and
                 Pandi Vijayakumar and Min Luo and Kim-Kwang Raymond
                 Choo",
  title =        "The Application of the Blockchain Technology in Voting
                 Systems: a Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "60:1--60:28",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3439725",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3439725",
  abstract =     "Voting is a formal expression of opinion or choice,
                 either positive or negative, made by an individual or a
                 group of individuals. However, conventional voting
                 systems tend to be centralized, which are known to
                 suffer from security and efficiency limitations. Hence,
                 there has been a trend of moving to decentralized
                 voting systems, such as those based on blockchain. The
                 latter is a decentralized digital ledger in a
                 peer-to-peer network, where a copy of the append-only
                 ledger of digitally signed and encrypted transactions
                 is maintained by each participant. Therefore, in this
                 article, we perform a comprehensive review of
                 blockchain-based voting systems and classify them based
                 on a number of features (e.g., the types of blockchain
                 used, the consensus approaches used, and the scale of
                 participants). By systematically analyzing and
                 comparing the different blockchain-based voting
                 systems, we also identify a number of limitations and
                 research opportunities. Hopefully, this survey will
                 provide an in-depth insight into the potential utility
                 of blockchain in voting systems and device future
                 research agenda.",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nour:2021:ACM,
  author =       "Boubakr Nour and Hakima Khelifi and Rasheed Hussain
                 and Spyridon Mastorakis and Hassine Moungla",
  title =        "Access Control Mechanisms in Named Data Networks: a
                 Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "61:1--61:35",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3442150",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3442150",
  abstract =     "Information-Centric Networking (ICN) has recently
                 emerged as a prominent candidate for the Future
                 Internet Architecture (FIA) that addresses existing
                 issues with the host-centric communication model of the
                 current TCP/IP-based Internet. Named Data \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Minaee:2021:DLB,
  author =       "Shervin Minaee and Nal Kalchbrenner and Erik Cambria
                 and Narjes Nikzad and Meysam Chenaghlu and Jianfeng
                 Gao",
  title =        "Deep Learning--based Text Classification: a
                 Comprehensive Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "62:1--62:40",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3439726",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3439726",
  abstract =     "Deep learning--based models have surpassed classical
                 machine learning--based approaches in various text
                 classification tasks, including sentiment analysis,
                 news categorization, question answering, and natural
                 language inference. In this article, we \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Saxena:2021:GAN,
  author =       "Divya Saxena and Jiannong Cao",
  title =        "Generative Adversarial Networks {(GANs)}: Challenges,
                 Solutions, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "63:1--63:42",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3446374",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3446374",
  abstract =     "Generative Adversarial Networks (GANs) is a novel
                 class of deep generative models that has recently
                 gained significant attention. GANs learn complex and
                 high-dimensional distributions implicitly over images,
                 audio, and data. However, there exist major \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gharibshah:2021:URP,
  author =       "Zhabiz Gharibshah and Xingquan Zhu",
  title =        "User Response Prediction in Online Advertising",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "64:1--64:43",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3446662",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3446662",
  abstract =     "Online advertising, as a vast market, has gained
                 significant attention in various platforms ranging from
                 search engines, third-party websites, social media, and
                 mobile apps. The prosperity of online campaigns is a
                 challenge in online marketing and is \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Astolfi:2021:SPR,
  author =       "Gilberto Astolfi and F{\'a}bio Prestes Cesar Rezende
                 and Jo{\~a}o Vitor {De Andrade} Porto and Edson Takashi
                 Matsubara and Hemerson Pistori",
  title =        "Syntactic Pattern Recognition in Computer Vision: a
                 Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "65:1--65:35",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447241",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447241",
  abstract =     "Using techniques derived from the syntactic methods
                 for visual pattern recognition is not new and was much
                 explored in the area called syntactical or structural
                 pattern recognition. Syntactic methods have been useful
                 because they are intuitively simple \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Varghese:2021:SEP,
  author =       "Blesson Varghese and Nan Wang and David Bermbach and
                 Cheol-Ho Hong and Eyal {De Lara} and Weisong Shi and
                 Christopher Stewart",
  title =        "A Survey on Edge Performance Benchmarking",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "66:1--66:33",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3444692",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444692",
  abstract =     "Edge computing is the next Internet frontier that will
                 leverage computing resources located near users,
                 sensors, and data stores to provide more responsive
                 services. Therefore, it is envisioned that a
                 large-scale, geographically dispersed, and resource-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Avola:2021:UMI,
  author =       "Danilo Avola and Luigi Cinque and Alessio Fagioli and
                 Gianluca Foresti and Alessio Mecca",
  title =        "Ultrasound Medical Imaging Techniques: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "67:1--67:38",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447243",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447243",
  abstract =     "Ultrasound (US) imaging for medical purposes has been
                 increasing in popularity over the years. The US
                 technology has some valuable strengths, such as it is
                 harmless, very cheap, and can provide real-time
                 feedback. At the same time, it has also some \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Muhammad:2021:FLS,
  author =       "Khan Muhammad and Mohammad S. Obaidat and Tanveer
                 Hussain and Javier {Del Ser} and Neeraj Kumar and
                 Mohammad Tanveer and Faiyaz Doctor",
  title =        "Fuzzy Logic in Surveillance Big Video Data Analysis:
                 Comprehensive Review, Challenges, and Research
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "68:1--68:33",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3444693",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444693",
  abstract =     "CCTV cameras installed for continuous surveillance
                 generate enormous amounts of data daily, forging the
                 term Big Video Data (BVD). The active practice of BVD
                 includes intelligent surveillance and activity
                 recognition, among other challenging tasks. To
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alharbi:2021:SMI,
  author =       "Ahmed Alharbi and Hai Dong and Xun Yi and Zahir Tari
                 and Ibrahim Khalil",
  title =        "Social Media Identity Deception Detection: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "69:1--69:35",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3446372",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3446372",
  abstract =     "Social media have been growing rapidly and become
                 essential elements of many people's lives. Meanwhile,
                 social media have also come to be a popular source for
                 identity deception. Many social media identity
                 deception cases have arisen over the past few
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gewers:2021:PCA,
  author =       "Felipe L. Gewers and Gustavo R. Ferreira and Henrique
                 F. {De Arruda} and Filipi N. Silva and Cesar H. Comin
                 and Diego R. Amancio and Luciano {Da F.Costa}",
  title =        "Principal Component Analysis: a Natural Approach to
                 Data Exploration",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "70:1--70:34",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447755",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447755",
  abstract =     "Principal component analysis (PCA) is often applied
                 for analyzing data in the most diverse areas. This work
                 reports, in an accessible and integrated manner,
                 several theoretical and practical aspects of PCA. The
                 basic principles underlying PCA, data \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hogan:2021:KG,
  author =       "Aidan Hogan and Eva Blomqvist and Michael Cochez and
                 Claudia D'amato and Gerard {De Melo} and Claudio
                 Gutierrez and Sabrina Kirrane and Jos{\'e} Emilio
                 {Labra Gayo} and Roberto Navigli and Sebastian Neumaier
                 and Axel-Cyrille {Ngonga Ngomo} and Axel Polleres and
                 Sabbir M. Rashid and Anisa Rula and Lukas Schmelzeisen
                 and Juan Sequeda and Steffen Staab and Antoine
                 Zimmermann",
  title =        "Knowledge Graphs",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "71:1--71:37",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447772",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447772",
  abstract =     "In this article, we provide a comprehensive
                 introduction to knowledge graphs, which have recently
                 garnered significant attention from both industry and
                 academia in scenarios that require exploiting diverse,
                 dynamic, large-scale collections of data. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cheng:2021:FMC,
  author =       "Wen-Huang Cheng and Sijie Song and Chieh-Yun Chen and
                 Shintami Chusnul Hidayati and Jiaying Liu",
  title =        "Fashion Meets Computer Vision: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "72:1--72:41",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447239",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447239",
  abstract =     "Fashion is the way we present ourselves to the world
                 and has become one of the world's largest industries.
                 Fashion, mainly conveyed by vision, has thus attracted
                 much attention from computer vision researchers in
                 recent years. Given the rapid \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dunne:2021:SAI,
  author =       "Rob Dunne and Tim Morris and Simon Harper",
  title =        "A Survey of Ambient Intelligence",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "73:1--73:27",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447242",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447242",
  abstract =     "Ambient Intelligence (AmI) is the application and
                 embedding of artificial intelligence into everyday
                 environments to seamlessly provide assistive and
                 predictive support in a multitude of scenarios via an
                 invisible user interface. These can be as diverse
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "73",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kabir:2021:UAD,
  author =       "H. M. Dipu Kabir and Abbas Khosravi and Subrota K.
                 Mondal and Mustaneer Rahman and Saeid Nahavandi and
                 Rajkumar Buyya",
  title =        "Uncertainty-aware Decisions in Cloud Computing:
                 Foundations and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "74:1--74:30",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447583",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447583",
  abstract =     "The rapid growth of the cloud industry has increased
                 challenges in the proper governance of the cloud
                 infrastructure. Many intelligent systems have been
                 developing, considering uncertainties in the cloud.
                 Intelligent approaches with the consideration of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "74",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2021:ICS,
  author =       "Fei Chen and Duming Luo and Tao Xiang and Ping Chen
                 and Junfeng Fan and Hong-Linh Truong",
  title =        "{IoT} Cloud Security Review: a Case Study Approach
                 Using Emerging Consumer-oriented Applications",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "75:1--75:36",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447625",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447625",
  abstract =     "Recent years have seen the rapid development and
                 integration of the Internet of Things (IoT) and cloud
                 computing. The market is providing various
                 consumer-oriented smart IoT devices; the mainstream
                 cloud service providers are building their software
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "75",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ren:2021:CSN,
  author =       "Pengzhen Ren and Yun Xiao and Xiaojun Chang and Po-yao
                 Huang and Zhihui Li and Xiaojiang Chen and Xin Wang",
  title =        "A Comprehensive Survey of Neural Architecture Search:
                 Challenges and Solutions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "76:1--76:34",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447582",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447582",
  abstract =     "Deep learning has made substantial breakthroughs in
                 many fields due to its powerful automatic
                 representation capabilities. It has been proven that
                 neural architecture design is crucial to the feature
                 representation of data and the final performance.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "76",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2021:DLS,
  author =       "Kaixuan Chen and Dalin Zhang and Lina Yao and Bin Guo
                 and Zhiwen Yu and Yunhao Liu",
  title =        "Deep Learning for Sensor-based Human Activity
                 Recognition: Overview, Challenges, and Opportunities",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "77:1--77:40",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447744",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447744",
  abstract =     "The vast proliferation of sensor devices and Internet
                 of Things enables the applications of sensor-based
                 activity recognition. However, there exist substantial
                 challenges that could influence the performance of the
                 recognition system in practical \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "77",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Russo:2021:PSS,
  author =       "Daniel Russo and Klaas-Jan Stol",
  title =        "{PLS-SEM} for Software Engineering Research: an
                 Introduction and Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "78:1--78:38",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447580",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447580",
  abstract =     "Software Engineering (SE) researchers are increasingly
                 paying attention to organizational and human factors.
                 Rather than focusing only on variables that can be
                 directly measured, such as lines of code, SE research
                 studies now also consider unobservable \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "78",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Salam:2021:PRL,
  author =       "Abdus Salam and Rolf Schwitter and Mehmet A. Orgun",
  title =        "Probabilistic Rule Learning Systems: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "79:1--79:16",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447581",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447581",
  abstract =     "This survey provides an overview of rule learning
                 systems that can learn the structure of probabilistic
                 rules for uncertain domains. These systems are very
                 useful in such domains because they can be trained with
                 a small amount of positive and negative \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "79",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{AlmarazLuengo:2021:RSR,
  author =       "Elena {Almaraz Luengo} and Luis Javier Garc{\'\i}a
                 Villalba",
  title =        "Recommendations on Statistical Randomness Test
                 Batteries for Cryptographic Purposes",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "80:1--80:34",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447773",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447773",
  abstract =     "Security in different applications is closely related
                 to the goodness of the sequences generated for such
                 purposes. Not only in Cryptography but also in other
                 areas, it is necessary to obtain long sequences of
                 random numbers or that, at least, behave as such. To
                 decide whether the generator used produces sequences
                 that are random, unpredictable and independent,
                 statistical checks are needed. Different batteries of
                 hypothesis tests have been proposed for this
                 purpose.\par

                 In this work, a survey of the main test batteries is
                 presented, indicating their pros and cons, giving some
                 guidelines for their use and presenting some practical
                 examples.",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Seaborn:2021:VHA,
  author =       "Katie Seaborn and Norihisa P. Miyake and Peter
                 Pennefather and Mihoko Otake-Matsuura",
  title =        "Voice in Human-Agent Interaction: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "81:1--81:43",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3386867",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3386867",
  abstract =     "Social robots, conversational agents, voice
                 assistants, and other embodied AI are increasingly a
                 feature of everyday life. What connects these various
                 types of intelligent agents is their ability to
                 interact with people through voice. Voice is becoming
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "81",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Michel:2021:PDP,
  author =       "Oliver Michel and Roberto Bifulco and G{\'a}bor
                 R{\'e}tv{\'a}ri and Stefan Schmid",
  title =        "The Programmable Data Plane: Abstractions,
                 Architectures, Algorithms, and Applications",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "82:1--82:36",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447868",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447868",
  abstract =     "Programmable data plane technologies enable the
                 systematic reconfiguration of the low-level processing
                 steps applied to network packets and are key drivers
                 toward realizing the next generation of network
                 services and applications. This survey presents
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "82",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hu:2021:HIF,
  author =       "Wei Hu and Armaiti Ardeshiricham and Ryan Kastner",
  title =        "Hardware Information Flow Tracking",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "83:1--83:39",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447867",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447867",
  abstract =     "Information flow tracking (IFT) is a fundamental
                 computer security technique used to understand how
                 information moves through a computing system. Hardware
                 IFT techniques specifically target security
                 vulnerabilities related to the design, verification,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "83",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Boukerche:2021:VBA,
  author =       "Azzedine Boukerche and Xiren Ma",
  title =        "Vision-based Autonomous Vehicle Recognition: a New
                 Challenge for Deep Learning-based Systems",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "84:1--84:37",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447866",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447866",
  abstract =     "Vision-based Automated Vehicle Recognition (VAVR) has
                 attracted considerable attention recently. Particularly
                 given the reliance on emerging deep learning methods,
                 which have powerful feature extraction and pattern
                 learning abilities, vehicle \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "84",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Afsar:2021:API,
  author =       "Bekir Afsar and Kaisa Miettinen and Francisco Ruiz",
  title =        "Assessing the Performance of Interactive
                 Multiobjective Optimization Methods: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "85:1--85:27",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3448301",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3448301",
  abstract =     "Interactive methods are useful decision-making tools
                 for multiobjective optimization problems, because they
                 allow a decision-maker to provide her/his preference
                 information iteratively in a comfortable way at the
                 same time as (s)he learns about all \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tripathi:2021:ALD,
  author =       "Nikhil Tripathi and Neminath Hubballi",
  title =        "Application Layer Denial-of-Service Attacks and
                 Defense Mechanisms: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "86:1--86:33",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3448291",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3448291",
  abstract =     "Application layer Denial-of-Service (DoS) attacks are
                 generated by exploiting vulnerabilities of the protocol
                 implementation or its design. Unlike volumetric DoS
                 attacks, these are stealthy in nature and target a
                 specific application running on the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tang:2021:DRM,
  author =       "Yunbo Tang and Dan Chen and Xiaoli Li",
  title =        "Dimensionality Reduction Methods for Brain Imaging
                 Data Analysis",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "87:1--87:36",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3448302",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3448302",
  abstract =     "The past century has witnessed the grand success of
                 brain imaging technologies, such as
                 electroencephalography and magnetic resonance imaging,
                 in probing cognitive states and pathological brain
                 dynamics for neuroscience research and neurology
                 practices. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "87",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ridolfi:2021:SCC,
  author =       "Matteo Ridolfi and Abdil Kaya and Rafael Berkvens and
                 Maarten Weyn and Wout Joseph and Eli {De Poorter}",
  title =        "Self-calibration and Collaborative Localization for
                 {UWB} Positioning Systems: a Survey and Future Research
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "88:1--88:27",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3448303",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3448303",
  abstract =     "Ultra-Wideband (UWB) is a Radio Frequency technology
                 that is currently used for accurate indoor
                 localization. However, the cost of deploying such a
                 system is large, mainly due to the need for manually
                 measuring the exact location of the installed
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "88",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Laranjeiro:2021:SRS,
  author =       "Nuno Laranjeiro and Jo{\~a}o Agnelo and Jorge
                 Bernardino",
  title =        "A Systematic Review on Software Robustness
                 Assessment",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "89:1--89:65",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3448977",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3448977",
  abstract =     "Robustness is the degree to which a certain system or
                 component can operate correctly in the presence of
                 invalid inputs or stressful environmental conditions.
                 With the increasing complexity and widespread use of
                 computer systems, obtaining assurances \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "89",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2021:SSL,
  author =       "Boyuan Chen and Zhen Ming (Jack) Jiang",
  title =        "A Survey of Software Log Instrumentation",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "90:1--90:34",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3448976",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3448976",
  abstract =     "Log messages have been used widely in many software
                 systems for a variety of purposes during software
                 development and field operation. There are two phases
                 in software logging: log instrumentation and log
                 management. Log instrumentation refers to the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "90",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lalapura:2021:RNN,
  author =       "Varsha S. Lalapura and J. Amudha and Hariramn
                 Selvamuruga Satheesh",
  title =        "Recurrent Neural Networks for Edge Intelligence: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "91:1--91:38",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3448974",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3448974",
  abstract =     "Recurrent Neural Networks are ubiquitous and pervasive
                 in many artificial intelligence applications such as
                 speech recognition, predictive healthcare, creative
                 art, and so on. Although they provide accurate superior
                 solutions, they pose a massive \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "91",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bertolino:2021:SFB,
  author =       "Antonia Bertolino and Pietro Braione and Guglielmo {De
                 Angelis} and Luca Gazzola and Fitsum Kifetew and
                 Leonardo Mariani and Matteo Orr{\`u} and Mauro
                 Pezz{\`e} and Roberto Pietrantuono and Stefano Russo
                 and Paolo Tonella",
  title =        "A Survey of Field-based Testing Techniques",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "92:1--92:39",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447240",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447240",
  abstract =     "Field testing refers to testing techniques that
                 operate in the field to reveal those faults that escape
                 in-house testing. Field testing techniques are becoming
                 increasingly popular with the growing complexity of
                 contemporary software systems. In this \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "92",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bruel:2021:RFS,
  author =       "Jean-Michel Bruel and Sophie Ebersold and Florian
                 Galinier and Manuel Mazzara and Alexandr Naumchev and
                 Bertrand Meyer",
  title =        "The Role of Formalism in System Requirements",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "93:1--93:36",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3448975",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3448975",
  abstract =     "A major determinant of the quality of software systems
                 is the quality of their requirements, which should be
                 both understandable and precise. Most requirements are
                 written in natural language, which is good for
                 understandability but lacks precision. To \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "93",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhao:2021:EPB,
  author =       "Liang Zhao",
  title =        "Event Prediction in the {Big Data} Era: a Systematic
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "94:1--94:37",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3450287",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3450287",
  abstract =     "Events are occurrences in specific locations, time,
                 and semantics that nontrivially impact either our
                 society or the nature, such as earthquakes, civil
                 unrest, system failures, pandemics, and crimes. It is
                 highly desirable to be able to anticipate the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "94",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lo:2021:SLR,
  author =       "Sin Kit Lo and Qinghua Lu and Chen Wang and Hye-Young
                 Paik and Liming Zhu",
  title =        "A Systematic Literature Review on Federated Machine
                 Learning: From a Software Engineering Perspective",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "95:1--95:39",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3450288",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3450288",
  abstract =     "Federated learning is an emerging machine learning
                 paradigm where clients train models locally and
                 formulate a global model based on the local model
                 updates. To identify the state-of-the-art in federated
                 learning and explore how to develop federated
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "95",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alashaikh:2021:SUP,
  author =       "Abdulaziz Alashaikh and Eisa Alanazi and Ala
                 Al-Fuqaha",
  title =        "A Survey on the Use of Preferences for Virtual Machine
                 Placement in Cloud Data Centers",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "96:1--96:39",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3450517",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3450517",
  abstract =     "With the rapid development of virtualization
                 techniques, cloud data centers allow for
                 cost-effective, flexible, and customizable deployments
                 of applications on virtualized infrastructure. Virtual
                 machine (VM) placement aims to assign each virtual
                 machine to a server in the cloud environment. VM
                 Placement is of paramount importance to the design of
                 cloud data centers. Typically, VM placement involves
                 complex relations and multiple design factors as well
                 as local policies that govern the assignment decisions.
                 It also involves different constituents including cloud
                 administrators and customers that might have disparate
                 preferences while opting for a placement solution.
                 Thus, it is often valuable to return not only an
                 optimized solution to the VM placement problem but also
                 a solution that reflects the given preferences of the
                 constituents. In this article, we provide a detailed
                 review on the role of preferences in the recent
                 literature on VM placement. We examine different
                 preference representations found in the literature,
                 explain their existing usage, and explain the adopted
                 solving approaches. We further discuss key challenges
                 and identify possible research opportunities to better
                 incorporate preferences within the context of VM
                 placement.",
  acknowledgement = ack-nhfb,
  articleno =    "96",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Huang:2021:CAD,
  author =       "Xing Huang and Tsung-Yi Ho and Wenzhong Guo and Bing
                 Li and Krishnendu Chakrabarty and Ulf Schlichtmann",
  title =        "Computer-aided Design Techniques for Flow-based
                 Microfluidic Lab-on-a-chip Systems",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "97:1--97:29",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3450504",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3450504",
  abstract =     "As one of the most promising lab-on-a-chip systems,
                 flow-based microfluidic biochips are being increasingly
                 used for automatically executing various laboratory
                 procedures in biology and biochemistry, such as
                 enzyme-linked immunosorbent assay, point-of-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "97",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dunfield:2021:BT,
  author =       "Jana Dunfield and Neel Krishnaswami",
  title =        "Bidirectional Typing",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "98:1--98:38",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3450952",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3450952",
  abstract =     "Bidirectional typing combines two modes of typing:
                 type checking, which checks that a program satisfies a
                 known type, and type synthesis, which determines a type
                 from the program. Using checking enables bidirectional
                 typing to support features for which \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "98",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Abukmeil:2021:SUG,
  author =       "Mohanad Abukmeil and Stefano Ferrari and Angelo
                 Genovese and Vincenzo Piuri and Fabio Scotti",
  title =        "A Survey of Unsupervised Generative Models for
                 Exploratory Data Analysis and Representation Learning",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "99:1--99:40",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3450963",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3450963",
  abstract =     "For more than a century, the methods for data
                 representation and the exploration of the intrinsic
                 structures of data have developed remarkably and
                 consist of supervised and unsupervised methods.
                 However, recent years have witnessed the flourishing of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "99",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Susungi:2021:IRE,
  author =       "Adilla Susungi and Claude Tadonki",
  title =        "Intermediate Representations for Explicitly Parallel
                 Programs",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "100:1--100:24",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3452299",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3452299",
  abstract =     "While compilers generally support parallel programming
                 languages and APIs, their internal program
                 representations are mostly designed from the sequential
                 programs standpoint (exceptions include
                 source-to-source parallel compilers, for instance).
                 This \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "100",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Charles:2021:SNC,
  author =       "Subodha Charles and Prabhat Mishra",
  title =        "A Survey of Network-on-Chip Security Attacks and
                 Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "101:1--101:36",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3450964",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3450964",
  abstract =     "With the advances of chip manufacturing technologies,
                 computer architects have been able to integrate an
                 increasing number of processors and other heterogeneous
                 components on the same chip. Network-on-Chip (NoC) is
                 widely employed by multicore System-on-. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "101",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Aljeraisy:2021:PLP,
  author =       "Atheer Aljeraisy and Masoud Barati and Omer Rana and
                 Charith Perera",
  title =        "Privacy Laws and Privacy by Design Schemes for the
                 {Internet of Things}: a Developer's Perspective",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "102:1--102:38",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3450965",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3450965",
  abstract =     "Internet of Things applications have the potential to
                 derive sensitive information about individuals.
                 Therefore, developers must exercise due diligence to
                 make sure that data are managed according to the
                 privacy regulations and data protection laws.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "102",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alhussain:2021:ASG,
  author =       "Arwa I. Alhussain and Aqil M. Azmi",
  title =        "Automatic Story Generation: a Survey of Approaches",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "103:1--103:38",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453156",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453156",
  abstract =     "Computational generation of stories is a subfield of
                 computational creativity where artificial intelligence
                 and psychology intersect to teach computers how to
                 mimic humans' creativity. It helps generate many
                 stories with minimum effort and customize the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "103",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Al-Ghossein:2021:SSB,
  author =       "Marie Al-Ghossein and Talel Abdessalem and Anthony
                 Barr{\'e}",
  title =        "A Survey on Stream-Based Recommender Systems",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "104:1--104:36",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453443",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453443",
  abstract =     "Recommender Systems (RS) have proven to be effective
                 tools to help users overcome information overload, and
                 significant advances have been made in the field over
                 the past two decades. Although addressing the
                 recommendation problem required first a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "104",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jannach:2021:SCR,
  author =       "Dietmar Jannach and Ahtsham Manzoor and Wanling Cai
                 and Li Chen",
  title =        "A Survey on Conversational Recommender Systems",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "105:1--105:36",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453154",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453154",
  abstract =     "Recommender systems are software applications that
                 help users to find items of interest in situations of
                 information overload. Current research often assumes a
                 one-shot interaction paradigm, where the users'
                 preferences are estimated based on past \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "105",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Luo:2021:DLB,
  author =       "Yuan Luo and Ya Xiao and Long Cheng and Guojun Peng
                 and Danfeng (Daphne) Yao",
  title =        "Deep Learning-based Anomaly Detection in
                 Cyber-physical Systems: Progress and Opportunities",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "106:1--106:36",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453155",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453155",
  abstract =     "Anomaly detection is crucial to ensure the security of
                 cyber-physical systems (CPS). However, due to the
                 increasing complexity of CPSs and more sophisticated
                 attacks, conventional anomaly detection methods, which
                 face the growing volume of data and need \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "106",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dotan:2021:SBN,
  author =       "Maya Dotan and Yvonne-Anne Pignolet and Stefan Schmid
                 and Saar Tochner and Aviv Zohar",
  title =        "Survey on Blockchain Networking: Context,
                 State-of-the-Art, Challenges",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "107:1--107:34",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453161",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453161",
  abstract =     "Blockchains, in general, and cryptocurrencies such as
                 Bitcoin, in particular, are realized using distributed
                 systems and hence critically rely on the performance
                 and security of the interconnecting network. The
                 requirements on these networks and their \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "107",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rosenberg:2021:AML,
  author =       "Ishai Rosenberg and Asaf Shabtai and Yuval Elovici and
                 Lior Rokach",
  title =        "Adversarial Machine Learning Attacks and Defense
                 Methods in the Cyber Security Domain",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "108:1--108:36",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453158",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453158",
  abstract =     "In recent years, machine learning algorithms, and more
                 specifically deep learning algorithms, have been widely
                 used in many fields, including cyber security. However,
                 machine learning systems are vulnerable to adversarial
                 attacks, and this limits the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "108",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pateria:2021:HRL,
  author =       "Shubham Pateria and Budhitama Subagdja and Ah-hwee Tan
                 and Chai Quek",
  title =        "Hierarchical Reinforcement Learning: a Comprehensive
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "109:1--109:35",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453160",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453160",
  abstract =     "Hierarchical Reinforcement Learning (HRL) enables
                 autonomous decomposition of challenging long-horizon
                 decision-making tasks into simpler subtasks. During the
                 past years, the landscape of HRL research has grown
                 profoundly, resulting in copious \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "109",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dwivedi:2021:LES,
  author =       "Vimal Dwivedi and Vishwajeet Pattanaik and Vipin Deval
                 and Abhishek Dixit and Alex Norta and Dirk Draheim",
  title =        "Legally Enforceable Smart-Contract Languages: a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "110:1--110:34",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453475",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453475",
  abstract =     "Smart contracts are a key component of today's
                 blockchains. They are critical in controlling
                 decentralized autonomous organizations (DAO). However,
                 smart contracts are not yet legally binding nor
                 enforceable; this makes it difficult for businesses to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "110",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ashmore:2021:AML,
  author =       "Rob Ashmore and Radu Calinescu and Colin Paterson",
  title =        "Assuring the Machine Learning Lifecycle: Desiderata,
                 Methods, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "5",
  pages =        "111:1--111:39",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453444",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 10 07:58:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453444",
  abstract =     "Machine learning has evolved into an enabling
                 technology for a wide range of highly successful
                 applications. The potential for this success to
                 continue and accelerate has placed machine learning
                 (ML) at the top of research, economic, and political
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "111",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kietzmann:2021:GPN,
  author =       "Peter Kietzmann and Thomas C. Schmidt and Matthias
                 W{\"a}hlisch",
  title =        "A Guideline on Pseudorandom Number Generation {(PRNG)}
                 in the {IoT}",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "112:1--112:38",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453159",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453159",
  abstract =     "Random numbers are an essential input to many
                 functions on the Internet of Things (IoT). Common use
                 cases of randomness range from low-level packet
                 transmission to advanced algorithms of artificial
                 intelligence as well as security and trust, which
                 heavily rely on unpredictable random sources. In the
                 constrained IoT, though, unpredictable random sources
                 are a challenging desire due to limited resources,
                 deterministic real-time operations, and frequent lack
                 of a user interface.\par

                 In this article, we revisit the generation of
                 randomness from the perspective of an IoT operating
                 system (OS) that needs to support general purpose or
                 crypto-secure random numbers. We analyze the potential
                 attack surface, derive common requirements, and discuss
                 the potentials and shortcomings of current IoT OSs. A
                 systematic evaluation of current IoT hardware
                 components and popular software generators based on
                 well-established test suits and on experiments for
                 measuring performance give rise to a set of clear
                 recommendations on how to build such a random subsystem
                 and which generators to use.",
  acknowledgement = ack-nhfb,
  articleno =    "112",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Badr:2021:IST,
  author =       "Eman Badr",
  title =        "Images in Space and Time: Real Big Data in
                 Healthcare",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "113:1--113:38",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453657",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453657",
  abstract =     "Medical imaging diagnosis is mostly subjective, as it
                 depends on medical experts. Hence, the service provided
                 is limited by expert opinion variations and image
                 complexity as well. However, with the increasing
                 advancements in deep learning field, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "113",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jaiswal:2021:UMC,
  author =       "Swati Jaiswal and Uday P. Khedker and Alan Mycroft",
  title =        "A Unified Model for Context-Sensitive Program
                 Analyses:: The Blind Men and the Elephant",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "114:1--114:37",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3456563",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3456563",
  abstract =     "Context-sensitive methods of program analysis increase
                 the precision of interprocedural analysis by achieving
                 the effect of call inlining. These methods have been
                 defined using different formalisms and hence appear as
                 algorithms that are very different \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "114",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mehrabi:2021:SBF,
  author =       "Ninareh Mehrabi and Fred Morstatter and Nripsuta
                 Saxena and Kristina Lerman and Aram Galstyan",
  title =        "A Survey on Bias and Fairness in Machine Learning",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "115:1--115:35",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3457607",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457607",
  abstract =     "With the widespread use of artificial intelligence
                 (AI) systems and applications in our everyday lives,
                 accounting for fairness has gained significant
                 importance in designing and engineering of such
                 systems. AI systems can be used in many sensitive
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "115",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Vera-Olivera:2021:DMN,
  author =       "Harley Vera-Olivera and Ruizhe Guo and Ruben {Cruz
                 Huacarpuma} and Ana Paula Bernardi {Da Silva} and Ari
                 Melo Mariano and Maristela Holanda",
  title =        "Data Modeling and {NoSQL} Databases --- a Systematic
                 Mapping Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "116:1--116:26",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3457608",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457608",
  abstract =     "Modeling is one of the most important steps in
                 developing a database. In traditional databases, the
                 Entity Relationship (ER) and Unified Modeling Language
                 (UML) models are widely used. But how are NoSQL
                 databases being modeled? We performed a systematic
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "116",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Moussaileb:2021:SWB,
  author =       "Routa Moussaileb and Nora Cuppens and Jean-Louis Lanet
                 and H{\'e}l{\`e}ne {Le Bouder}",
  title =        "A Survey on {Windows}-based Ransomware Taxonomy and
                 Detection Mechanisms",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "117:1--117:36",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453153",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453153",
  abstract =     "Ransomware remains an alarming threat in the 21st
                 century. It has evolved from being a simple scare
                 tactic into a complex malware capable of evasion.
                 Formerly, end-users were targeted via mass infection
                 campaigns. Nevertheless, in recent years, the attackers
                 have focused on targeted attacks, since the latter are
                 profitable and can induce severe damage. A vast number
                 of detection mechanisms have been proposed in the
                 literature. We provide a systematic review of
                 ransomware countermeasures starting from its deployment
                 on the victim machine until the ransom payment via
                 cryptocurrency. We define four stages of this malware
                 attack: Delivery, Deployment, Destruction, and Dealing.
                 Then, we assign the corresponding countermeasures for
                 each phase of the attack and cluster them by the
                 techniques used. Finally, we propose a roadmap for
                 researchers to fill the gaps found in the literature in
                 ransomware's battle.",
  acknowledgement = ack-nhfb,
  articleno =    "117",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pal:2021:TBV,
  author =       "Ratnabali Pal and Arif Ahmed Sekh and Debi Prosad
                 Dogra and Samarjit Kar and Partha Pratim Roy and Dilip
                 K. Prasad",
  title =        "Topic-based Video Analysis: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "118:1--118:34",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3459089",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3459089",
  abstract =     "Manual processing of a large volume of video data
                 captured through closed-circuit television is
                 challenging due to various reasons. First, manual
                 analysis is highly time-consuming. Moreover, as
                 surveillance videos are recorded in dynamic conditions
                 such \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "118",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Guerreiro:2021:HIC,
  author =       "Andreia P. Guerreiro and Carlos M. Fonseca and
                 Lu{\'\i}s Paquete",
  title =        "The Hypervolume Indicator: Computational Problems and
                 Algorithms",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "119:1--119:42",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453474",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453474",
  abstract =     "The hypervolume indicator is one of the most used
                 set-quality indicators for the assessment of stochastic
                 multiobjective optimizers, as well as for selection in
                 evolutionary multiobjective optimization algorithms.
                 Its theoretical properties justify its \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "119",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Itoh:2021:TIA,
  author =       "Yuta Itoh and Tobias Langlotz and Jonathan Sutton and
                 Alexander Plopski",
  title =        "Towards Indistinguishable Augmented Reality: a Survey
                 on Optical See-through Head-mounted Displays",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "120:1--120:36",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453157",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453157",
  abstract =     "Adding virtual information that is indistinguishable
                 from reality has been a long-awaited goal in Augmented
                 Reality (AR). While already demonstrated in the 1960s,
                 only recently have Optical See-Through Head-Mounted
                 Displays (OST-HMDs) seen a reemergence,. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "120",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rauf:2021:ATE,
  author =       "Bilal Rauf and Haider Abbas and Muhammad Usman and
                 Tanveer A. Zia and Waseem Iqbal and Yawar Abbas and
                 Hammad Afzal",
  title =        "Application Threats to Exploit Northbound Interface
                 Vulnerabilities in Software Defined Networks",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "121:1--121:36",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453648",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453648",
  abstract =     "Software Defined Networking (SDN) is an evolving
                 technology that decouples the control functionality
                 from the underlying hardware managed by the control
                 plane. The application plane supports programmers to
                 develop numerous applications (such as \ldots{})",
  acknowledgement = ack-nhfb,
  articleno =    "121",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lou:2021:SMS,
  author =       "Xiaoxuan Lou and Tianwei Zhang and Jun Jiang and
                 Yinqian Zhang",
  title =        "A Survey of Microarchitectural Side-channel
                 Vulnerabilities, Attacks, and Defenses in
                 Cryptography",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "122:1--122:37",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3456629",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3456629",
  abstract =     "Side-channel attacks have become a severe threat to
                 the confidentiality of computer applications and
                 systems. One popular type of such attacks is the
                 microarchitectural attack, where the adversary exploits
                 the hardware features to break the protection enforced
                 by the operating system and steal the secrets from the
                 program. In this article, we systematize
                 microarchitectural side channels with a focus on
                 attacks and defenses in cryptographic applications. We
                 make three contributions. (1) We survey past research
                 literature to categorize microarchitectural
                 side-channel attacks. Since these are hardware attacks
                 targeting software, we summarize the vulnerable
                 implementations in software, as well as flawed designs
                 in hardware. (2) We identify common strategies to
                 mitigate microarchitectural attacks, from the
                 application, OS, and hardware levels. (3) We conduct a
                 large-scale evaluation on popular cryptographic
                 applications in the real world and analyze the
                 severity, practicality, and impact of side-channel
                 vulnerabilities. This survey is expected to inspire
                 side-channel research community to discover new
                 attacks, and more importantly, propose new defense
                 solutions against them.",
  acknowledgement = ack-nhfb,
  articleno =    "122",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Papadogiannaki:2021:SEN,
  author =       "Eva Papadogiannaki and Sotiris Ioannidis",
  title =        "A Survey on Encrypted Network Traffic Analysis
                 Applications, Techniques, and Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "123:1--123:35",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3457904",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457904",
  abstract =     "The adoption of network traffic encryption is
                 continually growing. Popular applications use
                 encryption protocols to secure communications and
                 protect the privacy of users. In addition, a large
                 portion of malware is spread through the network
                 traffic taking advantage of encryption protocols to
                 hide its presence and activity. Entering into the era
                 of completely encrypted communications over the
                 Internet, we must rapidly start reviewing the
                 state-of-the-art in the wide domain of network traffic
                 analysis and inspection, to conclude if traditional
                 traffic processing systems will be able to seamlessly
                 adapt to the upcoming full adoption of network
                 encryption. In this survey, we examine the literature
                 that deals with network traffic analysis and inspection
                 after the ascent of encryption in communication
                 channels. We notice that the research community has
                 already started proposing solutions on how to perform
                 inspection even when the network traffic is encrypted
                 and we demonstrate and review these works. In addition,
                 we present the techniques and methods that these works
                 use and their limitations. Finally, we examine the
                 countermeasures that have been proposed in the
                 literature in order to circumvent traffic analysis
                 techniques that aim to harm user privacy.",
  acknowledgement = ack-nhfb,
  articleno =    "123",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nguyen:2021:SPO,
  author =       "Thi Tuyet Hai Nguyen and Adam Jatowt and Mickael
                 Coustaty and Antoine Doucet",
  title =        "Survey of Post-{OCR} Processing Approaches",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "124:1--124:37",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453476",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453476",
  abstract =     "Optical character recognition (OCR) is one of the most
                 popular techniques used for converting printed
                 documents into machine-readable ones. While OCR engines
                 can do well with modern text, their performance is
                 unfortunately significantly reduced on \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "124",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Oikonomou:2021:UIM,
  author =       "Panagiotis Oikonomou and Anna Karanika and Christos
                 Anagnostopoulos and Kostas Kolomvatsos",
  title =        "On the Use of Intelligent Models towards Meeting the
                 Challenges of the Edge Mesh",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "125:1--125:42",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3456630",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3456630",
  abstract =     "Nowadays, we are witnessing the advent of the Internet
                 of Things (IoT) with numerous devices performing
                 interactions between them or with their environment.
                 The huge number of devices leads to huge volumes of
                 data that demand the appropriate processing. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "125",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fei:2021:SVS,
  author =       "Shufan Fei and Zheng Yan and Wenxiu Ding and Haomeng
                 Xie",
  title =        "Security Vulnerabilities of {SGX} and Countermeasures:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "126:1--126:36",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3456631",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3456631",
  abstract =     "Trusted Execution Environments (TEEs) have been widely
                 used in many security-critical applications. The
                 popularity of TEEs derives from its high security and
                 trustworthiness supported by secure hardware. Intel
                 Software Guard Extensions (SGX) is one of the most
                 representative TEEs that creates an isolated
                 environment on an untrusted operating system, thus
                 providing run-time protection for the execution of
                 security-critical code and data. However, Intel SGX is
                 far from the acme of perfection. It has become a target
                 of various attacks due to its security vulnerabilities.
                 Researchers and practitioners have paid attention to
                 the security vulnerabilities of SGX and investigated
                 optimization solutions in real applications.
                 Unfortunately, existing literature lacks a thorough
                 review of security vulnerabilities of SGX and their
                 countermeasures. In this article, we fill this gap.
                 Specifically, we propose two sets of criteria for
                 estimating security risks of existing attacks and
                 evaluating defense effects brought by attack
                 countermeasures. Furthermore, we propose a taxonomy of
                 SGX security vulnerabilities and shed light on
                 corresponding attack vectors. After that, we review
                 published attacks and existing countermeasures, as well
                 as evaluate them by employing our proposed criteria. At
                 last, on the strength of our survey, we propose some
                 open challenges and future directions in the research
                 of SGX security.",
  acknowledgement = ack-nhfb,
  articleno =    "126",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Padakandla:2021:SRL,
  author =       "Sindhu Padakandla",
  title =        "A Survey of Reinforcement Learning Algorithms for
                 Dynamically Varying Environments",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "127:1--127:25",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3459991",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3459991",
  abstract =     "Reinforcement learning (RL) algorithms find
                 applications in inventory control, recommender systems,
                 vehicular traffic management, cloud computing, and
                 robotics. The real-world complications arising in these
                 domains makes them difficult to solve with the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "127",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cunningham:2021:KNN,
  author =       "P{\'a}draig Cunningham and Sarah Jane Delany",
  title =        "$k$-Nearest Neighbour Classifiers --- a Tutorial",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "128:1--128:25",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3459665",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3459665",
  abstract =     "Perhaps the most straightforward classifier in the
                 arsenal or Machine Learning techniques is the Nearest
                 Neighbour Classifier-classification is achieved by
                 identifying the nearest neighbours to a query example
                 and using those neighbours to determine the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "128",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Talbi:2021:MLM,
  author =       "El-Ghazali Talbi",
  title =        "Machine Learning into Metaheuristics: a Survey and
                 Taxonomy",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "129:1--129:32",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3459664",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3459664",
  abstract =     "During the past few years, research in applying
                 machine learning (ML) to design efficient, effective,
                 and robust metaheuristics has become increasingly
                 popular. Many of those machine learning-supported
                 metaheuristics have generated high-quality results
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "129",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{He:2021:SAL,
  author =       "Shilin He and Pinjia He and Zhuangbin Chen and Tianyi
                 Yang and Yuxin Su and Michael R. Lyu",
  title =        "A Survey on Automated Log Analysis for Reliability
                 Engineering",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "130:1--130:37",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3460345",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3460345",
  abstract =     "Logs are semi-structured text generated by logging
                 statements in software source code. In recent decades,
                 software logs have become imperative in the reliability
                 assurance mechanism of many software systems, because
                 they are often the only data \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "130",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yin:2021:CSP,
  author =       "Xuefei Yin and Yanming Zhu and Jiankun Hu",
  title =        "A Comprehensive Survey of Privacy-preserving Federated
                 Learning: a Taxonomy, Review, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "131:1--131:36",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3460427",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3460427",
  abstract =     "The past four years have witnessed the rapid
                 development of federated learning (FL). However, new
                 privacy concerns have also emerged during the
                 aggregation of the distributed intermediate results.
                 The emerging privacy-preserving FL (PPFL) has been
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "131",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cai:2021:GAN,
  author =       "Zhipeng Cai and Zuobin Xiong and Honghui Xu and Peng
                 Wang and Wei Li and Yi Pan",
  title =        "Generative Adversarial Networks: a Survey Toward
                 Private and Secure Applications",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "132:1--132:38",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3459992",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3459992",
  abstract =     "Generative Adversarial Networks (GANs) have promoted a
                 variety of applications in computer vision and natural
                 language processing, among others, due to its
                 generative model's compelling ability to generate
                 realistic examples plausibly drawn from an \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "132",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Boukerche:2021:DGD,
  author =       "Azzedine Boukerche and Mingzhi Sha",
  title =        "Design Guidelines on Deep Learning-based Pedestrian
                 Detection Methods for Supporting Autonomous Vehicles",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "133:1--133:36",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3460770",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3460770",
  abstract =     "Intelligent transportation systems (ITS) enable
                 transportation participants to communicate with each
                 other by sending and receiving messages, so that they
                 can be aware of their surroundings and facilitate
                 efficient transportation through better decision
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "133",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{PlOtz:2021:AML,
  author =       "Thomas Pl{\"O}tz",
  title =        "Applying Machine Learning for Sensor Data Analysis in
                 Interactive Systems: Common Pitfalls of Pragmatic Use
                 and Ways to Avoid Them",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "134:1--134:25",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3459666",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3459666",
  abstract =     "With the widespread proliferation of (miniaturized)
                 sensing facilities and the massive growth and
                 popularity of the field of machine learning (ML)
                 research, new frontiers in automated sensor data
                 analysis have been explored that lead to paradigm
                 shifts \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "134",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lohachab:2022:TIB,
  author =       "Ankur Lohachab and Saurabh Garg and Byeong Kang and
                 Muhammad Bilal Amin and Junmin Lee and Shiping Chen and
                 Xiwei Xu",
  title =        "Towards Interconnected Blockchains: a Comprehensive
                 Review of the Role of Interoperability among Disparate
                 Blockchains",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "135:1--135:39",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3460287",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3460287",
  abstract =     "Unprecedented attention towards blockchain technology
                 is serving as a game-changer in fostering the
                 development of blockchain-enabled distinctive
                 frameworks. However, fragmentation unleashed by its
                 underlying concepts hinders different stakeholders from
                 effectively utilizing blockchain-supported services,
                 resulting in the obstruction of its wide-scale
                 adoption. To explore synergies among the isolated
                 frameworks requires comprehensively studying
                 inter-blockchain communication approaches. These
                 approaches broadly come under the umbrella of
                 Blockchain Interoperability (BI) notion, as it can
                 facilitate a novel paradigm of an integrated blockchain
                 ecosystem that connects state-of-the-art disparate
                 blockchains. Currently, there is a lack of studies that
                 comprehensively review BI, which works as a stumbling
                 block in its development. Therefore, this article aims
                 to articulate potential of BI by reviewing it from
                 diverse perspectives. Beginning with a glance of
                 blockchain architecture fundamentals, this article
                 discusses its associated platforms, taxonomy, and
                 consensus mechanisms. Subsequently, it argues about
                 BI's requirement by exemplifying its potential
                 opportunities and application areas. Concerning BI, an
                 architecture seems to be a missing link. Hence, this
                 article introduces a layered architecture for the
                 effective development of protocols and methods for
                 interoperable blockchains. Furthermore, this article
                 proposes an in-depth BI research taxonomy and provides
                 an insight into the state-of-the-art projects. Finally,
                 it determines possible open challenges and future
                 research in the domain.",
  acknowledgement = ack-nhfb,
  articleno =    "135",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2022:MTP,
  author =       "Lefeng Zhang and Tianqing Zhu and Ping Xiong and
                 Wanlei Zhou and Philip S. Yu",
  title =        "More than Privacy: Adopting Differential Privacy in
                 Game-theoretic Mechanism Design",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "136:1--136:37",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3460771",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3460771",
  abstract =     "The vast majority of artificial intelligence solutions
                 are founded on game theory, and differential privacy is
                 emerging as perhaps the most rigorous and widely
                 adopted privacy paradigm in the field. However,
                 alongside all the advancements made in both \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "136",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Braun:2022:AAU,
  author =       "Michael Braun and Florian Weber and Florian Alt",
  title =        "Affective Automotive User Interfaces-Reviewing the
                 State of Driver Affect Research and Emotion Regulation
                 in the Car",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "137:1--137:26",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3460938",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3460938",
  abstract =     "Affective technology offers exciting opportunities to
                 improve road safety by catering to human emotions.
                 Modern car interiors enable the contactless detection
                 of user states, paving the way for a systematic
                 promotion of safe driver behavior through \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "137",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Drame-Maigne:2022:CDE,
  author =       "Sophie Dram{\'e}-Maign{\'e} and Maryline Laurent and
                 Laurent Castillo and Herv{\'e} Ganem",
  title =        "Centralized, Distributed, and Everything in between:
                 Reviewing Access Control Solutions for the {IoT}",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "138:1--138:34",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3465170",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3465170",
  abstract =     "The Internet of Things is taking hold in our everyday
                 life. Regrettably, the security of IoT devices is often
                 being overlooked. Among the vast array of security
                 issues plaguing the emerging IoT, we decide to focus on
                 access control, as privacy, trust, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "138",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Miao:2022:MLB,
  author =       "Yuantian Miao and Chao Chen and Lei Pan and Qing-Long
                 Han and Jun Zhang and Yang Xiang",
  title =        "Machine Learning-based Cyber Attacks Targeting on
                 Controlled Information: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "139:1--139:36",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3465171",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3465171",
  abstract =     "Stealing attack against controlled information, along
                 with the increasing number of information leakage
                 incidents, has become an emerging cyber security threat
                 in recent years. Due to the booming development and
                 deployment of advanced analytics \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "139",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ignaczak:2022:TMC,
  author =       "Luciano Ignaczak and Guilherme Goldschmidt and
                 Cristiano Andr{\'e} {Da Costa} and Rodrigo {Da Rosa
                 Righi}",
  title =        "Text Mining in Cybersecurity: a Systematic Literature
                 Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "140:1--140:36",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3462477",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3462477",
  abstract =     "The growth of data volume has changed cybersecurity
                 activities, demanding a higher level of automation. In
                 this new cybersecurity landscape, text mining emerged
                 as an alternative to improve the efficiency of the
                 activities involving unstructured data. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "140",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fernando:2022:DLM,
  author =       "Tharindu Fernando and Harshala Gammulle and Simon
                 Denman and Sridha Sridharan and Clinton Fookes",
  title =        "Deep Learning for Medical Anomaly Detection --- a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "141:1--141:37",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3464423",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3464423",
  abstract =     "Machine learning-based medical anomaly detection is an
                 important problem that has been extensively studied.
                 Numerous approaches have been proposed across various
                 medical application domains and we observe several
                 similarities across these distinct \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "141",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Resch:2022:BQC,
  author =       "Salonik Resch and Ulya R. Karpuzcu",
  title =        "Benchmarking Quantum Computers and the Impact of
                 Quantum Noise",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "142:1--142:35",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3464420",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3464420",
  abstract =     "Benchmarking is how the performance of a computing
                 system is determined. Surprisingly, even for classical
                 computers this is not a straightforward process. One
                 must choose the appropriate benchmark and metrics to
                 extract meaningful results. Different \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "142",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lima:2022:SMV,
  author =       "Hugo B. Lima and Carlos G. R. {Dos Santos} and Bianchi
                 S. Meiguins",
  title =        "A Survey of Music Visualization Techniques",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "143:1--143:29",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3461835",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3461835",
  abstract =     "Music Information Research (MIR) comprises all the
                 research topics involved in modeling and understanding
                 music. Visualizations are frequently adopted to convey
                 better understandings about music pieces, and the
                 association of music with visual elements \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "143",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{BonesckiGumiel:2022:TRE,
  author =       "Yohan {Bonescki Gumiel} and Lucas Emanuel {Silva e
                 Oliveira} and Vincent Claveau and Natalia Grabar and
                 Emerson {Cabrera Paraiso} and Claudia Moro and Deborah
                 {Ribeiro Carvalho}",
  title =        "Temporal Relation Extraction in Clinical Texts: a
                 Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "144:1--144:36",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3462475",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3462475",
  abstract =     "Unstructured data in electronic health records,
                 represented by clinical texts, are a vast source of
                 healthcare information because they describe a
                 patient's journey, including clinical findings,
                 procedures, and information about the continuity of
                 care. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "144",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chauhan:2022:TMU,
  author =       "Uttam Chauhan and Apurva Shah",
  title =        "Topic Modeling Using Latent {Dirichlet} allocation: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "145:1--145:35",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3462478",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3462478",
  abstract =     "We are not able to deal with a mammoth text corpus
                 without summarizing them into a relatively small
                 subset. A computational tool is extremely needed to
                 understand such a gigantic pool of text. Probabilistic
                 Topic Modeling discovers and explains the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "145",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tamine:2022:SIR,
  author =       "Lynda Tamine and Lorraine Goeuriot",
  title =        "Semantic Information Retrieval on Medical Texts:
                 Research Challenges, Survey, and Open Issues",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "146:1--146:38",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3462476",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3462476",
  abstract =     "The explosive growth and widespread accessibility of
                 medical information on the Internet have led to a surge
                 of research activity in a wide range of scientific
                 communities including health informatics and
                 information retrieval (IR). One of the common
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "146",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Berger:2022:SRI,
  author =       "Christian Berger and Philipp Eichhammer and Hans P.
                 Reiser and J{\"o}rg Domaschka and Franz J. Hauck and
                 Gerhard Habiger",
  title =        "A Survey on Resilience in the {IoT}: Taxonomy,
                 Classification, and Discussion of Resilience
                 Mechanisms",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "147:1--147:39",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3462513",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3462513",
  abstract =     "Internet-of-Things (IoT) ecosystems tend to grow both
                 in scale and complexity, as they consist of a variety
                 of heterogeneous devices that span over multiple
                 architectural IoT layers (e.g., cloud, edge, sensors).
                 Further, IoT systems increasingly demand \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "147",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tolmach:2022:SSC,
  author =       "Palina Tolmach and Yi Li and Shang-Wei Lin and Yang
                 Liu and Zengxiang Li",
  title =        "A Survey of Smart Contract Formal Specification and
                 Verification",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "148:1--148:38",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3464421",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3464421",
  abstract =     "A smart contract is a computer program that allows
                 users to automate their actions on the blockchain
                 platform. Given the significance of smart contracts in
                 supporting important activities across industry sectors
                 including supply chain, finance, legal, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "148",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Park:2022:SPS,
  author =       "Jihyeok Park and Hongki Lee and Sukyoung Ryu",
  title =        "A Survey of Parametric Static Analysis",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "149:1--149:37",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3464457",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3464457",
  abstract =     "Understanding program behaviors is important to verify
                 program properties or to optimize programs. Static
                 analysis is a widely used technique to approximate
                 program behaviors via abstract interpretation. To
                 evaluate the quality of static analysis, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "149",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{DeMattos:2022:BMA,
  author =       "Douglas Paulo {De Mattos} and D{\'e}bora C.
                 Muchaluat-Saade and Gheorghita Ghinea",
  title =        "Beyond Multimedia Authoring: On the Need for
                 Mulsemedia Authoring Tools",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "150:1--150:31",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3464422",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3464422",
  abstract =     "The mulsemedia (Multiple Sensorial Media (MulSeMedia))
                 concept has been explored to provide users with new
                 sensations using other senses beyond sight and hearing.
                 The demand for producing such applications has
                 motivated various studies in the mulsemedia \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "150",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2022:ELE,
  author =       "Jie Zhang and Zhihao Qu and Chenxi Chen and Haozhao
                 Wang and Yufeng Zhan and Baoliu Ye and Song Guo",
  title =        "Edge Learning: The Enabling Technology for Distributed
                 Big Data Analytics in the Edge",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "151:1--151:36",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3464419",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3464419",
  abstract =     "Machine Learning (ML) has demonstrated great promise
                 in various fields, e.g., self-driving, smart city,
                 which are fundamentally altering the way individuals
                 and organizations live, work, and interact. Traditional
                 centralized learning frameworks require \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "151",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Baldassin:2022:PMS,
  author =       "Alexandro Baldassin and Jo{\~a}o Barreto and Daniel
                 Castro and Paolo Romano",
  title =        "Persistent Memory: a Survey of Programming Support and
                 Implementations",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "152:1--152:37",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3465402",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3465402",
  abstract =     "The recent rise of byte-addressable non-volatile
                 memory technologies is blurring the dichotomy between
                 memory and storage. In particular, they allow
                 programmers to have direct access to persistent data
                 instead of relying on traditional interfaces, such
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "152",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Juarez:2022:CRT,
  author =       "Julio Ju{\'a}rez and Cipriano (Pano) Santos and Carlos
                 A. Brizuela",
  title =        "A Comprehensive Review and a Taxonomy Proposal of Team
                 Formation Problems",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "153:1--153:33",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3465399",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3465399",
  abstract =     "With a growing interest in high-performing work teams
                 and how to form them, a new computational challenge,
                 denominated Team Formation Problem (TFP), has emerged.
                 After almost two decades of research on this problem,
                 many works continue to raise \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "153",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2022:SSB,
  author =       "Shoujin Wang and Longbing Cao and Yan Wang and Quan Z.
                 Sheng and Mehmet A. Orgun and Defu Lian",
  title =        "A Survey on Session-based Recommender Systems",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "154:1--154:38",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3465401",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3465401",
  abstract =     "Recommender systems (RSs) have been playing an
                 increasingly important role for informed consumption,
                 services, and decision-making in the overloaded
                 information era and digitized economy. In recent years,
                 session-based recommender systems (SBRSs) have
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "154",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Magrofuoco:2022:TDS,
  author =       "Nathan Magrofuoco and Paolo Roselli and Jean
                 Vanderdonckt",
  title =        "Two-dimensional Stroke Gesture Recognition: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "155:1--155:36",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3465400",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3465400",
  abstract =     "The expansion of touch-sensitive technologies, ranging
                 from smartwatches to wall screens, triggered a wider
                 use of gesture-based user interfaces and encouraged
                 researchers to invent recognizers that are fast and
                 accurate for end-users while being simple \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "155",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chefrour:2022:OWD,
  author =       "Djalel Chefrour",
  title =        "One-Way Delay Measurement From Traditional Networks to
                 {SDN}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "7",
  pages =        "156:1--156:35",
  month =        sep,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3466167",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3466167",
  abstract =     "We expose the state of the art in the topic of one-way
                 delay measurement in both traditional and
                 software-defined networks. A representative range of
                 standard mechanisms and recent research works,
                 including OpenFlow and Programming Protocol-independent
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "156",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jabbar:2022:SGA,
  author =       "Abdul Jabbar and Xi Li and Bourahla Omar",
  title =        "A Survey on Generative Adversarial Networks: Variants,
                 Applications, and Training",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "157:1--157:49",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3463475",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3463475",
  abstract =     "The Generative Models have gained considerable
                 attention in unsupervised learning via a new and
                 practical framework called Generative Adversarial
                 Networks (GAN) due to their outstanding data generation
                 capability. Many GAN models have been proposed, and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "157",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2022:SAA,
  author =       "Jianguo Chen and Kenli Li and Zhaolei Zhang and Keqin
                 Li and Philip S. Yu",
  title =        "A Survey on Applications of Artificial Intelligence in
                 Fighting Against {COVID-19}",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "158:1--158:32",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3465398",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3465398",
  abstract =     "The COVID-19 pandemic caused by the SARS-CoV-2 virus
                 has spread rapidly worldwide, leading to a global
                 outbreak. Most governments, enterprises, and scientific
                 research institutions are participating in the COVID-19
                 struggle to curb the spread of the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "158",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2022:APD,
  author =       "Xingwei Zhang and Xiaolong Zheng and Wenji Mao",
  title =        "Adversarial Perturbation Defense on Deep Neural
                 Networks",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "159:1--159:36",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3465397",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3465397",
  abstract =     "Deep neural networks (DNNs) have been verified to be
                 easily attacked by well-designed adversarial
                 perturbations. Image objects with small perturbations
                 that are imperceptible to human eyes can induce
                 DNN-based image class classifiers towards making
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "159",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zou:2022:IBC,
  author =       "Jinglin Zou and Debiao He and Sherali Zeadally and
                 Neeraj Kumar and Huaqun Wang and Kkwang Raymond Choo",
  title =        "Integrated Blockchain and Cloud Computing Systems: a
                 Systematic Survey, Solutions, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "160:1--160:36",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3456628",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3456628",
  abstract =     "Cloud computing is a network model of on-demand access
                 for sharing configurable computing resource pools.
                 Compared with conventional service architectures, cloud
                 computing introduces new security challenges in secure
                 service management and control, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "160",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Telikani:2022:EML,
  author =       "Akbar Telikani and Amirhessam Tahmassebi and Wolfgang
                 Banzhaf and Amir H. Gandomi",
  title =        "Evolutionary Machine Learning: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "161:1--161:35",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3467477",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3467477",
  abstract =     "Evolutionary Computation (EC) approaches are inspired
                 by nature and solve optimization problems in a
                 stochastic manner. They can offer a reliable and
                 effective approach to address complex problems in
                 real-world applications. EC algorithms have recently
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "161",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2022:UST,
  author =       "Weijia Zhang and Jiuyong Li and Lin Liu",
  title =        "A Unified Survey of Treatment Effect Heterogeneity
                 Modelling and Uplift Modelling",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "162:1--162:36",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3466818",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3466818",
  abstract =     "A central question in many fields of scientific
                 research is to determine how an outcome is affected by
                 an action, i.e., to estimate the causal effect or
                 treatment effect of an action. In recent years, in
                 areas such as personalised healthcare, sociology,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "162",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Souza:2022:MPV,
  author =       "Vinicius Souza and Anderson Maciel and Luciana Nedel
                 and Regis Kopper",
  title =        "Measuring Presence in Virtual Environments: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "163:1--163:37",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3466817",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3466817",
  abstract =     "The effectiveness of a virtual reality experience is
                 strongly affected by the sense of presence of the users
                 involved. This article reviews the different
                 definitions of presence and the main proposed methods
                 to measure it through the analysis of 1,214 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "163",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ajaykumar:2022:SEU,
  author =       "Gopika Ajaykumar and Maureen Steele and Chien-Ming
                 Huang",
  title =        "A Survey on End-User Robot Programming",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "164:1--164:36",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3466819",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3466819",
  abstract =     "As robots interact with a broader range of end-users,
                 end-user robot programming has helped democratize robot
                 programming by empowering end-users who may not have
                 experience in robot programming to customize robots to
                 meet their individual contextual \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "164",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lee:2022:TAR,
  author =       "Lik-Hang Lee and Tristan Braud and Simo Hosio and Pan
                 Hui",
  title =        "Towards Augmented Reality Driven Human-City
                 Interaction: Current Research on Mobile Headsets and
                 Future Challenges",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "165:1--165:38",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3467963",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3467963",
  abstract =     "Interaction design for Augmented Reality (AR) is
                 gaining attention from both academia and industry. This
                 survey discusses 260 articles (68.8\% of articles
                 published between 2015-2019) to review the field of
                 human interaction in connected cities with \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "165",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Roy:2022:TRN,
  author =       "Satyaki Roy and Preetam Ghosh and Nirnay Ghosh and
                 Sajal K. Das",
  title =        "Transcriptional Regulatory Network Topology with
                 Applications to Bio-inspired Networking: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "166:1--166:36",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3468266",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3468266",
  abstract =     "The advent of the edge computing network paradigm
                 places the computational and storage resources away
                 from the data centers and closer to the edge of the
                 network largely comprising the heterogeneous IoT
                 devices collecting huge volumes of data. This
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "166",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tian:2022:DAA,
  author =       "Haiman Tian and Maria Presa-Reyes and Yudong Tao and
                 Tianyi Wang and Samira Pouyanfar and Alonso Miguel and
                 Steven Luis and Mei-Ling Shyu and Shu-Ching Chen and
                 Sundaraja Sitharama Iyengar",
  title =        "Data Analytics for Air Travel Data: a Survey and New
                 Perspectives",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "167:1--167:35",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3469028",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3469028",
  abstract =     "From the start, the airline industry has remarkably
                 connected countries all over the world through rapid
                 long-distance transportation, helping people overcome
                 geographic barriers. Consequently, this has ushered in
                 substantial economic growth, both \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "167",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Belchior:2022:SBI,
  author =       "Rafael Belchior and Andr{\'e} Vasconcelos and
                 S{\'e}rgio Guerreiro and Miguel Correia",
  title =        "A Survey on Blockchain Interoperability: Past,
                 Present, and Future Trends",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "168:1--168:41",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3471140",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471140",
  abstract =     "Blockchain interoperability is emerging as one of the
                 crucial features of blockchain technology, but the
                 knowledge necessary for achieving it is fragmented.
                 This fact makes it challenging for academics and the
                 industry to achieve interoperability among \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "168",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lee:2022:DNN,
  author =       "Royson Lee and Stylianos I. Venieris and Nicholas D.
                 Lane",
  title =        "Deep Neural Network-based Enhancement for Image and
                 Video Streaming Systems: a Survey and Future
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "169:1--169:30",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3469094",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3469094",
  abstract =     "Internet-enabled smartphones and ultra-wide displays
                 are transforming a variety of visual apps spanning from
                 on-demand movies and 360${}^\circ $ videos to
                 video-conferencing and live streaming. However,
                 robustly delivering visual content under fluctuating
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "169",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Murshed:2022:MLN,
  author =       "M. G. Sarwar Murshed and Christopher Murphy and Daqing
                 Hou and Nazar Khan and Ganesh Ananthanarayanan and
                 Faraz Hussain",
  title =        "Machine Learning at the Network Edge: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "170:1--170:37",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3469029",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3469029",
  abstract =     "Resource-constrained IoT devices, such as sensors and
                 actuators, have become ubiquitous in recent years. This
                 has led to the generation of large quantities of data
                 in real-time, which is an appealing target for AI
                 systems. However, deploying machine \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "170",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lamothe:2022:SRA,
  author =       "Maxime Lamothe and Yann-Ga{\"e}l Gu{\'e}h{\'e}neuc and
                 Weiyi Shang",
  title =        "A Systematic Review of {API} Evolution Literature",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "171:1--171:36",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3470133",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3470133",
  abstract =     "Recent software advances have led to an expansion of
                 the development and usage of application programming
                 interfaces (APIs). From millions of Android packages
                 (APKs) available on Google Store to millions of
                 open-source packages available in Maven, PyPI,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "171",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{McBroom:2022:SAP,
  author =       "Jessica McBroom and Irena Koprinska and Kalina Yacef",
  title =        "A Survey of Automated Programming Hint Generation: The
                 {HINTS} Framework",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "172:1--172:27",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3469885",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3469885",
  abstract =     "Automated tutoring systems offer the flexibility and
                 scalability necessary to facilitate the provision of
                 high-quality and universally accessible programming
                 education. To realise the potential of these systems,
                 recent work has proposed a diverse range of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "172",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Desolda:2022:HFP,
  author =       "Giuseppe Desolda and Lauren S. Ferro and Andrea
                 Marrella and Tiziana Catarci and Maria Francesca
                 Costabile",
  title =        "Human Factors in Phishing Attacks: a Systematic
                 Literature Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "173:1--173:35",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3469886",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3469886",
  abstract =     "Phishing is the fraudulent attempt to obtain sensitive
                 information by disguising oneself as a trustworthy
                 entity in digital communication. It is a type of cyber
                 attack often successful because users are not aware of
                 their vulnerabilities or are unable to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "173",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tian:2022:ELS,
  author =       "Ye Tian and Langchun Si and Xingyi Zhang and Ran Cheng
                 and Cheng He and Kay Chen Tan and Yaochu Jin",
  title =        "Evolutionary Large-Scale Multi-Objective Optimization:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "174:1--174:34",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3470971",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3470971",
  abstract =     "Multi-objective evolutionary algorithms (MOEAs) have
                 shown promising performance in solving various
                 optimization problems, but their performance may
                 deteriorate drastically when tackling problems
                 containing a large number of decision variables. In
                 recent \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "174",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{S:2022:ADB,
  author =       "Shubhra Kanti Karmaker (``Santu'') and Md. Mahadi
                 Hassan and Micah J. Smith and Lei Xu and Chengxiang
                 Zhai and Kalyan Veeramachaneni",
  title =        "{AutoML} to Date and Beyond: Challenges and
                 Opportunities",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "175:1--175:36",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3470918",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3470918",
  abstract =     "As big data becomes ubiquitous across domains, and
                 more and more stakeholders aspire to make the most of
                 their data, demand for machine learning tools has
                 spurred researchers to explore the possibilities of
                 automated machine learning (AutoML). AutoML \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "175",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dias:2022:SLR,
  author =       "Alexandre H. T. Dias and Luiz. H. A. Correia and
                 Neumar Malheiros",
  title =        "A Systematic Literature Review on Virtual Machine
                 Consolidation",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "176:1--176:38",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3470972",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3470972",
  abstract =     "Virtual machine consolidation has been a widely
                 explored topic in recent years due to Cloud Data
                 Centers' effect on global energy consumption. Thus,
                 academia and companies made efforts to achieve green
                 computing, reducing energy consumption to minimize
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "176",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gu:2022:SDL,
  author =       "Fuqiang Gu and Mu-Huan Chung and Mark Chignell and
                 Shahrokh Valaee and Baoding Zhou and Xue Liu",
  title =        "A Survey on Deep Learning for Human Activity
                 Recognition",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "8",
  pages =        "177:1--177:34",
  month =        nov,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3472290",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 5 08:39:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3472290",
  abstract =     "Human activity recognition is a key to a lot of
                 applications such as healthcare and smart home. In this
                 study, we provide a comprehensive survey on recent
                 advances and challenges in human activity recognition
                 (HAR) with deep learning. Although there are \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "177",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Arakadakis:2022:FAP,
  author =       "Konstantinos Arakadakis and Pavlos Charalampidis and
                 Antonis Makrogiannakis and Alexandros Fragkiadakis",
  title =        "Firmware Over-the-air Programming Techniques for {IoT}
                 Networks --- A Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "178:1--178:36",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3472292",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3472292",
  abstract =     "The devices forming Internet of Things (IoT) networks
                 need to be re-programmed over the air, so that new
                 features are added, software bugs or security
                 vulnerabilities are resolved, and their applications
                 can be re-purposed. The limitations of IoT devices,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "178",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bustio-Martinez:2022:FGB,
  author =       "L{\'a}zaro Bustio-Mart{\'\i}nez and Ren{\'e} Cumplido
                 and Mart{\'\i}n Letras and Raudel
                 Hern{\'a}ndez-Le{\'o}n and Claudia Feregrino-Uribe and
                 Jos{\'e} Hern{\'a}ndez-Palancar",
  title =        "{FPGA\slash GPU}-based Acceleration for Frequent
                 Itemsets Mining: a Comprehensive Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "179:1--179:35",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3472289",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3472289",
  abstract =     "In data mining, Frequent Itemsets Mining is a
                 technique used in several domains with notable results.
                 However, the large volume of data in modern datasets
                 increases the processing time of Frequent Itemset
                 Mining algorithms, making them unsuitable for many
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "179",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ren:2022:SDA,
  author =       "Pengzhen Ren and Yun Xiao and Xiaojun Chang and Po-Yao
                 Huang and Zhihui Li and Brij B. Gupta and Xiaojiang
                 Chen and Xin Wang",
  title =        "A Survey of Deep Active Learning",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "180:1--180:40",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3472291",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3472291",
  abstract =     "Active learning (AL) attempts to maximize a model's
                 performance gain while annotating the fewest samples
                 possible. Deep learning (DL) is greedy for data and
                 requires a large amount of data supply to optimize a
                 massive number of parameters if the model is \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "180",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kakaletsis:2022:CVA,
  author =       "Efstratios Kakaletsis and Charalampos Symeonidis and
                 Maria Tzelepi and Ioannis Mademlis and Anastasios Tefas
                 and Nikos Nikolaidis and Ioannis Pitas",
  title =        "Computer Vision for Autonomous {UAV} Flight Safety: an
                 Overview and a Vision-based Safe Landing Pipeline
                 Example",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "181:1--181:37",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3472288",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3472288",
  abstract =     "Recent years have seen an unprecedented spread of
                 Unmanned Aerial Vehicles (UAVs, or ``drones''), which
                 are highly useful for both civilian and military
                 applications. Flight safety is a crucial issue in UAV
                 navigation, having to ensure accurate compliance
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "181",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chou:2022:SDD,
  author =       "Dylan Chou and Meng Jiang",
  title =        "A Survey on Data-driven Network Intrusion Detection",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "182:1--182:36",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3472753",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3472753",
  abstract =     "Data-driven network intrusion detection (NID) has a
                 tendency towards minority attack classes compared to
                 normal traffic. Many datasets are collected in
                 simulated environments rather than real-world networks.
                 These challenges undermine the performance of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "182",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xie:2022:WSN,
  author =       "Lingxi Xie and Xin Chen and Kaifeng Bi and Longhui Wei
                 and Yuhui Xu and Lanfei Wang and Zhengsu Chen and An
                 Xiao and Jianlong Chang and Xiaopeng Zhang and Qi
                 Tian",
  title =        "Weight-Sharing Neural Architecture Search: a Battle to
                 Shrink the Optimization Gap",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "183:1--183:37",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3473330",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3473330",
  abstract =     "Neural architecture search (NAS) has attracted
                 increasing attention. In recent years, individual
                 search methods have been replaced by weight-sharing
                 search methods for higher search efficiency, but the
                 latter methods often suffer lower instability. This
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "183",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bermejo:2022:SHT,
  author =       "Carlos Bermejo and Pan Hui",
  title =        "A Survey on Haptic Technologies for Mobile Augmented
                 Reality",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "184:1--184:35",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3465396",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3465396",
  abstract =     "Augmented reality (AR) applications have gained much
                 research and industry attention. Moreover, the mobile
                 counterpart-mobile augmented reality (MAR) is one of
                 the most explosive growth areas for AR applications in
                 the mobile environment (e.g., \ldots{})",
  acknowledgement = ack-nhfb,
  articleno =    "184",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{AlRidhawi:2022:DGC,
  author =       "Ismaeel {Al Ridhawi} and Ouns Bouachir and Moayad
                 Aloqaily and Azzedine Boukerche",
  title =        "Design Guidelines for Cooperative {UAV}-supported
                 Services and Applications",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "185:1--185:35",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3467964",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3467964",
  abstract =     "Internet of Things (IoT) systems have advanced greatly
                 in the past few years, especially with the support of
                 Machine Learning (ML) and Artificial Intelligence (AI)
                 solutions. Numerous AI-supported IoT devices are
                 playing a significant role in providing \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "185",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ranaweera:2022:MEU,
  author =       "Pasika Ranaweera and Anca Jurcut and Madhusanka
                 Liyanage",
  title =        "{MEC}-enabled {5G} Use Cases: a Survey on Security
                 Vulnerabilities and Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "186:1--186:37",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3474552",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3474552",
  abstract =     "The future of mobile and internet technologies are
                 manifesting advancements beyond the existing scope of
                 science. The concepts of automated driving,
                 augmented-reality, and machine-type-communication are
                 quite sophisticated and require an elevation of the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "186",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Min:2022:SCQ,
  author =       "Xiongkuo Min and Ke Gu and Guangtao Zhai and Xiaokang
                 Yang and Wenjun Zhang and Patrick {Le Callet} and Chang
                 Wen Chen",
  title =        "Screen Content Quality Assessment: Overview,
                 Benchmark, and Beyond",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "187:1--187:36",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3470970",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3470970",
  abstract =     "Screen content, which is often computer-generated, has
                 many characteristics distinctly different from
                 conventional camera-captured natural scene content.
                 Such characteristic differences impose major challenges
                 to the corresponding content quality \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "187",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Siqueira:2022:SCI,
  author =       "Frank Siqueira and Joseph G. Davis",
  title =        "Service Computing for {Industry 4.0}: State of the
                 Art, Challenges, and Research Opportunities",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "188:1--188:38",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3478680",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3478680",
  abstract =     "Recent advances in the large-scale adoption of
                 information and communication technologies in
                 manufacturing processes, known as Industry 4.0 or Smart
                 Manufacturing, provide us a window into how the
                 manufacturing sector will evolve in the coming decades.
                 As \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "188",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sato:2022:SCD,
  author =       "Denise Maria {Vecino Sato} and Sheila Cristiana {De
                 Freitas} and Jean Paul Barddal and Edson Emilio
                 Scalabrin",
  title =        "A Survey on Concept Drift in Process Mining",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "189:1--189:38",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3472752",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3472752",
  abstract =     "Concept drift in process mining (PM) is a challenge as
                 classical methods assume processes are in a
                 steady-state, i.e., events share the same process
                 version. We conducted a systematic literature review on
                 the intersection of these areas, and thus, we
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "189",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2022:EEW,
  author =       "Bing Zhang and Jingyue Li and Jiadong Ren and Guoyan
                 Huang",
  title =        "Efficiency and Effectiveness of {Web} Application
                 Vulnerability Detection Approaches: a Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "190:1--190:35",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3474553",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3474553",
  abstract =     "Most existing surveys and reviews on web application
                 vulnerability detection (WAVD) approaches focus on
                 comparing and summarizing the approaches' technical
                 details. Although some studies have analyzed the
                 efficiency and effectiveness of specific methods,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "190",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Abadal:2022:CGN,
  author =       "Sergi Abadal and Akshay Jain and Robert Guirado and
                 Jorge L{\'o}pez-Alonso and Eduard Alarc{\'o}n",
  title =        "Computing Graph Neural Networks: a Survey from
                 Algorithms to Accelerators",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "191:1--191:38",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3477141",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477141",
  abstract =     "Graph Neural Networks (GNNs) have exploded onto the
                 machine learning scene in recent years owing to their
                 capability to model and learn from graph-structured
                 data. Such an ability has strong implications in a wide
                 variety of fields whose data are \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "191",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Guerar:2022:GCE,
  author =       "Meriem Guerar and Luca Verderame and Mauro Migliardi
                 and Francesco Palmieri and Alessio Merlo",
  title =        "Gotta {CAPTCHA} 'Em All: a Survey of 20 Years of the
                 Human-or-computer Dilemma",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "192:1--192:33",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3477142",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477142",
  abstract =     "A recent study has found that malicious bots generated
                 nearly a quarter of overall website traffic in 2019
                 [102]. These malicious bots perform activities such as
                 price and content scraping, account creation and
                 takeover, credit card fraud, denial of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "192",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mena:2022:SUE,
  author =       "Jos{\'e} Mena and Oriol Pujol and Jordi Vitri{\`a}",
  title =        "A Survey on Uncertainty Estimation in Deep Learning
                 Classification Systems from a {Bayesian} Perspective",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "193:1--193:35",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3477140",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477140",
  abstract =     "Decision-making based on machine learning systems,
                 especially when this decision-making can affect human
                 lives, is a subject of maximum interest in the Machine
                 Learning community. It is, therefore, necessary to
                 equip these systems with a means of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "193",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Schmid:2022:SCT,
  author =       "Josef Schmid and Alfred H{\"o}ss and Bj{\"o}rn W.
                 Schuller",
  title =        "A Survey on Client Throughput Prediction Algorithms in
                 Wired and Wireless Networks",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "194:1--194:33",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3477204",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477204",
  abstract =     "Network communication has become a part of everyday
                 life, and the interconnection among devices and people
                 will increase even more in the future. Nevertheless,
                 prediction of Quality of Service parameters,
                 particularly throughput, is quite a challenging
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "194",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Aloufi:2022:CBD,
  author =       "Asma Aloufi and Peizhao Hu and Yongsoo Song and
                 Kristin Lauter",
  title =        "Computing Blindfolded on Data Homomorphically
                 Encrypted under Multiple Keys: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "195:1--195:37",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3477139",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477139",
  abstract =     "With capability of performing computations on
                 encrypted data without needing the secret key,
                 homomorphic encryption (HE) is a promising
                 cryptographic technique that makes outsourced
                 computations secure and privacy-preserving. A decade
                 after Gentry's \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "195",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2022:OCC,
  author =       "Chao Liu and Xin Xia and David Lo and Cuiyun Gao and
                 Xiaohu Yang and John Grundy",
  title =        "Opportunities and Challenges in Code Search Tools",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "196:1--196:40",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3480027",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3480027",
  abstract =     "Code search is a core software engineering task.
                 Effective code search tools can help developers
                 substantially improve their software development
                 efficiency and effectiveness. In recent years, many
                 code search studies have leveraged different
                 techniques, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "196",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{McIntosh:2022:RMM,
  author =       "Timothy McIntosh and A. S. M. Kayes and Yi-Ping Phoebe
                 Chen and Alex Ng and Paul Watters",
  title =        "Ransomware Mitigation in the Modern Era: a
                 Comprehensive Review, Research Challenges, and Future
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "197:1--197:36",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3479393",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3479393",
  abstract =     "Although ransomware has been around since the early
                 days of personal computers, its sophistication and
                 aggression have increased substantially over the years.
                 Ransomware, as a type of malware to extort ransom
                 payments from victims, has evolved to deliver
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "197",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mayrhofer:2022:AMM,
  author =       "Ren{\'e} Mayrhofer and Stephan Sigg",
  title =        "Adversary Models for Mobile Device Authentication",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "198:1--198:35",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3477601",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477601",
  abstract =     "Mobile device authentication has been a highly active
                 research topic for over 10 years, with a vast range of
                 methods proposed and analyzed. In related areas, such
                 as secure channel protocols, remote authentication, or
                 desktop user authentication, strong, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "198",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gevay:2022:HID,
  author =       "G{\'a}bor E. G{\'e}vay and Juan Soto and Volker
                 Markl",
  title =        "Handling Iterations in Distributed Dataflow Systems",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "199:1--199:38",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3477602",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477602",
  abstract =     "Over the past decade, distributed dataflow systems
                 (DDS) have become a standard technology. In these
                 systems, users write programs in restricted dataflow
                 programming models, such as MapReduce, which enable
                 them to scale out program execution to a shared-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "199",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Khan:2022:TVS,
  author =       "Salman Khan and Muzammal Naseer and Munawar Hayat and
                 Syed Waqas Zamir and Fahad Shahbaz Khan and Mubarak
                 Shah",
  title =        "Transformers in Vision: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "200:1--200:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3505244",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3505244",
  abstract =     "Astounding results from Transformer models on natural
                 language tasks have intrigued the vision community to
                 study their application to computer vision problems.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "200",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nanfack:2022:CED,
  author =       "G{\'e}raldin Nanfack and Paul Temple and Beno{\^\i}t
                 Fr{\'e}nay",
  title =        "Constraint Enforcement on Decision Trees: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "201:1--201:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3506734",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3506734",
  abstract =     "Decision trees have the particularity of being machine
                 learning models that are visually easy to interpret and
                 understand. Therefore, they are primarily suited for
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "201",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dao:2022:CSL,
  author =       "Nhu-Ngoc Dao and Anh-Tien Tran and Ngo Hoang Tu and
                 Tran Thien Thanh and Vo Nguyen Quoc Bao and Sungrae
                 Cho",
  title =        "A Contemporary Survey on Live Video Streaming from a
                 Computation-Driven Perspective",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "202:1--202:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3519552",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3519552",
  abstract =     "Live video streaming services have experienced
                 significant growth since the emergence of social
                 networking paradigms in recent years. In this scenario,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "202",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Messina:2022:SDL,
  author =       "Pablo Messina and Pablo Pino and Denis Parra and
                 Alvaro Soto and Cecilia Besa and Sergio Uribe and
                 Marcelo And{\'{\i}}a and Cristian Tejos and Claudia
                 Prieto and Daniel Capurro",
  title =        "A Survey on Deep Learning and Explainability for
                 Automatic Report Generation from Medical Images",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "203:1--203:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3522747",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3522747",
  abstract =     "Every year physicians face an increasing demand of
                 image-based diagnosis from patients, a problem that can
                 be addressed with recent artificial intelligence
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "203",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gruetzemacher:2022:DTL,
  author =       "Ross Gruetzemacher and David Paradice",
  title =        "Deep Transfer Learning \& Beyond: Transformer Language
                 Models in Information Systems Research",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "204:1--204:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3505245",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3505245",
  abstract =     "AI is widely thought to be poised to transform
                 business, yet current perceptions of the scope of this
                 transformation may be myopic. Recent progress in
                 natural \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "204",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ward:2022:PTG,
  author =       "Isaac Ronald Ward and Jack Joyner and Casey Lickfold
                 and Yulan Guo and Mohammed Bennamoun",
  title =        "A Practical Tutorial on Graph Neural Networks",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "205:1--205:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3503043",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3503043",
  abstract =     "Graph neural networks (GNNs) have recently grown in
                 popularity in the field of artificial intelligence (AI)
                 due to their unique ability to ingest relatively
                 unstructured \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "205",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yang:2022:SDL,
  author =       "Yanming Yang and Xin Xia and David Lo and John
                 Grundy",
  title =        "A Survey on Deep Learning for Software Engineering",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "206:1--206:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3505243",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3505243",
  abstract =     "In 2006, Geoffrey Hinton proposed the concept of
                 training ``Deep Neural Networks (DNNs)'' and an
                 improved model training method to break the bottleneck
                 of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "206",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhao:2022:SDP,
  author =       "Ying Zhao and Jinjun Chen",
  title =        "A Survey on Differential Privacy for Unstructured Data
                 Content",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "207:1--207:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3490237",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3490237",
  abstract =     "Huge amounts of unstructured data including image,
                 video, audio, and text are ubiquitously generated and
                 shared, and it is a challenge to protect sensitive
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "207",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bansal:2022:SRD,
  author =       "Ms. Aayushi Bansal and Dr. Rewa Sharma and Dr. Mamta
                 Kathuria",
  title =        "A Systematic Review on Data Scarcity Problem in Deep
                 Learning: Solution and Applications",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "208:1--208:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3502287",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3502287",
  abstract =     "Recent advancements in deep learning architecture have
                 increased its utility in real-life applications. Deep
                 learning models require a large amount of data to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "208",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2022:BBP,
  author =       "Xin Wang and Sisi Duan and James Clavin and Haibin
                 Zhang",
  title =        "{BFT} in Blockchains: From Protocols to Use Cases",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "209:1--209:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3503042",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3503042",
  abstract =     "A blockchain is a distributed system that achieves
                 strong security guarantees in storing, managing, and
                 processing data. All blockchains achieve a common
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "209",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Schlett:2022:FIQ,
  author =       "Torsten Schlett and Christian Rathgeb and Olaf
                 Henniger and Javier Galbally and Julian Fierrez and
                 Christoph Busch",
  title =        "Face Image Quality Assessment: a Literature Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "210:1--210:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3507901",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3507901",
  abstract =     "The performance of face analysis and recognition
                 systems depends on the quality of the acquired face
                 data, which is influenced by numerous factors.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "210",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yadav:2022:SOT,
  author =       "Vijay Kumar Yadav and Nitish Andola and Shekhar Verma
                 and S. Venkatesan",
  title =        "A Survey of Oblivious Transfer Protocol",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "211:1--211:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3503045",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3503045",
  abstract =     "Oblivious transfer (OT) protocol is an essential tool
                 in cryptography that provides a wide range of
                 applications such as secure multi-party computation,
                 private \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "211",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Du:2022:EEE,
  author =       "Hang Du and Hailin Shi and Dan Zeng and Xiao-Ping
                 Zhang and Tao Mei",
  title =        "The Elements of End-to-end Deep Face Recognition: a
                 Survey of Recent Advances",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "212:1--212:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3507902",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3507902",
  abstract =     "Face recognition (FR) is one of the most popular and
                 long-standing topics in computer vision. With the
                 recent development of deep learning \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "212",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{DosSantos:2022:AOS,
  author =       "Claudio Filipi Gon{\c{c}}alves {Dos Santos} and
                 Jo{\~a}o Paulo Papa",
  title =        "Avoiding Overfitting: a Survey on Regularization
                 Methods for Convolutional Neural Networks",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "213:1--213:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3510413",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510413",
  abstract =     "Several image processing tasks, such as image
                 classification and object detection, have been
                 significantly improved using Convolutional Neural
                 Networks \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "213",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Junior:2022:DTT,
  author =       "Misael C. J{\'u}nior and Domenico Amalfitano and Lina
                 Garc{\'e}s and Anna Rita Fasolino and Stev{\~a}o A.
                 Andrade and M{\'a}rcio Delamaro",
  title =        "Dynamic Testing Techniques of Non-functional
                 Requirements in Mobile Apps: a Systematic Mapping
                 Study",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "214:1--214:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3507903",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3507903",
  abstract =     "Context: The mobile app market is continually growing
                 offering solutions to almost all aspects of people's
                 lives, e.g., healthcare, business, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "214",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Churchill:2022:ETM,
  author =       "Rob Churchill and Lisa Singh",
  title =        "The Evolution of Topic Modeling",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "215:1--215:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3507900",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3507900",
  abstract =     "Topic models have been applied to everything from
                 books to newspapers to social media posts in an effort
                 to identify the most prevalent themes of a text
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "215",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Martin:2022:MVS,
  author =       "Daniel Martin and Sandra Malpica and Diego Gutierrez
                 and Belen Masia and Ana Serrano",
  title =        "Multimodality in {VR}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "216:1--216:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3508361",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3508361",
  abstract =     "Virtual reality (VR) is rapidly growing, with the
                 potential to change the way we create and consume
                 content. In VR, users integrate multimodal sensory
                 information \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "216",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhong:2022:MLB,
  author =       "Zhiheng Zhong and Minxian Xu and Maria Alejandra
                 Rodriguez and Chengzhong Xu and Rajkumar Buyya",
  title =        "Machine Learning-based Orchestration of Containers: a
                 Taxonomy and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "217:1--217:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3510415",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510415",
  abstract =     "Containerization is a lightweight application
                 virtualization technology, providing high environmental
                 consistency, operating system distribution portability,
                 and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "217",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zafar:2022:CCA,
  author =       "Farkhanda Zafar and Hasan Ali Khattak and Moayad
                 Aloqaily and Rasheed Hussain",
  title =        "Carpooling in Connected and Autonomous Vehicles:
                 Current Solutions and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "218:1--218:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3501295",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3501295",
  abstract =     "Owing to the advancements in communication and
                 computation technologies, the dream of commercialized
                 connected and autonomous cars is \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "218",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alam:2022:SST,
  author =       "Md Mahbub Alam and Luis Torgo and Albert Bifet",
  title =        "A Survey on Spatio-temporal Data Analytics Systems",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "219:1--219:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3507904",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3507904",
  abstract =     "Due to the surge of spatio-temporal data volume, the
                 popularity of location-based services and applications,
                 and the importance of extracted \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "219",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2022:SCS,
  author =       "Zijun Li and Linsong Guo and Jiagan Cheng and Quan
                 Chen and Bingsheng He and Minyi Guo",
  title =        "The Serverless Computing Survey: a Technical Primer
                 for Design Architecture",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "220:1--220:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3508360",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3508360",
  abstract =     "The development of cloud infrastructures inspires the
                 emergence of cloud-native computing. As the most
                 promising architecture for deploying \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "220",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2022:SAD,
  author =       "Peng Liu and Lizhe Wang and Rajiv Ranjan and Guojin He
                 and Lei Zhao",
  title =        "A Survey on Active Deep Learning: From Model Driven to
                 Data Driven",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "10s",
  pages =        "221:1--221:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3510414",
  bibdate =      "Thu Mar 23 11:02:53 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510414",
  abstract =     "Which samples should be labelled in a large dataset is
                 one of the most important problems for the training of
                 deep learning. So far, a variety of active sample
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "221",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mampage:2022:HVR,
  author =       "Anupama Mampage and Shanika Karunasekera and Rajkumar
                 Buyya",
  title =        "A Holistic View on Resource Management in Serverless
                 Computing Environments: Taxonomy and Future
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "222:1--222:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3510412",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510412",
  abstract =     "Serverless computing has emerged as an attractive
                 deployment option for cloud applications in recent
                 times. The unique features of this computing model
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "222",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sanchez:2022:PIR,
  author =       "Pablo S{\'a}nchez and Alejandro Bellog{\'\i}n",
  title =        "Point-of-Interest Recommender Systems Based on
                 Location-Based Social Networks: a Survey from an
                 Experimental Perspective",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "223:1--223:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3510409",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510409",
  abstract =     "Point-of-Interest recommendation is an area of
                 increasing research and development interest within the
                 widely adopted technologies known as \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "223",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Delgado-Santos:2022:SPV,
  author =       "Paula Delgado-Santos and Giuseppe Stragapede and Ruben
                 Tolosana and Richard Guest and Farzin Deravi and Ruben
                 Vera-Rodriguez",
  title =        "A Survey of Privacy Vulnerabilities of Mobile Device
                 Sensors",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "224:1--224:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3510579",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510579",
  abstract =     "The number of mobile devices, such as smartphones and
                 smartwatches, is relentlessly increasing, to almost 6.8
                 billion by 2022, and along with it, the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "224",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Witharana:2022:SAB,
  author =       "Hasini Witharana and Yangdi Lyu and Subodha Charles
                 and Prabhat Mishra",
  title =        "A Survey on Assertion-based Hardware Verification",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "225:1--225:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3510578",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510578",
  abstract =     "Hardware verification of modern electronic systems has
                 been identified as a major bottleneck due to the
                 increasing complexity and time-to-market constraints.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "225",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fagerholm:2022:CSE,
  author =       "Fabian Fagerholm and Michael Felderer and Davide Fucci
                 and Michael Unterkalmsteiner and Bogdan Marculescu and
                 Markus Martini and Lars G{\"o}ran Wallgren Tengberg and
                 Robert Feldt and Bettina Lehtel{\"a} and Bal{\'a}zs
                 Nagyv{\'a}radi and Jehan Khattak",
  title =        "Cognition in Software Engineering: a Taxonomy and
                 Survey of a Half-Century of Research",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "226:1--226:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3508359",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3508359",
  abstract =     "Cognition plays a fundamental role in most software
                 engineering activities. This article provides a
                 taxonomy of cognitive concepts and a survey of the
                 literature since \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "226",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yu:2022:SKE,
  author =       "Wenhao Yu and Chenguang Zhu and Zaitang Li and Zhiting
                 Hu and Qingyun Wang and Heng Ji and Meng Jiang",
  title =        "A Survey of Knowledge-enhanced Text Generation",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "227:1--227:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3512467",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3512467",
  abstract =     "The goal of text-to-text generation is to make
                 machines express like a human in many applications such
                 as conversation, summarization, and translation. It
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "227",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Korala:2022:STF,
  author =       "Harindu Korala and Dimitrios Georgakopoulos and Prem
                 Prakash Jayaraman and Ali Yavari",
  title =        "A Survey of Techniques for Fulfilling the Time-Bound
                 Requirements of Time-Sensitive {IoT} Applications",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "228:1--228:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3510411",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510411",
  abstract =     "This article surveys existing techniques for meeting
                 the time-bound requirements of time-sensitive
                 applications in the Internet of Things (IoT). To
                 provide the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "228",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kayan:2022:CIC,
  author =       "Hakan Kayan and Matthew Nunes and Omer Rana and Pete
                 Burnap and Charith Perera",
  title =        "Cybersecurity of Industrial Cyber-Physical Systems: a
                 Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "229:1--229:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3510410",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510410",
  abstract =     "Industrial cyber-physical systems (ICPSs) manage
                 critical infrastructures by controlling the processes
                 based on the ``physics'' data gathered by edge sensor
                 networks. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "229",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhu:2022:FSR,
  author =       "Xiaogang Zhu and Sheng Wen and Seyit Camtepe and Yang
                 Xiang",
  title =        "Fuzzing: a Survey for Roadmap",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "230:1--230:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3512345",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3512345",
  abstract =     "Fuzz testing (fuzzing) has witnessed its prosperity in
                 detecting security flaws recently. It generates a large
                 number of test cases and monitors the executions
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "230",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zadnik:2022:IVC,
  author =       "Jakub {\v{Z}}{\'a}dn{\'{\i}}k and Markku M{\"a}kitalo
                 and Jarno Vanne and Pekka J{\"a}{\"a}skel{\"a}inen",
  title =        "Image and Video Coding Techniques for Ultra-low
                 Latency",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "231:1--231:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3512342",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3512342",
  abstract =     "The next generation of wireless networks fosters the
                 adoption of latency-critical applications such as XR,
                 connected industry, or autonomous driving. This
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "231",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chandramouli:2022:SPS,
  author =       "Anirudh Chandramouli and Ashish Choudhury and Arpita
                 Patra",
  title =        "A Survey on Perfectly Secure Verifiable
                 Secret-sharing",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "232:1--232:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3512344",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3512344",
  abstract =     "Verifiable Secret-Sharing (VSS) is a fundamental
                 primitive in secure distributed computing. It is used
                 as a building block in several distributed computing
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "232",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jamil:2022:RAT,
  author =       "Bushra Jamil and Humaira Ijaz and Mohammad Shojafar
                 and Kashif Munir and Rajkumar Buyya",
  title =        "Resource Allocation and Task Scheduling in Fog
                 Computing and {Internet} of Everything Environments: a
                 Taxonomy, Review, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "233:1--233:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3513002",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3513002",
  abstract =     "The Internet of Everything paradigm is being rapidly
                 adopted in developing applications for different
                 domains like smart agriculture, smart city, big data
                 streaming, and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "233",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mittal:2022:AAB,
  author =       "Ajay Mittal and Sabrina Dhalla and Savita Gupta and
                 Aastha Gupta",
  title =        "Automated Analysis of Blood Smear Images for Leukemia
                 Detection: a Comprehensive Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "234:1--234:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3514495",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3514495",
  abstract =     "Leukemia, the malignancy of blood-forming tissues,
                 becomes fatal if not detected in the early stages. It
                 is detected through a blood smear test that involves
                 the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "234",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hu:2022:MIA,
  author =       "Hongsheng Hu and Zoran Salcic and Lichao Sun and
                 Gillian Dobbie and Philip S. Yu and Xuyun Zhang",
  title =        "Membership Inference Attacks on Machine Learning: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "235:1--235:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3523273",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3523273",
  abstract =     "Machine learning (ML) models have been widely applied
                 to various applications, including image
                 classification, text generation, audio recognition, and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "235",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Muralidhar:2022:EEC,
  author =       "Rajeev Muralidhar and Renata Borovica-Gajic and
                 Rajkumar Buyya",
  title =        "Energy Efficient Computing Systems: Architectures,
                 Abstractions and Modeling to Techniques and Standards",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "236:1--236:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3511094",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3511094",
  abstract =     "Computing systems have undergone a tremendous change
                 in the last few decades with several inflexion points.
                 While Moore's law guided the semiconductor \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "236",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cardellini:2022:RAD,
  author =       "Valeria Cardellini and Francesco {Lo Presti} and
                 Matteo Nardelli and Gabriele {Russo Russo}",
  title =        "Runtime Adaptation of Data Stream Processing Systems:
                 The State of the Art",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "237:1--237:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3514496",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3514496",
  abstract =     "Data stream processing (DSP) has emerged over the
                 years as the reference paradigm for the analysis of
                 continuous and fast information flows, which often
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "237",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Oz:2022:SRE,
  author =       "Harun Oz and Ahmet Aris and Albert Levi and A. Selcuk
                 Uluagac",
  title =        "A Survey on Ransomware: Evolution, Taxonomy, and
                 Defense Solutions",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "238:1--238:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3514229",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3514229",
  abstract =     "In recent years, ransomware has been one of the most
                 notorious malware targeting end-users, governments, and
                 business organizations. It has become a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "238",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Shafiei:2022:SCS,
  author =       "Hossein Shafiei and Ahmad Khonsari and Payam Mousavi",
  title =        "Serverless Computing: a Survey of Opportunities,
                 Challenges, and Applications",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "239:1--239:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3510611",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510611",
  abstract =     "The emerging serverless computing paradigm has
                 attracted attention from both academia and industry.
                 This paradigm brings benefits such as less operational
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "239",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Suhail:2022:BBD,
  author =       "Sabah Suhail and Rasheed Hussain and Raja Jurdak and
                 Alma Oracevic and Khaled Salah and Choong Seon Hong and
                 Raimundas Matulevi{\v{c}}ius",
  title =        "Blockchain-Based Digital Twins: Research Trends,
                 Issues, and Future Challenges",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "240:1--240:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3517189",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3517189",
  abstract =     "Industrial processes rely on sensory data for
                 decision-making processes, risk assessment, and
                 performance evaluation. Extracting actionable insights
                 from the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "240",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ribeiro:2022:LVS,
  author =       "Matheus A. O. Ribeiro and F{\'a}tima L. S. Nunes",
  title =        "Left Ventricle Segmentation in Cardiac {MR}: a
                 Systematic Mapping of the Past Decade",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "241:1--241:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3517190",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3517190",
  abstract =     "Left ventricle segmentation in short-axis cardiac
                 magnetic resonance images is important to diagnose
                 heart disease. However, repetitive manual \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "241",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Antonelli:2022:FSO,
  author =       "Simone Antonelli and Danilo Avola and Luigi Cinque and
                 Donato Crisostomi and Gian Luca Foresti and Fabio
                 Galasso and Marco Raoul Marini and Alessio Mecca and
                 Daniele Pannone",
  title =        "Few-Shot Object Detection: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "242:1--242:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3519022",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3519022",
  abstract =     "Deep learning approaches have recently raised the bar
                 in many fields, from Natural Language Processing to
                 Computer Vision, by leveraging large amounts of data.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "242",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2022:STL,
  author =       "Shengmei Liu and Xiaokun Xu and Mark Claypool",
  title =        "A Survey and Taxonomy of Latency Compensation
                 Techniques for Network Computer Games",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "11s",
  pages =        "243:1--243:??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3519023",
  bibdate =      "Thu Mar 23 11:02:54 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3519023",
  abstract =     "Computer games, one of the most popular forms of
                 entertainment in the world, are increasingly online
                 multiplayer, connecting geographically dispersed
                 players in \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "243",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Qi:2023:SOM,
  author =       "Shuren Qi and Yushu Zhang and Chao Wang and Jiantao
                 Zhou and Xiaochun Cao",
  title =        "A Survey of Orthogonal Moments for Image
                 Representation: Theory, Implementation, and
                 Evaluation",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "1:1--1:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3479428",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3479428",
  abstract =     "Image representation is an important topic in computer
                 vision and pattern recognition. It plays a fundamental
                 role in a range of applications toward understanding
                 visual contents. Moment-based image representation has
                 been reported to be effective in \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sarwar:2023:SPP,
  author =       "Kinza Sarwar and Sira Yongchareon and Jian Yu and
                 Saeed Ur Rehman",
  title =        "A Survey on Privacy Preservation in Fog-Enabled
                 {Internet of Things}",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "2:1--2:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3474554",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3474554",
  abstract =     "Despite the rapid growth and advancement in the
                 Internet of Things (IoT), there are critical challenges
                 that need to be addressed before the full adoption of
                 the IoT. Data privacy is one of the hurdles towards the
                 adoption of IoT as there might be \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cicala:2023:PFA,
  author =       "Fabrizio Cicala and Weicheng Wang and Tianhao Wang and
                 Ninghui Li and Elisa Bertino and Faming Liang and Yang
                 Yang",
  title =        "{PURE}: a Framework for Analyzing Proximity-based
                 Contact Tracing Protocols",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "3:1--3:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485131",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485131",
  abstract =     "Many proximity-based tracing (PCT) protocols have been
                 proposed and deployed to combat the spreading of
                 COVID-19. In this article, we take a systematic
                 approach to analyze PCT protocols. We identify a list
                 of desired properties of a contact tracing design
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Meneguette:2023:VEC,
  author =       "Rodolfo Meneguette and Robson {De Grande} and Jo
                 Ueyama and Geraldo P. Rocha Filho and Edmundo Madeira",
  title =        "Vehicular Edge Computing: Architecture, Resource
                 Management, Security, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "4:1--4:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485129",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485129",
  abstract =     "Vehicular Edge Computing (VEC), based on the Edge
                 Computing motivation and fundamentals, is a promising
                 technology supporting Intelligent Transport Systems
                 services, smart city applications, and urban computing.
                 VEC can provide and manage computational \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yu:2023:RLH,
  author =       "Chao Yu and Jiming Liu and Shamim Nemati and Guosheng
                 Yin",
  title =        "Reinforcement Learning in Healthcare: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "5:1--5:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3477600",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477600",
  abstract =     "As a subfield of machine learning, reinforcement
                 learning (RL) aims at optimizing decision making by
                 using interaction samples of an agent with its
                 environment and the potentially delayed feedbacks. In
                 contrast to traditional supervised learning that
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xu:2023:UPD,
  author =       "Fan Xu and Victor S. Sheng and Mingwen Wang",
  title =        "A Unified Perspective for Disinformation Detection and
                 Truth Discovery in Social Sensing: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "6:1--6:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3477138",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477138",
  abstract =     "With the proliferation of social sensing, large
                 amounts of observation are contributed by people or
                 devices. However, these observations contain
                 disinformation. Disinformation can propagate across
                 online social networks at a relatively low cost, but
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Luca:2023:SDL,
  author =       "Massimiliano Luca and Gianni Barlacchi and Bruno Lepri
                 and Luca Pappalardo",
  title =        "A Survey on Deep Learning for Human Mobility",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "7:1--7:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485125",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485125",
  abstract =     "The study of human mobility is crucial due to its
                 impact on several aspects of our society, such as
                 disease spreading, urban planning, well-being,
                 pollution, and more. The proliferation of digital
                 mobility data, such as phone records, GPS traces, and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Machado:2023:AML,
  author =       "Gabriel Resende Machado and Eug{\^e}nio Silva and
                 Ronaldo Ribeiro Goldschmidt",
  title =        "Adversarial Machine Learning in Image Classification:
                 a Survey Toward the Defender's Perspective",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "8:1--8:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485133",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485133",
  abstract =     "Deep Learning algorithms have achieved
                 state-of-the-art performance for Image Classification.
                 For this reason, they have been used even in
                 security-critical applications, such as biometric
                 recognition systems and self-driving cars. However,
                 recent works \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hazra:2023:CSI,
  author =       "Abhishek Hazra and Mainak Adhikari and Tarachand
                 Amgoth and Satish Narayana Srirama",
  title =        "A Comprehensive Survey on Interoperability for {IIoT}:
                 Taxonomy, Standards, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "9:1--9:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485130",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485130",
  abstract =     "In the era of Industry 4.0, the Internet-of-Things
                 (IoT) performs the driving position analogous to the
                 initial industrial metamorphosis. IoT affords the
                 potential to couple machine-to-machine
                 intercommunication and real-time information-gathering
                 within \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Barros:2023:SED,
  author =       "Claudio D. T. Barros and Matheus R. F. Mendon{\c{c}}a
                 and Alex B. Vieira and Artur Ziviani",
  title =        "A Survey on Embedding Dynamic Graphs",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "10:1--10:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3483595",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3483595",
  abstract =     "Embedding static graphs in low-dimensional vector
                 spaces plays a key role in network analytics and
                 inference, supporting applications like node
                 classification, link prediction, and graph
                 visualization. However, many real-world networks
                 present dynamic \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rosenfeld:2023:QPH,
  author =       "Viktor Rosenfeld and Sebastian Bre{\ss} and Volker
                 Markl",
  title =        "Query Processing on Heterogeneous {CPU\slash GPU}
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "11:1--11:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485126",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485126",
  abstract =     "Due to their high computational power and internal
                 memory bandwidth, graphic processing units (GPUs) have
                 been extensively studied by the database systems
                 research community. A heterogeneous query processing
                 system that employs CPUs and GPUs at the same
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bekoulis:2023:RFE,
  author =       "Giannis Bekoulis and Christina Papagiannopoulou and
                 Nikos Deligiannis",
  title =        "A Review on Fact Extraction and Verification",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "12:1--12:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485127",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485127",
  abstract =     "We study the fact-checking problem, which aims to
                 identify the veracity of a given claim. Specifically,
                 we focus on the task of Fact Extraction and
                 VERification (FEVER) and its accompanied dataset. The
                 task consists of the subtasks of retrieving the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jiang:2023:DLB,
  author =       "Junjun Jiang and Chenyang Wang and Xianming Liu and
                 Jiayi Ma",
  title =        "Deep Learning-based Face Super-resolution: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "13:1--13:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485132",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485132",
  abstract =     "Face super-resolution (FSR), also known as face
                 hallucination, which is aimed at enhancing the
                 resolution of low-resolution (LR) face images to
                 generate high-resolution face images, is a
                 domain-specific image super-resolution problem.
                 Recently, FSR has \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ge:2023:NNB,
  author =       "Wenbo Ge and Pooia Lalbakhsh and Leigh Isai and Artem
                 Lenskiy and Hanna Suominen",
  title =        "Neural Network-Based Financial Volatility Forecasting:
                 a Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "14:1--14:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3483596",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3483596",
  abstract =     "Volatility forecasting is an important aspect of
                 finance as it dictates many decisions of market
                 players. A snapshot of state-of-the-art neural
                 network-based financial volatility forecasting was
                 generated by examining 35 studies, published after
                 2015. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2023:ARA,
  author =       "Deqiang Li and Qianmu Li and Yanfang (Fanny) Ye and
                 Shouhuai Xu",
  title =        "Arms Race in Adversarial Malware Detection: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "15:1--15:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3484491",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3484491",
  abstract =     "Malicious software (malware) is a major cyber threat
                 that has to be tackled with Machine Learning (ML)
                 techniques because millions of new malware examples are
                 injected into cyberspace on a daily basis. However, ML
                 is vulnerable to attacks known as \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Amadini:2023:SSC,
  author =       "Roberto Amadini",
  title =        "A Survey on String Constraint Solving",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "16:1--16:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3484198",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3484198",
  abstract =     "String constraint solving refers to solving
                 combinatorial problems involving constraints over
                 string variables. String solving approaches have become
                 popular over the past few years given the massive use
                 of strings in different application domains like
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Brant:2023:COP,
  author =       "Christopher Brant and Prakash Shrestha and Benjamin
                 Mixon-Baca and Kejun Chen and Said Varlioglu and Nelly
                 Elsayed and Yier Jin and Jedidiah Crandall and Daniela
                 Oliveira",
  title =        "Challenges and Opportunities for Practical and
                 Effective Dynamic Information Flow Tracking",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "17:1--17:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3483790",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3483790",
  abstract =     "Information flow tracking was proposed more than 40
                 years ago to address the limitations of access control
                 mechanisms to guarantee the confidentiality and
                 integrity of information flowing within a system, but
                 has not yet been widely applied in practice \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Blanco:2023:SVA,
  author =       "Alison Fernandez Blanco and Alexandre Bergel and Juan
                 Pablo Sandoval Alcocer",
  title =        "Software Visualizations to Analyze Memory Consumption:
                 a Literature Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "18:1--18:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485134",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485134",
  abstract =     "Understanding and optimizing memory usage of software
                 applications is a difficult task, usually involving the
                 analysis of large amounts of memory-related complex
                 data. Over the years, numerous software visualizations
                 have been proposed to help developers \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alrabaee:2023:SBC,
  author =       "Saed Alrabaee and Mourad Debbabi and Lingyu Wang",
  title =        "A Survey of Binary Code Fingerprinting Approaches:
                 Taxonomy, Methodologies, and Features",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "19:1--19:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3486860",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3486860",
  abstract =     "Binary code fingerprinting is crucial in many security
                 applications. Examples include malware detection,
                 software infringement, vulnerability analysis, and
                 digital forensics. It is also useful for security
                 researchers and reverse engineers since it \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hu:2023:AIS,
  author =       "Yupeng Hu and Wenxin Kuang and Zheng Qin and Kenli Li
                 and Jiliang Zhang and Yansong Gao and Wenjia Li and
                 Keqin Li",
  title =        "Artificial Intelligence Security: Threats and
                 Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "20:1--20:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3487890",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3487890",
  abstract =     "In recent years, with rapid technological advancement
                 in both computing hardware and algorithm, Artificial
                 Intelligence (AI) has demonstrated significant
                 advantage over human being in a wide range of fields,
                 such as image recognition, education, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rugo:2023:SRU,
  author =       "Alessio Rugo and Claudio A. Ardagna and Nabil {El
                 Ioini}",
  title =        "A Security Review in the {UAVNet} Era: Threats,
                 Countermeasures, and Gap Analysis",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "21:1--21:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485272",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485272",
  abstract =     "Unmanned Aerial Vehicles (UAVs) are becoming one of
                 the main technological supports for commercial
                 applications, embracing many domains ranging from human
                 safety to the medical field, agriculture and
                 environment, multimedia production, and even commercial
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2023:CDI,
  author =       "Huacheng Li and Chunhe Xia and Tianbo Wang and Sheng
                 Wen and Chao Chen and Yang Xiang",
  title =        "Capturing Dynamics of Information Diffusion in {SNS}:
                 a Survey of Methodology and Techniques",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "22:1--22:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485273",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485273",
  abstract =     "Studying information diffusion in SNS (Social Networks
                 Service) has remarkable significance in both academia
                 and industry. Theoretically, it boosts the development
                 of other subjects such as statistics, sociology, and
                 data mining. Practically, diffusion \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nguyen:2023:CTD,
  author =       "Thanh Tuan Nguyen and Thanh Phuong Nguyen",
  title =        "A Comprehensive Taxonomy of Dynamic Texture
                 Representation",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "1",
  pages =        "23:1--23:??",
  month =        jan,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3487892",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3487892",
  abstract =     "Representing dynamic textures (DTs) plays an important
                 role in many real implementations in the computer
                 vision community. Due to the turbulent and
                 non-directional motions of DTs along with the negative
                 impacts of different factors (e.g., environmental
                 \ldots{})",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ciccozzi:2023:CEL,
  author =       "Federico Ciccozzi and Lorenzo Addazi and Sara
                 Abbaspour Asadollah and Bj{\"o}rn Lisper and Abu Naser
                 Masud and Saad Mubeen",
  title =        "A Comprehensive Exploration of Languages for Parallel
                 Computing",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "24:1--24:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485008",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485008",
  abstract =     "Software-intensive systems in most domains, from
                 autonomous vehicles to health, are becoming
                 predominantly parallel to efficiently manage large
                 amount of data in short (even real-) time. There is an
                 incredibly rich literature on languages for parallel
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lai:2023:SGB,
  author =       "Zhao-Rong Lai and Haisheng Yang",
  title =        "A Survey on Gaps between Mean-Variance Approach and
                 Exponential Growth Rate Approach for Portfolio
                 Optimization",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "25:1--25:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485274",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485274",
  abstract =     "Portfolio optimization can be roughly categorized as
                 the mean-variance approach and the exponential growth
                 rate approach based on different theoretical
                 foundations, trading logics, optimization objectives,
                 and methodologies. The former and the latter are
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sai:2023:SEM,
  author =       "Ananya B. Sai and Akash Kumar Mohankumar and Mitesh M.
                 Khapra",
  title =        "A Survey of Evaluation Metrics Used for {NLG}
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "26:1--26:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485766",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485766",
  abstract =     "In the last few years, a large number of automatic
                 evaluation metrics have been proposed for evaluating
                 Natural Language Generation (NLG) systems. The rapid
                 development and adoption of such automatic evaluation
                 metrics in a relatively short time has \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Khan:2023:LAD,
  author =       "Manzoor Ahmed Khan and Hesham {El Sayed} and Sumbal
                 Malik and Talha Zia and Jalal Khan and Najla Alkaabi
                 and Henry Ignatious",
  title =        "Level-5 Autonomous Driving-Are We There Yet? {A}
                 Review of Research Literature",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "27:1--27:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485767",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485767",
  abstract =     "Autonomous vehicles are revolutionizing transport and
                 next-generation autonomous mobility. Such vehicles are
                 promising to increase road safety, improve traffic
                 efficiency, reduce vehicle emission, and improve
                 mobility. However, for these vehicles to live
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Adeleke:2023:NTG,
  author =       "Oluwamayowa Ade Adeleke and Nicholas Bastin and Deniz
                 Gurkan",
  title =        "Network Traffic Generation: a Survey and Methodology",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "28:1--28:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3488375",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3488375",
  abstract =     "Network traffic workloads are widely utilized in
                 applied research to verify correctness and to measure
                 the impact of novel algorithms, protocols, and network
                 functions. We provide a comprehensive survey of traffic
                 generators referenced by researchers over \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Costa:2023:OFC,
  author =       "Breno Costa and Joao Bachiega and Leonardo
                 Rebou{\c{c}}as de Carvalho and Aleteia P. F. Araujo",
  title =        "Orchestration in Fog Computing: a Comprehensive
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "29:1--29:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3486221",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3486221",
  abstract =     "Fog computing is a paradigm that brings computational
                 resources and services to the network edge in the
                 vicinity of user devices, lowering latency and
                 connecting with cloud computing resources. Unlike cloud
                 computing, fog resources are based on \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Aldausari:2023:VGA,
  author =       "Nuha Aldausari and Arcot Sowmya and Nadine Marcus and
                 Gelareh Mohammadi",
  title =        "Video Generative Adversarial Networks: a Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "30:1--30:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3487891",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3487891",
  abstract =     "With the increasing interest in the content creation
                 field in multiple sectors such as media, education, and
                 entertainment, there is an increased trend in the
                 papers that use AI algorithms to generate content such
                 as images, videos, audio, and text. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Deng:2023:SRT,
  author =       "Libing Deng and Guoqi Xie and Hong Liu and Yunbo Han
                 and Renfa Li and Keqin Li",
  title =        "A Survey of Real-Time {Ethernet} Modeling and Design
                 Methodologies: From {AVB} to {TSN}",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "31:1--31:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3487330",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3487330",
  abstract =     "With the development of real-time critical systems,
                 the ever-increasing communication data traffic puts
                 forward high-bandwidth and low-delay requirements for
                 communication networks. Therefore, various real-time
                 Ethernet protocols have been proposed, but \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hasan:2023:PPR,
  author =       "Omar Hasan and Lionel Brunie and Elisa Bertino",
  title =        "Privacy-Preserving Reputation Systems Based on
                 Blockchain and Other Cryptographic Building Blocks: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "32:1--32:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3490236",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3490236",
  abstract =     "The purpose of a reputation system is to hold the
                 users of a distributed application accountable for
                 their behavior. The reputation of a user is computed as
                 an aggregate of the feedback provided by fellow users
                 in the system. Truthful feedback is clearly \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sarwar:2023:SUE,
  author =       "Tabinda Sarwar and Sattar Seifollahi and Jeffrey Chan
                 and Xiuzhen Zhang and Vural Aksakalli and Irene Hudson
                 and Karin Verspoor and Lawrence Cavedon",
  title =        "The Secondary Use of Electronic Health Records for
                 Data Mining: Data Characteristics and Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "33:1--33:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3490234",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3490234",
  abstract =     "The primary objective of implementing Electronic
                 Health Records (EHRs) is to improve the management of
                 patients' health-related information. However, these
                 records have also been extensively used for the
                 secondary purpose of clinical research and to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{dosSantos:2023:GRB,
  author =       "Claudio Filipi Gon{\c{c}}alves dos Santos and Diego de
                 Souza Oliveira and Leandro A. Passos and Rafael
                 Gon{\c{c}}alves Pires and Daniel Felipe Silva Santos
                 and Lucas Pascotti Valem and Thierry P. Moreira and
                 Marcos Cleison S. Santana and Mateus Roder and Jo Paulo
                 Papa and Danilo Colombo",
  title =        "Gait Recognition Based on Deep Learning: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "34:1--34:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3490235",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3490235",
  abstract =     "In general, biometry-based control systems may not
                 rely on individual expected behavior or cooperation to
                 operate appropriately. Instead, such systems should be
                 aware of malicious procedures for unauthorized access
                 attempts. Some works available in the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jin:2023:BQA,
  author =       "Qiao Jin and Zheng Yuan and Guangzhi Xiong and Qianlan
                 Yu and Huaiyuan Ying and Chuanqi Tan and Mosha Chen and
                 Songfang Huang and Xiaozhong Liu and Sheng Yu",
  title =        "Biomedical Question Answering: a Survey of Approaches
                 and Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "35:1--35:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3490238",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3490238",
  abstract =     "Automatic Question Answering (QA) has been
                 successfully applied in various domains such as search
                 engines and chatbots. Biomedical QA (BQA), as an
                 emerging QA task, enables innovative applications to
                 effectively perceive, access, and understand complex
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xie:2023:SRC,
  author =       "Yiqun Xie and Shashi Shekhar and Yan Li",
  title =        "Statistically-Robust Clustering Techniques for Mapping
                 Spatial Hotspots: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "36:1--36:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3487893",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3487893",
  abstract =     "Mapping of spatial hotspots, i.e., regions with
                 significantly higher rates of generating cases of
                 certain events (e.g., disease or crime cases), is an
                 important task in diverse societal domains, including
                 public health, public safety, transportation,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alemany:2023:RPD,
  author =       "J. Alemany and E. {Del Val} and A.
                 Garc{\'\i}a-Fornes",
  title =        "A Review of Privacy Decision-making Mechanisms in
                 Online Social Networks",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "37:1--37:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3494067",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494067",
  abstract =     "Personal information of online social networks (OSNs)
                 is governed by the privacy policies chosen by users
                 besides OSN's policies. Users make these decisions
                 using privacy mechanisms, but privacy problems and
                 regrets are daily reported. This article \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhou:2023:NRL,
  author =       "Jingya Zhou and Ling Liu and Wenqi Wei and Jianxi
                 Fan",
  title =        "Network Representation Learning: From Preprocessing,
                 Feature Extraction to Node Embedding",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "38:1--38:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3491206",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3491206",
  abstract =     "Network representation learning (NRL) advances the
                 conventional graph mining of social networks, knowledge
                 graphs, and complex biomedical and physics information
                 networks. Dozens of NRL algorithms have been reported
                 in the literature. Most of them focus \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kaur:2023:TAI,
  author =       "Davinder Kaur and Suleyman Uslu and Kaley J.
                 Rittichier and Arjan Durresi",
  title =        "Trustworthy Artificial Intelligence: a Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "39:1--39:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3491209",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3491209",
  abstract =     "Artificial intelligence (AI) and algorithmic decision
                 making are having a profound impact on our daily lives.
                 These systems are vastly used in different high-stakes
                 applications like healthcare, business, government,
                 education, and justice, moving us \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fahy:2023:SLN,
  author =       "Conor Fahy and Shengxiang Yang and Mario Gongora",
  title =        "Scarcity of Labels in Non-Stationary Data Streams: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "40:1--40:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3494832",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494832",
  abstract =     "In a dynamic stream there is an assumption that the
                 underlying process generating the stream is
                 non-stationary and that concepts within the stream will
                 drift and change as the stream progresses. Concepts
                 learned by a classification model are prone to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fernandes:2023:SAU,
  author =       "Jos{\'e} Marcelo Fernandes and Jorge S{\'a} Silva and
                 Andr{\'e} Rodrigues and Fernando Boavida",
  title =        "A Survey of Approaches to Unobtrusive Sensing of
                 Humans",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "41:1--41:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3491208",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3491208",
  abstract =     "The increasing amount of human-related and/or
                 human-originated data in current systems is both an
                 opportunity and a challenge. Nevertheless, despite
                 relying on the processing of large amounts of data,
                 most of the so-called smart systems that we have
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rolnick:2023:TCC,
  author =       "David Rolnick and Priya L. Donti and Lynn H. Kaack and
                 Kelly Kochanski and Alexandre Lacoste and Kris Sankaran
                 and Andrew Slavin Ross and Nikola Milojevic-Dupont and
                 Natasha Jaques and Anna Waldman-Brown and Alexandra
                 Sasha Luccioni and Tegan Maharaj and Evan D. Sherwin
                 and S. Karthik Mukkavilli and Konrad P. Kording and
                 Carla P. Gomes and Andrew Y. Ng and Demis Hassabis and
                 John C. Platt and Felix Creutzig and Jennifer Chayes
                 and Yoshua Bengio",
  title =        "Tackling Climate Change with Machine Learning",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "42:1--42:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3485128",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485128",
  abstract =     "Climate change is one of the greatest challenges
                 facing humanity, and we, as machine learning (ML)
                 experts, may wonder how we can help. Here we describe
                 how ML can be a powerful tool in reducing greenhouse
                 gas emissions and helping society adapt to a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sharma:2023:CRM,
  author =       "Shallu Sharma and Pravat Kumar Mandal",
  title =        "A Comprehensive Report on Machine Learning-based Early
                 Detection of {Alzheimer}'s Disease using Multi-modal
                 Neuroimaging Data",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "43:1--43:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3492865",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3492865",
  abstract =     "Alzheimer's Disease (AD) is a devastating
                 neurodegenerative brain disorder with no cure. An early
                 identification helps patients with AD sustain a normal
                 living. We have outlined machine learning (ML)
                 methodologies with different schemes of feature
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bang:2023:ARA,
  author =       "Ankur O. Bang and Udai Pratap Rao and Pallavi Kaliyar
                 and Mauro Conti",
  title =        "Assessment of Routing Attacks and Mitigation
                 Techniques with {RPL} Control Messages: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "2",
  pages =        "44:1--44:??",
  month =        mar,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3494524",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494524",
  abstract =     "Routing Protocol for Low-Power and Lossy Networks
                 (RPL) is a standard routing protocol for the Low Power
                 and Lossy Networks (LLNs). It is a part of the IPv6
                 over Low-Power Wireless Personal Area Network (6LoWPAN)
                 protocol stack. Features such as energy-. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Anand:2023:ECC,
  author =       "Sanjay Kumar Anand and Suresh Kumar",
  title =        "Experimental Comparisons of Clustering Approaches for
                 Data Representation",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "45:1--45:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3490384",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3490384",
  abstract =     "Clustering approaches are extensively used by many
                 areas such as IR, Data Integration, Document
                 Classification, Web Mining, Query Processing, and many
                 other domains and disciplines. Nowadays, much
                 literature describes clustering algorithms on
                 multivariate \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alyahya:2023:SBS,
  author =       "Tasniem Nasser Alyahya and Mohamed {El Bachir Menai}
                 and Hassan Mathkour",
  title =        "On the Structure of the {Boolean} Satisfiability
                 Problem: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "46:1--46:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3491210",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3491210",
  abstract =     "The Boolean satisfiability problem (SAT) is a
                 fundamental NP-complete decision problem in automated
                 reasoning and mathematical logic. As evidenced by the
                 results of SAT competitions, the performance of SAT
                 solvers varies substantially between different
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{RobertoeSouza:2023:SDV,
  author =       "Marcos {Roberto e Souza} and Helena {de Almeida Maia}
                 and Helio Pedrini",
  title =        "Survey on Digital Video Stabilization: Concepts,
                 Methods, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "47:1--47:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3494525",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494525",
  abstract =     "Digital video stabilization is a challenging task that
                 aims to transform a potentially shaky video into a
                 pleasant one by smoothing the camera trajectory.
                 Despite the various works found in the literature
                 addressing this task, their organization and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Muske:2023:SAP,
  author =       "Tukaram Muske and Alexander Serebrenik",
  title =        "Survey of Approaches for Postprocessing of Static
                 Analysis Alarms",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "48:1--48:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3494521",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494521",
  abstract =     "Static analysis tools have showcased their importance
                 and usefulness in automated detection of defects.
                 However, the tools are known to generate a large number
                 of alarms which are warning messages to the user. The
                 large number of alarms and cost incurred \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hettiachchi:2023:STA,
  author =       "Danula Hettiachchi and Vassilis Kostakos and Jorge
                 Goncalves",
  title =        "A Survey on Task Assignment in Crowdsourcing",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "49:1--49:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3494522",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494522",
  abstract =     "Quality improvement methods are essential to gathering
                 high-quality crowdsourced data, both for research and
                 industry applications. A popular and broadly applicable
                 method is task assignment that dynamically adjusts
                 crowd workflow parameters. In this \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Singh:2023:TMS,
  author =       "Raj Mohan Singh and Lalit Kumar Awasthi and Geeta
                 Sikka",
  title =        "Towards Metaheuristic Scheduling Techniques in Cloud
                 and Fog: an Extensive Taxonomic Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "50:1--50:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3494520",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494520",
  abstract =     "Task scheduling is a critical issue in distributed
                 computing environments like cloud and fog. The
                 objective is to provide an optimal distribution of
                 tasks among the resources. Several research initiatives
                 to use metaheuristic techniques for finding near-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pessach:2023:RFM,
  author =       "Dana Pessach and Erez Shmueli",
  title =        "A Review on Fairness in Machine Learning",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "51:1--51:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3494672",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494672",
  abstract =     "An increasing number of decisions regarding the daily
                 lives of human beings are being controlled by
                 artificial intelligence and machine learning (ML)
                 algorithms in spheres ranging from healthcare,
                 transportation, and education to college admissions,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2023:LNT,
  author =       "Chenning Li and Zhichao Cao",
  title =        "{LoRa} Networking Techniques for Large-scale and
                 Long-term {IoT}: a Down-to-top Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "52:1--52:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3494673",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494673",
  abstract =     "Low-Power Wide-Area Networks (LPWANs) are an emerging
                 Internet-of-Things (IoT) paradigm, which caters to
                 large-scale and long-term sensory data collection
                 demand. Among the commercialized LPWAN technologies,
                 LoRa (Long Range) attracts much interest from
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Plopski:2023:EER,
  author =       "Alexander Plopski and Teresa Hirzle and Nahal Norouzi
                 and Long Qian and Gerd Bruder and Tobias Langlotz",
  title =        "The Eye in Extended Reality: a Survey on Gaze
                 Interaction and Eye Tracking in Head-worn Extended
                 Reality",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "53:1--53:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3491207",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3491207",
  abstract =     "With innovations in the field of gaze and eye
                 tracking, a new concentration of research in the area
                 of gaze-tracked systems and user interfaces has formed
                 in the field of Extended Reality (XR). Eye trackers are
                 being used to explore novel forms of spatial \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wu:2023:SML,
  author =       "Nan Wu and Yuan Xie",
  title =        "A Survey of Machine Learning for Computer Architecture
                 and Systems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "54:1--54:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3494523",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494523",
  abstract =     "It has been a long time that computer architecture and
                 systems are optimized for efficient execution of
                 machine learning (ML) models. Now, it is time to
                 reconsider the relationship between ML and systems and
                 let ML transform the way that computer \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Reisinger:2023:SPU,
  author =       "Thomas Reisinger and Isabel Wagner and Eerke Albert
                 Boiten",
  title =        "Security and Privacy in Unified Communication",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "55:1--55:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3498335",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3498335",
  abstract =     "The use of unified communication; video conferencing,
                 audio conferencing, and instant messaging has
                 skyrocketed during the COVID-19 pandemic. However,
                 security and privacy considerations have often been
                 neglected. This article provides a comprehensive
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2023:BOU,
  author =       "Ruiqi Li and Xiang Zhao and Marie-Francine Moens",
  title =        "A Brief Overview of Universal Sentence Representation
                 Methods: a Linguistic View",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "56:1--56:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3482853",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3482853",
  abstract =     "How to transfer the semantic information in a sentence
                 to a computable numerical embedding form is a
                 fundamental problem in natural language processing. An
                 informative universal sentence embedding can greatly
                 promote subsequent natural language processing
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2023:SDQ,
  author =       "Huan Li and Hua Lu and Christian S. Jensen and Bo Tang
                 and Muhammad Aamir Cheema",
  title =        "Spatial Data Quality in the {Internet of Things}:
                 Management, Exploitation, and Prospects",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "57:1--57:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3498338",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3498338",
  abstract =     "With the continued deployment of the Internet of
                 Things (IoT), increasing volumes of devices are being
                 deployed that emit massive spatially referenced data.
                 Due in part to the dynamic, decentralized, and
                 heterogeneous architecture of the IoT, the varying
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mahmoud:2023:ELA,
  author =       "Dina G. Mahmoud and Vincent Lenders and Mirjana
                 Stojilovi{\'c}",
  title =        "Electrical-Level Attacks on {CPUs}, {FPGAs}, and
                 {GPUs}: Survey and Implications in the Heterogeneous
                 Era",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "58:1--58:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3498337",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3498337",
  abstract =     "Given the need for efficient high-performance
                 computing, computer architectures combining central
                 processing units (CPUs), graphics processing units
                 (GPUs), and field-programmable gate arrays (FPGAs) are
                 currently prevalent. However, each of these \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Soldani:2023:ADF,
  author =       "Jacopo Soldani and Antonio Brogi",
  title =        "Anomaly Detection and Failure Root Cause Analysis in
                 (Micro) Service-Based Cloud Applications: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "59:1--59:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3501297",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3501297",
  abstract =     "The proliferation of services and service interactions
                 within microservices and cloud-native applications,
                 makes it harder to detect failures and to identify
                 their possible root causes, which is, on the other hand
                 crucial to promptly recover and fix \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nguyen:2023:FLS,
  author =       "Dinh C. Nguyen and Quoc-Viet Pham and Pubudu N.
                 Pathirana and Ming Ding and Aruna Seneviratne and
                 Zihuai Lin and Octavia Dobre and Won-Joo Hwang",
  title =        "Federated Learning for Smart Healthcare: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "60:1--60:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3501296",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3501296",
  abstract =     "Recent advances in communication technologies and the
                 Internet-of-Medical-Things (IOMT) have transformed
                 smart healthcare enabled by artificial intelligence
                 (AI). Traditionally, AI techniques require centralized
                 data collection and processing that may be \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Berenberg:2023:DAC,
  author =       "Anna Berenberg and Brad Calder",
  title =        "Deployment Archetypes for Cloud Applications",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "61:1--61:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3498336",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3498336",
  abstract =     "This is a survey article that explores six Cloud-based
                 deployment archetypes for Cloud applications and the
                 tradeoffs between them to achieve high availability,
                 low end-user latency, and acceptable costs. These are
                 (1) Zonal, (2) Regional, (3) Multi-. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gavrilut:2023:COO,
  author =       "Voica Gavrilut and Aleksander Pruski and Michael
                 St{\"u}bert Berger",
  title =        "Constructive or Optimized: an Overview of Strategies
                 to Design Networks for Time-Critical Applications",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "62:1--62:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3501294",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3501294",
  abstract =     "Distributed systems are pervasive nowadays, being
                 found in different areas, from smart toys to smart
                 factories. As the usage of such systems increases, so
                 does their complexity and design. Therefore, this work
                 aims to overview the methods for designing \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Barth:2023:UOP,
  author =       "Susanne Barth and Dan Ionita and Pieter Hartel",
  title =        "Understanding Online Privacy --- a Systematic Review
                 of Privacy Visualizations and Privacy by Design
                 Guidelines",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "63:1--63:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3502288",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3502288",
  abstract =     "Privacy visualizations help users understand the
                 privacy implications of using an online service.
                 Privacy by Design guidelines provide generally accepted
                 privacy standards for developers of online services. To
                 obtain a comprehensive understanding of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cao:2023:AFC,
  author =       "Longbing Cao",
  title =        "{AI} in Finance: Challenges, Techniques, and
                 Opportunities",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "3",
  pages =        "64:1--64:??",
  month =        apr,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3502289",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 11 06:29:30 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3502289",
  abstract =     "AI in finance refers to the applications of AI
                 techniques in financial businesses. This area has
                 attracted attention for decades, with both classic and
                 modern AI techniques applied to increasingly broader
                 areas of finance, economy, and society. In \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Brauwers:2023:SAB,
  author =       "Gianni Brauwers and Flavius Frasincar",
  title =        "A Survey on Aspect-Based Sentiment Classification",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "65:1--65:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3503044",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3503044",
  abstract =     "With the constantly growing number of reviews and
                 other sentiment-bearing texts on the Web, the demand
                 for automatic sentiment analysis algorithms continues
                 to expand. Aspect-based sentiment classification (ABSC)
                 allows \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Willard:2023:ISK,
  author =       "Jared Willard and Xiaowei Jia and Shaoming Xu and
                 Michael Steinbach and Vipin Kumar",
  title =        "Integrating Scientific Knowledge with Machine Learning
                 for Engineering and Environmental Systems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "66:1--66:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3514228",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3514228",
  abstract =     "There is a growing consensus that solutions to complex
                 science and engineering problems require novel
                 methodologies that are able to integrate traditional
                 physics-based modeling approaches with state-of-the-art
                 machine learning \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Santos:2023:ESS,
  author =       "Daniel S. Santos and Brauner R. N. Oliveira and Rick
                 Kazman and Elisa Y. Nakagawa",
  title =        "Evaluation of Systems-of-Systems Software
                 Architectures: State of the Art and Future
                 Perspectives",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "67:1--67:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3519020",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3519020",
  abstract =     "The quality of large and complex Systems-of-Systems
                 (SoS) that have emerged in critical application domains
                 depends on the quality of their architectures, which
                 are inherently dynamic in terms of reorganization at
                 runtime to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{daSilveira:2023:SGE,
  author =       "Thiago L. T. da Silveira and Paulo G. L. Pinto and
                 Jeffri Murrugarra-Llerena and Cl{\'a}udio R. Jung",
  title =        "{$3$D} Scene Geometry Estimation from 360${}^\circ $
                 Imagery: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "68:1--68:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3519021",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3519021",
  abstract =     "This article provides a comprehensive survey on
                 pioneer and state-of-the-art 3D scene geometry
                 estimation methodologies based on single, two, or
                 multiple images captured under omnidirectional optics.
                 We first revisit the basic \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ferrari:2023:FMR,
  author =       "Alessio Ferrari and Maurice H. Ter Beek",
  title =        "Formal Methods in Railways: a Systematic Mapping
                 Study",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "69:1--69:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3520480",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3520480",
  abstract =     "Formal methods are mathematically based techniques for
                 the rigorous development of software-intensive systems.
                 The railway signaling domain is a field in which formal
                 methods have traditionally been applied, with several
                 success \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Qu:2023:BEF,
  author =       "Youyang Qu and Md Palash Uddin and Chenquan Gan and
                 Yong Xiang and Longxiang Gao and John Yearwood",
  title =        "Blockchain-enabled Federated Learning: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "70:1--70:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3524104",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3524104",
  abstract =     "Federated learning (FL) has experienced a boom in
                 recent years, which is jointly promoted by the
                 prosperity of machine learning and Artificial
                 Intelligence along with emerging privacy issues. In the
                 FL paradigm, a central server and local end devices
                 maintain the same model by exchanging model updates
                 instead of raw data, with which the privacy of data
                 stored on end devices is not directly revealed. In this
                 way, the privacy violation caused by the growing
                 collection of sensitive data can be mitigated. However,
                 the performance of FL with a central server is reaching
                 a bottleneck, while new threats are emerging
                 simultaneously. There are various reasons, among which
                 the most significant ones are centralized processing,
                 data falsification, and lack of incentives. To
                 accelerate the proliferation of FL, blockchain-enabled
                 FL has attracted substantial attention from both
                 academia and industry. A considerable number of novel
                 solutions are devised to meet the emerging demands of
                 diverse scenarios. Blockchain-enabled FL provides both
                 theories and techniques to improve the performance of
                 FL from various perspectives. In this survey, we will
                 comprehensively summarize and evaluate existing
                 variants of blockchain-enabled FL, identify the
                 emerging challenges, and propose potentially promising
                 research directions in this under-explored domain.",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kanakis:2023:MLC,
  author =       "Marios Evangelos Kanakis and Ramin Khalili and Lin
                 Wang",
  title =        "Machine Learning for Computer Systems and Networking:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "71:1--71:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3523057",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3523057",
  abstract =     "Machine learning (ML) has become the de-facto approach
                 for various scientific domains such as computer vision
                 and natural language processing. Despite recent
                 breakthroughs, machine learning has only made its way
                 into the fundamental \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Troya:2023:MTT,
  author =       "Javier Troya and Sergio Segura and Lola Burgue{\~n}o
                 and Manuel Wimmer",
  title =        "Model Transformation Testing and Debugging: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "72:1--72:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3523056",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3523056",
  abstract =     "Model transformations are the key technique in
                 Model-Driven Engineering (MDE) to manipulate and
                 construct models. As a consequence, the correctness of
                 software systems built with MDE approaches relies
                 mainly on the correctness of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Husen:2023:SRF,
  author =       "Arif Husen and Muhammad Hasanain Chaudary and Farooq
                 Ahmad",
  title =        "A Survey on Requirements of Future Intelligent
                 Networks: Solutions and Future Research Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "73:1--73:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3524106",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3524106",
  abstract =     "The context of this study examines the requirements of
                 Future Intelligent Networks (FIN), solutions, and
                 current research directions through a survey technique.
                 The background of this study is hinged on the
                 applications of Machine \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "73",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cui:2023:SSM,
  author =       "Yingan Cui and Xue Li and Junhuai Li and Huaijun Wang
                 and Xiaogang Chen",
  title =        "A Survey of Sampling Method for Social Media
                 Embeddedness Relationship",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "74:1--74:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3524105",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3524105",
  abstract =     "Social media embeddedness relationships consist of
                 online social networks formed by self-organized
                 individual actors and significantly affect many aspects
                 of our lives. Since the high cost and inefficiency of
                 using population \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "74",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gomes:2023:SSS,
  author =       "Heitor Murilo Gomes and Maciej Grzenda and Rodrigo
                 Mello and Jesse Read and Minh Huong Le Nguyen and
                 Albert Bifet",
  title =        "A Survey on Semi-supervised Learning for Delayed
                 Partially Labelled Data Streams",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "75:1--75:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3523055",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3523055",
  abstract =     "Unlabelled data appear in many domains and are
                 particularly relevant to streaming applications, where
                 even though data is abundant, labelled data is rare. To
                 address the learning problems associated with such
                 data, one can ignore \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "75",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jiang:2023:EDM,
  author =       "Shouyong Jiang and Juan Zou and Shengxiang Yang and
                 Xin Yao",
  title =        "Evolutionary Dynamic Multi-objective Optimisation: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "76:1--76:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3524495",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3524495",
  abstract =     "Evolutionary dynamic multi-objective optimisation
                 (EDMO) is a relatively young but rapidly growing area
                 of investigation. EDMO employs evolutionary approaches
                 to handle multi-objective optimisation problems that
                 have \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "76",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lamsal:2023:SES,
  author =       "Rabindra Lamsal and Aaron Harwood and Maria Rodriguez
                 Read",
  title =        "Socially Enhanced Situation Awareness from Microblogs
                 Using Artificial Intelligence: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "77:1--77:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3524498",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3524498",
  abstract =     "The rise of social media platforms provides an
                 unbounded, infinitely rich source of aggregate
                 knowledge of the world around us, both historic and
                 real-time, from a human perspective. The greatest
                 challenge we face is how to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "77",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chitty-Venkata:2023:NAS,
  author =       "Krishna Teja Chitty-Venkata and Arun K. Somani",
  title =        "Neural Architecture Search Survey: a Hardware
                 Perspective",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "78:1--78:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3524500",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3524500",
  abstract =     "We review the problem of automating hardware-aware
                 architectural design process of Deep Neural Networks
                 (DNNs). The field of Convolutional Neural Network (CNN)
                 algorithm design has led to advancements in many
                 fields, such \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "78",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2023:EBE,
  author =       "Xiang Li and Yazhou Zhang and Prayag Tiwari and Dawei
                 Song and Bin Hu and Meihong Yang and Zhigang Zhao and
                 Neeraj Kumar and Pekka Marttinen",
  title =        "{EEG} Based Emotion Recognition: a Tutorial and
                 Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "79:1--79:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3524499",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3524499",
  abstract =     "Emotion recognition technology through analyzing the
                 EEG signal is currently an essential concept in
                 Artificial Intelligence and holds great potential in
                 emotional health care, human-computer interaction,
                 multimedia content \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "79",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2023:RAM,
  author =       "Wu Liu and Qian Bao and Yu Sun and Tao Mei",
  title =        "Recent Advances of Monocular {$2$D} and {$3$D} Human
                 Pose Estimation: a Deep Learning Perspective",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "80:1--80:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3524497",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3524497",
  abstract =     "Estimation of the human pose from a monocular camera
                 has been an emerging research topic in the computer
                 vision community with many applications. Recently,
                 benefiting from the deep learning technologies, a
                 significant amount \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fan:2023:DLM,
  author =       "Zhaoxin Fan and Yazhi Zhu and Yulin He and Qi Sun and
                 Hongyan Liu and Jun He",
  title =        "Deep Learning on Monocular Object Pose Detection and
                 Tracking: a Comprehensive Overview",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "81:1--81:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3524496",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3524496",
  abstract =     "Object pose detection and tracking has recently
                 attracted increasing attention due to its wide
                 applications in many areas, such as autonomous driving,
                 robotics, and augmented reality. Among methods for
                 object pose detection and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "81",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Vowels:2023:DLD,
  author =       "Matthew J. Vowels and Necati Cihan Camgoz and Richard
                 Bowden",
  title =        "D'ya Like {DAGs}? {A} Survey on Structure Learning and
                 Causal Discovery",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "82:1--82:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527154",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527154",
  abstract =     "Causal reasoning is a crucial part of science and
                 human intelligence. In order to discover causal
                 relationships from data, we need structure discovery
                 methods. We provide a review of background theory and a
                 survey of methods for \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "82",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Armeniakos:2023:HAT,
  author =       "Giorgos Armeniakos and Georgios Zervakis and Dimitrios
                 Soudris and J{\"o}rg Henkel",
  title =        "Hardware Approximate Techniques for Deep Neural
                 Network Accelerators: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "83:1--83:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527156",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527156",
  abstract =     "Deep Neural Networks (DNNs) are very popular because
                 of their high performance in various cognitive tasks in
                 Machine Learning (ML). Recent advancements in DNNs have
                 brought levels beyond human accuracy in many tasks, but
                 at \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "83",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yan:2023:SVA,
  author =       "Chen Yan and Xiaoyu Ji and Kai Wang and Qinhong Jiang
                 and Zizhi Jin and Wenyuan Xu",
  title =        "A Survey on Voice Assistant Security: Attacks and
                 Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "84:1--84:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527153",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527153",
  abstract =     "Voice assistants (VA) have become prevalent on a wide
                 range of personal devices such as smartphones and smart
                 speakers. As companies build voice assistants with
                 extra functionalities, attacks that trick a voice
                 assistant into performing malicious \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "84",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{AlmarazLuengo:2023:GPR,
  author =       "Elena {Almaraz Luengo}",
  title =        "Gamma Pseudo Random Number Generators",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "85:1--85:33",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527157",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527157",
  abstract =     "The generation of random values corresponding to an
                 underlying Gamma distribution is a key capability in
                 many areas of knowledge, such as Probability and
                 Statistics, Signal Processing, or Digital
                 Communication, among others. Throughout history,
                 different algorithms have been developed for the
                 generation of such values and advances in computing
                 have made them increasingly faster and more efficient
                 from a computational point of view. These advances also
                 allow the generation of higher-quality inputs (from the
                 point of view of randomness and uniformity) for these
                 algorithms that are easily tested by different
                 statistical batteries such as NIST, Dieharder, or
                 TestU01 among others. This article describes the
                 existing algorithms for the generation of (independent
                 and identically distributed --- i.i.d.) Gamma
                 distribution values as well as the theoretical and
                 mathematical foundations that support their validity.",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
  remark =       "The article presents 39 tables with algorithms for
                 beta- and gamma-distribution pseudo-random numbers.
                 Most require at least one invocation of $ \exp (x) $ or
                 $ \ln (x) $.",
}

@Article{Baksi:2023:SFA,
  author =       "Anubhab Baksi and Shivam Bhasin and Jakub Breier and
                 Dirmanto Jap and Dhiman Saha",
  title =        "A Survey on Fault Attacks on Symmetric Key
                 Cryptosystems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "86:1--86:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3530054",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3530054",
  abstract =     "Fault attacks are among the well-studied topics in the
                 area of cryptography. These attacks constitute a
                 powerful tool to recover the secret key used in the
                 encryption process. Fault attacks work by forcing a
                 device to work under non-ideal environmental conditions
                 (such as high temperature) or external disturbances
                 (such as glitch in the power supply) while performing a
                 cryptographic operation. The recent trend shows that
                 the amount of research in this direction --- which
                 ranges from attacking a particular primitive, proposing
                 a fault countermeasure, to attacking countermeasures
                 --- has grown up substantially and is going to stay as
                 an active research interest for the foreseeable future.
                 Hence, it becomes apparent to have a comprehensive yet
                 compact study of the (major) works. This work, which
                 covers a wide spectrum in the present-day research on
                 fault attacks that fall under the purview of the
                 symmetric key cryptography, aims at fulfilling the
                 absence of an up-to-date survey. We present mostly all
                 aspects of the topic in a way that is not only
                 understandable for a non-expert reader, but also
                 helpful for an expert as a reference.",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Orphanou:2023:MBA,
  author =       "Kalia Orphanou and Jahna Otterbacher and Styliani
                 Kleanthous and Khuyagbaatar Batsuren and Fausto
                 Giunchiglia and Veronika Bogina and Avital Shulner Tal
                 and Alan Hartman and Tsvi Kuflik",
  title =        "Mitigating Bias in Algorithmic Systems --- a Fish-eye
                 View",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "87:1--87:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527152",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527152",
  abstract =     "Mitigating bias in algorithmic systems is a critical
                 issue drawing attention across communities within the
                 information and computer sciences. Given the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "87",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xiao:2023:SWD,
  author =       "Jiang Xiao and Huichuwu Li and Minrui Wu and Hai Jin
                 and M. Jamal Deen and Jiannong Cao",
  title =        "A Survey on Wireless Device-free Human Sensing:
                 Application Scenarios, Current Solutions, and Open
                 Issues",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "88:1--88:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3530682",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3530682",
  abstract =     "In the last decade, many studies have significantly
                 pushed the limits of wireless device-free human sensing
                 (WDHS) technology and facilitated various \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "88",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{He:2023:CTC,
  author =       "Yuan He and Xiuzhen Guo and Xiaolong Zheng and Zihao
                 Yu and Jia Zhang and Haotian Jiang and Xin Na and
                 Jiacheng Zhang",
  title =        "Cross-Technology Communication for the {Internet of
                 Things}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "89:1--89:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3530049",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3530049",
  abstract =     "The ever-developing Internet of Things (IoT) brings
                 the prosperity of wireless sensing and control
                 applications. In many scenarios, different wireless
                 technologies \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "89",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Matsubara:2023:SCE,
  author =       "Yoshitomo Matsubara and Marco Levorato and Francesco
                 Restuccia",
  title =        "Split Computing and Early Exiting for Deep Learning
                 Applications: Survey and Research Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "90:1--90:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527155",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527155",
  abstract =     "Mobile devices such as smartphones and autonomous
                 vehicles increasingly rely on deep neural networks
                 (DNNs) to execute complex inference tasks such as
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "90",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Motger:2023:SBD,
  author =       "Quim Motger and Xavier Franch and Jordi Marco",
  title =        "Software-Based Dialogue Systems: Survey, Taxonomy, and
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "91:1--91:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527450",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527450",
  abstract =     "The use of natural language interfaces in the field of
                 human-computer interaction (HCI) is undergoing intense
                 study through dedicated scientific and industrial
                 research. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "91",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Vouros:2023:EDR,
  author =       "George A. Vouros",
  title =        "Explainable Deep Reinforcement Learning: State of the
                 Art and Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "92:1--92:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527448",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527448",
  abstract =     "Interpretability, explainability, and transparency are
                 key issues to introducing artificial intelligence
                 methods in many critical domains. This is important
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "92",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alhijawi:2023:SOR,
  author =       "Bushra Alhijawi and Arafat Awajan and Salam Fraihat",
  title =        "Survey on the Objectives of Recommender Systems:
                 Measures, Solutions, Evaluation Methodology, and New
                 Perspectives",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "93:1--93:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527449",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527449",
  abstract =     "Recently, recommender systems have played an
                 increasingly important role in a wide variety of
                 commercial applications to help users find favourite
                 products. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "93",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kammoun:2023:GAN,
  author =       "Amina Kammoun and Rim Slama and Hedi Tabia and Tarek
                 Ouni and Mohmed Abid",
  title =        "Generative Adversarial Networks for Face Generation: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "94:1--94:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527850",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527850",
  abstract =     "Recently, generative adversarial networks (GANs) have
                 progressed enormously, which makes them able to learn
                 complex data distributions in particular faces.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "94",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Karimi:2023:SAR,
  author =       "Amir-Hossein Karimi and Gilles Barthe and Bernhard
                 Sch{\"o}lkopf and Isabel Valera",
  title =        "A Survey of Algorithmic Recourse: Contrastive
                 Explanations and Consequential Recommendations",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "95:1--95:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527848",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527848",
  abstract =     "Machine learning is increasingly used to inform
                 decision making in sensitive situations where decisions
                 have consequential effects on \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "95",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alamir:2023:RGA,
  author =       "Manal Alamir and Manal Alghamdi",
  title =        "The Role of Generative Adversarial Network in Medical
                 Image Analysis: an In-depth Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "96:1--96:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3527849",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3527849",
  abstract =     "A generative adversarial network (GAN) is one of the
                 most significant research directions in the field of
                 artificial intelligence, and its superior data
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "96",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wu:2023:GNN,
  author =       "Shiwen Wu and Fei Sun and Wentao Zhang and Xu Xie and
                 Bin Cui",
  title =        "Graph Neural Networks in Recommender Systems: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "97:1--97:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3535101",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3535101",
  abstract =     "With the explosive growth of online information,
                 recommender systems play a key role to alleviate such
                 information overload. Due to the important \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "97",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Massoli:2023:LAQ,
  author =       "Fabio Valerio Massoli and Lucia Vadicamo and Giuseppe
                 Amato and Fabrizio Falchi",
  title =        "A Leap among Quantum Computing and Quantum Neural
                 Networks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "98:1--98:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3529756",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3529756",
  abstract =     "In recent years, Quantum Computing witnessed massive
                 improvements in terms of available resources and
                 algorithms development. The ability to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "98",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cruz:2023:EDS,
  author =       "Pedro Cruz and Nadjib Achir and Aline Carneiro Viana",
  title =        "On the Edge of the Deployment: a Survey on
                 Multi-access Edge Computing",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "99:1--99:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3529758",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3529758",
  abstract =     "Multi-Access Edge Computing (MEC) attracts much
                 attention from the scientific community due to its
                 scientific, technical, and commercial implications. In
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "99",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Le:2023:SDD,
  author =       "Triet H. M. Le and Huaming Chen and M. Ali Babar",
  title =        "A Survey on Data-driven Software Vulnerability
                 Assessment and Prioritization",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "100:1--100:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3529757",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3529757",
  abstract =     "Software Vulnerabilities (SVs) are increasing in
                 complexity and scale, posing great security risks to
                 many software systems. Given the limited resources in
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "100",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yates:2023:DMS,
  author =       "Darren Yates and Md Zahidul Islam",
  title =        "Data Mining on Smartphones: an Introduction and
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "101:1--101:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3529753",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3529753",
  abstract =     "Data mining is the science of extracting information
                 or ``knowledge'' from data. It is a task commonly
                 executed on cloud computing resources, personal
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "101",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ma:2023:MDS,
  author =       "Congbo Ma and Wei Emma Zhang and Mingyu Guo and Hu
                 Wang and Quan Z. Sheng",
  title =        "Multi-document Summarization via Deep Learning
                 Techniques: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "102:1--102:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3529754",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3529754",
  abstract =     "Multi-document summarization (MDS) is an effective
                 tool for information aggregation that generates an
                 informative and concise summary from a cluster of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "102",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{ElZini:2023:ENL,
  author =       "Julia {El Zini} and Mariette Awad",
  title =        "On the Explainability of Natural Language Processing
                 Deep Models",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "103:1--103:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3529755",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3529755",
  abstract =     "Despite their success, deep networks are used as
                 black-box models with outputs that are not easily
                 explainable during the learning and the prediction
                 phases. This \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "103",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lee:2023:SSA,
  author =       "Hansoo Lee and Joonyoung Park and Uichin Lee",
  title =        "A Systematic Survey on {Android API} Usage for
                 Data-driven Analytics with Smartphones",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "104:1--104:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3530814",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3530814",
  abstract =     "Recent industrial and academic research has focused on
                 data-driven analytics with smartphones by collecting
                 user interaction, context, and device systems data
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "104",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2023:MLE,
  author =       "Zhiyan Chen and Jinxin Liu and Yu Shen and Murat
                 Simsek and Burak Kantarci and Hussein T. Mouftah and
                 Petar Djukic",
  title =        "Machine Learning-Enabled {IoT} Security: Open Issues
                 and Challenges Under Advanced Persistent Threats",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "105:1--105:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3530812",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3530812",
  abstract =     "Despite its technological benefits, the Internet of
                 Things (IoT) has cyber weaknesses due to
                 vulnerabilities in the wireless medium. Machine Larning
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "105",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sozzo:2023:PLA,
  author =       "Emanuele {Del Sozzo} and Davide Conficconi and Alberto
                 Zeni and Mirko Salaris and Donatella Sciuto and Marco
                 D. Santambrogio",
  title =        "Pushing the Level of Abstraction of Digital System
                 Design: a Survey on How to Program {FPGAs}",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "106:1--106:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3532989",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3532989",
  abstract =     "Field Programmable Gate Arrays (FPGAs) are spatial
                 architectures with a heterogeneous reconfigurable
                 fabric. They are state-of-the-art for prototyping,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "106",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alavizadeh:2023:SCS,
  author =       "Hooman Alavizadeh and Julian Jang-Jaccard and Simon
                 Yusuf Enoch and Harith Al-Sahaf and Ian Welch and Seyit
                 A. Camtepe and Dan Dongseong Kim",
  title =        "A Survey on Cyber Situation-awareness Systems:
                 Framework, Techniques, and Insights",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "107:1--107:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3530809",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3530809",
  abstract =     "Cyberspace is full of uncertainty in terms of advanced
                 and sophisticated cyber threats that are equipped with
                 novel approaches to learn the system and propagate
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "107",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Muralidharan:2023:FPM,
  author =       "Trivikram Muralidharan and Aviad Cohen and Noa Gerson
                 and Nir Nissim",
  title =        "File Packing from the Malware Perspective: Techniques,
                 Analysis Approaches, and Directions for Enhancements",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "5",
  pages =        "108:1--108:??",
  month =        jun,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3530810",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Dec 5 06:42:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3530810",
  abstract =     "With the growing sophistication of malware, the need
                 to devise improved malware detection schemes is
                 crucial. The packing of executable files, which is one
                 of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "108",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tay:2023:ETS,
  author =       "Yi Tay and Mostafa Dehghani and Dara Bahri and Donald
                 Metzler",
  title =        "Efficient Transformers: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "109:1--109:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3530811",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3530811",
  abstract =     "Transformer model architectures have garnered immense
                 interest lately due to their effectiveness across a
                 range of domains like language, vision, and
                 reinforcement learning. In the field of natural
                 language processing for example, Transformers have
                 become \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "109",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fahmideh:2023:EBB,
  author =       "Mahdi Fahmideh and John Grundy and Aakash Ahmad and
                 Jun Shen and Jun Yan and Davoud Mougouei and Peng Wang
                 and Aditya Ghose and Anuradha Gunawardana and Uwe
                 Aickelin and Babak Abedin",
  title =        "Engineering Blockchain-based Software Systems:
                 Foundations, Survey, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "110:1--110:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3530813",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3530813",
  abstract =     "Many scientific and practical areas have shown
                 increasing interest in reaping the benefits of
                 blockchain technology to empower software systems.
                 However, the unique characteristics and requirements
                 associated with Blockchain-based Software (BBS) systems
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "110",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Guo:2023:EED,
  author =       "Binglei Guo and Jiong Yu and Dexian Yang and Hongyong
                 Leng and Bin Liao",
  title =        "Energy-Efficient Database Systems: a Systematic
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "111:1--111:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3538225",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3538225",
  abstract =     "Constructing energy-efficient database systems to
                 reduce economic costs and environmental impact has been
                 studied for 10 years. With the emergence of the big
                 data age, along with the data-centric and
                 data-intensive computing trend, the great amount of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "111",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Roy:2023:STA,
  author =       "Shanto Roy and Nazia Sharmin and Jaime C. Acosta and
                 Christopher Kiekintveld and Aron Laszka",
  title =        "Survey and Taxonomy of Adversarial Reconnaissance
                 Techniques",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "112:1--112:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3538704",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3538704",
  abstract =     "Adversaries are often able to penetrate networks and
                 compromise systems by exploiting vulnerabilities in
                 people and systems. The key to the success of these
                 attacks is information that adversaries collect
                 throughout the phases of the cyber kill chain. We
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "112",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xia:2023:HNA,
  author =       "Dan Xia and Chun Jiang and Jiafu Wan and Jiong Jin and
                 Victor C. M. Leung and Miguel
                 Mart{\'\i}nez-Garc{\'\i}a",
  title =        "Heterogeneous Network Access and Fusion in Smart
                 Factory: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "113:1--113:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3530815",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3530815",
  abstract =     "With the continuous expansion of the Industrial
                 Internet of Things (IIoT) and the increasing
                 connectivity among the various intelligent devices or
                 systems, the control of access and fusion in smart
                 factory networks has significantly gained importance.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "113",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Paleyes:2023:CDM,
  author =       "Andrei Paleyes and Raoul-Gabriel Urma and Neil D.
                 Lawrence",
  title =        "Challenges in Deploying Machine Learning: a Survey of
                 Case Studies",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "114:1--114:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533378",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533378",
  abstract =     "In recent years, machine learning has transitioned
                 from a field of academic research interest to a field
                 capable of solving real-world business problems.
                 However, the deployment of machine learning models in
                 production systems can present a number of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "114",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Goncalves:2023:SRC,
  author =       "Guilherme Gon{\c{c}}alves and Hugo Coelho and Pedro
                 Monteiro and Miguel Melo and Maximino Bessa",
  title =        "Systematic Review of Comparative Studies of the Impact
                 of Realism in Immersive Virtual Experiences",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "115:1--115:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533377",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533377",
  abstract =     "The adoption of immersive virtual experiences (IVEs)
                 opened new research lines where the impact of realism
                 is being studied, allowing developers to focus
                 resources on realism factors proven to improve the user
                 experience the most. We analyzed papers that \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "115",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Schafer:2023:SSA,
  author =       "Alexander Sch{\"a}fer and Gerd Reis and Didier
                 Stricker",
  title =        "A Survey on Synchronous Augmented, Virtual, and Mixed
                 Reality Remote Collaboration Systems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "116:1--116:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533376",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533376",
  abstract =     "Remote collaboration systems have become increasingly
                 important in today's society, especially during times
                 when physical distancing is advised. Industry,
                 research, and individuals face the challenging task of
                 collaborating and networking over long \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "116",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zehlike:2023:FRPa,
  author =       "Meike Zehlike and Ke Yang and Julia Stoyanovich",
  title =        "Fairness in Ranking, {Part II}: Learning-to-Rank and
                 Recommender Systems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "117:1--117:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533380",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533380",
  abstract =     "In the past few years, there has been much work on
                 incorporating fairness requirements into algorithmic
                 rankers, with contributions coming from the data
                 management, algorithms, information retrieval, and
                 recommender systems communities. In this survey, we
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "117",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zehlike:2023:FRPb,
  author =       "Meike Zehlike and Ke Yang and Julia Stoyanovich",
  title =        "Fairness in Ranking, {Part I}: Score-Based Ranking",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "118:1--118:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533379",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533379",
  abstract =     "In the past few years, there has been much work on
                 incorporating fairness requirements into algorithmic
                 rankers, with contributions coming from the data
                 management, algorithms, information retrieval, and
                 recommender systems communities. In this survey, we
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "118",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Erdogmus:2023:BHT,
  author =       "Hakan Erdogmus",
  title =        "{Bayesian} Hypothesis Testing Illustrated: an
                 Introduction for Software Engineering Researchers",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "119:1--119:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533383",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533383",
  abstract =     "Bayesian data analysis is gaining traction in many
                 fields, including empirical studies in software
                 engineering. Bayesian approaches provide many
                 advantages over traditional, or frequentist, data
                 analysis, but the mechanics often remain opaque to
                 beginners \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "119",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Topham:2023:HBP,
  author =       "Luke K. Topham and Wasiq Khan and Dhiya Al-Jumeily and
                 Abir Hussain",
  title =        "Human Body Pose Estimation for Gait Identification: a
                 Comprehensive Survey of Datasets and Models",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "120:1--120:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533384",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533384",
  abstract =     "Person identification is a problem that has received
                 substantial attention, particularly in security
                 domains. Gait recognition is one of the most convenient
                 approaches enabling person identification at a distance
                 without the need for high-quality images. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "120",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Benidis:2023:DLT,
  author =       "Konstantinos Benidis and Syama Sundar Rangapuram and
                 Valentin Flunkert and Yuyang Wang and Danielle Maddix
                 and Caner Turkmen and Jan Gasthaus and Michael
                 Bohlke-Schneider and David Salinas and Lorenzo Stella
                 and Fran{\c{c}}ois-Xavier Aubet and Laurent Callot and
                 Tim Januschowski",
  title =        "Deep Learning for Time Series Forecasting: Tutorial
                 and Literature Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "121:1--121:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533382",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533382",
  abstract =     "Deep learning based forecasting methods have become
                 the methods of choice in many applications of time
                 series prediction or forecasting often outperforming
                 other approaches. Consequently, over the last years,
                 these methods are now ubiquitous in large-. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "121",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jeong:2023:ECS,
  author =       "Jongkil Jay Jeong and Yevhen Zolotavkin and Robin
                 Doss",
  title =        "Examining the Current Status and Emerging Trends in
                 Continuous Authentication Technologies through Citation
                 Network Analysis",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "122:1--122:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533705",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533705",
  abstract =     "Continuous Authentication (CA) technologies enable
                 users to be authenticated beyond just the point of
                 entry. In this article, we conduct a comprehensive
                 review of over 2,300 articles to (a) identify the main
                 components of CA research to date, and (b) \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "122",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Parkinson:2023:SES,
  author =       "Simon Parkinson and Saad Khan",
  title =        "A Survey on Empirical Security Analysis of
                 Access-control Systems: a Real-world Perspective",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "123:1--123:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533703",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533703",
  abstract =     "There any many different access-control systems, yet a
                 commonality is that they provide flexible mechanisms to
                 enforce different access levels. Their importance in
                 organisations to adequately restrict resources, coupled
                 with their use in a dynamic \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "123",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jero:2023:TTA,
  author =       "Samuel Jero and Nathan Burow and Bryan Ward and
                 Richard Skowyra and Roger Khazan and Howard Shrobe and
                 Hamed Okhravi",
  title =        "{TAG: Tagged Architecture Guide}",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "124:1--124:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533704",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533704",
  abstract =     "Software security defenses are routinely broken by the
                 persistence of both security researchers and attackers.
                 Hardware solutions based on tagging are emerging as a
                 promising technique that provides strong security
                 guarantees (e.g., memory safety) while \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "124",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Branco:2023:CRH,
  author =       "Rodrigo Branco and Ben Lee",
  title =        "Cache-related Hardware Capabilities and Their Impact
                 on Information Security",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "125:1--125:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3534962",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3534962",
  abstract =     "Caching is an important technique to speed-up
                 execution, and its implementation and use cases vary.
                 When applied specifically to the memory hierarchy,
                 caching is used to speed up memory accesses and memory
                 translations. Different cache implementations are
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "125",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Olugbade:2023:HMD,
  author =       "Temitayo Olugbade and Marta Bie{\'n}kiewicz and Giulia
                 Barbareschi and Vincenzo D'amato and Luca Oneto and
                 Antonio Camurri and Catherine Holloway and M{\aa}rten
                 Bj{\"o}rkman and Peter Keller and Martin Clayton and
                 Amanda C. De C. Williams and Nicolas Gold and Cristina
                 Becchio and Beno{\^\i}t Bardy and Nadia
                 Bianchi-Berthouze",
  title =        "Human Movement Datasets: an Interdisciplinary Scoping
                 Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "126:1--126:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3534970",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3534970",
  abstract =     "Movement dataset reviews exist but are limited in
                 coverage, both in terms of size and research
                 discipline. While topic-specific reviews clearly have
                 their merit, it is critical to have a comprehensive
                 overview based on a systematic survey across \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "126",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Arcile:2023:TAF,
  author =       "Johan Arcile and {\'E}tienne Andr{\'e}",
  title =        "Timed Automata as a Formalism for Expressing Security:
                 a Survey on Theory and Practice",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "127:1--127:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3534967",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3534967",
  abstract =     "Timed automata are a common formalism for the
                 verification of concurrent systems subject to timing
                 constraints. They extend finite-state automata with
                 clocks, that constrain the system behavior in
                 locations, and to take transitions. While timed
                 automata \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "127",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2023:IMS,
  author =       "Lu Chen and Yunjun Gao and Xuan Song and Zheng Li and
                 Yifan Zhu and Xiaoye Miao and Christian S. Jensen",
  title =        "Indexing Metric Spaces for Exact Similarity Search",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "128:1--128:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3534963",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3534963",
  abstract =     "With the continued digitization of societal processes,
                 we are seeing an explosion in available data. This is
                 referred to as big data. In a research setting, three
                 aspects of the data are often viewed as the main
                 sources of challenges when attempting to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "128",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Keyvan:2023:HAA,
  author =       "Kimiya Keyvan and Jimmy Xiangji Huang",
  title =        "How to Approach Ambiguous Queries in Conversational
                 Search: a Survey of Techniques, Approaches, Tools, and
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "129:1--129:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3534965",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3534965",
  abstract =     "The advent of recent Natural Language Processing
                 technology has led human and machine interactions more
                 toward conversation. In Conversational Search Systems
                 (CSS) like chatbots and Virtual Personal Assistants
                 such as Apple's Siri, Amazon Alexa, Microsoft'.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "129",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kleyko:2023:SHCa,
  author =       "Denis Kleyko and Dmitri A. Rachkovskij and Evgeny
                 Osipov and Abbas Rahimi",
  title =        "A Survey on Hyperdimensional Computing aka Vector
                 Symbolic Architectures, {Part I}: Models and Data
                 Transformations",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "6",
  pages =        "130:1--130:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3538531",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 8 05:59:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3538531",
  abstract =     "This two-part comprehensive survey is devoted to a
                 computing framework most commonly known under the names
                 Hyperdimensional Computing and Vector Symbolic
                 Architectures (HDC/VSA). Both names refer to a family
                 of computational models that use high-. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "130",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sallaberry:2023:APA,
  author =       "Lucas H. Sallaberry and Romero Tori and F{\'a}tima L.
                 S. Nunes",
  title =        "Automatic Performance Assessment in Three-dimensional
                 Interactive Haptic Medical Simulators: a Systematic
                 Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "131:1--131:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3539222",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3539222",
  abstract =     "This study presents a literature systematic review of
                 automatic performance assessment in three-dimensional
                 interactive medical and dental simulators with haptic
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "131",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chebolu:2023:SAC,
  author =       "Siva Uday Sampreeth Chebolu and Paolo Rosso and
                 Sudipta Kar and Thamar Solorio",
  title =        "Survey on Aspect Category Detection",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "132:1--132:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3544557",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3544557",
  abstract =     "In recent years, aspect category detection has become
                 popular due to the rapid growth in customer reviews
                 data on e-commerce and other online platforms. Aspect
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "132",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Adhikari:2023:CSI,
  author =       "Deepak Adhikari and Wei Jiang and Jinyu Zhan and
                 Zhiyuan He and Danda B. Rawat and Uwe Aickelin and Hadi
                 A. Khorshidi",
  title =        "A Comprehensive Survey on Imputation of Missing Data
                 in {Internet of Things}",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "133:1--133:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3533381",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3533381",
  abstract =     "The Internet of Things (IoT) is enabled by the latest
                 developments in smart sensors, communication
                 technologies, and Internet protocols with broad
                 applications. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "133",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2023:TTS,
  author =       "Zhibo Wang and Jingjing Ma and Xue Wang and Jiahui Hu
                 and Zhan Qin and Kui Ren",
  title =        "Threats to Training: a Survey of Poisoning Attacks and
                 Defenses on Machine Learning Systems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "134:1--134:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3538707",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3538707",
  abstract =     "Machine learning (ML) has been universally adopted for
                 automated decisions in a variety of fields, including
                 recognition and classification applications, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "134",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zipperle:2023:PBI,
  author =       "Michael Zipperle and Florian Gottwalt and Elizabeth
                 Chang and Tharam Dillon",
  title =        "Provenance-based Intrusion Detection Systems: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "135:1--135:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3539605",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3539605",
  abstract =     "Traditional Intrusion Detection Systems (IDS) cannot
                 cope with the increasing number and sophistication of
                 cyberattacks such as Advanced Persistent Threats
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "135",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Han:2023:HCI,
  author =       "Rong Han and Zheng Yan and Xueqin Liang and Laurence
                 T. Yang",
  title =        "How Can Incentive Mechanisms and Blockchain Benefit
                 with Each Other? {A} Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "136:1--136:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3539604",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3539604",
  abstract =     "In a blockchain-based system, the lack of centralized
                 control requires active participation and cooperative
                 behaviors of system entities to ensure system
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "136",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yun:2023:FES,
  author =       "Joobeom Yun and Fayozbek Rustamov and Juhwan Kim and
                 Youngjoo Shin",
  title =        "Fuzzing of Embedded Systems: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "137:1--137:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3538644",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3538644",
  abstract =     "Security attacks abuse software vulnerabilities of IoT
                 devices; hence, detecting and eliminating these
                 vulnerabilities immediately are \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "137",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Carrion:2023:KST,
  author =       "Carmen Carri{\'o}n",
  title =        "{Kubernetes} Scheduling: Taxonomy, Ongoing Issues and
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "138:1--138:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3539606",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3539606",
  abstract =     "Continuous integration enables the development of
                 microservices-based applications using container
                 virtualization technology. Container \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "138",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Benmoussa:2023:IFA,
  author =       "Ahmed Benmoussa and Chaker Abdelaziz Kerrache and
                 Nasreddine Lagraa and Spyridon Mastorakis and
                 Abderrahmane Lakas and Abdou {El Karim Tahari}",
  title =        "Interest Flooding Attacks in Named Data Networking:
                 Survey of Existing Solutions, Open Issues,
                 Requirements, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "139:1--139:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3539730",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3539730",
  abstract =     "Named Data Networking (NDN) is a prominent realization
                 of the vision of Information-Centric Networking. The
                 NDN architecture adopts name-based \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "139",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Opdahl:2023:SKG,
  author =       "Andreas L. Opdahl and Tareq Al-Moslmi and Duc-Tien
                 Dang-Nguyen and Marc Gallofr{\'e} Oca{\~n}a and
                 Bj{\o}rnar Tessem and Csaba Veres",
  title =        "Semantic Knowledge Graphs for the News: a Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "140:1--140:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3543508",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3543508",
  abstract =     "ICT platforms for news production, distribution, and
                 consumption must exploit the ever-growing availability
                 of digital data. These data originate from \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "140",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tao:2023:SDD,
  author =       "Yudong Tao and Chuang Yang and Tianyi Wang and Erik
                 Coltey and Yanxiu Jin and Yinghao Liu and Renhe Jiang
                 and Zipei Fan and Xuan Song and Ryosuke Shibasaki and
                 Shu-Ching Chen and Mei-Ling Shyu and Steven Luis",
  title =        "A Survey on Data-driven {COVID-19} and Future Pandemic
                 Management",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "141:1--141:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3542818",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3542818",
  abstract =     "The COVID-19 pandemic has resulted in more than 440
                 million confirmed cases globally and almost 6 million
                 reported deaths as of March 2022. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "141",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Naghibijouybari:2023:MAH,
  author =       "Hoda Naghibijouybari and Esmaeil Mohammadian Koruyeh
                 and Nael Abu-Ghazaleh",
  title =        "Microarchitectural Attacks in Heterogeneous Systems: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "142:1--142:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3544102",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3544102",
  abstract =     "With the increasing proliferation of hardware
                 accelerators and the predicted continued increase in
                 the heterogeneity of future computing systems, it is
                 necessary \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "142",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sarsenbayeva:2023:MSA,
  author =       "Zhanna Sarsenbayeva and Niels {Van Berkel} and Eduardo
                 Velloso and Jorge Goncalves and Vassilis Kostakos",
  title =        "Methodological Standards in Accessibility Research on
                 Motor Impairments: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "143:1--143:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3543509",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3543509",
  abstract =     "The design and evaluation of accessibility technology
                 is a core component of the computer science landscape,
                 aiming to ensure that digital innovations are
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "143",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Idowu:2023:AMM,
  author =       "Samuel Idowu and Daniel Str{\"u}ber and Thorsten
                 Berger",
  title =        "Asset Management in Machine Learning:
                 State-of-research and State-of-practice",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "144:1--144:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3543847",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3543847",
  abstract =     "Machine learning components are essential for today's
                 software systems, causing a need to adapt traditional
                 software engineering practices when developing
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "144",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Afsar:2023:RLB,
  author =       "M. Mehdi Afsar and Trafford Crump and Behrouz Far",
  title =        "Reinforcement Learning based Recommender Systems: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "145:1--145:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3543846",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3543846",
  abstract =     "Recommender systems (RSs) have become an inseparable
                 part of our everyday lives. They help us find our
                 favorite items to purchase, our friends on social
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "145",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bayer:2023:SDA,
  author =       "Markus Bayer and Marc-Andr{\'e} Kaufhold and Christian
                 Reuter",
  title =        "A Survey on Data Augmentation for Text
                 Classification",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "146:1--146:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3544558",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3544558",
  abstract =     "Data augmentation, the artificial creation of training
                 data for machine learning by transformations, is a
                 widely studied research field across machine learning
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "146",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Perez-Cerrolaza:2023:GDS,
  author =       "Jon Perez-Cerrolaza and Jaume Abella and Leonidas
                 Kosmidis and Alejandro J. Calderon and Francisco
                 Cazorla and Jose Luis Flores",
  title =        "{GPU} Devices for Safety-Critical Systems: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "147:1--147:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3549526",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3549526",
  abstract =     "Graphics Processing Unit (GPU) devices and their
                 associated software programming languages and
                 frameworks can deliver the computing performance
                 required \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "147",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tran:2023:AAI,
  author =       "Tung Minh Tran and Tu N. Vu and Nguyen D. Vo and Tam
                 V. Nguyen and Khang Nguyen",
  title =        "Anomaly Analysis in Images and Videos: a Comprehensive
                 Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "148:1--148:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3544014",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3544014",
  abstract =     "Anomaly analysis is an important component of any
                 surveillance system. In recent years, it has drawn the
                 attention of the computer vision and machine learning
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "148",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2023:SDF,
  author =       "Li Liu and Fanzhang Li",
  title =        "A Survey on Dynamic Fuzzy Machine Learning",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "149:1--149:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3544013",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3544013",
  abstract =     "Dynamic fuzzy characteristics are ubiquitous in a lot
                 of scientific and engineering problems. Specifically,
                 the physical systems and learning processes in machine
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "149",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sleeman:2023:MCC,
  author =       "William C. Sleeman and Rishabh Kapoor and Preetam
                 Ghosh",
  title =        "Multimodal Classification: Current Landscape, Taxonomy
                 and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "150:1--150:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3543848",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3543848",
  abstract =     "Multimodal classification research has been gaining
                 popularity with new datasets in domains such as
                 satellite imagery, biometrics, and medicine. Prior
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "150",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rejiba:2023:CSK,
  author =       "Zeineb Rejiba and Javad Chamanara",
  title =        "Custom Scheduling in {Kubernetes}: a Survey on Common
                 Problems and Solution Approaches",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "151:1--151:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3544788",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3544788",
  abstract =     "Since its release in 2014, Kubernetes has become a
                 popular choice for orchestrating containerized
                 workloads at scale. To determine the most appropriate
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "151",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Goudarzi:2023:SIA,
  author =       "Mohammad Goudarzi and Marimuthu Palaniswami and
                 Rajkumar Buyya",
  title =        "Scheduling {IoT} Applications in Edge and Fog
                 Computing Environments: a Taxonomy and Future
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "7",
  pages =        "152:1--152:??",
  month =        jul,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3544836",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:15 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3544836",
  abstract =     "Fog computing, as a distributed paradigm, offers
                 cloud-like services at the edge of the network with low
                 latency and high-access bandwidth to support a diverse
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "152",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2023:DLA,
  author =       "Yue Liu and Chakkrit Tantithamthavorn and Li Li and
                 Yepang Liu",
  title =        "Deep Learning for {Android} Malware Defenses: a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "153:1--153:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3544968",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3544968",
  abstract =     "Malicious applications (particularly those targeting
                 the Android platform) pose a serious threat to
                 developers and end-users. Numerous research efforts
                 have \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "153",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Koh:2023:ESL,
  author =       "Huan Yee Koh and Jiaxin Ju and Ming Liu and Shirui
                 Pan",
  title =        "An Empirical Survey on Long Document Summarization:
                 Datasets, Models, and Metrics",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "154:1--154:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3545176",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3545176",
  abstract =     "Long documents such as academic articles and business
                 reports have been the standard format to detail out
                 important issues and complicated subjects that require
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "154",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Madsen:2023:PHI,
  author =       "Andreas Madsen and Siva Reddy and Sarath Chandar",
  title =        "Post-hoc Interpretability for Neural {NLP}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "155:1--155:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3546577",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3546577",
  abstract =     "Neural networks for NLP are becoming increasingly
                 complex and widespread, and there is a growing concern
                 if these models are responsible to use. Explaining
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "155",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Weld:2023:SJI,
  author =       "Henry Weld and Xiaoqi Huang and Siqu Long and Josiah
                 Poon and Soyeon Caren Han",
  title =        "A Survey of Joint Intent Detection and Slot Filling
                 Models in Natural Language Understanding",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "156:1--156:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3547138",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3547138",
  abstract =     "Intent classification, to identify the speaker's
                 intention, and slot filling, to label each token with a
                 semantic type, are critical tasks in natural language
                 understanding. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "156",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mohseni:2023:TML,
  author =       "Sina Mohseni and Haotao Wang and Chaowei Xiao and
                 Zhiding Yu and Zhangyang Wang and Jay Yadawa",
  title =        "Taxonomy of Machine Learning Safety: a Survey and
                 Primer",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "157:1--157:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3551385",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3551385",
  abstract =     "The open-world deployment of Machine Learning (ML)
                 algorithms in safety-critical applications such as
                 autonomous vehicles needs to address a variety of ML
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "157",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gunawardena:2023:ETT,
  author =       "Nishan Gunawardena and Jeewani Anupama Ginige and
                 Bahman Javadi",
  title =        "Eye-tracking Technologies in Mobile Devices Using Edge
                 Computing: a Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "158:1--158:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3546938",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3546938",
  abstract =     "Eye-tracking provides invaluable insight into the
                 cognitive activities underlying a wide range of human
                 behaviours. Identifying cognitive activities provides
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "158",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Abdullah:2023:DLS,
  author =       "Tariq Abdullah and Ahmed Ahmet",
  title =        "Deep Learning in Sentiment Analysis: Recent
                 Architectures",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "159:1--159:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3548772",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3548772",
  abstract =     "Humans are increasingly integrated with devices that
                 enable the collection of vast unstructured opinionated
                 data. Accurately analysing subjective information
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "159",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Blanco-Justicia:2023:CRU,
  author =       "Alberto Blanco-Justicia and David S{\'a}nchez and
                 Josep Domingo-Ferrer and Krishnamurty Muralidhar",
  title =        "A Critical Review on the Use (and Misuse) of
                 Differential Privacy in Machine Learning",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "160:1--160:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3547139",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3547139",
  abstract =     "We review the use of differential privacy (DP) for
                 privacy protection in machine learning (ML). We show
                 that, driven by the aim of preserving the accuracy of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "160",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2023:PIS,
  author =       "Chi Liu and Tianqing Zhu and Jun Zhang and Wanlei
                 Zhou",
  title =        "Privacy Intelligence: a Survey on Image Privacy in
                 Online Social Networks",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "161:1--161:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3547299",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3547299",
  abstract =     "Image sharing on online social networks (OSNs) has
                 become an indispensable part of daily social
                 activities, but it has also increased the risk of
                 privacy \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "161",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lyu:2023:SDE,
  author =       "Minzhao Lyu and Hassan Habibi Gharakheili and Vijay
                 Sivaraman",
  title =        "A Survey on {DNS} Encryption: Current Development,
                 Malware Misuse, and Inference Techniques",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "162:1--162:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3547331",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3547331",
  abstract =     "The domain name system (DNS) that maps alphabetic
                 names to numeric Internet Protocol (IP) addresses plays
                 a foundational role in Internet communications.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "162",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhou:2023:AAD,
  author =       "Shuai Zhou and Chi Liu and Dayong Ye and Tianqing Zhu
                 and Wanlei Zhou and Philip S. Yu",
  title =        "Adversarial Attacks and Defenses in Deep Learning:
                 From a Perspective of Cybersecurity",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "163:1--163:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3547330",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3547330",
  abstract =     "The outstanding performance of deep neural networks
                 has promoted deep learning applications in a broad set
                 of domains. However, the potential risks \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "163",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Serrano:2023:QSC,
  author =       "Manuel A. Serrano and Jos{\'e} A. Cruz-Lemus and
                 Ricardo Perez-Castillo and Mario Piattini",
  title =        "Quantum Software Components and Platforms: Overview
                 and Quality Assessment",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "164:1--164:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3548679",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3548679",
  abstract =     "Quantum computing is the latest revolution in
                 computing and will probably come to be seen as an
                 advance as important as the steam engine or the
                 information \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "164",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Velayudhan:2023:RAB,
  author =       "Divya Velayudhan and Taimur Hassan and Ernesto Damiani
                 and Naoufel Werghi",
  title =        "Recent Advances in Baggage Threat Detection: a
                 Comprehensive and Systematic Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "165:1--165:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3549932",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3549932",
  abstract =     "X-ray imagery systems have enabled security personnel
                 to identify potential threats contained within the
                 baggage and cargo since the early 1970s. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "165",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tian:2023:CSP,
  author =       "Zhiyi Tian and Lei Cui and Jie Liang and Shui Yu",
  title =        "A Comprehensive Survey on Poisoning Attacks and
                 Countermeasures in Machine Learning",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "166:1--166:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3551636",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3551636",
  abstract =     "The prosperity of machine learning has been
                 accompanied by increasing attacks on the training
                 process. Among them, poisoning attacks have become an
                 emerging \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "166",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Heinl:2023:REV,
  author =       "Michael P. Heinl and Simon G{\"o}lz and Christoph
                 B{\"o}sch",
  title =        "Remote Electronic Voting in Uncontrolled Environments:
                 a Classifying Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "167:1--167:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3551386",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3551386",
  abstract =     "Remote electronic voting, often called online or
                 Internet voting, has been subject to research for the
                 last four decades. It is regularly discussed in public
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "167",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Roscoe:2023:FCA,
  author =       "Sarah Roscoe and Minal Khatri and Adam Voshall and
                 Surinder Batra and Sukhwinder Kaur and Jitender
                 Deogun",
  title =        "Formal Concept Analysis Applications in
                 Bioinformatics",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "168:1--168:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3554728",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3554728",
  abstract =     "The bioinformatics discipline seeks to solve problems
                 in biology with computational theories and methods.
                 Formal concept analysis (FCA) is one such \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "168",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chakraborty:2023:HBA,
  author =       "Nilesh Chakraborty and Jianqiang Li and Victor C. M.
                 Leung and Samrat Mondal and Yi Pan and Chengwen Luo and
                 Mithun Mukherjee",
  title =        "Honeyword-based Authentication Techniques for
                 Protecting Passwords: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "169:1--169:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3552431",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3552431",
  abstract =     "Honeyword (or decoy password) based authentication,
                 first introduced by Juels and Rivest in 2013, has
                 emerged as a security mechanism that can provide
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "169",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zangerle:2023:ERS,
  author =       "Eva Zangerle and Christine Bauer",
  title =        "Evaluating Recommender Systems: Survey and Framework",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "170:1--170:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3556536",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3556536",
  abstract =     "The comprehensive evaluation of the performance of a
                 recommender system is a complex endeavor: many facets
                 need to be considered in configuring an \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "170",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Almeida:2023:SLR,
  author =       "Andr{\'e} Lu{\'{\i}}s Barroso Almeida and Joubert de
                 Castro Lima and Marco Antonio M. Carvalho",
  title =        "Systematic Literature Review on Parallel
                 Trajectory-based Metaheuristics",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "171:1--171:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3550484",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3550484",
  abstract =     "In the past 35 years, parallel computing has drawn
                 increasing interest from the academic community,
                 especially in solving complex optimization problems
                 that require \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "171",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yang:2023:AME,
  author =       "Tianbao Yang and Yiming Ying",
  title =        "{AUC} Maximization in the Era of Big Data and {AI}: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "172:1--172:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3554729",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3554729",
  abstract =     "Area under the ROC curve, a.k.a. AUC, is a measure of
                 choice for assessing the performance of a classifier
                 for imbalanced data. AUC maximization refers to a
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "172",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dong:2023:SNL,
  author =       "Chenhe Dong and Yinghui Li and Haifan Gong and Miaoxin
                 Chen and Junxin Li and Ying Shen and Min Yang",
  title =        "A Survey of Natural Language Generation",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "173:1--173:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3554727",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3554727",
  abstract =     "This article offers a comprehensive review of the
                 research on Natural Language Generation (NLG) over the
                 past two decades, especially in relation to
                 data-to-text \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "173",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kong:2023:ECD,
  author =       "Linghe Kong and Jinlin Tan and Junqin Huang and Guihai
                 Chen and Shuaitian Wang and Xi Jin and Peng Zeng and
                 Muhammad Khan and Sajal K. Das",
  title =        "Edge-computing-driven {Internet of Things}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "8",
  pages =        "174:1--174:??",
  month =        aug,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3555308",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:16 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3555308",
  abstract =     "The Internet of Things (IoT) is impacting the world's
                 connectivity landscape. More and more IoT devices are
                 connected, bringing many benefits to our daily lives.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "174",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kleyko:2023:SHCb,
  author =       "Denis Kleyko and Dmitri Rachkovskij and Evgeny Osipov
                 and Abbas Rahimi",
  title =        "A Survey on Hyperdimensional Computing aka Vector
                 Symbolic Architectures, {Part II}: Applications,
                 Cognitive Models, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "175:1--175:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3558000",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3558000",
  abstract =     "This is Part II of the two-part comprehensive survey
                 devoted to a computing framework most commonly known
                 under the names Hyperdimensional Computing and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "175",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{McDuff:2023:CMP,
  author =       "Daniel McDuff",
  title =        "Camera Measurement of Physiological Vital Signs",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "176:1--176:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3558518",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3558518",
  abstract =     "The need for remote tools for healthcare monitoring
                 has never been more apparent. Camera measurement of
                 vital signs leverages imaging devices to compute
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "176",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2023:TAP,
  author =       "Bo Li and Peng Qi and Bo Liu and Shuai Di and Jingen
                 Liu and Jiquan Pei and Jinfeng Yi and Bowen Zhou",
  title =        "Trustworthy {AI}: From Principles to Practices",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "177:1--177:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3555803",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3555803",
  abstract =     "The rapid development of Artificial Intelligence (AI)
                 technology has enabled the deployment of various
                 systems based on it. However, many current AI systems
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "177",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Benedetto:2023:SRA,
  author =       "Luca Benedetto and Paolo Cremonesi and Andrew Caines
                 and Paula Buttery and Andrea Cappelli and Andrea
                 Giussani and Roberto Turrin",
  title =        "A Survey on Recent Approaches to Question Difficulty
                 Estimation from Text",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "178:1--178:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3556538",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3556538",
  abstract =     "Question Difficulty Estimation from Text (QDET) is the
                 application of Natural Language Processing techniques
                 to the estimation of a value, either \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "178",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{North:2023:LCP,
  author =       "Kai North and Marcos Zampieri and Matthew Shardlow",
  title =        "Lexical Complexity Prediction: an Overview",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "179:1--179:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3557885",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3557885",
  abstract =     "The occurrence of unknown words in texts significantly
                 hinders reading comprehension. To improve accessibility
                 for specific target populations, computational
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "179",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pattnaik:2023:SUP,
  author =       "Nandita Pattnaik and Shujun Li and Jason R. C. Nurse",
  title =        "A Survey of User Perspectives on Security and Privacy
                 in a Home Networking Environment",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "180:1--180:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3558095",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3558095",
  abstract =     "The security and privacy of smart home systems,
                 particularly from a home user's perspective, have been
                 a very active research area in recent years. However,
                 via \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "180",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Park:2023:EOS,
  author =       "Eun Hee Park and Veda C. Storey",
  title =        "Emotion Ontology Studies: a Framework for Expressing
                 Feelings Digitally and its Application to Sentiment
                 Analysis",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "181:1--181:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3555719",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3555719",
  abstract =     "Emotion ontologies have been developed to capture
                 affect, a concept that encompasses discrete emotions
                 and feelings, especially for research on sentiment
                 analysis, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "181",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fotia:2023:TEB,
  author =       "Lidia Fotia and Fl{\'a}via Delicato and Giancarlo
                 Fortino",
  title =        "Trust in Edge-based {Internet of Things}
                 Architectures: State of the Art and Research
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "182:1--182:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3558779",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3558779",
  abstract =     "The Internet of Things (IoT) aims to enable a scenario
                 where smart objects, inserted into information
                 networks, supply smart services for human beings. The
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "182",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bitton:2023:ECR,
  author =       "Ron Bitton and Nadav Maman and Inderjeet Singh and
                 Satoru Momiyama and Yuval Elovici and Asaf Shabtai",
  title =        "Evaluating the Cybersecurity Risk of Real-world,
                 Machine Learning Production Systems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "183:1--183:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3559104",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3559104",
  abstract =     "Although cyberattacks on machine learning (ML)
                 production systems can be harmful, today, security
                 practitioners are ill-equipped, lacking methodologies
                 and tactical \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "183",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hua:2023:ECA,
  author =       "Haochen Hua and Yutong Li and Tonghe Wang and Nanqing
                 Dong and Wei Li and Junwei Cao",
  title =        "Edge Computing with Artificial Intelligence: a Machine
                 Learning Perspective",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "184:1--184:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3555802",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3555802",
  abstract =     "Recent years have witnessed the widespread popularity
                 of Internet of things (IoT). By providing sufficient
                 data for model training and inference, IoT has promoted
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "184",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yoshizawa:2023:SSP,
  author =       "Takahito Yoshizawa and Dave Singel{\'e}e and Jan
                 Tobias Muehlberg and Stephane Delbruel and Amir
                 Taherkordi and Danny Hughes and Bart Preneel",
  title =        "A Survey of Security and Privacy Issues in {V2X}
                 Communication Systems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "185:1--185:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3558052",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3558052",
  abstract =     "Vehicle-to-Everything (V2X) communication is receiving
                 growing attention from industry and academia as
                 multiple pilot projects explore its capabilities and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "185",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liatifis:2023:ASO,
  author =       "Athanasios Liatifis and Panagiotis Sarigiannidis and
                 Vasileios Argyriou and Thomas Lagkas",
  title =        "Advancing {SDN} from {OpenFlow} to {P4}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "186:1--186:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3556973",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3556973",
  abstract =     "Software-defined Networking (SDN) marked the beginning
                 of a new era in the field of networking by decoupling
                 the control and forwarding processes through the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "186",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Senanayake:2023:ASC,
  author =       "Janaka Senanayake and Harsha Kalutarage and Mhd Omar
                 Al-Kadri and Andrei Petrovski and Luca Piras",
  title =        "{Android} Source Code Vulnerability Detection: a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "187:1--187:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3556974",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3556974",
  abstract =     "The use of mobile devices is rising daily in this
                 technological era. A continuous and increasing number
                 of mobile applications are constantly offered on mobile
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "187",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2023:SVM,
  author =       "Meng Liu and Liqiang Nie and Yunxiao Wang and Meng
                 Wang and Yong Rui",
  title =        "A Survey on Video Moment Localization",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "188:1--188:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3556537",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3556537",
  abstract =     "Video moment localization, also known as video moment
                 retrieval, aims to search a target segment within a
                 video described by a given natural language query.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "188",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cao:2023:MAR,
  author =       "Jacky Cao and Kit-Yung Lam and Lik-Hang Lee and Xiaoli
                 Liu and Pan Hui and Xiang Su",
  title =        "Mobile Augmented Reality: User Interfaces, Frameworks,
                 and Intelligence",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "189:1--189:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3557999",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3557999",
  abstract =     "Mobile Augmented Reality (MAR) integrates
                 computer-generated virtual objects with physical
                 environments for mobile devices. MAR systems enable
                 users to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "189",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sim:2023:TRA,
  author =       "Junsik Sim and Beomjoong Kim and Kiseok Jeon and
                 Moonho Joo and Jihun Lim and Junghee Lee and Kim-Kwang
                 Raymond Choo",
  title =        "Technical Requirements and Approaches in Personal Data
                 Control",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "190:1--190:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3558766",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3558766",
  abstract =     "There has been a trend of moving from simply
                 de-identification to providing extended data control to
                 their owner (e.g., data portability and right to be
                 \ldots{})",
  acknowledgement = ack-nhfb,
  articleno =    "190",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Issa:2023:BBF,
  author =       "Wael Issa and Nour Moustafa and Benjamin Turnbull and
                 Nasrin Sohrabi and Zahir Tari",
  title =        "Blockchain-Based Federated Learning for Securing
                 {Internet of Things}: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "191:1--191:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3560816",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3560816",
  abstract =     "The Internet of Things (IoT) ecosystem connects
                 physical devices to the internet, offering significant
                 advantages in agility, responsiveness, and potential
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "191",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ahmad:2023:RCS,
  author =       "Hussain Ahmad and Isuru Dharmadasa and Faheem Ullah
                 and Muhammad Ali Babar",
  title =        "A Review on {C3I} Systems' Security: Vulnerabilities,
                 Attacks, and Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "192:1--192:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3558001",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3558001",
  abstract =     "Command, Control, Communication, and Intelligence
                 (C3I) systems are increasingly used in critical civil
                 and military domains for achieving information
                 superiority, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "192",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Luo:2023:PPU,
  author =       "Junhai Luo and Zhiyan Wang and Ming Xia and Linyong Wu
                 and Yuxin Tian and Yu Chen",
  title =        "Path Planning for {UAV} Communication Networks:
                 Related Technologies, Solutions, and Opportunities",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "193:1--193:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3560261",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3560261",
  abstract =     "Path planning has been a hot and challenging field in
                 unmanned aerial vehicles (UAV). With the increasing
                 demand of society and the continuous \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "193",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dwivedi:2023:EAX,
  author =       "Rudresh Dwivedi and Devam Dave and Het Naik and Smiti
                 Singhal and Rana Omer and Pankesh Patel and Bin Qian
                 and Zhenyu Wen and Tejal Shah and Graham Morgan and
                 Rajiv Ranjan",
  title =        "Explainable {AI (XAI)}: Core Ideas, Techniques, and
                 Solutions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "194:1--194:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3561048",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3561048",
  abstract =     "As our dependence on intelligent machines continues to
                 grow, so does the demand for more transparent and
                 interpretable models. In addition, the ability to
                 explain \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "194",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2023:PTP,
  author =       "Pengfei Liu and Weizhe Yuan and Jinlan Fu and Zhengbao
                 Jiang and Hiroaki Hayashi and Graham Neubig",
  title =        "Pre-train, Prompt, and Predict: a Systematic Survey of
                 Prompting Methods in Natural Language Processing",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "195:1--195:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3560815",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3560815",
  abstract =     "This article surveys and organizes research works in a
                 new paradigm in natural language processing, which we
                 dub ``prompt-based learning.'' Unlike traditional
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "195",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2023:EIT,
  author =       "Ping Wang and Haichang Gao and Xiaoyan Guo and
                 Chenxuan Xiao and Fuqi Qi and Zheng Yan",
  title =        "An Experimental Investigation of Text-based {CAPTCHA}
                 Attacks and Their Robustness",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "9",
  pages =        "196:1--196:??",
  month =        sep,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3559754",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3559754",
  abstract =     "Text-based CAPTCHA has become one of the most popular
                 methods for preventing bot attacks. With the rapid
                 development of deep learning techniques, many new
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "196",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rogers:2023:QDE,
  author =       "Anna Rogers and Matt Gardner and Isabelle Augenstein",
  title =        "{QA} Dataset Explosion: a Taxonomy of {NLP} Resources
                 for Question Answering and Reading Comprehension",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "197:1--197:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3560260",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3560260",
  abstract =     "Alongside huge volumes of research on deep learning
                 models in NLP in the recent years, there has been much
                 work on benchmark datasets needed to track modeling
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "197",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chiarot:2023:TSC,
  author =       "Giacomo Chiarot and Claudio Silvestri",
  title =        "Time Series Compression Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "198:1--198:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3560814",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3560814",
  abstract =     "Smart objects are increasingly widespread and their
                 ecosystem, also known as the Internet of Things (IoT),
                 is relevant in many application scenarios. The huge
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "198",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Brophy:2023:GAN,
  author =       "Eoin Brophy and Zhengwei Wang and Qi She and Tom{\'a}s
                 Ward",
  title =        "Generative Adversarial Networks in Time Series: a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "199:1--199:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3559540",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3559540",
  abstract =     "Generative adversarial network (GAN) studies have
                 grown exponentially in the past few years. Their impact
                 has been seen mainly in the computer vision field
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "199",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ullah:2023:CRV,
  author =       "Fath U Min Ullah and Mohammad S. Obaidat and Amin
                 Ullah and Khan Muhammad and Mohammad Hijji and Sung
                 Wook Baik",
  title =        "A Comprehensive Review on Vision-Based Violence
                 Detection in Surveillance Videos",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "200:1--200:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3561971",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3561971",
  abstract =     "Recent advancements in intelligent surveillance
                 systems for video analysis have been a topic of great
                 interest in the research community due to the vast
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "200",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhao:2023:SSJ,
  author =       "Yunhua Zhao and Kostadin Damevski and Hui Chen",
  title =        "A Systematic Survey of Just-in-Time Software Defect
                 Prediction",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "201:1--201:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3567550",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3567550",
  abstract =     "Recent years have experienced sustained focus in
                 research on software defect prediction that aims to
                 predict the likelihood of software defects. Moreover,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "201",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Quina-Mera:2023:GSM,
  author =       "Antonio Qui{\~n}a-Mera and Pablo Fernandez and
                 Jos{\'e} Mar{\'{\i}}a Garc{\'{\i}}a and Antonio
                 Ruiz-Cort{\'e}s",
  title =        "{GraphQL}: a Systematic Mapping Study",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "202:1--202:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3561818",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3561818",
  abstract =     "GraphQL is a query language and execution engine for
                 web application programming interfaces (APIs) proposed
                 as an alternative to improve data access problems
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "202",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rethmeier:2023:PCP,
  author =       "Nils Rethmeier and Isabelle Augenstein",
  title =        "A Primer on Contrastive Pretraining in Language
                 Processing: Methods, Lessons Learned, and
                 Perspectives",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "203:1--203:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3561970",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3561970",
  abstract =     "Modern natural language processing (NLP) methods
                 employ self-supervised pretraining objectives such as
                 masked language modeling to boost the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "203",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ganapathi:2023:SER,
  author =       "Iyyakutti Iyappan Ganapathi and Syed Sadaf Ali and
                 Surya Prakash and Ngoc-Son Vu and Naoufel Werghi",
  title =        "A Survey of {$3$D} Ear Recognition Techniques",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "204:1--204:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3560884",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3560884",
  abstract =     "Human recognition with biometrics is a rapidly
                 emerging area of computer vision. Compared to other
                 well-known biometric features such as the face,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "204",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Parmar:2023:OWM,
  author =       "Jitendra Parmar and Satyendra Chouhan and Vaskar
                 Raychoudhury and Santosh Rathore",
  title =        "Open-world Machine Learning: Applications, Challenges,
                 and Opportunities",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "205:1--205:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3561381",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3561381",
  abstract =     "Traditional machine learning, mainly supervised
                 learning, follows the assumptions of closed-world
                 learning, i.e., for each testing class, a training
                 class is \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "205",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ibrahim:2023:ECN,
  author =       "Rami Ibrahim and M. Omair Shafiq",
  title =        "Explainable Convolutional Neural Networks: a Taxonomy,
                 Review, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "206:1--206:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3563691",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3563691",
  abstract =     "Convolutional neural networks (CNNs) have shown
                 promising results and have outperformed classical
                 machine learning techniques in tasks such as image
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "206",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sun:2023:FFI,
  author =       "Ling Sun and Yuan Rao and Lianwei Wu and Xiangbo Zhang
                 and Yuqian Lan and Ambreen Nazir",
  title =        "Fighting False Information from Propagation Process: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "207:1--207:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3563388",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3563388",
  abstract =     "The recent serious cases of spreading false
                 information have posed a significant threat to the
                 social stability and even national security, urgently
                 requiring all \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "207",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pasdar:2023:CAB,
  author =       "Amirmohammad Pasdar and Young Choon Lee and Zhongli
                 Dong",
  title =        "Connect {API} with Blockchain: a Survey on Blockchain
                 Oracle Implementation",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "208:1--208:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3567582",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3567582",
  abstract =     "A blockchain is a form of distributed ledger
                 technology where transactions as data state changes are
                 permanently recorded securely and transparently without
                 the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "208",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Catania:2023:CAT,
  author =       "Fabio Catania and Micol Spitale and Franca Garzotto",
  title =        "Conversational Agents in Therapeutic Interventions for
                 Neurodevelopmental Disorders: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "209:1--209:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3564269",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3564269",
  abstract =     "Neurodevelopmental Disorders (NDD) are a group of
                 conditions with onset in the developmental period
                 characterized by deficits in the cognitive and social
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "209",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gonnord:2023:SPD,
  author =       "Laure Gonnord and Ludovic Henrio and Lionel Morel and
                 Gabriel Radanne",
  title =        "A Survey on Parallelism and Determinism",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "210:1--210:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3564529",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3564529",
  abstract =     "Parallelism is often required for performance. In
                 these situations an excess of non-determinism is
                 harmful as it means the program can have several
                 different \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "210",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sado:2023:EGD,
  author =       "Fatai Sado and Chu Kiong Loo and Wei Shiung Liew and
                 Matthias Kerzel and Stefan Wermter",
  title =        "Explainable Goal-driven Agents and Robots --- a
                 Comprehensive Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "211:1--211:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3564240",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3564240",
  abstract =     "Recent applications of autonomous agents and robots
                 have brought attention to crucial trust-related
                 challenges associated with the current generation of
                 artificial \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "211",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2023:SED,
  author =       "Jou-An Chen and Wei Niu and Bin Ren and Yanzhi Wang
                 and Xipeng Shen",
  title =        "Survey: Exploiting Data Redundancy for Optimization of
                 Deep Learning",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "212:1--212:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3564663",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3564663",
  abstract =     "Data redundancy is ubiquitous in the inputs and
                 intermediate results of Deep Neural Networks (DNN). It
                 offers many significant opportunities for improving DNN
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "212",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Antonyshyn:2023:MMR,
  author =       "Luke Antonyshyn and Jefferson Silveira and Sidney
                 Givigi and Joshua Marshall",
  title =        "Multiple Mobile Robot Task and Motion Planning: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "213:1--213:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3564696",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3564696",
  abstract =     "With recent advances in mobile robotics, autonomous
                 systems, and artificial intelligence, there is a
                 growing expectation that robots are able to solve
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "213",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{deOliveira:2023:VRS,
  author =       "Tain{\~a} Ribeiro de Oliveira and Brenda Biancardi
                 Rodrigues and Matheus Moura da Silva and Rafael Antonio
                 N. Spinass{\'e} and Gabriel Giesen Ludke and Mateus Ruy
                 Soares Gaudio and Guilherme Iglesias Rocha Gomes and
                 Luan Guio Cotini and Daniel da Silva Vargens and
                 Marcelo Queiroz Schimidt and Rodrigo Varej{\~a}o
                 Andre{\~a}o and M{\'a}rio Mestria",
  title =        "Virtual Reality Solutions Employing Artificial
                 Intelligence Methods: a Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "214:1--214:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3565020",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3565020",
  abstract =     "Although there are methods of artificial intelligence
                 (AI) applied to virtual reality (VR) solutions, there
                 are few studies in the literature. Thus, to fill this
                 gap, we \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "214",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nafees:2023:SGC,
  author =       "Muhammad Nouman Nafees and Neetesh Saxena and Alvaro
                 Cardenas and Santiago Grijalva and Pete Burnap",
  title =        "Smart Grid Cyber-Physical Situational Awareness of
                 Complex Operational Technology Attacks: a Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "215:1--215:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3565570",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3565570",
  abstract =     "The smart grid (SG), regarded as the complex
                 cyber-physical ecosystem of infrastructures,
                 orchestrates advanced communication, computation, and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "215",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Papagiannopoulos:2023:SCM,
  author =       "Kostas Papagiannopoulos and Ognjen Glamo{\v{c}}anin
                 and Melissa Azouaoui and Dorian Ros and Francesco
                 Regazzoni and Mirjana Stojilovi{\'c}",
  title =        "The Side-channel Metrics Cheat Sheet",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "216:1--216:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3565571",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3565571",
  abstract =     "Side-channel attacks exploit a physical observable
                 originating from a cryptographic device in order to
                 extract its secrets. Many practically relevant advances
                 in \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "216",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Boulila:2023:WWP,
  author =       "Elyssa Boulila and Marc Dacier",
  title =        "{WPAD}: Waiting Patiently for an Announced Disaster",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "217:1--217:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3565361",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3565361",
  abstract =     "The Web Proxy Auto-Discovery protocol (wpad $^1$ ) is
                 widely used despite being flawed. Its purpose is to
                 enable a client machine to autonomously identify an
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "217",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yuan:2023:SMS,
  author =       "Gongsheng Yuan and Jiaheng Lu and Zhengtong Yan and
                 Sai Wu",
  title =        "A Survey on Mapping Semi-Structured Data and Graph
                 Data to Relational Data",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "10",
  pages =        "218:1--218:??",
  month =        oct,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3567444",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:17 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3567444",
  abstract =     "The data produced by various services should be stored
                 and managed in an appropriate format for gaining
                 valuable knowledge conveniently. This leads to the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "218",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Georgoulias:2023:BBM,
  author =       "Dimitrios Georgoulias and Jens Myrup Pedersen and
                 Morten Falch and Emmanouil Vasilomanolakis",
  title =        "Botnet Business Models, Takedown Attempts, and the
                 Darkweb Market: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "219:1--219:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3575808",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3575808",
  abstract =     "Botnets account for a substantial portion of
                 cybercrime. Botmasters utilize darkweb marketplaces to
                 promote and provide their services, which can vary from
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "219",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{DiGrazia:2023:CSS,
  author =       "Luca {Di Grazia} and Michael Pradel",
  title =        "Code Search: a Survey of Techniques for Finding Code",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "220:1--220:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3565971",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3565971",
  abstract =     "The immense amounts of source code provide ample
                 challenges and opportunities during software
                 development. To handle the size of code bases,
                 developers \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "220",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Viola:2023:SVN,
  author =       "Roberto Viola and {\'A}ngel Mart{\'{\i}}n and Mikel
                 Zorrilla and Jon Montalb{\'a}n and Pablo Angueira and
                 Gabriel-Miro Muntean",
  title =        "A Survey on Virtual Network Functions for Media
                 Streaming: Solutions and Future Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "221:1--221:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3567826",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3567826",
  abstract =     "Media services must ensure an enhanced user's
                 perceived quality during content playback to attract
                 and retain audiences, especially while the streams are
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "221",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Valero:2023:CEA,
  author =       "Jos{\'e} Mar{\'{\i}}a Jorquera Valero and Pedro Miguel
                 S{\'a}nchez S{\'a}nchez and Manuel Gil P{\'e}rez and
                 Alberto Huertas Celdr{\'a}n and Gregorio Martinez
                 Perez",
  title =        "Cutting-Edge Assets for Trust in {5G} and Beyond:
                 Requirements, State of the Art, Trends, and
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "222:1--222:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3572717",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3572717",
  abstract =     "In 5G and beyond, the figure of cross-operator/domain
                 connections and relationships grows exponentially among
                 stakeholders, resources, and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "222",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Choudhary:2023:SSS,
  author =       "Priyankar Choudhary and Neeraj Goel and Mukesh Saini",
  title =        "A Survey on Seismic Sensor based Target Detection,
                 Localization, Identification, and Activity
                 Recognition",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "223:1--223:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3568671",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3568671",
  abstract =     "Current sensor technologies facilitate device-free and
                 non-invasive monitoring of target activities and
                 infrastructures to ensure a safe and inhabitable
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "223",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Abdelrahman:2023:KTS,
  author =       "Ghodai Abdelrahman and Qing Wang and Bernardo Nunes",
  title =        "Knowledge Tracing: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "224:1--224:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3569576",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3569576",
  abstract =     "Humans' ability to transfer knowledge through teaching
                 is one of the essential aspects for human intelligence.
                 A human teacher can track the knowledge of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "224",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dann:2023:NRD,
  author =       "Jonas Dann and Daniel Ritter and Holger Fr{\"o}ning",
  title =        "Non-relational Databases on {FPGAs}: Survey, Design
                 Decisions, Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "225:1--225:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3568990",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3568990",
  abstract =     "Non-relational database systems (NRDS) such as graph
                 and key-value have gained attention in various trending
                 business and analytical application domains. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "225",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2023:PGD,
  author =       "Yang Li and Michael Purcell and Thierry Rakotoarivelo
                 and David Smith and Thilina Ranbaduge and Kee Siong
                 Ng",
  title =        "Private Graph Data Release: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "226:1--226:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3569085",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3569085",
  abstract =     "The application of graph analytics to various domains
                 has yielded tremendous societal and economical benefits
                 in recent years. However, the increasingly \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "226",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Picek:2023:SDL,
  author =       "Stjepan Picek and Guilherme Perin and Luca Mariot and
                 Lichao Wu and Lejla Batina",
  title =        "{SoK}: Deep Learning-based Physical Side-channel
                 Analysis",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "227:1--227:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3569577",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3569577",
  abstract =     "Side-channel attacks represent a realistic and serious
                 threat to the security of embedded devices for already
                 almost three decades. A variety of attacks and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "227",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Seifert:2023:HCA,
  author =       "Michael Seifert and Stephan Kuehnel and Stefan
                 Sackmann",
  title =        "Hybrid Clouds Arising from Software as a Service
                 Adoption: Challenges, Solutions, and Future Research
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "228:1--228:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3570156",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3570156",
  abstract =     "Information technology (IT) departments are
                 increasingly challenged to replace legacy applications
                 with novel public cloud software as a service (SaaS) to
                 innovate the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "228",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ranathunga:2023:NMT,
  author =       "Surangika Ranathunga and En-Shiun Annie Lee and
                 Marjana Prifti Skenduli and Ravi Shekhar and Mehreen
                 Alam and Rishemjit Kaur",
  title =        "Neural Machine Translation for Low-resource Languages:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "229:1--229:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3567592",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3567592",
  abstract =     "Neural Machine Translation (NMT) has seen tremendous
                 growth in the last ten years since the early 2000s and
                 has already entered a mature phase. While \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "229",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Huang:2023:SRA,
  author =       "Bo Huang and Mengchu Zhou and Xiaoyu Sean Lu and
                 Abdullah Abusorrah",
  title =        "Scheduling of Resource Allocation Systems with Timed
                 {Petri} Nets: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "230:1--230:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3570326",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3570326",
  abstract =     "Resource allocation systems (RASs) belong to a kind of
                 discrete event system commonly seen in the industry. In
                 such systems, available resources are allocated to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "230",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2023:CDW,
  author =       "Chen Chen and Gang Zhou and Youfang Lin",
  title =        "Cross-Domain {WiFi} Sensing with Channel State
                 Information: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "231:1--231:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3570325",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3570325",
  abstract =     "The past years have witnessed the rapid
                 conceptualization and development of wireless sensing
                 based on Channel State Information (CSI) with commodity
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "231",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2023:SSR,
  author =       "Ziqiang Li and Muhammad Usman and Rentuo Tao and
                 Pengfei Xia and Chaoyue Wang and Huanhuan Chen and Bin
                 Li",
  title =        "A Systematic Survey of Regularization and
                 Normalization in {GANs}",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "232:1--232:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3569928",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3569928",
  abstract =     "Generative Adversarial Networks (GANs) have been
                 widely applied in different scenarios thanks to the
                 development of deep neural networks. The original GAN
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "232",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mishra:2023:TLS,
  author =       "Rahul Mishra and Hari Gupta",
  title =        "Transforming Large-Size to Lightweight Deep Neural
                 Networks for {IoT} Applications",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "233:1--233:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3570955",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3570955",
  abstract =     "Deep Neural Networks (DNNs) have gained unprecedented
                 popularity due to their high-order performance and
                 automated feature extraction capability. This has
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "233",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jones:2023:PPU,
  author =       "Michael Jones and Soufiene Djahel and Kristopher
                 Welsh",
  title =        "Path-Planning for Unmanned Aerial Vehicles with
                 Environment Complexity Considerations: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "234:1--234:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3570723",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3570723",
  abstract =     "Unmanned aerial vehicles (UAVs) have the potential to
                 make a significant impact in a range of scenarios where
                 it is too risky or too costly to rely on human labour.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "234",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Shen:2023:FFR,
  author =       "Li-Hsiang Shen and Kai-Ten Feng and Lajos Hanzo",
  title =        "Five Facets of {6G}: Research Challenges and
                 Opportunities",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "235:1--235:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571072",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571072",
  abstract =     "While the fifth-generation systems are being rolled
                 out across the globe, researchers have turned their
                 attention to the exploration of radical next-generation
                 solutions. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "235",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Legaard:2023:CNN,
  author =       "Christian Legaard and Thomas Schranz and Gerald
                 Schweiger and J{\'a}n Drgo{\v{n}}a and Basak Falay and
                 Cl{\'a}udio Gomes and Alexandros Iosifidis and Mahdi
                 Abkar and Peter Larsen",
  title =        "Constructing Neural Network Based Models for
                 Simulating Dynamical Systems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "236:1--236:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3567591",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3567591",
  abstract =     "Dynamical systems see widespread use in natural
                 sciences like physics, biology, and chemistry, as well
                 as engineering disciplines such as circuit analysis,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "236",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rajapaksha:2023:ABI,
  author =       "Sampath Rajapaksha and Harsha Kalutarage and M. Omar
                 Al-Kadri and Andrei Petrovski and Garikayi Madzudzo and
                 Madeline Cheah",
  title =        "{AI-Based} Intrusion Detection Systems for In-Vehicle
                 Networks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "237:1--237:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3570954",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3570954",
  abstract =     "The Controller Area Network (CAN) is the most widely
                 used in-vehicle communication protocol, which still
                 lacks the implementation of suitable \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "237",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xu:2023:SDE,
  author =       "Jiahua Xu and Krzysztof Paruch and Simon Cousaert and
                 Yebo Feng",
  title =        "{SoK}: Decentralized Exchanges {(DEX)} with Automated
                 Market Maker {(AMM)} Protocols",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "238:1--238:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3570639",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3570639",
  abstract =     "As an integral part of the decentralized finance
                 (DeFi) ecosystem, decentralized exchanges (DEXs) with
                 automated market maker (AMM) protocols have \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "238",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hijma:2023:OTG,
  author =       "Pieter Hijma and Stijn Heldens and Alessio Sclocco and
                 Ben van Werkhoven and Henri E. Bal",
  title =        "Optimization Techniques for {GPU} Programming",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "239:1--239:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3570638",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3570638",
  abstract =     "In the past decade, Graphics Processing Units have
                 played an important role in the field of
                 high-performance computing and they still advance new
                 fields such as IoT, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "239",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhu:2023:BEF,
  author =       "Juncen Zhu and Jiannong Cao and Divya Saxena and Shan
                 Jiang and Houda Ferradi",
  title =        "Blockchain-empowered Federated Learning: Challenges,
                 Solutions, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "11",
  pages =        "240:1--240:??",
  month =        nov,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3570953",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Mar 23 11:17:18 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3570953",
  abstract =     "Federated learning is a privacy-preserving machine
                 learning technique that trains models across multiple
                 devices holding local data samples without exchanging
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "240",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rahman:2023:WAD,
  author =       "Md Rayhanur Rahman and Rezvan Mahdavi Hezaveh and
                 Laurie Williams",
  title =        "What Are the Attackers Doing Now? {Automating}
                 Cyberthreat Intelligence Extraction from Text on Pace
                 with the Changing Threat Landscape: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "241:1--241:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571726",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571726",
  abstract =     "Cybersecurity researchers have contributed to the
                 automated extraction of CTI from textual sources, such
                 as threat reports and online articles describing
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "241",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jeyaraj:2023:RMC,
  author =       "Rathinaraja Jeyaraj and Anandkumar Balasubramaniam and
                 Ajay Kumara M. A. and Nadra Guizani and Anand Paul",
  title =        "Resource Management in Cloud and Cloud-influenced
                 Technologies for {Internet of Things} Applications",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "242:1--242:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571729",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571729",
  abstract =     "The trend of adopting Internet of Things (IoT) in
                 healthcare, smart cities, Industry 4.0, and so on is
                 increasing by means of cloud computing, which provides
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "242",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rathi:2023:ENC,
  author =       "Nitin Rathi and Indranil Chakraborty and Adarsh Kosta
                 and Abhronil Sengupta and Aayush Ankit and
                 Priyadarshini Panda and Kaushik Roy",
  title =        "Exploring Neuromorphic Computing Based on Spiking
                 Neural Networks: Algorithms to Hardware",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "243:1--243:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571155",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571155",
  abstract =     "Neuromorphic Computing, a concept pioneered in the
                 late 1980s, is receiving a lot of attention lately due
                 to its promise of reducing the computational \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "243",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gao:2023:SSG,
  author =       "Jianhua Gao and Weixing Ji and Fangli Chang and Shiyu
                 Han and Bingxin Wei and Zeming Liu and Yizhuo Wang",
  title =        "A Systematic Survey of General Sparse Matrix--Matrix
                 Multiplication",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "244:1--244:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571157",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571157",
  abstract =     "General Sparse Matrix-Matrix Multiplication (SpGEMM)
                 has attracted much attention from researchers in graph
                 analyzing, scientific computing, and deep earning. Many
                 optimization techniques have been developed for
                 different applications and computing architectures over
                 the past decades. The objective of this article is to
                 provide a structured and comprehensive overview of the
                 researches on SpGEMM. Existing researches have been
                 grouped into different categories based on target
                 architectures and design choices. Covered topics
                 include typical applications, compression formats,
                 general formulations, key problems and techniques,
                 architecture-oriented optimizations, and programming
                 models. The rationales of different algorithms are
                 analyzed and summarized. This survey sufficiently
                 reveals the latest progress of SpGEMM research to 2021.
                 Moreover, a thorough performance comparison of existing
                 implementations is presented. Based on our findings, we
                 highlight future research directions, which encourage
                 better design and implementations in later studies.",
  acknowledgement = ack-nhfb,
  articleno =    "244",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2023:SPO,
  author =       "Yun Zhang and Linwei Zhu and Gangyi Jiang and Sam
                 Kwong and C.-C. Jay Kuo",
  title =        "A Survey on Perceptually Optimized Video Coding",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "245:1--245:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571727",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571727",
  abstract =     "To provide users with more realistic visual
                 experiences, videos are developing in the trends of
                 Ultra High Definition (UHD), High Frame Rate (HFR),
                 High Dynamic \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "245",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dey:2023:PMC,
  author =       "Jayashree Dey and Ratna Dutta",
  title =        "Progress in Multivariate Cryptography: Systematic
                 Review, Challenges, and Research Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "246:1--246:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571071",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571071",
  abstract =     "Multivariate Public Key Cryptosystem (MPKC) seem to be
                 promising toward future digital security even in the
                 presence of quantum adversaries. MPKCs derive their
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "246",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Heidari:2023:MLA,
  author =       "Arash Heidari and Nima Jafari Navimipour and Mehmet
                 Unal and Guodao Zhang",
  title =        "Machine Learning Applications in {Internet-of-Drones}:
                 Systematic Review, Recent Deployments, and Open
                 Issues",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "247:1--247:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571728",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571728",
  abstract =     "Deep Learning (DL) and Machine Learning (ML) are
                 effectively utilized in various complicated challenges
                 in healthcare, industry, and academia. The \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "247",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ji:2023:SHN,
  author =       "Ziwei Ji and Nayeon Lee and Rita Frieske and Tiezheng
                 Yu and Dan Su and Yan Xu and Etsuko Ishii and Ye Jin
                 Bang and Andrea Madotto and Pascale Fung",
  title =        "Survey of Hallucination in Natural Language
                 Generation",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "248:1--248:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571730",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571730",
  abstract =     "Natural Language Generation (NLG) has improved
                 exponentially in recent years thanks to the development
                 of sequence-to-sequence deep learning \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "248",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Martinez:2023:CRS,
  author =       "Antonio L{\'o}pez Mart{\'{\i}}nez and Manuel Gil
                 P{\'e}rez and Antonio Ruiz-Mart{\'{\i}}nez",
  title =        "A Comprehensive Review of the State-of-the-Art on
                 Security and Privacy Issues in Healthcare",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "249:1--249:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571156",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571156",
  abstract =     "Currently, healthcare is critical environment in our
                 society, which attracts attention to malicious
                 activities and has caused an important number of
                 damaging \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "249",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wu:2023:SDS,
  author =       "Caesar Wu and Rui Zhang and Ramamohanarao Kotagiri and
                 Pascal Bouvry",
  title =        "Strategic Decisions: Survey, Taxonomy, and Future
                 Directions from Artificial Intelligence Perspective",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "250:1--250:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571807",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571807",
  abstract =     "Strategic Decision-Making is always challenging
                 because it is inherently uncertain, ambiguous, risky,
                 and complex. By contrast to tactical and operational
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "250",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Buser:2023:SES,
  author =       "Maxime Buser and Rafael Dowsley and Muhammed Esgin and
                 Cl{\'e}mentine Gritti and Shabnam Kasra Kermanshahi and
                 Veronika Kuchta and Jason Legrow and Joseph Liu and
                 Rapha{\"e}l Phan and Amin Sakzad and Ron Steinfeld and
                 Jiangshan Yu",
  title =        "A Survey on Exotic Signatures for Post-quantum
                 Blockchain: Challenges and Research Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "251:1--251:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3572771",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3572771",
  abstract =     "Blockchain technology provides efficient and secure
                 solutions to various online activities by utilizing a
                 wide range of cryptographic tools. In this article, we
                 survey the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "251",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Damsgaard:2023:AOE,
  author =       "Hans Jakob Damsgaard and Aleksandr Ometov and Jari
                 Nurmi",
  title =        "Approximation Opportunities in Edge Computing
                 Hardware: a Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "252:1--252:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3572772",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3572772",
  abstract =     "With the increasing popularity of the Internet of
                 Things and massive Machine Type Communication
                 technologies, the number of connected devices is
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "252",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Catalyurek:2023:MRA,
  author =       "{\"U}mit {\c{C}}ataly{\"u}rek and Karen Devine and
                 Marcelo Faraj and Lars Gottesb{\"u}ren and Tobias Heuer
                 and Henning Meyerhenke and Peter Sanders and Sebastian
                 Schlag and Christian Schulz and Daniel Seemaier and
                 Dorothea Wagner",
  title =        "More Recent Advances in (Hyper){Graph} Partitioning",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "253:1--253:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3571808",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3571808",
  abstract =     "In recent years, significant advances have been made
                 in the design and evaluation of balanced (hyper)graph
                 partitioning algorithms. We survey trends of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "253",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lin:2023:PIV,
  author =       "Weiwei Lin and Chennian Xiong and Wentai Wu and Fang
                 Shi and Keqin Li and Minxian Xu",
  title =        "Performance Interference of Virtual Machines: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "254:1--254:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3573009",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3573009",
  abstract =     "The rapid development of cloud computing with
                 virtualization technology has benefited both academia
                 and industry. For any cloud data center at scale, one
                 of the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "254",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Smith-Miles:2023:ISA,
  author =       "Kate Smith-Miles and Mario Andr{\'e}s Mu{\~n}oz",
  title =        "Instance Space Analysis for Algorithm Testing:
                 Methodology and Software Tools",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "255:1--255:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3572895",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3572895",
  abstract =     "Instance Space Analysis (ISA) is a recently developed
                 methodology to (a) support objective testing of
                 algorithms and (b) assess the diversity of test
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "255",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kotti:2023:MLS,
  author =       "Zoe Kotti and Rafaila Galanopoulou and Diomidis
                 Spinellis",
  title =        "Machine Learning for Software Engineering: a Tertiary
                 Study",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "256:1--256:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3572905",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3572905",
  abstract =     "Machine learning (ML) techniques increase the
                 effectiveness of software engineering (SE) lifecycle
                 activities. We systematically collected,
                 quality-assessed, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "256",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sha:2023:DPG,
  author =       "Tong Sha and Wei Zhang and Tong Shen and Zhoujun Li
                 and Tao Mei",
  title =        "Deep Person Generation: a Survey from the Perspective
                 of Face, Pose, and Cloth Synthesis",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "257:1--257:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3575656",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3575656",
  abstract =     "Deep person generation has attracted extensive
                 research attention due to its wide applications in
                 virtual agents, video conferencing, online shopping,
                 and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "257",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xiang:2023:SID,
  author =       "Wei Xiang and Bang Wang",
  title =        "A Survey of Implicit Discourse Relation Recognition",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "258:1--258:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3574134",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3574134",
  abstract =     "A discourse containing one or more sentences describes
                 daily issues and events for people to communicate their
                 thoughts and opinions. As sentences are \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "258",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Menghani:2023:EDL,
  author =       "Gaurav Menghani",
  title =        "Efficient Deep Learning: a Survey on Making Deep
                 Learning Models Smaller, Faster, and Better",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "259:1--259:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3578938",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3578938",
  abstract =     "Deep learning has revolutionized the fields of
                 computer vision, natural language understanding, speech
                 recognition, information retrieval, and more.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "259",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hertel:2023:DLT,
  author =       "Robert Hertel and Rachid Benlamri",
  title =        "Deep Learning Techniques for {COVID-19} Diagnosis and
                 Prognosis Based on Radiological Imaging",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "260:1--260:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3576898",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3576898",
  abstract =     "This literature review summarizes the current deep
                 learning methods developed by the medical imaging AI
                 research community that have been focused on \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "260",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2023:SDB,
  author =       "Qin Wang and Jiangshan Yu and Shiping Chen and Yang
                 Xiang",
  title =        "{SoK}: {DAG}-based Blockchain Systems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "261:1--261:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3576899",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3576899",
  abstract =     "Limitations on high latency and low scalability of
                 classical blockchain systems retard their adoptions and
                 applications. Reconstructed blockchain systems
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "261",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zolfaghari:2023:CPD,
  author =       "Behrouz Zolfaghari and Leila Mirsadeghi and Khodakhast
                 Bibak and Kaveh Kavousi",
  title =        "Cancer Prognosis and Diagnosis Methods Based on
                 Ensemble Learning",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "12",
  pages =        "262:1--262:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3580218",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Mar 29 06:37:13 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3580218",
  abstract =     "Ensemble methods try to improve performance via
                 integrating different kinds of input data, features, or
                 learning algorithms. In addition to other \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "262",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2023:WPM,
  author =       "Xiaojie Wang and Jiameng Li and Zhaolong Ning and
                 Qingyang Song and Lei Guo and Song Guo and Mohammad S.
                 Obaidat",
  title =        "Wireless Powered Mobile Edge Computing Networks: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "263:1--263:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3579992",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3579992",
  abstract =     "Wireless Powered Mobile Edge Computing (WPMEC) is an
                 integration of Mobile Edge Computing (MEC) and Wireless
                 Power Transfer (WPT) technologies, to \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "263",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Garg:2023:HBT,
  author =       "Tanmay Garg and Sarah Masud and Tharun Suresh and
                 Tanmoy Chakraborty",
  title =        "Handling Bias in Toxic Speech Detection: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "264:1--264:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3580494",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3580494",
  abstract =     "Detecting online toxicity has always been a challenge
                 due to its inherent subjectivity. Factors such as the
                 context, geography, socio-political climate, and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "264",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cunha:2023:CSI,
  author =       "Washington Cunha and Felipe Viegas and Celso
                 Fran{\c{c}}a and Thierson Rosa and Leonardo Rocha and
                 Marcos Andr{\'e} Gon{\c{c}}alves",
  title =        "A Comparative Survey of Instance Selection Methods
                 applied to Non-Neural and Transformer-Based Text
                 Classification",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "265:1--265:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3582000",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3582000",
  abstract =     "Progress in natural language processing has been
                 dictated by the rule of more: more data, more computing
                 power, more complexity, best exemplified by deep
                 learning \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "265",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2023:COC,
  author =       "Mingyu Liu and Li Pan and Shijun Liu",
  title =        "Cost Optimization for Cloud Storage from User
                 Perspectives: Recent Advances, Taxonomy, and Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "266:1--266:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3582883",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3582883",
  abstract =     "With the development and maturity of cloud storage, it
                 has attracted a large number of users. Although cloud
                 users do not need to concern themselves with the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "266",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dalzochio:2023:PMM,
  author =       "Jovani Dalzochio and Rafael Kunst and Jorge Luis
                 Vict{\'o}ria Barbosa and Pedro Clarindo da Silva Neto
                 and Edison Pignaton and Carla Schwengber ten Caten and
                 Alex de Lima Teodoro da Penha",
  title =        "Predictive Maintenance in the Military Domain: a
                 Systematic Review of the Literature",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "267:1--267:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3586100",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3586100",
  abstract =     "Military troops rely on maintenance management
                 projects and operations to preserve the materials'
                 ordinary conditions or restore them to combat or
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "267",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gonzalez-Sabbagh:2023:SUC,
  author =       "Salma P. Gonz{\'a}lez-Sabbagh and Antonio
                 Robles-Kelly",
  title =        "A Survey on Underwater Computer Vision",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "268:1--268:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3578516",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3578516",
  abstract =     "Underwater computer vision has attracted increasing
                 attention in the research community due to the recent
                 advances in underwater platforms such as of \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "268",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{deCarnavalet:2023:SAT,
  author =       "Xavier de Carn{\'e} de Carnavalet and Paul C. van
                 Oorschot",
  title =        "A Survey and Analysis of {TLS} Interception Mechanisms
                 and Motivations: Exploring how end-to-end {TLS} is made
                 ``end-to-me'' for web traffic",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "269:1--269:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3580522",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3580522",
  abstract =     "TLS is an end-to-end protocol designed to provide
                 confidentiality and integrity guarantees that improve
                 end-user security and privacy. While TLS helps
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "269",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Das:2023:MSA,
  author =       "Ringki Das and Thoudam Doren Singh",
  title =        "Multimodal Sentiment Analysis: a Survey of Methods,
                 Trends, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "270:1--270:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3586075",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3586075",
  abstract =     "Sentiment analysis has come long way since it was
                 introduced as a natural language processing task nearly
                 20 years ago. Sentiment analysis aims to extract
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "270",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Song:2023:CSF,
  author =       "Yisheng Song and Ting Wang and Puyu Cai and Subrota K.
                 Mondal and Jyoti Prakash Sahoo",
  title =        "A Comprehensive Survey of Few-shot Learning:
                 Evolution, Applications, Challenges, and
                 Opportunities",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "271:1--271:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3582688",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3582688",
  abstract =     "Few-shot learning (FSL) has emerged as an effective
                 learning method and shows great potential. Despite the
                 recent creative works in tackling FSL tasks, learning
                 valid \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "271",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gammulle:2023:CHA,
  author =       "Harshala Gammulle and David Ahmedt-Aristizabal and
                 Simon Denman and Lachlan Tychsen-Smith and Lars
                 Petersson and Clinton Fookes",
  title =        "Continuous Human Action Recognition for Human-machine
                 Interaction: a Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "272:1--272:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3587931",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3587931",
  abstract =     "With advances in data-driven machine learning
                 research, a wide variety of prediction models have been
                 proposed to capture spatio-temporal features \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "272",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Abbas:2023:SAE,
  author =       "Haider Abbas and Naina Emmanuel and Muhammad Faisal
                 Amjad and Tahreem Yaqoob and Mohammed Atiquzzaman and
                 Zafar Iqbal and Narmeen Shafqat and Waleed {Bin Shahid}
                 and Ali Tanveer and Umer Ashfaq",
  title =        "Security Assessment and Evaluation of {VPNs}: a
                 Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "273:1--273:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3579162",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3579162",
  abstract =     "The use of Virtual Private Networks (VPNs) has
                 witnessed an outstanding rise as they aim to provide
                 confidentiality and anonymity to communication. Despite
                 this \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "273",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Greca:2023:SPA,
  author =       "Renan Greca and Breno Miranda and Antonia Bertolino",
  title =        "State of Practical Applicability of Regression Testing
                 Research: a Live Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "274:1--274:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3579851",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3579851",
  abstract =     "Context: Software regression testing refers to
                 rerunning test cases after the system under test is
                 modified, ascertaining that the changes have not
                 (re-)introduced \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "274",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Casadei:2023:MCS,
  author =       "Roberto Casadei",
  title =        "Macroprogramming: Concepts, State of the Art, and
                 Opportunities of Macroscopic Behaviour Modelling",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "275:1--275:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3579353",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3579353",
  abstract =     "Macroprogramming refers to the theory and practice of
                 expressing the macro(scopic) behaviour of a collective
                 system using a single program. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "275",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lee:2023:REC,
  author =       "JunKyu Lee and Lev Mukhanov and Amir Sabbagh
                 Molahosseini and Umar Minhas and Yang Hua and Jesus
                 Martinez del Rincon and Kiril Dichev and Cheol-Ho Hong
                 and Hans Vandierendonck",
  title =        "Resource-Efficient Convolutional Networks: a Survey on
                 Model-, Arithmetic-, and Implementation-Level
                 Techniques",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "276:1--276:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3587095",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3587095",
  abstract =     "Convolutional neural networks (CNNs) are used in our
                 daily life, including self-driving cars, virtual
                 assistants, social network services, healthcare
                 services, and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "276",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Andre:2023:FUS,
  author =       "{\'E}tienne Andr{\'e} and Shuang Liu and Yang Liu and
                 Christine Choppy and Jun Sun and Jin Song Dong",
  title =        "Formalizing {UML} State Machines for Automated
                 Verification --- a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "277:1--277:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3579821",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3579821",
  abstract =     "The Unified Modeling Language (UML) is a standard for
                 modeling dynamic systems. UML behavioral state machines
                 are used for modeling the dynamic behavior of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "277",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xu:2023:SBC,
  author =       "Jie Xu and Cong Wang and Xiaohua Jia",
  title =        "A Survey of Blockchain Consensus Protocols",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "278:1--278:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3579845",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3579845",
  abstract =     "Blockchain consensus protocols have been a focus of
                 attention since the advent of Bitcoin. Although classic
                 distributed consensus algorithms made \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "278",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gui:2023:CST,
  author =       "Jie Gui and Xiaofeng Cong and Yuan Cao and Wenqi Ren
                 and Jun Zhang and Jing Zhang and Jiuxin Cao and Dacheng
                 Tao",
  title =        "A Comprehensive Survey and Taxonomy on Single Image
                 Dehazing Based on Deep Learning",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "279:1--279:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3576918",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3576918",
  abstract =     "With the development of convolutional neural networks,
                 hundreds of deep learning-based dehazing methods have
                 been proposed. In this article, we \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "279",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Veiga:2023:RAS,
  author =       "Tiago Veiga and Jennifer Renoux",
  title =        "From Reactive to Active Sensing: a Survey on
                 Information Gathering in Decision-theoretic Planning",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "280:1--280:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3583068",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3583068",
  abstract =     "In traditional decision-theoretic planning,
                 information gathering is a means to a goal. The agent
                 receives information about its environment (state or
                 observation) \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "280",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2023:ECS,
  author =       "Tian Wang and Yuzhu Liang and Xuewei Shen and Xi Zheng
                 and Adnan Mahmood and Quan Z. Sheng",
  title =        "Edge Computing and Sensor-Cloud: Overview, Solutions,
                 and Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "281:1--281:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3582270",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3582270",
  abstract =     "Sensor-cloud originates from extensive recent
                 applications of wireless sensor networks and cloud
                 computing. To draw a roadmap of the current research
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "281",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rajapakse:2023:IEE,
  author =       "Visal Rajapakse and Ishan Karunanayake and Nadeem
                 Ahmed",
  title =        "Intelligence at the Extreme Edge: a Survey on
                 Reformable {TinyML}",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "282:1--282:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3583683",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3583683",
  abstract =     "Machine Learning (TinyML) is an upsurging research
                 field that proposes to democratize the use of Machine
                 Learning and Deep Learning on highly \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "282",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kosch:2023:SMC,
  author =       "Thomas Kosch and Jakob Karolus and Johannes Zagermann
                 and Harald Reiterer and Albrecht Schmidt and Pawe{\l}
                 W. Wo{\'z}niak",
  title =        "A Survey on Measuring Cognitive Workload in
                 Human-Computer Interaction",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "283:1--283:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3582272",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3582272",
  abstract =     "The ever-increasing number of computing devices around
                 us results in more and more systems competing for our
                 attention, making cognitive workload a crucial factor
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "283",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Starzynska-Grzes:2023:CVB,
  author =       "Ma{\l}gorzata B. Starzy{\'n}ska-Grze{\'s} and Robin
                 Roussel and Sam Jacoby and Ali Asadipour",
  title =        "Computer Vision-based Analysis of Buildings and Built
                 Environments: a Systematic Review of Current
                 Approaches",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "284:1--284:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3578552",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3578552",
  abstract =     "Analysing 88 sources published from 2011 to 2021, this
                 article presents a first systematic review of the
                 computer vision-based analysis of buildings and the
                 built \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "284",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2023:AEP,
  author =       "Chang Liu and Han Yu",
  title =        "{AI}-Empowered Persuasive Video Generation: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "285:1--285:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3588764",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3588764",
  abstract =     "Promotional videos are rapidly becoming a popular
                 medium for persuading people to change their behaviours
                 in many settings (e.g., online shopping, social
                 \ldots{})",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "285",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hasan:2023:PLP,
  author =       "Md Rezwan Hasan and Richard Guest and Farzin Deravi",
  title =        "Presentation-level Privacy Protection Techniques for
                 Automated Face Recognition --- a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "286:1--286:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3583135",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3583135",
  abstract =     "The use of Biometric Facial Recognition (FR) systems
                 have become increasingly widespread, especially since
                 the advent of deep neural network-based \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "286",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2023:RAB,
  author =       "Xilu Wang and Yaochu Jin and Sebastian Schmitt and
                 Markus Olhofer",
  title =        "Recent Advances in {Bayesian} Optimization",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "287:1--287:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3582078",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3582078",
  abstract =     "Bayesian optimization has emerged at the forefront of
                 expensive black-box optimization due to its data
                 efficiency. Recent years have witnessed a \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "287",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Schiappa:2023:SSL,
  author =       "Madeline C. Schiappa and Yogesh S. Rawat and Mubarak
                 Shah",
  title =        "Self-Supervised Learning for Videos: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "288:1--288:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3577925",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3577925",
  abstract =     "The remarkable success of deep learning in various
                 domains relies on the availability of large-scale
                 annotated datasets. However, obtaining annotations is
                 expensive \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "288",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Guo:2023:RTT,
  author =       "Huihui Guo and Fan Wu and Yunchuan Qin and Ruihui Li
                 and Keqin Li and Kenli Li",
  title =        "Recent Trends in Task and Motion Planning for
                 Robotics: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "289:1--289:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3583136",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3583136",
  abstract =     "Autonomous robots are increasingly served in
                 real-world unstructured human environments with complex
                 long-horizon tasks, such as restaurant serving
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "289",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2023:EBI,
  author =       "Gang Wang and Qin Wang and Shiping Chen",
  title =        "Exploring Blockchains Interoperability: a Systematic
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "290:1--290:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3582882",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3582882",
  abstract =     "The next-generation blockchain ecosystem is expected
                 to integrate both homogeneous and heterogeneous
                 distributed ledgers. These systems require operations
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "290",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2023:RMM,
  author =       "Xiaojie Zhang and Saptarshi Debroy",
  title =        "Resource Management in Mobile Edge Computing: a
                 Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "291:1--291:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3589639",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3589639",
  abstract =     "With the evolution of 5G and Internet of Things
                 technologies, Mobile Edge Computing (MEC) has emerged
                 as a major computing paradigm. Compared to cloud
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "291",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sharma:2023:SMI,
  author =       "Yogesh Sharma and Deval Bhamare and Nishanth Sastry
                 and Bahman Javadi and Rajkumar Buyya",
  title =        "{SLA} Management in Intent-Driven Service Management
                 Systems: a Taxonomy and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "13s",
  pages =        "292:1--292:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3589339",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:56:59 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3589339",
  abstract =     "Traditional, slow and error-prone human-driven methods
                 to configure and manage Internet service requests are
                 proving unsatisfactory. This is due to an \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "292",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Norambuena:2023:SEB,
  author =       "Brian Felipe Keith Norambuena and Tanushree Mitra and
                 Chris North",
  title =        "A Survey on Event-Based News Narrative Extraction",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "300:1--300:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3584741",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3584741",
  abstract =     "Narratives are fundamental to our understanding of the
                 world, providing us with a natural structure for
                 knowledge representation over time. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "300",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhong:2023:GDM,
  author =       "Zhiwei Zhong and Xianming Liu and Junjun Jiang and
                 Debin Zhao and Xiangyang Ji",
  title =        "Guided Depth Map Super-Resolution: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "301:1--301:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3584860",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3584860",
  abstract =     "Guided depth map super-resolution (GDSR), which aims
                 to reconstruct a high-resolution depth map from a
                 low-resolution observation with the help of a
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "301",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kumar:2023:DFC,
  author =       "Vijay Kumar and Kolin Paul",
  title =        "Device Fingerprinting for Cyber-Physical Systems: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "302:1--302:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3584944",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3584944",
  abstract =     "The continued growth of the cyber-physical system
                 (CPS) and Internet of Things technologies raises device
                 security and monitoring concerns. For device \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "302",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chung:2023:IDE,
  author =       "Mu-Huan Chung and Yuhong Yang and Lu Wang and Greg
                 Cento and Khilan Jerath and Abhay Raman and David Lie
                 and Mark H. Chignell",
  title =        "Implementing Data Exfiltration Defense in Situ: a
                 Survey of Countermeasures and Human Involvement",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "303:1--303:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3582077",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3582077",
  abstract =     "In this article we consider the problem of defending
                 against increasing data exfiltration threats in the
                 domain of cybersecurity. We review existing \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "303",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fournier:2023:PSF,
  author =       "Quentin Fournier and Ga{\'e}tan Marceau Caron and
                 Daniel Aloise",
  title =        "A Practical Survey on Faster and Lighter
                 Transformers",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "304:1--304:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3586074",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3586074",
  abstract =     "Recurrent neural networks are effective models to
                 process sequences. However, they are unable to learn
                 long-term dependencies because of their inherent
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "304",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Olson:2023:DRI,
  author =       "Karl Olson and Jack Wampler and Eric Keller",
  title =        "Doomed to Repeat with {IPv6}? {Characterization} of
                 {NAT}-centric Security in {SOHO} Routers",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "305:1--305:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3586007",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3586007",
  abstract =     "With the transition to IPv6, addressing constraints
                 that necessitated a common security architecture under
                 network address translation (NAT) are no longer
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "305",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Reghenzani:2023:SFT,
  author =       "Federico Reghenzani and Zhishan Guo and William
                 Fornaciari",
  title =        "Software Fault Tolerance in Real-Time Systems:
                 Identifying the Future Research Questions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "306:1--306:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3589950",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3589950",
  abstract =     "Tolerating hardware faults in modern architectures is
                 becoming a prominent problem due to the miniaturization
                 of the hardware components, their \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "306",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ding:2023:SAE,
  author =       "Jiepin Ding and Mingsong Chen and Ting Wang and
                 Junlong Zhou and Xin Fu and Keqin Li",
  title =        "A Survey of {AI}-enabled Dynamic Manufacturing
                 Scheduling: From Directed Heuristics to Autonomous
                 Learning",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "307:1--307:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3590163",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3590163",
  abstract =     "As one of the most complex parts in manufacturing
                 systems, scheduling plays an important role in the
                 efficient allocation of resources to meet individual
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "307",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ihle:2023:IMP,
  author =       "Cornelius Ihle and Dennis Trautwein and Moritz
                 Schubotz and Norman Meuschke and Bela Gipp",
  title =        "Incentive Mechanisms in Peer-to-Peer Networks --- a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "308:1--308:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3578581",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3578581",
  abstract =     "Centralized networks inevitably exhibit single points
                 of failure that malicious actors regularly target.
                 Decentralized networks are more resilient if numerous
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "308",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Carvalho:2023:SPP,
  author =       "T{\^a}nia Carvalho and Nuno Moniz and Pedro Faria and
                 Lu{\'{\i}}s Antunes",
  title =        "Survey on Privacy-Preserving Techniques for Microdata
                 Publication",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "309:1--309:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3588765",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3588765",
  abstract =     "The exponential growth of collected, processed, and
                 shared microdata has given rise to concerns about
                 individuals' privacy. As a result, laws and regulations
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "309",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fulcini:2023:RTM,
  author =       "Tommaso Fulcini and Riccardo Coppola and Luca Ardito
                 and Marco Torchiano",
  title =        "A Review on Tools, Mechanics, Benefits, and Challenges
                 of Gamified Software Testing",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "310:1--310:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3582273",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3582273",
  abstract =     "Gamification is an established practice in Software
                 Engineering to increase effectiveness and engagement in
                 many practices. This manuscript \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "310",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kalakanti:2023:CCA,
  author =       "Arun Kumar Kalakanti and Shrisha Rao",
  title =        "Computational Challenges and Approaches for Electric
                 Vehicles",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "311:1--311:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3582076",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3582076",
  abstract =     "Researchers worldwide have become increasingly
                 interested in developing computational approaches to
                 handle challenges facing electric vehicles \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "311",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pittaras:2023:CBK,
  author =       "Nikiforos Pittaras and George Giannakopoulos and
                 Panagiotis Stamatopoulos and Vangelis Karkaletsis",
  title =        "Content-based and Knowledge-enriched Representations
                 for Classification Across Modalities: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "312:1--312:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3583682",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3583682",
  abstract =     "This survey documents representation approaches for
                 classification across different modalities, from purely
                 content-based methods to techniques utilizing
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "312",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Breit:2023:CML,
  author =       "Anna Breit and Laura Waltersdorfer and Fajar J.
                 Ekaputra and Marta Sabou and Andreas Ekelhart and
                 Andreea Iana and Heiko Paulheim and Jan Portisch and
                 Artem Revenko and Annette {Ten Teije} and Frank {Van
                 Harmelen}",
  title =        "Combining Machine Learning and Semantic {Web}: a
                 Systematic Mapping Study",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "313:1--313:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3586163",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3586163",
  abstract =     "In line with the general trend in artificial
                 intelligence research to create intelligent systems
                 that combine learning and symbolic components, a new
                 sub-area has \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "313",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Al-Meer:2023:PUF,
  author =       "Abdulaziz Al-Meer and Saif Al-Kuwari",
  title =        "Physical Unclonable Functions {(PUF)} for {IoT}
                 Devices",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "314:1--314:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3591464",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3591464",
  abstract =     "Physical Unclonable Function (PUF) has recently
                 attracted interest from both industry and academia as a
                 potential alternative approach to secure \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "314",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Saini:2023:STR,
  author =       "Shalini Saini and Nitesh Saxena",
  title =        "A Survey of Threats to Research Literature-dependent
                 Medical {AI} Solutions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "315:1--315:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3592597",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3592597",
  abstract =     "Medical Artificial Intelligence (MedAI) harnesses the
                 power of medical research through AI algorithms and
                 vast data to address healthcare challenges. The
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "315",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hammi:2023:STC,
  author =       "Badis Hammi and Sherali Zeadally and Jamel Nebhen",
  title =        "Security Threats, Countermeasures, and Challenges of
                 Digital Supply Chains",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "316:1--316:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3588999",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3588999",
  abstract =     "The rapid growth of Information Communication
                 Technologies (ICT) has impacted many fields. In this
                 context, the supply chain has also quickly \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "316",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Storey:2023:CMT,
  author =       "Veda C. Storey and Roman Lukyanenko and Arturo
                 Castellanos",
  title =        "Conceptual Modeling: Topics, Themes, and Technology
                 Trends",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "317:1--317:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3589338",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3589338",
  abstract =     "Conceptual modeling is an important part of
                 information systems development and use that involves
                 identifying and representing relevant aspects of
                 reality. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "317",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dhelim:2023:DMD,
  author =       "Sahraoui Dhelim and Liming Chen and Sajal K. Das and
                 Huansheng Ning and Chris Nugent and Gerard Leavey and
                 Dirk Pesch and Eleanor Bantry-White and Devin Burns",
  title =        "Detecting Mental Distresses Using Social Behavior
                 Analysis in the Context of {COVID-19}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "318:1--318:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3589784",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3589784",
  abstract =     "Online social media provides a channel for monitoring
                 people's social behaviors from which to infer and
                 detect their mental distresses. During the COVID-19
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "318",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Govers:2023:RHD,
  author =       "Jarod Govers and Philip Feldman and Aaron Dant and
                 Panos Patros",
  title =        "Down the Rabbit Hole: Detecting Online Extremism,
                 Radicalisation, and Politicised Hate Speech",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "319:1--319:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3583067",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3583067",
  abstract =     "Social media is a modern person's digital voice to
                 project and engage with new ideas and mobilise
                 communities-a power shared with extremists. Given the
                 societal \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "319",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nurgalieva:2023:NRF,
  author =       "Leysan Nurgalieva and Alisa Frik and Gavin Doherty",
  title =        "A Narrative Review of Factors Affecting the
                 Implementation of Privacy and Security Practices in
                 Software Development",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "320:1--320:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3589951",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3589951",
  abstract =     "Privacy and security are complex topics, raising a
                 variety of considerations and requirements that can be
                 challenging to implement in software \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "320",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pallewatta:2023:PMB,
  author =       "Samodha Pallewatta and Vassilis Kostakos and Rajkumar
                 Buyya",
  title =        "Placement of Microservices-based {IoT} Applications in
                 Fog Computing: a Taxonomy and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "321:1--321:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3592598",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3592598",
  abstract =     "The Fog computing paradigm utilises distributed,
                 heterogeneous and resource-constrained devices at the
                 edge of the network for efficient deployment \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "321",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Will:2023:ISG,
  author =       "Newton C. Will and Carlos A. Maziero",
  title =        "{Intel Software Guard Extensions} Applications: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "322:1--322:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3593021",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3593021",
  abstract =     "Data confidentiality is a central concern in modern
                 computer systems and services, as sensitive data from
                 users and companies are being increasingly delegated to
                 such systems. Several hardware-based mechanisms have
                 been recently proposed to enforce security guarantees
                 of sensitive information. Hardware-based isolated
                 execution environments are a class of such mechanisms,
                 in which the operating system and other low-level
                 components are removed from the trusted computing base.
                 One of such mechanisms is the Intel Software Guard
                 Extensions (Intel SGX), which creates the concept of
                 enclave to encapsulate sensitive components of
                 applications and their data. Despite being largely
                 applied in several computing areas, SGX has limitations
                 and performance issues that must be addressed for the
                 development of secure solutions. This text brings a
                 categorized literature review of the ongoing research
                 on the Intel SGX architecture, discussing its
                 applications and providing a classification of the
                 solutions that take advantage of SGX mechanisms. We
                 analyze and categorize 293 papers that rely on SGX to
                 provide integrity, confidentiality, and privacy to
                 users and data, regarding different contexts and goals.
                 We also discuss research challenges and provide future
                 directions in the field of enclaved execution,
                 particularly when using SGX.",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "322",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pan:2023:DPS,
  author =       "Bofeng Pan and Natalia Stakhanova and Suprio Ray",
  title =        "Data Provenance in Security and Privacy",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "323:1--323:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3593294",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3593294",
  abstract =     "Provenance information corresponds to essential
                 metadata that describes the entities, users, and
                 processes involved in the history and evolution of a
                 data \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "323",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Oliynyk:2023:KWY,
  author =       "Daryna Oliynyk and Rudolf Mayer and Andreas Rauber",
  title =        "{I} Know What You Trained Last Summer: a Survey on
                 Stealing Machine Learning Models and Defences",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "324:1--324:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3595292",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3595292",
  abstract =     "Machine-Learning-as-a-Service (MLaaS) has become a
                 widespread paradigm, making even the most complex
                 Machine Learning models available for clients via,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "324",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zoni:2023:SRT,
  author =       "Davide Zoni and Andrea Galimberti and William
                 Fornaciari",
  title =        "A Survey on Run-time Power Monitors at the Edge",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "325:1--325:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3593044",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3593044",
  abstract =     "Effectively managing energy and power consumption is
                 crucial to the success of the design of any computing
                 system, helping mitigate the efficiency obstacles
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "325",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ivanov:2023:STM,
  author =       "Nikolay Ivanov and Chenning Li and Qiben Yan and
                 Zhiyuan Sun and Zhichao Cao and Xiapu Luo",
  title =        "Security Threat Mitigation for Smart Contracts: a
                 Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "326:1--326:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3593293",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3593293",
  abstract =     "The blockchain technology, initially created for
                 cryptocurrency, has been re-purposed for recording
                 state transitions of smart contracts-decentralized
                 applications that \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "326",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Goknil:2023:SRD,
  author =       "Arda Goknil and Phu Nguyen and Sagar Sen and Dimitra
                 Politaki and Harris Niavis and Karl John Pedersen and
                 Abdillah Suyuthi and Abhilash Anand and Amina
                 Ziegenbein",
  title =        "A Systematic Review of Data Quality in {CPS} and {IoT}
                 for {Industry 4.0}",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "327:1--327:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3593043",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3593043",
  abstract =     "The Internet of Things (IoT) and Cyber-Physical
                 Systems (CPS) are the backbones of Industry 4.0, where
                 data quality is crucial for decision support. Data
                 quality in \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "327",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Han:2023:IAE,
  author =       "Sicong Han and Chenhao Lin and Chao Shen and Qian Wang
                 and Xiaohong Guan",
  title =        "Interpreting Adversarial Examples in Deep Learning: a
                 Review",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "328:1--328:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3594869",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3594869",
  abstract =     "Deep learning technology is increasingly being applied
                 in safety-critical scenarios but has recently been
                 found to be susceptible to imperceptible adversarial
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "328",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2023:SOW,
  author =       "Xiao Zhang and Griffin Klevering and Xinyu Lei and
                 Yiwen Hu and Li Xiao and Guan-Hua Tu",
  title =        "The Security in Optical Wireless Communication: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "14s",
  pages =        "329:1--329:??",
  month =        dec,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3594718",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Aug 19 06:57:00 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3594718",
  abstract =     "With the demand for economical and high-speed wireless
                 services, Optical Wireless Communication (OWC) has
                 attracted increasing attention in both \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "Comp. Surv.",
  articleno =    "329",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Klaiber:2024:DLV,
  author =       "Janice Klaiber and Clemens {Van Dinther}",
  title =        "Deep Learning for Variable Renewable Energy: a
                 Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "1:1--1:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3586006",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3586006",
  abstract =     "In recent years, both fields, AI and VRE, have
                 received increasing attention in scientific research.
                 Thus, this article's purpose is to investigate the
                 potential of \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Coullon:2024:CBD,
  author =       "H{\'e}l{\'e}ne Coullon and Ludovic Henrio and
                 Fr{\'e}d{\'e}ric Loulergue and Simon Robillard",
  title =        "Component-based Distributed Software Reconfiguration:
                 a Verification-oriented Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "2:1--2:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3595376",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3595376",
  abstract =     "Distributed software built from components has become
                 a mainstay of service-oriented applications, which
                 frequently undergo reconfigurations to adapt to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Amanullah:2024:TAM,
  author =       "Mohamed Ahzam Amanullah and Seng W. Loke and Mohan
                 Baruwal Chhetri and Robin Doss",
  title =        "A Taxonomy and Analysis of Misbehaviour Detection in
                 Cooperative Intelligent Transport Systems: a Systematic
                 Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "3:1--3:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3596598",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3596598",
  abstract =     "Cooperative Intelligent Transport Systems (C-ITS) is
                 one of the proposed solutions to improve the safety and
                 efficiency of road transport. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Houy:2024:SAC,
  author =       "Sabine Houy and Philipp Schmid and Alexandre Bartel",
  title =        "Security Aspects of Cryptocurrency Wallets --- a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "4:1--4:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3596906",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3596906",
  abstract =     "Cryptocurrencies are gaining prominence among
                 individuals and companies alike, resulting in the
                 growing adoption of so-called cryptocurrency wallet
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Roy:2024:RQF,
  author =       "Prasenjeet Roy and Suman Kundu",
  title =        "Review on Query-focused Multi-document Summarization
                 {(QMDS)} with Comparative Analysis",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "5:1--5:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3597299",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3597299",
  abstract =     "The problem of query-focused multi-document
                 summarization (QMDS) is to generate a summary from
                 multiple source documents on identical/similar
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Vatter:2024:EDS,
  author =       "Jana Vatter and Ruben Mayer and Hans-Arno Jacobsen",
  title =        "The Evolution of Distributed Systems for Graph Neural
                 Networks and Their Origin in Graph Processing and Deep
                 Learning: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "6:1--6:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3597428",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3597428",
  abstract =     "Graph neural networks (GNNs) are an emerging research
                 field. This specialized deep neural network
                 architecture is capable of processing graph structured
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ji:2024:SDL,
  author =       "Shulei Ji and Xinyu Yang and Jing Luo",
  title =        "A Survey on Deep Learning for Symbolic Music
                 Generation: Representations, Algorithms, Evaluations,
                 and Challenges",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "7:1--7:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3597493",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3597493",
  abstract =     "Significant progress has been made in symbolic music
                 generation with the help of deep learning techniques.
                 However, the tasks covered by symbolic music \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Brcic:2024:IRA,
  author =       "Mario Brcic and Roman V. Yampolskiy",
  title =        "Impossibility Results in {AI}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "8:1--8:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3603371",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3603371",
  abstract =     "An impossibility theorem demonstrates that a
                 particular problem or set of problems cannot be solved
                 as described in the claim. Such theorems put limits on
                 what \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xu:2024:MUS,
  author =       "Heng Xu and Tianqing Zhu and Lefeng Zhang and Wanlei
                 Zhou and Philip S. Yu",
  title =        "Machine Unlearning: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "9:1--9:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3603620",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3603620",
  abstract =     "Machine learning has attracted widespread attention
                 and evolved into an enabling technology for a wide
                 range of highly successful applications, such as
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zolfaghari:2024:SBL,
  author =       "Samaneh Zolfaghari and Sumaiya Suravee and Daniele
                 Riboni and Kristina Yordanova",
  title =        "Sensor-Based Locomotion Data Mining for Supporting the
                 Diagnosis of Neurodegenerative Disorders: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "10:1--10:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3603495",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3603495",
  abstract =     "Locomotion characteristics and movement patterns are
                 reliable indicators of neurodegenerative diseases
                 (NDDs). This survey provides a systematic \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zheng:2024:DLB,
  author =       "Ce Zheng and Wenhan Wu and Chen Chen and Taojiannan
                 Yang and Sijie Zhu and Ju Shen and Nasser Kehtarnavaz
                 and Mubarak Shah",
  title =        "Deep Learning-based Human Pose Estimation: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "11:1--11:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3603618",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3603618",
  abstract =     "Human pose estimation aims to locate the human body
                 parts and build human body representation (e.g., body
                 skeleton) from input data such as images and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hossain:2024:NLB,
  author =       "Bayzid Ashik Hossain and Md. Saddam Hossain Mukta and
                 Md Adnanul Islam and Akib Zaman and Rolf Schwitter",
  title =        "Natural Language-Based Conceptual Modelling
                 Frameworks: State of the Art and Future Opportunities",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "12:1--12:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3596597",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3596597",
  abstract =     "Identifying requirements for an information system is
                 an important task and conceptual modelling is the first
                 step in this process. Conceptual modelling plays a
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ning:2024:MEC,
  author =       "Zhaolong Ning and Hao Hu and Xiaojie Wang and Lei Guo
                 and Song Guo and Guoyin Wang and Xinbo Gao",
  title =        "Mobile Edge Computing and Machine Learning in the
                 {Internet of Unmanned Aerial Vehicles}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "13:1--13:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604933",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604933",
  abstract =     "Unmanned Aerial Vehicles (UAVs) play an important role
                 in the Internet of Things and form the paradigm of the
                 Internet of UAVs, due to their characteristics of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lien:2024:COB,
  author =       "Chi-Wei Lien and Sudip Vhaduri",
  title =        "Challenges and Opportunities of Biometric User
                 Authentication in the Age of {IoT}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "14:1--14:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3603705",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3603705",
  abstract =     "While the Internet of Things (IoT) devices, such as
                 smartwatches, provide a range of services from managing
                 financial transactions to monitoring smart \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2024:SQC,
  author =       "Yaochen Liu and Qiuchi Li and Benyou Wang and Yazhou
                 Zhang and Dawei Song",
  title =        "A Survey of Quantum-cognitively Inspired Sentiment
                 Analysis Models",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "15:1--15:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604550",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604550",
  abstract =     "Quantum theory, originally proposed as a physical
                 theory to describe the motions of microscopic
                 particles, has been applied to various non-physics
                 domains \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Margara:2024:MSD,
  author =       "Alessandro Margara and Gianpaolo Cugola and Nicol{\`o}
                 Felicioni and Stefano Cilloni",
  title =        "A Model and Survey of Distributed Data-Intensive
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "16:1--16:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604801",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604801",
  abstract =     "Data is a precious resource in today's society, and it
                 is generated at an unprecedented and constantly growing
                 pace. The need to store, analyze, and make data
                 promptly \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zabihi:2024:RLM,
  author =       "Zeinab Zabihi and Amir Masoud Eftekhari Moghadam and
                 Mohammad Hossein Rezvani",
  title =        "Reinforcement Learning Methods for Computation
                 Offloading: a Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "17:1--17:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3603703",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3603703",
  abstract =     "Today, cloud computation offloading may not be an
                 appropriate solution for delay-sensitive applications
                 due to the long distance between end-devices and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Parizotto:2024:OML,
  author =       "Ricardo Parizotto and Bruno Loureiro Coelho and Diego
                 Cardoso Nunes and Israat Haque and Alberto
                 Schaeffer-Filho",
  title =        "Offloading Machine Learning to Programmable Data
                 Planes: a Systematic Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "18:1--18:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3605153",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3605153",
  abstract =     "The demand for machine learning (ML) has increased
                 significantly in recent decades, enabling several
                 applications, such as speech recognition, computer
                 vision, and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fu:2024:DLM,
  author =       "Zhe Fu and Xi Niu and Mary Lou Maher",
  title =        "Deep Learning Models for Serendipity Recommendations:
                 a Survey and New Perspectives",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "19:1--19:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3605145",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3605145",
  abstract =     "Serendipitous recommendations have emerged as a
                 compelling approach to deliver users with unexpected
                 yet valuable information, contributing to \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xu:2024:SDO,
  author =       "Rui Xu and Sheng Ma and Yang Guo and Dongsheng Li",
  title =        "A Survey of Design and Optimization for Systolic
                 Array-based {DNN} Accelerators",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "20:1--20:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604802",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604802",
  abstract =     "In recent years, it has been witnessed that the
                 systolic array is a successful architecture for DNN
                 hardware accelerators. However, the design of systolic
                 arrays also \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xiao:2024:SAP,
  author =       "Guoqing Xiao and Chuanghui Yin and Tao Zhou and Xueqi
                 Li and Yuedan Chen and Kenli Li",
  title =        "A Survey of Accelerating Parallel Sparse Linear
                 Algebra",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "21:1--21:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604606",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604606",
  abstract =     "Sparse linear algebra includes the fundamental and
                 important operations in various large-scale scientific
                 computing and real-world applications. There \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Donoso:2024:SSP,
  author =       "Diego Donoso and Jose M. Saavedra",
  title =        "Survey on Sketch-to-photo Translation",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "22:1--22:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3606694",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3606694",
  abstract =     "Sketch-based understanding is involved in human
                 communication and cognitive development, making it
                 essential in visual perception. A specific task in this
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Shen:2024:SNG,
  author =       "Zhishu Shen and Jiong Jin and Cheng Tan and Atsushi
                 Tagami and Shangguang Wang and Qing Li and Qiushi Zheng
                 and Jingling Yuan",
  title =        "A Survey of Next-generation Computing Technologies in
                 Space-air-ground Integrated Networks",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "23:1--23:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3606018",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3606018",
  abstract =     "Space-air-ground integrated networks (SAGINs) are key
                 elements for facilitating high-speed seamless
                 connectivity to the devices/users in \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Antelmi:2024:SHR,
  author =       "Alessia Antelmi and Gennaro Cordasco and Mirko Polato
                 and Vittorio Scarano and Carmine Spagnuolo and Dingqi
                 Yang",
  title =        "A Survey on Hypergraph Representation Learning",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "24:1--24:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3605776",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3605776",
  abstract =     "Hypergraphs have attracted increasing attention in
                 recent years thanks to their flexibility in naturally
                 modeling a broad range of systems where \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kim:2024:BCS,
  author =       "Kisub Kim and Sankalp Ghatpande and Dongsun Kim and
                 Xin Zhou and Kui Liu and Tegawend{\'e} F. Bissyand{\'e}
                 and Jacques Klein and Yves {Le Traon}",
  title =        "{Big Code} Search: a Bibliography",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "1",
  pages =        "25:1--25:??",
  month =        jan,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604905",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Sep 26 11:09:40 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604905",
  abstract =     "Code search is an essential task in software
                 development. Developers often search the internet and
                 other code databases for necessary source code snippets
                 to \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Badshah:2024:TSE,
  author =       "Afzal Badshah and Anwar Ghani and Ali Daud and Ateeqa
                 Jalal and Muhammad Bilal and Jon Crowcroft",
  title =        "Towards Smart Education through {Internet of Things}:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "26:1--26:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3610401",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3610401",
  abstract =     "IoT is a fundamental enabling technology for creating
                 smart spaces, which can assist the effective
                 face-to-face and online education systems. The
                 transition to smart \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ehrmann:2024:NER,
  author =       "Maud Ehrmann and Ahmed Hamdi and Elvys Linhares Pontes
                 and Matteo Romanello and Antoine Doucet",
  title =        "Named Entity Recognition and Classification in
                 Historical Documents: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "27:1--27:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604931",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604931",
  abstract =     "After decades of massive digitisation, an
                 unprecedented number of historical documents are
                 available in digital format, along with their
                 machine-readable \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Brohet:2024:STM,
  author =       "Marco Brohet and Francesco Regazzoni",
  title =        "A Survey on Thwarting Memory Corruption in {RISC-V}",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "28:1--28:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604906",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/risc-v.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604906",
  abstract =     "With embedded devices becoming more pervasive and
                 entrenched in society, it is paramount to keep these
                 systems secure. A threat plaguing these systems
                 consists of software vulnerabilities that cause memory
                 corruption, potentially allowing an attacker to breach
                 the device. Software-based countermeasures exist, but
                 suffer from high overhead. In this survey, we
                 investigate whether this could be mitigated using
                 dedicated hardware. Driven by the advancements of open
                 hardware, we focus on implementations for RISC-V, a
                 novel and open architecture tailored for customization.
                 We distinguish between methods validating memory
                 accesses beforehand, obfuscating information necessary
                 for an attack, and detecting memory values corrupted
                 earlier. We compare on qualitative metrics, such as the
                 security coverage and level of transparency, and
                 performance in both software and hardware. Although
                 current implementations do not easily allow for a fair
                 comparison as their evaluation methodologies vary
                 widely, we show that current implementations are
                 suitable to minimize the runtime overhead with a
                 relatively small area overhead. Nevertheless, we
                 identified that further research is still required to
                 mitigate more fine-grained attacks such as intra-object
                 overflows, to integrate into more sophisticated
                 protected execution environments towards resilient
                 systems that are automatically recoverable, and to move
                 towards more harmonized evaluation.",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alaei:2024:DIQ,
  author =       "Alireza Alaei and Vinh Bui and David Doermann and
                 Umapada Pal",
  title =        "Document Image Quality Assessment: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "29:1--29:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3606692",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3606692",
  abstract =     "The rapid emergence of new portable capturing
                 technologies has significantly increased the number and
                 diversity of document images acquired for \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Min:2024:RAN,
  author =       "Bonan Min and Hayley Ross and Elior Sulem and Amir
                 Pouran {Ben Veyseh} and Thien Huu Nguyen and Oscar
                 Sainz and Eneko Agirre and Ilana Heintz and Dan Roth",
  title =        "Recent Advances in Natural Language Processing via
                 Large Pre-trained Language Models: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "30:1--30:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3605943",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3605943",
  abstract =     "Large, pre-trained language models (PLMs) such as BERT
                 and GPT have drastically changed the Natural Language
                 Processing (NLP) field. For numerous NLP \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Besta:2024:DGD,
  author =       "Maciej Besta and Robert Gerstenberger and Emanuel
                 Peter and Marc Fischer and Micha{\l} Podstawski and
                 Claude Barthels and Gustavo Alonso and Torsten
                 Hoefler",
  title =        "Demystifying Graph Databases: Analysis and Taxonomy of
                 Data Organization, System Designs, and Graph Queries",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "31:1--31:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604932",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604932",
  abstract =     "Numerous irregular graph datasets, for example social
                 networks or web graphs, may contain even trillions of
                 edges. Often, their structure changes over time and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pennekamp:2024:ISI,
  author =       "Jan Pennekamp and Roman Matzutt and Christopher
                 Klinkm{\"u}ller and Lennart Bader and Martin Serror and
                 Eric Wagner and Sidra Malik and Maria Spi{\ss} and
                 Jessica Rahn and Tan G{\"u}rpinar and Eduard Vlad and
                 Sander J. J. Leemans and Salil S. Kanhere and Volker
                 Stich and Klaus Wehrle",
  title =        "An Interdisciplinary Survey on Information Flows in
                 Supply Chains",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "32:1--32:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3606693",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3606693",
  abstract =     "Supply chains form the backbone of modern economies
                 and therefore require reliable information flows. In
                 practice, however, supply chains face severe technical
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fujihashi:2024:SDS,
  author =       "Takuya Fujihashi and Toshiaki Koike-Akino and Takashi
                 Watanabe",
  title =        "Soft Delivery: Survey on a New Paradigm for Wireless
                 and Mobile Multimedia Streaming",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "33:1--33:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3607139",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3607139",
  abstract =     "The increasing demand for video streaming services is
                 the key driver of modern wireless and mobile
                 communications. Although many studies have designed
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lei:2024:EER,
  author =       "Yaxiong Lei and Shijing He and Mohamed Khamis and Juan
                 Ye",
  title =        "An End-to-End Review of Gaze Estimation and its
                 Interactive Applications on Handheld Mobile Devices",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "34:1--34:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3606947",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3606947",
  abstract =     "In recent years, we have witnessed an increasing
                 number of interactive systems on handheld mobile
                 devices which utilise gaze as a single or complementary
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Destras:2024:SAF,
  author =       "Oceane Destras and S{\'e}bastien {Le Beux} and Felipe
                 {Gohring De Magalh{\~a}es} and Gabriela Nicolescu",
  title =        "Survey on Activation Functions for Optical Neural
                 Networks",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "35:1--35:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3607533",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3607533",
  abstract =     "Integrated photonics arises as a fast and
                 energy-efficient technology for the implementation of
                 artificial neural networks (ANNs). Indeed, with the
                 growing \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Deldar:2024:DLZ,
  author =       "Fatemeh Deldar and Mahdi Abadi",
  title =        "Deep Learning for Zero-day Malware Detection and
                 Classification: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "36:1--36:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3605775",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3605775",
  abstract =     "Zero-day malware is malware that has never been seen
                 before or is so new that no anti-malware software can
                 catch it. This novelty and the lack of existing
                 mitigation \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mehrpour:2024:STS,
  author =       "Sahar Mehrpour and Thomas D. Latoza",
  title =        "A Survey of Tool Support for Working with Design
                 Decisions in Code",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "37:1--37:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3607868",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3607868",
  abstract =     "Whenever developers choose among alternative technical
                 approaches, they make a design decision. Collectively,
                 design decisions shape how software \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Roy:2024:TUP,
  author =       "Satyaki Roy and Nirnay Ghosh and Nitish Uplavikar and
                 Preetam Ghosh",
  title =        "Towards a Unified Pandemic Management Architecture:
                 Survey, Challenges, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "38:1--38:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3609324",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3609324",
  abstract =     "The pandemic caused by Severe Acute Respiratory
                 Syndrome Coronavirus 2 (SARS-CoV-2) has impacted the
                 economy, health, and society. Emerging strains are
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2024:PFF,
  author =       "Huiqiang Chen and Tianqing Zhu and Tao Zhang and
                 Wanlei Zhou and Philip S. Yu",
  title =        "Privacy and Fairness in Federated Learning: On the
                 Perspective of Tradeoff",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "39:1--39:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3606017",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3606017",
  abstract =     "Federated learning (FL) has been a hot topic in recent
                 years. Ever since it was introduced, researchers have
                 endeavored to devise FL systems that protect privacy or
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Amira:2024:SMA,
  author =       "Abdelouahab Amira and Abdelouahid Derhab and Elmouatez
                 Billah Karbab and Omar Nouali",
  title =        "A Survey of Malware Analysis Using Community Detection
                 Algorithms",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "40:1--40:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3610223",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3610223",
  abstract =     "In recent years, we have witnessed an overwhelming and
                 fast proliferation of different types of malware
                 targeting organizations and individuals, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2024:SED,
  author =       "Nan Li and Lianbo Ma and Guo Yu and Bing Xue and
                 Mengjie Zhang and Yaochu Jin",
  title =        "Survey on Evolutionary Deep Learning: Principles,
                 Algorithms, Applications, and Open Issues",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "41:1--41:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3603704",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3603704",
  abstract =     "Over recent years, there has been a rapid development
                 of deep learning (DL) in both industry and academia
                 fields. However, finding the optimal \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ghasempouri:2024:SAA,
  author =       "Tara Ghasempouri and Jaan Raik and Cezar Reinbrecht
                 and Said Hamdioui and Mottaqiallah Taouil",
  title =        "Survey on Architectural Attacks: a Unified
                 Classification and Attack Model",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "42:1--42:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604803",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604803",
  abstract =     "According to the World Economic Forum, cyberattacks
                 are considered as one of the most important sources of
                 risk to companies and institutions worldwide.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Barrios:2024:SCC,
  author =       "Carlos Barrios and Mohan Kumar",
  title =        "Service Caching and Computation Reuse Strategies at
                 the Edge: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "43:1--43:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3609504",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3609504",
  abstract =     "With the proliferation of connected devices including
                 smartphones, novel network connectivity and management
                 methods are needed to meet user Quality of \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xu:2024:KGB,
  author =       "Rongxin Xu and Qiujun Lan and Shiva Raj Pokhrel and
                 Gang Li",
  title =        "A Knowledge Graph-Based Survey on Distributed Ledger
                 Technology for {IoT} Verticals",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "44:1--44:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3609503",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3609503",
  abstract =     "The Internet of Things (IoT) and distributed ledger
                 technology (DLT) have significantly changed our daily
                 lives. Due to their distributed operational \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yamout:2024:BSH,
  author =       "Youssef Yamout and Tashaffi Samin Yeasar and Shahrear
                 Iqbal and Mohammad Zulkernine",
  title =        "Beyond Smart Homes: an In-Depth Analysis of Smart
                 Aging Care System Security",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "45:1--45:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3610225",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3610225",
  abstract =     "The upward trend in the percentage of the population
                 older than 65 has made smart aging more relevant than
                 ever before. Growing old in a traditional \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bez:2024:APH,
  author =       "Jean Luca Bez and Suren Byna and Shadi Ibrahim",
  title =        "{I/O} Access Patterns in {HPC} Applications: a $
                 360$-Degree Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "46:1--46:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3611007",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3611007",
  abstract =     "The high-performance computing I/O stack has been
                 complex due to multiple software layers, the
                 inter-dependencies among these layers, and the
                 different \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Buchner:2024:BII,
  author =       "Stefan Buchner and Dirk Riehle",
  title =        "The Business Impact of Inner Source and How to
                 Quantify It",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "47:1--47:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3611648",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3611648",
  abstract =     "Inner source software development is the practice of
                 using open source practices for firm-internal software
                 development. Practitioner reports have shown \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Amini:2024:WCD,
  author =       "Maryam Amini and Razvan Stanica and Catherine
                 Rosenberg",
  title =        "Where Are the (Cellular) Data?",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "48:1--48:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3610402",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3610402",
  abstract =     "New generations of cellular networks are data
                 oriented, targeting the integration of machine learning
                 and artificial intelligence solutions. Data
                 availability, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Debie:2024:SRS,
  author =       "Essam Debie and Kathryn Kasmarik and Matt Garratt",
  title =        "Swarm Robotics: a Survey from a Multi-Tasking
                 Perspective",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "49:1--49:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3611652",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3611652",
  abstract =     "The behaviour of social insects such as bees and ants
                 has influenced the development of swarm robots. To
                 enable robots to cooperate together, swarm robotics
                 employs \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sun:2024:CSC,
  author =       "Danfeng Sun and Junjie Hu and Huifeng Wu and Jia Wu
                 and Jian Yang and Quan Z. Sheng and Schahram Dustdar",
  title =        "A Comprehensive Survey on Collaborative Data-access
                 Enablers in the {IIoT}",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "50:1--50:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3612918",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3612918",
  abstract =     "The scope of the Industrial Internet of Things (IIoT)
                 has stretched beyond manufacturing to include energy,
                 healthcare, transportation, and all that \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ameur:2024:SAH,
  author =       "Asma Ameur and Sana Hamdi and Sadok {Ben Yahia}",
  title =        "Sentiment Analysis for Hotel Reviews: a Systematic
                 Literature Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "51:1--51:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3605152",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3605152",
  abstract =     "Sentiment Analysis (SA) helps to automatically and
                 meaningfully discover hotel customers' satisfaction
                 from their shared experiences and feelings on
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Smith:2024:BRL,
  author =       "Benjamin Smith and Anahita Khojandi and Rama
                 Vasudevan",
  title =        "Bias in Reinforcement Learning: a Review in Healthcare
                 Applications",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "52:1--52:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3609502",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3609502",
  abstract =     "Reinforcement learning (RL) can assist in medical
                 decision making using patient data collected in
                 electronic health record (EHR) systems. RL, a type of
                 machine \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Schuerkamp:2024:EFC,
  author =       "Ryan Schuerkamp and Philippe J. Giabbanelli",
  title =        "Extensions of Fuzzy Cognitive Maps: a Systematic
                 Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "2",
  pages =        "53:1--53:??",
  month =        feb,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3610771",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 4 09:27:39 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3610771",
  abstract =     "Fuzzy Cognitive Maps (FCMs) are widely used to
                 simulate complex systems. However, they cannot handle
                 nonlinear relationships or time delays/lags, nor can
                 they \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Guo:2024:FRT,
  author =       "Yulan Guo and Hanyun Wang and Longguang Wang and
                 Yinjie Lei and Li Liu and Mohammed Bennamoun",
  title =        "{$3$D} Face Recognition: Two Decades of Progress and
                 Prospects",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "54:1--54:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3615863",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3615863",
  abstract =     "Three-dimensional (3D) face recognition has been
                 extensively investigated in the last two decades due to
                 its wide range of applications in many areas, such as
                 security \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2024:PTL,
  author =       "Benyou Wang and Qianqian Xie and Jiahuan Pei and
                 Zhihong Chen and Prayag Tiwari and Zhao Li and Jie Fu",
  title =        "Pre-trained Language Models in Biomedical Domain: a
                 Systematic Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "55:1--55:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3611651",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3611651",
  abstract =     "Pre-trained language models (PLMs) have been the de
                 facto paradigm for most natural language processing
                 tasks. This also benefits the biomedical domain:
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{He:2024:TLM,
  author =       "Tianzhang He and Rajkumar Buyya",
  title =        "A Taxonomy of Live Migration Management in Cloud
                 Computing",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "56:1--56:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3615353",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3615353",
  abstract =     "Cloud Data Centers have become the key infrastructure
                 for providing services. Instance migration across
                 different computing nodes in edge and cloud computing
                 is \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bringhenti:2024:ANS,
  author =       "Daniele Bringhenti and Guido Marchetto and Riccardo
                 Sisto and Fulvio Valenza",
  title =        "Automation for Network Security Configuration: State
                 of the Art and Research Trends",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "57:1--57:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3616401",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3616401",
  abstract =     "The size and complexity of modern computer networks
                 are progressively increasing, as a consequence of novel
                 architectural paradigms such as \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Amalfitano:2024:AIA,
  author =       "Domenico Amalfitano and Stefano Faralli and Jean Carlo
                 Rossa Hauck and Santiago Matalonga and Damiano
                 Distante",
  title =        "Artificial Intelligence Applied to Software Testing: a
                 Tertiary Study",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "58:1--58:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3616372",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3616372",
  abstract =     "Context: Artificial intelligence (AI) methods and
                 models have extensively been applied to support
                 different phases of the software development lifecycle,
                 including \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Queiroz:2024:CBV,
  author =       "Rui Queiroz and Tiago Cruz and J{\'e}r{\^o}me Mendes
                 and Pedro Sousa and Paulo Sim{\~o}es",
  title =        "Container-based Virtualization for Real-time
                 Industrial Systems --- a Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "59:1--59:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3617591",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3617591",
  abstract =     "Industrial Automation and Control systems have matured
                 into a stable infrastructure model that has been kept
                 fundamentally unchanged, using discrete \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Qiu:2024:DLP,
  author =       "Guoying Qiu and Guoming Tang and Chuandong Li and
                 Lailong Luo and Deke Guo and Yulong Shen",
  title =        "Differentiated Location Privacy Protection in Mobile
                 Communication Services: a Survey from the Semantic
                 Perception Perspective",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "60:1--60:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3617589",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3617589",
  abstract =     "Mobile communication services raise user privacy
                 concerns in sharing the traveling trajectories while
                 facilitating people's daily lives. According to these
                 shared \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tan:2024:SDS,
  author =       "Kheng Leong Tan and Chi-Hung Chi and Kwok-Yan Lam",
  title =        "Survey on Digital Sovereignty and Identity: From
                 Digitization to Digitalization",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "61:1--61:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3616400",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3616400",
  abstract =     "Through digital transformation, lots of personal data
                 are captured, but individuals often do not have
                 ownership or control over them. This results in the
                 emerging \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ghandi:2024:DLA,
  author =       "Taraneh Ghandi and Hamidreza Pourreza and Hamidreza
                 Mahyar",
  title =        "Deep Learning Approaches on Image Captioning: a
                 Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "62:1--62:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3617592",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3617592",
  abstract =     "Image captioning is a research area of immense
                 importance, aiming to generate natural language
                 descriptions for visual content in the form of still
                 images. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wu:2024:SSK,
  author =       "Haiqin Wu and Boris D{\"u}dder and Liangmin Wang and
                 Zhenfu Cao and Jun Zhou and Xia Feng",
  title =        "Survey on Secure Keyword Search over Outsourced Data:
                 From Cloud to Blockchain-assisted Architecture",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "63:1--63:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3617824",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3617824",
  abstract =     "Secure keyword search is a prevailing search service
                 offered in outsourced environments. However, with the
                 increasingly severe security vulnerabilities of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2024:SCT,
  author =       "Hanqing Zhang and Haolin Song and Shaoyu Li and Ming
                 Zhou and Dawei Song",
  title =        "A Survey of Controllable Text Generation Using
                 Transformer-based Pre-trained Language Models",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "64:1--64:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3617680",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3617680",
  abstract =     "Controllable Text Generation (CTG) is an emerging area
                 in the field of natural language generation (NLG). It
                 is regarded as crucial for the development of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Castro:2024:LHP,
  author =       "Oscar Castro and Pierrick Bruneau and
                 Jean-S{\'e}bastien Sottet and Dario Torregrossa",
  title =        "Landscape of High-Performance {Python} to Develop Data
                 Science and Machine Learning Applications",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "65:1--65:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3617588",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3617588",
  abstract =     "Python has become the prime language for application
                 development in the data science and machine learning
                 domains. However, data scientists are not necessarily
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Meedeniya:2024:SDL,
  author =       "Dulani Meedeniya and Isuru Ariyarathne and Meelan
                 Bandara and Roshinie Jayasundara and Charith Perera",
  title =        "A Survey on Deep Learning Based Forest Environment
                 Sound Classification at the Edge",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "66:1--66:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3618104",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3618104",
  abstract =     "Forest ecosystems are of paramount importance to the
                 sustainable existence of life on earth. Unique natural
                 and artificial phenomena pose severe threats to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "66",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jia:2024:TAD,
  author =       "Qi Jia and Yizhu Liu and Siyu Ren and Kenny Q. Zhu",
  title =        "Taxonomy of Abstractive Dialogue Summarization:
                 Scenarios, Approaches, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "67:1--67:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3622933",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3622933",
  abstract =     "Abstractive dialogue summarization generates a concise
                 and fluent summary covering the salient information in
                 a dialogue among two or more \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "67",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hamissi:2024:SUA,
  author =       "Asma Hamissi and Amine Dhraief",
  title =        "A Survey on the Unmanned Aircraft System Traffic
                 Management",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "68:1--68:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3617992",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3617992",
  abstract =     "The Unmanned Aircraft System Traffic Management (UTM)
                 system is a set of services offering an automated
                 management of the airspace and thus providing
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "68",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jose-Garcia:2024:MBA,
  author =       "Ad{\'a}n Jos{\'e}-Garc{\'{\i}}a and Julie Jacques and
                 Vincent Sobanski and Clarisse Dhaenens",
  title =        "Metaheuristic Biclustering Algorithms: From
                 State-of-the-art to Future Opportunities",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "69:1--69:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3617590",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3617590",
  abstract =     "Biclustering is an unsupervised machine-learning
                 technique that simultaneously clusters rows and columns
                 in a data matrix. Over the past two decades, the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gemeinhardt:2024:QCO,
  author =       "Felix Gemeinhardt and Antonio Garmendia and Manuel
                 Wimmer and Benjamin Weder and Frank Leymann",
  title =        "Quantum Combinatorial Optimization in the {NISQ} Era:
                 a Systematic Mapping Study",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "70:1--70:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3620668",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3620668",
  abstract =     "The application of quantum computing to combinatorial
                 optimization problems is attracting increasing research
                 interest, resulting in diverse approaches \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mallissery:2024:DFM,
  author =       "Sanoop Mallissery and Yu-Sung Wu",
  title =        "Demystify the Fuzzing Methods: a Comprehensive
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "71:1--71:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3623375",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3623375",
  abstract =     "Massive software applications possess complex data
                 structures or parse complex data structures; in such
                 cases, vulnerabilities in the software become
                 inevitable. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "71",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Arora:2024:DHC,
  author =       "Arnav Arora and Preslav Nakov and Momchil Hardalov and
                 Sheikh Muhammad Sarwar and Vibha Nayak and Yoan Dinkov
                 and Dimitrina Zlatkova and Kyle Dent and Ameya
                 Bhatawdekar and Guillaume Bouchard and Isabelle
                 Augenstein",
  title =        "Detecting Harmful Content on Online Platforms: What
                 Platforms Need vs. Where Research Efforts Go",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "72:1--72:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3603399",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3603399",
  abstract =     "The proliferation of harmful content on online
                 platforms is a major societal problem, which comes in
                 many different forms, including hate speech, offensive
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "72",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Christen:2024:RMH,
  author =       "Peter Christen and David J. Hand and Nishadi
                 Kirielle",
  title =        "A Review of the {$F$}-Measure: Its History,
                 Properties, Criticism, and Alternatives",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "73:1--73:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3606367",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3606367",
  abstract =     "Methods to classify objects into two or more classes
                 are at the core of various disciplines. When a set of
                 objects with their true classes is available, a
                 supervised classifier \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "73",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fiolhais:2024:TEA,
  author =       "Lu{\'\i}s Fiolhais and Leonel Sousa",
  title =        "Transient-Execution Attacks: a Computer Architect
                 Perspective",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "74:1--74:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3603619",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3603619",
  abstract =     "Computer architects employ a series of performance
                 optimizations at the micro-architecture level. These
                 optimizations are meant to be invisible to the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "74",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Scotti:2024:PSM,
  author =       "Vincenzo Scotti and Licia Sbattella and Roberto
                 Tedesco",
  title =        "A Primer on {Seq2Seq} Models for Generative Chatbots",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "75:1--75:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604281",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604281",
  abstract =     "The recent spread of Deep Learning-based solutions for
                 Artificial Intelligence and the development of Large
                 Language Models has pushed forwards significantly the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "75",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Unsal:2024:ITA,
  author =       "Ayse {\"U}nsal and Melek {\"O}nen",
  title =        "Information-Theoretic Approaches to Differential
                 Privacy",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "76:1--76:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604904",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604904",
  abstract =     "This tutorial studies relations between differential
                 privacy and various information-theoretic measures by
                 using several selective articles. In particular, we
                 present \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "76",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{LaCava:2024:FRR,
  author =       "Simone Maurizio {La Cava} and Giulia Orr{\`u} and
                 Martin Drahansky and Gian Luca Marcialis and Fabio
                 Roli",
  title =        "{$3$D} Face Reconstruction: The Road to Forensics",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "77:1--77:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625288",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625288",
  abstract =     "3D face reconstruction algorithms from images and
                 videos are applied to many fields, from plastic surgery
                 to the entertainment sector, thanks to \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "77",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xia:2024:SUE,
  author =       "Xiaoyu Xia and Sheik Mohammad Mostakim Fattah and
                 Muhammad Ali Babar",
  title =        "A Survey on {UAV}-Enabled Edge Computing: Resource
                 Management Perspective",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "78:1--78:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626566",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626566",
  abstract =     "Edge computing facilitates low-latency services at the
                 network's edge by distributing computation,
                 communication, and storage resources within the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "78",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ye:2024:HFL,
  author =       "Mang Ye and Xiuwen Fang and Bo Du and Pong C. Yuen and
                 Dacheng Tao",
  title =        "Heterogeneous Federated Learning: State-of-the-art and
                 Research Challenges",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "79:1--79:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625558",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625558",
  abstract =     "Federated learning (FL) has drawn increasing attention
                 owing to its potential use in large-scale industrial
                 applications. Existing FL works mainly focus on model
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "79",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xie:2024:CMN,
  author =       "Guoyang Xie and Yawen Huang and Jinbao Wang and Jiayi
                 Lyu and Feng Zheng and Yefeng Zheng and Yaochu Jin",
  title =        "Cross-modality Neuroimage Synthesis: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "3",
  pages =        "80:1--80:??",
  month =        mar,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625227",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 3 15:05:35 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625227",
  abstract =     "Multi-modality imaging improves disease diagnosis and
                 reveals distinct deviations in tissues with anatomical
                 properties. The existence of completely aligned
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "80",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Davis:2024:BAC,
  author =       "Ernest Davis",
  title =        "Benchmarks for Automated Commonsense Reasoning: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "81:1--81:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3615355",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3615355",
  abstract =     "More than one hundred benchmarks have been developed
                 to test the commonsense knowledge and commonsense
                 reasoning abilities of artificial intelligence
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "81",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hoffmann:2024:TID,
  author =       "Marcel Andr{\'e} Hoffmann and Rainer Lasch",
  title =        "Tackling Industrial Downtimes with Artificial
                 Intelligence in Data-Driven Maintenance",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "82:1--82:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3623378",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3623378",
  abstract =     "The application of Artificial Intelligence (AI)
                 approaches in industrial maintenance for fault
                 detection and prediction has gained much attention from
                 scholars and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "82",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Auda:2024:SSC,
  author =       "Jonas Auda and Uwe Gruenefeld and Sarah Faltaous and
                 Sven Mayer and Stefan Schneegass",
  title =        "A Scoping Survey on Cross-reality Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "83:1--83:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3616536",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3616536",
  abstract =     "Immersive technologies such as Virtual Reality (VR)
                 and Augmented Reality (AR) empower users to experience
                 digital realities. Known as distinct technology
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "83",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Diaz-de-Arcaya:2024:JSC,
  author =       "Josu Diaz-de-Arcaya and Ana I. Torre-Bastida and Gorka
                 Z{\'a}rate and Ra{\'u}l Mi{\~n}{\'o}n and Aitor
                 Almeida",
  title =        "A Joint Study of the Challenges, Opportunities, and
                 Roadmap of {MLOps} and {AIOps}: a Systematic Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "84:1--84:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625289",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625289",
  abstract =     "Data science projects represent a greater challenge
                 than software engineering for organizations pursuing
                 their adoption. The diverse stakeholders involved
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "84",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Patricio:2024:EDL,
  author =       "Cristiano Patr{\'\i}cio and Jo{\~a}o C. Neves and
                 Lu{\'\i}s F. Teixeira",
  title =        "Explainable Deep Learning Methods in Medical Image
                 Classification: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "85:1--85:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625287",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625287",
  abstract =     "The remarkable success of deep learning has prompted
                 interest in its application to medical imaging
                 diagnosis. Even though state-of-the-art deep learning
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "85",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sambo:2024:WUS,
  author =       "Damien Wohwe Sambo and Anna F{\"o}rster",
  title =        "Wireless Underground Sensor Networks: a Comprehensive
                 Survey and Tutorial",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "86:1--86:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625388",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625388",
  abstract =     "The Internet of Things has developed greatly over the
                 past decade to cater to many diverse applications
                 across almost all fields of life. Many of these
                 applications \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "86",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Deldjoo:2024:RMF,
  author =       "Yashar Deldjoo and Fatemeh Nazary and Arnau Ramisa and
                 Julian McAuley and Giovanni Pellegrini and Alejandro
                 Bellogin and Tommaso {Di Noia}",
  title =        "A Review of Modern Fashion Recommender Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "87:1--87:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3624733",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3624733",
  abstract =     "The textile and apparel industries have grown
                 tremendously over the past few years. Customers no
                 longer have to visit many stores, stand in long queues,
                 or try \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "87",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ibrohim:2024:SAN,
  author =       "Muhammad Okky Ibrohim and Cristina Bosco and Valerio
                 Basile",
  title =        "Sentiment Analysis for the Natural Environment: a
                 Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "88:1--88:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3604605",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3604605",
  abstract =     "In this systematic review, Kitchenham's framework is
                 used to explore what tasks, techniques, and benchmarks
                 for Sentiment Analysis have been developed for
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "88",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Qin:2024:TLP,
  author =       "Meng Qin and Dit-Yan Yeung",
  title =        "Temporal Link Prediction: a Unified Framework,
                 Taxonomy, and Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "89:1--89:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625820",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625820",
  abstract =     "Dynamic graphs serve as a generic abstraction and
                 description of the evolutionary behaviors of various
                 complex systems (e.g., social networks and \ldots{}).",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "89",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xia:2024:SDG,
  author =       "Weihao Xia and Jing-Hao Xue",
  title =        "A Survey on Deep Generative {$3$D}-aware Image
                 Synthesis",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "90:1--90:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626193",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626193",
  abstract =     "Recent years have seen remarkable progress in deep
                 learning powered visual content creation. This includes
                 deep generative 3D-aware image synthesis, which
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "90",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2024:GAN,
  author =       "Chenhan Zhang and Shui Yu and Zhiyi Tian and James J.
                 Q. Yu",
  title =        "Generative Adversarial Networks: a Survey on Attack
                 and Defense Perspective",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "91:1--91:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3615336",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3615336",
  abstract =     "Generative Adversarial Networks (GANs) are a
                 remarkable creation with regard to deep generative
                 models. Thanks to their ability to learn from complex
                 data \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "91",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hu:2024:DMI,
  author =       "Li Hu and Anli Yan and Hongyang Yan and Jin Li and
                 Teng Huang and Yingying Zhang and Changyu Dong and
                 Chunsheng Yang",
  title =        "Defenses to Membership Inference Attacks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "92:1--92:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3620667",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3620667",
  abstract =     "Machine learning (ML) has gained widespread adoption
                 in a variety of fields, including computer vision and
                 natural language processing. However, ML \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "92",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kapp:2024:GMS,
  author =       "Alexandra Kapp and Julia Hansmeyer and Helena
                 Mihaljevi{\'c}",
  title =        "Generative Models for Synthetic Urban Mobility Data: a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "93:1--93:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3610224",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3610224",
  abstract =     "Although highly valuable for a variety of
                 applications, urban mobility data are rarely made
                 openly available, as it contains sensitive personal
                 information. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "93",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhong:2024:CSA,
  author =       "Lingfeng Zhong and Jia Wu and Qian Li and Hao Peng and
                 Xindong Wu",
  title =        "A Comprehensive Survey on Automatic Knowledge Graph
                 Construction",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "94:1--94:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3618295",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3618295",
  abstract =     "Automatic knowledge graph construction aims at
                 manufacturing structured human knowledge. To this end,
                 much effort has historically been spent extracting
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "94",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Moas:2024:AQA,
  author =       "Pedro Miguel Mo{\'a}s and Carla Teixeira Lopes",
  title =        "Automatic Quality Assessment of {Wikipedia} Articles
                 --- a Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "95:1--95:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625286",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625286",
  abstract =     "Wikipedia is the world's largest online encyclopedia,
                 but maintaining article quality through collaboration
                 is challenging. Wikipedia designed a quality scale,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "95",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Habler:2024:AAS,
  author =       "Edan Habler and Ron Bitton and Asaf Shabtai",
  title =        "Assessing Aircraft Security: a Comprehensive Survey
                 and Methodology for Evaluation",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "96:1--96:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3610772",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3610772",
  abstract =     "The sophistication and complexity of cyber attacks and
                 the variety of targeted platforms have grown in recent
                 years. Adversaries are targeting a wide range of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "96",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Marvasti-Zadeh:2024:EDB,
  author =       "S. Mojtaba Marvasti-Zadeh and Devin Goodsman and
                 Nilanjan Ray and Nadir Erbilgin",
  title =        "Early Detection of Bark Beetle Attack Using Remote
                 Sensing and Machine Learning: a Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "97:1--97:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625387",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625387",
  abstract =     "Bark beetle outbreaks can have serious consequences on
                 forest ecosystem processes, biodiversity, forest
                 structure and function, and economies. Thus, accurate
                 and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "97",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{DosAnjos:2024:SCL,
  author =       "Julio C. S. {Dos Anjos} and Kassiano J. Matteussi and
                 Fernanda C. Orlandi and Jorge L. V. Barbosa and Jorge
                 {S{\'a} Silva} and Luiz F. Bittencourt and Cl{\'a}udio
                 F. R. Geyer",
  title =        "A Survey on Collaborative Learning for Intelligent
                 Autonomous Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "98:1--98:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625544",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625544",
  abstract =     "This survey examines approaches to promote
                 Collaborative Learning in distributed systems for
                 emergent Intelligent Autonomous Systems (IAS). The
                 study involves \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "98",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Huawei:2024:ESM,
  author =       "Huang Huawei and Zhang Qinnan and Li Taotao and Yang
                 Qinglin and Yin Zhaokang and Wu Junhao and Zehui Xiong
                 and Zhu Jianming and Jiajing Wu and Zibin Zheng",
  title =        "Economic Systems in the Metaverse: Basics, State of
                 the Art, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "99:1--99:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626315",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626315",
  abstract =     "Economic systems play pivotal roles in the metaverse.
                 However, we have not yet found an overview that
                 systematically introduces economic systems for the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "99",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{DeSouzaSantos:2024:DSC,
  author =       "Ronnie {De Souza Santos} and Paul Ralph and Arham
                 Arshad and Klaas-Jan Stol",
  title =        "Distributed Scrum: a Case Meta-analysis",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "100:1--100:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626519",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626519",
  abstract =     "Distributed Scrum adapts the Scrum project management
                 framework for geographically distributed software
                 teams. Experimentally evaluating the effectiveness of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "100",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rigaki:2024:SPA,
  author =       "Maria Rigaki and Sebastian Garcia",
  title =        "A Survey of Privacy Attacks in Machine Learning",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "101:1--101:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3624010",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3624010",
  abstract =     "As machine learning becomes more widely used, the need
                 to study its implications in security and privacy
                 becomes more urgent. Although the body of work in
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "101",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Paton:2024:DDE,
  author =       "Norman W. Paton and Jiaoyan Chen and Zhenyu Wu",
  title =        "Dataset Discovery and Exploration: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "102:1--102:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626521",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626521",
  abstract =     "Data scientists are tasked with obtaining insights
                 from data. However, suitable data is often not
                 immediately at hand, and there may be many potentially
                 relevant \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "102",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Su:2024:SSI,
  author =       "Zhipeng Su and Yixiong Zhang and Jianghong Shi and
                 Xiao-Ping Zhang",
  title =        "A Survey of Single Image Rain Removal Based on Deep
                 Learning",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "103:1--103:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625818",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625818",
  abstract =     "The rain removal task is to restore a clean image from
                 the contaminated image by separating the background.
                 Since the rise of deep learning in 2016, the task of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "103",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rahman:2024:DCC,
  author =       "Akond Rahman and Dibyendu Brinto Bose and Farhat Lamia
                 Barsha and Rahul Pandita",
  title =        "Defect Categorization in Compilers: a Multi-vocal
                 Literature Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "104:1--104:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626313",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626313",
  abstract =     "Context: Compilers are the fundamental tools for
                 software development. Thus, compiler defects can
                 disrupt development productivity and propagate errors
                 into developer-written software source code.
                 Categorizing defects in compilers can inform
                 practitioners and researchers about the existing
                 defects in compilers and techniques that can be used to
                 identify defects systematically.\par

                 Objective: The goal of this paper is to help
                 researchers understand the nature of defects in
                 compilers by conducting a review of Internet artifacts
                 and peer-reviewed publications that study defect
                 characteristics of compilers.\par

                 Methodology: We conduct a multi-vocal literature review
                 (MLR) with 26 publications and 32 Internet artifacts to
                 characterize compiler defects.\par

                 Results: From our MLR, we identify 13 categories of
                 defects, amongst which optimization defects have been
                 the most reported defects in our artifacts
                 publications. We observed 15 defect identification
                 techniques tailored for compilers and no single
                 technique identifying all observed defect
                 categories.\par

                 Conclusion: Our MLR lays the groundwork for
                 practitioners and researchers to identify defects in
                 compilers systematically.",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "104",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yang:2024:DMC,
  author =       "Ling Yang and Zhilong Zhang and Yang Song and Shenda
                 Hong and Runsheng Xu and Yue Zhao and Wentao Zhang and
                 Bin Cui and Ming-Hsuan Yang",
  title =        "Diffusion Models: a Comprehensive Survey of Methods
                 and Applications",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "105:1--105:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626235",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626235",
  abstract =     "Diffusion models have emerged as a powerful new family
                 of deep generative models with record-breaking
                 performance in many applications, including \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "105",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wyrich:2024:YDC,
  author =       "Marvin Wyrich and Justus Bogner and Stefan Wagner",
  title =        "40 Years of Designing Code Comprehension Experiments:
                 a Systematic Mapping Study",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "106:1--106:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626522",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626522",
  abstract =     "The relevance of code comprehension in a developer's
                 daily work was recognized more than 40 years ago.
                 Consequently, many experiments were conducted to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "106",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Heinis:2024:SIE,
  author =       "Thomas Heinis and Roman Sokolovskii and Jamie J.
                 Alnasir",
  title =        "Survey of Information Encoding Techniques for {DNA}",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "4",
  pages =        "107:1--107:??",
  month =        apr,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626233",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Dec 5 08:48:21 MST 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626233",
  abstract =     "The yearly global production of data is growing
                 exponentially, outpacing the capacity of existing
                 storage media, such as tape and disk, and surpassing
                 our \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "107",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Marani:2024:RST,
  author =       "Amin Hosseiny Marani and Eric P. S. Baumer",
  title =        "A Review of Stability in Topic Modeling: Metrics for
                 Assessing and Techniques for Improving Stability",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "108:1--108:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3623269",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3623269",
  abstract =     "Topic modeling includes a variety of machine learning
                 techniques for identifying latent themes in a corpus of
                 documents. Generating an exact solution (i.e.,
                 \ldots{})",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "108",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Beyan:2024:CLH,
  author =       "Cigdem Beyan and Alessandro Vinciarelli and Alessio
                 {Del Bue}",
  title =        "Co-Located Human-Human Interaction Analysis Using
                 Nonverbal Cues: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "109:1--109:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626516",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626516",
  abstract =     "Automated co-located human-human interaction analysis
                 has been addressed by the use of nonverbal
                 communication as measurable evidence of social and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "109",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Becker:2024:EXA,
  author =       "Artur Becker and Carla M. {Dal Sasso Freitas}",
  title =        "Evaluation of {XR} Applications: a Tertiary Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "110:1--110:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626517",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626517",
  abstract =     "Extended reality (XR) applications-encompassing
                 virtual reality, augmented reality, and mixed
                 reality-are finding their way into multiple domains.
                 Each \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "110",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fei:2024:SRI,
  author =       "Wen Fei and Hiroyuki Ohno and Srinivas Sampalli",
  title =        "A Systematic Review of {IoT} Security: Research
                 Potential, Challenges, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "111:1--111:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625094",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625094",
  abstract =     "The Internet of Things (IoT) encompasses a network of
                 physical objects embedded with sensors, software, and
                 data processing technologies that can establish
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "111",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hu:2024:LRR,
  author =       "Xuke Hu and Zhiyong Zhou and Hao Li and Yingjie Hu and
                 Fuqiang Gu and Jens Kersten and Hongchao Fan and
                 Friederike Klan",
  title =        "Location Reference Recognition from Texts: a Survey
                 and Comparison",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "112:1--112:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3625819",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3625819",
  abstract =     "A vast amount of location information exists in
                 unstructured texts, such as social media posts, news
                 stories, scientific articles, web pages, travel blogs,
                 and historical \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "112",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Huang:2024:SDL,
  author =       "Qihan Huang and Haofei Zhang and Mengqi Xue and Jie
                 Song and Mingli Song",
  title =        "A Survey of Deep Learning for Low-shot Object
                 Detection",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "113:1--113:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626312",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626312",
  abstract =     "Object detection has achieved a huge breakthrough with
                 deep neural networks and massive annotated data.
                 However, current detection methods cannot be \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "113",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Paananen:2024:DME,
  author =       "Ville Paananen and Mohammad Sina Kiarostami and Lee
                 Lik-Hang and Tristan Braud and Simo Hosio",
  title =        "From Digital Media to Empathic Spaces: a Systematic
                 Review of Empathy Research in Extended Reality
                 Environments",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "114:1--114:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626518",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626518",
  abstract =     "Recent advances in extended reality (XR) technologies
                 have enabled new and increasingly realistic empathy
                 tools and experiences. In XR, all interactions
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "114",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Seyyedi:2024:MLP,
  author =       "Azra Seyyedi and Mahdi Bohlouli and Seyedehsan Nedaaee
                 Oskoee",
  title =        "Machine Learning and Physics: a Survey of Integrated
                 Models",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "115:1--115:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3611383",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3611383",
  abstract =     "Predictive modeling of various systems around the
                 world is extremely essential from the physics and
                 engineering perspectives. The recognition of different
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "115",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2024:SCM,
  author =       "Johann Li and Guangming Zhu and Cong Hua and Mingtao
                 Feng and Basheer Bennamoun and Ping Li and Xiaoyuan Lu
                 and Juan Song and Peiyi Shen and Xu Xu and Lin Mei and
                 Liang Zhang and Syed Afaq Ali Shah and Mohammed
                 Bennamoun",
  title =        "A Systematic Collection of Medical Image Datasets for
                 Deep Learning",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "116:1--116:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3615862",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3615862",
  abstract =     "The astounding success made by artificial intelligence
                 in healthcare and other fields proves that it can
                 achieve human-like performance. However, success
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "116",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mann:2024:TPS,
  author =       "Zolt{\'a}n {\'A}d{\'a}m Mann and Christian Weinert and
                 Daphnee Chabal and Joppe W. Bos",
  title =        "Towards Practical Secure Neural Network Inference: The
                 Journey So Far and the Road Ahead",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "117:1--117:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3628446",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3628446",
  abstract =     "Neural networks (NNs) have become one of the most
                 important tools for artificial intelligence.
                 Well-designed and trained NNs can perform inference
                 (e.g., make \ldots{})",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "117",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Luo:2024:SCV,
  author =       "Jiayun Luo and Boyang Li and Cyril Leung",
  title =        "A Survey of Computer Vision Technologies in Urban and
                 Controlled-environment Agriculture",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "118:1--118:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626186",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626186",
  abstract =     "In the evolution of agriculture to its next stage,
                 Agriculture 5.0, artificial intelligence will play a
                 central role. Controlled-environment agriculture, or
                 CEA, is \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "118",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2024:SSS,
  author =       "Feng Li and Jianfeng Ma and Yinbin Miao and Ximeng Liu
                 and Jianting Ning and Robert H. Deng",
  title =        "A Survey on Searchable Symmetric Encryption",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "119:1--119:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3617991",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3617991",
  abstract =     "Outsourcing data to the cloud has become prevalent, so
                 Searchable Symmetric Encryption (SSE), one of the
                 methods for protecting outsourced data, has \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "119",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jain:2024:CCA,
  author =       "Vaibhav Jain and Devendra Kumar Sharma and Hari Mohan
                 Gaur and Ashutosh Kumar Singh and Xiaoqing Wen",
  title =        "Comprehensive and Comparative Analysis of {QCA}-based
                 Circuit Designs for Next-generation Computation",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "120:1--120:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3622932",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3622932",
  abstract =     "For the past several decades, VLSI design has been
                 focused on lowering the size, power, and delay. As of
                 now, this miniaturization does not seems to be a
                 possible \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "120",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ding:2024:CTF,
  author =       "Yujuan Ding and Zhihui Lai and P. Y. Mok and Tat-Seng
                 Chua",
  title =        "Computational Technologies for Fashion Recommendation:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "121:1--121:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3627100",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3627100",
  abstract =     "Fashion recommendation is a key research field in
                 computational fashion research and has attracted
                 considerable interest in the computer vision,
                 multimedia, and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "121",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Huang:2024:SCD,
  author =       "Bing Huang and Dipankar Chaki and Athman Bouguettaya
                 and Kwok-Yan Lam",
  title =        "A Survey on Conflict Detection in {IoT}-based Smart
                 Homes",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "122:1--122:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3629517",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3629517",
  abstract =     "As the adoption of IoT-based smart homes continues to
                 grow, the importance of addressing potential conflicts
                 becomes increasingly vital for ensuring \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "122",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhou:2024:RCA,
  author =       "Dawei Zhou and Jingrui He",
  title =        "Rare Category Analysis for Complex Data: a Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "123:1--123:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626520",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626520",
  abstract =     "Though the sheer volume of data that is collected is
                 immense, it is the rare categories that are often the
                 most important in many high-impact domains, ranging
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "123",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Khalid:2024:CSQ,
  author =       "Adnan Khalid and Zohaib Mushtaq and Saad Arif and
                 Kamran Zeb and Muhammad Attique Khan and Sambit
                 Bakshi",
  title =        "Control Schemes for Quadrotor {UAV}: Taxonomy and
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "124:1--124:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3617652",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3617652",
  abstract =     "Quadrotor Unmanned Aerial Vehicle (UAV) is an unstable
                 system, so it needs to be controlled efficiently and
                 intelligently. Moreover, due to its non-linear,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "124",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hickling:2024:EDR,
  author =       "Thomas Hickling and Abdelhafid Zenati and Nabil Aouf
                 and Phillippa Spencer",
  title =        "Explainability in Deep Reinforcement Learning: a
                 Review into Current Methods and Applications",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "125:1--125:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3623377",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3623377",
  abstract =     "The use of Deep Reinforcement Learning (DRL) schemes
                 has increased dramatically since their first
                 introduction in 2015. Though uses in many different
                 applications \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "125",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2024:BGB,
  author =       "Zhiqian Chen and Fanglan Chen and Lei Zhang and Taoran
                 Ji and Kaiqun Fu and Liang Zhao and Feng Chen and
                 Lingfei Wu and Charu Aggarwal and Chang-Tien Lu",
  title =        "Bridging the Gap between Spatial and Spectral Domains:
                 a Unified Framework for Graph Neural Networks",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "126:1--126:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3627816",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3627816",
  abstract =     "Deep learning's performance has been extensively
                 recognized recently. Graph neural networks (GNNs) are
                 designed to deal with graph-structural data that
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "126",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cheng:2024:DDC,
  author =       "Debo Cheng and Jiuyong Li and Lin Liu and Jixue Liu
                 and Thuc Duy Le",
  title =        "Data-Driven Causal Effect Estimation Based on
                 Graphical Causal Modelling: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "127:1--127:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3636423",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3636423",
  abstract =     "In many fields of scientific research and real-world
                 applications, unbiased estimation of causal effects
                 from non-experimental data is crucial for understanding
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "127",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Villarreal-Narvaez:2024:BNG,
  author =       "Santiago Villarreal-Narvaez and Arthur Slu{\"y}ters
                 and Jean Vanderdonckt and Radu-Daniel Vatavu",
  title =        "Brave New {GES} World: a Systematic Literature Review
                 of Gestures and Referents in Gesture Elicitation
                 Studies",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "128:1--128:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3636458",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3636458",
  abstract =     "How do we determine highly effective and intuitive
                 gesture sets for interactive systems tailored to end
                 users' preferences? A substantial body of knowledge is
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "128",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liao:2024:APG,
  author =       "Fangjian Liao and Xingxing Zou and Waikeung Wong",
  title =        "Appearance and Pose-guided Human Generation: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "129:1--129:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3637060",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3637060",
  abstract =     "Appearance and pose-guided human generation is a
                 burgeoning field that has captured significant
                 attention. This subject's primary objective is to
                 transfer \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "129",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2024:ECR,
  author =       "Shiwei Li and Huifeng Guo and Xing Tang and Ruiming
                 Tang and Lu Hou and Ruixuan Li and Rui Zhang",
  title =        "Embedding Compression in Recommender Systems: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "130:1--130:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3637841",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3637841",
  abstract =     "To alleviate the problem of information explosion,
                 recommender systems are widely deployed to provide
                 personalized information filtering services. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "130",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kebande:2024:IIT,
  author =       "Victor R. Kebande and Ali Ismail Awad",
  title =        "{Industrial Internet of Things} Ecosystems Security
                 and Digital Forensics: Achievements, Open Challenges,
                 and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "131:1--131:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3635030",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3635030",
  abstract =     "The Industrial Internet of Things (IIoT) has been
                 positioned as a key pillar of the Industry 4.0
                 revolution, which is projected to continue accelerating
                 and realizing \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "131",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jayasena:2024:DTG,
  author =       "Aruna Jayasena and Prabhat Mishra",
  title =        "Directed Test Generation for Hardware Validation: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "132:1--132:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3638046",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3638046",
  abstract =     "The complexity of hardware designs has increased over
                 the years due to the rapid advancement of technology
                 coupled with the need to support diverse and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "132",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gecer:2024:FLM,
  author =       "Melike Gecer and Benoit Garbinato",
  title =        "Federated Learning for Mobility Applications",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "133:1--133:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3637868",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3637868",
  abstract =     "The increasing concern for privacy and the use of
                 machine learning on personal data has led researchers
                 to introduce new approaches to machine learning.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "133",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2024:RCB,
  author =       "Gengrui Zhang and Fei Pan and Yunhao Mao and Sofia
                 Tijanic and Michael Dang'ana and Shashank Motepalli and
                 Shiquan Zhang and Hans-Arno Jacobsen",
  title =        "Reaching Consensus in the {Byzantine} Empire: a
                 Comprehensive Review of {BFT} Consensus Algorithms",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "5",
  pages =        "134:1--134:??",
  month =        may,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3636553",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:49:16 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3636553",
  abstract =     "Byzantine fault-tolerant (BFT) consensus algorithms
                 are at the core of providing safety and liveness
                 guarantees for distributed systems that must \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "134",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Vincenzi:2024:SRS,
  author =       "Marco {De Vincenzi} and Gianpiero Costantino and
                 Ilaria Matteucci and Florian Fenzl and Christian
                 Plappert and Roland Rieke and Daniel Zelle",
  title =        "A Systematic Review on Security Attacks and
                 Countermeasures in Automotive {Ethernet}",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "135:1--135:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3637059",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3637059",
  abstract =     "In the past years, the automotive industry has
                 experienced a technological revolution driven by the
                 increasing demand of connectivity and data to develop
                 driver-assistance systems and autonomous vehicles, and
                 improve the mobility experience. To provide higher
                 bandwidth in in-vehicle communication networks,
                 carmakers are choosing Ethernet technology, which
                 becomes Automotive Ethernet (AE) when applied in
                 in-vehicle communication networks. However, with the
                 rise of vehicle connectivity, the cybersecurity of
                 vehicle systems has become a primary concern for the
                 automotive industry. To address this issue, we
                 conducted a systematic review, deeply analyzing the
                 impact of AE on security and safety, and comparing it
                 with the current in-vehicle communication solutions
                 like Controller Area Network protocol. We retrieved the
                 key security attacks and mitigations proposed in the
                 current literature to highlight their significance,
                 including a mapping between the regulation UNECE WP.29
                 R155 and the retrieved answers. We found that the
                 industry has only implemented some automotive-dedicated
                 Ethernet solutions to date. In the near future, the
                 vehicle and road ecosystems may require more exclusive
                 automotive solutions to meet specific constraints such
                 as low latency. Our results can provide a comprehensive
                 baseline, both for industry and academia, for the
                 current and future development of AE.",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "135",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wong:2024:MHM,
  author =       "Andrew Wei-Loong Wong and Say Leng Goh and Mohammad
                 Kamrul Hasan and Salmah Fattah",
  title =        "Multi-Hop and Mesh for {LoRa} Networks: Recent
                 Advancements, Issues, and Recommended Applications",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "136:1--136:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3638241",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3638241",
  abstract =     "A comprehensive review is presented on the latest
                 approaches to solutions focusing on multi-hop and mesh
                 LoRa networks through the evaluation of simulations and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "136",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2024:BHV,
  author =       "Yanbin Liu and Girish Dwivedi and Farid Boussaid and
                 Mohammed Bennamoun",
  title =        "{$3$D} Brain and Heart Volume Generative Models: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "137:1--137:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3638044",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3638044",
  abstract =     "Generative models such as generative adversarial
                 networks and autoencoders have gained a great deal of
                 attention in the medical field due to their excellent
                 data generation capability. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "137",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2024:SRS,
  author =       "Yanjie Li and Bin Xie and Songtao Guo and Yuanyuan
                 Yang and Bin Xiao",
  title =        "A Survey of Robustness and Safety of {$2$D} and {$3$D}
                 Deep Learning Models against Adversarial Attacks",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "138:1--138:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3636551",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3636551",
  abstract =     "Benefiting from the rapid development of deep
                 learning, 2D and 3D computer vision applications are
                 deployed in many safe-critical systems, such as
                 autopilot and identity \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "138",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yang:2024:SBE,
  author =       "Changlin Yang and Kwan-Wu Chin and Jiguang Wang and
                 Xiaodong Wang and Ying Liu and Zibin Zheng",
  title =        "Scaling Blockchains with Error Correction Codes: a
                 Survey on Coded Blockchains",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "139:1--139:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3637224",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3637224",
  abstract =     "A fundamental issue in blockchain systems is their
                 scalability in terms of data storage, computation,
                 communication, and security. To resolve this issue, a
                 promising research \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "139",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Islam:2024:SFI,
  author =       "Sk Maidul Islam and Subhankar Joardar and Arif Ahmed
                 Sekh",
  title =        "A Survey on Fashion Image Retrieval",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "140:1--140:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3636552",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3636552",
  abstract =     "Fashion is the manner in which we introduce ourselves
                 to the world and has become perhaps the biggest
                 industry on the planet. In recent years,
                 fashion-related research has \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "140",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ahmadilivani:2024:SLR,
  author =       "Mohammad Hasan Ahmadilivani and Mahdi Taheri and Jaan
                 Raik and Masoud Daneshtalab and Maksim Jenihhin",
  title =        "A Systematic Literature Review on Hardware Reliability
                 Assessment Methods for Deep Neural Networks",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "141:1--141:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3638242",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3638242",
  abstract =     "Artificial Intelligence (AI) and, in particular,
                 Machine Learning (ML), have emerged to be utilized in
                 various applications due to their capability to learn
                 how to solve \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "141",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Falazi:2024:CCS,
  author =       "Ghareeb Falazi and Uwe Breitenb{\"u}cher and Frank
                 Leymann and Stefan Schulte",
  title =        "Cross-Chain Smart Contract Invocations: a Systematic
                 Multi-Vocal Literature Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "142:1--142:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3638045",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3638045",
  abstract =     "The introduction of smart contracts has expanded the
                 applicability of blockchains to many domains beyond
                 finance and cryptocurrencies. Moreover, different
                 blockchain \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "142",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gomes:2024:SEN,
  author =       "Jo{\~a}o Eduardo Costa Gomes and Ricardo Rodrigues
                 Ehlert and Rodrigo Murillo Boesche and Vinicius
                 Santosde Lima and Jorgito Matiuzzi Stocchero and Dante
                 A. C. Barone and JulianoAraujo Wickboldt and Edison
                 Pignaton de Freitas and Julio C. S. dos Anjos and
                 Ricardo Queiroz de Araujo Fernandes",
  title =        "Surveying Emerging Network Approaches for Military
                 Command and Control Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "143:1--143:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626090",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626090",
  abstract =     "This survey paper examines emerging network approaches
                 for military Command and Control (C2) systems. An
                 extensive literature review is provided along the text
                 on \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "143",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Szymoniak:2024:KDA,
  author =       "Sabina Szymoniak",
  title =        "Key Distribution and Authentication Protocols in
                 Wireless Sensor Networks: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "144:1--144:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3638043",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3638043",
  abstract =     "We use sensor technologies in many areas of everyday
                 life. We use sensors to check and study various
                 phenomena and to improve our lives. Hence, the sensors
                 are used in \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "144",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Maniriho:2024:SRA,
  author =       "Pascal Maniriho and Abdun Naser Mahmood and Mohammad
                 Jabed Morshed Chowdhury",
  title =        "A Survey of Recent Advances in Deep Learning Models
                 for Detecting Malware in Desktop and Mobile Platforms",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "145:1--145:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3638240",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3638240",
  abstract =     "Malware is one of the most common and severe cyber
                 threats today. Malware infects millions of devices and
                 can perform several malicious activities including
                 compromising \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "145",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ye:2024:DLW,
  author =       "Zhisheng Ye and Wei Gao and Qinghao Hu and Peng Sun
                 and Xiaolin Wang and Yingwei Luo and Tianwei Zhang and
                 Yonggang Wen",
  title =        "Deep Learning Workload Scheduling in {GPU}
                 Datacenters: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "146:1--146:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3638757",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3638757",
  abstract =     "Deep learning (DL) has demonstrated its remarkable
                 success in a wide variety of fields. The development of
                 a DL model is a time-consuming and resource-intensive
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "146",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ghosheh:2024:SGA,
  author =       "Ghadeer O. Ghosheh and Jin Li and Tingting Zhu",
  title =        "A Survey of Generative Adversarial Networks for
                 Synthesizing Structured Electronic Health Records",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "147:1--147:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3636424",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3636424",
  abstract =     "Electronic Health Records (EHRs) are a valuable asset
                 to facilitate clinical research and point of care
                 applications; however, many challenges such as data
                 privacy concerns impede its \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "147",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gaber:2024:MDA,
  author =       "Matthew G. Gaber and Mohiuddin Ahmed and Helge
                 Janicke",
  title =        "Malware Detection with Artificial Intelligence: a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "148:1--148:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3638552",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3638552",
  abstract =     "In this survey, we review the key developments in the
                 field of malware detection using AI and analyze core
                 challenges. We systematically survey state-of-the-art
                 methods \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "148",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pato:2024:SRS,
  author =       "Matilde Pato and M{\'a}rcia Barros and Francisco M.
                 Couto",
  title =        "Survey on Recommender Systems for Biomedical Items in
                 Life and Health Sciences",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "149:1--149:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3639047",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3639047",
  abstract =     "The generation of biomedical data is of such magnitude
                 that its retrieval and analysis have posed several
                 challenges. A survey of recommender system (RS)
                 approaches \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "149",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Razniewski:2024:CRN,
  author =       "Simon Razniewski and Hiba Arnaout and Shrestha Ghosh
                 and Fabian Suchanek",
  title =        "Completeness, Recall, and Negation in Open-world
                 Knowledge Bases: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "150:1--150:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3639563",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3639563",
  abstract =     "General-purpose knowledge bases (KBs) are a
                 cornerstone of knowledge-centric AI. Many of them are
                 constructed pragmatically from web sources and are thus
                 far from \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "150",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2024:SML,
  author =       "Huaming Chen and M. Ali Babar",
  title =        "Security for Machine Learning-based Software Systems:
                 a Survey of Threats, Practices, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "151:1--151:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3638531",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3638531",
  abstract =     "The rapid development of Machine Learning (ML) has
                 demonstrated superior performance in many areas, such
                 as computer vision and video and speech recognition. It
                 has now been \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "151",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mo:2024:SPI,
  author =       "Kanghua Mo and Peigen Ye and Xiaojun Ren and Shaowei
                 Wang and Wenjun Li and Jin Li",
  title =        "Security and Privacy Issues in Deep Reinforcement
                 Learning: Threats and Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "152:1--152:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3640312",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3640312",
  abstract =     "Deep Reinforcement Learning (DRL) is an essential
                 subfield of Artificial Intelligence (AI), where agents
                 interact with environments to learn policies for
                 solving complex tasks. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "152",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yao:2024:DLP,
  author =       "Jianping Yao and Son N. Tran and Saurabh Garg and
                 Samantha Sawyer",
  title =        "Deep Learning for Plant Identification and Disease
                 Classification from Leaf Images: Multi-prediction
                 Approaches",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "153:1--153:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3639816",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3639816",
  abstract =     "Deep learning (DL) plays an important role in modern
                 agriculture, especially in plant pathology using leaf
                 images where convolutional neural networks (CNN) are
                 attracting a lot of \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "153",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Khan:2024:MDB,
  author =       "Simon Khan and Charles Devlen and Michael Manno and
                 Daqing Hou",
  title =        "Mouse Dynamics Behavioral Biometrics: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "154:1--154:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3640311",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3640311",
  abstract =     "Utilization of the Internet in our everyday lives has
                 made us vulnerable in terms of privacy and security of
                 our data and systems. Therefore, there is a pressing
                 need to protect our \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "154",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hughes:2024:ACC,
  author =       "Jack Hughes and Sergio Pastrana and Alice Hutchings
                 and Sadia Afroz and Sagar Samtani and Weifeng Li and
                 Ericsson Santana Marin",
  title =        "The Art of Cybercrime Community Research",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "155:1--155:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3639362",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3639362",
  abstract =     "In the last decade, cybercrime has risen considerably.
                 One key factor is the proliferation of online
                 cybercrime communities, where actors trade products and
                 services, and also \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "155",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Subagdja:2024:MLR,
  author =       "Budhitama Subagdja and D. Shanthoshigaa and Zhaoxia
                 Wang and Ah-Hwee Tan",
  title =        "Machine Learning for Refining Knowledge Graphs: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "156:1--156:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3640313",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3640313",
  abstract =     "Knowledge graph (KG) refinement refers to the process
                 of filling in missing information, removing
                 redundancies, and resolving inconsistencies in KGs.
                 With the \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "156",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zahid:2024:MBT,
  author =       "Maryam Zahid and Alessio Bucaioni and Francesco
                 Flammini",
  title =        "Model-based Trustworthiness Evaluation of Autonomous
                 Cyber-Physical Production Systems: a Systematic Mapping
                 Study",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "157:1--157:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3640314",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3640314",
  abstract =     "The fourth industrial revolution, i.e., Industry 4.0,
                 is associated with Cyber-Physical Systems (CPS), which
                 are entities integrating hardware (e.g., smart sensors
                 and actuators \ldots{})",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "157",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dou:2024:DDI,
  author =       "Mingliang Dou and Jijun Tang and Prayag Tiwari and
                 Yijie Ding and Fei Guo",
  title =        "Drug-Drug Interaction Relation Extraction Based on
                 Deep Learning: a Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "158:1--158:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645089",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645089",
  abstract =     "Drug-drug interaction (DDI) is an important part of
                 drug development and pharmacovigilance. At the same
                 time, DDI is an important factor in treatment planning,
                 monitoring effects \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "158",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cao:2024:KGE,
  author =       "Jiahang Cao and Jinyuan Fang and Zaiqiao Meng and
                 Shangsong Liang",
  title =        "Knowledge Graph Embedding: a Survey from the
                 Perspective of Representation Spaces",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "159:1--159:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3643806",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3643806",
  abstract =     "Knowledge graph embedding (KGE) is an increasingly
                 popular technique that aims to represent entities and
                 relations of knowledge graphs into low-dimensional
                 semantic \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "159",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Becherer:2024:TRS,
  author =       "Marius Becherer and Omar Khadeer Hussain and Yu Zhang
                 and Frank den Hartog and Elizabeth Chang",
  title =        "On Trust Recommendations in the {Social Internet of
                 Things} --- A Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "160:1--160:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645100",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645100",
  abstract =     "The novel paradigm Social Internet of Things (SIoT)
                 improves the network navigability, identifies suitable
                 service providers, and addresses scalability concerns.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "160",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ciatto:2024:SKE,
  author =       "Giovanni Ciatto and Federico Sabbatini and Andrea
                 Agiollo and Matteo Magnini and Andrea Omicini",
  title =        "Symbolic Knowledge Extraction and Injection with
                 Sub-symbolic Predictors: a Systematic Literature
                 Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "6",
  pages =        "161:1--161:??",
  month =        jun,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645103",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Mar 25 11:39:38 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645103",
  abstract =     "In this article, we focus on the opacity issue of
                 sub-symbolic machine learning predictors by promoting
                 two complementary activities- symbolic knowledge
                 extraction (SKE) and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "161",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Calegari:2024:ISI,
  author =       "Roberta Calegari and Fosca Giannotti and Francesca
                 Pratesi and Michela Milano",
  title =        "Introduction to Special Issue on Trustworthy
                 Artificial Intelligence",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "162:1--162:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3649452",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3649452",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "162",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2024:EBM,
  author =       "Peiyun Zhang and Song Ding and Qinglin Zhao",
  title =        "Exploiting Blockchain to Make {AI} Trustworthy: a
                 Software Development Lifecycle View",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "163:1--163:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3614424",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3614424",
  abstract =     "Artificial intelligence (AI) is a very powerful
                 technology and can be a potential disrupter and
                 essential enabler. As AI expands into almost every
                 aspect of our lives, people raise serious concerns
                 about AI misbehaving and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "163",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Conlon:2024:SAM,
  author =       "Nicholas Conlon and Nisar R. Ahmed and Daniel Szafir",
  title =        "A Survey of Algorithmic Methods for Competency
                 Self-Assessments in Human-Autonomy Teaming",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "164:1--164:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3616010",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3616010",
  abstract =     "Humans working with autonomous artificially
                 intelligent systems may not be experts in the inner
                 workings of their machine teammates, but need to
                 understand when to employ, trust, and rely on the
                 system. A critical \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "164",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xing:2024:NIM,
  author =       "Xiaodan Xing and Huanjun Wu and Lichao Wang and Iain
                 Stenson and May Yong and Javier {Del Ser} and Simon
                 Walsh and Guang Yang",
  title =        "Non-imaging Medical Data Synthesis for Trustworthy
                 {AI}: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "165:1--165:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3614425",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3614425",
  abstract =     "Data quality is a key factor in the development of
                 trustworthy AI in healthcare. A large volume of curated
                 datasets with controlled confounding factors can
                 improve the accuracy, robustness, and privacy of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "165",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Caton:2024:FML,
  author =       "Simon Caton and Christian Haas",
  title =        "Fairness in Machine Learning: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "166:1--166:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3616865",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3616865",
  abstract =     "When Machine Learning technologies are used in
                 contexts that affect citizens, companies as well as
                 researchers need to be confident that there will not be
                 any unexpected social implications, such as bias
                 towards gender, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "166",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lorena:2024:TMP,
  author =       "Ana C. Lorena and Pedro Y. A. Paiva and Ricardo B. C.
                 Prud{\^e}ncio",
  title =        "Trusting My Predictions: On the Value of
                 Instance-Level Analysis",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "167:1--167:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3615354",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3615354",
  abstract =     "Machine Learning solutions have spread along many
                 domains, including critical applications. The
                 development of such models usually relies on a dataset
                 containing labeled data. This dataset is then split
                 into training and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "167",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Milani:2024:ERL,
  author =       "Stephanie Milani and Nicholay Topin and Manuela Veloso
                 and Fei Fang",
  title =        "Explainable Reinforcement Learning: a Survey and
                 Comparative Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "168:1--168:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3616864",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3616864",
  abstract =     "Explainable reinforcement learning (XRL) is an
                 emerging subfield of explainable machine learning that
                 has attracted considerable attention in recent years.
                 The goal of XRL is to elucidate the decision-making
                 process of \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "168",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Guerraoui:2024:BML,
  author =       "Rachid Guerraoui and Nirupam Gupta and Rafael Pinot",
  title =        "{Byzantine} Machine Learning: a Primer",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "169:1--169:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3616537",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3616537",
  abstract =     "The problem of Byzantine resilience in distributed
                 machine learning, a.k.a. Byzantine machine learning,
                 consists of designing distributed algorithms that can
                 train an accurate model despite the presence of
                 Byzantine \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "169",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Qayyum:2024:STA,
  author =       "Adnan Qayyum and Muhammad Atif Butt and Hassan Ali and
                 Muhammad Usman and Osama Halabi and Ala Al-Fuqaha and
                 Qammer H. Abbasi and Muhammad Ali Imran and Junaid
                 Qadir",
  title =        "Secure and Trustworthy Artificial
                 Intelligence-extended Reality ({AI-XR}) for
                 Metaverses",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "170:1--170:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3614426",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3614426",
  abstract =     "Metaverse is expected to emerge as a new paradigm for
                 the next-generation Internet, providing fully immersive
                 and personalized experiences to socialize, work, and
                 play in self-sustaining and hyper-spatio-temporal
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "170",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Prado-Romero:2024:SGC,
  author =       "Mario Alfonso Prado-Romero and Bardh Prenkaj and
                 Giovanni Stilo and Fosca Giannotti",
  title =        "A Survey on Graph Counterfactual Explanations:
                 Definitions, Methods, Evaluation, and Research
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "171:1--171:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3618105",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3618105",
  abstract =     "Graph Neural Networks (GNNs) perform well in community
                 detection and molecule classification. Counterfactual
                 Explanations (CE) provide counter-examples to overcome
                 the transparency limitations of black-box \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "171",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wan:2024:SDR,
  author =       "Zhijing Wan and Zhixiang Wang and Cheukting Chung and
                 Zheng Wang",
  title =        "A Survey of Dataset Refinement for Problems in
                 Computer Vision Datasets",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "172:1--172:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3627157",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3627157",
  abstract =     "Large- scale datasets have played a crucial role in
                 the advancement of computer vision. However, they often
                 suffer from problems such as class imbalance, noisy
                 labels, dataset bias, or high resource costs, which can
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "172",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lu:2024:RAP,
  author =       "Qinghua Lu and Liming Zhu and Xiwei Xu and Jon Whittle
                 and Didar Zowghi and Aurelie Jacquet",
  title =        "Responsible {AI} Pattern Catalogue: a Collection of
                 Best Practices for {AI} Governance and Engineering",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "173:1--173:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626234",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626234",
  abstract =     "Responsible Artificial Intelligence (RAI) is widely
                 considered as one of the greatest scientific challenges
                 of our time and is key to increase the adoption of
                 Artificial Intelligence (AI). Recently, a number of AI
                 ethics principles \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "173",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xiong:2024:IAA,
  author =       "Peiyu Xiong and Michael Tegegn and Jaskeerat Singh
                 Sarin and Shubhraneel Pal and Julia Rubin",
  title =        "It Is All about Data: a Survey on the Effects of Data
                 on Adversarial Robustness",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "174:1--174:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3627817",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3627817",
  abstract =     "Adversarial examples are inputs to machine learning
                 models that an attacker has intentionally designed to
                 confuse the model into making a mistake. Such examples
                 pose a serious threat to the applicability of machine
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "174",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chaalan:2024:PDR,
  author =       "Tarek Chaalan and Shaoning Pang and Joarder
                 Kamruzzaman and Iqbal Gondal and Xuyun Zhang",
  title =        "The Path to Defence: a Roadmap to Characterising Data
                 Poisoning Attacks on Victim Models",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "175:1--175:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3627536",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3627536",
  abstract =     "Data Poisoning Attacks (DPA) represent a sophisticated
                 technique aimed at distorting the training data of
                 machine learning models, thereby manipulating their
                 behavior. This process is not only technically
                 intricate but also \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "175",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Perez-Cerrolaza:2024:AIS,
  author =       "Jon Perez-Cerrolaza and Jaume Abella and Markus Borg
                 and Carlo Donzella and Jes{\'u}s Cerquides and
                 Francisco J. Cazorla and Cristofer Englund and Markus
                 Tauber and George Nikolakopoulos and Jose Luis Flores",
  title =        "Artificial Intelligence for Safety-Critical Systems in
                 Industrial and Transportation Domains: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "176:1--176:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3626314",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3626314",
  abstract =     "Artificial Intelligence (AI) can enable the
                 development of next-generation autonomous
                 safety-critical systems in which Machine Learning (ML)
                 algorithms learn optimized and safe solutions. AI can
                 also support and assist \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "176",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhao:2024:SRC,
  author =       "Chuanjun Zhao and Meiling Wu and Xinyi Yang and Wenyue
                 Zhang and Shaoxia Zhang and Suge Wang and Deyu Li",
  title =        "A Systematic Review of Cross-Lingual Sentiment
                 Analysis: Tasks, Strategies, and Prospects",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "177:1--177:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645106",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645106",
  abstract =     "Traditional methods for sentiment analysis, when
                 applied in a monolingual context, often yield less than
                 optimal results in multilingual settings. This
                 underscores the need for a more thorough exploration of
                 cross-lingual \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "177",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2024:TSC,
  author =       "Jiliang Zhang and Congcong Chen and Jinhua Cui and
                 Keqin Li",
  title =        "Timing Side-channel Attacks and Countermeasures in
                 {CPU} Microarchitectures",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "178:1--178:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645109",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645109",
  abstract =     "Microarchitectural vulnerabilities, such as Meltdown
                 and Spectre, exploit subtle microarchitecture state to
                 steal the user's secret data and even compromise the
                 operating systems. In recent years, considerable
                 discussion \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "178",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Heo:2024:BDS,
  author =       "Jun Wook Heo and Gowri Sankar Ramachandran and Ali
                 Dorri and Raja Jurdak",
  title =        "Blockchain Data Storage Optimisations: a Comprehensive
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "179:1--179:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645104",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645104",
  abstract =     "Blockchain offers immutability, transparency, and
                 security in a decentralised way for many applications,
                 including finance, supply chain, and the Internet of
                 Things (IoT). Due to its popularity and widespread
                 adoption, it has \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "179",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2024:SRD,
  author =       "Cheng Zhang and Bo Ou and Fei Peng and Yao Zhao and
                 Keqin Li",
  title =        "A Survey on Reversible Data Hiding for Uncompressed
                 Images",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "180:1--180:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645105",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645105",
  abstract =     "Reversible data hiding (RDH) has developed various
                 theories and algorithms since the early 1990s. The
                 existing works involve a large amount of specialized
                 knowledge, making it difficult for researchers,
                 especially primary \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "180",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bakhtiarnia:2024:EHR,
  author =       "Arian Bakhtiarnia and Qi Zhang and Alexandros
                 Iosifidis",
  title =        "Efficient High-Resolution Deep Learning: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "181:1--181:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645107",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645107",
  abstract =     "Cameras in modern devices such as smartphones,
                 satellites and medical equipment are capable of
                 capturing very high resolution images and videos. Such
                 high-resolution data often need to be processed by deep
                 learning \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "181",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rodrigues:2024:SMS,
  author =       "Andrey Rodrigues and Maria L{\'u}cia Villela and
                 Eduardo Feitosa",
  title =        "A Systematic Mapping Study on Social Network Privacy:
                 Threats and Solutions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "182:1--182:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645086",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645086",
  abstract =     "Online Social Networks (OSNs) are becoming pervasive
                 in today's world. Millions of people worldwide are
                 involved in different forms of online networking.
                 However, this ease of use of OSNs comes with a cost in
                 terms of \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "182",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Niksirat:2024:WAT,
  author =       "Kavous Salehzadeh Niksirat and Lev Velykoivanenko and
                 No{\'e} Zufferey and Mauro Cherubini and K{\'e}vin
                 Huguenin and Mathias Humbert",
  title =        "Wearable Activity Trackers: a Survey on Utility,
                 Privacy, and Security",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "183:1--183:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645091",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645091",
  abstract =     "Over the past decade, wearable activity trackers
                 (WATs) have become increasingly popular. However,
                 despite many research studies in different fields (e.g.
                 psychology, health, and design), few have sought to
                 jointly examine \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "183",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Methnani:2024:WCH,
  author =       "Leila Methnani and Manolis Chiou and Virginia Dignum
                 and Andreas Theodorou",
  title =        "Who's in Charge Here? {A} Survey on Trustworthy {AI}
                 in Variable Autonomy Robotic Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "184:1--184:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645090",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645090",
  abstract =     "This article surveys the Variable Autonomy (VA)
                 robotics literature that considers two contributory
                 elements to Trustworthy AI: transparency and
                 explainability. These elements should play a crucial
                 role when \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "184",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2024:UBI,
  author =       "Jiajia Wang and Jimmy Xiangji Huang and Xinhui Tu and
                 Junmei Wang and Angela Jennifer Huang and Md Tahmid
                 Rahman Laskar and Amran Bhuiyan",
  title =        "Utilizing {BERT} for Information Retrieval: Survey,
                 Applications, Resources, and Challenges",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "185:1--185:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648471",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648471",
  abstract =     "Recent years have witnessed a substantial increase in
                 the use of deep learning to solve various natural
                 language processing (NLP) problems. Early deep learning
                 models were constrained by their sequential or
                 unidirectional \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "185",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Shahidinejad:2024:AIT,
  author =       "Ali Shahidinejad and Jemal Abawajy",
  title =        "An All-Inclusive Taxonomy and Critical Review of
                 Blockchain-Assisted Authentication and Session Key
                 Generation Protocols for {IoT}",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "186:1--186:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645087",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645087",
  abstract =     "Authentication and Session Key Generation Protocols
                 (SKGPs) play an essential role in securing the
                 communication channels of connected Internet of Things
                 (IoT) devices. Recently, through blockchain \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "186",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhou:2024:SEE,
  author =       "Lihua Zhou and Guowang Du and Kevin L{\"u} and Lizheng
                 Wang and Jingwei Du",
  title =        "A Survey and an Empirical Evaluation of Multi-View
                 Clustering Approaches",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "187:1--187:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645108",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645108",
  abstract =     "Multi- view clustering (MVC) holds a significant role
                 in domains like machine learning, data mining, and
                 pattern recognition. Despite the development of
                 numerous new MVC approaches employing various
                 techniques, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "187",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gao:2024:GBX,
  author =       "Yuyang Gao and Siyi Gu and Junji Jiang and Sungsoo Ray
                 Hong and Dazhou Yu and Liang Zhao",
  title =        "Going Beyond {XAI}: a Systematic Survey for
                 Explanation-Guided Learning",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "188:1--188:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3644073",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3644073",
  abstract =     "As the societal impact of Deep Neural Networks (DNNs)
                 grows, the goals for advancing DNNs become more complex
                 and diverse, ranging from improving a conventional
                 model accuracy metric to infusing advanced human
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "188",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2024:GVA,
  author =       "Yang Liu and Dingkang Yang and Yan Wang and Jing Liu
                 and Jun Liu and Azzedine Boukerche and Peng Sun and
                 Liang Song",
  title =        "Generalized Video Anomaly Event Detection: Systematic
                 Taxonomy and Comparison of Deep Models",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "189:1--189:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645101",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645101",
  abstract =     "Video Anomaly Detection (VAD) serves as a pivotal
                 technology in the intelligent surveillance systems,
                 enabling the temporal or spatial identification of
                 anomalous events within videos. While existing reviews
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "189",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yang:2024:IWS,
  author =       "Luyao Yang and Osama Amin and Basem Shihada",
  title =        "Intelligent Wearable Systems: Opportunities and
                 Challenges in Health and Sports",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "7",
  pages =        "190:1--190:??",
  month =        jul,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648469",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Apr 18 06:07:10 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648469",
  abstract =     "Wearable devices, or wearables, designed to be
                 attached to the human body, can gather personalized
                 real-time data and continuously monitor an individual's
                 health status and physiological disposition in a
                 non-invasive \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "190",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Shao:2024:DGN,
  author =       "Yingxia Shao and Hongzheng Li and Xizhi Gu and Hongbo
                 Yin and Yawen Li and Xupeng Miao and Wentao Zhang and
                 Bin Cui and Lei Chen",
  title =        "Distributed Graph Neural Network Training: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "191:1--191:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648358",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648358",
  abstract =     "Graph neural networks (GNNs) are a type of deep
                 learning models that are trained on graphs and have
                 been successfully applied in various domains.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "191",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Singh:2024:SNA,
  author =       "Shashank Sheshar Singh and Samya Muhuri and Shivansh
                 Mishra and Divya Srivastava and Harish Kumar Shakya and
                 Neeraj Kumar",
  title =        "Social Network Analysis: a Survey on Process, Tools,
                 and Application",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "192:1--192:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648470",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648470",
  abstract =     "Due to the explosive rise of online social networks,
                 social network analysis (SNA) has emerged as a
                 significant academic field in recent years. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "192",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Malhotra:2024:SLR,
  author =       "Ruchika Malhotra and Anjali Bansal and Marouane
                 Kessentini",
  title =        "A Systematic Literature Review on Maintenance of
                 Software Containers",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "193:1--193:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3645092",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3645092",
  abstract =     "Nowadays, cloud computing is gaining tremendous
                 attention to deliver information via the internet.
                 Virtualization plays a major role in cloud computing as
                 it deploys multiple virtual machines on the same
                 physical machine and thus results in improving resource
                 utilization. Hypervisor-based virtualization and
                 containerization are two commonly used approaches in
                 operating system virtualization. In this article, we
                 provide a systematic literature review on various
                 phases in maintenance of containers including container
                 image detection, container scheduling, container
                 security measures, and performance evaluation of
                 containers. We have selected 145 primary studies out of
                 which 24\% of studies are related to container
                 performance evaluation, 42\% of studies are related to
                 container scheduling techniques, 22\% of studies are
                 related to container security measures, and 12\% of
                 studies are related to container image detection
                 process. A few studies are related to container image
                 detection process and evaluation of container security
                 measures. Resource utilization is the most considered
                 performance objective in almost all container
                 scheduling techniques. We conclude that there is a need
                 to introduce new tagging approaches, smell detection
                 approaches, and also new approaches to detect and
                 resolve threat issues in containers so that we can
                 maintain the security of containers.",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "193",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kurzweg:2024:SHF,
  author =       "Marco Kurzweg and Yannick Weiss and Marc O. Ernst and
                 Albrecht Schmidt and Katrin Wolf",
  title =        "Survey on Haptic Feedback through Sensory Illusions in
                 Interactive Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "194:1--194:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648353",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648353",
  abstract =     "A growing body of work in human-computer interaction
                 (HCI), particularly work on haptic feedback and haptic
                 displays, relies on sensory \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "194",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jyothish:2024:SRP,
  author =       "K. J. Jyothish and Subhankar Mishra",
  title =        "A Survey on Robotic Prosthetics: Neuroprosthetics,
                 Soft Actuators, and Control Strategies",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "195:1--195:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648355",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648355",
  abstract =     "The field of robotics is a quickly evolving feat of
                 technology that accepts contributions from various
                 genres of science. Neuroscience, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "195",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alhidaifi:2024:SCR,
  author =       "Saleh Mohamed Alhidaifi and Muhammad Rizwan Asghar and
                 Imran Shafique Ansari",
  title =        "A Survey on Cyber Resilience: Key Strategies, Research
                 Challenges, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "196:1--196:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3649218",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3649218",
  abstract =     "Cyber resilience has become a major concern for both
                 academia and industry due to the increasing number of
                 data breaches caused by the \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "196",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Carrasco:2024:CTP,
  author =       "Karen Carrasco and Lenin Tomal{\'a} and Eileen
                 Ram{\'\i}rez Meza and Doris Meza Bola{\~n}os and
                 Washington Ram{\'\i}rez Montalvan",
  title =        "Computational Techniques in {PET\slash CT} Image
                 Processing for Breast Cancer: a Systematic Mapping
                 Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "197:1--197:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648359",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648359",
  abstract =     "The problem arises from the lack of sufficient and
                 comprehensive information about the necessary computer
                 techniques. These techniques are crucial for \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "197",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Keizer:2024:SCR,
  author =       "Navin Keizer and Onur Ascigil and Michal Kr{\'o}l and
                 Dirk Kutscher and George Pavlou",
  title =        "A Survey on Content Retrieval on the Decentralised
                 {Web}",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "198:1--198:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3649132",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3649132",
  abstract =     "The control, governance, and management of the web
                 have become increasingly centralised, resulting in
                 security, privacy, and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "198",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhao:2024:SBA,
  author =       "Ying Zhao and Jia Tina Du and Jinjun Chen",
  title =        "Scenario-based Adaptations of Differential Privacy: a
                 Technical Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "199:1--199:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3651153",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3651153",
  abstract =     "Differential privacy has been a de facto privacy
                 standard in defining privacy and handling privacy
                 preservation. It has had great success in scenarios of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "199",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Barcelos:2024:CRN,
  author =       "Isabela {Borlido Barcelos} and Felipe {De Castro
                 Bel{\'e}m} and Leonardo {De Melo Jo{\~a}o} and Zenilton
                 K. G. {Do Patroc{\'\i}nio} and Alexandre Xavier
                 Falc{\~a}o and Silvio Jamil {Ferzoli Guimar{\~a}es}",
  title =        "A Comprehensive Review and New Taxonomy on Superpixel
                 Segmentation",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "200:1--200:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3652509",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3652509",
  abstract =     "Superpixel segmentation consists of partitioning
                 images into regions composed of similar and connected
                 pixels. Its methods have been widely \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "200",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jiang:2024:MNI,
  author =       "Weiwei Jiang and Jorge Goncalves and Vassilis
                 Kostakos",
  title =        "Mobile Near-infrared Sensing --- a Systematic Review
                 on Devices, Data, Modeling, and Applications",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "201:1--201:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3652596",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3652596",
  abstract =     "Mobile near-infrared sensing is becoming an
                 increasingly important method in many research and
                 industrial areas. To help consolidate progress in
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "201",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Segovia-Ferreira:2024:SCR,
  author =       "Mariana Segovia-Ferreira and Jose Rubio-Hernan and Ana
                 Cavalli and Joaquin Garcia-Alfaro",
  title =        "A Survey on Cyber-Resilience Approaches for
                 Cyber-Physical Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "202:1--202:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3652953",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3652953",
  abstract =     "Concerns for the resilience of Cyber-Physical Systems
                 (CPS)s in critical infrastructure are growing. CPS
                 integrate sensing, computation, control, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "202",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2024:EMB,
  author =       "Bing Zhang and Xuyang Zhao and Jiangtian Nie and
                 Jianhang Tang and Yuling Chen and Yang Zhang and Dusit
                 Niyato",
  title =        "Epidemic Model-based Network Influential Node Ranking
                 Methods: a Ranking Rationality Perspective",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "203:1--203:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3653296",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3653296",
  abstract =     "Existing surveys and reviews on Influential Node
                 Ranking Methods (INRMs) have primarily focused on
                 technical details, neglecting \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "203",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nowrozy:2024:PPE,
  author =       "Raza Nowrozy and Khandakar Ahmed and A. S. M. Kayes
                 and Hua Wang and Timothy R. McIntosh",
  title =        "Privacy Preservation of Electronic Health Records in
                 the Modern Era: a Systematic Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "204:1--204:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3653297",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3653297",
  abstract =     "Building a secure and privacy-preserving health data
                 sharing framework is a topic of great interest in the
                 healthcare sector, but its success is subject to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "204",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Elder:2024:SSV,
  author =       "Sarah Elder and Md Rayhanur Rahman and Gage Fringer
                 and Kunal Kapoor and Laurie Williams",
  title =        "A Survey on Software Vulnerability Exploitability
                 Assessment",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "205:1--205:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648610",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648610",
  abstract =     "Knowing the exploitability and severity of software
                 vulnerabilities helps practitioners prioritize
                 vulnerability mitigation efforts. Researchers
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "205",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Oliveira:2024:RDP,
  author =       "Andre Rodrigues Oliveira and Klairton Lima Brito and
                 Alexsandro Oliveira Alexandrino and Gabriel Siqueira
                 and Ulisses Dias and Zanoni Dias",
  title =        "Rearrangement Distance Problems: an updated survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "206:1--206:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3653295",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3653295",
  abstract =     "One of the challenges in the Comparative Genomics
                 field is to infer how close two organisms are based on
                 the similarities and differences between their
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "206",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jain:2024:TSG,
  author =       "Shubhra Jain and Rahul Kumar Verma",
  title =        "A Taxonomy and Survey on Grid-Based Routing Protocols
                 Designed for Wireless Sensor Networks",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "207:1--207:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3653315",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3653315",
  abstract =     "Minimization of energy consumption is the main
                 attention of researchers while developing a routing
                 protocol for wireless sensor networks, as sensor
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "207",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lanciano:2024:SDS,
  author =       "Tommaso Lanciano and Atsushi Miyauchi and Adriano
                 Fazzone and Francesco Bonchi",
  title =        "A Survey on the Densest Subgraph Problem and its
                 Variants",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "208:1--208:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3653298",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3653298",
  abstract =     "The Densest Subgraph Problem requires us to find, in a
                 given graph, a subset of vertices whose induced
                 subgraph maximizes a measure of \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "208",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Masmoudi:2024:SDI,
  author =       "Maroua Masmoudi and Sana Ben Abdallah {Ben Lamine} and
                 Mohamed Hedi Karray and Bernard Archimede and Hajer
                 Baazaoui Zghal",
  title =        "Semantic Data Integration and Querying: a Survey and
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "209:1--209:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3653317",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3653317",
  abstract =     "Digital revolution produces massive, heterogeneous and
                 isolated data. These latter remain underutilized,
                 unsuitable for integrated querying and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "209",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chafik:2024:CPM,
  author =       "Ahmed Amine Chafik and Jaafar Gaber and Souad Tayane
                 and Mohamed Ennaji and Julien Bourgeois and Tarek {El
                 Ghazawi}",
  title =        "From Conventional to Programmable Matter Systems: a
                 Review of Design, Materials, and Technologies",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "210:1--210:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3653671",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3653671",
  abstract =     "Programmable matter represents a system of elements
                 whose interactions can be programmed for a certain
                 behavior to emerge (e.g., color, shape) \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "210",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lu:2024:RAA,
  author =       "Pengyuan Lu and Lin Zhang and Mengyu Liu and Kaustubh
                 Sridhar and Oleg Sokolsky and Fanxin Kong and Insup
                 Lee",
  title =        "Recovery from Adversarial Attacks in Cyber-physical
                 Systems: Shallow, Deep, and Exploratory Works",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "211:1--211:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3653974",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3653974",
  abstract =     "Cyber-physical systems (CPS) have experienced rapid
                 growth in recent decades. However, like any other
                 computer-based systems, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "211",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gray:2024:IAM,
  author =       "Jason Gray and Daniele Sgandurra and Lorenzo Cavallaro
                 and Jorge Blasco Alis",
  title =        "Identifying Authorship in Malicious Binaries:
                 Features, Challenges \& Datasets",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "212:1--212:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3653973",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3653973",
  abstract =     "Attributing a piece of malware to its creator
                 typically requires threat intelligence. Binary
                 attribution increases the level of difficulty as it
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "212",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Saxena:2024:FAF,
  author =       "Akrati Saxena and George Fletcher and Mykola
                 Pechenizkiy",
  title =        "{FairSNA}: Algorithmic Fairness in Social Network
                 Analysis",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "213:1--213:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3653711",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3653711",
  abstract =     "In recent years, designing fairness-aware methods has
                 received much attention in various domains, including
                 machine learning, natural language \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "213",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Angelogianni:2024:HMF,
  author =       "Anna Angelogianni and Ilias Politis and Christos
                 Xenakis",
  title =        "How many {FIDO} protocols are needed? {Analysing} the
                 technology, security and compliance",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "214:1--214:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3654661",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3654661",
  abstract =     "To overcome the security vulnerabilities caused by
                 weak passwords, thus bridge the gap between user
                 friendly interfaces and advanced security features,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "214",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Otoum:2024:MLM,
  author =       "Yazan Otoum and Navya Gottimukkala and Neeraj Kumar
                 and Amiya Nayak",
  title =        "Machine Learning in {Metaverse} Security: Current
                 Solutions and Future Challenges",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "8",
  pages =        "215:1--215:??",
  month =        aug,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3654663",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:04 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3654663",
  abstract =     "The Metaverse, positioned as the next frontier of the
                 Internet, has the ambition to forge a virtual shared
                 realm characterized by immersion, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "215",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhao:2024:DMD,
  author =       "Fei Zhao and Chengcui Zhang and Baocheng Geng",
  title =        "Deep Multimodal Data Fusion",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "216:1--216:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3649447",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3649447",
  abstract =     "Multimodal Artificial Intelligence (Multimodal AI), in
                 general, involves various types of data (e.g., images,
                 texts, or data collected from \ldots{})",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "216",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Foumani:2024:DLT,
  author =       "Navid Mohammadi Foumani and Lynn Miller and Chang Wei
                 Tan and Geoffrey I. Webb and Germain Forestier and
                 Mahsa Salehi",
  title =        "Deep Learning for Time Series Classification and
                 Extrinsic Regression: a Current Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "217:1--217:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3649448",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3649448",
  abstract =     "Time Series Classification and Extrinsic Regression
                 are important and challenging machine learning tasks.
                 Deep learning has \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "217",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hasan:2024:SSR,
  author =       "Monowar Hasan and Ashish Kashinath and Chien-Ying Chen
                 and Sibin Mohan",
  title =        "{SoK}: Security in Real-Time Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "218:1--218:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3649499",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3649499",
  abstract =     "Security is an increasing concern for real-time
                 systems (RTS). Over the last decade or so, researchers
                 have demonstrated attacks and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "218",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gajcin:2024:RCE,
  author =       "Jasmina Gajcin and Ivana Dusparic",
  title =        "Redefining Counterfactual Explanations for
                 Reinforcement Learning: Overview, Challenges and
                 Opportunities",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "219:1--219:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648472",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648472",
  abstract =     "While AI algorithms have shown remarkable success in
                 various fields, their lack of transparency hinders
                 their application to real-life tasks. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "219",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Du:2024:FSA,
  author =       "Kelvin Du and Frank Xing and Rui Mao and Erik
                 Cambria",
  title =        "Financial Sentiment Analysis: Techniques and
                 Applications",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "220:1--220:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3649451",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3649451",
  abstract =     "Financial Sentiment Analysis (FSA) is an important
                 domain application of sentiment analysis that has
                 gained increasing attention in the \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "220",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2024:NIT,
  author =       "Na Li and Rui Zhou and Bharath Krishna and Ashirbad
                 Pradhan and Hyowon Lee and Jiayuan He and Ning Jiang",
  title =        "Non-invasive Techniques for Muscle Fatigue Monitoring:
                 a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "221:1--221:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648679",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648679",
  abstract =     "Muscle fatigue represents a complex physiological and
                 psychological phenomenon that impairs physical
                 performance and increases the \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "221",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Daniele:2024:FSS,
  author =       "Cristian Daniele and Seyed Behnam Andarzian and Erik
                 Poll",
  title =        "Fuzzers for Stateful Systems: Survey and Research
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "222:1--222:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648468",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648468",
  abstract =     "Fuzzing is a very effective testing methodology to
                 find bugs. In a nutshell, a fuzzer sends many slightly
                 malformed messages to the software \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "222",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nguyen:2024:DLI,
  author =       "Kien Nguyen and Hugo Proen{\c{c}}a and Fernando
                 Alonso-Fernandez",
  title =        "Deep Learning for Iris Recognition: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "223:1--223:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3651306",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3651306",
  abstract =     "In this survey, we provide a comprehensive review of
                 more than 200 articles, technical reports, and GitHub
                 repositories published over the \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "223",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Khadka:2024:RML,
  author =       "Anita Khadka and Saurav Sthapit and Gregory Epiphaniou
                 and Carsten Maple",
  title =        "Resilient Machine Learning: Advancement, Barriers, and
                 Opportunities in the Nuclear Industry",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "224:1--224:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648608",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648608",
  abstract =     "The widespread adoption and success of Machine
                 Learning (ML) technologies depend on thorough testing
                 of the resilience and robustness to \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "224",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Huo:2024:THO,
  author =       "Shuai Huo and Dong Liu and Haotian Zhang and Li Li and
                 Siwei Ma and Feng Wu and Wen Gao",
  title =        "Towards Hybrid-Optimization Video Coding",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "225:1--225:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3652148",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3652148",
  abstract =     "Video coding that pursues the highest compression
                 efficiency is the art of computing for rate-distortion
                 optimization. The optimization \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "225",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ali:2024:CDD,
  author =       "Najah Abed Abu Ali and Mubashir Rehman and Shahid
                 Mumtaz and Muhammad Bilal Khan and Mohammad Hayajneh
                 and Farman Ullah and Raza Ali Shah",
  title =        "Contactless Diseases Diagnoses Using Wireless
                 Communication Sensing: Methods and Challenges Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "226:1--226:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648352",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648352",
  abstract =     "Respiratory illness diagnosis and continuous
                 monitoring are becoming popular as sensitive markers of
                 chronic diseases. This interest has \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "226",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Singh:2024:SCE,
  author =       "Upendra Singh and Kumar Abhishek and Hiteshwar Kumar
                 Azad",
  title =        "A Survey of Cutting-edge Multimodal Sentiment
                 Analysis",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "227:1--227:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3652149",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3652149",
  abstract =     "The rapid growth of the internet has reached the
                 fourth generation, i.e., web 4.0, which supports
                 Sentiment Analysis (SA) in many applications such
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "227",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2024:CDG,
  author =       "Shiyu Wang and Yuanqi Du and Xiaojie Guo and Bo Pan
                 and Zhaohui Qin and Liang Zhao",
  title =        "Controllable Data Generation by Deep Learning: a
                 Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "228:1--228:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648609",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648609",
  abstract =     "Designing and generating new data under targeted
                 properties has been attracting various critical
                 applications such as molecule design, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "228",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Truger:2024:WSQ,
  author =       "Felix Truger and Johanna Barzen and Marvin Bechtold
                 and Martin Beisel and Frank Leymann and Alexander Mandl
                 and Vladimir Yussupov",
  title =        "Warm-Starting and Quantum Computing: a Systematic
                 Mapping Study",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "229:1--229:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3652510",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3652510",
  abstract =     "Due to low numbers of qubits and their
                 error-proneness, Noisy Intermediate-Scale Quantum
                 (NISQ) computers impose constraints on the size
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "229",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2024:PTL,
  author =       "Junyi Li and Tianyi Tang and Wayne Xin Zhao and
                 Jian-Yun Nie and Ji-Rong Wen",
  title =        "Pre-Trained Language Models for Text Generation: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "230:1--230:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3649449",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3649449",
  abstract =     "Text Generation aims to produce plausible and readable
                 text in human language from input data. The resurgence
                 of deep learning \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "230",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Amaro:2024:DMK,
  author =       "Ricardo Amaro and R{\'u}ben Pereira and Miguel Mira da
                 Silva",
  title =        "{DevOps} Metrics and {KPIs}: a Multivocal Literature
                 Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "231:1--231:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3652508",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3652508",
  abstract =     "Context: Information Technology organizations are
                 aiming to implement DevOps capabilities to fulfill
                 market, customer, and internal needs. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "231",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Luo:2024:LIE,
  author =       "Siwen Luo and Hamish Ivison and Soyeon Caren Han and
                 Josiah Poon",
  title =        "Local Interpretations for Explainable Natural Language
                 Processing: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "232:1--232:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3649450",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3649450",
  abstract =     "As the use of deep learning techniques has grown
                 across various fields over the past decade, complaints
                 about the opaqueness of the black-box \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "232",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sultana:2024:DDR,
  author =       "Saima Sultana and Muhammad Mansoor Alam and Mazliham
                 Mohd Su'ud and Jawahir Che Mustapha and Mukesh Prasad",
  title =        "A Deep Dive into Robot Vision --- an Integrative
                 Systematic Literature Review Methodologies and Research
                 Endeavor Practices",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "233:1--233:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648357",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648357",
  abstract =     "Novel technological swarm and industry 4.0 mold the
                 recent Robot vision research into innovative discovery.
                 To enhance technological \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "233",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pioli:2024:IEP,
  author =       "La{\'e}rcio Pioli and Douglas D. J. de Macedo and
                 Daniel G. Costa and Mario A. R. Dantas",
  title =        "Intelligent Edge-powered Data Reduction: a Systematic
                 Literature Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "234:1--234:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3656338",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3656338",
  abstract =     "The development of the Internet of Things (IoT)
                 paradigm and its significant spread as an affordable
                 data source has brought many challenges \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "234",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2024:OAT,
  author =       "Weiqi Li",
  title =        "Optimizing with Attractor: a Tutorial",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "235:1--235:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648354",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648354",
  abstract =     "This tutorial presents a novel search system-the
                 Attractor-Based Search System (ABSS)-that can solve the
                 Traveling Salesman Problem \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "235",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jung:2024:TMB,
  author =       "Gyuwon Jung and Sangjun Park and Eun-Yeol Ma and
                 Heeyoung Kim and Uichin Lee",
  title =        "Tutorial on Matching-based Causal Analysis of Human
                 Behaviors Using Smartphone Sensor Data",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "236:1--236:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3648356",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3648356",
  abstract =     "Smartphones can unobtrusively capture human behavior
                 and contextual data such as user interaction and
                 mobility. Thus far, smartphone sensor \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "236",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alhakamy:2024:ERX,
  author =       "A'aeshah Alhakamy",
  title =        "Extended Reality {(XR)} Toward Building Immersive
                 Solutions: The Key to Unlocking {Industry 4.0}",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "237:1--237:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3652595",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3652595",
  abstract =     "When developing XR applications for Industry 4.0, it
                 is important to consider the integration of visual
                 displays, hardware components, and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "237",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cheng:2024:ITD,
  author =       "Pau-Chen Cheng and Wojciech Ozga and Enriquillo Valdez
                 and Salman Ahmed and Zhongshu Gu and Hani Jamjoom and
                 Hubertus Franke and James Bottomley",
  title =        "{Intel TDX} Demystified: a Top-Down Approach",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "238:1--238:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3652597",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3652597",
  abstract =     "Intel Trust Domain Extensions (TDX) is an
                 architectural extension in the 4th Generation Intel
                 Xeon Scalable Processor that supports confidential
                 computing. TDX allows the deployment of virtual
                 machines in the Secure-Arbitration Mode (SEAM) with
                 encrypted CPU state and memory, integrity protection,
                 and remote attestation. TDX aims at enforcing
                 hardware-assisted isolation for virtual machines and
                 minimize the attack surface exposed to host platforms,
                 which are considered to be untrustworthy or adversarial
                 in the confidential computing's new threat model. TDX
                 can be leveraged by regulated industries or sensitive
                 data holders to outsource their computations and data
                 with end-to-end protection in public cloud
                 infrastructures.\par

                 This article aims at providing a comprehensive
                 understanding of TDX to potential adopters, domain
                 experts, and security researchers looking to leverage
                 the technology for their own purposes. We adopt a
                 top-down approach, starting with high-level security
                 principles and moving to low-level technical details of
                 TDX. Our analysis is based on publicly available
                 documentation and source code, offering insights from
                 security researchers outside of Intel.",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "238",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Biancofiore:2024:IQA,
  author =       "Giovanni Maria Biancofiore and Yashar Deldjoo and
                 Tommaso {Di Noia} and Eugenio {Di Sciascio} and
                 Fedelucio Narducci",
  title =        "Interactive Question Answering Systems: Literature
                 Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "239:1--239:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3657631",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3657631",
  abstract =     "Question- answering systems are recognized as popular
                 and frequently effective means of information seeking
                 on the web. In such systems, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "239",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2024:HFR,
  author =       "Lingyun Wang and Hanlin Zhou and Yinwei Bao and
                 Xiaoran Yan and Guojiang Shen and Xiangjie Kong",
  title =        "Horizontal Federated Recommender System: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "240:1--240:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3656165",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3656165",
  abstract =     "Due to underlying privacy-sensitive information in
                 user-item interaction data, the risk of privacy leakage
                 exists in the centralized-training \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "240",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Priya:2024:CPN,
  author =       "Priyanshu Priya and Mauajama Firdaus and Asif Ekbal",
  title =        "Computational Politeness in Natural Language
                 Processing: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "241:1--241:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3654660",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3654660",
  abstract =     "Computational approach to politeness is the task of
                 automatically predicting and/or generating politeness
                 in text. This is a pivotal task for conversational
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "241",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xu:2024:EBT,
  author =       "Minghui Xu and Yihao Guo and Chunchi Liu and Qin Hu
                 and Dongxiao Yu and Zehui Xiong and Niyato, Dusit (Tao)
                 and Xiuzhen Cheng",
  title =        "Exploring Blockchain Technology through a Modular
                 Lens: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "9",
  pages =        "242:1--242:??",
  month =        sep,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3657288",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu May 16 09:22:05 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3657288",
  abstract =     "Blockchain has attracted significant attention in
                 recent years due to its potential to revolutionize
                 various industries by providing trustlessness. To
                 comprehensively examine blockchain systems, this
                 article presents both a macro-level overview on the
                 most popular blockchain systems, and a micro-level
                 analysis on a general blockchain framework and its
                 crucial components. The macro-level exploration
                 provides a big picture on the endeavors made by
                 blockchain professionals over the years to enhance the
                 blockchain performance while the micro-level
                 investigation details the blockchain building blocks
                 for deep technology comprehension. More specifically,
                 this article introduces a general modular blockchain
                 analytic framework that decomposes a blockchain system
                 into interacting modules and then examines the major
                 modules to cover the essential blockchain components of
                 network, consensus, and distributed ledger at the
                 micro-level. The framework as well as the modular
                 analysis jointly build a foundation for designing
                 scalable, flexible, and application-adaptive
                 blockchains that can meet diverse requirements.
                 Additionally, this article explores popular
                 technologies that can be integrated with blockchain to
                 expand functionality and highlights major challenges.
                 Such a study provides critical insights to overcome the
                 obstacles in designing novel blockchain systems and
                 facilitates the further development of blockchain as a
                 digital infrastructure to service new applications.",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "242",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gaudreault:2024:SLR,
  author =       "Jean-Gabriel Gaudreault and Paula Branco",
  title =        "A Systematic Literature Review of Novelty Detection in
                 Data Streams: Challenges and Opportunities",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "243:1--243:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3657286",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3657286",
  abstract =     "Novelty detection in data streams is the task of
                 detecting concepts that were not known prior, in
                 streams of data. Many machine learning algorithms have
                 been proposed to detect these novelties, as well as
                 integrate them. This study provides a systematic
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "243",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lai:2024:SAG,
  author =       "Huiyuan Lai and Malvina Nissim",
  title =        "A Survey on Automatic Generation of Figurative
                 Language: From Rule-based Systems to Large Language
                 Models",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "244:1--244:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3654795",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3654795",
  abstract =     "Figurative language generation (FLG) is the task of
                 reformulating a given text to include a desired figure
                 of speech, such as a hyperbole, a simile, and several
                 others, while still being faithful to the original
                 context. This is a fundamental, yet \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "244",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2024:ISC,
  author =       "Xiaojie Wang and Qi Guo and Zhaolong Ning and Lei Guo
                 and Guoyin Wang and Xinbo Gao and Yan Zhang",
  title =        "Integration of Sensing, Communication, and Computing
                 for Metaverse: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "245:1--245:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659946",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659946",
  abstract =     "The metaverse is an Artificial Intelligence
                 (AI)-generated virtual world, in which people can game,
                 work, learn, and socialize. The realization of
                 metaverse not only requires a large amount of computing
                 resources to realize the rendering of the virtual
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "245",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Novo:2024:NPN,
  author =       "Alvaro Novo and Francisco Lobon and Hector Garcia de
                 Marina and Samuel Romero and Francisco Barranco",
  title =        "Neuromorphic Perception and Navigation for Mobile
                 Robots: a Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "246:1--246:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3656469",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3656469",
  abstract =     "With the fast and unstoppable evolution of robotics
                 and artificial intelligence, effective autonomous
                 navigation in real-world scenarios has become one of
                 the most pressing challenges in the literature.
                 However, demanding requirements, such as real-time
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "246",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Shen:2024:AIW,
  author =       "Meng Shen and Zhehui Tan and Dusit Niyato and Yuzhi
                 Liu and Jiawen Kang and Zehui Xiong and Liehuang Zhu
                 and Wei Wang and Shen, Xuemin (Sherman)",
  title =        "Artificial Intelligence for {Web 3.0}: a Comprehensive
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "247:1--247:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3657284",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3657284",
  abstract =     "Web 3.0 is the next generation of the Internet built
                 on decentralized technologies such as blockchain and
                 cryptography. It is born to solve the problems faced by
                 the previous generation of the Internet such as
                 imbalanced distribution of interests, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "247",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sponner:2024:ANN,
  author =       "Max Sponner and Bernd Waschneck and Akash Kumar",
  title =        "Adapting Neural Networks at Runtime: Current Trends in
                 At-Runtime Optimizations for Deep Learning",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "248:1--248:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3657283",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3657283",
  abstract =     "Adaptive optimization methods for deep learning adjust
                 the inference task to the current circumstances at
                 runtime to improve the resource footprint while
                 maintaining the model's performance. These methods are
                 essential for the widespread adoption of deep
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "248",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2024:SSD,
  author =       "Juncheng Li and Zehua Pei and Wenjie Li and Guangwei
                 Gao and Longguang Wang and Yingqian Wang and Tieyong
                 Zeng",
  title =        "A Systematic Survey of Deep Learning-Based
                 Single-Image Super-Resolution",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "249:1--249:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659100",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659100",
  abstract =     "Single- image super-resolution (SISR) is an important
                 task in image processing, which aims to enhance the
                 resolution of imaging systems. Recently, SISR has made
                 a huge leap and has achieved promising results with the
                 help of deep learning (DL). In this \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "249",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hadan:2024:DIS,
  author =       "Hilda Hadan and Lydia Choong and Leah Zhang-Kennedy
                 and Lennart E. Nacke",
  title =        "Deceived by Immersion: a Systematic Analysis of
                 Deceptive Design in Extended Reality",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "250:1--250:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659945",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659945",
  abstract =     "The well-established deceptive design literature has
                 focused on conventional user interfaces. With the rise
                 of extended reality (XR), understanding deceptive
                 design's unique manifestations in this immersive domain
                 is crucial. However, existing research \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "250",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Adil:2024:UAI,
  author =       "Muhammad Adil and Houbing Song and Mian Ahmad Jan and
                 Muhammad Khurram Khan and Xiangjian He and Ahmed Farouk
                 and Zhanpeng Jin",
  title =        "{UAV}-Assisted {IoT} Applications, {QoS} Requirements
                 and Challenges with Future Research Directions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "251:1--251:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3657287",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3657287",
  abstract =     "Unmanned Aerial Vehicle (UAV)-assisted Internet of
                 Things application communication is an emerging concept
                 that effectuates the foreknowledge of innovative
                 technologies. With the accelerated advancements in IoT
                 applications, the importance of this \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "251",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mashayekhi:2024:CBS,
  author =       "Yoosof Mashayekhi and Nan Li and Bo Kang and Jefrey
                 Lijffijt and Tijl {De Bie}",
  title =        "A Challenge-based Survey of E-recruitment
                 Recommendation Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "252:1--252:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659942",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659942",
  abstract =     "E- recruitment recommendation systems recommend jobs
                 to job seekers and job seekers to recruiters. The
                 recommendations are generated based on the suitability
                 of job seekers for positions and on job seekers' and
                 recruiters' preferences. Therefore, e-. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "252",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mvula:2024:SAS,
  author =       "Paul Kiyambu Mvula and Paula Branco and Guy-Vincent
                 Jourdan and Herna Lydia Viktor",
  title =        "A Survey on the Applications of Semi-supervised
                 Learning to Cyber-security",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "253:1--253:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3657647",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3657647",
  abstract =     "Machine Learning's widespread application owes to its
                 ability to develop accurate and scalable models. In
                 cyber-security, where labeled data is scarce,
                 Semi-Supervised Learning (SSL) emerges as a potential
                 solution. SSL excels at tasks challenging \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "253",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Maciel:2024:SIT,
  author =       "Rita Suzana Pitangueira Maciel and Pedro Henrique Dias
                 Valle and K{\'e}cia Souza Santos and Elisa Yumi
                 Nakagawa",
  title =        "Systems Interoperability Types: a Tertiary Study",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "254:1--254:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659098",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659098",
  abstract =     "Interoperability has been a focus of attention over at
                 least four decades, with the emergence of several
                 interoperability types (or levels), diverse models,
                 frameworks, and solutions, also as a result of a
                 continuous effort from different domains. The
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "254",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sarafraz:2024:DAG,
  author =       "Gita Sarafraz and Armin Behnamnia and Mehran
                 Hosseinzadeh and Ali Balapour and Amin Meghrazi and
                 Hamid R. Rabiee",
  title =        "Domain Adaptation and Generalization of Functional
                 Medical Data: a Systematic Survey of Brain Data",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "255:1--255:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3654664",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3654664",
  abstract =     "Despite the excellent capabilities of machine learning
                 algorithms, their performance deteriorates when the
                 distribution of test data differs from the distribution
                 of training data. In medical data research, this
                 problem is exacerbated by its connection to \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "255",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Souza:2024:MOC,
  author =       "Paulo Souza and Tiago Ferreto and Rodrigo Calheiros",
  title =        "Maintenance Operations on Cloud, Edge, and {IoT}
                 Environments: Taxonomy, Survey, and Research
                 Challenges",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "256:1--256:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659097",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659097",
  abstract =     "The emergence of the Internet of Things (IoT)
                 introduced new classes of applications whose latency
                 and bandwidth requirements could not be satisfied by
                 the traditional Cloud Computing model. Consequently,
                 the Internet Technology community promoted the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "256",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Halvorsen:2024:AGM,
  author =       "James Halvorsen and Clemente Izurieta and Haipeng Cai
                 and Assefaw Gebremedhin",
  title =        "Applying Generative Machine Learning to Intrusion
                 Detection: a Systematic Mapping Study and Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "257:1--257:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659575",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659575",
  abstract =     "Intrusion Detection Systems (IDSs) are an essential
                 element of modern cyber defense, alerting users to when
                 and where cyber-attacks occur. Machine learning can
                 enable IDSs to further distinguish between benign and
                 malicious behaviors, but it comes with \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "257",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jiang:2024:BFL,
  author =       "Yanna Jiang and Baihe Ma and Xu Wang and Guangsheng Yu
                 and Ping Yu and Zhe Wang and Wei Ni and Ren Ping Liu",
  title =        "Blockchained Federated Learning for {Internet of
                 Things}: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "258:1--258:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659099",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659099",
  abstract =     "The demand for intelligent industries and smart
                 services based on big data is rising rapidly with the
                 increasing digitization and intelligence of the modern
                 world. This survey comprehensively reviews Blockchained
                 Federated Learning (BlockFL) that joins \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "258",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tsoukas:2024:RET,
  author =       "Vasileios Tsoukas and Anargyros Gkogkidis and Eleni
                 Boumpa and Athanasios Kakarountas",
  title =        "A Review on the emerging technology of {TinyML}",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "259:1--259:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3661820",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3661820",
  abstract =     "Tiny Machine Learning (TinyML) is an emerging
                 technology proposed by the scientific community for
                 developing autonomous and secure devices that can
                 gather, process, and provide results without
                 transferring data to external entities. The technology
                 aims to \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "259",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{AlMarshoud:2024:SPD,
  author =       "Mishri AlMarshoud and Mehmet Sabir Kiraz and Ali H.
                 Al-Bayatti",
  title =        "Security, Privacy, and Decentralized Trust Management
                 in {VANETs}: a Review of Current Research and Future
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "260:1--260:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3656166",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3656166",
  abstract =     "Vehicular Ad Hoc Networks (VANETs) are powerful
                 platforms for vehicular data services and applications.
                 The increasing number of vehicles has made the
                 vehicular network diverse, dynamic, and large-scale,
                 making it difficult to meet the 5G network's \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "260",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Huang:2024:DAR,
  author =       "Jiani Huang and Haihua Chen and Fengchang Yu and Wei
                 Lu",
  title =        "From Detection to Application: Recent Advances in
                 Understanding Scientific Tables and Figures",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "261:1--261:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3657285",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3657285",
  abstract =     "Tables and figures are usually used to present
                 information in a structured and visual way in
                 scientific documents. Understanding the tables and
                 figures in scientific documents is significant for a
                 series of downstream tasks, such as academic search,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "261",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wu:2024:TAF,
  author =       "Jiajun Wu and Fan Dong and Henry Leung and Zhuangdi
                 Zhu and Jiayu Zhou and Steve Drew",
  title =        "Topology-aware Federated Learning in Edge Computing: a
                 Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "262:1--262:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659205",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659205",
  abstract =     "The ultra-low latency requirements of 5G/6G
                 applications and privacy constraints call for
                 distributed machine learning systems to be deployed at
                 the edge. With its simple yet effective approach,
                 federated learning (FL) is a natural solution for
                 massive \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "262",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chehreghani:2024:RID,
  author =       "Mostafa Haghir Chehreghani",
  title =        "A Review on the Impact of Data Representation on Model
                 Explainability",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "263:1--263:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3662178",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3662178",
  abstract =     "In recent years, advanced machine learning and
                 artificial intelligence techniques have gained
                 popularity due to their ability to solve problems
                 across various domains with high performance and
                 quality. However, these techniques are often so complex
                 that \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "263",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liang:2024:FTM,
  author =       "Paul Pu Liang and Amir Zadeh and Louis-Philippe
                 Morency",
  title =        "Foundations \& Trends in Multimodal Machine Learning:
                 Principles, Challenges, and Open Questions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "264:1--264:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3656580",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3656580",
  abstract =     "Multimodal machine learning is a vibrant
                 multi-disciplinary research field that aims to design
                 computer agents with intelligent capabilities such as
                 understanding, reasoning, and learning through
                 integrating multiple communicative modalities,
                 including \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "264",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sharma:2024:SGN,
  author =       "Kartik Sharma and Yeon-Chang Lee and Sivagami Nambi
                 and Aditya Salian and Shlok Shah and Sang-Wook Kim and
                 Srijan Kumar",
  title =        "A Survey of Graph Neural Networks for Social
                 Recommender Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "265:1--265:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3661821",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3661821",
  abstract =     "Social recommender systems (SocialRS) simultaneously
                 leverage the user-to-item interactions as well as the
                 user-to-user social relations for the task of
                 generating item recommendations to users. Additionally
                 exploiting social relations is clearly \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "265",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sandeepa:2024:SPP,
  author =       "Chamara Sandeepa and Bartlomiej Siniarski and Nicolas
                 Kourtellis and Shen Wang and Madhusanka Liyanage",
  title =        "A Survey on Privacy of Personal and Non-Personal Data
                 in {B5G\slash 6G} Networks",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "266:1--266:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3662179",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3662179",
  abstract =     "The upcoming Beyond 5G (B5G) and 6G networks are
                 expected to provide enhanced capabilities such as
                 ultra-high data rates, dense connectivity, and high
                 scalability. It opens many possibilities for a new
                 generation of services driven by Artificial \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "266",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2024:LDL,
  author =       "Hou-I Liu and Marco Galindo and Hongxia Xie and
                 Lai-Kuan Wong and Hong-Han Shuai and Yung-Hui Li and
                 Wen-Huang Cheng",
  title =        "Lightweight Deep Learning for Resource-Constrained
                 Environments: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "267:1--267:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3657282",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3657282",
  abstract =     "Over the past decade, the dominance of deep learning
                 has prevailed across various domains of artificial
                 intelligence, including natural language processing,
                 computer vision, and biomedical signal processing.
                 While there have been remarkable improvements
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "267",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liang:2024:SVA,
  author =       "Shangsong Liang and Zhou Pan and wei liu and Jian Yin
                 and Maarten de Rijke",
  title =        "A Survey on Variational Autoencoders in Recommender
                 Systems",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "10",
  pages =        "268:1--268:??",
  month =        oct,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3663364",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Jun 26 10:40:59 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3663364",
  abstract =     "Recommender systems have become an important
                 instrument to connect people to information. Sparse,
                 complex, and rapidly growing data presents new
                 challenges to traditional recommendation algorithms. To
                 overcome these challenges, various deep learning-based
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "268",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pasuksmit:2024:SLR,
  author =       "Jirat Pasuksmit and Patanamon Thongtanunam and Shanika
                 Karunasekera",
  title =        "A Systematic Literature Review on Reasons and
                 Approaches for Accurate Effort Estimations in Agile",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "269:1--269:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3663365",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3663365",
  abstract =     "Background: Accurate effort estimation is crucial for
                 planning in Agile iterative development. Agile
                 estimation generally relies  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "269",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Heuillet:2024:EAN,
  author =       "Alexandre Heuillet and Ahmad Nasser and Hichem Arioui
                 and Hedi Tabia",
  title =        "Efficient Automation of Neural Network Design: a
                 Survey on Differentiable Neural Architecture Search",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "270:1--270:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3665138",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3665138",
  abstract =     "In the past few years, Differentiable Neural
                 Architecture Search (DNAS) rapidly imposed itself as
                 the trending approach to automate the  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "270",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Paproki:2024:SDD,
  author =       "Anthony Paproki and Olivier Salvado and Clinton
                 Fookes",
  title =        "Synthetic Data for Deep Learning in Computer Vision \&
                 Medical Imaging: a Means to Reduce Data Bias",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "271:1--271:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3663759",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3663759",
  abstract =     "Deep-learning (DL) performs well in computer-vision
                 and medical-imaging automated decision-making
                 applications. A bottleneck  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "271",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nunez-Molina:2024:RSS,
  author =       "Carlos N{\'u}{\~n}ez-Molina and Pablo Mesejo and Juan
                 Fern{\'a}ndez-Olivares",
  title =        "A Review of Symbolic, Subsymbolic and Hybrid Methods
                 for Sequential Decision Making",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "272:1--272:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3663366",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3663366",
  abstract =     "In the field of Sequential Decision Making (SDM), two
                 paradigms have historically vied for supremacy:
                 Automated Planning (AP)  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "272",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liang:2024:SMM,
  author =       "Wanying Liang and Pasquale {De Meo} and Yong Tang and
                 Jia Zhu",
  title =        "A Survey of Multi-modal Knowledge Graphs: Technologies
                 and Trends",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "273:1--273:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3656579",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3656579",
  abstract =     "In recent years, Knowledge Graphs (KGs) have played a
                 crucial role in the development of advanced
                 knowledge-intensive  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "273",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Selwon:2024:REF,
  author =       "Karolina Selwon and Julian Szyma{\'n}ski",
  title =        "A Review of Explainable Fashion Compatibility Modeling
                 Methods",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "274:1--274:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3664614",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3664614",
  abstract =     "The paper reviews methods used in the fashion
                 compatibility recommendation domain. We select methods
                 based on  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "274",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Venkatesha:2024:SRB,
  author =       "Shashikiran Venkatesha and Ranjani Parthasarathi",
  title =        "Survey on Redundancy Based-Fault tolerance methods for
                 Processors and Hardware accelerators --- Trends in
                 Quantum Computing, Heterogeneous Systems and
                 Reliability",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "275:1--275:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3663672",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3663672",
  abstract =     "Rapid progress in CMOS technology since the late 1990s
                 has increased the vulnerability of processors toward
                 faults. Subsequently, the  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "275",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tewell:2024:ROD,
  author =       "Jordan Tewell and Nimesha Ranasinghe",
  title =        "A Review of Olfactory Display Designs for Virtual
                 Reality Environments",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "276:1--276:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3665243",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3665243",
  abstract =     "The field of Virtual Reality continues to evolve to
                 provide an ever-greater sense of immersion to the user.
                 However, VR experiences  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "276",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mozaffari:2024:STD,
  author =       "Maryam Mozaffari and Anton Dign{\"o}s and Johann
                 Gamper and Uta St{\"o}rl",
  title =        "Self-tuning Database Systems: a Systematic Literature
                 Review of Automatic Database Schema Design and Tuning",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "277:1--277:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3665323",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3665323",
  abstract =     "Self-tuning is a feature of autonomic databases that
                 includes the problem of automatic schema design. It
                 aims at providing an optimized  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "277",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bilot:2024:SMD,
  author =       "Tristan Bilot and Nour {El Madhoun} and Khaldoun {Al
                 Agha} and Anis Zouaoui",
  title =        "A Survey on Malware Detection with Graph
                 Representation Learning",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "278:1--278:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3664649",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3664649",
  abstract =     "Malware detection has become a major concern due to
                 the increasing number and complexity of malware.
                 Traditional detection  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "278",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jia:2024:HIG,
  author =       "Zhen Jia and Zhang Zhang and Liang Wang and Tieniu
                 Tan",
  title =        "Human Image Generation: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "279:1--279:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3665869",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3665869",
  abstract =     "Image and video synthesis has become a blooming topic
                 in computer vision and machine learning communities
                 along with  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "279",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gupta:2024:FPS,
  author =       "Ankur Gupta and Sahil Sawhney and Kashyap Kompella",
  title =        "The First Principles: Setting the Context for a Safe
                 and Secure Metaverse",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "280:1--280:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3665495",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3665495",
  abstract =     "The metaverse delivered through converged and
                 amalgamated technologies holds promise. No wonder
                 technology  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "280",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mo:2024:MLC,
  author =       "Fan Mo and Zahra Tarkhani and Hamed Haddadi",
  title =        "Machine Learning with Confidential Computing: a
                 Systematization of Knowledge",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "281:1--281:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3670007",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3670007",
  abstract =     "Privacy and security challenges in Machine Learning
                 (ML) have become increasingly severe, along with ML's
                 pervasive development and  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "281",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Periti:2024:LSC,
  author =       "Francesco Periti and Stefano Montanelli",
  title =        "Lexical Semantic Change through Large Language Models:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "282:1--282:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3672393",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3672393",
  abstract =     "Lexical Semantic Change (LSC) is the task of
                 identifying, interpreting, and assessing the possible
                 change over time in the meanings of a  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "282",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Franceschelli:2024:CML,
  author =       "Giorgio Franceschelli and Mirco Musolesi",
  title =        "Creativity and Machine Learning: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "283:1--283:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3664595",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3664595",
  abstract =     "There is a growing interest in the area of machine
                 learning and creativity. This survey presents an
                 overview of the history and the state of  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "283",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Biswas:2024:YFS,
  author =       "Nilotpal Biswas and Anamitra Mukherjee and Samit
                 Bhattacharya",
  title =        "``{Are} you feeling sick?'' --- a systematic
                 literature review of cybersickness in virtual reality",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "284:1--284:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3670008",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3670008",
  abstract =     "Cybersickness (CS), also known as visually induced
                 motion sickness (VIMS), is a condition that can affect
                 individuals when they  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "284",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{COMPSURV-257000017,
  author =       "Lu{\'\i}s Manuel Meruje Ferreira and Fabio Coelho and
                 Jos{\'e} Pereira",
  title =        "Databases in Edge and Fog Environments: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "285:1--285:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3666001",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3666001",
  abstract =     "While a significant number of databases are deployed
                 in cloud environments, pushing part or all data storage
                 and querying  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "285",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zolfaghari:2024:SUD,
  author =       "Behrouz Zolfaghari and Mostafa Abbasmollaei and
                 Fahimeh Hajizadeh and Naoto Yanai and Khodakhast
                 Bibak",
  title =        "Secure {UAV} (Drone) and the Great Promise of {AI}",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "286:1--286:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3673225",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3673225",
  abstract =     "UAVs have found their applications in numerous
                 applications from recreational activities to business
                 in addition to military and  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "286",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dash:2024:ABA,
  author =       "Adyasha Dash and Kathleen Agres",
  title =        "{AI}-Based Affective Music Generation Systems: a
                 Review of Methods and Challenges",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "287:1--287:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3672554",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3672554",
  abstract =     "Music is a powerful medium for altering the emotional
                 state of the listener. In recent years, with
                 significant advancements in  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "287",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2024:RPE,
  author =       "Yiming Wang and Bin Zhang and Lamei Di",
  title =        "Research Progress of {EEG}-Based Emotion Recognition:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "288:1--288:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3666002",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3666002",
  abstract =     "Emotion recognition based on electroencephalography
                 (EEG) signals has emerged as a prominent research
                 field, facilitating objective  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "288",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Woodgate:2024:MEP,
  author =       "Jessica Woodgate and Nirav Ajmeri",
  title =        "Macro Ethics Principles for Responsible {AI} Systems:
                 Taxonomy and Directions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "289:1--289:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3672394",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3672394",
  abstract =     "Responsible AI must be able to make or support
                 decisions that consider human values and can be
                 justified by human morals.  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "289",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sharma:2024:ICE,
  author =       "Debendra Das Sharma and Robert Blankenship and Daniel
                 Berger",
  title =        "An Introduction to the {Compute Express Link (CXL)}
                 Interconnect",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "290:1--290:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3669900",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3669900",
  abstract =     "The Compute Express Link (CXL) is an open
                 industry-standard interconnect between processors and
                 devices such as accelerators, memory  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "290",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ribeiro:2024:OCL,
  author =       "Fabio {De Sousa Ribeiro} and Kevin Duarte and Miles
                 Everett and Georgios Leontidis and Mubarak Shah",
  title =        "Object-centric Learning with Capsule Networks: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "291:1--291:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3674500",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3674500",
  abstract =     "Capsule networks emerged as a promising alternative to
                 convolutional neural networks for learning
                 object-centric  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "291",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Hartwig:2024:LUC,
  author =       "Katrin Hartwig and Frederic Doell and Christian
                 Reuter",
  title =        "The Landscape of User-centered Misinformation
                 Interventions --- a Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "292:1--292:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3674724",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3674724",
  abstract =     "Misinformation is one of the key challenges facing
                 society today. User-centered misinformation
                 interventions as digital  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "292",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhao:2024:CSR,
  author =       "Xiaoyan Zhao and Yang Deng and Min Yang and Lingzhi
                 Wang and Rui Zhang and Hong Cheng and Wai Lam and Ying
                 Shen and Ruifeng Xu",
  title =        "A Comprehensive Survey on Relation Extraction: Recent
                 Advances and New Frontiers",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "11",
  pages =        "293:1--293:??",
  month =        nov,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3674501",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:33 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3674501",
  abstract =     "Relation extraction (RE) involves identifying the
                 relations between entities from underlying content. RE
                 serves as the foundation  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "293",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gharoun:2024:MLA,
  author =       "Hassan Gharoun and Fereshteh Momenifar and Fang Chen
                 and Amir Gandomi",
  title =        "Meta-learning Approaches for Few-Shot Learning: a
                 Survey of Recent Advances",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "294:1--294:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659943",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659943",
  abstract =     "Despite its astounding success in learning deeper
                 multi-dimensional data, the performance of deep
                 learning declines on new  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "294",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2024:MTL,
  author =       "Shijie Chen and Yu Zhang and Qiang Yang",
  title =        "Multi-Task Learning in Natural Language Processing: an
                 Overview",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "295:1--295:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3663363",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3663363",
  abstract =     "Deep learning approaches have achieved great success
                 in the field of Natural Language Processing (NLP).
                 However, directly training  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "295",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Leng:2024:RAA,
  author =       "Jiaxu Leng and Yongming Ye and Mengjingcheng Mo and
                 Chenqiang Gao and Ji Gan and Bin Xiao and Xinbo Gao",
  title =        "Recent Advances for Aerial Object Detection: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "296:1--296:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3664598",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3664598",
  abstract =     "Aerial object detection, as object detection in aerial
                 images captured from an overhead perspective, has been
                 widely applied in  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "296",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yu:2024:VT,
  author =       "Bruce X. B. Yu and Jianlong Chang and Haixin Wang and
                 Lingbo Liu and Shijie Wang and Zhiyu Wang and Junfan
                 Lin and Lingxi Xie and Haojie Li and Zhouchen Lin and
                 Qi Tian and Chang Wen Chen",
  title =        "Visual Tuning",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "297:1--297:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3657632",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3657632",
  abstract =     "Fine-tuning visual models has been widely shown
                 promising performance on many downstream visual tasks.
                 With the surprising  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "297",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liang:2024:ITS,
  author =       "Wei Liang and Yaqin Liu and Ce Yang and Songyou Xie
                 and Kuanching Li and Willy Susilo",
  title =        "On Identity, Transaction, and Smart Contract Privacy
                 on Permissioned and Permissionless Blockchain: a
                 Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "298:1--298:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3676164",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3676164",
  abstract =     "Blockchain is a decentralized distributed ledger that
                 combines multiple technologies, including chain data
                 structures, P2P  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "298",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Abideen:2024:OFI,
  author =       "Zain {Ul Abideen} and Sumathi Gokulanathan and Muayad
                 J. Aljafar and Samuel Pagliarini",
  title =        "An Overview of {FPGA}-inspired Obfuscation
                 Techniques",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "299:1--299:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3677118",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3677118",
  abstract =     "Building and maintaining a silicon foundry is a costly
                 endeavor that requires substantial financial
                 investment. From this  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "299",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kruger:2024:MSS,
  author =       "Jacob Kr{\"u}ger and Yi Li and Kirill Lossev and
                 Chenguang Zhu and Marsha Chechik and Thorsten Berger
                 and Julia Rubin",
  title =        "A Meta-Study of Software-Change Intentions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "300:1--300:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3661484",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3661484",
  abstract =     "Every software system undergoes changes, for example,
                 to add new features, fix bugs, or refactor code. The
                 importance of  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "300",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Seaborn:2024:QAV,
  author =       "Katie Seaborn and Jaqueline Urakami and Peter
                 Pennefather and Norihisa Miyake",
  title =        "Qualitative Approaches to Voice {UX}",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "301:1--301:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3658666",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3658666",
  abstract =     "Voice is a natural mode of expression offered by
                 modern computer-based systems. Qualitative perspectives
                 on voice-based user  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "301",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{deSouzaBatista:2024:SRI,
  author =       "Agnaldo {de Souza Batista} and Aldri Luiz {Dos
                 Santos}",
  title =        "A Survey on Resilience in Information Sharing on
                 Networks: Taxonomy and Applied Techniques",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "302:1--302:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659944",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659944",
  abstract =     "Information sharing is vital in any communication
                 network environment to enable network operating
                 services take decisions based on the  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "302",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nkrow:2024:NIM,
  author =       "Raphael Elikplim Nkrow and Bruno Silva and Dutliff
                 Boshoff and Gerhard Hancke and Mikael Gidlund and Adnan
                 Abu-Mahfouz",
  title =        "{NLOS} Identification and Mitigation for Time-based
                 Indoor Localization Systems: Survey and Future Research
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "303:1--303:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3663473",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3663473",
  abstract =     "One hurdle to accurate indoor localization using
                 time-based networks is the presence of
                 Non-Line-Of-Sight (NLOS) and  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "303",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yu:2024:NLR,
  author =       "Fei Yu and Hongbo Zhang and Prayag Tiwari and Benyou
                 Wang",
  title =        "Natural Language Reasoning, A Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "304:1--304:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3664194",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3664194",
  abstract =     "This survey article proposes a clearer view of Natural
                 Language Reasoning (NLR) in the field of Natural
                 Language Processing (NLP),  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "304",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kasem:2024:DLT,
  author =       "Mahmoud Salaheldin Kasem and Abdelrahman Abdallah and
                 Alexander Berendeyev and Ebrahem Elkady and Mohamed
                 Mahmoud and Mahmoud Abdalla and Mohamed Hamada and
                 Sebastiano Vascon and Daniyar Nurseitov and Islam
                 Taj-Eddin",
  title =        "Deep Learning for Table Detection and Structure
                 Recognition: a Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "305:1--305:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3657281",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3657281",
  abstract =     "Tables are everywhere, from scientific journals,
                 articles, websites, and newspapers all the way to items
                 we buy at the supermarket.  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "305",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ji:2024:URD,
  author =       "Shaoxiong Ji and Xiaobo Li and Wei Sun and Hang Dong
                 and Ara Taalas and Yijia Zhang and Honghan Wu and Esa
                 Pitk{\"a}nen and Pekka Marttinen",
  title =        "A Unified Review of Deep Learning for Automated
                 Medical Coding",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "306:1--306:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3664615",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3664615",
  abstract =     "Automated medical coding, an essential task for
                 healthcare operation and delivery, makes unstructured
                 data  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "306",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2024:MSS,
  author =       "Huandong Wang and Huan Yan and Can Rong and Yuan Yuan
                 and Fenyu Jiang and Zhenyu Han and Hongjie Sui and
                 Depeng Jin and Yong Li",
  title =        "Multi-scale Simulation of Complex Systems: a
                 Perspective of Integrating Knowledge and Data",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "307:1--307:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3654662",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3654662",
  abstract =     "Complex system simulation has been playing an
                 irreplaceable role in understanding, predicting, and
                 controlling diverse complex  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "307",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ravi:2024:MZE,
  author =       "Nirupama Ravi and C. Mani Krishna and Israel Koren",
  title =        "Mix-Zones as an Effective Privacy Enhancing Technique
                 in Mobile and Vehicular Ad-hoc Networks",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "308:1--308:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3659576",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3659576",
  abstract =     "Intelligent Transportation Systems (ITS) promise
                 significant increases in throughput and reductions in
                 trip delay. ITS makes extensive  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "308",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wan:2024:DLC,
  author =       "Yao Wan and Zhangqian Bi and Yang He and Jianguo Zhang
                 and Hongyu Zhang and Yulei Sui and Guandong Xu and Hai
                 Jin and Philip Yu",
  title =        "Deep Learning for Code Intelligence: Survey, Benchmark
                 and Toolkit",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "309:1--309:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3664597",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3664597",
  abstract =     "Code intelligence leverages machine learning
                 techniques to extract knowledge from extensive code
                 corpora, with the aim of  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "309",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Melzi:2024:OPE,
  author =       "Pietro Melzi and Christian Rathgeb and Ruben Tolosana
                 and Ruben Vera-Rodriguez and Christoph Busch",
  title =        "An Overview of Privacy-Enhancing Technologies in
                 Biometric Recognition",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "310:1--310:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3664596",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3664596",
  abstract =     "Privacy-enhancing technologies are technologies that
                 implement fundamental data protection principles. With
                 respect to  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "310",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhao:2024:SHI,
  author =       "Lianying Zhao and He Shuang and Shengjie Xu and Wei
                 Huang and Rongzhen Cui and Pushkar Bettadpur and David
                 Lie",
  title =        "A Survey of Hardware Improvements to Secure Program
                 Execution",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "311:1--311:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3672392",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3672392",
  abstract =     "Hardware has been constantly augmented for security
                 considerations since the advent of computers. There is
                 also a  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "311",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Verma:2024:CEA,
  author =       "Sahil Verma and Varich Boonsanong and Minh Hoang and
                 Keegan Hines and John Dickerson and Chirag Shah",
  title =        "Counterfactual Explanations and Algorithmic Recourses
                 for Machine Learning: a Review",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "312:1--312:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3677119",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3677119",
  abstract =     "Machine learning plays a role in many deployed
                 decision systems, often in ways that are difficult or
                 impossible to understand by human  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "312",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Silva:2024:CSB,
  author =       "Miguel G. Silva and Sara C. Madeira and Rui
                 Henriques",
  title =        "A Comprehensive Survey on Biclustering-based
                 Collaborative Filtering",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "313:1--313:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3674723",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3674723",
  abstract =     "Collaborative Filtering (CF) is achieving a plateau of
                 high popularity. Still, recommendation success is
                 challenged by the  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "313",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Saqib:2024:CAE,
  author =       "Mohd Saqib and Samaneh Mahdavifar and Benjamin C. M.
                 Fung and Philippe Charland",
  title =        "A Comprehensive Analysis of Explainable {AI} for
                 Malware Hunting",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "314:1--314:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3677374",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3677374",
  abstract =     "In the past decade, the number of malware variants has
                 increased rapidly. Many researchers have proposed to
                 detect malware  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "314",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rajapaksha:2024:DLB,
  author =       "Uchitha Rajapaksha and Ferdous Sohel and Hamid Laga
                 and Dean Diepeveen and Mohammed Bennamoun",
  title =        "Deep Learning-based Depth Estimation Methods from
                 Monocular Image and Videos: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "315:1--315:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3677327",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3677327",
  abstract =     "Estimating depth from single RGB images and videos is
                 of widespread interest due to its applications in many
                 areas, including  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "315",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2024:SFH,
  author =       "Junxue Zhang and Xiaodian Cheng and Liu Yang and
                 Jinbin Hu and Ximeng Liu and Kai Chen",
  title =        "{SoK}: Fully Homomorphic Encryption Accelerators",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "316:1--316:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3676955",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3676955",
  abstract =     "Fully Homomorphic Encryption (FHE) is a key technology
                 enabling privacy-preserving computing. However, the
                 fundamental challenge of  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "316",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xu:2024:VUD,
  author =       "Yuecong Xu and Haozhi Cao and Lihua Xie and Xiao-li Li
                 and Zhenghua Chen and Jianfei Yang",
  title =        "Video Unsupervised Domain Adaptation with Deep
                 Learning: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "317:1--317:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3679010",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3679010",
  abstract =     "Video analysis tasks such as action recognition have
                 received increasing research interest with growing
                 applications in fields such  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "317",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mandler:2024:RBF,
  author =       "Hannes Mandler and Bernhard Weigand",
  title =        "A review and benchmark of feature importance methods
                 for neural networks",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "318:1--318:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3679012",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3679012",
  abstract =     "Feature attribution methods (AMs) are a simple means
                 to provide explanations for the predictions of
                 black-box models such as  \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "318",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2024:WFL,
  author =       "Jingxue Chen and Hang Yan and Zhiyuan Liu and Min
                 Zhang and Hu Xiong and Shui Yu",
  title =        "When Federated Learning Meets Privacy-Preserving
                 Computation",
  journal =      j-COMP-SURV,
  volume =       "56",
  number =       "12",
  pages =        "319:1--319:??",
  month =        dec,
  year =         "2024",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3679013",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Oct 10 05:54:34 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3679013",
  abstract =     "Nowadays, with the development of artificial
                 intelligence (AI), privacy issues attract wide
                 attention from society and individuals. It is
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "319",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mazaheri:2025:SSP,
  author =       "Hakimeh Mazaheri and Salman Goli and Ali Nourollah",
  title =        "A survey of {$3$D} Space Path-Planning Methods and
                 Algorithms",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "1:1--1:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3673896",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3673896",
  abstract =     "Due to their agility, cost-effectiveness, and high
                 maneuverability, Unmanned Aerial Vehicles (UAVs) have
                 attracted considerable attention from researchers and
                 investors alike. Path planning is one of the practical
                 subsets of motion planning for UAVs. It \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "1",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2025:SFU,
  author =       "Ziyao Liu and Yu Jiang and Jiyuan Shen and Minyi Peng
                 and Kwok-Yan Lam and Xingliang Yuan and Xiaoning Liu",
  title =        "A Survey on Federated Unlearning: Challenges, Methods,
                 and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "2:1--2:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3679014",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3679014",
  abstract =     "In recent years, the notion of ``the right to be
                 forgotten'' (RTBF) has become a crucial aspect of data
                 privacy for digital trust and AI safety, requiring the
                 provision of mechanisms that support the removal of
                 personal data of individuals upon their \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "2",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Nguyen:2025:MRS,
  author =       "Thanh Toan Nguyen and Nguyen {Quoc Viet hung} and
                 Thanh Tam Nguyen and Thanh Trung Huynh and Thanh Thi
                 Nguyen and Matthias Weidlich and Hongzhi Yin",
  title =        "Manipulating Recommender Systems: a Survey of
                 Poisoning Attacks and Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "3:1--3:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3677328",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3677328",
  abstract =     "Recommender systems have become an integral part of
                 online services due to their ability to help users
                 locate specific information in a sea of data. However,
                 existing studies show that some recommender systems are
                 vulnerable to poisoning attacks, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "3",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rong:2025:ISO,
  author =       "Can Rong and Jingtao Ding and Yong Li",
  title =        "An Interdisciplinary Survey on Origin-destination
                 Flows Modeling: Theory and Techniques",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "4:1--4:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3682058",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3682058",
  abstract =     "Origin-destination (OD) flow modeling is an
                 extensively researched subject across multiple
                 disciplines, such as the investigation of travel demand
                 in transportation and spatial interaction modeling in
                 geography. However, researchers from different fields
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "4",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ashraf:2025:ETT,
  author =       "Imran Ashraf and Yousaf {Bin Zikria} and Sahil Garg
                 and Soojung Hur and Yongwan Park and Mohsen Guizani",
  title =        "Enabling Technologies and Techniques for Floor
                 Identification",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "5:1--5:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3678878",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3678878",
  abstract =     "Location information has initiated a multitude of
                 applications such as location-based services, health
                 care, emergency response and rescue operations, and
                 assets tracking. A plethora of techniques and
                 technologies have been presented to ensure enhanced
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "5",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Amarasinghe:2025:DFS,
  author =       "Chamath Amarasinghe and Nimesha Ranasinghe",
  title =        "Digital Food Sensing and Ingredient Analysis
                 Techniques to Facilitate Human-Food Interface Designs",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "6:1--6:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3685675",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3685675",
  abstract =     "Interactive technologies that shape the traditional
                 human-food experiences are being explored under the
                 emerging field of Human-Food Interaction (HFI). A key
                 challenge in developing HFI technologies is the digital
                 sensing of food, beverages, and their \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "6",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Khraisat:2025:SFL,
  author =       "Ansam Khraisat and Ammar Alazab and Sarabjot Singh and
                 Tony Jan and Alfredo Jr. Gomez",
  title =        "Survey on Federated Learning for Intrusion Detection
                 System: Concept, Architectures, Aggregation Strategies,
                 Challenges, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "7:1--7:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3687124",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3687124",
  abstract =     "Intrusion Detection Systems (IDS) are essential for
                 securing computer networks by identifying and
                 mitigating potential threats. However, traditional IDS
                 face challenges related to scalability, privacy, and
                 computational demands as network data complexity
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "7",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhao:2025:CSE,
  author =       "Yao Zhao and Youyang Qu and Yong Xiang and Md Palash
                 Uddin and Dezhong Peng and Longxiang Gao",
  title =        "A Comprehensive Survey on Edge Data Integrity
                 Verification: Fundamentals and Future Trends",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "8:1--8:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3680277",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3680277",
  abstract =     "Recent advances in edge computing (EC) have pushed
                 cloud-based data caching services to edge; however,
                 such emerging edge storage comes with numerous
                 challenging and unique security issues. One of them is
                 the problem of edge data integrity verification
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "8",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{T:2025:HIV,
  author =       "Gayathri T. and Mamatha HR",
  title =        "How to Improve Video Analytics with Action
                 Recognition: a Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "9:1--9:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3679011",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3679011",
  abstract =     "Action recognition refers to the process of
                 categorizing a video by identifying and classifying the
                 specific actions it encompasses. Videos originate from
                 several domains, and within each domain of video
                 analysis, comprehending actions holds paramount
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cao:2025:CMR,
  author =       "Longbing Cao and Qing Liu",
  title =        "{COVID-19} Modeling: a Review",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "10:1--10:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3686150",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3686150",
  abstract =     "The SARS-CoV-2 viruses and their triggered COVID-19
                 pandemic have fundamentally reshaped the world in
                 almost every aspect, their evolution and influences
                 remain. While over a million of literature have been
                 produced on these unprecedented, overwhelming
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "10",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Goedegebuure:2025:DMS,
  author =       "Abel Goedegebuure and Indika Kumara and Stefan
                 Driessen and Willem-Jan {Van Den Heuvel} and Geert
                 Monsieur and Damian Andrew Tamburri and Dario {Di
                 Nucci}",
  title =        "Data Mesh: a Systematic Gray Literature Review",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "11:1--11:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3687301",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3687301",
  abstract =     "Data mesh is an emerging domain-driven decentralized
                 data architecture that aims to minimize or avoid
                 operational bottlenecks associated with centralized,
                 monolithic data architectures in enterprises. The topic
                 has piqued the practitioners' interest, and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "11",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Al-Sada:2025:MAS,
  author =       "Bader Al-Sada and Alireza Sadighian and Gabriele
                 Oligeri",
  title =        "{MITRE ATT\&CK}: State of the Art and Way Forward",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "12:1--12:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3687300",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3687300",
  abstract =     "MITRE ATT\&CK is a comprehensive framework of
                 adversary tactics, techniques, and procedures based on
                 real-world observations. It has been used as a
                 foundation for threat modeling in different sectors,
                 such as government, academia, and industry. To the best
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "12",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Razzaq:2025:SLR,
  author =       "Abdul Razzaq and Jim Buckley and Qin Lai and Tingting
                 Yu and Goetz Botterweck",
  title =        "A Systematic Literature Review on the Influence of
                 Enhanced Developer Experience on Developers'
                 Productivity: Factors, Practices, and Recommendations",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "13:1--13:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3687299",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3687299",
  abstract =     "Context and Motivation --- Developer eXperience
                 (Dev-X) is a recent research area that focuses on
                 developers perceptions, feelings, and values with
                 respect to software development and software quality.
                 Research suggests that factors and practices related to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "13",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kasmarik:2025:CAH,
  author =       "Kathryn Kasmarik and Mahtab Khani and Shadi Abpeikar
                 and Michael Barlow and Olivia Carter and Muireann
                 Irish",
  title =        "Competence Awareness for Humans and Machines: a Survey
                 and Future Research Directions from Psychology",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "14:1--14:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3689626",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3689626",
  abstract =     "Machine learning researchers are beginning to
                 understand the need for machines to be able to
                 self-assess their competence and express it in a human
                 understandable form. However, current machine learning
                 algorithms do not yet have the range or complexity
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Darban:2025:DLT,
  author =       "Zahra Zamanzadeh Darban and Geoffrey I. Webb and
                 Shirui Pan and Charu Aggarwal and Mahsa Salehi",
  title =        "Deep Learning for Time Series Anomaly Detection: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "15:1--15:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3691338",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3691338",
  abstract =     "Time series anomaly detection is important for a wide
                 range of research fields and applications, including
                 financial markets, economics, earth sciences,
                 manufacturing, and healthcare. The presence of
                 anomalies can indicate novel or unexpected events, such
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "15",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sharief:2025:MCI,
  author =       "Farhana Sharief and Humaira Ijaz and Mohammad Shojafar
                 and Muhammad Asif Naeem",
  title =        "Multi-Class Imbalanced Data Handling with Concept
                 Drift in Fog Computing: a Taxonomy, Review, and Future
                 Directions",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "16:1--16:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3689627",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3689627",
  abstract =     "A network of actual physical objects or ``IoT
                 components'' linked to the internet and equipped with
                 sensors, electronics, software, and network
                 connectivity is known as the Internet of Things (IoT).
                 This ability of the IoT components to gather and share
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "16",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Banerjee:2025:PIC,
  author =       "Chayan Banerjee and Kien Nguyen and Clinton Fookes and
                 Karniadakis George",
  title =        "Physics-Informed Computer Vision: a Review and
                 Perspectives",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "17:1--17:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3689037",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3689037",
  abstract =     "The incorporation of physical information in machine
                 learning frameworks is opening and transforming many
                 application domains. Here the learning process is
                 augmented through the induction of fundamental
                 knowledge and governing physical laws. In this work,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "17",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{McIntosh:2025:RRR,
  author =       "Timothy McIntosh and Teo Susnjak and Tong Liu and Dan
                 Xu and Paul Watters and Dongwei Liu and Yaqi Hao and
                 Alex Ng and Malka Halgamuge",
  title =        "Ransomware Reloaded: Re-examining Its Trend, Research
                 and Mitigation in the Era of Data Exfiltration",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "18:1--18:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3691340",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3691340",
  abstract =     "Ransomware has grown to be a dominant cybersecurity
                 threat by exfiltrating, encrypting, or destroying
                 valuable user data and causing numerous disruptions to
                 victims. The severity of the ransomware endemic has
                 generated research interest from both the \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pecher:2025:SSL,
  author =       "Branislav Pecher and Ivan Srba and Maria Bielikova",
  title =        "A Survey on Stability of Learning with Limited
                 Labelled Data and its Sensitivity to the Effects of
                 Randomness",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "19:1--19:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3691339",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3691339",
  abstract =     "Learning with limited labelled data, such as
                 prompting, in-context learning, fine-tuning,
                 meta-learning, or few-shot learning, aims to
                 effectively train a model using only a small amount of
                 labelled samples. However, these approaches have been
                 observed to \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "19",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Badjie:2025:AAC,
  author =       "Bakary Badjie and Jos{\'e} Cec{\'\i}lio and Antonio
                 Casimiro",
  title =        "Adversarial Attacks and Countermeasures on Image
                 Classification-based Deep Learning Models in Autonomous
                 Driving Systems: a Systematic Review",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "20:1--20:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3691625",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3691625",
  abstract =     "The rapid development of artificial intelligence (AI)
                 and breakthroughs in Internet of Things (IoT)
                 technologies have driven the innovation of advanced
                 autonomous driving systems (ADSs). Image classification
                 deep learning (DL) algorithms immensely \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "20",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fahmin:2025:EFR,
  author =       "Ahmed Fahmin and Muhammad Aamir Cheema and Mohammed
                 Eunus Ali and Adel Nadjaran Toosi and Hua Lu and Huan
                 Li and David Taniar and Hesham A. Rakha and Bojie
                 Shen",
  title =        "Eco-Friendly Route Planning Algorithms: Taxonomies,
                 Literature Review and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "21:1--21:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3691624",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3691624",
  abstract =     "Eco-friendly navigation (a.k.a. eco-routing) finds a
                 route from A to B in a road network that minimizes the
                 greenhouse gas (GHG) emission or fuel/energy
                 consumption of the traveling vehicle. As road transport
                 is a major contributor to GHG emissions, eco-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "21",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pais:2025:RUP,
  author =       "Daniela Pais and Susana Br{\'a}s and Raquel
                 Sebasti{\~a}o",
  title =        "A Review on the Use of Physiological Signals for
                 Assessing Postoperative Pain",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "22:1--22:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3685674",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3685674",
  abstract =     "The assessment of pain intensity after surgery is
                 important for guiding pain management. Due to the
                 limitations of current pain evaluation tools, there is
                 increasing interest in using objective methods to
                 assess pain in clinical settings. This literature
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lin:2025:VSP,
  author =       "Ruyan Lin and Yulong Fu and Wei Yi and Jincheng Yang
                 and Jin Cao and Zhiqiang Dong and Fei Xie and Hui Li",
  title =        "Vulnerabilities and Security Patches Detection in
                 {OSS}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "23:1--23:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3694782",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3694782",
  abstract =     "Over the past decade, Open Source Software (OSS) has
                 experienced rapid growth and widespread adoption,
                 attributed to its openness and editability. However,
                 this expansion has also brought significant security
                 challenges, particularly introducing and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "23",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Lanzieri:2025:RTA,
  author =       "Leandro Lanzieri and Gianluca Martino and Goerschwin
                 Fey and Holger Schlarb and Thomas C. Schmidt and
                 Matthias W{\"a}hlisch",
  title =        "A Review of Techniques for Ageing Detection and
                 Monitoring on Embedded Systems",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "24:1--24:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3695247",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3695247",
  abstract =     "Embedded digital devices are progressively deployed in
                 dependable or safety-critical systems. These devices
                 undergo significant hardware ageing, particularly in
                 harsh environments. This increases their likelihood of
                 failure. It is crucial to understand \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "24",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Pooshideh:2025:PAD,
  author =       "Matineh Pooshideh and Amin Beheshti and Yuankai Qi and
                 Helia Farhood and Mike Simpson and Nick Gatland and
                 Mehdi Soltany",
  title =        "Presentation Attack Detection: a Systematic Literature
                 Review",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "1",
  pages =        "25:1--25:??",
  month =        jan,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3687264",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:29 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3687264",
  abstract =     "Identity authentication is the process of verifying
                 one's identity. Many identity authentication methods
                 have been developed, from the conventional
                 username-password systems to the recent
                 electroencephalography-based authentication. Among
                 them, biometric \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "25",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2025:MRS,
  author =       "Qidong Liu and Jiaxi Hu and Yutian Xiao and Xiangyu
                 Zhao and Jingtong Gao and Wanyu Wang and Qing Li and
                 Jiliang Tang",
  title =        "Multimodal Recommender Systems: a Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "26:1--26:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3695461",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3695461",
  abstract =     "The recommender system (RS) has been an integral
                 toolkit of online services. They are equipped with
                 various deep learning techniques to model user
                 preference based on identifier and attribute
                 information. With the emergence of multimedia services,
                 such as \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "26",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Meng:2025:SDG,
  author =       "Lingkai Meng and Yu Shao and Long Yuan and Longbin Lai
                 and Peng Cheng and Xue Li and Wenyuan Yu and Wenjie
                 Zhang and Xuemin Lin and Jingren Zhou",
  title =        "A Survey of Distributed Graph Algorithms on Massive
                 Graphs",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "27:1--27:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3694966",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3694966",
  abstract =     "Distributed processing of large-scale graph data has
                 many practical applications and has been widely
                 studied. In recent years, a lot of distributed graph
                 processing frameworks and algorithms have been
                 proposed. While many efforts have been devoted to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "27",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yang:2025:SAP,
  author =       "Zhenyu Yang and Ge Zhang and Jia Wu and Jian Yang and
                 Quan Z. Sheng and Shan Xue and Chuan Zhou and Charu
                 Aggarwal and Hao Peng and Wenbin Hu and Edwin Hancock
                 and Pietro Li{\`o}",
  title =        "State of the Art and Potentialities of Graph-level
                 Learning",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "28:1--28:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3695863",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3695863",
  abstract =     "Graphs have a superior ability to represent relational
                 data, such as chemical compounds, proteins, and social
                 networks. Hence, graph-level learning, which takes a
                 set of graphs as input, has been applied to many tasks,
                 including comparison, regression, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "28",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2025:SDL,
  author =       "Anqi Wang and Jiahua Dong and Lik-Hang Lee and
                 Jiachuan Shen and Pan Hui",
  title =        "A Survey on Deep Learning for Design and Generation of
                 Virtual Architecture",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "29:1--29:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3688569",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3688569",
  abstract =     "Three-dimensional (3D) shape generation techniques
                 leveraging deep learning have garnered significant
                 interest from both computer vision and architectural
                 design communities, promising to enrich the content in
                 the virtual environment. However, research on
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "29",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2025:TSN,
  author =       "Tianyu Zhang and Gang Wang and Chuanyu Xue and Jiachen
                 Wang and Mark Nixon and Song Han",
  title =        "Time-Sensitive Networking {(TSN)} for Industrial
                 Automation: Current Advances and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "30:1--30:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3695248",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3695248",
  abstract =     "With the introduction of Cyber-Physical Systems (CPS)
                 and Internet of Things (IoT) technologies, the
                 automation industry is undergoing significant changes,
                 particularly in improving production efficiency and
                 reducing maintenance costs. Industrial \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "30",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{S:2025:POP,
  author =       "Sravan S. S. and Susmita Mandal and PJA Alphonse and
                 P. L. Ramesh",
  title =        "A Partial Offline Payment System for Connecting the
                 Unconnected Using {Internet of Things}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "31:1--31:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3687132",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3687132",
  abstract =     "The digital revolution in finance has bypassed many in
                 rural areas due to limited access to technology and
                 infrastructure. While real-time Internet banking is not
                 feasible, a new approach is needed to create a secure,
                 low-cost banking ecosystem for these \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "31",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wei:2025:SQA,
  author =       "Zhiyuan Wei and Jing Sun and Zijian Zhang and Xianhao
                 Zhang and Xiaoxuan Yang and Liehuang Zhu",
  title =        "Survey on Quality Assurance of Smart Contracts",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "32:1--32:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3695864",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3695864",
  abstract =     "As blockchain technology continues to advance, the
                 secure deployment of smart contracts has become
                 increasingly prevalent, underscoring the critical need
                 for robust security measures. This surge in usage has
                 led to a rise in security breaches, often \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "32",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kombrink:2025:ISA,
  author =       "Meike Helena Kombrink and Zeno Jean Marius Hubert
                 Geradts and Marcel Worring",
  title =        "Image Steganography Approaches and Their Detection
                 Strategies: a Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "33:1--33:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3694965",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3694965",
  abstract =     "Steganography is the art and science of hidden (or
                 covered) communication. In digital steganography, the
                 bits of image, video, audio and text files are tweaked
                 to represent the information to hide. This article
                 covers the current methods for hiding \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "33",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Patel:2025:SRG,
  author =       "Manali Patel and Krupa Jariwala and Chiranjoy
                 Chattopadhyay",
  title =        "A Systematic Review on Graph Neural Network-based
                 Methods for Stock Market Forecasting",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "34:1--34:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3696411",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3696411",
  abstract =     "Financial technology (FinTech) is a field that uses
                 artificial intelligence to automate financial services.
                 One area of FinTech is stock analysis, which aims to
                 predict future stock prices to develop investment
                 strategies that maximize profits. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "34",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2025:SPF,
  author =       "Xiaohan Zhang and Cen Zhang and Xinghua Li and
                 Zhengjie Du and Bing Mao and Yuekang Li and Yaowen
                 Zheng and Yeting Li and Li Pan and Yang Liu and Robert
                 Deng",
  title =        "A Survey of Protocol Fuzzing",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "35:1--35:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3696788",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3696788",
  abstract =     "Communication protocols form the bedrock of our
                 interconnected world, yet vulnerabilities within their
                 implementations pose significant security threats.
                 Recent developments have seen a surge in fuzzing-based
                 research dedicated to uncovering these \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "35",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Huang:2025:EPA,
  author =       "Kai Huang and Zhengzi Xu and Su Yang and Hongyu Sun
                 and Xuejun Li and Zheng Yan and Yuqing Zhang",
  title =        "Evolving Paradigms in Automated Program Repair:
                 Taxonomy, Challenges, and Opportunities",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "36:1--36:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3696450",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3696450",
  abstract =     "With the rapid development and large-scale popularity
                 of program software, modern society increasingly relies
                 on software systems. However, the problems exposed by
                 software have also come to the fore. The software bug
                 has become an important factor \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "36",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Cao:2025:SMB,
  author =       "Chengtai Cao and Fan Zhou and Yurou Dai and Jianping
                 Wang and Kunpeng Zhang",
  title =        "A Survey of Mix-based Data Augmentation: Taxonomy,
                 Methods, Applications, and Explainability",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "37:1--37:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3696206",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3696206",
  abstract =     "Data augmentation (DA) is indispensable in modern
                 machine learning and deep neural networks. The basic
                 idea of DA is to construct new training data to improve
                 the model's generalization by adding slightly disturbed
                 versions of existing data or \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "37",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kumar:2025:STP,
  author =       "Rahul Kumar and Manish Bhanu and Jo{\~a}o
                 Mendes-Moreira and Joydeep Chandra",
  title =        "Spatio-Temporal Predictive Modeling Techniques for
                 Different Domains: a Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "38:1--38:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3696661",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3696661",
  abstract =     "Spatio-temporal prediction tasks play a crucial role
                 in facilitating informed decision-making through
                 anticipatory insights. By accurately predicting future
                 outcomes, the ability to strategize, preemptively
                 address risks, and minimize their potential \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "38",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ge:2025:MLA,
  author =       "Xiuting Ge and Chunrong Fang and Xuanye Li and Weisong
                 Sun and Daoyuan Wu and Juan Zhai and Shang-Wei Lin and
                 Zhihong Zhao and Yang Liu and Zhenyu Chen",
  title =        "Machine Learning for Actionable Warning
                 Identification: a Comprehensive Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "39:1--39:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3696352",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3696352",
  abstract =     "Actionable Warning Identification (AWI) plays a
                 crucial role in improving the usability of static code
                 analyzers. With recent advances in Machine Learning
                 (ML), various approaches have been proposed to
                 incorporate ML techniques into AWI. These ML-based
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "39",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Li:2025:GSN,
  author =       "Zihao Li and Chao Yang and Yakun Chen and Xianzhi Wang
                 and Hongxu Chen and Guandong Xu and Lina Yao and
                 Michael Sheng",
  title =        "Graph and Sequential Neural Networks in Session-based
                 Recommendation: a Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "40:1--40:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3696413",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3696413",
  abstract =     "Recent years have witnessed the remarkable success of
                 recommendation systems (RSs) in alleviating the
                 information overload problem. As a new paradigm of RSs,
                 session-based recommendation (SR) specializes in users'
                 short-term preferences and aims at \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "40",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Xing:2025:SVD,
  author =       "Zhen Xing and Qijun Feng and Haoran Chen and Qi Dai
                 and Han Hu and Hang Xu and Zuxuan Wu and Yu-Gang
                 Jiang",
  title =        "A Survey on Video Diffusion Models",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "41:1--41:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3696415",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3696415",
  abstract =     "The recent wave of AI-generated content (AIGC) has
                 witnessed substantial success in computer vision, with
                 the diffusion model playing a crucial role in this
                 achievement. Due to their impressive generative
                 capabilities, diffusion models are gradually \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "41",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jalalvand:2025:APS,
  author =       "Fatemeh Jalalvand and Mohan Baruwal Chhetri and Surya
                 Nepal and Cecile Paris",
  title =        "Alert Prioritisation in Security Operations Centres: a
                 Systematic Survey on Criteria and Methods",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "42:1--42:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3695462",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3695462",
  abstract =     "Security Operations Centres (SOCs) are specialised
                 facilities where security analysts leverage advanced
                 technologies to monitor, detect and respond to cyber
                 incidents. However, the increasing volume of security
                 incidents has overwhelmed security analysts, \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "42",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Silva:2025:CRL,
  author =       "Francisco Silva and H{\'e}lder P. Oliveira and Tania
                 Pereira",
  title =        "Causal representation learning through higher-level
                 information extraction",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "43:1--43:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3696412",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3696412",
  abstract =     "The large gap between the generalization level of
                 state-of-the-art machine learning and human learning
                 systems calls for the development of artificial
                 intelligence (AI) models that are truly inspired by
                 human cognition. In tasks related to image analysis,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "43",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sobrinho:2025:COM,
  author =       "{\'A}lvaro Sobrinho and Matheus Vilarim and Amanda
                 Barbosa and Edmar Candeia Gurj{\~a}o and Danilo F. S.
                 Santos and Dalton Valadares and Leandro Dias da Silva",
  title =        "Challenges and Opportunities in Mobile Network
                 Security for Vertical Applications: a Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "44:1--44:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3696446",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3696446",
  abstract =     "Ensuring the security of vertical applications in
                 fifth-generation (5G) mobile communication systems and
                 previous generations is crucial. These systems must
                 prioritize maintaining the confidentiality, integrity,
                 and availability of services and data. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "44",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Javed:2025:SRP,
  author =       "Yousra Javed and Ayesha Sajid",
  title =        "A Systematic Review of Privacy Policy Literature",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "45:1--45:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3698393",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3698393",
  abstract =     "An organization's privacy policy states how it
                 collects, stores, processes, and shares its users'
                 personal information. The growing number of data
                 protection laws and regulations, as well as the
                 numerous sectors where the organizations are collecting
                 user \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "45",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2025:AFL,
  author =       "Huiming Chen and Huandong Wang and Qingyue Long and
                 Depeng Jin and Yong Li",
  title =        "Advancements in Federated Learning: Models, Methods,
                 and Privacy",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "46:1--46:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3664650",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3664650",
  abstract =     "Federated learning (FL) is a promising technique for
                 resolving the rising privacy and security concerns. Its
                 main ingredient is to cooperatively learn the model
                 among the distributed clients without uploading any
                 sensitive data. In this article, we \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2025:STW,
  author =       "Aiwei Liu and Leyi Pan and Yijian Lu and Jingjing Li
                 and Xuming Hu and Xi Zhang and Lijie Wen and Irwin King
                 and Hui Xiong and Philip Yu",
  title =        "A Survey of Text Watermarking in the Era of Large
                 Language Models",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "47:1--47:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3691626",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3691626",
  abstract =     "Text watermarking algorithms are crucial for
                 protecting the copyright of textual content.
                 Historically, their capabilities and application
                 scenarios were limited. However, recent advancements in
                 large language models (LLMs) have revolutionized these
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "47",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Battaglia:2025:CCS,
  author =       "Elena Battaglia and Federico Peiretti and Ruggero
                 Gaetano Pensa",
  title =        "Co-clustering: a Survey of the Main Methods, Recent
                 Trends, and Open Problems",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "48:1--48:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3698875",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3698875",
  abstract =     "Since its early formulations, co-clustering has gained
                 popularity and interest both within and outside the
                 machine learning community as a powerful learning
                 paradigm for clustering high-dimensional data with good
                 explainability properties. The \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "48",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Chen:2025:EAS,
  author =       "Tao Chen and Liang Lv and Di Wang and Jing Zhang and
                 Yue Yang and Zeyang Zhao and Chen Wang and Xiaowei Guo
                 and Hao Chen and Qingye Wang and Yufei Xu and Qiming
                 Zhang and Bo Du and Liangpei Zhang and Dacheng Tao",
  title =        "Empowering Agrifood System with Artificial
                 Intelligence: a Survey of the Progress, Challenges and
                 Opportunities",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "49:1--49:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3698589",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3698589",
  abstract =     "With the world population rapidly increasing,
                 transforming our agrifood systems to be more
                 productive, efficient, safe, and sustainable is crucial
                 to mitigate potential food shortages. Recently,
                 artificial intelligence (AI) techniques such as deep
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "49",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Bennetot:2025:PTE,
  author =       "Adrien Bennetot and Ivan Donadello and Ayoub {El Qadi
                 El Haouari} and Mauro Dragoni and Thomas Frossard and
                 Benedikt Wagner and Anna Sarranti and Silvia Tulli and
                 Maria Trocan and Raja Chatila and Andreas Holzinger and
                 Artur Davila Garcez and Natalia
                 D{\'\i}az-Rodr{\'\i}guez",
  title =        "A Practical Tutorial on Explainable {AI} Techniques",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "50:1--50:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3670685",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3670685",
  abstract =     "The past years have been characterized by an upsurge
                 in opaque automatic decision support systems, such as
                 Deep Neural Networks (DNNs). Although DNNs have great
                 generalization and prediction abilities, it is
                 difficult to obtain detailed explanations for
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Almeida:2025:ACF,
  author =       "Paulo S{\'e}rgio Almeida",
  title =        "Approaches to Conflict-free Replicated Data Types",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "2",
  pages =        "51:1--51:??",
  month =        feb,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3695249",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Nov 22 07:56:30 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3695249",
  abstract =     "Conflict-free Replicated Data Types (CRDTs) allow
                 optimistic replication in a principled way. Different
                 replicas can proceed independently, being available
                 even under network partitions and always converging
                 deterministically: Replicas that have received
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "51",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Liu:2025:GBT,
  author =       "Bohan Liu and Gongyuan Li and He Zhang and Yuzhe Jin
                 and Zikuan Wang and Dong Shao",
  title =        "The Gap Between Trustworthy {AI} Research and
                 Trustworthy Software Research: a Tertiary Study",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "52:1--52:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3694964",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3694964",
  abstract =     "With the increasing application and complexity of
                 Artificial Intelligence (AI) systems, the
                 trustworthiness of AI has garnered widespread attention
                 across various fields. An AI system is a specific type
                 of software system with unique trustworthiness
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alsufyani:2025:KBC,
  author =       "Azhar Alsufyani and Omer Rana and Charith Perera",
  title =        "Knowledge-based Cyber Physical Security at Smart Home:
                 a Review",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "53:1--53:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3698768",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3698768",
  abstract =     "Smart-home systems represent the future of modern
                 building infrastructure as they integrate numerous
                 devices and applications to improve the overall quality
                 of life. These systems establish connectivity among
                 smart devices, leveraging network technologies
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "53",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Das:2025:CSS,
  author =       "Pranab Das and Dilwar Hussain Mazumder",
  title =        "A Comprehensive Survey of Studies on Predicting
                 Anatomical Therapeutic Chemical Classes of Drugs",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "54:1--54:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3699713",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3699713",
  abstract =     "Drug classification plays a crucial role in
                 contemporary drug discovery, design, and development.
                 Determining the Anatomical Therapeutic Chemical (ATC)
                 classes for new drugs is a laborious, costly, and
                 intricate process, often requiring multiple clinical
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "54",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Harzevili:2025:SLR,
  author =       "Nima Shiri Harzevili and Alvine Boaye Belle and Junjie
                 Wang and Song Wang and Jiang, Zhen Ming (Jack) and
                 Nachiappan Nagappan",
  title =        "A Systematic Literature Review on Automated Software
                 Vulnerability Detection Using Machine Learning",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "55:1--55:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3699711",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3699711",
  abstract =     "In recent years, numerous Machine Learning (ML)
                 models, including Deep Learning (DL) and classic ML
                 models, have been developed to detect software
                 vulnerabilities. However, there is a notable lack of
                 comprehensive and systematic surveys that summarize,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "55",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Albaladejo-Gonzalez:2025:AIS,
  author =       "Mariano Albaladejo-Gonz{\'a}lez and Jos{\'e} A.
                 Ruip{\'e}rez-Valiente and F{\'e}lix Gmez M{\'a}rmol",
  title =        "Artificial Intelligence to Support the Training and
                 Assessment of Professionals: a Systematic Literature
                 Review",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "56:1--56:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3699712",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3699712",
  abstract =     "Advances in Artificial Intelligence (AI) and sensors
                 are significantly impacting multiple areas, including
                 education and workplaces. Following the PRISMA
                 methodology, this review explores the current status of
                 using AI to support the training and \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "56",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Shen:2025:ETL,
  author =       "Li Shen and Yan Sun and Zhiyuan Yu and Liang Ding and
                 Xinmei Tian and Dacheng Tao",
  title =        "On Efficient Training of Large-Scale Deep Learning
                 Models",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "57:1--57:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3700439",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3700439",
  abstract =     "The field of deep learning has witnessed significant
                 progress in recent times, particularly in areas such as
                 computer vision (CV), natural language processing
                 (NLP), and speech. The use of large-scale models
                 trained on vast amounts of data holds immense
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "57",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2025:DDC,
  author =       "Tianyi Wang and Xin Liao and Kam Pui Chow and Xiaodong
                 Lin and Yinglong Wang",
  title =        "Deepfake Detection: a Comprehensive Survey from the
                 Reliability Perspective",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "58:1--58:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3699710",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3699710",
  abstract =     "The mushroomed Deepfake synthetic materials circulated
                 on the internet have raised a profound social impact on
                 politicians, celebrities, and individuals worldwide. In
                 this survey, we provide a thorough review of the
                 existing Deepfake detection studies \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "58",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2025:KEL,
  author =       "Song Wang and Yaochen Zhu and Haochen Liu and Zaiyi
                 Zheng and Chen Chen and Jundong Li",
  title =        "Knowledge Editing for Large Language Models: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "59:1--59:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3698590",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3698590",
  abstract =     "Large Language Models (LLMs) have recently transformed
                 both the academic and industrial landscapes due to
                 their remarkable capacity to understand, analyze, and
                 generate texts based on their vast knowledge and
                 reasoning ability. Nevertheless, one major \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "59",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Rao:2025:SDA,
  author =       "Abishek Rao and Shivani Aithal and Sanjay Singh",
  title =        "Single-Document Abstractive Text Summarization: a
                 Systematic Literature Review",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "60:1--60:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3700639",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3700639",
  abstract =     "Abstractive text summarization is a task in natural
                 language processing that automatically generates the
                 summary from the source document in a human-written
                 form with minimal loss of information. Research in text
                 summarization has shifted towards \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dadure:2025:MIR,
  author =       "Pankaj Dadure and Partha Pakray and Sivaji
                 Bandyopadhyay",
  title =        "Mathematical Information Retrieval: a Review",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "61:1--61:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3699953",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3699953",
  abstract =     "Mathematical formulas are commonly used to demonstrate
                 theories and basic fundamentals in the Science,
                 Technology, Engineering, and Mathematics (STEM) domain.
                 The burgeoning research in the STEM domain results in
                 the mass production of scientific \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "61",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2025:SAP,
  author =       "Bo Zhang and Yansong Gao and Boyu Kuang and Changlong
                 Yu and Anmin Fu and Willy Susilo",
  title =        "A Survey on Advanced Persistent Threat Detection: a
                 Unified Framework, Challenges, and Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "62:1--62:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3700749",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3700749",
  abstract =     "In recent years, frequent Advanced Persistent Threat
                 (APT) attacks have caused disastrous damage to critical
                 facilities, leading to severe information leakages,
                 economic losses, and even social disruptions. Via
                 sophisticated, long-term, and stealthy \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "62",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Tariq:2025:DLA,
  author =       "Muhammad Tariq and Sohail Ahmad and Mian Ahmad Jan and
                 Houbing Song",
  title =        "Deep Learning Aided Intelligent Reflective Surfaces
                 for {6G}: a Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "63:1--63:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3696414",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3696414",
  abstract =     "The envisioned sixth-generation (6G) networks
                 anticipate robust support for diverse applications,
                 including massive machine-type communications,
                 ultra-reliable low-latency communications, and enhanced
                 mobile broadband. Intelligent Reflecting surface (IRS)
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "63",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gutierrez:2025:GAI,
  author =       "Mar{\'\i}a Guti{\'e}rrez and M${}^a$ {\'A}ngeles
                 Moraga and F{\'e}lix Garc{\'\i}a and Coral Calero",
  title =        "Green {IN} Artificial Intelligence from a Software
                 Perspective: State-of-the-Art and Green Decalogue",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "64:1--64:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3698111",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3698111",
  abstract =     "This work presents a structured view of the
                 state-of-the-art research on Artificial Intelligence
                 (AI), from the point of view of efficiency and
                 reduction of the energy consumption of AI software. We
                 analysed the current research on energy consumption of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "64",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Golec:2025:CSL,
  author =       "Muhammed Golec and Guneet Kaur Walia and Mohit Kumar
                 and Felix Cuadrado and Sukhpal Singh Gill and Steve
                 Uhlig",
  title =        "Cold Start Latency in Serverless Computing: a
                 Systematic Review, Taxonomy, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "65:1--65:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3700875",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3700875",
  abstract =     "Recently, academics and the corporate sector have paid
                 attention to serverless computing, which enables
                 dynamic scalability and an economic model. In
                 serverless computing, users only pay for the time they
                 actually use resources, enabling zero scaling to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "65",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Gomes:2025:SMS,
  author =       "Cl{\'a}udio Gomes and Jo{\~a}o Paulo Fernandes and
                 Gabriel Falcao and Soummya Kar and Sridhar Tayur",
  title =        "A Systematic Mapping Study on Quantum and
                 Quantum-inspired Algorithms in Operations Research",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "66:1--66:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3700874",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3700874",
  abstract =     "Quantum and quantum-inspired algorithms have not yet
                 been systematically classified in the context of
                 potential Operations Research (OR) applications. Our
                 systematic mapping is designed for quick consultation
                 and shows which algorithms have been \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "66",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Jiang:2025:SRI,
  author =       "Bin Jiang and Jiacheng Feng and Xuerong Cui and Jian
                 Wang and Yongxin Liu and Houbing Song",
  title =        "Security and Reliability of {Internet} of Underwater
                 Things: Architecture, Challenges, and Opportunities",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "67:1--67:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3700640",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3700640",
  abstract =     "The Internet of Underwater Things (IoUT) pertains to a
                 system that utilizes technology of Internet of Things
                 (IoT) for data collection, communication, and control
                 in the underwater environment. The monitoring and
                 management of various parameters in the \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "67",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{A:2025:SLR,
  author =       "Athira K. A. and Divya Udayan J. and Umashankar
                 Subramaniam",
  title =        "A Systematic Literature Review on Multi-Robot Task
                 Allocation",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "68:1--68:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3700591",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3700591",
  abstract =     "Muti-Robot system is gaining attention and is one of
                 the critical areas of research when it comes to
                 robotics. Coordination among multiple robots and how
                 different tasks are allocated to different system
                 agents are being studied. The objective of this
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "68",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhou:2025:CSD,
  author =       "Sheng Zhou and Hongjia Xu and Zhuonan Zheng and Jiawei
                 Chen and Zhao Li and Jiajun Bu and Jia Wu and Xin Wang
                 and Wenwu Zhu and Martin Ester",
  title =        "A Comprehensive Survey on Deep Clustering: Taxonomy,
                 Challenges, and Future Directions",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "69:1--69:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3689036",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3689036",
  abstract =     "Clustering is a fundamental machine learning task,
                 which aim at assigning instances into groups so that
                 similar samples belong to the same cluster while
                 dissimilar samples belong to different clusters.
                 Shallow clustering methods usually assume that data
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Shyalika:2025:CSR,
  author =       "Chathurangi Shyalika and Ruwan Wickramarachchi and
                 Amit P. Sheth",
  title =        "A Comprehensive Survey on Rare Event Prediction",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "70:1--70:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3699955",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3699955",
  abstract =     "Rare event prediction involves identifying and
                 forecasting events with a low probability using machine
                 learning (ML) and data analysis. Due to the imbalanced
                 data distributions, where the frequency of common
                 events vastly outweighs that of rare events, it
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2025:LBA,
  author =       "Qian Wang and Hong-Ning Dai and Jinghua Yang and Cai
                 Guo and Peter Childs and Maaike Kleinsmann and Yike Guo
                 and Pan Wang",
  title =        "Learning-based Artificial Intelligence Artwork:
                 Methodology Taxonomy and Quality Evaluation",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "71:1--71:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3698105",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3698105",
  abstract =     "With the development of the theory and technology of
                 computer science, machine or computer painting is
                 increasingly being explored in the creation of art.
                 Machine-made works are referred to as artificial
                 intelligence (AI) artworks. Early methods of AI
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "71",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Kalyani:2025:RMA,
  author =       "Yogeswaranathan Kalyani and Rem Collier",
  title =        "The Role of Multi-Agents in Digital Twin
                 Implementation: Short Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "72:1--72:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3697350",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3697350",
  abstract =     "In recent years, Digital Twin (DT) technology has
                 emerged as a significant technological advancement. A
                 digital twin is a digital representation of a physical
                 asset that mirrors its data model, behaviour, and
                 interactions with other physical assets. \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "72",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Abdelhamid:2025:RBT,
  author =       "Moetez Abdelhamid and Layth Sliman and Raoudha {Ben
                 Djemaa} and Guido Perboli",
  title =        "A Review on Blockchain Technology, Current Challenges,
                 and {AI}-Driven Solutions",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "73:1--73:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3700641",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3700641",
  abstract =     "Blockchain provides several advantages, including
                 decentralization, data integrity, traceability, and
                 immutability. However, despite its advantages,
                 blockchain suffers from significant limitations,
                 including scalability, resource greediness, governance
                 complexity, and some security related issues. These
                 limitations prevent its adoption in mainstream
                 applications. Artificial Intelligence (AI) can help
                 addressing some of these limitations. This survey
                 provides a detailed overview of the different
                 blockchain AI-based optimization and improvement
                 approaches, tools and methodologies proposed to meet
                 the needs of existing systems and applications with
                 their benefits and drawbacks. Afterward, the focus is
                 on suggesting AI-based directions where to address some
                 of the fundamental limitations of blockchain.",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "73",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wang:2025:SSU,
  author =       "Xiaojie Wang and Zhonghui Zhao and Ling Yi and
                 Zhaolong Ning and Lei Guo and F. Richard Yu and Song
                 Guo",
  title =        "A Survey on Security of {UAV} Swarm Networks: Attacks
                 and Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "74:1--74:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3703625",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3703625",
  abstract =     "The increasing popularity of Unmanned Aerial Vehicle
                 (UAV) swarms is attributed to their ability to generate
                 substantial returns for various industries at a low
                 cost. Additionally, in the future landscape of wireless
                 networks, UAV swarms can serve as \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "74",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{P:2025:EED,
  author =       "Haseena Rahmath P and Vishal Srivastava and Kuldeep
                 Chaurasia and Roberto G. Pacheco and Rodrigo S. Couto",
  title =        "Early-Exit Deep Neural Network --- a Comprehensive
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "75:1--75:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3698767",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3698767",
  abstract =     "Deep neural networks (DNNs) typically have a single
                 exit point that makes predictions by running the entire
                 stack of neural layers. Since not all inputs require
                 the same amount of computation to reach a confident
                 prediction, recent research has focused on \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "75",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Abdali:2025:MMM,
  author =       "Sara Abdali and Sina Shaham and Bhaskar
                 Krishnamachari",
  title =        "Multi-modal Misinformation Detection: Approaches,
                 Challenges and Opportunities",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "76:1--76:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3697349",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3697349",
  abstract =     "As social media platforms evolve from text-based
                 forums into multi-modal environments, the nature of
                 misinformation in social media is also transforming
                 accordingly. Taking advantage of the fact that visual
                 modalities such as images and videos are more
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "76",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mostafa:2025:MDL,
  author =       "Mohamed Mostafa and Ahmad S Almogren and Muhammad
                 Al-Qurishi and Majed Alrubaian",
  title =        "Modality Deep-learning Frameworks for Fake News
                 Detection on Social Networks: a Systematic Literature
                 Review",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "77:1--77:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3700748",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3700748",
  abstract =     "Fake news on social networks is a challenging problem
                 due to the rapid dissemination and volume of
                 information, as well as the ease of creating and
                 sharing content anonymously. Fake news stories are
                 problematic not only for the credibility of online
                 \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "77",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yan:2025:BAA,
  author =       "Baochen Yan and Jiahe Lan and Zheng Yan",
  title =        "Backdoor Attacks against Voice Recognition Systems: a
                 Survey",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "78:1--78:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3701985",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3701985",
  abstract =     "Voice Recognition Systems (VRSs) employ deep learning
                 for speech recognition and speaker recognition. They
                 have been widely deployed in various real-world
                 applications, from intelligent voice assistance to
                 telephony surveillance and biometric \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "78",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Dong:2025:SAA,
  author =       "Junhao Dong and Junxi Chen and Xiaohua Xie and
                 Jianhuang Lai and Hao Chen",
  title =        "Survey on Adversarial Attack and Defense for Medical
                 Image Analysis: Methods and Challenges",
  journal =      j-COMP-SURV,
  volume =       "57",
  number =       "3",
  pages =        "79:1--79:??",
  month =        mar,
  year =         "2025",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3702638",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Dec 5 07:15:38 MST 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3702638",
  abstract =     "Deep learning techniques have achieved superior
                 performance in computer-aided medical image analysis,
                 yet they are still vulnerable to imperceptible
                 adversarial attacks, resulting in potential
                 misdiagnosis in clinical practice. Oppositely, recent
                 years \ldots{}",
  acknowledgement = ack-nhfb,
  ajournal =     "ACM Comput. Surv.",
  articleno =    "79",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

%%% ====================================================================
%%% Cross-referenced entries come last:
@Book{Aspray:1987:PJN,
  editor =       "William Aspray and Arthur Burks",
  booktitle =    "Papers of {John von Neumann} on computing and computer
                 theory",
  title =        "Papers of {John von Neumann} on computing and computer
                 theory",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xviii + 624",
  year =         "1987",
  ISBN =         "0-262-22030-X",
  ISBN-13 =      "978-0-262-22030-9",
  LCCN =         "QA76.5 .P31451 1987",
  bibdate =      "Thu Apr 29 17:01:25 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "See \cite{Knuth:1970:NFC}.",
  acknowledgement = ack-nhfb,
}

@Book{Knuth:1992:LP,
  author =       "Donald E. Knuth",
  booktitle =    "Literate Programming",
  title =        "Literate Programming",
  publisher =    pub-SUCSLI,
  address =      pub-SUCSLI:adr,
  pages =        "xvi + 368",
  year =         "1992",
  ISBN =         "0-937073-80-6 (paperback), 0-937073-81-4 (hardcover)",
  ISBN-13 =      "978-0-937073-80-3 (paperback), 978-0-937073-81-0
                 (hardcover)",
  LCCN =         "QA76.6 .K644 1992",
  bibdate =      "Fri Jul 22 09:08:14 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  note =         "Distributed by the University of Chicago Press.",
  price =        "US\$24.95 (paperback), US\$59.95 (hardcover)",
  series =       "CSLI Lecture Notes Number 27",
  acknowledgement = ack-nhfb,
}