@Preamble{
"\input bibnames.sty"
# "\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi"
}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
@String{j-TOIT = "ACM Transactions on Internet Technology
(TOIT)"}
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY 10036, USA"}
@Article{Arasu:2001:SW,
author = "Arvind Arasu and Junghoo Cho and Hector Garcia-Molina
and Andreas Paepcke and Sriram Raghavan",
title = "Searching the {Web}",
journal = j-TOIT,
volume = "1",
number = "1",
pages = "2--43",
month = aug,
year = "2001",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Jan 30 14:43:08 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Arlitt:2001:CSL,
author = "Martin Arlitt and Diwakar Krishnamurthy and Jerry
Rolia",
title = "Characterizing the scalability of a large web-based
shopping system",
journal = j-TOIT,
volume = "1",
number = "1",
pages = "44--69",
month = aug,
year = "2001",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Jan 30 14:43:08 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Blumenthal:2001:RDI,
author = "Marjory S. Blumenthal and David D. Clark",
title = "Rethinking the design of the {Internet}: the
end-to-end arguments vs. the brave new world",
journal = j-TOIT,
volume = "1",
number = "1",
pages = "70--109",
month = aug,
year = "2001",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Jan 30 14:43:08 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yoshikawa:2001:XPB,
author = "Masatoshi Yoshikawa and Toshiyuki Amagasa and Takeyuki
Shimura and Shunsuke Uemura",
title = "{XRel}: a path-based approach to storage and retrieval
of {XML} documents using relational databases",
journal = j-TOIT,
volume = "1",
number = "1",
pages = "110--141",
month = aug,
year = "2001",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Jan 30 14:43:08 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Kristol:2001:HCS,
author = "David M. Kristol",
title = "{HTTP Cookies}: {Standards}, privacy, and politics",
journal = j-TOIT,
volume = "1",
number = "2",
pages = "151--198",
month = nov,
year = "2001",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Jan 30 14:43:08 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Waldman:2001:ARP,
author = "Marc Waldman and Aviel D. Rubin and Lorrie Faith
Cranor",
title = "The architecture of robust publishing systems",
journal = j-TOIT,
volume = "1",
number = "2",
pages = "199--230",
month = nov,
year = "2001",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Jan 30 14:43:08 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Wolf:2001:BLC,
author = "Joel L. Wolf and Philip S. Yu",
title = "On balancing the load in a clustered web farm",
journal = j-TOIT,
volume = "1",
number = "2",
pages = "231--261",
month = nov,
year = "2001",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Jan 30 14:43:08 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Guo:2002:OSS,
author = "Xin Guo",
title = "An optimal strategy for sellers in an online auction",
journal = j-TOIT,
volume = "2",
number = "1",
pages = "1--13",
month = feb,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Jan 30 14:43:09 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Huck:2002:SCS,
author = "Paul Huck and Michael Butler and Amar Gupta and
Michael Feng",
title = "A self-configuring and self-administering name system
with dynamic address assignment",
journal = j-TOIT,
volume = "2",
number = "1",
pages = "14--46",
month = feb,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Jan 30 14:43:09 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Williamson:2002:FEW,
author = "Carey Williamson",
title = "On filter effects in web caching hierarchies",
journal = j-TOIT,
volume = "2",
number = "1",
pages = "47--77",
month = feb,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Jan 30 14:43:09 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Brabrand:2002:BP,
author = "Claus Brabrand and Anders M{\o}ller and Michael I.
Schwartzbach",
title = "The {$<$ bigwig$>$} project",
journal = j-TOIT,
volume = "2",
number = "2",
pages = "79--114",
month = may,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:54 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Fielding:2002:PDM,
author = "Roy T. Fielding and Richard N. Taylor",
title = "Principled design of the modern {Web} architecture",
journal = j-TOIT,
volume = "2",
number = "2",
pages = "115--150",
month = may,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:54 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Nentwich:2002:XCC,
author = "Christian Nentwich and Licia Capra and Wolfgang
Emmerich and Anthony Finkelstein",
title = "{\tt xlinkit}: a consistency checking and smart link
generation service",
journal = j-TOIT,
volume = "2",
number = "2",
pages = "151--185",
month = may,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:54 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Besen:2002:ECE,
author = "Stanley M. Besen and Jeffrey S. Spigel and Padmanabhan
Srinagesh",
title = "Evaluating the competitive effects of mergers of
{Internet} backbone providers",
journal = j-TOIT,
volume = "2",
number = "3",
pages = "187--204",
month = aug,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:55 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Dill:2002:SSW,
author = "Stephen Dill and Ravi Kumar and Kevin S. Mccurley and
Sridhar Rajagopalan and D. Sivakumar and Andrew
Tomkins",
title = "Self-similarity in the web",
journal = j-TOIT,
volume = "2",
number = "3",
pages = "205--223",
month = aug,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:55 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yin:2002:EWC,
author = "Jian Yin and Lorenzo Alvisi and Mike Dahlin and Arun
Iyengar",
title = "Engineering web cache consistency",
journal = j-TOIT,
volume = "2",
number = "3",
pages = "224--259",
month = aug,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:55 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Gordon:2002:LBD,
author = "Michael Gordon and Robert K. Lindsay and Weiguo Fan",
title = "Literature-based discovery on the {World Wide Web}",
journal = j-TOIT,
volume = "2",
number = "4",
pages = "261--275",
month = nov,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:55 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Hochheiser:2002:PPP,
author = "Harry Hochheiser",
title = "The platform for privacy preference as a social
protocol: an examination within the {U.S.} policy
context",
journal = j-TOIT,
volume = "2",
number = "4",
pages = "276--306",
month = nov,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:55 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ji:2002:ABM,
author = "Minwen Ji",
title = "Affinity-based management of main memory database
clusters",
journal = j-TOIT,
volume = "2",
number = "4",
pages = "307--339",
month = nov,
year = "2002",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:55 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Eirinaki:2003:WMW,
author = "Magdalini Eirinaki and Michalis Vazirgiannis",
title = "{Web} mining for web personalization",
journal = j-TOIT,
volume = "3",
number = "1",
pages = "1--27",
month = feb,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:56 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Claessens:2003:HCM,
author = "Joris Claessens and Bart Preneel and Joos Vandewalle",
title = "(How) can mobile agents do secure electronic
transactions on untrusted hosts? {A} survey of the
security issues and the current solutions",
journal = j-TOIT,
volume = "3",
number = "1",
pages = "28--48",
month = feb,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:56 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Merialdo:2003:DDD,
author = "Paolo Merialdo and Paolo Atzeni and Giansalvatore
Mecca",
title = "Design and development of data-intensive web sites:
{The Araneus} approach",
journal = j-TOIT,
volume = "3",
number = "1",
pages = "49--92",
month = feb,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:56 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Cooley:2003:UWS,
author = "Robert Cooley",
title = "The use of web structure and content to identify
subjectively interesting web usage patterns",
journal = j-TOIT,
volume = "3",
number = "2",
pages = "93--116",
month = may,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:56 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Hosoya:2003:XST,
author = "Haruo Hosoya and Benjamin C. Pierce",
title = "{XDuce}: a statically typed {XML} processing
language",
journal = j-TOIT,
volume = "3",
number = "2",
pages = "117--148",
month = may,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:56 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Kobsa:2003:PTP,
author = "Alfred Kobsa and J{\"o}rg Schreck",
title = "Privacy through pseudonymity in user-adaptive
systems",
journal = j-TOIT,
volume = "3",
number = "2",
pages = "149--183",
month = may,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:56 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Anthony:2003:DBA,
author = "Patricia Anthony and Nicholas R. Jennings",
title = "Developing a bidding agent for multiple heterogeneous
auctions",
journal = j-TOIT,
volume = "3",
number = "3",
pages = "185--217",
month = aug,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:57 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{He:2003:SAA,
author = "Minghua He and Nicholas R. Jennings",
title = "{SouthamptonTAC}: an adaptive autonomous trading
agent",
journal = j-TOIT,
volume = "3",
number = "3",
pages = "218--235",
month = aug,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:57 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Varshney:2003:LMM,
author = "Upkar Varshney",
title = "Location management for mobile commerce applications
in wireless {Internet} environment",
journal = j-TOIT,
volume = "3",
number = "3",
pages = "236--255",
month = aug,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:57 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Cho:2003:EFC,
author = "Junghoo Cho and Hector Garcia-Molina",
title = "Estimating frequency of change",
journal = j-TOIT,
volume = "3",
number = "3",
pages = "256--290",
month = aug,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Aug 7 09:39:57 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Braumandl:2003:QSI,
author = "R. Braumandl and A. Kemper and D. Kossmann",
title = "Quality of service in an information economy",
journal = j-TOIT,
volume = "3",
number = "4",
pages = "291--333",
month = nov,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Oct 28 11:53:21 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Amiri:2003:ESI,
author = "Ali Amiri and Syam Menon",
title = "Efficient scheduling of {Internet} banner
advertisements",
journal = j-TOIT,
volume = "3",
number = "4",
pages = "334--346",
month = nov,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Oct 28 11:53:21 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Cherkasova:2003:MCE,
author = "Ludmila Cherkasova and Yun Fu and Wenting Tang and
Amin Vahdat",
title = "Measuring and characterizing end-to-end {Internet}
service performance",
journal = j-TOIT,
volume = "3",
number = "4",
pages = "347--391",
month = nov,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Oct 28 11:53:21 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Knutsson:2003:APS,
author = "Bj{\"o}rn Knutsson and Honghui Lu and Jeffrey Mogul
and Bryan Hopkins",
title = "Architecture and performance of server-directed
transcoding",
journal = j-TOIT,
volume = "3",
number = "4",
pages = "392--424",
month = nov,
year = "2003",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Oct 28 11:53:21 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Gburzynski:2004:FSW,
author = "Pawel Gburzynski and Jacek Maitan",
title = "Fighting the spam wars: a remailer approach with
restrictive aliasing",
journal = j-TOIT,
volume = "4",
number = "1",
pages = "1--30",
month = feb,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Feb 9 08:18:07 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Lempel:2004:ORP,
author = "Ronny Lempel and Shlomo Moran",
title = "Optimizing result prefetching in {Web} search engines
with segmented indices",
journal = j-TOIT,
volume = "4",
number = "1",
pages = "31--59",
month = feb,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Feb 9 08:18:07 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Boneh:2004:FGC,
author = "Dan Boneh and Xuhua Ding and Gene Tsudik",
title = "Fine-grained control of security capabilities",
journal = j-TOIT,
volume = "4",
number = "1",
pages = "60--82",
month = feb,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Feb 9 08:18:07 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bond:2004:OAN,
author = "Gregory W. Bond and Eric Cheung and K. Hal Purdy and
Pamela Zave and J. Christopher Ramming",
title = "An open architecture for next-generation
telecommunication services",
journal = j-TOIT,
volume = "4",
number = "1",
pages = "83--123",
month = feb,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Feb 9 08:18:07 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Flake:2004:GEMa,
author = "Gary William Flake and Paolo Frasconi and C. Lee Giles
and Marco Maggini",
title = "Guest editorial: {Machine} learning for the
{Internet}",
journal = j-TOIT,
volume = "4",
number = "2",
pages = "125--128",
month = may,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 4 08:23:00 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Agichtein:2004:LFA,
author = "Eugene Agichtein and Steve Lawrence and Luis Gravano",
title = "Learning to find answers to questions on the {Web}",
journal = j-TOIT,
volume = "4",
number = "2",
pages = "129--162",
month = may,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 4 08:23:00 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Deshpande:2004:SMM,
author = "Mukund Deshpande and George Karypis",
title = "Selective {Markov} models for predicting {Web} page
accesses",
journal = j-TOIT,
volume = "4",
number = "2",
pages = "163--184",
month = may,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 4 08:23:00 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhu:2004:PMC,
author = "Jianhan Zhu and Jun Hong and John G. Hughes",
title = "{PageCluster}: {Mining} conceptual link hierarchies
from {Web} log files for adaptive {Web} site
navigation",
journal = j-TOIT,
volume = "4",
number = "2",
pages = "185--208",
month = may,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 4 08:23:00 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Fang:2004:LWM,
author = "Xiao Fang and Olivia R. Liu Sheng",
title = "{LinkSelector}: {A Web} mining approach to hyperlink
selection for {Web} portals",
journal = j-TOIT,
volume = "4",
number = "2",
pages = "209--237",
month = may,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 4 08:23:00 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Byers:2004:DAI,
author = "Simon Byers and Aviel D. Rubin and David Kormann",
title = "Defending against an {Internet-based} attack on the
physical world",
journal = j-TOIT,
volume = "4",
number = "3",
pages = "239--254",
month = aug,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 4 08:23:01 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Goasdoue:2004:AQU,
author = "Fran{\c{c}}ois Goasdou{\'e} and Marie-Christine
Rousset",
title = "Answering queries using views: {A KRDB} perspective
for the semantic {Web}",
journal = j-TOIT,
volume = "4",
number = "3",
pages = "255--288",
month = aug,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 4 08:23:01 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Barga:2004:RGI,
author = "Roger Barga and David Lomet and German Shegalov and
Gerhard Weikum",
title = "Recovery guarantees for {Internet} applications",
journal = j-TOIT,
volume = "4",
number = "3",
pages = "289--328",
month = aug,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 4 08:23:01 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Lyback:2004:ATS,
author = "David Lyb{\"a}ck and Magnus Boman",
title = "Agent trade servers in financial exchange systems",
journal = j-TOIT,
volume = "4",
number = "3",
pages = "329--339",
month = aug,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 4 08:23:01 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Flake:2004:GEMb,
author = "Gary William Flake and Paolo Frasconi and C. Lee Giles
and Marco Maggini",
title = "Guest editorial: {Machine} learning for the
{Internet}",
journal = j-TOIT,
volume = "4",
number = "4",
pages = "341--343",
month = nov,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Nov 22 06:17:51 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{OMahony:2004:CRR,
author = "Michael O'Mahony and Neil Hurley and Nicholas
Kushmerick and Gu{\'e}nol{\'e} Silvestre",
title = "Collaborative recommendation: a robustness analysis",
journal = j-TOIT,
volume = "4",
number = "4",
pages = "344--377",
month = nov,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Nov 22 06:17:51 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Menczer:2004:TWC,
author = "Filippo Menczer and Gautam Pant and Padmini
Srinivasan",
title = "Topical web crawlers: {Evaluating} adaptive
algorithms",
journal = j-TOIT,
volume = "4",
number = "4",
pages = "378--419",
month = nov,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Nov 22 06:17:51 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bohte:2004:MBR,
author = "Sander M. Bohte and Enrico Gerding and Han {La
Poutr{\'e}}",
title = "Market-based recommendation: {Agents} that compete for
consumer attention",
journal = j-TOIT,
volume = "4",
number = "4",
pages = "420--448",
month = nov,
year = "2004",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Nov 22 06:17:51 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Thiemann:2005:EDS,
author = "Peter Thiemann",
title = "An embedded domain-specific language for type-safe
server-side {Web} scripting",
journal = j-TOIT,
volume = "5",
number = "1",
pages = "1--46",
month = feb,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Apr 14 10:31:40 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ardissono:2005:MAI,
author = "Liliana Ardissono and Anna Goy and Giovanna Petrone
and Marino Segnan",
title = "A multi-agent infrastructure for developing
personalized {Web}-based systems",
journal = j-TOIT,
volume = "5",
number = "1",
pages = "47--69",
month = feb,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Apr 14 10:31:40 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Chan:2005:MPC,
author = "Addison Chan and Rynson W. H. Lau and Beatrice Ng",
title = "Motion prediction for caching and prefetching in
mouse-driven {DVE} navigation",
journal = j-TOIT,
volume = "5",
number = "1",
pages = "70--91",
month = feb,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Apr 14 10:31:40 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bianchini:2005:IP,
author = "Monica Bianchini and Marco Gori and Franco Scarselli",
title = "Inside {PageRank}",
journal = j-TOIT,
volume = "5",
number = "1",
pages = "92--128",
month = feb,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Apr 14 10:31:40 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ungureanu:2005:UCP,
author = "Victoria Ungureanu",
title = "Using certified policies to regulate {E-commerce}
transactions",
journal = j-TOIT,
volume = "5",
number = "1",
pages = "129--153",
month = feb,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Apr 14 10:31:40 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Lu:2005:WMD,
author = "Hongjun Lu and Jeffrey Xu Yu and Guoren Wang and
Shihui Zheng and Haifeng Jiang and Ge Yu and Aoying
Zhou",
title = "What makes the differences: benchmarking {XML}
database implementations",
journal = j-TOIT,
volume = "5",
number = "1",
pages = "154--194",
month = feb,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Apr 14 10:31:40 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Mok:2005:LAS,
author = "Wilson Wai Ho Mok and R. P. Sundarraj",
title = "Learning algorithms for single-instance electronic
negotiations using the time-dependent behavioral
tactic",
journal = j-TOIT,
volume = "5",
number = "1",
pages = "195--230",
month = feb,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Apr 14 10:31:40 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Borodin:2005:LAR,
author = "Allan Borodin and Gareth O. Roberts and Jeffrey S.
Rosenthal and Panayiotis Tsaparas",
title = "Link analysis ranking: algorithms, theory, and
experiments",
journal = j-TOIT,
volume = "5",
number = "1",
pages = "231--297",
month = feb,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Apr 14 10:31:40 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Abadi:2005:MHM,
author = "Martin Abadi and Mike Burrows and Mark Manasse and Ted
Wobber",
title = "Moderately hard, memory-bound functions",
journal = j-TOIT,
volume = "5",
number = "2",
pages = "299--327",
month = may,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Jul 7 12:39:56 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Oberle:2005:SAD,
author = "Daniel Oberle and Steffen Staab and Rudi Studer and
Raphael Volz",
title = "Supporting application development in the {Semantic
Web}",
journal = j-TOIT,
volume = "5",
number = "2",
pages = "328--358",
month = may,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Jul 7 12:39:56 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Challenger:2005:FBA,
author = "Jim Challenger and Paul Dantzig and Arun Iyengar and
Karen Witting",
title = "A fragment-based approach for efficiently creating
dynamic {Web} content",
journal = j-TOIT,
volume = "5",
number = "2",
pages = "359--389",
month = may,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Jul 7 12:39:56 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Petropoulos:2005:GQI,
author = "Michalis Petropoulos and Yannis Papakonstantinou and
Vasilis Vassalos",
title = "Graphical query interfaces for semistructured data:
the {QURSED} system",
journal = j-TOIT,
volume = "5",
number = "2",
pages = "390--438",
month = may,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Jul 7 12:39:56 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
note = "See address correction \cite{Vassalos:2005:C}.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Manolescu:2005:MDD,
author = "Ioana Manolescu and Marco Brambilla and Stefano Ceri
and Sara Comai and Piero Fraternali",
title = "Model-driven design and deployment of service-enabled
{Web} applications",
journal = j-TOIT,
volume = "5",
number = "3",
pages = "439--479",
month = aug,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Fri Nov 18 08:22:27 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Li:2005:OMC,
author = "Keqiu Li and Hong Shen and Francis Y. L. Chin and Si
Qing Zheng",
title = "Optimal methods for coordinated enroute {Web} caching
for tree networks",
journal = j-TOIT,
volume = "5",
number = "3",
pages = "480--507",
month = aug,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Fri Nov 18 08:22:27 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Gomes:2005:CNC,
author = "Daniel Gomes and M{\'a}rio J. Silva",
title = "Characterizing a national community {Web}",
journal = j-TOIT,
volume = "5",
number = "3",
pages = "508--531",
month = aug,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Fri Nov 18 08:22:27 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Chen:2005:FCM,
author = "Xuan Chen and John Heidemann",
title = "Flash crowd mitigation via adaptive admission control
based on application-level observations",
journal = j-TOIT,
volume = "5",
number = "3",
pages = "532--569",
month = aug,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Fri Nov 18 08:22:27 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Vassalos:2005:C,
author = "Vasilis Vassalos",
title = "Corrigenda",
journal = j-TOIT,
volume = "5",
number = "3",
pages = "570--570",
month = aug,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Fri Nov 18 08:22:27 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
note = "Address correction for \cite{Petropoulos:2005:GQI}.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Harumoto:2005:EWB,
author = "Kaname Harumoto and Tadashi Nakano and Shinya Fukumura
and Shinji Shimojo and Shojiro Nishio",
title = "Effective {Web} browsing through content delivery
adaptation",
journal = j-TOIT,
volume = "5",
number = "4",
pages = "571--600",
month = nov,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Jan 24 06:15:07 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Li:2005:CSM,
author = "Mingzhe Li and Mark Claypool and Robert Kinicki and
James Nichols",
title = "Characteristics of streaming media stored on the
{Web}",
journal = j-TOIT,
volume = "5",
number = "4",
pages = "601--626",
month = nov,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Jan 24 06:15:07 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Diaz:2005:PSR,
author = "Oscar Diaz and Juan J. Rodriguez",
title = "Portlet syndication: {Raising} variability concerns",
journal = j-TOIT,
volume = "5",
number = "4",
pages = "627--659",
month = nov,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Jan 24 06:15:07 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Murata:2005:TXS,
author = "Makoto Murata and Dongwon Lee and Murali Mani and
Kohsuke Kawaguchi",
title = "Taxonomy of {XML} schema languages using formal
language theory",
journal = j-TOIT,
volume = "5",
number = "4",
pages = "660--704",
month = nov,
year = "2005",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Jan 24 06:15:07 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Lin:2006:ISP,
author = "Jeng-Wei Lin and Jan-Ming Ho and Li-Ming Tseng and
Feipei Lai",
title = "{IDN} server proxy architecture for {Internationalized
Domain Name} resolution and experiences with providing
{Web} services",
journal = j-TOIT,
volume = "6",
number = "1",
pages = "1--19",
month = feb,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1125274.1125275",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Apr 19 07:42:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Schroeder:2006:WSU,
author = "Bianca Schroeder and Mor Harchol-Balter",
title = "{Web} servers under overload: {How} scheduling can
help",
journal = j-TOIT,
volume = "6",
number = "1",
pages = "20--52",
month = feb,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1125274.1125276",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Apr 19 07:42:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Chien:2006:SCQ,
author = "Shu-Yao Chien and Vassilis J. Tsotras and Carlo
Zaniolo and Donghui Zhang",
title = "Supporting complex queries on multiversion {XML}
documents",
journal = j-TOIT,
volume = "6",
number = "1",
pages = "53--84",
month = feb,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1125274.1125277",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Apr 19 07:42:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Szykman:2006:DIW,
author = "Simon Szykman and Ram D. Sriram",
title = "Design and implementation of the {Web}-enabled {NIST}
design repository",
journal = j-TOIT,
volume = "6",
number = "1",
pages = "85--116",
month = feb,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1125274.1125278",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Apr 19 07:42:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Fenner:2006:SME,
author = "Trevor Fenner and Mark Levene and George Loizou",
title = "A stochastic model for the evolution of the {Web}
allowing link deletion",
journal = j-TOIT,
volume = "6",
number = "2",
pages = "117--130",
month = may,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1149121.1149122",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Wed Jan 7 15:21:21 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Recently several authors have proposed stochastic
evolutionary models for the growth of the Web graph and
other networks that give rise to power-law
distributions. These models are based on the notion of
preferential attachment, leading to the ``rich get
richer'' phenomenon. We present a generalization of the
basic model by allowing deletion of individual links
and show that it also gives rise to a power-law
distribution. We derive the mean-field equations for
this stochastic model and show that, by examining a
snapshot of the distribution at the steady state of the
model, we are able to determine the extent to which
link deletion has taken place and estimate the
probability of deleting a link. Applying our model to
actual Web graph data provides evidence of the extent
to which link deletion has occurred. We also discuss a
problem that frequently arises in estimating the
power-law exponent from empirical data and a few
possible methods for dealing with this, indicating our
preferred approach. Using this approach our analysis of
the data suggests a power-law exponent of approximately
2.15 for the distribution of inlinks in the Web graph,
rather than the widely published value of 2.1.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Kumar:2006:CAC,
author = "Ravi Kumar and Prabhakar Raghavan and Sridhar
Rajagopalan and Andrew Tomkins",
title = "Core algorithms in the {CLEVER} system",
journal = j-TOIT,
volume = "6",
number = "2",
pages = "131--152",
month = may,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1149121.1149123",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Wed Jan 7 15:21:21 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article describes the CLEVER search system
developed at the IBM Almaden Research Center. We
present a detailed and unified exposition of the
various algorithmic components that make up the system,
and then present results from two user studies.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Cho:2006:SWC,
author = "Junghoo Cho and Hector Garcia-Molina and Taher
Haveliwala and Wang Lam and Andreas Paepcke and Sriram
Raghavan and Gary Wesley",
title = "{Stanford} {WebBase} components and applications",
journal = j-TOIT,
volume = "6",
number = "2",
pages = "153--186",
month = may,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1149121.1149124",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Wed Jan 7 15:21:21 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We describe the design and performance of WebBase, a
tool for Web research. The system includes a highly
customizable crawler, a repository for collected Web
pages, an indexer for both text and link-related page
features, and a high-speed content distribution
facility. The distribution module enables researchers
world-wide to retrieve pages from WebBase, and stream
them across the Internet at high speed. The advantage
for the researchers is that they need not all crawl the
Web before beginning their research. WebBase has been
used by scores of research and teaching organizations
world-wide, mostly for investigations into Web topology
and linguistic content analysis. After describing the
system's architecture, we explain our engineering
decisions for each of the WebBase components, and
present respective performance measurements.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Stolfo:2006:BBM,
author = "Salvatore J. Stolfo and Shlomo Hershkop and Chia-Wei
Hu and Wei-Jen Li and Olivier Nimeskern and Ke Wang",
title = "Behavior-based modeling and its application to {Email}
analysis",
journal = j-TOIT,
volume = "6",
number = "2",
pages = "187--221",
month = may,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1149121.1149125",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Wed Jan 7 15:21:21 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Email Mining Toolkit (EMT) is a data mining system
that computes behavior profiles or models of user email
accounts. These models may be used for a multitude of
tasks including forensic analyses and detection tasks
of value to law enforcement and intelligence agencies,
as well for as other typical tasks such as virus and
spam detection. To demonstrate the power of the
methods, we focus on the application of these models to
detect the early onset of a viral propagation without
``content-base '' (or signature-based) analysis in
common use in virus scanners. We present several
experiments using real email from 15 users with
injected simulated viral emails and describe how the
combination of different behavior models improves
overall detection rates. The performance results vary
depending upon parameter settings, approaching 99 \%
true positive (TP) (percentage of viral emails caught)
in general cases and with 0.38 \% false positive (FP)
(percentage of emails with attachments that are
mislabeled as viral). The models used for this study
are based upon volume and velocity statistics of a
user's email rate and an analysis of the user's
(social) cliques revealed in the person's email
behavior. We show by way of simulation that virus
propagations are detectable since viruses may emit
emails at rates different than human behavior suggests
is normal, and email is directed to groups of
recipients in ways that violate the users' typical
communications with their social groups.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Min:2006:CEA,
author = "Jun-Ki Min and Myung-Jae Park and Chin-Wan Chung",
title = "A compressor for effective archiving, retrieval, and
updating of {XML} documents",
journal = j-TOIT,
volume = "6",
number = "3",
pages = "223--258",
month = aug,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1151087.1151088",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Aug 23 05:13:30 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bakker:2006:WAD,
author = "Arno Bakker and Maarten {Van Steen} and Andrew S.
Tanenbaum",
title = "A wide-area {Distribution Network} for free software",
journal = j-TOIT,
volume = "6",
number = "3",
pages = "259--281",
month = aug,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1151087.1151089",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Aug 23 05:13:30 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Globe Distribution Network (GDN) is an application
for the efficient, worldwide distribution of freely
redistributable software packages. Distribution is made
efficient by encapsulating the software into special
distributed objects which efficiently replicate
themselves near to the downloading clients. The Globe
Distribution Network takes a novel, optimistic approach
to stop the illegal distribution of copyrighted and
illicit material via the network. Instead of having
moderators check the packages at upload time, illegal
content is removed and its uploader's access to the
network permanently revoked only when the violation is
discovered. Other protective measures defend the GDN
against internal and external attacks to its
availability. By exploiting the replication of the
software and using fault-tolerant server software, the
Globe Distribution Network achieves high availability.
A prototype implementation of the GDN is available from
\path=http://www.cs.vu.nl/globe/=.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Brinkmeier:2006:PR,
author = "Michael Brinkmeier",
title = "{PageRank} revisited",
journal = j-TOIT,
volume = "6",
number = "3",
pages = "282--301",
month = aug,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1151087.1151090",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Aug 23 05:13:30 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "PageRank, one part of the search engine Google, is one
of the most prominent link-based rankings of documents
in the World Wide Web. Usually it is described as a
Markov chain modeling a specific random surfer. In this
article, an alternative representation as a power
series is given. Nonetheless, it is possible to
interpret the values as probabilities in a random
surfer setting, differing from the usual one. Using the
new description we restate and extend some results
concerning the convergence of the standard iteration
used for PageRank. Furthermore we take a closer look at
sinks and sources, leading to some suggestions for
faster implementations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Jonsson:2006:POS,
author = "Bj{\"o}rn Th{\o}r J{\'o}nsson and Mar{\'\i}a
Arinbjarnar and Bjarnsteinn Th{\'o}rsson and Michael J.
Franklin and Divesh Srivastava",
title = "Performance and overhead of semantic cache
management",
journal = j-TOIT,
volume = "6",
number = "3",
pages = "302--331",
month = aug,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1151087.1151091",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Aug 23 05:13:30 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
remark = "The `Th' in the first and third author names should be
the Icelandic letter Thu.",
}
@Article{Becerra-Fernandez:2006:SEW,
author = "Irma Becerra-Fernandez",
title = "Searching for experts on the {Web}: a review of
contemporary expertise locator systems",
journal = j-TOIT,
volume = "6",
number = "4",
pages = "333--355",
month = nov,
year = "2006",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 30 19:02:51 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bellavista:2006:MCM,
author = "Paolo Bellavista and Antonio Corradi and Rebecca
Montanari and Cesare Stefanelli",
title = "A mobile computing middleware for location- and
context-aware {Internet} data services",
journal = j-TOIT,
volume = "6",
number = "4",
pages = "356--380",
month = nov,
year = "2006",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 30 19:02:51 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Tsoi:2006:CCP,
author = "Ah Chung Tsoi and Markus Hagenbuchner and Franco
Scarselli",
title = "Computing customized page ranks",
journal = j-TOIT,
volume = "6",
number = "4",
pages = "381--414",
month = nov,
year = "2006",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 30 19:02:51 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Hui:2006:OID,
author = "Kai-Lung Hui and Bernard C. Y. Tan and Chyan-Yee Goh",
title = "Online information disclosure: {Motivators} and
measurements",
journal = j-TOIT,
volume = "6",
number = "4",
pages = "415--441",
month = nov,
year = "2006",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 30 19:02:51 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Jansen:2006:AGW,
author = "Bernard J. Jansen and Tracy Mullen and Amanda Spink
and Jan Pedersen",
title = "Automated gathering of {Web} information: an in-depth
examination of agents interacting with search engines",
journal = j-TOIT,
volume = "6",
number = "4",
pages = "442--464",
month = nov,
year = "2006",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 30 19:02:51 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{He:2006:HBS,
author = "Minghua He and Nicholas R. Jennings and Adam
Pr{\"u}gel-Bennett",
title = "A heuristic bidding strategy for buying multiple goods
in multiple {English} auctions",
journal = j-TOIT,
volume = "6",
number = "4",
pages = "465--496",
month = nov,
year = "2006",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 30 19:02:51 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Golbeck:2006:IBT,
author = "Jennifer Golbeck and James Hendler",
title = "Inferring binary trust relationships in {Web}-based
social networks",
journal = j-TOIT,
volume = "6",
number = "4",
pages = "497--529",
month = nov,
year = "2006",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Nov 30 19:02:51 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Jacob:2007:ICF,
author = "Varghese S. Jacob and Ramayya Krishnan and Young U.
Ryu",
title = "{Internet} content filtering using isotonic separation
on content category ratings",
journal = j-TOIT,
volume = "7",
number = "1",
pages = "1:1--1:??",
month = feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1189740.1189741",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:57:52 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The World Wide Web has enabled anybody with a low cost
Internet connection to access vast information
repositories. Some of these repositories contain
information (e.g., hate speech and pornography) that is
considered objectionable, especially for children to
view. Several efforts---legal and technical---are
underway to protect children and the generic public
from accessing this type of content. We propose a
technical approach utilizing a recently proposed
technique called isotonic separation for filtering with
content metadata if they satisfy monotone conditions.
We illustrate this approach using a category rating
method of PICS. In essence, we formulate the Internet
content filtering problem as a classification problem
on content metadata and report on experiments we
conducted with the isotonic separation technique.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "Internet content filtering; isotonic separation;
PICS",
}
@Article{Ceri:2007:MDD,
author = "Stefano Ceri and Florian Daniel and Maristella Matera
and Federico M. Facca",
title = "Model-driven development of context-aware {Web}
applications",
journal = j-TOIT,
volume = "7",
number = "1",
pages = "2:1--2:??",
month = feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1189740.1189742",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:57:52 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Context-aware, multi-channel Web applications are more
and more gaining consensus among both content providers
and consumers, but very few proposals exist for their
conceptual modeling. This article illustrates a
conceptual framework that provides modeling facilities
for context-aware, multichannel Web applications; it
also shows how high-level modeling constructs can drive
the application development process through automatic
code generation. Our work stresses the importance of
user-independent, context-triggered adaptation actions,
in which the context plays the role of a ``first
class'' actor, operating independently of users on the
same hypertext the users navigate. Modeling concepts
are based on WebML (Web Modeling Language), an already
established conceptual model for data-intensive Web
applications, which is also accompanied by a
development method and a CASE tool. However, given
their general validity, the concepts of this article
shape up a complete framework that can be adopted
independently of the chosen model, method, and tool.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "adaptive hypertext; conceptual modeling; context;
context-aware Web applications; context-awareness;
WebML",
}
@Article{Ding:2007:ESD,
author = "Xuhua Ding and Daniele Mazzocchi and Gene Tsudik",
title = "Equipping smart devices with public key signatures",
journal = j-TOIT,
volume = "7",
number = "1",
pages = "3:1--3:??",
month = feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1189740.1189743",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:57:52 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "One of the major recent trends in computing has been
towards so-called smart devices, such as PDAs, cell
phones and sensors. Such devices tend to have a feature
in common: limited computational capabilities and
equally limited power, as most operate on batteries.
This makes them ill-suited for public key signatures.
This article explores practical and conceptual
implications of using Server-Aided Signatures (SAS) for
these devices. SAS is a signature method that relies on
partially-trusted servers for generating (normally
expensive) public key signatures for regular users.
Although the primary goal is to aid small,
resource-limited devices in signature generation, SAS
also offers fast certificate revocation, signature
causality and reliable timestamping. It also has some
interesting features such as built-in attack detection
for users and DoS resistance for servers. Our
experimental results also validate the feasibility of
deploying SAS on smart devices.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "digital signatures; public key infrastructure",
}
@Article{Donato:2007:WGH,
author = "Debora Donato and Luigi Laura and Stefano Leonardi and
Stefano Millozzi",
title = "The {Web} as a graph: {How} far we are",
journal = j-TOIT,
volume = "7",
number = "1",
pages = "4:1--4:??",
month = feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1189740.1189744",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:57:52 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In this article we present an experimental study of
the properties of webgraphs. We study a large crawl
from 2001 of 200M pages and about 1.4 billion edges,
made available by the WebBase project at Stanford, as
well as several synthetic ones generated according to
various models proposed recently. We investigate
several topological properties of such graphs,
including the number of bipartite cores and strongly
connected components, the distribution of degrees and
PageRank values and some correlations; we present a
comparison study of the models against these
measures.Our findings are that (i) the WebBase sample
differs slightly from the (older) samples studied in
the literature, and (ii) despite the fact that these
models do not catch all of its properties, they do
exhibit some peculiar behaviors not found, for example,
in the models from classical random graph
theory.Moreover we developed a software library able to
generate and measure massive graphs in secondary
memory; this library is publicy available under the GPL
licence. We discuss its implementation and some
computational issues related to secondary memory graph
algorithms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "graph structure; models; World-Wide-Web",
}
@Article{Huang:2007:DDA,
author = "Yun Huang and Xianjun Geng and Andrew B. Whinston",
title = "Defeating {DDoS} attacks by fixing the incentive
chain",
journal = j-TOIT,
volume = "7",
number = "1",
pages = "5:1--5:??",
month = feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1189740.1189745",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:57:52 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Cooperative technological solutions for Distributed
Denial-of-Service (DDoS) attacks are already available,
yet organizations in the best position to implement
them lack incentive to do so, and the victims of DDoS
attacks cannot find effective methods to motivate them.
In this article we discuss two components of the
technological solutions to DDoS attacks: cooperative
filtering and cooperative traffic smoothing by caching.
We then analyze the broken incentive chain in each of
these technological solutions. As a remedy, we propose
usage-based pricing and Capacity Provision Networks,
which enable victims to disseminate enough incentive
along attack paths to stimulate cooperation against
DDoS attacks.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "denial-of-service; incentive; pricing; security",
}
@Article{Wong:2007:AWI,
author = "Tak-Lam Wong and Wai Lam",
title = "Adapting {Web} information extraction knowledge via
mining site-invariant and site-dependent features",
journal = j-TOIT,
volume = "7",
number = "1",
pages = "6:1--6:??",
month = feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1189740.1189746",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:57:52 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We develop a novel framework that aims at
automatically adapting previously learned information
extraction knowledge from a source Web site to a new
unseen target site in the same domain. Two kinds of
features related to the text fragments from the Web
documents are investigated. The first type of feature
is called, a site-invariant feature. These features
likely remain unchanged in Web pages from different
sites in the same domain. The second type of feature is
called a site-dependent feature. These features are
different in the Web pages collected from different Web
sites, while they are similar in the Web pages
originating from the same site. In our framework, we
derive the site-invariant features from previously
learned extraction knowledge and the items previously
collected or extracted from the source Web site. The
derived site-invariant features will be exploited to
automatically seek a new set of training examples in
the new unseen target site. Both the site-dependent
features and the site-invariant features of these
automatically discovered training examples will be
considered in the learning of new information
extraction knowledge for the target site. We conducted
extensive experiments on a set of real-world Web sites
collected from three different domains to demonstrate
the performance of our framework. For example, by just
providing training examples from one online book
catalog Web site, our approach can automatically
extract information from ten different book catalog
sites achieving an average precision and recall of
71.9\% and 84.0\% respectively without any further
manual intervention.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "machine learning; text mining; Web mining; wrapper
adaptation",
}
@Article{Villela:2007:PSA,
author = "Daniel Villela and Prashant Pradhan and Dan
Rubenstein",
title = "Provisioning servers in the application tier for
e-commerce systems",
journal = j-TOIT,
volume = "7",
number = "1",
pages = "7:1--7:??",
month = feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1189740.1189747",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:57:52 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Server providers that support e-commerce applications
as a service for multiple e-commerce Web sites
traditionally use a tiered server architecture. This
architecture includes an application tier to process
requests for dynamically generated content. How this
tier is provisioned can significantly impact a
provider's profit margin. In this article we study
methods to provision servers in the application serving
tier that increase a server provider's profits. First,
we examine actual traces of request arrivals to the
application tier of an e-commerce site, and show that
the arrival process is effectively Poisson. Next, we
construct an optimization problem in the context of a
set of application servers modeled as M / G /1/ PS
queueing systems, and derive three simple methods that
approximate the allocation that maximizes profits.
Simulation results demonstrate that our approximation
methods achieve profits that are close to optimal, and
are significantly higher than those achieved via simple
heuristics.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "electronic commerce; server provisioning",
}
@Article{Keromytis:2007:RSA,
author = "Angelos D. Keromytis and Jonathan M. Smith",
title = "Requirements for scalable access control and security
management architectures",
journal = j-TOIT,
volume = "7",
number = "2",
pages = "8:1--8:??",
month = may,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1239971.1239972",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:20 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Maximizing local autonomy by delegating functionality
to end nodes when possible (the end-to-end design
principle) has led to a scalable Internet. Scalability
and the capacity for distributed control have
unfortunately not extended well to resource
access-control policies and mechanisms. Yet management
of security is becoming an increasingly challenging
problem in no small part due to scaling up of measures
such as number of users, protocols, applications,
network elements, topological constraints, and
functionality expectations.\par
In this article, we discuss scalability challenges for
traditional access-control mechanisms at the
architectural level and present a set of fundamental
requirements for authorization services in large-scale
networks. We show why existing mechanisms fail to meet
these requirements and investigate the current design
options for a scalable access-control
architecture.\par
We argue that the key design options to achieve
scalability are the choice of the representation of
access control policy, the distribution mechanism for
policy, and the choice of the access-rights revocation
scheme. Although these ideas have been considered in
the past, current access-control systems in use
continue to use simpler but restrictive architectural
models. With this article, we hope to influence the
design of future access-control systems towards more
decentralized and scalable mechanisms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "access control; authorization; credentials;
delegation; distributed systems; large-scale systems;
security policy; trust management",
}
@Article{Baeza-Yates:2007:CNW,
author = "Ricardo Baeza-Yates and Carlos Castillo and Efthimis
N. Efthimiadis",
title = "Characterization of national {Web} domains",
journal = j-TOIT,
volume = "7",
number = "2",
pages = "9:1--9:??",
month = may,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1239971.1239973",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:20 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "During the last few years, several studies on the
characterization of the public Web space of various
national domains have been published. The pages of a
country are an interesting set for studying the
characteristics of the Web because at the same time
these are diverse (as they are written by several
authors) and yet rather similar (as they share a common
geographical, historical and cultural
context).\par
This article discusses the methodologies used for
presenting the results of Web characterization studies,
including the granularity at which different aspects
are presented, and a separation of concerns between
contents, links, and technologies. Based on this, we
present a side-by-side comparison of the results of 12
Web characterization studies, comprising over 120
million pages from 24 countries. The comparison unveils
similarities and differences between the collections
and sheds light on how certain results of a single Web
characterization study on a sample may be valid in the
context of the full Web.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "Web characterization; Web measurement",
}
@Article{Arion:2007:XQC,
author = "Andrei Arion and Angela Bonifati and Ioana Manolescu
and Andrea Pugliese",
title = "{XQueC}: a query-conscious compressed {XML} database",
journal = j-TOIT,
volume = "7",
number = "2",
pages = "10:1--10:??",
month = may,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1239971.1239974",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:20 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "XML compression has gained prominence recently because
it counters the disadvantage of the verbose
representation XML gives to data. In many applications,
such as data exchange and data archiving, entirely
compressing and decompressing a document is acceptable.
In other applications, where queries must be run over
compressed documents, compression may not be beneficial
since the performance penalty in running the query
processor over compressed data outweighs the data
compression benefits. While balancing the interests of
compression and query processing has received
significant attention in the domain of relational
databases, these results do not immediately translate
to XML data.\par
In this article, we address the problem of embedding
compression into XML databases without degrading query
performance. Since the setting is rather different from
relational databases, the choice of compression
granularity and compression algorithms must be
revisited. Query execution in the compressed domain
must also be rethought in the framework of XML query
processing due to the richer structure of XML data.
Indeed, a proper storage design for the compressed data
plays a crucial role here.\par
The XQ ue C system ( XQ uery Processor and C ompressor)
covers a wide set of XQuery queries in the compressed
domain and relies on a workload-based cost model to
perform the choices of the compression granules and of
their corresponding compression algorithms. As a
consequence, XQueC provides efficient query processing
on compressed XML data. An extensive experimental
assessment is presented, showing the effectiveness of
the cost model, the compression ratios, and the query
execution times.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "XML compression; XML data management; XML databases;
XQuery",
}
@Article{Zhou:2007:SAH,
author = "Jing Zhou and Wendy Hall and David C. {De Roure} and
Vijay K. Dialani",
title = "Supporting ad-hoc resource sharing on the {Web}: a
peer-to-peer approach to hypermedia link services",
journal = j-TOIT,
volume = "7",
number = "2",
pages = "11:1--11:??",
month = may,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1239971.1239975",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:20 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The key element to support ad-hoc resource sharing on
the Web is to discover resources of interest. The
hypermedia paradigm provides a way of overlaying a set
of resources with additional information in the form of
links to help people find other resources. However,
existing hypermedia approaches primarily develop
mechanisms to enable resource sharing in a fairly
static, centralized way. Recent developments in
distributed computing, on the other hand, introduced
peer-to-peer (P2P) computing that is notable for
employing distributed resources to perform a critical
function in a more dynamic and ad-hoc scenario. We
investigate the feasibility and potential benefits of
bringing together the P2P paradigm with the concept of
hypermedia link services to implement ad-hoc resource
sharing on the Web. This is accomplished by utilizing a
web-based Distributed Dynamic Link Service (DDLS) as a
testbed and addressing the issues arising from the
design, implementation, and enhancement of the service.
Our experimental result reveals the behavior and
performance of the semantics-based resource discovery
in DDLS and demonstrates that the proposed enhancing
technique for DDLS, topology reorganization, is
appropriate and efficient.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "distributed dynamic link service; open hypermedia;
peer-to-peer (P2P); reorganization; semantic search",
}
@Article{David:2007:ODE,
author = "Esther David and Alex Rogers and Nicholas R. Jennings
and Jeremy Schiff and Sarit Kraus and Michael H.
Rothkopf",
title = "Optimal design of {English} auctions with discrete bid
levels",
journal = j-TOIT,
volume = "7",
number = "2",
pages = "12:1--12:??",
month = may,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1239971.1239976",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:20 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article considers a canonical auction protocol
that forms the basis of nearly all current online
auctions. Such discrete bid auctions require that the
bidders submit bids at predetermined discrete bid
levels, and thus, there exists a minimal increment by
which the bid price may be raised. In contrast, the
academic literature of optimal auction design deals
almost solely with continuous bid auctions. As a
result, there is little practical guidance as to how an
auctioneer, seeking to maximize its revenue, should
determine the number and value of these discrete bid
levels, and it is this omission that is addressed here.
To this end, a model of an ascending price English
auction with discrete bid levels is considered. An
expression for the expected revenue of this auction is
derived and used to determine numerical and analytical
solutions for the optimal bid levels in the case of
uniform and exponential bidder's valuation
distributions. Finally, in order to develop an
intuitive understanding of how these optimal bid levels
are distributed, the limiting case where the number of
discrete bid levels is large is considered, and an
analytical expression for their distribution is
derived.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "discrete bids; English auction; optimal auction
design",
}
@Article{Gupta:2007:GEI,
author = "Amar Gupta and Satwiksai Seshasai",
title = "Guest editorial: {The Internet} and outsourcing",
journal = j-TOIT,
volume = "7",
number = "3",
pages = "13:1--13:??",
month = aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1275505.1275506",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:38 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Gupta:2007:HKF,
author = "Amar Gupta and Satwik Seshasai",
title = "24-hour knowledge factory: {Using Internet} technology
to leverage spatial and temporal separations",
journal = j-TOIT,
volume = "7",
number = "3",
pages = "14:1--14:??",
month = aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1275505.1275507",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:38 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Several of the outsourcing endeavors of today will
gradually converge to a hybrid outsourcing model that
will involve a team spread across three or more
strategically-located centers interconnected by
Internet technology. White-collar professionals in the
US, Australia, and Poland, for example, could each work
on a standard 9--5 basis, transfer the activity to a
colleague in the next center, thereby enabling work to
be performed on a round-the-clock basis. The effective
use of sequential workers in such a 24-hour knowledge
factory requires that professional tasks be broken down
to the level where individuals can work on them with
minimal interaction with their peers, and where new
approaches can be employed to reduce the effort
involved in transitioning from one employee to the
next. This article describes an Internet-based
prototype system that uses a Web-based interactive
approach, coupled with a unique data model, to optimize
collection and storage of design rationale and history
from stakeholders and workers. The idea of multiple
individuals acting as one ``composite persona'' is
explored in the context of facilitating tasks and
knowledge to be shared across the Internet in a
seamless manner. The article also describes related
activities in the commercial arena.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "geographic boundaries; global teams; knowledge
management; knowledge sharing; outsourcing; temporal
boundaries",
}
@Article{Dossani:2007:IRO,
author = "Rafiq Dossani and Nathan Denny",
title = "The {Internet}'s role in offshored services: a case
study of {India}",
journal = j-TOIT,
volume = "7",
number = "3",
pages = "15:1--15:??",
month = aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1275505.1275508",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:38 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Using India as a case study, this article analyzes how
the Internet influenced its export-oriented software
industry. We show that prior to the Internet, domestic
entrepreneurship was the key factor for the industry's
origin and growth. The industry suffered from
relatively low value-addition. As a result, domestic
firms, though they were industry leaders within India,
were followers of the global leadership provided by
transnational firms. With the arrival of the Internet,
there was a rise in the level of domain expertise. We
show that the Internet facilitated the transfer of
domain expertise for foreign firms more than it helped
the acquisition of domain expertise by domestic firms.
While the value-addition of the industry increased as a
result, industry leadership began to pass to foreign
firms. The strategic lesson for other countries trying
to rapidly develop an export-oriented software industry
is unambiguous: exclusive reliance on domestic
entrepreneurship will usually result in the domestic
industry falling behind its global competitors, while
granting unrestricted entry to transnational firms will
lead to the domestic firms losing industry leadership
in most cases.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "15",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "globalization; India; services; software",
}
@Article{Aron:2007:IIB,
author = "Ravi Aron and Siddarth Jayanty and Praveen Pathak",
title = "Impact of {Internet-based} distributed monitoring
systems on offshore sourcing of services",
journal = j-TOIT,
volume = "7",
number = "3",
pages = "16:1--16:??",
month = aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1275505.1275509",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:38 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The use of Internet-based distributed monitoring
systems has allowed firms to source services globally
that were hitherto thought of as being too risky or
complex to execute offshore. These systems enable
buyers of such services (clients) to monitor the
execution of processes in real-time and exert a degree
of managerial control over information workers of
another firm located in a distant region. Our research
shows that process codifiability plays a key role in
determining output quality. Further, we show that the
efforts made by the client and the provider in
monitoring work via Internet-based monitoring
mechanisms have a significant impact on output quality.
Finally, we show that these monitoring mechanisms
enable clients and providers of services to focus on
those processes that are best managed by each entity.
This scheme of optimal allocation of monitoring effort
is termed by us as the efficient monitoring frontier.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "16",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "efficient monitoring frontier; Internet-enabled
monitoring systems; knowledge continuum; offshore
outsourcing; real-time monitoring",
}
@Article{Xiong:2007:PDP,
author = "Li Xiong and Subramanyam Chitti and Ling Liu",
title = "Preserving data privacy in outsourcing data
aggregation services",
journal = j-TOIT,
volume = "7",
number = "3",
pages = "17:1--17:??",
month = aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1275505.1275510",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:38 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Advances in distributed service-oriented computing and
Internet technology have formed a strong technology
push for outsourcing and information sharing. There is
an increasing need for organizations to share their
data across organization boundaries both within the
country and with countries that may have lesser privacy
and security standards. Ideally, we wish to share
certain statistical data and extract the knowledge from
the private databases without revealing any additional
information of each individual database apart from the
aggregate result that is permitted. In this article, we
describe two scenarios for outsourcing data aggregation
services and present a set of decentralized
peer-to-peer protocols for supporting data sharing
across multiple private databases while minimizing the
data disclosure among individual parties. Our basic
protocols include a set of novel probabilistic
computation mechanisms for important primitive data
aggregation operations across multiple private
databases such as max, min, and top k selection. We
provide an analytical study of our basic protocols in
terms of precision, efficiency, and privacy
characteristics. Our advanced protocols implement an
efficient algorithm for performing k NN classification
across multiple private databases. We provide a set of
experiments to evaluate the proposed protocols in terms
of their correctness, efficiency, and privacy
characteristics.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "17",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "classification; confidentiality; outsourcing;
privacy",
}
@Article{Anand:2007:IIT,
author = "Sarabjot Singh Anand and Bamshad Mobasher",
title = "Introduction to intelligent techniques for {Web}
personalization",
journal = j-TOIT,
volume = "7",
number = "4",
pages = "18:1--18:??",
month = oct,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1278366.1278367",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:47 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "18",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ng:2007:MUP,
author = "Wilfred Ng and Lin Deng and Dik Lun Lee",
title = "Mining {User} preference using {Spy} voting for search
engine personalization",
journal = j-TOIT,
volume = "7",
number = "4",
pages = "19:1--19:??",
month = oct,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1278366.1278368",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:47 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article addresses search engine personalization.
We present a new approach to mining a user's
preferences on the search results from clickthrough
data and using the discovered preferences to adapt the
search engine's ranking function for improving search
quality. We develop a new preference mining technique
called SpyNB, which is based on the practical
assumption that the search results clicked on by the
user reflect the user's preferences but does not draw
any conclusions about the results that the user did not
click on. As such, SpyNB is still valid even if the
user does not follow any order in reading the search
results or does not click on all relevant results. Our
extensive offline experiments demonstrate that SpyNB
discovers many more accurate preferences than existing
algorithms do. The interactive online experiments
further confirm that SpyNB and our personalization
approach are effective in practice. We also show that
the efficiency of SpyNB is comparable to existing
simple preference mining algorithms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "19",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "clickthrough data; personalization; search engine;
user preferences",
}
@Article{Coyle:2007:SIW,
author = "Maurice Coyle and Barry Smyth",
title = "Supporting intelligent {Web} search",
journal = j-TOIT,
volume = "7",
number = "4",
pages = "20:1--20:??",
month = oct,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1278366.1278369",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:47 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Search engines continue to struggle to provide
everyday users with a service capable of delivering
focussed results that are relevant to their information
needs. Moreover, traditional search engines really only
provide users with a starting point for their
information search. That is, upon selecting a page from
a search result list, the interaction between user and
search engine is effectively over and the user must
continue their search alone. In this article, we argue
that a comprehensive search service needs to provide
the user with more help, both at the result list level
and beyond, and we outline some recommendations for
intelligent Web search support. We introduce the
SearchGuide Web search support system and we describe
how it fulfills the requirements for a search support
system, providing evaluation results where
applicable.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "20",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "collaborative search; explanation; interaction
history; personalization; visualisation; Web search",
}
@Article{Eirinaki:2007:WSP,
author = "Magdalini Eirinaki and Michalis Vazirgiannis",
title = "{Web} site personalization based on link analysis and
navigational patterns",
journal = j-TOIT,
volume = "7",
number = "4",
pages = "21:1--21:??",
month = oct,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1278366.1278370",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:47 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The continuous growth in the size and use of the World
Wide Web imposes new methods of design and development
of online information services. The need for predicting
the users' needs in order to improve the usability and
user retention of a Web site is more than evident and
can be addressed by personalizing it. Recommendation
algorithms aim at proposing ``next'' pages to users
based on their current visit and past users'
navigational patterns. In the vast majority of related
algorithms, however, only the usage data is used to
produce recommendations, disregarding the structural
properties of the Web graph. Thus important---in terms
of PageRank authority score---pages may be underrated.
In this work, we present UPR, a PageRank-style
algorithm which combines usage data and link analysis
techniques for assigning probabilities to Web pages
based on their importance in the Web site's
navigational graph. We propose the application of a
localized version of UPR ( l-UPR ) to personalized
navigational subgraphs for online Web page ranking and
recommendation. Moreover, we propose a hybrid
probabilistic predictive model based on Markov models
and link analysis for assigning prior probabilities in
a hybrid probabilistic model. We prove, through
experimentation, that this approach results in more
objective and representative predictions than the ones
produced from the pure usage-based approaches.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "21",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "link analysis; Markov models; recommendations;
usage-based PageRank; Web personalization",
}
@Article{Anand:2007:GSE,
author = "Sarabjot Singh Anand and Patricia Kearney and Mary
Shapcott",
title = "Generating semantically enriched user profiles for
{Web} personalization",
journal = j-TOIT,
volume = "7",
number = "4",
pages = "22:1--22:??",
month = oct,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1278366.1278371",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:47 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Traditional collaborative filtering generates
recommendations for the active user based solely on
ratings of items by other users. However, most
businesses today have item ontologies that provide a
useful source of content descriptors that can be used
to enhance the quality of recommendations generated. In
this article, we present a novel approach to
integrating user rating vectors with an item ontology
to generate recommendations. The approach is novel in
measuring similarity between users in that it first
derives factors, referred to as impacts, driving the
observed user behavior and then uses these factors
within the similarity computation. In doing so, a more
comprehensive user model is learned that is sensitive
to the context of the user visit.\par
An evaluation of our recommendation algorithm was
carried out using data from an online retailer of
movies with over 94,000 movies, 44,000 actors, and
10,000 directors within the item knowledge base. The
evaluation showed a statistically significant
improvement in the prediction accuracy over traditional
collaborative filtering. Additionally, the algorithm
was shown to generate recommendations for visitors that
belong to sparse sections of the user space, areas
where traditional collaborative filtering would
generally fail to generate accurate recommendations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "22",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "collaborative filtering; evaluation; implicit ratings;
personalization; similarity metric",
}
@Article{Mobasher:2007:TTR,
author = "Bamshad Mobasher and Robin Burke and Runa Bhaumik and
Chad Williams",
title = "Toward trustworthy recommender systems: an analysis of
attack models and algorithm robustness",
journal = j-TOIT,
volume = "7",
number = "4",
pages = "23:1--23:??",
month = oct,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1278366.1278372",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:47 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Publicly accessible adaptive systems such as
collaborative recommender systems present a security
problem. Attackers, who cannot be readily distinguished
from ordinary users, may inject biased profiles in an
attempt to force a system to ``adapt'' in a manner
advantageous to them. Such attacks may lead to a
degradation of user trust in the objectivity and
accuracy of the system. Recent research has begun to
examine the vulnerabilities and robustness of different
collaborative recommendation techniques in the face of
``profile injection'' attacks. In this article, we
outline some of the major issues in building secure
recommender systems, concentrating in particular on the
modeling of attacks and their impact on various
recommendation algorithms. We introduce several new
attack models and perform extensive simulation-based
evaluations to show which attacks are most successful
and practical against common recommendation techniques.
Our study shows that both user-based and item-based
algorithms are highly vulnerable to specific attack
models, but that hybrid algorithms may provide a higher
degree of robustness. Using our formal characterization
of attack models, we also introduce a novel
classification-based approach for detecting attack
profiles and evaluate its effectiveness in neutralizing
attacks.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "23",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "attack detection; collaborative filtering; profile
injection attacks; recommender systems; shilling",
}
@Article{Medjahed:2007:ISI,
author = "Brahim Medjahed and Athman Bouguettaya and Boualem
Benatallah",
title = "Introduction to special issue on semantic {Web}
services",
journal = j-TOIT,
volume = "8",
number = "1",
pages = "1:1--1:??",
month = nov,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1294148.1294149",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:59 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Toch:2007:SAA,
author = "Eran Toch and Avigdor Gal and Iris Reinhartz-Berger
and Dov Dori",
title = "A semantic approach to approximate service retrieval",
journal = j-TOIT,
volume = "8",
number = "1",
pages = "2:1--2:??",
month = nov,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1294148.1294150",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:59 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Web service discovery is one of the main applications
of semantic Web services, which extend standard Web
services with semantic annotations. Current discovery
solutions were developed in the context of automatic
service composition. Thus, the ``client'' of the
discovery procedure is an automated computer program
rather than a human, with little, if any, tolerance to
inexact results. However, in the real world, services
which might be semantically distanced from each other
are glued together using manual coding. In this
article, we propose a new retrieval model for semantic
Web services, with the objective of simplifying service
discovery for human users. The model relies on simple
and extensible keyword-based query language and enables
efficient retrieval of approximate results, including
approximate service compositions. Since representing
all possible compositions and all approximate concept
references can result in an exponentially-sized index,
we investigate clustering methods to provide a scalable
mechanism for service indexing. Results of experiments,
designed to evaluate our indexing and query methods,
show that satisfactory approximate search is feasible
with efficient processing time.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "ontology; Semantic Web; service retrieval; Web
service",
}
@Article{Brambilla:2007:MDD,
author = "Marco Brambilla and Stefano Ceri and Federico Michele
Facca and Irene Celino and Dario Cerizza and Emanuele
Della Valle",
title = "Model-driven design and development of semantic {Web}
service applications",
journal = j-TOIT,
volume = "8",
number = "1",
pages = "3:1--3:??",
month = nov,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1294148.1294151",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:59 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article proposes a model-driven methodology to
design and develop semantic Web service applications
and their components, described according to the
emerging WSMO standard. In particular, we show that
business processes and Web engineering models have
sufficient expressive power to support the
semiautomatic extraction of semantic descriptions
(i.e., WSMO ontologies, goals, Web services, and
mediators), thus partially hiding the complexity of
dealing with semantics. Our method is based on existing
models for the specification of business processes
(BPMN) combined with Web engineering models for
designing and developing semantically rich Web
applications (WebML). The proposed approach leads from
an abstract view of the business needs to a concrete
implementation of the application by means of several
design steps; high-level models are transformed into
software components. Our framework increases the
efficiency of the whole design process, yielding to the
construction of semantic Web service applications
spanning over several enterprises.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "Semantic Web service; WebML; WSMO",
}
@Article{Mrissa:2007:CBM,
author = "Michael Mrissa and Chirine Ghedira and Djamal
Benslimane and Zakaria Maamar and Florian Rosenberg and
Schahram Dustdar",
title = "A context-based mediation approach to compose semantic
{Web} services",
journal = j-TOIT,
volume = "8",
number = "1",
pages = "4:1--4:??",
month = nov,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1294148.1294152",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:59 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Web services composition is a keystone in the
development of interoperable systems. However, despite
the widespread adoption of Web services, several
obstacles still hinder their smooth automatic semantic
reconciliation when being composed. Consistent
understanding of data exchanged between composed Web
services is hampered by various implicit modeling
assumptions and representations. Our contribution in
this article revolves around context and how it
enriches data exchange between Web services. In
particular, a context-based mediation approach to solve
semantic heterogeneities between composed Web services
is presented.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "composition; context; mediation; semantics; Web
services",
}
@Article{Shehab:2007:WSD,
author = "Mohamed Shehab and Kamal Bhattacharya and Arif
Ghafoor",
title = "{Web} services discovery in secure collaboration
environments",
journal = j-TOIT,
volume = "8",
number = "1",
pages = "5:1--5:??",
month = nov,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1294148.1294153",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:58:59 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Multidomain application environments where distributed
domains interoperate with each other is a reality in
Web-services-based infrastructures. Collaboration
enables domains to effectively share resources;
however, it introduces several security and privacy
challenges. In this article, we use the current web
service standards such as SOAP and UDDI to enable
secure interoperability in a service-oriented
mediator-free environment. We propose a multihop SOAP
messaging protocol that enables domains to discover
secure access paths to access roles in different
domains. Then we propose a path authentication
mechanism based on the encapsulation of SOAP messages
and the SOAP-DISG standard. Furthermore, we provide a
service discovery protocol that enables domains to
discover service descriptions stored in private UDDI
registries.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "encapsulated SOAP; private UDDI registries; protocols;
secure access paths; secure collaboration; services",
}
@Article{Li:2008:ISI,
author = "Qing Li and Rynson W. H. Lau and Timothy Shih and
Dennis McLeod",
title = "Introduction to special issue {Internet} technologies
for distance education",
journal = j-TOIT,
volume = "8",
number = "2",
pages = "1:1--1:??",
month = feb,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1323651.1323652",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:59:09 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Tu:2008:NLA,
author = "Xuping Tu and Hai Jin and Xiaofei Liao and Jiannong
Cao",
title = "Nearcast: a locality-aware {P2P} live streaming
approach for distance education",
journal = j-TOIT,
volume = "8",
number = "2",
pages = "2:1--2:??",
month = feb,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1323651.1323653",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:59:09 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Peer-to-peer (P2P) live video streaming has been
widely used in distance education applications to
deliver the captured video courses to a large number of
online students. By allowing peers serving each other
in the network, P2P technology overcomes many
limitations in the traditional client-server paradigm
to achieve user and bandwidth scalabilities. However,
existing systems do not perform well when the number of
online students increases, and the system performance
degrades seriously. One of the reasons is that the
construction of the peer overlay in existing P2P
systems has not considered the underlying physical
network topology and can cause serious topology
mismatch between the P2P overlay network and the
physical network. The topology mismatch problem brings
great link stress (unnecessary traffic) in the Internet
infrastructure and greatly degrades the system
performance. In this article, we address this problem
and propose a locality-aware P2P overlay construction
method, called Nearcast, which builds an efficient
overlay multicast tree by letting each peer node choose
physically closer nodes as its logical children.\par
We have conducted extensive simulations to evaluate the
performance of Nearcast in comparison with the existing
RTT and NICE protocols. Also, Nearcast has been
deployed on a wide-area network testbed to delivery
video coursed to about 7200 users distributed across
100 collages in 32 cities in China. The experimental
results show that Nearcast leads to lower link stress
and shorter end-to-end latencies compared with the RTT
and NICE protocols.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "distance education; live streaming; peer-to-peer;
video",
}
@Article{Dolog:2008:PAL,
author = "Peter Dolog and Bernd Simon and Wolfgang Nejdl and
Toma{\v{z}} Klobu{\v{c}}ar",
title = "Personalizing access to learning networks",
journal = j-TOIT,
volume = "8",
number = "2",
pages = "3:1--3:??",
month = feb,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1323651.1323654",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:59:09 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In this article, we describe a Smart Space for
Learning\TM{} (SS4L) framework and infrastructure that
enables personalized access to distributed
heterogeneous knowledge repositories. Helping a learner
to choose an appropriate learning resource or activity
is a key problem which we address in this framework,
enabling personalized access to federated learning
repositories with a vast number of learning offers. Our
infrastructure includes personalization strategies both
at the query and the query results level. Query
rewriting is based on learning and language
preferences; rule-based and ranking-based
personalization improves these results further.
Rule-based reasoning techniques are supported by formal
ontologies we have developed based on standard
information models for learning domains; ranking-based
recommendations are supported through ensuring minimal
sets of predicates appearing in query results. Our
evaluation studies show that the implemented solution
enables learners to find relevant learning resources in
a distributed environment and through goal-based
personalization improves relevancy of results.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "learning networks; ontologies; personalization;
personalized access; semantic Web",
}
@Article{Salomoni:2008:MBS,
author = "Paola Salomoni and Silvia Mirri and Stefano Ferretti
and Marco Roccetti",
title = "A multimedia broker to support accessible and mobile
learning through learning objects adaptation",
journal = j-TOIT,
volume = "8",
number = "2",
pages = "4:1--4:??",
month = feb,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1323651.1323655",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:59:09 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The large diffusion of e-learning technologies
represents a great opportunity for underserved segments
of population. This is particularly true for people
with disabilities for whom digital barriers should be
overstepped with the aim of reengaging them back into
society to education. In essence, before a mass of
learners can be engaged in a collective educational
process, each single member should be put in the
position to enjoy accessible and customized educational
experiences, regardless of the wide diversity of their
personal characteristics and technological equipment.
To respond to this demand, we developed LOT (Learning
Object Transcoder), a distributed PHP-based
service-oriented system designed to deliver flexible
and customized educational services for a multitude of
learners, each with his/her own diverse preferences and
needs. The main novelty of LOT amounts to a broking
service able to manage the transcoding activities
needed to convert multimedia digital material into the
form which better fits a given student profile.
Transcoding activities are performed based on the use
of Web service technologies. Experimental results
gathered from several field trials with LOT (available
online at \path=http://137.204.74.83/~lot/=) have
confirmed the viability of our approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "accessibility; content transcoding; device profiling;
e-learning; mobile-learning; multimedia adaptation;
user profiling",
}
@Article{Li:2008:TSD,
author = "Qing Li and Rynson W. H. Lau and Timothy K. Shih and
Frederick W. B. Li",
title = "Technology supports for distributed and collaborative
learning over the {Internet}",
journal = j-TOIT,
volume = "8",
number = "2",
pages = "5:1--5:??",
month = feb,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1323651.1323656",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:59:09 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "With the advent of Internet and World Wide Web (WWW)
technologies, distance education (e-learning or
Web-based learning) has enabled a new era of education.
There are a number of issues that have significant
impact on distance education, including those from
educational, sociological, and psychological
perspectives. Rather than attempting to cover
exhaustively all the related perspectives, in this
survey article, we focus on the technological issues. A
number of technology issues are discussed, including
distributed learning, collaborative learning,
distributed content management, mobile and situated
learning, and multimodal interaction and augmented
devices for e-learning. Although we have tried to
include the state-of-the-art technologies and systems
here, it is anticipated that many new ones will emerge
in the near future. As such, we point out several
emerging issues and technologies that we believe are
promising, for the purpose of highlighting important
directions for future research.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "collaborative learning; distance learning
technologies; distributed content management;
distributed learning",
}
@Article{Mahmoud:2008:GES,
author = "Qusay H. Mahmoud and Peter Langendoerfer",
title = "Guest editorial: {Service-oriented} computing",
journal = j-TOIT,
volume = "8",
number = "3",
pages = "11:1--11:??",
month = may,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1361186.1361187",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:59:21 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{VanEngelen:2008:FSO,
author = "Robert A. {Van Engelen}",
title = "A framework for service-oriented computing with {C}
and {C++ Web} service components",
journal = j-TOIT,
volume = "8",
number = "3",
pages = "12:1--12:??",
month = may,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1361186.1361188",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:59:21 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Service-oriented architectures use loosely coupled
software services to support the requirements of
business processes and software users. Several software
engineering challenges have to be overcome to expose
legacy C and C++ applications and specialized system
resources as XML-based software services. It is
critical to devise effective bindings between XML and
C/C++ data to efficiently interoperate with other
XML-based services. Binding application data to XML has
many software solutions, ranging from generic document
object models to idiosyncratic type mappings. A safe
binding must conform to XML validation constraints,
guarantee type safety, and should preserve the
structural integrity of communicated application data.
However, tight XML bindings impose mapping constraints
that can hamper interoperability between services. This
paper presents a framework for constructing loosely
coupled C/C++ services based on a programming model
that integrates XML bindings into the C and C++ syntax.
The concepts behind the bindings are generic, which
makes the approach applicable to other programming
languages.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "service-oriented computing; Web services standards",
}
@Article{vanderAalst:2008:CCS,
author = "Wil M. P. van der Aalst and Marlon Dumas and Chun
Ouyang and Anne Rozinat and Eric Verbeek",
title = "Conformance checking of service behavior",
journal = j-TOIT,
volume = "8",
number = "3",
pages = "13:1--13:??",
month = may,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1361186.1361189",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:59:21 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "A service-oriented system is composed of independent
software units, namely services, that interact with one
another exclusively through message exchanges. The
proper functioning of such system depends on whether or
not each individual service behaves as the other
services expect it to behave. Since services may be
developed and operated independently, it is unrealistic
to assume that this is always the case. This article
addresses the problem of checking and quantifying how
much the actual behavior of a service, as recorded in
message logs, conforms to the expected behavior as
specified in a process model. We consider the case
where the expected behavior is defined using the BPEL
industry standard (Business Process Execution Language
for Web Services). BPEL process definitions are
translated into Petri nets and Petri net-based
conformance checking techniques are applied to derive
two complementary indicators of conformance: fitness
and appropriateness. The approach has been implemented
in a toolset for business process analysis and mining,
namely ProM, and has been tested in an environment
comprising multiple Oracle BPEL servers.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "BPEL; conformance; Petri nets; ProM; Web services",
}
@Article{Jin:2008:QAS,
author = "Jingwen Jin and Klara Nahrstedt",
title = "{QoS}-aware service management for component-based
distributed applications",
journal = j-TOIT,
volume = "8",
number = "3",
pages = "14:1--14:??",
month = may,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1361186.1361190",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:59:21 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Component-based software development has evolved from
a tightly coupled style to a loosely coupled style in
the recent few years. The paradigm shift will
eventually allow heterogeneous systems to interoperate
in open networks such as the Internet and will make
software development more of a management task than a
development task. Envisioning that future applications
may comprise dynamically aggregated component services
possibly distributed widely, we develop a Quality of
Service (QoS)-aware service management framework in the
middleware layer to make the component services
infrastructure transparent to the applications.
Specifically, we manage services not only as
individuals, but more importantly as meaningful
aggregated entities based on the logical compositional
needs coming from the applications, by composing
services properly according to QoS requirements at
application setup time, and performing continuous
maintenance at application runtime seamlessly. Our
service management framework is scalable in two
dimensions: network size and application's client
population size. Specifically, the framework employs a
decentralized management solution that scales to large
network size, and explores resource sharing in
one-to-many group-based applications by means of
multicasting mechanisms. Moreover, it incorporates
local adaptation operations and distributed failure
detection, reporting, and recovery mechanisms to deal
with runtime resource fluctuations and failures.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "application-level routing; fault tolerance; multicast;
overlay networks; QoS; Service composition; service
management; SOA",
}
@Article{Zdun:2008:PBD,
author = "Uwe Zdun",
title = "Pattern-based design of a service-oriented middleware
for remote object federations",
journal = j-TOIT,
volume = "8",
number = "3",
pages = "15:1--15:??",
month = may,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1361186.1361191",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Jun 16 10:59:21 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Service-oriented middleware architectures should
enable the rapid realization of loosely coupled
services. Unfortunately, existing technologies used for
service-oriented middleware architectures, such as Web
services, P2P systems, coordination and cooperation
technologies, and spontaneous networking, do not fully
support all requirements in the realm of loosely
coupled business services yet. Typical problems that
arise in many business domains are for instance missing
central control, complex cooperation models, complex
lookup models, or issues regarding dynamic deployment.
We used a pattern-based approach to identify the well
working solutions in the different technologies for
loosely coupled services. Then we reused this design
knowledge in our concept for a service-oriented
middleware. This concept is centered around a
controlled environment, called a federation. Each
remote object (a peer service) is controlled in one or
more federations, but within this environment peers can
collaborate in a simple-to-use, loosely coupled, and ad
hoc style of communication. A semantic lookup service
is used to let the peers publish rich metadata about
themselves to their fellow peers.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "15",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "middleware; Service-oriented Architecture; software
patterns",
}
@Article{Herzberg:2008:SII,
author = "Amir Herzberg and Ahmad Jbara",
title = "Security and identification indicators for browsers
against spoofing and phishing attacks",
journal = j-TOIT,
volume = "8",
number = "4",
pages = "16:1--16:??",
month = sep,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1391949.1391950",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Oct 1 16:09:01 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In spite of the use of standard Web security measures
(SSL/TLS), users enter sensitive information such as
passwords into fake Web sites. Such fake sites cause
substantial damages to individuals and corporations. In
this work, we identify several vulnerabilities of
browsers, focusing on security and identification
indicators.\par
We present improved security and identification
indicators, as we implemented in TrustBar, a browser
extension we developed. With TrustBar, users can assign
a name or logo to identify SSL/TLS-protected sites; if
users did not assign a name or logo, TrustBar
identifies protected sites by the name or logo of the
site, and by the certificate authority (CA) who
identified the site.\par
We present usability experiments which compared
TrustBar's indicators to the basic indicators available
in most browsers (padlock, URL, and https prefix), and
some relevant secure-usability principles.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "16",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "human-computer interaction; phishing; secure
usability; Web spoofing",
}
@Article{Gupta:2008:SAI,
author = "Manish Gupta and Shamik Banerjee and Manish Agrawal
and H. Raghav Rao",
title = "Security analysis of {Internet} technology components
enabling globally distributed workplaces --- a
framework",
journal = j-TOIT,
volume = "8",
number = "4",
pages = "17:1--17:??",
month = sep,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1391949.1391951",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Oct 1 16:09:01 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "As organizations increasingly operate, compete, and
cooperate in a global context, business processes are
also becoming global to propagate the benefits from
coordination and standardization across geographical
boundaries. In this context, security has gained
significance due to increased threats, as well as
legislation and compliance issues. This article
presents a framework for assessing the security of
Internet technology components that support a globally
distributed workplace. Four distinct information flow
and design architectures are identified based on
location sensitivities and placements of the
infrastructure components. Using a combination of
scenarios, architectures, and technologies, the article
presents the framework of a development tool for
information security officers to evaluate the security
posture of an information system. To aid managers in
better understanding their options to improve security
of the system, we also propose a three-dimensional
representation, based on the framework, for embedding
solution alternatives. To demonstrate its use in a
real-world context, the article also applies the
framework to assess a globally distributed workforce
application at a northeast financial institution.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "17",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "globally distributed workforce; Internet applications;
risk management; security analysis",
}
@Article{Albrecht:2008:DIT,
author = "Jeannie Albrecht and David Oppenheimer and Amin Vahdat
and David A. Patterson",
title = "Design and implementation trade-offs for wide-area
resource discovery",
journal = j-TOIT,
volume = "8",
number = "4",
pages = "18:1--18:??",
month = sep,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1391949.1391952",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Oct 1 16:09:01 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We describe the design and implementation of SWORD, a
scalable resource discovery service for wide-area
distributed systems. In contrast to previous systems,
SWORD allows users to describe desired resources as a
topology of interconnected groups with required
intragroup, intergroup, and per-node characteristics,
along with the utility that the application derives
from specified ranges of metric values. This design
gives users the flexibility to find geographically
distributed resources for applications that are
sensitive to both node and network characteristics, and
allows the system to rank acceptable configurations
based on their quality for that application.\par
Rather than evaluating a single implementation of
SWORD, we explore a variety of architectural designs
that deliver the required functionality in a scalable
and highly available manner. We discuss the trade-offs
of using a centralized architecture as compared to a
fully decentralized design to perform wide-area
resource discovery. To summarize our results, we found
that a centralized architecture based on 4-node server
cluster sites at network-peering facilities outperforms
a decentralized DHT-based resource discovery
infrastructure with respect to query latency for all
but the smallest number of sites. However, although a
centralized architecture shows significant promise in
stable environments, we find that our decentralized
implementation has acceptable performance and also
benefits from the DHT's self-healing properties in more
volatile environments. We evaluate the advantages and
disadvantages of centralized and distributed resource
discovery architectures on 1000 hosts in emulation and
on approximately 200 PlanetLab nodes spread across the
Internet.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "18",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "PlanetLab; resource discovery",
}
@Article{Brogi:2008:SBC,
author = "Antonio Brogi and Sara Corfini and Razvan Popescu",
title = "Semantics-based composition-oriented discovery of
{Web} services",
journal = j-TOIT,
volume = "8",
number = "4",
pages = "19:1--19:??",
month = sep,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1391949.1391953",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Oct 1 16:09:01 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Service discovery and service aggregation are two
crucial issues in the emerging area of service-oriented
computing (SOC). We propose a new technique for the
discovery of (Web) services that accounts for the need
of composing several services to satisfy a client
query. The proposed algorithm makes use of OWL-S
ontologies, and explicitly returns the sequence of
atomic process invocations that the client must perform
in order to achieve the desired result. When no full
match is possible, the algorithm features a flexible
matching by returning partial matches and by suggesting
additional inputs that would produce a full match.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "19",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "matchmaking algorithms; OWL-S ontologies; Web service
composition; Web service discovery",
}
@Article{Zhuge:2008:RSM,
author = "Hai Zhuge and Yunpeng Xing and Peng Shi",
title = "Resource space model, {OWL} and database: {Mapping}
and integration",
journal = j-TOIT,
volume = "8",
number = "4",
pages = "20:1--20:??",
month = sep,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1391949.1391954",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Oct 1 16:09:01 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Semantics exhibits diversity in the real world, mental
abstraction world, document world, and machine world.
Studying mappings between different forms of semantics
helps unveil the uniformity in the diversity. This
article investigates the mappings between three typical
semantic models: the Web ontology language (OWL),
relational database model, and resource space model (a
classification-based semantic model). By establishing
mappings between the semantic primitives of the three
models, we study the mapping from OWL description onto
resource space and analyze the normal forms of the
generated resource space. Mapping back from resource
space onto OWL description is then discussed. Further,
we investigate the mapping between OWL description and
relational database, as well as the mapping between
relational database and resource space. Normal forms of
the generated relational tables are analyzed. To
support advanced applications on the future Web, we
suggest integrating the resource space, OWL, and
databases to form a powerful semantic platform that
enables different semantic models to enhance each
other.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "20",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "integration; mapping; relational database model;
resource space model; semantic link network; Semantic
Web; Web ontology language",
}
@Article{Xue:2008:IWS,
author = "Xiao-Bing Xue and Zhi-Hua Zhou and Zhongfei (Mark)
Zhang",
title = "Improving {Web} search using image snippets",
journal = j-TOIT,
volume = "8",
number = "4",
pages = "21:1--21:??",
month = sep,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1391949.1391955",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Oct 1 16:09:01 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Web has become the largest information repository
in the world; thus, effectively and efficiently
searching the Web becomes a key challenge. Interactive
Web search divides the search process into several
rounds, and for each round the search engine interacts
with the user for more knowledge of the user's
information requirement. Previous research mainly uses
the text information on Web pages, while little
attention is paid to other modalities. This article
shows that Web search performance can be significantly
improved if imagery is considered in interactive Web
search. Compared with text, imagery has its own
advantage: the time for ``reading'' an image is as
little as that for reading one or two words, while the
information brought by an image is as much as that
conveyed by a whole passage of text. In order to
exploit the advantages of imagery, a novel interactive
Web search framework is proposed, where {\em image
snippets\/} are first extracted from Web pages and then
provided, along with the text snippets, to the user for
result presentation and relevance feedback, as well as
being presented alone to the user for image suggestion.
User studies show that it is more convenient for the
user to identify the Web pages he or she expects and to
reformulate the initial query. Further experiments
demonstrate the promise of introducing multimodal
techniques into the proposed interactive Web search
framework.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "21",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "image snippet; image suggestion; interactive Web
search; multimodality; relevance feedback; term
suggestion",
}
@Article{Urgaonkar:2009:ROA,
author = "Bhuvan Urgaonkar and Prashant Shenoy and Timothy
Roscoe",
title = "Resource overbooking and application profiling in a
shared {Internet} hosting platform",
journal = j-TOIT,
volume = "9",
number = "1",
pages = "1:1--1:??",
month = feb,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1462159.1462160",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Feb 19 14:20:34 MST 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In this article, we present techniques for
provisioning CPU and network resources in shared
Internet hosting platforms running potentially
antagonistic third-party applications. The primary
contribution of our work is to demonstrate the
feasibility and benefits of overbooking resources in
shared Internet platforms. Since an accurate estimate
of an application's resource needs is necessary when
overbooking resources, we present techniques to profile
applications on dedicated nodes, possibly while in
service, and use these profiles to guide the placement
of application components onto shared nodes. We then
propose techniques to overbook cluster resources in a
controlled fashion. We outline an empirical approach to
determine the degree of overbooking that allows a
platform to achieve improvements in revenue while
providing performance guarantees to Internet
applications. We show how our techniques can be
combined with commonly used QoS resource allocation
mechanisms to provide application isolation and
performance guarantees at run-time. We implement our
techniques in a Linux cluster and evaluate them using
common server applications. We find that the efficiency
(and consequently revenue) benefits from controlled
overbooking of resources can be dramatic. Specifically,
we find that overbooking resources by as little as 1\%
we can increase the utilization of the cluster by a
factor of two, and a 5\% overbooking yields a
300--500\% improvement, while still providing useful
resource guarantees to applications.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "capsule; dedicated hosting platform; high percentile;
Internet application; placement; profile;
quality-of-service; resource overbooking; shared
hosting platform; yield management",
}
@Article{Stein:2009:FPW,
author = "Sebastian Stein and Terry R. Payne and Nicholas R.
Jennings",
title = "Flexible provisioning of {Web} service workflows",
journal = j-TOIT,
volume = "9",
number = "1",
pages = "2:1--2:??",
month = feb,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1462159.1462161",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Feb 19 14:20:34 MST 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Web services promise to revolutionize the way
computational resources and business processes are
offered and invoked in open, distributed systems, such
as the Internet. These services are described using
machine-readable metadata, which enables consumer
applications to automatically discover and provision
suitable services for their workflows at run-time.
However, current approaches have typically assumed
service descriptions are accurate and deterministic,
and so have neglected to account for the fact that
services in these open systems are inherently
unreliable and uncertain. Specifically, network
failures, software bugs and competition for services
may regularly lead to execution delays or even service
failures. To address this problem, the process of
provisioning services needs to be performed in a more
flexible manner than has so far been considered, in
order to proactively deal with failures and to recover
workflows that have partially failed. To this end, we
devise and present a heuristic strategy that varies the
provisioning of services according to their predicted
performance. Using simulation, we then benchmark our
algorithm and show that it leads to a 700\% improvement
in average utility, while successfully completing up to
eight times as many workflows as approaches that do not
consider service failures.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "semantic Web services; service composition; service
provisioning; service-oriented computing; Web services;
workflows",
}
@Article{Groth:2009:MPD,
author = "Paul Groth and Simon Miles and Luc Moreau",
title = "A model of process documentation to determine
provenance in mash-ups",
journal = j-TOIT,
volume = "9",
number = "1",
pages = "3:1--3:??",
month = feb,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1462159.1462162",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Feb 19 14:20:34 MST 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Through technologies such as RSS (Really Simple
Syndication), Web Services, and AJAX (Asynchronous
JavaScript and XML), the Internet has facilitated the
emergence of applications that are composed from a
variety of services and data sources. Through tools
such as Yahoo Pipes, these ``mash-ups'' can be composed
in a dynamic, just-in-time manner from components
provided by multiple institutions (i.e., Google,
Amazon, your neighbor). However, when using these
applications, it is not apparent where data comes from
or how it is processed. Thus, to inspire trust and
confidence in mash-ups, it is critical to be able to
analyze their processes after the fact. These {\em
trailing analyses}, in particular the determination of
the provenance of a result (i.e., the process that led
to it), are enabled by {\em process documentation},
which is documentation of an application's past process
created by the components of that application at
execution time. In this article, we define a generic
conceptual data model that supports the autonomous
creation of attributable, factual process documentation
for dynamic multi-institutional applications. The data
model is instantiated using two Internet formats, OWL
and XML, and is evaluated with respect to questions
about the provenance of results generated by a complex
bioinformatics mash-up.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "concept maps; data model; mash-ups; Process; process
documentation; provenance",
}
@Article{Ruffo:2009:PPR,
author = "Giancarlo Ruffo and Rossano Schifanella",
title = "A peer-to-peer recommender system based on spontaneous
affinities",
journal = j-TOIT,
volume = "9",
number = "1",
pages = "4:1--4:??",
month = feb,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1462159.1462163",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Feb 19 14:20:34 MST 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Network analysis has proved to be very useful in many
social and natural sciences, and in particular Small
World topologies have been exploited in many
application fields. In this article, we focus on P2P
file sharing applications, where spontaneous
communities of users are studied and analyzed. We
define a family of structures that we call ``Affinity
Networks'' (or even Graphs) that show self-organized
interest-based clusters. Empirical evidence proves that
affinity networks are small worlds and shows scale-free
features. The relevance of this finding is augmented
with the introduction of a proactive recommendation
scheme, namely {\em DeHinter}, that exploits this
natural feature. The intuition behind this scheme is
that a user would trust her network of ``elective
affinities'' more than anonymous and generic
suggestions made by impersonal entities. The accuracy
of the recommendation is evaluated by way of a 10-fold
cross validation, and a prototype has been implemented
for further feedbacks from the users.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "complex networks; file sharing systems; Peer-to-Peer;
recommender system; social networks",
}
@Article{Jordan:2009:IIA,
author = "Scott Jordan",
title = "Implications of {Internet} architecture on net
neutrality",
journal = j-TOIT,
volume = "9",
number = "2",
pages = "5:1--5:??",
month = may,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1516539.1516540",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu May 7 15:04:10 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Net neutrality represents the idea that Internet users
are entitled to service that does not discriminate on
the basis of source, destination, or ownership of
Internet traffic. The United States Congress is
considering legislation on net neutrality, and debate
over the issue has generated intense lobbying.
Congressional action will substantially affect the
evolution of the Internet and of future Internet
research. In this article, we argue that neither the
pro nor anti net neutrality positions are consistent
with the philosophy of Internet architecture. We
develop a net neutrality policy founded on a
segmentation of Internet services into infrastructure
services and application services, based on the
Internet's layered architecture. Our net neutrality
policy restricts an Internet service Provider's ability
to engage in anticompetitive behavior while
simultaneously ensuring that it can use desirable forms
of network management. We illustrate the effect of this
policy by discussing acceptable and unacceptable uses
of network management.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ehrenkranz:2009:SIS,
author = "Toby Ehrenkranz and Jun Li",
title = "On the state of {IP} spoofing defense",
journal = j-TOIT,
volume = "9",
number = "2",
pages = "6:1--6:??",
month = may,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1516539.1516541",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu May 7 15:04:10 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "IP source address spoofing has plagued the Internet
for many years. Attackers spoof source addresses to
mount attacks and redirect blame. Researchers have
proposed many mechanisms to defend against spoofing,
with varying levels of success. With the defense
mechanisms available today, where do we stand? How do
the various defense mechanisms compare? This article
first looks into the current state of IP spoofing, then
thoroughly surveys the current state of IP spoofing
defense. It evaluates data from the Spoofer Project,
and describes and analyzes host-based defense methods,
router-based defense methods, and their combinations.
It further analyzes what obstacles stand in the way of
deploying those modern solutions and what areas require
further research.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "IP spoofing; packet filtering; spoofing defense;
spoofing packet",
}
@Article{Fazzinga:2009:RXD,
author = "Bettina Fazzinga and Sergio Flesca and Andrea
Pugliese",
title = "Retrieving {XML} data from heterogeneous sources
through vague querying",
journal = j-TOIT,
volume = "9",
number = "2",
pages = "7:1--7:??",
month = may,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1516539.1516542",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu May 7 15:04:10 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We propose a framework for querying heterogeneous XML
data sources. The framework ensures high autonomy to
participating sources as it does not rely on a global
schema or on semantic mappings between schemas. The
basic intuition is that of extending traditional
approaches for approximate query evaluation, by
providing techniques for combining partial answers
coming from different sources, possibly on the basis of
limited knowledge about the local schemas (i.e., key
constraints). We define a query language and its
associated semantics, that allows us to collect as much
information as possible from several heterogeneous XML
sources. We provide algorithms for query evaluation and
characterize the complexity of the query language.
Finally, we validate the approach in a medical
application scenario.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "heterogeneous databases; querying; XML",
}
@Article{Gelenbe:2009:ASN,
author = "Erol Gelenbe",
title = "Analysis of single and networked auctions",
journal = j-TOIT,
volume = "9",
number = "2",
pages = "8:1--8:??",
month = may,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1516539.1516543",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu May 7 15:04:10 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Web-based computerized auctions are increasingly
present in the Internet. We can imagine that in the
future this trend will actually be extended to
situations where virtual buyer and seller agents will
conduct automated transactions across the network, and
that large sectors of the economy may be structured in
this manner. The purpose of this article is to model
automated bidders and sellers which interact through a
network. We model the bidding process as a random
arrival process while the price attained by a good is
modeled as a discrete random variable. We obtain
analytical solutions allowing us to compute the income
from a single auction, or the income per unit time from
a repeated sequence of auctions. A variety of
single-auction models are studied, including English
and Vickrey auctions, and the income per unit time is
derived as a function of other parameters, including
the rate of arrival of bids, the seller's decision
time, the value of the good, and the ``rest time'' of
the seller between successive auctions. We illustrate
the results via numerical examples. We also introduce a
model for networked auctions where bidders can
circulate among a set of interconnected auctions which
we call the Mobile Bidder Model (MBM). We obtain an
analytical solution for the MBM under the
assumption,which we call the ``active bidders
assumption,'' that activities that are internal to an
auction (bids and sales) are much more frequent than
changes that occur in the number of bidders at each
auction.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "Automated auctions; Autonomic systems; E-commerce;
Internet technologies",
}
@Article{Li:2009:OBR,
author = "Xin Li and Jun Yan and Weiguo Fan and Ning Liu and
Shuicheng Yan and Zheng Chen",
title = "An online blog reading system by topic clustering and
personalized ranking",
journal = j-TOIT,
volume = "9",
number = "3",
pages = "9:1--9:??",
month = jul,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1552291.1552292",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Aug 11 19:15:17 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "There is an increasing number of people reading,
writing, and commenting on blogs. According to a recent
survey made by Technorati, there are about 75,000 new
blogs and 1.2 million new posts everyday. However, it
is difficult and time consuming for a blog reader to
find the most interesting posts in the huge and dynamic
blog world. In this article, an online Personalized
Blog Reader (PBR) system is proposed, which facilitates
blog readers in browsing the coolest and newest blog
posts of their interests by automatically clustering
the most relevant stories. PBR aims to make a user's
potential favorite topics always ranked higher than
those nonfavorite ones. This is accomplished in the
following steps. First, the system collects and
provides a unified incremental index of posts coming
from different blogs. Then, an incremental clustering
algorithm with a flexible half-bounded window of
observation is proposed to satisfy the requirements of
online processing. It learns people's personalized
reading preferences to present a user with a final
reading list. The experimental results show that the
proposed incremental clustering algorithm is effective
and efficient, and the personalization of the PBR
performs well.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "Blog; connected subgraph; content information; link
information; personalization; ranking; story; topic",
}
@Article{Rinaldi:2009:ODA,
author = "Antonio M. Rinaldi",
title = "An ontology-driven approach for semantic information
retrieval on the {Web}",
journal = j-TOIT,
volume = "9",
number = "3",
pages = "10:1--10:??",
month = jul,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1552291.1552293",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Aug 11 19:15:17 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The concept of relevance is a hot topic in the
information retrieval process. In recent years the
extreme growth of digital documents brought to light
the need for novel approaches and more efficient
techniques to improve the accuracy of IR systems to
take into account real users' information needs. In
this article we propose a novel metric to measure the
semantic relatedness between words. Our approach is
based on ontologies represented using a general
knowledge base for dynamically building a semantic
network. This network is based on linguistic properties
and it is combined with our metric to create a measure
of semantic relatedness. In this way we obtain an
efficient strategy to rank digital documents from the
Internet according to the user's interest domain. The
proposed methods, metrics, and techniques are
implemented in a system for information retrieval on
the Web. Experiments are performed on a test set built
using a directory service having information about
analyzed documents. The obtained results compared to
other similar systems show an effective improvement.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "Ontologies; semantic relatedness metrics; WordNet",
}
@Article{Platzer:2009:WSC,
author = "Christian Platzer and Florian Rosenberg and Schahram
Dustdar",
title = "{Web} service clustering using multidimensional angles
as proximity measures",
journal = j-TOIT,
volume = "9",
number = "3",
pages = "11:1--11:??",
month = jul,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1552291.1552294",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Aug 11 19:15:17 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Increasingly, application developers seek the ability
to search for existing Web services within large
Internet-based repositories. The goal is to retrieve
services that match the user's requirements. With the
growing number of services in the repositories and the
challenges of quickly finding the right ones, the need
for clustering related services becomes evident to
enhance search engine results with a list of similar
services for each hit. In this article, a statistical
clustering approach is presented that enhances an
existing distributed vector space search engine for Web
services with the possibility of dynamically
calculating clusters of similar services for each hit
in the list found by the search engine. The focus is
laid on a very efficient and scalable clustering
implementation that can handle very large service
repositories. The evaluation with a large service
repository demonstrates the feasibility and performance
of the approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "clustering; discovery; search; search engines; service
discovery; vector space; Web service",
}
@Article{Zhou:2009:UFC,
author = "Duanning Zhou and Wayne Wei Huang",
title = "Using a fuzzy classification approach to assess
e-commerce {Web} sites: an empirical investigation",
journal = j-TOIT,
volume = "9",
number = "3",
pages = "12:1--12:??",
month = jul,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1552291.1552295",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Aug 11 19:15:17 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "E-commerce Web site assessment helps determine whether
a corporation's Web site is effectively designed to
meet its business needs and whether the investment in
Web sites is well justified. Due to the complexity of
commercial Web sites that may include hundreds of Web
pages for many big corporations, there may inevitably
exist uncertainties when human assessors express their
subjective judgments in assessing e-commerce Web sites.
Fuzzy set theory is widely used to model uncertain and
imprecise information in applications. Prior studies in
e-commerce Web site assessment identified some key
factors to assess commercial Web sites by using a
numeric assessment scale that may not be effective and
efficient in modeling uncertainty. This study intends
to propose an e-commerce Web site assessment framework
using a fuzzy classification approach. Based on this
framework, a Web-based e-commerce assessment system was
designed and developed, which can provide online
assessment services to corporations on evaluating their
commercial Web sites. An empirical investigation into
assessing commercial Web sites of the top 120 Fortune
Corporations of the USA was conducted using the
developed online assessment system to demonstrate the
usefulness of the proposed framework. Research findings
and implications are discussed.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "E-commerce Web site assessment; e-commerce Web site
assessment system; fuzzy set",
}
@Article{Kwon:2009:FXD,
author = "Joonho Kwon and Praveen Rao and Bongki Moon and Sukho
Lee",
title = "Fast {XML} document filtering by sequencing twig
patterns",
journal = j-TOIT,
volume = "9",
number = "4",
pages = "13:1--13:??",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1592446.1592447",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Fri Oct 9 20:43:32 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "XML-enabled publish-subscribe (pub-sub) systems have
emerged as an increasingly important tool for
e-commerce and Internet applications. In a typical
pub-sub system, subscribed users specify their
interests in a profile expressed in the XPath language.
Each new data content is then matched against the user
profiles so that the content is delivered only to the
interested subscribers. As the number of subscribed
users and their profiles can grow very large, the
scalability of the service is critical to the success
of pub-sub systems. In this article, we propose a novel
scalable filtering system called iFiST that transforms
user profiles of a twig pattern expressed in XPath into
sequences using the Pr{\"u}fer's method. Consequently,
instead of breaking a twig pattern into multiple linear
paths and matching them separately, FiST performs {\em
holistic matching\/} of twig patterns with each
incoming document in a {\em bottom-up\/} fashion. FiST
organizes the sequences into a dynamic hash-based index
for efficient filtering, and exploits the commonality
among user profiles to enable shared processing during
the filtering phase. We demonstrate that the holistic
matching approach reduces filtering cost and memory
consumption, thereby improving the scalability of
FiST.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "Pr{\"u}fer sequences; selective dissemination of
information; twig pattern; XML filtering",
}
@Article{Colazzo:2009:DCS,
author = "Dario Colazzo and Carlo Sartiani",
title = "Detection of corrupted schema mappings in {XML} data
integration systems",
journal = j-TOIT,
volume = "9",
number = "4",
pages = "14:1--14:??",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1592446.1592448",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Fri Oct 9 20:43:32 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In modern data integration scenarios, many remote data
sources are located on the Web and are accessible only
through forms or Web services, and no guarantee is
given about their stability. In these contexts the
detection of corrupted mappings, as a consequence of a
change in the source or in the target schema, is a key
problem. A corrupted mapping fails in matching the
target or the source schema, hence it is not able to
transform data conforming to a schema S into data
conforming to a schema T, nor it can be used for
effective query reformulation.\par
This article describes a novel technique for
maintaining schema mappings in XML data integration
systems, based on a notion of mapping correctness
relying on the denotational semantics of mappings.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "data exchange; data integration; mapping correctness;
p2p systems; type inference; type systems; XML",
}
@Article{Kenny:2009:CES,
author = "Alan Kenny and S{\'e}amus Mcloone and Tom{\'a}s Ward",
title = "Controlling entity state updates to maintain remote
consistency within a distributed interactive
application",
journal = j-TOIT,
volume = "9",
number = "4",
pages = "15:1--15:??",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1592446.1592449",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Fri Oct 9 20:43:32 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "One of the ongoing challenges for Distributed
Interactive Applications (DIAs) is balancing the
quality of service delivered to the end user with the
operational costs involved. In particular the resultant
network traffic should be minimized without affecting
the end user experience where possible. This article
proposes the use of remote feedback as a method of
maintaining a desired consistency level within a
peer-to-peer DIA. Though many existing techniques
attempt to maintain consistency within a DIA, they
operate in an open-loop manner and do not take error
introduced into the system due to transmission delay
into consideration. The goal of the work presented in
this article is to transform this open-loop scheme into
a closed-loop control system utilizing feedback from
the remote users. By incorporating remote error into
the systems update paradigm, the Protocol Data Unit
(PDU) transmission rate can be dynamically altered to
reflect changing network conditions. The performance of
the resultant closed-loop control system is presented
within.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "15",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "consistency maintenance; dead reckoning; distributed
interactive applications (DIAs); multiplayer games;
prediction mechanisms; remote feedback",
}
@Article{Pitoura:2009:DFI,
author = "Theoni Pitoura and Peter Triantafillou",
title = "Distribution fairness in {Internet}-scale networks",
journal = j-TOIT,
volume = "9",
number = "4",
pages = "16:1--16:??",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1592446.1592450",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Fri Oct 9 20:43:32 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We address the issue of measuring distribution
fairness in Internet-scale networks. This problem has
several interesting instances encountered in different
applications, ranging from assessing the distribution
of load between network nodes for load balancing
purposes, to measuring node utilization for optimal
resource exploitation, and to guiding autonomous
decisions of nodes in networks built with market-based
economic principles. Although some metrics have been
proposed, particularly for assessing load balancing
algorithms, they fall short. We first study the
appropriateness of various known and previously
proposed statistical metrics for measuring distribution
fairness. We put forward a number of required
characteristics for appropriate metrics. We propose and
comparatively study the appropriateness of the Gini
coefficient ($G$) for this task. Our study reveals as
most appropriate the metrics of $G$, the fairness index
({\em FI\/}), and the coefficient of variation ($ C_V$)
in this order. Second, we develop six distributed
sampling algorithms to estimate metrics online
efficiently, accurately, and scalably. One of these
algorithms ({\em 2-PRWS\/}) is based on two effective
optimizations of a basic algorithm, and the other two
(the sequential sampling algorithm, {\em LBS-HL}, and
the clustered sampling one, {\em EBSS\/}) are novel,
developed especially to estimate $G$. Third, we show
how these metrics, and especially $G$, can be readily
utilized online by higher-level algorithms, which can
now know when to best intervene to correct unfair
distributions (in particular, load imbalances). We
conclude with a comprehensive experimentation which
comparatively evaluates both the various proposed
estimation algorithms and the three most appropriate
metrics ($G$, $ C_V$, and $ F I$). Specifically, the
evaluation quantifies the efficiency (in terms of
number of the messages and a latency indicator),
precision, and accuracy achieved by the proposed
algorithms when estimating the competing fairness
metrics. The central conclusion is that the proposed
metric, $G$, can be estimated with a small number of
messages and latency, regardless of the skew of the
underlying distribution.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "16",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "distributed sampling; distribution fairness;
peer-to-peer networks; the Gini coefficient",
}
@Article{Turner:2010:MBB,
author = "David Michael Turner and Vassilis Prevelakis and
Angelos D. Keromytis",
title = "A market-based bandwidth charging framework",
journal = j-TOIT,
volume = "10",
number = "1",
pages = "1:1--1:??",
month = feb,
year = "2010",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Mar 15 18:33:52 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Jha:2010:SIL,
author = "Somesh Jha and Stefan Katzenbeisser and Christian
Schallhart and Helmut Veith and Stephen Chenney",
title = "Semantic integrity in large-scale online simulations",
journal = j-TOIT,
volume = "10",
number = "1",
pages = "2:1--2:??",
month = feb,
year = "2010",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Mar 15 18:33:52 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Huang:2010:PNA,
author = "Tzu-Chi Huang and Sherali Zeadally and Naveen
Chilamkurti and Ce-Kuen Shieh",
title = "A programmable network address translator: {Design},
implementation, and performance",
journal = j-TOIT,
volume = "10",
number = "1",
pages = "3:1--3:??",
month = feb,
year = "2010",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Mar 15 18:33:52 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Pang:2010:PPS,
author = "Hweehwa Pang and Jialie Shen and Ramayya Krishnan",
title = "Privacy-preserving similarity-based text retrieval",
journal = j-TOIT,
volume = "10",
number = "1",
pages = "4:1--4:??",
month = feb,
year = "2010",
CODEN = "????",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Mon Mar 15 18:33:52 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Chen:2010:DVS,
author = "Teh-Chung Chen and Scott Dick and James Miller",
title = "Detecting visually similar {Web} pages: {Application}
to phishing detection",
journal = j-TOIT,
volume = "10",
number = "2",
pages = "5:1--5:??",
month = may,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1754393.1754394",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Jun 3 13:18:07 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We propose a novel approach for detecting visual
similarity between two Web pages. The proposed approach
applies Gestalt theory and considers a Web page as a
single indivisible entity. The concept of supersignals,
as a realization of Gestalt principles, supports our
contention that Web pages must be treated as
indivisible entities. We objectify, and directly
compare, these indivisible supersignals using
algorithmic complexity theory. We illustrate our
approach by applying it to the problem of detecting
phishing scams. Via a large-scale, real-world case
study, we demonstrate that (1) our approach effectively
detects similar Web pages; and (2) it accurately
distinguishes legitimate and phishing pages.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "Algorithmic complexity theory; anti-phishing
technologies; Gestalt theory; Web page similarity",
}
@Article{Yue:2010:BTP,
author = "Chuan Yue and Haining Wang",
title = "{BogusBiter}: a transparent protection against
phishing attacks",
journal = j-TOIT,
volume = "10",
number = "2",
pages = "6:1--6:??",
month = may,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1754393.1754395",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Jun 3 13:18:07 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Many anti-phishing mechanisms currently focus on
helping users verify whether a Web site is genuine.
However, usability studies have demonstrated that
prevention-based approaches alone fail to effectively
suppress phishing attacks and protect Internet users
from revealing their credentials to phishing sites. In
this paper, instead of preventing human users from
``biting the bait,'' we propose a new approach to
protect against phishing attacks with ``bogus bites.''
We develop {\em BogusBiter}, a unique client-side
anti-phishing tool, which transparently feeds a
relatively large number of bogus credentials into a
suspected phishing site. BogusBiter conceals a victim's
real credential among bogus credentials, and moreover,
it enables a legitimate Web site to identify stolen
credentials in a timely manner. Leveraging the power of
client-side automatic phishing detection techniques,
BogusBiter is complementary to existing preventive
anti-phishing approaches. We implemented BogusBiter as
an extension to the Firefox 2 Web browser, and
evaluated its efficacy through real experiments on both
phishing and legitimate Web sites. Our experimental
results indicate that it is promising to use BogusBiter
to transparently protect against phishing attacks.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "credential theft; Phishing; security; usability; web
spoofing",
}
@Article{Kumaraguru:2010:TJF,
author = "Ponnurangam Kumaraguru and Steve Sheng and Alessandro
Acquisti and Lorrie Faith Cranor and Jason Hong",
title = "Teaching {Johnny} not to fall for phish",
journal = j-TOIT,
volume = "10",
number = "2",
pages = "7:1--7:??",
month = may,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1754393.1754396",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Jun 3 13:18:07 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Phishing attacks, in which criminals lure Internet
users to Web sites that spoof legitimate Web sites, are
occurring with increasing frequency and are causing
considerable harm to victims. While a great deal of
effort has been devoted to solving the phishing problem
by prevention and detection of phishing emails and
phishing Web sites, little research has been done in
the area of training users to recognize those attacks.
Our research focuses on educating users about phishing
and helping them make better trust decisions. We
identified a number of challenges for end-user security
education in general and anti-phishing education in
particular: users are not motivated to learn about
security; for most users, security is a secondary task;
it is difficult to teach people to identify security
threats without also increasing their tendency to
misjudge nonthreats as threats. Keeping these
challenges in mind, we developed an email-based
anti-phishing education system called ``PhishGuru'' and
an online game called ``Anti-Phishing Phil'' that
teaches users how to use cues in URLs to avoid falling
for phishing attacks. We applied learning science
instructional principles in the design of PhishGuru and
Anti-Phishing Phil. In this article we present the
results of PhishGuru and Anti-Phishing Phil user
studies that demonstrate the effectiveness of these
tools. Our results suggest that, while automated
detection systems should be used as the first line of
defense against phishing attacks, user education offers
a complementary approach to help people better
recognize fraudulent emails and websites.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "email; Embedded training; instructional principles;
learning science; phishing; situated learning; usable
privacy and security",
}
@Article{Kuter:2010:UPC,
author = "Ugur Kuter and Jennifer Golbeck",
title = "Using probabilistic confidence models for trust
inference in {Web}-based social networks",
journal = j-TOIT,
volume = "10",
number = "2",
pages = "8:1--8:??",
month = may,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1754393.1754397",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Thu Jun 3 13:18:07 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In this article, we describe a new approach that gives
an explicit probabilistic interpretation for social
networks. In particular, we focus on the observation
that many existing Web-based trust-inference algorithms
conflate the notions of ``trust'' and ``confidence,''
and treat the amalgamation of the two concepts to
compute the trust value associated with a social
relationship. Unfortunately, the result of such an
algorithm that merges trust and confidence is not a
trust value, but rather a new variable in the inference
process. Thus, it is hard to evaluate the outputs of
such an algorithm in the context of trust
inference.\par
This article first describes a formal probabilistic
network model for social networks that allows us to
address that issue. Then we describe SUNNY, a new trust
inference algorithm that uses probabilistic sampling to
separately estimate trust information and our
confidence in the trust estimate and use the two values
in order to compute an estimate of trust based on only
those information sources with the highest confidence
estimates.\par
We present an experimental evaluation of SUNNY. In our
experiments, SUNNY produced more accurate trust
estimates than the well-known trust inference algorithm
TidalTrust, demonstrating its effectiveness. Finally,
we discuss the implications these results will have on
systems designed for personalizing content and making
recommendations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "Bayesian networks; Social networks; trust",
}
@Article{Rajab:2010:PTC,
author = "Moheeb Abu Rajab and Fabian Monrose and Niels Provos",
title = "Peeking Through the Cloud: Client Density Estimation
via {DNS} Cache Probing",
journal = j-TOIT,
volume = "10",
number = "3",
pages = "9:1--9:??",
month = oct,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1852096.1852097",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Oct 20 12:29:08 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Reliable network demographics are quickly becoming a
much sought-after digital commodity. However, as the
need for more refined Internet demographics has grown,
so too has the tension between privacy and utility.
Unfortunately, current techniques lean too much in
favor of functional requirements over protecting the
privacy of users. For example, the most prominent
proposals for measuring the relative popularity of a
Web site depend on the deployment of client-side
measurement agents that are generally perceived as
infringing on users' privacy, thereby limiting their
wide-scale adoption. Moreover, the client-side nature
of these techniques also makes them susceptible to
various manipulation tactics that undermine the
integrity of their results. In this article, we propose
a new estimation technique that uses DNS cache probing
to infer the density of clients accessing a given
service. Compared to earlier techniques, our scheme is
less invasive as it does not reveal user-specific
traits, and is more robust against manipulation. We
demonstrate the flexibility of our approach through two
important security applications. First, we illustrate
how our scheme can be used as a lightweight technique
for measuring and verifying the relative popularity
rank of different Web sites. Second, using data from
several hundred botnets, we apply our technique to
indirectly measure the infected population of this
increasing Internet phenomenon.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "botnets; client density estimation; measurement;
Network security; Web metering",
}
@Article{Bartoli:2010:FLS,
author = "Alberto Bartoli and Giorgio Davanzo and Eric Medvet",
title = "A Framework for Large-Scale Detection of {Web} Site
Defacements",
journal = j-TOIT,
volume = "10",
number = "3",
pages = "10:1--10:??",
month = oct,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1852096.1852098",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Oct 20 12:29:08 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Web site defacement, the process of introducing
unauthorized modifications to a Web site, is a very
common form of attack. In this paper we describe and
evaluate experimentally a framework that may constitute
the basis for a {\em defacement detection service\/}
capable of monitoring thousands of remote Web sites
systematically and automatically.\par
In our framework an organization may join the service
by simply providing the URLs of the resources to be
monitored along with the contact point of an
administrator. The monitored organization may thus take
advantage of the service with just a few mouse clicks,
without installing any software locally or changing its
own daily operational processes. Our approach is based
on anomaly detection and allows monitoring the
integrity of many remote Web resources automatically
while remaining fully decoupled from them, in
particular, without requiring any prior knowledge about
those resources.\par
We evaluated our approach over a selection of dynamic
resources and a set of publicly available defacements.
The results are very satisfactory: all attacks are
detected while keeping false positives to a minimum. We
also assessed performance and scalability of our
proposal and we found that it may indeed constitute the
basis for actually deploying the proposed service on a
large scale.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "experimental evaluation; Intrusion detection;
monitoring service; Web site defacement",
}
@Article{Gluhovsky:2010:FCT,
author = "Ilya Gluhovsky",
title = "Forecasting Click-Through Rates Based on Sponsored
Search Advertiser Bids and Intermediate Variable
Regression",
journal = j-TOIT,
volume = "10",
number = "3",
pages = "11:1--11:??",
month = oct,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1852096.1852099",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Oct 20 12:29:08 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "To participate in sponsored search online advertising,
an advertiser bids on a set of keywords relevant to
his/her product or service. When one of these keywords
matches a user search string, the ad is then considered
for display among sponsored search results. Advertisers
compete for positions in which their ads appear, as
higher slots typically result in more user clicks. All
existing position allocating mechanisms charge more per
click for a higher slot. Therefore, an advertiser must
decide whether to bid high and receive more, but more
expensive, clicks.\par
In this work, we propose a novel methodology for
building forecasting landscapes relating an individual
advertiser bid to the expected click-through rate
and/or the expected daily click volume. Displaying such
landscapes is currently offered as a service to
advertisers by all major search engine providers. Such
landscapes are expected to be instrumental in helping
the advertisers devise their bidding strategies.\par
We propose a {\em triply\/} monotone regression
methodology. We start by applying the current
state-of-the-art monotone regression solution. We then
propose to condition on the ad position and to estimate
the bid-position and position-click effects separately.
While the latter translates into a standard monotone
regression problem, we devise a novel solution to the
former based on approximate maximum likelihood. We show
that our proposal significantly outperforms the
standard monotone regression solution, while the latter
similarly improves upon routinely used ad-hoc
methods.\par
Last, we discuss other e-commerce applications of the
proposed intermediate variable regression
methodology.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "bidding agents; click-through rate estimation;
electronic commerce; isotonic regression; nonparametric
regression; Online auctions; shape constraints;
sponsored search; statistical inference",
}
@Article{Jordan:2010:FCT,
author = "Scott Jordan and Arijit Ghosh",
title = "A Framework for Classification of Traffic Management
Practices as Reasonable or Unreasonable",
journal = j-TOIT,
volume = "10",
number = "3",
pages = "12:1--12:??",
month = oct,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1852096.1852100",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Oct 20 12:29:08 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Traffic management practices of ISPs are an issue of
public concern. We propose a framework for
classification of traffic management practices as
reasonable or unreasonable. We present a survey of
traffic management techniques and examples of how these
techniques are used by ISPs. We suggest that whether a
traffic management practice is reasonable rests on the
answers to four questions regarding the techniques and
practices used. We propose a framework that classifies
techniques as unreasonable if they are unreasonably
anticompetitive, cause undue harm to consumers, or
unreasonably impair free speech. We propose
alternatives to unreasonable or borderline congestion
management practices.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Shen:2011:ADC,
author = "Haifeng Shen and Chengzheng Sun",
title = "Achieving Data Consistency by Contextualization in
{Web-Based} Collaborative Applications",
journal = j-TOIT,
volume = "10",
number = "4",
pages = "13:1--13:??",
month = mar,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/1944339.1944340",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Mar 29 17:36:50 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Recent years have witnessed the emergence and rapid
development of collaborative Web-based applications
exemplified by Web-based office productivity
applications. One major challenge in building these
applications is maintaining data consistency while
meeting the requirements of fast local response, total
work preservation, unconstrained interaction, and
customizable collaboration mode. These requirements are
important in determining users' experiences in
interaction and collaboration, and in meeting users'
diverse needs under complex and dynamic collaboration
and networking environments; but none of existing
solutions is able to meet all of them. In this article,
we present a data consistency maintenance solution
capable of meeting these requirements for collaborative
Web-based applications.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Hurley:2011:NDT,
author = "Neil Hurley and Mi Zhang",
title = "Novelty and Diversity in Top-{$N$} Recommendation ---
Analysis and Evaluation",
journal = j-TOIT,
volume = "10",
number = "4",
pages = "14:1--14:??",
month = mar,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/1944339.1944341",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Mar 29 17:36:50 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "For recommender systems that base their product
rankings primarily on a measure of similarity between
items and the user query, it can often happen that
products on the recommendation list are highly similar
to each other and lack diversity. In this article we
argue that the motivation of diversity research is to
increase the probability of retrieving unusual or novel
items which are relevant to the user and introduce a
methodology to evaluate their performance in terms of
novel item retrieval. Moreover, noting that the
retrieval of a set of items matching a user query is a
common problem across many applications of information
retrieval, we formulate the trade-off between diversity
and matching quality as a binary optimization problem,
with an input control parameter allowing explicit
tuning of this trade-off.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Meiss:2011:PEI,
author = "Mark Meiss and Filippo Menczer and Alessandro
Vespignani",
title = "Properties and Evolution of {Internet} Traffic
Networks from Anonymized Flow Data",
journal = j-TOIT,
volume = "10",
number = "4",
pages = "15:1--15:??",
month = mar,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/1944339.1944342",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Mar 29 17:36:50 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Many projects have tried to analyze the structure and
dynamics of application overlay networks on the
Internet using packet analysis and network flow data.
While such analysis is essential for a variety of
network management and security tasks, it is infeasible
on many networks: either the volume of data is so large
as to make packet inspection intractable, or privacy
concerns forbid packet capture and require the
dissociation of network flows from users' actual IP
addresses. Our analytical framework permits useful
analysis of network usage patterns even under
circumstances where the only available source of data
is anonymized flow records. Using this data, we are
able to uncover distributions and scaling relations in
host-to-host networks that bear implications for
capacity planning and network application design.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "15",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Crainiceanu:2011:LBR,
author = "Adina Crainiceanu and Prakash Linga and Ashwin
Machanavajjhala and Johannes Gehrke and Jayavel
Shanmugasundaram",
title = "Load Balancing and Range Queries in {P2P} Systems
Using {P-Ring}",
journal = j-TOIT,
volume = "10",
number = "4",
pages = "16:1--16:??",
month = mar,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/1944339.1944343",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Tue Mar 29 17:36:50 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In peer-to-peer (P2P) systems, computers from around
the globe share data and can participate in distributed
computation. P2P became famous, and infamous, due to
file-sharing systems like Napster. However, the
scalability and robustness of these systems make them
appealing to a wide range of applications. This article
introduces P-Ring, a new peer-to-peer index structure.
P-Ring is fully distributed, fault tolerant, and
provides load balancing and logarithmic search
performance while supporting both equality and range
queries. Our theoretical analysis as well as
experimental results, obtained both in a simulated
environment and on PlanetLab, show the performance of
our system.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "16",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Totok:2011:ESU,
author = "Alexander Totok and Vijay Karamcheti",
title = "Exploiting Service Usage Information for Optimizing
Server Resource Management",
journal = j-TOIT,
volume = "11",
number = "1",
pages = "1:1--1:??",
month = jul,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/1993083.1993084",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Aug 17 09:48:22 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "It is often difficult to tune the performance of
modern component-based Internet services because: (1)
component middleware are complex software systems that
expose several independently tuned server resource
management mechanisms; (2) session-oriented client
behavior with complex data access patterns makes it
hard to predict what impact tuning these mechanisms has
on application behavior; and (3) component-based
Internet services themselves exhibit complex structural
organization with requests of different types having
widely ranging execution complexity. In this article we
show that exposing and using detailed information about
how clients use Internet services enables mechanisms
that achieve two interconnected goals: (1) providing
improved QoS to the service clients, and (2) optimizing
server resource utilization.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Arlitt:2011:CIG,
author = "Martin Arlitt and Niklas Carlsson and Phillipa Gill
and Aniket Mahanti and Carey Williamson",
title = "Characterizing Intelligence Gathering and Control on
an Edge Network",
journal = j-TOIT,
volume = "11",
number = "1",
pages = "2:1--2:??",
month = jul,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/1993083.1993085",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Aug 17 09:48:22 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "There is a continuous struggle for control of
resources at every organization that is connected to
the Internet. The local organization wishes to use its
resources to achieve strategic goals. Some external
entities seek direct control of these resources, for
purposes such as spamming or launching
denial-of-service attacks. Other external entities seek
indirect control of assets (e.g., users, finances), but
provide services in exchange for them. Using a
year-long trace from an edge network, we examine what
various external organizations know about one
organization. We compare the types of information
exposed by or to external organizations using either
active (reconnaissance) or passive (surveillance)
techniques.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhan:2011:ADD,
author = "Justin Zhan and B. John Oommen and Johanna
Crisostomo",
title = "Anomaly Detection in Dynamic Systems Using Weak
Estimators",
journal = j-TOIT,
volume = "11",
number = "1",
pages = "3:1--3:??",
month = jul,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/1993083.1993086",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Aug 17 09:48:22 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Anomaly detection involves identifying observations
that deviate from the normal behavior of a system. One
of the ways to achieve this is by identifying the
phenomena that characterize ``normal'' observations.
Subsequently, based on the characteristics of data
learned from the ``normal'' observations, new
observations are classified as being either ``normal''
or not. Most state-of-the-art approaches, especially
those which belong to the family of parameterized
statistical schemes, work under the assumption that the
underlying distributions of the observations are
stationary. That is, they assume that the distributions
that are learned during the training (or learning)
phase, though unknown, are not time-varying. They
further assume that the same distributions are relevant
even as new observations are encountered.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Geneves:2011:IXS,
author = "Pierre Genev{\`e}s and Nabil Laya{\"\i}da and Vincent
Quint",
title = "Impact of {XML} Schema Evolution",
journal = j-TOIT,
volume = "11",
number = "1",
pages = "4:1--4:??",
month = jul,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/1993083.1993087",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
bibdate = "Wed Aug 17 09:48:22 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We consider the problem of XML Schema evolution. In
the ever-changing context of the web, XML schemas
continuously change in order to cope with the natural
evolution of the entities they describe. Schema changes
have important consequences. First, existing documents
valid with respect to the original schema are no longer
guaranteed to fulfill the constraints described by the
evolved schema. Second, the evolution also impacts
programs, manipulating documents whose structure is
described by the original schema. We propose a unifying
framework for determining the effects of XML Schema
evolution both on the validity of documents and on
queries. The system is very powerful in analyzing
various scenarios in which forward/backward
compatibility of schemas is broken, and in which the
result of a query may no longer be what was expected.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Goebel:2011:CIE,
author = "Christoph Goebel and Dirk Neumann and Ramayya
Krishnan",
title = "Comparing ingress and egress detection to secure
interdomain routing: An experimental analysis",
journal = j-TOIT,
volume = "11",
number = "2",
pages = "5:1--5:??",
month = dec,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2049656.2049657",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 15 09:10:08 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The global economy and society increasingly depends on
computer networks linked together by the Internet. The
importance of computer networks reaches far beyond the
telecommunications sector since they have become a
critical factor for many other crucial infrastructures
and markets. With threats mounting and security
incidents becoming more frequent, concerns about
network security grow. It is an acknowledged fact that
some of the most fundamental network protocols that
make the Internet work are exposed to serious threats.
One of them is the Border Gateway Protocol (BGP) which
determines how Internet traffic is routed through the
topology of administratively independent networks that
the Internet is comprised of.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Albrecht:2011:DAC,
author = "Jeannie Albrecht and Christopher Tuttle and Ryan Braud
and Darren Dao and Nikolay Topilski and Alex C. Snoeren
and Amin Vahdat",
title = "Distributed application configuration, management, and
visualization with plush",
journal = j-TOIT,
volume = "11",
number = "2",
pages = "6:1--6:??",
month = dec,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2049656.2049658",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 15 09:10:08 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Support for distributed application management in
large-scale networked environments remains in its early
stages. Although a number of solutions exist for
subtasks of application deployment, monitoring, and
maintenance in distributed environments, few tools
provide a unified framework for application management.
Many of the existing tools address the management needs
of a single type of application or service that runs in
a specific environment, and these tools are not
adaptable enough to be used for other applications or
platforms. To this end, we present the design and
implementation of Plush, a fully configurable
application management infrastructure designed to meet
the general requirements of several different classes
of distributed applications.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Park:2011:ACC,
author = "Ki-Woong Park and Kyu Ho Park",
title = "{ACCENT}: Cognitive cryptography plugged compression
for {SSL\slash TLS-based} cloud computing services",
journal = j-TOIT,
volume = "11",
number = "2",
pages = "7:1--7:??",
month = dec,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2049656.2049659",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 15 09:10:08 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Emerging cloud services, including mobile offices,
Web-based storage services, and content delivery
services, run diverse workloads under various device
platforms, networks, and cloud service providers. They
have been realized on top of SSL/TLS, which is the de
facto protocol for end-to-end secure communication over
the Internet. In an attempt to achieve a cognitive
SSL/TLS with heterogeneous environments (device,
network, and cloud) and workload awareness, we
thoroughly analyze SSL/TLS-based data communication and
identify three critical mismatches in a conventional
SSL/TLS-based data transmission. The first mismatch is
the performance of loosely coupled
encryption-compression and communication routines that
lead to underutilized computation and communication
resources.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Dalal:2011:UPQ,
author = "Amy Csizmar Dalal",
title = "User-perceived quality assessment of streaming media
using reduced feature sets",
journal = j-TOIT,
volume = "11",
number = "2",
pages = "8:1--8:??",
month = dec,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2049656.2049660",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 15 09:10:08 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "While subjective measurements are the most natural for
assessing the user-perceived quality of a media stream,
there are issues with their scalability and their
context accuracy. We explore techniques to select
application-layer measurements, collected by an
instrumented media player, that most accurately predict
the subjective quality rating that a user would assign
to a stream. We consider three feature subset selection
techniques that reduce the number of features
(measurements) under consideration to ones most
relevant to user-perceived stream quality. Two of the
three techniques mathematically consider stream
characteristics when selecting measurements, while the
third is based on observation. We apply the reduced
feature sets to two nearest-neighbor algorithms for
predicting user-perceived stream quality.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Sheng:2012:ISI,
author = "Quan Z. Sheng and Schahram Dustdar",
title = "Introduction to special issue on context-aware {Web}
services for the future {Internet}",
journal = j-TOIT,
volume = "11",
number = "3",
pages = "9:1--9:??",
month = jan,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2078316.2078317",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jan 31 17:38:01 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Abeywickrama:2012:CAS,
author = "Dhaminda B. Abeywickrama and Sita Ramakrishnan",
title = "Context-aware services engineering: Models,
transformations, and verification",
journal = j-TOIT,
volume = "11",
number = "3",
pages = "10:1--10:??",
month = jan,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2078316.2078318",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jan 31 17:38:01 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Context-aware Web services are identified as an
important technology to support new applications on the
future Internet. Context information has several
qualities that make the development of these services
challenging, compared to conventional, Web services.
Therefore, sound software engineering practices are
needed during their development and execution. This
article discusses a novel software engineering-based
approach, which leverages the benefits of model-driven
architecture, aspect-oriented modeling, and formal
model checking, for modeling and verifying
context-aware services. The approach is explored using
a real-world case study in intelligent transport. An
evaluation framework is established to validate the
main methods and tools employed.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Feng:2012:VCC,
author = "Qinyuan Feng and Ling Liu and Yafei Dai",
title = "Vulnerabilities and countermeasures in context-aware
social rating services",
journal = j-TOIT,
volume = "11",
number = "3",
pages = "11:1--11:??",
month = jan,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2078316.2078319",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jan 31 17:38:01 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Social trust and recommendation services are the most
popular social rating systems today for service
providers to learn about the social opinion or
popularity of a product, item, or service, such as a
book on Amazon, a seller on eBay, a story on Digg or a
movie on Netflix. Such social rating systems are very
convenient and offer alternative learning environments
for decision makers, but they open the door for
attackers to manipulate the social rating systems by
selfishly promoting or maliciously demoting certain
items. Although a fair amount of effort has been made
to understand various risks and possible defense
mechanisms to counter such attacks, most of the
existing work to date has been devoted to studying
specific types of attacks and their countermeasures.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Maekawa:2012:CAW,
author = "Takuya Maekawa and Yutaka Yanagisawa and Yasushi
Sakurai and Yasue Kishino and Koji Kamei and Takeshi
Okadome",
title = "Context-aware {Web} search in ubiquitous sensor
environments",
journal = j-TOIT,
volume = "11",
number = "3",
pages = "12:1--12:??",
month = jan,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2078316.2078320",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jan 31 17:38:01 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article proposes a new concept for a
context-aware Web search method that automatically
retrieves a webpage related to the daily activity that
a user currently is engaged in and displays the page on
nearby Internet-connected home appliances such as
televisions. For example, when a user is washing a
coffeemaker, a webpage is retrieved that includes tips
such as ``cleaning a coffee maker with vinegar removes
stains well,'' and the page is displayed on a nearby
appliance. In this article, we design and implement a
Web search method that employs ubiquitous sensors to
monitor a user's daily life. Our proposed method
automatically searches for a webpage related to a daily
activity by using a query constructed from the use of
daily objects employed in the activity that is detected
with object-attached sensors.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{He:2012:SWS,
author = "Jing He and Yanchun Zhang and Guangyan Huang and Jinli
Cao",
title = "A smart {Web} service based on the context of things",
journal = j-TOIT,
volume = "11",
number = "3",
pages = "13:1--13:??",
month = jan,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2078316.2078321",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jan 31 17:38:01 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Combining the Semantic Web and the Ubiquitous Web, Web
3.0 is for things. The Semantic Web enables human
knowledge to be machine-readable and the Ubiquitous Web
allows Web services to serve any thing, forming a
bridge between the virtual world and the real world. By
using context, Web services can become smarter---that
is, aware of the target things' or applications'
physical environments, or situations and respond
proactively and intelligently. Existing methods for
implementing context-aware Web services on Web 2.0
mainly enumerate different implementations
corresponding to different attribute values of the
context, in order to improve the Quality of Services
(QoS). However, things in the physical world are
extremely diverse, which poses new problems for Web
services: it is difficult to unify the context of
things and to implement a flexible smart Web service
for things.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Sherchan:2012:CSU,
author = "Wanita Sherchan and Surya Nepal and Athman Bouguettaya
and Shiping Chen",
title = "Context-sensitive user interfaces for semantic
services",
journal = j-TOIT,
volume = "11",
number = "3",
pages = "14:1--14:??",
month = jan,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2078316.2078322",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jan 31 17:38:01 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Service-centric solutions usually require rich context
to fully deliver and better reflect on the underlying
applications. We present a novel use of context in the
form of customized user interface services with the
concept of User Interface as a Service (UIaaS). UIaaS
takes user profiles as input to generate context-aware
interface services. Such interface services can be used
as context to augment semantic services with contextual
information leading to UIaaS as a Context (UIaaSaaC).
The added serendipitous benefit of the proposed concept
is that the composition of a customized user interface
with the requested service is performed by the service
composition engine, as is the case with any other
services.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Liu:2012:FPC,
author = "Alex X. Liu",
title = "Firewall policy change-impact analysis",
journal = j-TOIT,
volume = "11",
number = "4",
pages = "15:1--15:??",
month = mar,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2109211.2109212",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Mar 19 17:12:01 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Firewalls are the cornerstones of the security
infrastructure for most enterprises. They have been
widely deployed for protecting private networks. The
quality of the protection provided by a firewall
directly depends on the quality of its policy (i.e.,
configuration). Due to the lack of tools for analyzing
firewall policies, many firewalls used today have
policy errors. A firewall policy error either creates
security holes that will allow malicious traffic to
sneak into a private network or blocks legitimate
traffic and disrupts normal business processes, which
in turn could lead to irreparable, if not tragic,
consequences. A major cause of policy errors are policy
changes. Firewall policies often need to be changed as
networks evolve and new threats emerge. Users behind a
firewall often request the firewall administrator to
modify rules to allow or protect the operation of some
services. In this article, we first present the theory
and algorithms for firewall policy change-impact
analysis. Our algorithms take as input a firewall
policy and a proposed change, then output the accurate
impact of the change. Thus, a firewall administrator
can verify a proposed change before committing it. We
implemented our firewall change-impact analysis
algorithms, and tested them on both real-life and
synthetic firewall policies. The experimental results
show that our algorithms are effective in terms of
ensuring firewall policy correctness and efficient in
terms of computing the impact of policy changes. Thus,
our tool can be practically used in the iterative
process of firewall policy design and maintenance.
Although the focus of this article is on firewalls, the
change-impact analysis algorithms proposed in this
article are not limited to firewalls. Rather, they can
be applied to other rule-based systems, such as router
access control lists (ACLs), as well.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "15",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Li:2012:TTO,
author = "Zhisheng Li and Xiangye Xiao and Meng Wang and Chong
Wang and Xufa Wang and Xing Xie",
title = "Towards the taxonomy-oriented categorization of yellow
pages queries",
journal = j-TOIT,
volume = "11",
number = "4",
pages = "16:1--16:??",
month = mar,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2109211.2109213",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Mar 19 17:12:01 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Yellow pages search is a popular service that provides
a means for finding businesses close to particular
locations. The efficient search of yellow pages is
becoming a rapidly evolving research area. The
underlying data maintained in yellow pages search
engines are typically labeled according to Standard
Industry Classification (SIC) categories, and users can
search yellow pages with categories according to their
interests. Categorizing yellow pages queries into a
subset of topical categories can help to improve search
experience and quality. However, yellow pages queries
are usually short and ambiguous. In addition, a yellow
pages query taxonomy is typically organized by a
hierarchy of a fairly large number of categories. These
characteristics make automatic yellow pages query
categorization difficult and challenging. In this
article, we propose a flexible yellow pages query
categorization approach. The proposed technique is
built based on a TF-IDF similarity taxonomy matching
scheme that is able to provide more accurate query
categorization than previous keyword-based matching
schemes. To further improve the categorization
performance, we design several filtering schemes.
Through extensive experimentation, we demonstrate
encouraging results. We obtain F1 measures of about 0.5
and 0.3 for categorizing yellow pages queries into 19
coarse categories and 244 finer categories,
respectively. We investigate different components in
the proposed approach and also demonstrate the
superiority of our approach over a hierarchical support
vector machine classifier.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "16",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Leung:2012:FPW,
author = "Kenneth Wai-Ting Leung and Dik Lun Lee and Wilfred Ng
and Hing Yuet Fung",
title = "A framework for personalizing web search with
concept-based user profiles",
journal = j-TOIT,
volume = "11",
number = "4",
pages = "17:1--17:??",
month = mar,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2109211.2109214",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Mar 19 17:12:01 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Personalized search is an important means to improve
the performance of a search engine. In this article, we
propose a framework that supports mining a user's
conceptual preferences from users' clickthrough data
resulting from Web search. The discovered preferences
are utilized to adapt a search engine's ranking
function. In this framework, an extended set of
conceptual preferences was derived for a user based on
the concepts extracted from the search results and the
clickthrough data. Then, a concept-based user profile
(CUP) representing the user profile as a concept
ontology tree is generated. Finally, the CUP is input
to a support vector machine (SVM) to learn a concept
preference vector for adapting a personalized ranking
function that reranks the search results. In order to
achieve more flexible personalization, the framework
allows a user to control the amount of specific CUP
ontology information to be exposed to the personalized
search engine. We study various parameters, such as
conceptual relationships and concept features, arising
from CUP that affect the ranking quality. Experiments
confirm that our approach is able to significantly
improve the retrieval effectiveness for the user.
Further, our proposed control parameters of CUP
information can adjust the exposed user information
more smoothly and maintain better ranking quality than
the existing methods.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "17",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Dacosta:2012:OTC,
author = "Italo Dacosta and Saurabh Chakradeo and Mustaque
Ahamad and Patrick Traynor",
title = "One-time cookies: Preventing session hijacking attacks
with stateless authentication tokens",
journal = j-TOIT,
volume = "12",
number = "1",
pages = "1:1--1:??",
month = jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2220352.2220353",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jul 10 18:01:14 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "HTTP cookies are the de facto mechanism for session
authentication in Web applications. However, their
inherent security weaknesses allow attacks against the
integrity of Web sessions. HTTPS is often recommended
to protect cookies, but deploying full HTTPS support
can be challenging due to performance and financial
concerns, especially for highly distributed
applications. Moreover, cookies can be exposed in a
variety of ways even when HTTPS is enabled. In this
article, we propose one-time cookies (OTC), a more
robust alternative for session authentication. OTC
prevents attacks such as session hijacking by signing
each user request with a session secret securely stored
in the browser. Unlike other proposed solutions, OTC
does not require expensive state synchronization in the
Web application, making it easily deployable in highly
distributed systems. We implemented OTC as a plug-in
for the popular WordPress platform and as an extension
for Firefox and Firefox for mobile browsers. Our
extensive experimental analysis shows that OTC
introduces a latency of less than 6 ms when compared to
cookies --- a negligible overhead for most Web
applications. Moreover, we show that OTC can be
combined with HTTPS to effectively add another layer of
security to Web applications. In so doing, we
demonstrate that one-time cookies can significantly
improve the security of Web applications with minimal
impact on performance and scalability.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Dikaiakos:2012:MSR,
author = "Marios D. Dikaiakos and Asterios Katsifodimos and
George Pallis",
title = "{Minersoft}: Software retrieval in grid and cloud
computing infrastructures",
journal = j-TOIT,
volume = "12",
number = "1",
pages = "2:1--2:??",
month = jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2220352.2220354",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jul 10 18:01:14 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "One of the main goals of Cloud and Grid
infrastructures is to make their services easily
accessible and attractive to end-users. In this article
we investigate the problem of supporting keyword-based
searching for the discovery of software files that are
installed on the nodes of large-scale, federated Grid
and Cloud computing infrastructures. We address a
number of challenges that arise from the unstructured
nature of software and the unavailability of
software-related metadata on large-scale networked
environments. We present Minersoft, a harvester that
visits Grid/Cloud infrastructures, crawls their file
systems, identifies and classifies software files, and
discovers implicit associations between them. The
results of Minersoft harvesting are encoded in a
weighted, typed graph, called the Software Graph. A
number of information retrieval (IR) algorithms are
used to enrich this graph with structural and content
associations, to annotate software files with keywords
and build inverted indexes to support keyword-based
searching for software. Using a real testbed, we
present an evaluation study of our approach, using data
extracted from production-quality Grid and Cloud
computing infrastructures. Experimental results show
that Minersoft is a powerful tool for software search
and discovery.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Guo:2012:TNA,
author = "Deke Guo and Yunhao Liu and Hai Jin and Zhong Liu and
Weiming Zhang and Hui Liu",
title = "Theory and network applications of balanced {Kautz}
tree structures",
journal = j-TOIT,
volume = "12",
number = "1",
pages = "3:1--3:??",
month = jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2220352.2220355",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jul 10 18:01:14 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In order to improve scalability and to reduce the
maintenance overhead for structured peer-to-peer (P2P)
networks, researchers have proposed architectures based
on several interconnection networks with a fixed-degree
and a logarithmical diameter. Among existing
fixed-degree interconnection networks, the Kautz
digraph has many distinctive topological properties
compared to others. It, however, requires that the
number of peers have the some given values, determined
by peer degree and network diameter. In practice, we
cannot guarantee how many peers will join a P2P network
at a given time, since a P2P network is typically
dynamic with peers frequently entering and leaving. To
address such an issue, we propose the balanced Kautz
tree and Kautz ring structures. We further design a
novel structured P2P system, called BAKE, based on the
two structures that has the logarithmical diameter and
constant degree, even the number of peers is an
arbitrary value. By keeping a total ordering of peers
and employing a robust locality-preserved resource
placement strategy, resources that are similar in a
single or multidimensional attributes space are stored
on the same peer or neighboring peers. Through analysis
and simulation, we show that BAKE achieves the optimal
diameter and as good a connectivity as the Kautz
digraph does (almost achieves the Moore bound), and
supports the exact as well as the range queries
efficiently. Indeed, the structures of balanced Kautz
tree and Kautz ring we propose can also be applied to
other interconnection networks after minimal
modifications, for example, the de Bruijn digraph.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Tyson:2012:JMP,
author = "Gareth Tyson and Andreas Mauthe and Sebastian Kaune
and Paul Grace and Adel Taweel and Thomas Plagemann",
title = "{Juno}: a Middleware Platform for Supporting
Delivery-Centric Applications",
journal = j-TOIT,
volume = "12",
number = "2",
pages = "4:1--4:??",
month = dec,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2390209.2390210",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Dec 15 19:32:37 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article proposes a new delivery-centric
abstraction which extends the existing content-centric
networking API. A delivery-centric abstraction allows
applications to generate content requests agnostic to
location or protocol, with the additional ability to
stipulate high-level requirements regarding such things
as performance, security, and resource consumption.
Fulfilling these requirements, however, is complex as
often the ability of a provider to satisfy requirements
will vary between different consumers and over time.
Therefore, we argue that it is vital to manage this
variance to ensure an application fulfills its needs.
To this end, we present the Juno middleware, which
implements delivery-centric support using a
reconfigurable software architecture to: (i) discover
multiple sources of an item of content; (ii) model each
source's ability to provide the content; then (iii)
adapt to interact with the source(s) that can best
fulfill the application's requirements. Juno therefore
utilizes existing providers in a backwards compatible
way, supporting immediate deployment. This article
evaluates Juno using Emulab to validate its ability to
adapt to its environment.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Robu:2012:UPO,
author = "Valentin Robu and Lonneke Mous and Han {La
Poutr{\'e}}",
title = "Using Priced Options to Solve the Exposure Problem in
Sequential Auctions",
journal = j-TOIT,
volume = "12",
number = "2",
pages = "5:1--5:??",
month = dec,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2390209.2390211",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Dec 15 19:32:37 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We propose a priced options model for solving the
exposure problem of bidders with valuation synergies
participating in a sequence of online auctions. We
consider a setting in which complementary-valued items
are offered sequentially by different sellers, who have
the choice of either selling their item directly or
through a priced option. In our model, the seller fixes
the exercise price for this option, and then sells it
through a first-price auction. We analyze this model
from a decision-theoretic perspective and we show, for
a setting where the competition is formed by local
bidders (which desire a single item), that using
options can increase the expected profit for both
sides. Furthermore, we derive the equations that
provide minimum and maximum bounds between which the
bids of the synergy buyer are expected to fall, in
order for both sides of the market to have an incentive
to use the options mechanism. Next, we perform an
experimental analysis of a market in which multiple
synergy buyers are active simultaneously. We show that,
despite the extra competition, some synergy buyers may
benefit, because sellers are forced to set their
exercise prices for options at levels which encourage
participation of all buyers.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Liu:2012:EMM,
author = "Ziyang Liu and Yi Chen",
title = "Exploiting and Maintaining Materialized Views for
{XML} Keyword Queries",
journal = j-TOIT,
volume = "12",
number = "2",
pages = "6:1--6:??",
month = dec,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2390209.2390212",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Dec 15 19:32:37 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Keyword query is a user-friendly mechanism for
retrieving useful information from XML data in Web and
scientific applications. Inspired by the performance
benefits of exploiting materialized views when
processing structured queries, we investigate the
feasibility and present a general framework for
answering XML keyword queries using materialized views.
Then we develop an XML keyword search engine that
leverages materialized views for query evaluation and
maintains materialized views incrementally upon XML
data update. Experimental evaluation demonstrates the
significance and efficiency of our approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ardagna:2013:PUA,
author = "Claudio A. Ardagna and Sushil Jajodia and Pierangela
Samarati and Angelos Stavrou",
title = "Providing Users' Anonymity in Mobile Hybrid Networks",
journal = j-TOIT,
volume = "12",
number = "3",
pages = "7:1--7:??",
month = may,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2461321.2461322",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat May 25 16:26:39 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We present a novel hybrid communication protocol that
guarantees mobile users' anonymity against a wide-range
of adversaries by exploiting the capability of handheld
devices to connect to both WiFi and cellular networks.
Unlike existing anonymity schemes, we consider all
parties that can intercept communications between a
mobile user and a server as potential privacy threats.
We formally quantify the privacy exposure and the
protection of our system in the presence of malicious
neighboring peers, global WiFi eavesdroppers, and
omniscient mobile network operators, which possibly
collude to breach user's anonymity or disrupt the
communication. We also describe how a micropayment
scheme that suits our mobile scenario can provide
incentives for peers to collaborate in the protocol.
Finally, we evaluate the network overhead and attack
resiliency of our protocol using a prototype
implementation deployed in Emulab and Orbit, and our
probabilistic model.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Pranata:2013:MDR,
author = "Ilung Pranata and Rukshan Athauda and Geoff Skinner",
title = "Modeling Decentralized Reputation-Based Trust for
Initial Transactions in Digital Environments",
journal = j-TOIT,
volume = "12",
number = "3",
pages = "8:1--8:??",
month = may,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2461321.2461323",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat May 25 16:26:39 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The advent of digital environments has generated
significant benefits for businesses, organizations,
governments, academia and societies in general. Today,
over millions of transactions take place on the
Internet. Although the widespread use of digital
environments has generally provided opportunities for
societies, a number of threats have limited their
adoption. The de-facto standard today is for
certification authorities to authenticate the identity
of service providers while trust on the provided
services is implied. This approach has certain
shortcomings, for example, single point of failure,
implied trust rather than explicit trust and others.
One approach for minimizing such threats is to
introduce an effective and resilient trust mechanism
that is capable of determining the trustworthiness of
service providers in providing their services.
Determining the trustworthiness of services reduces
invalid transactions in digital environments and
further encourages collaborations. Evaluating
trustworthiness of a service provider without any prior
historical transactions (i.e. the initial transaction)
pose a number of challenging issues. This article
presents TIDE --- a decentralized reputation trust
mechanism that determines the initial trustworthiness
of entities in digital environments. TIDE improves the
precision of trust computation by considering raters'
feedback, number of transactions, credibility,
incentive to encourage raters' participation, strategy
for updating raters' category, and safeguards against
dynamic personalities. Furthermore, TIDE classifies
raters into three categories and promotes the
flexibility and customization through its parameters.
Evaluation of TIDE against several attack vectors
demonstrates its accuracy, robustness and resilience.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yuan:2013:PVQ,
author = "Lihua Yuan and Chao-Chih Chen and Prasant Mohapatra
and Chen-Nee Chuah and Krishna Kant",
title = "A Proxy View of Quality of {Domain Name Service},
Poisoning Attacks and Survival Strategies",
journal = j-TOIT,
volume = "12",
number = "3",
pages = "9:1--9:??",
month = may,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2461321.2461324",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat May 25 16:26:39 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Domain Name System (DNS) provides a critical
service for the Internet --- mapping of user-friendly
domain names to their respective IP addresses. Yet,
there is no standard set of metrics quantifying the
Quality of Domain Name Service (QoDNS), let alone a
thorough evaluation of it. This article attempts to
fill this gap from the perspective of a DNS
proxy/cache, which is the bridge between clients and
authoritative servers. We present an analytical model
of DNS proxy operations that offers insights into the
design trade-offs of DNS infrastructure and the
selection of critical DNS parameters. Due to the
critical role DNS proxies play in QoDNS, they are the
focus of attacks including cache poisoning attack. We
extend the analytical model to study DNS cache
poisoning attacks and their impact on QoDNS metrics.
This analytical study prompts us to present Domain Name
Cross-Referencing (DoX), a peer-to-peer systems for DNS
proxies to cooperatively defend cache poisoning
attacks. Based on QoDNS, we compare DoX with the
cryptography-based DNS Security Extension (DNSSEC) to
understand their relative merits.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Singh:2013:VT,
author = "Munindar P. Singh",
title = "Vision for {TOIT}",
journal = j-TOIT,
volume = "12",
number = "4",
pages = "10:1--10:??",
month = jul,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2499926.2499929",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Jul 27 08:21:55 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Singh:2013:TAU,
author = "Munindar P. Singh",
title = "{TOIT} Administrative Updates",
journal = j-TOIT,
volume = "12",
number = "4",
pages = "11:1--11:??",
month = jul,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2499926.2499930",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Jul 27 08:21:55 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Wang:2013:WAM,
author = "Meng Wang and Guangda Li and Zheng Lu and Yue Gao and
Tat-Seng Chua",
title = "When {Amazon} Meets {Google}: Product Visualization by
Exploring Multiple {Web} Sources",
journal = j-TOIT,
volume = "12",
number = "4",
pages = "12:1--12:??",
month = jul,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2492690",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Jul 27 08:21:55 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Product visualization is able to help users easily get
knowledge about the visual appearance of a product. It
is useful in many application and commercialization
scenarios. However, the existing product image search
on e-commerce Web sites or general search engines
usually get insufficient search results or return
images that are redundant and not relevant enough. In
this article, we present a novel product visualization
approach that automatically collects a set of diverse
and relevant product images by exploring multiple Web
sources. Our approach simultaneously leverages Amazon
and Google image search engines, which represent
domain-specific knowledge resource and general Web
information collection, respectively. We propose a
conditional clustering approach that is formulated as
an affinity propagation problem regarding the Amazon
examples as information prior. The ranking information
of Google image search results is also explored. In
this way, a set of exemplars can be found from the
Google search results and they are provided together
with the Amazon example images for product
visualization. Experiments demonstrate the feasibility
and effectiveness of our approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Liang:2013:SSO,
author = "Yu-Li Liang and Xinyu Xing and Hanqiang Cheng and
Jianxun Dang and Sui Huang and Richard Han and Xue Liu
and Qin Lv and Shivakant Mishra",
title = "{SafeVchat}: a System for Obscene Content Detection in
Online Video Chat Services",
journal = j-TOIT,
volume = "12",
number = "4",
pages = "13:1--13:??",
month = jul,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2499926.2499927",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Jul 27 08:21:55 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Online video chat services such as Chatroulette,
Omegle, and vChatter that randomly match pairs of users
in video chat sessions are quickly becoming very
popular, with over a million users per month in the
case of Chatroulette. A key problem encountered in such
systems is the presence of flashers and obscene
content. This problem is especially acute given the
presence of underage minors in such systems. This
article presents SafeVchat, a novel solution to the
problem of flasher detection that employs an array of
image detection algorithms. A key contribution of the
article concerns how the results of the individual
detectors are fused together into an overall decision
classifying a user as misbehaving or not, based on
Dempster-Shafer theory. The article introduces a novel,
motion-based skin detection method that achieves
significantly higher recall and better precision. The
proposed methods have been evaluated over real-world
data and image traces obtained from Chatroulette.com.
SafeVchat has been deployed in Chatroulette. A
combination of SafeVchat with human moderation has
resulted in banning as many as 50,000 inappropriate
users per day on Chatoulette. Furthermore, offensive
content on Chatoulette has dropped significantly from
33.08\% (before SafeVchat installation) to 3.49\%
(after SafeVchat installation).",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Shue:2013:RRC,
author = "Craig A. Shue and Andrew J. Kalafut",
title = "Resolvers Revealed: Characterizing {DNS} Resolvers and
their Clients",
journal = j-TOIT,
volume = "12",
number = "4",
pages = "14:1--14:??",
month = jul,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2499926.2499928",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Jul 27 08:21:55 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Domain Name System (DNS) allows clients to use
resolvers, sometimes called caches, to query a set of
authoritative servers to translate host names into IP
addresses. Prior work has proposed using the
interaction between these DNS resolvers and the
authoritative servers as an access control mechanism.
However, while prior work has examined the DNS from
many angles, the resolver component has received little
scrutiny. Essential factors for using a resolver in an
access control system, such as whether a resolver is
part of an ISP's infrastructure or running on an
end-user's system, have not been examined. In this
study, we examine DNS resolver behavior and usage, from
query patterns and reactions to nonstandard responses
to passive association techniques to pair resolvers
with their client hosts. In doing so, we discover
evidence of security protocol support, misconfigured
resolvers, techniques to fingerprint resolvers, and
features for detecting automated clients. These
measurements can influence the implementation and
design of these resolvers and DNS-based access control
systems.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Li:2013:CBA,
author = "Xitong Li and Stuart E. Madnick and Hongwei Zhu",
title = "A Context-Based Approach to Reconciling Data
Interpretation Conflicts in {Web} Services
Composition",
journal = j-TOIT,
volume = "13",
number = "1",
pages = "1:1--1:??",
month = nov,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2532638",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Dec 3 18:44:00 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We present a comprehensive classification of data
misinterpretation problems and develop an approach to
automatic detection and reconciliation of data
interpretation conflicts in Web services composition.
The approach uses a lightweight ontology augmented with
modifiers, contexts, and atomic conversions between the
contexts. The WSDL descriptions of Web services are
annotated to establish correspondences to the ontology.
Given the naive Business Process Execution Language
(BPEL) specification of the desired Web services
composition with data interpretation conflicts, the
approach can automatically detect the conflicts and
produce the corresponding mediated BPEL. Finally, we
develop a prototype to validate and evaluate the
approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Sun:2013:IUP,
author = "San-Tsai Sun and Eric Pospisil and Ildar Muslukhov and
Nuray Dindar and Kirstie Hawkey and Konstantin
Beznosov",
title = "Investigating Users' Perspectives of {Web} Single
Sign-On: Conceptual Gaps and Acceptance Model",
journal = j-TOIT,
volume = "13",
number = "1",
pages = "2:1--2:??",
month = nov,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2532639",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Dec 3 18:44:00 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "OpenID and OAuth are open and simple Web SSO protocols
that have been adopted by major service providers, and
millions of supporting Web sites. However, the average
user's perception of Web SSO is still poorly
understood. Through several user studies, this work
investigates users' perceptions and concerns when using
Web SSO for authentication. We found that our
participants had several misconceptions and concerns
that impeded their adoption. This ranged from their
inadequate mental models of Web SSO, to their concerns
about personal data exposure, and a reduction in
perceived Web SSO value due to the employment of
password management practices. Informed by our
findings, we offer a Web SSO technology acceptance
model, and suggest design improvements.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Albanese:2013:MRS,
author = "Massimiliano Albanese and Antonio d'Acierno and
Vincenzo Moscato and Fabio Persia and Antonio
Picariello",
title = "A Multimedia Recommender System",
journal = j-TOIT,
volume = "13",
number = "1",
pages = "3:1--3:??",
month = nov,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2532640",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Dec 3 18:44:00 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The extraordinary technological progress we have
witnessed in recent years has made it possible to
generate and exchange multimedia content at an
unprecedented rate. As a consequence, massive
collections of multimedia objects are now widely
available to a large population of users. As the task
of browsing such large collections could be daunting,
Recommender Systems are being developed to assist users
in finding items that match their needs and
preferences. In this article, we present a novel
approach to recommendation in multimedia browsing
systems, based on modeling recommendation as a social
choice problem. In social choice theory, a set of
voters is called to rank a set of alternatives, and
individual rankings are aggregated into a global
ranking. In our formulation, the set of voters and the
set of alternatives both coincide with the set of
objects in the data collection. We first define what
constitutes a choice in the browsing domain and then
define a mechanism to aggregate individual choices into
a global ranking. The result is a framework for
computing customized recommendations by originally
combining intrinsic features of multimedia objects,
past behavior of individual users, and overall behavior
of the entire community of users. Recommendations are
ranked using an importance ranking algorithm that
resembles the well-known PageRank strategy. Experiments
conducted on a prototype of the proposed system confirm
the effectiveness and efficiency of our approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Sayyadi:2013:GAA,
author = "Hassan Sayyadi and Louiqa Raschid",
title = "A Graph Analytical Approach for Topic Detection",
journal = j-TOIT,
volume = "13",
number = "2",
pages = "4:1--4:??",
month = dec,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2542214.2542215",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Dec 23 18:38:12 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Topic detection with large and noisy data collections
such as social media must address both scalability and
accuracy challenges. KeyGraph is an efficient method
that improves on current solutions by considering
keyword cooccurrence. We show that KeyGraph has similar
accuracy when compared to state-of-the-art approaches
on small, well-annotated collections, and it can
successfully filter irrelevant documents and identify
events in large and noisy social media collections. An
extensive evaluation using Amazon's Mechanical Turk
demonstrated the increased accuracy and high precision
of KeyGraph, as well as superior runtime performance
compared to other solutions.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bicakci:2013:LSS,
author = "Kemal Bicakci and Bruno Crispo and Gabriele Oligeri",
title = "{LAKE}: a Server-Side Authenticated Key-Establishment
with Low Computational Workload",
journal = j-TOIT,
volume = "13",
number = "2",
pages = "5:1--5:??",
month = dec,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2542214.2542216",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Dec 23 18:38:12 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Server-side authenticated key-establishment protocols
are characterized by placing a heavy workload on the
server. We propose LAKE: a new protocol that enables
amortizing servers' workload peaks by moving most of
the computational burden to the clients. We provide a
formal analysis of the LAKE protocol under the
Canetti-Krawczyk model and prove it to be secure. To
the best of our knowledge, this is the most
computationally efficient authenticated
key-establishment ever proposed in the literature.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Jordan:2013:UIR,
author = "Scott Jordan and Gwen Shaffer",
title = "User and {ISP} Rights of Device Attachment and Device
Management",
journal = j-TOIT,
volume = "13",
number = "2",
pages = "6:1--6:??",
month = dec,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2513227",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Dec 23 18:38:12 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Internet research often assumes users may connect
devices without consent by their service providers.
However, in many networks the service provider only
allows use of devices obtained directly from the
provider. We review how United States communications
law addresses the rights of users to connect devices of
their choice. We explicate a set of user and service
provider rights. We propose legal requirements for
attachment and management of devices. We illustrate how
these proposed regulations would affect the services
currently offered on telephone, cable, satellite, video
networks, and cellular networks, as well as on the
Internet.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Chu:2014:DDM,
author = "Xiaowen Chu and Xiaowei Chen and Adele Lu Jia and
Johan A. Pouwelse and Dick H. J. Epema",
title = "Dissecting {Darknets}: Measurement and Performance
Analysis",
journal = j-TOIT,
volume = "13",
number = "3",
pages = "7:1--7:??",
month = may,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2611527",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jun 3 14:03:29 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "BitTorrent (BT) plays an important role in Internet
content distribution. Because public BTs suffer from
the free-rider problem, Darknets are becoming
increasingly popular, which use Sharing Ratio
Enforcement to increase their efficiency. We crawled
and traced 17 Darknets from September 2009 to February
2011, and obtained datasets about over 5 million
torrents. We conducted a broad range of measurements,
including traffic, sites, torrents, and users
activities. We found that some of the features of
Darknets are noticeably different from public BTs. The
results of our study reflect both macroscopic and
microscopic aspects of the overall ecosystem of
BitTorrent Darknets.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Karame:2014:MMW,
author = "Ghassan O. Karame and Aur{\'e}lien Francillon and
Victor Budilivschi and Srdjan Capkun and Vedran
Capkun",
title = "Microcomputations as Micropayments in {Web}-based
Services",
journal = j-TOIT,
volume = "13",
number = "3",
pages = "8:1--8:??",
month = may,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2611526",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jun 3 14:03:29 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In this article, we propose a new micropayment model
for nonspecialized commodity web-services based on
microcomputations. In our model, a user that wishes to
access online content (offered by a website) does not
need to register or pay to access the website; instead,
he will accept to run microcomputations on behalf of
the service provider in exchange for access to the
content. These microcomputations can, for example,
support ongoing computing projects that have clear
social benefits (e.g., projects relating to medical
research) or can contribute towards commercial
computing projects. We analyze the security and privacy
of our proposal and we show that it preserves the
privacy of users. We argue that this micropayment model
is economically and technically viable and that it can
be integrated in existing distributed computing
frameworks (e.g., the BOINC platform). In this respect,
we implement a prototype of a system based on our model
and we deploy our prototype on Amazon Mechanical Turk
to evaluate its performance and usability given a large
number of users. Our results show that our proposed
scheme does not affect the browsing experience of users
and is likely to be used by a non-trivial proportion of
users. Finally, we empirically show that our scheme
incurs comparable bandwidth and CPU consumption to the
resource usage incurred by online advertisements
featured in popular websites.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Blackburn:2014:COG,
author = "Jeremy Blackburn and Nicolas Kourtellis and John
Skvoretz and Matei Ripeanu and Adriana Iamnitchi",
title = "Cheating in Online Games: a Social Network
Perspective",
journal = j-TOIT,
volume = "13",
number = "3",
pages = "9:1--9:??",
month = may,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2602570",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jun 3 14:03:29 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Online gaming is a multi-billion dollar industry that
entertains a large, global population. One unfortunate
phenomenon, however, poisons the competition and spoils
the fun: cheating. The costs of cheating span from
industry-supported expenditures to detect and limit it,
to victims' monetary losses due to cyber crime. This
article studies cheaters in the Steam Community, an
online social network built on top of the world's
dominant digital game delivery platform. We collected
information about more than 12 million gamers connected
in a global social network, of which more than 700
thousand have their profiles flagged as cheaters. We
also observed timing information of the cheater flags,
as well as the dynamics of the cheaters' social
neighborhoods. We discovered that cheaters are well
embedded in the social and interaction networks: their
network position is largely indistinguishable from that
of fair players. Moreover, we noticed that the number
of cheaters is not correlated with the geographical,
real-world population density, or with the local
popularity of the Steam Community. Also, we observed a
social penalty involved with being labeled as a
cheater: cheaters lose friends immediately after the
cheating label is publicly applied. Most importantly,
we observed that cheating behavior spreads through a
social mechanism: the number of cheater friends of a
fair player is correlated with the likelihood of her
becoming a cheater in the future. This allows us to
propose ideas for limiting cheating contagion.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Guo:2014:CAC,
author = "Tian Guo and Upendra Sharma and Prashant Shenoy and
Timothy Wood and Sambit Sahu",
title = "Cost-Aware Cloud Bursting for Enterprise
Applications",
journal = j-TOIT,
volume = "13",
number = "3",
pages = "10:1--10:??",
month = may,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2602571",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jun 3 14:03:29 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The high cost of provisioning resources to meet peak
application demands has led to the widespread adoption
of pay-as-you-go cloud computing services to handle
workload fluctuations. Some enterprises with existing
IT infrastructure employ a hybrid cloud model where the
enterprise uses its own private resources for the
majority of its computing, but then ``bursts'' into the
cloud when local resources are insufficient. However,
current commercial tools rely heavily on the system
administrator's knowledge to answer key questions such
as when a cloud burst is needed and which applications
must be moved to the cloud. In this article, we
describe Seagull, a system designed to facilitate cloud
bursting by determining which applications should be
transitioned into the cloud and automating the movement
process at the proper time. Seagull optimizes the
bursting of applications using an optimization
algorithm as well as a more efficient but approximate
greedy heuristic. Seagull also optimizes the overhead
of deploying applications into the cloud using an
intelligent precopying mechanism that proactively
replicates virtualized applications, lowering the
bursting time from hours to minutes. Our evaluation
shows over 100\% improvement compared to na{\"\i}ve
solutions but produces more expensive solutions
compared to ILP. However, the scalability of our greedy
algorithm is dramatically better as the number of VMs
increase. Our evaluation illustrates scenarios where
our prototype can reduce cloud costs by more than 45\%
when bursting to the cloud, and that the incremental
cost added by precopying applications is offset by a
burst time reduction of nearly 95\%.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bai:2014:PTK,
author = "Xiao Bai and Rachid Guerraoui and Anne-Marie
Kermarrec",
title = "Personalizing Top-$k$ Processing Online in a
Peer-to-Peer Social Tagging Network",
journal = j-TOIT,
volume = "13",
number = "4",
pages = "11:1--11:??",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2602572",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 8 11:39:42 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The rapidly increasing amount of user-generated
content in social tagging systems provides a huge
source of information. Yet, performing effective search
in these systems is very challenging, especially when
we seek the most appropriate items that match a
potentially ambiguous query. Collaborative
filtering-based personalization is appealing in this
context, as it limits the search within a small network
of participants with similar preferences. Offline
personalization, which consists in maintaining, for
every user, a network of similar participants based on
their tagging behaviors, is effective for queries that
are close to the querying user's tagging profile but
performs poorly when the queries, reflecting emerging
interests, have little correlation with the querying
user's profile. We present P$^2$ TK$^2$, the first
protocol to personalize query processing in social
tagging systems online. P$^2$ TK$^2$ is completely
decentralized, and this design choice stems from the
observation that the evolving social tagging systems
naturally resemble P2P systems where users are both
producers and consumers. This design exploits the power
of the crowd and prevents any central authority from
controlling personal information. P$^2$ TK$^2$ is
gossip-based and probabilistic. It dynamically
associates each user with social acquaintances sharing
similar tagging behaviors. Appropriate users for
answering a query are discovered at query time with the
help of social acquaintances. This is achieved
according to the hybrid interest of the querying user,
taking into account both her tagging behavior and her
query. Results are iteratively refined and returned to
the querying user. We evaluate P$^2$ TK$^2$ on
CiteULike and Delicious traces involving up to 50,000
users. We highlight the advantages of online
personalization compared to offline personalization, as
well as its efficiency, scalability, and inherent
ability to cope with user departure and interest
evolution in P2P systems.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Benouaret:2014:WSC,
author = "Karim Benouaret and Djamal Benslimane and Allel
Hadjali and Mahmoud Barhamgi and Zakaria Maamar and
Quan Z. Sheng",
title = "{Web} Service Compositions with Fuzzy Preferences: a
Graded Dominance Relationship-Based Approach",
journal = j-TOIT,
volume = "13",
number = "4",
pages = "12:1--12:??",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576231",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 8 11:39:42 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Data-driven Web services build on service-oriented
technologies to provide an interoperable method of
interacting with data sources on top of the Web. Data
Web services composition has emerged as a flexible
solution to answer users' complex queries on the fly.
However, as the number of Web services on the Web grows
quickly, a large number of candidate compositions that
would use different (most likely competing) services
may be used to answer the same query. User preferences
are a key factor that can be used to rank candidate
services/compositions and retain only the best ones. In
this article, we present a novel approach for computing
the top-$k$ data service compositions based on user
preferences. In our approach, we model user preferences
using fuzzy sets and incorporate them into the
composition query. We use an efficient RDF query
rewriting algorithm to determine the relevant services
that may be used to answer the composition query. We
match the (fuzzy) constraints of the relevant services
to those of the query and determine their matching
degrees using a set of matching methods. We then
rank-order the candidate services based on a
fuzzification of Pareto dominance and compute the
top-$k$ data service compositions. In addition, we
introduce a new method for increasing the diversity of
returned top-$k$ compositions while maintaining as much
as possible the compositions with the highest scores.
Finally, we describe the architecture of our system and
present a thorough experimental study of our proposed
techniques and algorithms. The experimental study
demonstrates the efficiency and the effectiveness of
our techniques in different settings.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Geneves:2014:EIX,
author = "Pierre Genev{\`e}s and Nabil Laya{\"\i}da",
title = "Equipping {IDEs} with {XML-Path} Reasoning
Capabilities",
journal = j-TOIT,
volume = "13",
number = "4",
pages = "13:1--13:??",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2602573",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 8 11:39:42 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "One of the challenges in Web development is to achieve
a good level of quality in terms of code size and
runtime performance for popular domain-specific
languages such as XQuery, XSLT, and XML Schema. We
present the first IDE augmented with static detection
of inconsistent XPath expressions that assists the
programmer with simplifying development and debugging
of any application involving XPath expressions. The
tool is based on newly developed formal verification
techniques based on expressive modal logics, which are
now mature enough to be introduced in the process of
software development. We further develop this idea in
the context of XQuery for which we introduce an
analysis for identifying and eliminating dead code
automatically. This proof of concept aims at
illustrating the benefits of equipping modern IDEs with
reasoning capabilities.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Artikis:2014:ERC,
author = "Alexander Artikis and Avigdor Gal and Vana Kalogeraki
and Matthias Weidlich",
title = "Event Recognition Challenges and Techniques: {Guest
Editors}' Introduction",
journal = j-TOIT,
volume = "14",
number = "1",
pages = "1:1--1:??",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2632220",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 8 11:38:18 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Hasan:2014:ASM,
author = "Souleiman Hasan and Edward Curry",
title = "Approximate Semantic Matching of Events for the
{Internet of Things}",
journal = j-TOIT,
volume = "14",
number = "1",
pages = "2:1--2:??",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2633684",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 8 11:38:18 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Event processing follows a decoupled model of
interaction in space, time, and synchronization.
However, another dimension of semantic coupling also
exists and poses a challenge to the scalability of
event processing systems in highly semantically
heterogeneous and dynamic environments such as the
Internet of Things (IoT). Current state-of-the-art
approaches of content-based and concept-based event
systems require a significant agreement between event
producers and consumers on event schema or an external
conceptual model of event semantics. Thus, they do not
address the semantic coupling issue. This article
proposes an approach where participants only agree on a
distributional statistical model of semantics
represented in a corpus of text to derive semantic
similarity and relatedness. It also proposes an
approximate model for relaxing the semantic coupling
dimension via an approximation-enabled rule language
and an approximate event matcher. The model is
formalized as an ensemble of semantic and top-$k$
matchers along with a probability model for uncertainty
management. The model has been empirically validated on
large sets of events and subscriptions synthesized from
real-world smart city and energy management systems.
Experiments show that the proposed model achieves more
than 95\% F$_1$ Score of effectiveness and thousands of
events/sec of throughput for medium degrees of
approximation while not requiring users to have
complete prior knowledge of event semantics. In
semantically loosely-coupled environments, one
approximate subscription can compensate for hundreds of
exact subscriptions to cover all possibilities in
environments which require complete prior knowledge of
event semantics. Results indicate that approximate
semantic event processing could play a promising role
in the IoT middleware layer.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Molinaro:2014:PPA,
author = "Cristian Molinaro and Vincenzo Moscato and Antonio
Picariello and Andrea Pugliese and Antonino Rullo and
V. S. Subrahmanian",
title = "{PADUA: Parallel Architecture to Detect Unexplained
Activities}",
journal = j-TOIT,
volume = "14",
number = "1",
pages = "3:1--3:??",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2633685",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 8 11:38:18 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "There are numerous applications (e.g., video
surveillance, fraud detection, cybersecurity) in which
we wish to identify unexplained sets of events. Most
related past work has been domain-dependent (e.g.,
video surveillance, cybersecurity) and has focused on
the valuable class of statistical anomalies in which
statistically unusual events are considered. In
contrast, suppose there is a set $A$ of known activity
models (both harmless and harmful) and a log $L$ of
time-stamped observations. We define a part $ L'
\subseteq L$ of the log to represent an unexplained
situation when none of the known activity models can
explain $ L'$ with a score exceeding a user-specified
threshold. We represent activities via probabilistic
penalty graphs (PPGs) and show how a set of PPGs can be
combined into one Super-PPG for which we define an
index structure. Given a compute cluster of $ (K + 1)$
nodes (one of which is a master node), we show how to
split a Super-PPG into $K$ subgraphs, each of which can
be independently processed by a compute node. We
provide algorithms for the individual compute nodes to
ensure seamless handoffs that maximally leverage
parallelism. PADUA is domain-independent and can be
applied to many domains (perhaps with some
specialization). We conducted detailed experiments with
PADUA on two real-world datasets-the ITEA CANDELA video
surveillance dataset and a network traffic dataset
appropriate for cybersecurity applications. PADUA
scales extremely well with the number of processors and
significantly outperforms past work both in accuracy
and time. Thus, PADUA represents the first parallel
architecture and algorithm for identifying unexplained
situations in observation data, offering both
scalability and accuracy.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Mutschler:2014:ASP,
author = "Christopher Mutschler and Michael Philippsen",
title = "Adaptive Speculative Processing of Out-of-Order Event
Streams",
journal = j-TOIT,
volume = "14",
number = "1",
pages = "4:1--4:??",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2633686",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 8 11:38:18 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Distributed event-based systems are used to detect
meaningful events with low latency in high data-rate
event streams that occur in surveillance, sports,
finances, etc. However, both known approaches to
dealing with the predominant out-of-order event arrival
at the distributed detectors have their shortcomings:
buffering approaches introduce latencies for event
ordering, and stream revision approaches may result in
system overloads due to unbounded retraction cascades.
This article presents an adaptive speculative
processing technique for out-of-order event streams
that enhances typical buffering approaches. In contrast
to other stream revision approaches developed so far,
our novel technique encapsulates the event detector,
uses the buffering technique to delay events but also
speculatively processes a portion of it, and adapts the
degree of speculation at runtime to fit the available
system resources so that detection latency becomes
minimal. Our technique outperforms known approaches on
both synthetical data and real sensor data from a
realtime locating system (RTLS) with several thousands
of out-of-order sensor events per second. Speculative
buffering exploits system resources and reduces latency
by 40\% on average.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Wilkin:2014:DFT,
author = "Gregory Aaron Wilkin and Patrick Eugster and K. R.
Jayaram",
title = "Decentralized Fault-Tolerant Event Correlation",
journal = j-TOIT,
volume = "14",
number = "1",
pages = "5:1--5:??",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2633687",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 8 11:38:18 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Despite the prognosed use of event correlation
techniques for monitoring critical complex
infrastructures or dealing with disasters in the
physical world, little work exists on making event
correlation systems themselves tolerant to failure.
Existing systems either provide no guarantees on event
deliveries, do not support multicast and thus provide
no guarantees across individual processes, or then rely
on centralized components or strong assumptions on the
infrastructure. The FAIDECS system attempts to
reconcile strong guarantees with practical performance
in the presence of process crash failures. To that end,
the FAIDECS system uses an overlay network with
specific guarantees aligned with its proposed
correlation language and guarantees. However, the
language proposed lacks expressivity, and the system
itself supports only very specific rigid semantics,
incapable of supporting even fundamental features like
sliding windows. After providing a comprehensive
overview of the FAIDECS model and system, this article
bridges the gap between strong guarantees and more
established correlation languages and systems in
several steps. First, we propose alternative semantics
for several modules of the FAIDECS matching engine and
revisit guarantees. Second, we pinpoint which
guarantees are contradicted by which combinations of
semantic options. Third, we investigate four
correlation languages-StreamSQL, EQL, CEL, and
TESLA-showing which semantic options their respective
features correspond to in our model, and thus,
ultimately, which guarantees of FAIDECS are maintained
by which language features.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ottenwalder:2014:MMA,
author = "Beate Ottenw{\"a}lder and Boris Koldehofe and Kurt
Rothermel and Kirak Hong and David Lillethun and
Umakishore Ramachandran",
title = "{MCEP}: a Mobility-Aware Complex Event Processing
System",
journal = j-TOIT,
volume = "14",
number = "1",
pages = "6:1--6:??",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2633688",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 8 11:38:18 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "With the proliferation of mobile devices and sensors,
complex event processing (CEP) is becoming increasingly
important to scalably detect situations in real time.
Current CEP systems are not capable of dealing
efficiently with highly dynamic mobile consumers whose
interests change with their location. We introduce the
distributed mobile CEP (MCEP) system which
automatically adapts the processing of events according
to a consumer's location. MCEP significantly reduces
latency, network utilization, and processing overhead
by providing on-demand and opportunistic adaptation
algorithms to dynamically assign event streams and
computing resources to operators of the MCEP system.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Glavic:2014:ESP,
author = "Boris Glavic and Kyumars Sheykh Esmaili and Peter M.
Fischer and Nesime Tatbul",
title = "Efficient Stream Provenance via Operator
Instrumentation",
journal = j-TOIT,
volume = "14",
number = "1",
pages = "7:1--7:??",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2633689",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 8 11:38:18 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Managing fine-grained provenance is a critical
requirement for data stream management systems (DSMS),
not only for addressing complex applications that
require diagnostic capabilities and assurance, but also
for providing advanced functionality, such as revision
processing or query debugging. This article introduces
a novel approach that uses operator instrumentation,
that is, modifying the behavior of operators, to
generate and propagate fine-grained provenance through
several operators of a query network. In addition to
applying this technique to compute provenance eagerly
during query execution, we also study how to decouple
provenance computation from query processing to reduce
runtime overhead and avoid unnecessary provenance
retrieval. Our proposals include computing a concise
superset of the provenance (to allow lazily replaying a
query and reconstruct its provenance) as well as lazy
retrieval (to avoid unnecessary reconstruction of
provenance). We develop stream-specific compression
methods to reduce the computational and storage
overhead of provenance generation and retrieval.
Ariadne, our provenance-aware extension of the Borealis
DSMS implements these techniques. Our experiments
confirm that Ariadne manages provenance with minor
overhead and clearly outperforms query rewrite, the
current state of the art.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Courcoubetis:2014:SIP,
author = "Costas Courcoubetis and Roch Gu{\'e}rin and Patrick
Loiseau and David Parkes and Jean Walrand and Adam
Wierman",
title = "Special Issue on Pricing and Incentives in Networks
and Systems: {Guest Editors}' Introduction",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "8:1--8:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2665064",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Abbassi:2014:DCC,
author = "Zeinab Abbassi and Nidhi Hegde and Laurent
Massouli{\'e}",
title = "Distributed Content Curation on the {Web}",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "9:1--9:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663489",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In recent years there has been an explosive growth of
digital content in the form of news feeds, videos, and
original content on online platforms such as blogs and
social networks. Indeed, such platforms have been used
as a means of sharing and republishing information,
leading to a large collection of content that users
must sift through. We consider the problem of curating
this vast catalogue of content such that aggregators or
publishers can offer readers content that is of
interest to them, with minimal spam. Under a
game-theoretic model we obtain several results on the
optimal content selection and on the efficiency of
distributed curation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Coucheney:2014:ISN,
author = "Pierre Coucheney and Giuseppe D'acquisto and Patrick
Maill{\'e} and Maurizio Naldi and Bruno Tuffin",
title = "Influence of Search Neutrality on the Economics of
Advertisement-Financed Content",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "10:1--10:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663490",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The search neutrality debate questions the ranking
methods of search engines. We analyze the issue when
content providers offer content for free, but get
revenues from advertising. We investigate the
noncooperative game among competing content providers
under different ranking policies. When the search
engine is not involved with high-quality content
providers, it should adopt neutral ranking, also
maximizing user quality-of-experience. If the search
engine controls high-quality content, favoring its
ranking and adding advertisement yield a larger
revenue. Though user perceived quality may not be
impaired, the advertising revenues of the other content
providers drastically decrease.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Altman:2014:RNP,
author = "Eitan Altman and Manjesh Kumar Hanawal and Rajesh
Sundaresan",
title = "Regulation of Off-Network Pricing in a Nonneutral
Network",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "11:1--11:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663491",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Representatives of several Internet service providers
(ISPs) have expressed their wish to see a substantial
change in the pricing policies of the Internet. In
particular, they would like to see content providers
(CPs) pay for use of the network, given the large
amount of resources they use. This would be in clear
violation of the ``network neutrality'' principle that
had characterized the development of the wireline
Internet. Our first goal in this article is to propose
and study possible ways of implementing such payments
and of regulating their amount. We introduce a model
that includes the users' behavior, the utilities of the
ISP and of the CPs, and, the monetary flow that
involves the content users, the ISP and CP, and, in
particular, the CP's revenues from advertisements. We
consider various game models and study the resulting
equilibria; they are all combinations of a
noncooperative game (in which the ISPs and CPs
determine how much they will charge the users) with a
``cooperative'' one on how the CP and the ISP share the
payments. We include in our model a possible asymmetric
weighting parameter (that varies between zero to one).
We also study equilibria that arise when one of the CPs
colludes with the ISP. We also study two dynamic game
models as well as the convergence of prices to the
equilibrium values.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Chau:2014:EVP,
author = "Chi-Kin Chau and Qian Wang and Dah-Ming Chiu",
title = "Economic Viability of {Paris Metro Pricing} for
Digital Services",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "12:1--12:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663492",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Nowadays digital services, such as cloud computing and
network access services, allow dynamic resource
allocation and virtual resource isolation. This trend
can create a new paradigm of flexible pricing schemes.
A simple pricing scheme is to allocate multiple
isolated service classes with differentiated prices,
namely Paris Metro Pricing (PMP). The benefits of PMP
are its simplicity and applicability to a wide variety
of general digital services, without considering
specific performance guarantees for different service
classes. The central issue of our study is whether PMP
is economically viable, namely whether it will produce
more profit for the service provider and whether it
will achieve more social welfare. Prior studies had
only considered specific models and arrived at
conflicting conclusions. In this article, we identify
unifying principles in a general setting and derive
general sufficient conditions that can guarantee the
viability of PMP. We further apply the results to
analyze various examples of digital services.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Guerin:2014:ABS,
author = "Roch Gu{\'e}rin and Jaudelice C. de Oliveira and
Steven Weber",
title = "Adoption of Bundled Services with Network
Externalities and Correlated Affinities",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "13:1--13:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663493",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The goal of this article is to develop a principled
understanding of when it is beneficial to bundle
technologies or services whose value is heavily
dependent on the size of their user base, that is,
exhibits positive exernalities. Of interest is how the
joint distribution, and in particular the correlation,
of the values users assign to components of a bundle
affect its odds of success. The results offer insight
and guidelines for deciding when bundling new Internet
technologies or services can help improve their overall
adoption. In particular, successful outcomes appear to
require a minimum level of value correlation.
Categories and Subject Descriptors (2012): Networks ---
Network Algorithms --- Network economics; Networks ---
Network properties --- Network dynamics; Information
systems --- Information systems applications ---
Collaborative and social computing systems and tools;
Security and privacy --- Human and societal aspects of
security and privacy; Human-centered computing ---
Collaborative and social computing theory, concepts and
paradigms",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Andrews:2014:UQD,
author = "Matthew Andrews and Glenn Bruns and Mustafa Dogru and
Hyoseop Lee",
title = "Understanding Quota Dynamics in Wireless Networks",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "14:1--14:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663494",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In designing new service plans, network service
providers need to understand how consumption of voice
or data service will change in response to pricing
signals. It is difficult to acquire such information
from customer usage data because voice minutes and data
bandwidth are typically sold in the form of large
quotas. We address this issue by studying how end-users
consume their quotas, both in a prepaid setting (where
users pay in advance and refill as needed) and a
postpaid setting (where users pay each month for a
fixed amount of quota). Our presentation has three main
parts. In the first we present data on quota usage for
prepaid voice/text services and show that users reduce
their voice usage when their balances become low.
Moreover, when balances are low there is a tendency to
shift from voice to SMS. In the second part, we provide
descriptive models of both prepaid and postpaid
services. The main feature of these models is that
there is a background level of potential demand and the
rate at which this potential demand is realized depends
on the amount of quota balance available. In the third
part, we propose utility maximizing models that can
account for this type of behavior. In the prepaid case
the main feature of the model is a discount function
that represents the perceived cost to the user of a
quota refill that will occur sometime in the future. In
the postpaid case, where the end-user is attempting to
get the maximum amount of utility from his monthly
quota, we present a dynamic programming formulation in
which utility functions are time varying and not known
to the user in advance.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Kavurmacioglu:2014:DIP,
author = "Emir Kavurmacioglu and Murat Alanyali and David
Starobinski",
title = "Demand-Invariant Price Relationships and Market
Outcomes in Competitive Private Commons",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "15:1--15:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663495",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We introduce a private commons model that consists of
network providers who serve a fixed primary demand and
strategically price to improve their revenues from an
additional secondary demand. For general forms of
secondary demand, we establish the existence and
uniqueness of two characteristic prices: the break-even
price and the market sharing price. We show that the
market sharing price is always greater than the
break-even price, leading to a price interval in which
a provider is both profitable and willing to share the
demand. Making use of this result, we give insight into
the nature of market outcomes.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "15",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Hoefer:2014:AAS,
author = "Martin Hoefer and Thomas Kesselheim and Berthold
V{\"o}cking",
title = "Approximation Algorithms for Secondary Spectrum
Auctions",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "16:1--16:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663496",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We study combinatorial auctions for secondary spectrum
markets, where short-term communication licenses are
sold to wireless nodes. Channels can be assigned to
multiple bidders according to interference constraints
captured by a conflict graph. We suggest a novel
approach to such combinatorial auctions using a graph
parameter called inductive independence number. We
achieve good approximation results by showing that
interference constraints for wireless networks imply a
bounded inductive independence number. For example, in
the physical model the factor becomes $ O (\sqrt k
\log^2 n) $ for $n$ bidders and $k$ channels. Our
algorithms can be turned into incentive-compatible
mechanisms for bidders with arbitrary valuations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "16",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Caragiannis:2014:RGG,
author = "Ioannis Caragiannis and Christos Kaklamanis and
Panagiotis Kanellopoulos and Maria Kyropoulou",
title = "Revenue Guarantees in the Generalized Second Price
Auction",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "17:1--17:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663497",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Sponsored search auctions are the main source of
revenue for search engines. In such an auction, a set
of utility maximizing advertisers competes for a set of
ad slots. The assignment of advertisers to slots
depends on the bids they submit; these bids may be
different than the true valuations of the advertisers
for the slots. Variants of the celebrated VCG auction
mechanism guarantee that advertisers act truthfully
and, under some assumptions, lead to revenue or social
welfare maximization. Still, the sponsored search
industry mostly uses generalized second price (GSP)
auctions; these auctions are known to be nontruthful
and suboptimal in terms of social welfare and revenue.
In an attempt to explain this tradition, we study a
Bayesian setting wherein the valuations of advertisers
are drawn independently from a common regular
probability distribution. In this setting, it is well
known from the work of Myerson [1981] that the optimal
revenue is obtained by the VCG mechanism with a
particular reserve price that depends on the
probability distribution. We show that, by
appropriately setting the reserve price, the revenue
over any Bayes-Nash equilibrium of the game induced by
the GSP auction is at most a small constant factor away
from the optimal revenue, improving previous results of
Lucier et al. [2012]. Our analysis is based on the
Bayes-Nash equilibrium conditions and the improved
results are obtained by bounding the utility of each
player at equilibrium using infinitely many deviating
bids and also by developing novel prophet-like
inequalities.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "17",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Doncel:2014:PAR,
author = "Josu Doncel and Urtzi Ayesta and Olivier Brun and
Balakrishna Prabhu",
title = "Is the Price of Anarchy the Right Measure for
Load-Balancing Games?",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "18:1--18:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663498",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Price of anarchy is an oft-used worst-case measure of
the inefficiency of noncooperative decentralized
architectures. For a noncooperative load-balancing game
with two classes of servers and for a finite or
infinite number of dispatchers, we show that the price
of anarchy is an overly pessimistic measure that does
not reflect the performance obtained in most instances
of the problem. We explicitly characterize the
worst-case traffic conditions for the efficiency of
noncooperative load-balancing schemes and show that,
contrary to a common belief, the worst inefficiency is
in general not achieved in heavy traffic.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "18",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Laszka:2014:STC,
author = "Aron Laszka and Benjamin Johnson and Pascal
Sch{\"o}ttle and Jens Grossklags and Rainer B{\"o}hme",
title = "Secure Team Composition to Thwart Insider Threats and
Cyber-Espionage",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "19:1--19:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663499",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We develop a formal nondeterministic game model for
secure team composition to counter cyber-espionage and
to protect organizational secrets against an attacker
who tries to sidestep technical security mechanisms by
offering a bribe to a project team member. The game
captures the adversarial interaction between the
attacker and the project manager who has a secret she
wants to protect but must share with a team of
individuals selected from within her organization. Our
interdisciplinary work is important in the face of the
multipronged approaches utilized by well-motivated
attackers to circumvent the fortifications of otherwise
well-defended targets.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "19",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ye:2014:EMD,
author = "Zhen Ye and Athman Bouguettaya and Xiaofang Zhou",
title = "Economic Model-Driven Cloud Service Composition",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "20:1--20:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2651420",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article considers cloud service composition from
a decision analysis perspective. Traditional QoS-aware
composition techniques usually consider the qualities
available at the time of the composition because
compositions are usually immediately consumed. This is
fundamentally different in the cloud environment where
the cloud service composition typically lasts for a
relatively long period of time. The two most important
drivers when composing cloud service are the long-term
nature of the composition and the economic motivation
for outsourcing tasks to the cloud. We propose an
economic model, which we represent as a Bayesian
network, to select and compose cloud services. We then
leverage influence diagrams to model the cloud service
composition. We further extend the traditional
influence diagram problem to a hybrid one and adopt an
extended Shenoy-Shafer architecture to solve such
hybrid influence diagrams that include deterministic
chance nodes. In addition, analytical and simulation
results are presented to show the performance of the
proposed composition approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "20",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Chowdhury:2014:RWR,
author = "Soudip Roy Chowdhury and Florian Daniel and Fabio
Casati",
title = "Recommendation and Weaving of Reusable Mashup Model
Patterns for Assisted Development",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "21:1--21:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663500",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "With this article, we give an answer to one of the
open problems of mashup development that users may face
when operating a model-driven mashup tool, namely the
lack of modeling expertise. Although commonly
considered simple applications, mashups can also be
complex software artifacts depending on the number and
types of Web resources (the components) they integrate.
Mashup tools have undoubtedly simplified mashup
development, yet the problem is still generally
nontrivial and requires intimate knowledge of the
components provided by the mashup tool, its underlying
mashup paradigm, and of how to apply such to the
integration of the components. This knowledge is
generally neither intuitive nor standardized across
different mashup tools and the consequent lack of
modeling expertise affects both skilled programmers and
end-user programmers alike. In this article, we show
how to effectively assist the users of mashup tools
with contextual, interactive recommendations of
composition knowledge in the form of reusable mashup
model patterns. We design and study three different
recommendation algorithms and describe a pattern
weaving approach for the one-click reuse of composition
knowledge. We report on the implementation of three
pattern recommender plugins for different mashup tools
and demonstrate via user studies that recommending and
weaving contextual mashup model patterns significantly
reduces development times in all three cases.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "21",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Chopra:2014:ISI,
author = "Amit K. Chopra and Raian Ali and Maja Vukovic",
title = "Introduction to the Special Issue on Foundations of
Social Computing",
journal = j-TOIT,
volume = "14",
number = "4",
pages = "22:1--22:??",
month = dec,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2680536",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Wed Jan 7 15:19:30 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "22",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Baldoni:2014:CBI,
author = "Matteo Baldoni and Cristina Baroglio and Federico
Capuzzimati",
title = "A Commitment-Based Infrastructure for Programming
Socio-Technical Systems",
journal = j-TOIT,
volume = "14",
number = "4",
pages = "23:1--23:??",
month = dec,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2677206",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Wed Jan 7 15:19:30 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Socio-Technical Systems demand an evolution of
computing into social computing, with a transition from
an individualistic to a societal view. As such, they
seem particularly suitable to realize multiparty,
cross-organizational systems. Multi-Agent Systems are a
natural candidate to realize Socio-Technical Systems.
However, while Socio-Technical Systems envisage an
explicit layer that contains the regulations that all
parties must respect in their interaction, and thus
preserve the agents' autonomy, current frameworks and
platforms require to hard-code the coordination
requirements inside the agents. We propose to
explicitly represent the missing layer of
Socio-Technical Systems in terms of social
relationships among the involved parties, that is, in
terms of a set of normatively defined relationships
among two or more parties, subject to social control by
monitoring the observable behaviour. In our proposal,
social relationships are resources, available to
agents, who use them in their practical reasoning. Both
agents and social relationships are first-class
entities of the model. The work also describes
2COMM4JADE, a framework that realizes the proposal by
extending the well-known JADE and CArtAgO. The impact
of the approach on programming is explained both
conceptually and with the help of an example.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "23",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Figueiredo:2014:DSM,
author = "Flavio Figueiredo and Jussara M. Almeida and Marcos
Andr{\'e} Gon{\c{c}}alves and Fabr{\'\i}cio
Benevenuto",
title = "On the Dynamics of Social Media Popularity: a
{YouTube} Case Study",
journal = j-TOIT,
volume = "14",
number = "4",
pages = "24:1--24:??",
month = dec,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2665065",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Wed Jan 7 15:19:30 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Understanding the factors that impact the popularity
dynamics of social media can drive the design of
effective information services, besides providing
valuable insights to content generators and online
advertisers. Taking YouTube as case study, we analyze
how video popularity evolves since upload, extracting
popularity trends that characterize groups of videos.
We also analyze the referrers that lead users to
videos, correlating them, features of the video and
early popularity measures with the popularity trend and
total observed popularity the video will experience.
Our findings provide fundamental knowledge about
popularity dynamics and its implications for services
such as advertising and search.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "24",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Lukasiewicz:2014:OBQ,
author = "Thomas Lukasiewicz and Maria Vanina Martinez and
Gerardo I. Simari and Oana Tifrea-Marciuska",
title = "Ontology-Based Query Answering with Group
Preferences",
journal = j-TOIT,
volume = "14",
number = "4",
pages = "25:1--25:??",
month = dec,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2677207",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Wed Jan 7 15:19:30 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Web has recently been evolving into a system that
is in many ways centered on social interactions and is
now more and more becoming what is called the Social
Semantic Web. One of the many implications of such an
evolution is that the ranking of search results no
longer depends solely on the structure of the
interconnections among Web pages-instead, the social
components must also come into play. In this article,
we argue that such rankings can be based on ontological
background knowledge and on user preferences. Another
aspect that has become increasingly important in recent
times is that of uncertainty management, since
uncertainty can arise due to many uncontrollable
factors. To combine these two aspects, we propose
extensions of the Datalog+/-- family of ontology
languages that both allow for the management of
partially ordered preferences of groups of users as
well as uncertainty, which is represented via a
probabilistic model. We focus on answering k -rank
queries in this context, presenting different
strategies to compute group preferences as an
aggregation of the preferences of a collection of
single users. We also study merging operators that are
useful for combining the preferences of the users with
those induced by the values obtained from the
probabilistic model. We then provide algorithms to
answer k -rank queries for DAQs (disjunctions of atomic
queries) under these group preferences and uncertainty
that generalizes top- k queries based on the iterative
computation of classical skyline answers. We show that
such DAQ answering in Datalog+/-- can be done in
polynomial time in the data complexity, under certain
reasonable conditions, as long as query answering can
also be done in polynomial time (in the data
complexity) in the underlying classical ontology.
Finally, we present a prototype implementation of the
query answering system, as well as experimental results
(on the running time of our algorithms and the quality
of their results) obtained from real-world ontological
data and preference models, derived from information
gathered from real users, showing in particular that
our approach is feasible in practice.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "25",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Silva:2014:RCW,
author = "Thiago H. Silva and Pedro O. S. Vaz de Melo and
Jussara M. Almeida and Juliana Salles and Antonio A. F.
Loureiro",
title = "Revealing the City That We Cannot See",
journal = j-TOIT,
volume = "14",
number = "4",
pages = "26:1--26:??",
month = dec,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2677208",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Wed Jan 7 15:19:30 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We here investigate the potential of participatory
sensor networks derived from location sharing systems,
such as Foursquare, to understand the human dynamics of
cities. We propose the City Image visualization
technique, which builds a transition graph mapping
people's movements between location categories, and
demonstrate its use to identify similarities and
differences of human dynamics across cities by
clustering cities according to their citizens'
routines. We also analyze centrality metrics of the
transition graphs built for different cities,
considering transitions between specific venues. We
show that these metrics complement the City Image
technique, contributing to a deeper understanding of
city dynamics.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "26",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Vosecky:2014:ISA,
author = "Jan Vosecky and Di Jiang and Kenneth Wai-Ting Leung
and Kai Xing and Wilfred Ng",
title = "Integrating Social and Auxiliary Semantics for
Multifaceted Topic Modeling in {Twitter}",
journal = j-TOIT,
volume = "14",
number = "4",
pages = "27:1--27:??",
month = dec,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2651403",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Wed Jan 7 15:19:30 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Microblogging platforms, such as Twitter, have already
played an important role in recent cultural, social and
political events. Discovering latent topics from social
streams is therefore important for many downstream
applications, such as clustering, classification or
recommendation. However, traditional topic models that
rely on the bag-of-words assumption are insufficient to
uncover the rich semantics and temporal aspects of
topics in Twitter. In particular, microblog content is
often influenced by external information sources, such
as Web documents linked from Twitter posts, and often
focuses on specific entities, such as people or
organizations. These external sources provide useful
semantics to understand microblogs and we generally
refer to these semantics as auxiliary semantics. In
this article, we address the mentioned issues and
propose a unified framework for Multifaceted Topic
Modeling from Twitter streams. We first extract social
semantics from Twitter by modeling the social chatter
associated with hashtags. We further extract terms and
named entities from linked Web documents to serve as
auxiliary semantics during topic modeling. The
Multifaceted Topic Model (MfTM) is then proposed to
jointly model latent semantics among the social terms
from Twitter, auxiliary terms from the linked Web
documents and named entities. Moreover, we capture the
temporal characteristics of each topic. An efficient
online inference method for MfTM is developed, which
enables our model to be applied to large-scale and
streaming data. Our experimental evaluation shows the
effectiveness and efficiency of our model compared with
state-of-the-art baselines. We evaluate each aspect of
our framework and show its utility in the context of
tweet clustering.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "27",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yang:2014:SMU,
author = "Dingqi Yang and Daqing Zhang and Zhiyong Yu and Zhiwen
Yu and Djamal Zeghlache",
title = "{SESAME}: Mining User Digital Footprints for
Fine-Grained Preference-Aware Social Media Search",
journal = j-TOIT,
volume = "14",
number = "4",
pages = "28:1--28:??",
month = dec,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2677209",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Wed Jan 7 15:19:30 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "With the recent popularity of social network services,
a significant volume of heterogeneous social media data
is generated by users, in the form of texts, photos,
videos and collections of points of interest, etc. Such
social media data provides users with rich resources
for exploring content, such as looking for an
interesting video or a favorite point of interest.
However, the rapid growth of social media causes
difficulties for users to efficiently retrieve their
desired media items. Fortunately, users' digital
footprints on social networks such as comments
massively reflect individual's fine-grained preference
on media items, that is, preference on different
aspects of the media content, which can then be used
for personalized social media search. In this article,
we propose SESAME, a fine-grained preference-aware
social media search framework leveraging user digital
footprints on social networks. First, we collect users'
direct feedback on media content from their social
networks. Second, we extract users' sentiment about the
media content and the associated keywords from their
comments to characterize their fine-grained preference.
Third, we propose a parallel multituple based ranking
tensor factorization algorithm to perform the
personalized media item ranking by incorporating two
unique features, viz., integrating an enhanced
bootstrap sampling method by considering user
activeness and adopting stochastic gradient descent
parallelization techniques. We experimentally evaluate
the SESAME framework using two datasets collected from
Foursquare and YouTube, respectively. The results show
that SESAME can subtly capture user preference on
social media items and consistently outperform baseline
approaches by achieving better personalized ranking
quality.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "28",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Kourtellis:2015:SIF,
author = "Nicolas Kourtellis and Jeremy Blackburn and Cristian
Borcea and Adriana Iamnitchi",
title = "Special Issue on Foundations of Social Computing:
Enabling Social Applications via Decentralized Social
Data Management",
journal = j-TOIT,
volume = "15",
number = "1",
pages = "1:1--1:??",
month = feb,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700057",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Mar 13 07:20:59 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "An unprecedented information wealth produced by online
social networks, further augmented by
location/collocation data, is currently fragmented
across different proprietary services. Combined, it can
accurately represent the social world and enable novel
socially aware applications. We present Prometheus, a
socially aware peer-to-peer service that collects
social information from multiple sources into a
multigraph managed in a decentralized fashion on
user-contributed nodes, and exposes it through an
interface implementing nontrivial social inferences
while complying with user-defined access policies.
Simulations and experiments on PlanetLab with emulated
application workloads show the system exhibits good
end-to-end response time, low communication overhead,
and resilience to malicious attacks.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Cooper:2015:NND,
author = "Alissa Cooper and Ian Brown",
title = "Net Neutrality: Discrimination, Competition, and
Innovation in the {UK} and {US}",
journal = j-TOIT,
volume = "15",
number = "1",
pages = "2:1--2:??",
month = feb,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700055",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Mar 13 07:20:59 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We analyze UK and US experiences as they relate to two
central net neutrality questions: (1) whether
competition serves as a deterrent to the discriminatory
treatment of Internet traffic, and (2) whether
discrimination creates barriers to application
development and innovation. Relying on consumer
switching behavior to provide more comprehensive
competitive discipline was insufficient for a variety
of reasons, including the presence of switching costs.
The process of correcting errors in the technology used
for application-specific management revealed that such
management creates costs for application developers and
innovators, regardless of whether their products are
targeted for traffic management.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Dandekar:2015:SFC,
author = "Pranav Dandekar and Ashish Goel and Michael P. Wellman
and Bryce Wiedenbeck",
title = "Strategic Formation of Credit Networks",
journal = j-TOIT,
volume = "15",
number = "1",
pages = "3:1--3:??",
month = feb,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700058",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Mar 13 07:20:59 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Credit networks are an abstraction for modeling trust
among agents in a network. Agents who do not directly
trust each other can transact through exchange of IOUs
(obligations) along a chain of trust in the network.
Credit networks are robust to intrusion, can enable
transactions between strangers in exchange economies,
and have the liquidity to support a high rate of
transactions. We study the formation of such networks
when agents strategically decide how much credit to
extend each other. We find strong positive network
formation results for the simplest theoretical model.
When each agent trusts a fixed set of other agents and
transacts directly only with those it trusts, all
pure-strategy Nash equilibria are social optima.
However, when we allow transactions over longer paths,
the price of anarchy may be unbounded. On the positive
side, when agents have a shared belief about the
trustworthiness of each agent, simple greedy dynamics
quickly converge to a star-shaped network, which is a
social optimum. Similar star-like structures are found
in equilibria of heuristic strategies found via
simulation studies. In addition, we simulate
environments where agents may have varying information
about each others' trustworthiness based on their
distance in a social network. Empirical game analysis
of these scenarios suggests that star structures arise
only when defaults are relatively rare, and otherwise,
credit tends to be issued over short social distances
conforming to the locality of information. Overall, we
find that networks formed by self-interested agents
achieve a high fraction of available value, as long as
this potential value is large enough to enable any
network to form.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bild:2015:ACU,
author = "David R. Bild and Yue Liu and Robert P. Dick and Z.
Morley Mao and Dan S. Wallach",
title = "Aggregate Characterization of User Behavior in
{Twitter} and Analysis of the Retweet Graph",
journal = j-TOIT,
volume = "15",
number = "1",
pages = "4:1--4:??",
month = feb,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700060",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Mar 13 07:20:59 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Most previous analysis of Twitter user behavior has
focused on individual information cascades and the
social followers graph, in which the nodes for two
users are connected if one follows the other. We
instead study aggregate user behavior and the retweet
graph with a focus on quantitative descriptions. We
find that the lifetime tweet distribution is a type-II
discrete Weibull stemming from a power law hazard
function, that the tweet rate distribution, although
asymptotically power law, exhibits a lognormal cutoff
over finite sample intervals, and that the inter-tweet
interval distribution is a power law with exponential
cutoff. The retweet graph is small-world and
scale-free, like the social graph, but less
disassortative and has much stronger clustering. These
differences are consistent with it better capturing the
real-world social relationships of and trust between
users than the social graph. Beyond just understanding
and modeling human communication patterns and social
networks, applications for alternative, decentralized
microblogging systems---both predicting real-word
performance and detecting spam---are discussed.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bandara:2015:PBM,
author = "H. M. N. Dilum Bandara and Anura P. Jayasumana",
title = "{P2P}-Based, Multi-Attribute Resource Discovery under
Real-World Resources and Queries",
journal = j-TOIT,
volume = "15",
number = "1",
pages = "5:1--5:??",
month = feb,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2729139",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Mar 13 07:20:59 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Collaborative peer-to-peer (P2P), grid, and cloud
computing rely on resource discovery (RD) solutions to
aggregate groups of multi-attribute, dynamic, and
distributed resources. However, specific
characteristics of real-world resources and queries,
and their impact on P2P-based RD, are largely unknown.
We analyze the characteristics of resources and queries
using data from four real-world systems. These
characteristics are then used to qualitatively and
quantitatively evaluate the fundamental design choices
for P2P-based multi-attribute RD. The datasets exhibit
several noteworthy features that affect the
performance. For example, compared to uniform queries,
real-world queries are relatively easier to resolve
using unstructured, superpeer, and
single-attribute-dominated query-based structured P2P
solutions, as queries mostly specify only a small
subset of the available attributes and large ranges of
attribute values. However, all the solutions are prone
to significant load balancing issues, as the resources
and queries are highly skewed and correlated. The
implications of our findings for improving RD solutions
are also discussed.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Nepal:2015:IBR,
author = "Surya Nepal and Cecile Paris and Payam Aghaei Pour and
Jill Freyne and Sanat Kumar Bista",
title = "Interaction-Based Recommendations for Online
Communities",
journal = j-TOIT,
volume = "15",
number = "2",
pages = "6:1--6:??",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2774974",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 7 08:55:49 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "A key challenge in online communities is that of
keeping a community active and alive. All online
communities work hard to keep their members through
various initiatives, such as personalisation and
recommendation technologies. In online communities
aimed at supporting behavioural change, that is, in
domains such as diet, lifestyle, or the environment,
the main reason for participation is not to connect
with real-world friends for sharing and communicating,
but to meet and gain support from like-minded people in
an online environment. Introducing personalisation and
recommendation features in these networks is
challenging, as traditional approaches leverage the
densely populated friendship relations found in typical
social networks, and these are not present in these new
community types. We address this challenge by looking
beyond the articulated friendships of a community for
evidence of relationships. In particular, we look at
the interactions of members of an online community with
other members and resources. In this article, we
present a social behaviour model and apply it to two
types of recommendation systems, a people recommender
and a content recommender system. We evaluate our
systems using the interaction logs of an online diet
and lifestyle community in which 5,000 Australians
participated in a 12-week programme. Our results show
that our social behaviour-based recommendation
algorithms outperform baselines, friendship-based, and
link-prediction algorithms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Alhosban:2015:BFM,
author = "Amal Alhosban and Khayyam Hashmi and Zaki Malik and
Brahim Medjahed and Salima Benbernou",
title = "Bottom-Up Fault Management in Service-Based Systems",
journal = j-TOIT,
volume = "15",
number = "2",
pages = "7:1--7:??",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2739045",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 7 08:55:49 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Service Oriented Architecture (SOA) enables the
creation of distributed applications from independently
developed and deployed services. As with any
component-based system, the overall performance and
quality of the system is an aggregate function of its
component services. In this article, we present a novel
approach for managing bottom-up faults in service-based
systems. Bottom-up faults are a special case of
system-wide exceptions that are defined as abnormal
conditions or defects occurring in component services,
which if not detected and/or managed, may lead to
runtime failures. Examples of bottom-up faults include
network outage, server disruption, and changes to
service provisioning (e.g., new operation parameter
required) that may have an impact on the way component
services are consumed. We propose a soft-state
signaling-based approach to propagate these faults from
participants to composite services. Soft-state refers
to a class of protocols where the state of a service is
constantly refreshed by periodic messages, and
user/service takes up the responsibility of
communicating and maintaining its state.
Soft-state-based protocols have a number of advantages
including implicit error recovery and easier fault
management, resulting in high availability for systems.
Although soft-state has been widely used in various
Internet protocols, this work is the first (to the best
of our knowledge) to adopt soft-state for fault
management in composite services. The proposed approach
includes protocols for fault propagation (pure
soft-state and soft-state with explicit removal) and
fault reaction (rule-based). We also present experiment
results to assess the performance and applicability of
our approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Dai:2015:EDC,
author = "Wei Dai and Scott Jordan",
title = "The Effect of Data Caps upon {ISP} Service Tier Design
and Users",
journal = j-TOIT,
volume = "15",
number = "2",
pages = "8:1--8:??",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2774973",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Aug 7 08:55:49 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We model the design and impact of Internet pricing
plans with data caps. We consider a monopoly ISP that
maximizes its profit by setting tier prices, tier
rates, network capacity, data caps, and overage
charges. We show that when data caps are used to
maximize profit, a monopoly ISP will keep the basic
tier price the same, increase the premium tier rate,
and decrease the premium tier price and the basic tier
rate. We give analytical and numerical results to
illustrate the increase in ISP profit, and the
corresponding changes in user tier choices, user
surplus, and social welfare.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhuang:2015:PBM,
author = "Yi Zhuang and Nan Jiang and Qing Li and Lei Chen and
Chunhua Ju",
title = "Progressive Batch Medical Image Retrieval Processing
in Mobile Wireless Networks",
journal = j-TOIT,
volume = "15",
number = "3",
pages = "9:1--9:??",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2783437",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Dec 19 18:06:52 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article addresses a multi-query optimization
problem for distributed medical image retrieval in
mobile wireless networks by exploiting the dependencies
in the derivation of a retrieval evaluation plan. To
the best of our knowledge, this is the first work
investigating batch medical image retrieval (BMIR)
processing in a mobile wireless network environment.
Four steps are incorporated in our BMIR algorithm.
First, when a number of retrieval requests (i.e., m
retrieval images and m radii) are simultaneously
submitted by users, then a cost-based dynamic retrieval
( CDRS ) scheduling procedure is invoked to efficiently
and effectively identify the correlation among the
retrieval spheres (requests) based on a cost model.
Next, an index-based image set reduction ( ISR ) is
performed at the execution-node level in parallel.
Then, a refinement processing of the candidate images
is conducted to get the answers. Finally, at the
transmission-node level, the corresponding image
fragment (IF) replicas are chosen based on an adaptive
multi-resolution ( AMR )-based IF replicas selection
scheme, and transmitted to the user-node level by a
priority-based IF replicas transmission ( PIFT )
scheme. The experimental results validate the
efficiency and effectiveness of the algorithm in
minimizing the response time and increasing the
parallelism of I/O and CPU.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zabolotnyi:2015:JCG,
author = "Rostyslav Zabolotnyi and Philipp Leitner and Waldemar
Hummer and Schahram Dustdar",
title = "{JCloudScale}: Closing the Gap Between {IaaS} and
{PaaS}",
journal = j-TOIT,
volume = "15",
number = "3",
pages = "10:1--10:??",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2792980",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Dec 19 18:06:52 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Building Infrastructure-as-a-Service (IaaS)
applications today is a complex, repetitive, and
error-prone endeavor, as IaaS does not provide
abstractions on top of virtual machines. This article
presents JCloudScale, a Java-based middleware for
moving elastic applications to IaaS clouds, with
minimal adjustments to the application code. We discuss
the architecture and technical features, as well as
evaluate our system with regard to user acceptance and
performance overhead. Our user study reveals that
JCloudScale allows many participants to build IaaS
applications more efficiently, compared to industrial
Platform-as-a-Service (PaaS) solutions. Additionally,
unlike PaaS, JCloudScale does not lead to a control
loss and vendor lock-in.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Anonymous:2015:PDP,
author = "Anonymous",
title = "{P-DONAS}: a {P2P}-Based Domain Name System in Access
Networks",
journal = j-TOIT,
volume = "15",
number = "3",
pages = "11:1--11:??",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2808229",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Dec 19 18:06:52 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The domain name system (DNS) includes infrastructures
deployed by Internet service providers (ISPs) and
third-party suppliers to ensure high responsiveness,
resilience, and load sharing. This equipment implies
high effort and energy for 24/7 operation. To
facilitate cost reductions in this regard, P-DONAS-a
peer-to-peer (P2P)-based DNS-organizes access nodes
(ANs) of an ISP's access network, which possess
available resources, into a decentralized,
self-organizing distributed hash table--based P2P
network. Each AN acts as traditional DNS server and
solely stores a piece of DNS data. DNS requests issued
to an AN are resolved via P2P lookups while maintaining
full compatibility with traditional DNS. The article
discusses the application of P-DONAS as both a
complement and an alternative to traditional DNS.
Results from both simulations and a practical test
arrangement prove P-DONAS' high scalability and its
performance comparable to that of a commercial DNS name
server relieving this name server by 53\% to 75\% of
DNS traffic.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Norman:2015:ITS,
author = "Timothy J. Norman and Suzanne Barber and Rino Falcone
and Jie Zhang",
title = "Introduction to Theme Section on Trust in Social
Networks and Systems",
journal = j-TOIT,
volume = "15",
number = "4",
pages = "12:1--12:??",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2835510",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Dec 19 18:06:53 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Falcone:2015:RCT,
author = "Rino Falcone and Alessandro Sapienza and Cristiano
Castelfranchi",
title = "The Relevance of Categories for Trusting Information
Sources",
journal = j-TOIT,
volume = "15",
number = "4",
pages = "13:1--13:??",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2803175",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Dec 19 18:06:53 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In this article, we are interested in the fact that
relevance and trustworthiness of information acquired
by an agent X from a source F strictly depends and
derives from X's trust in F with respect to the kind of
information. In particular, we are interested in
analyzing the relevance of F's category as indicator
for its trustworthiness with respect to the specific
informative goals of X. In this article, we analyze an
interactive cognitive model for searching information
in a world in which each agent can be considered as
belonging to a specific agent's category. We also
consider variability within the canonical categorical
behavior and consequent influence on the
trustworthiness of provided information. The introduced
interactive cognitive model also allows evaluation of
the trustworthiness of a source both on the basis of
its category and on past direct experience with it,
thus selecting the more adequate source with respect to
the informative goals to achieve. We present a
computational approach based on fuzzy sets and some
selected simulation scenarios together with the
discussion of their more interesting results.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Jiang:2015:SRT,
author = "Wenjun Jiang and Jie Wu and Guojun Wang",
title = "On Selecting Recommenders for Trust Evaluation in
Online Social Networks",
journal = j-TOIT,
volume = "15",
number = "4",
pages = "14:1--14:??",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2807697",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Dec 19 18:06:53 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Trust is a central component of social interactions
among humans. Many applications motivate the
consideration of trust evaluation in online social
networks (OSNs). Some work has been proposed based on a
trusted graph. However, it is still an open challenge
to construct a trusted graph, especially in terms of
selecting proper recommenders, which can be used to
predict the trustworthiness of an unknown target
efficiently and effectively. Based on the intuition
that people who are close to and influential to us can
make more proper and acceptable recommendations, we
present the idea of recommendation-aware trust
evaluation (RATE). We further model the recommender
selection problem as an optimization problem, with the
objectives of higher accuracy, lower risk
(uncertainty), and lower cost. Four metrics:
trustworthiness, expertise, uncertainty, and cost, are
identified to measure and adjust the quality of
recommenders. We focus on a 1-hop recommender
selection, for which we propose the FluidTrust model to
better illustrate the trust--decision making process of
a user. We also discuss the extension of multihop
scenarios and multitarget scenarios. Experimental
results, with the real social network datasets of
Epinions and Advogato, validate the effectiveness of
RATE: it can predict trust with higher accuracy (it
gains about 20\% higher accuracy in Epinions), lower
risk, and less cost (about a 30\% improvement).",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ros:2015:COC,
author = "Santiago Pina Ros and {\'A}ngel Pina Canelles and
Manuel Gil P{\'e}rez and F{\'e}lix G{\'o}mez M{\'a}rmol
and Gregorio Mart{\'\i}nez P{\'e}rez",
title = "Chasing Offensive Conduct in Social Networks: a
Reputation-Based Practical Approach for {Frisber}",
journal = j-TOIT,
volume = "15",
number = "4",
pages = "15:1--15:??",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2797139",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Dec 19 18:06:53 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Social network users take advantage of anonymity to
share rumors or gossip about others, making it
important to provide means to report offensive conduct.
This article presents a proposal to automatically
manage these reports. We consider not only the users'
public behavior, but also private messages between
users. The automatic approach is based, in both cases,
on the reporters' reputation along with other metrics
intrinsic to social networks. Promising results from
adopting the proposed reporting methods on Frisber, a
geolocalized social network in production, are
presented as well as some experiments based on real
data extracted from Frisber.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "15",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Sutcliffe:2015:MRT,
author = "Alistair G. Sutcliffe and Di Wang and Robin I. M.
Dunbar",
title = "Modelling the Role of Trust in Social Relationships",
journal = j-TOIT,
volume = "15",
number = "4",
pages = "16:1--16:??",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815620",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Dec 19 18:06:53 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "A social trust model is presented for investigating
social relationships and social networks in the real
world and in social media. The results demonstrate that
multilevel social structures, with a few strong
relationships, more medium ties, and large numbers of
weak ties, emerge in an evolutionary simulation when
well-being and alliances are rewarded with high levels
of social interaction. `Favour-the-few' trust
strategies were more competitive than others under a
wide range of fitness conditions, suggesting that the
development of complex, multilevel social structures
depends on capacity for high investment in social time
and preferential social interaction strategies.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "16",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Benslimane:2016:UWC,
author = "Djamal Benslimane and Quan Z. Sheng and Mahmoud
Barhamgi and Henri Prade",
title = "The Uncertain {Web}: Concepts, Challenges, and Current
Solutions",
journal = j-TOIT,
volume = "16",
number = "1",
pages = "1:1--1:??",
month = feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2847252",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhang:2016:TAD,
author = "Peng Zhang and Jing He and Guodong Long and Guangyan
Huang and Chengqi Zhang",
title = "Towards Anomalous Diffusion Sources Detection in a
Large Network",
journal = j-TOIT,
volume = "16",
number = "1",
pages = "2:1--2:??",
month = feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2806889",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Witnessing the wide spread of malicious information in
large networks, we develop an efficient method to
detect anomalous diffusion sources and thus protect
networks from security and privacy attacks. To date,
most existing work on diffusion sources detection are
based on the assumption that network snapshots that
reflect information diffusion can be obtained
continuously. However, obtaining snapshots of an entire
network needs to deploy detectors on all network nodes
and thus is very expensive. Alternatively, in this
article, we study the diffusion sources locating
problem by learning from information diffusion data
collected from only a small subset of network nodes.
Specifically, we present a new regression learning
model that can detect anomalous diffusion sources by
jointly solving five challenges, that is, unknown
number of source nodes, few activated detectors,
unknown initial propagation time, uncertain propagation
path and uncertain propagation time delay. We
theoretically analyze the strength of the model and
derive performance bounds. We empirically test and
compare the model using both synthetic and real-world
networks to demonstrate its performance.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Abboura:2016:QBO,
author = "Asma Abboura and Soror Sahri and Latifa Baba-Hamed and
Mourad Ouziri and Salima Benbernou",
title = "Quality-Based Online Data Reconciliation",
journal = j-TOIT,
volume = "16",
number = "1",
pages = "3:1--3:??",
month = feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2806888",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "One of the main challenges in data matching and data
cleaning, in highly integrated systems, is duplicates
detection. While the literature abounds of approaches
detecting duplicates corresponding to the same
real-world entity, most of these approaches tend to
eliminate duplicates (wrong information) from the
sources, hence leading to what is called data repair.
In this article, we propose a framework that
automatically detects duplicates at query time and
effectively identifies the consistent version of the
data, while keeping inconsistent data in the sources.
Our framework uses matching dependencies (MDs) to
detect duplicates through the concept of data
reconciliation rules (DRR) and conditional function
dependencies (CFDs) to assess the quality of different
attribute values. We also build a duplicate
reconciliation index ( DRI ), based on clusters of
duplicates detected by a set of DRRs to speed up the
online data reconciliation process. Our experiments of
a real-world data collection show the efficiency and
effectiveness of our framework.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ma:2016:SAD,
author = "Jiangang Ma and Le Sun and Hua Wang and Yanchun Zhang
and Uwe Aickelin",
title = "Supervised Anomaly Detection in Uncertain
Pseudoperiodic Data Streams",
journal = j-TOIT,
volume = "16",
number = "1",
pages = "4:1--4:??",
month = feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2806890",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Uncertain data streams have been widely generated in
many Web applications. The uncertainty in data streams
makes anomaly detection from sensor data streams far
more challenging. In this article, we present a novel
framework that supports anomaly detection in uncertain
data streams. The proposed framework adopts the wavelet
soft-thresholding method to remove the noises or errors
in data streams. Based on the refined data streams, we
develop effective period pattern recognition and
feature extraction techniques to improve the
computational efficiency. We use classification methods
for anomaly detection in the corrected data stream. We
also empirically show that the proposed approach shows
a high accuracy of anomaly detection on several real
datasets.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Makhoul:2016:UEA,
author = "Abdallah Makhoul and Christophe Guyeux and Mourad
Hakem and Jacques M. Bahi",
title = "Using an Epidemiological Approach to Maximize Data
Survival in the {Internet of Things}",
journal = j-TOIT,
volume = "16",
number = "1",
pages = "5:1--5:??",
month = feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2812810",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Internet of Things (IoT) has gained worldwide
attention in recent years. It transforms the everyday
objects that surround us into proactive actors of the
Internet, generating and consuming information. An
important issue related to the appearance of such a
large-scale self-coordinating IoT is the reliability
and the collaboration between the objects in the
presence of environmental hazards. High failure rates
lead to significant loss of data. Therefore, data
survivability is a main challenge of the IoT. In this
article, we have developed a compartmental e-Epidemic
SIR (Susceptible-Infectious-Recovered) model to save
the data in the network and let it survive after
attacks. Furthermore, our model takes into account the
dynamic topology of the network where natural death
(crashing nodes) and birth are defined and analyzed.
Theoretical methods and simulations are employed to
solve and simulate the system of equations developed
and to analyze the model.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Leung:2016:CMS,
author = "Kenneth Wai-Ting Leung and Di Jiang and Dik Lun Lee
and Wilfred Ng",
title = "Constructing Maintainable Semantic Relation Network
from Ambiguous Concepts in {Web} Content",
journal = j-TOIT,
volume = "16",
number = "1",
pages = "6:1--6:??",
month = feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2814568",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The semantic network is a form of knowledge that
represents various relationships between concepts with
ambiguity. The knowledge can be employed to identify
semantically related objects. It helps, for example, a
recommender system to generate effective
recommendations to the users. We propose to study a new
semantic network, namely, the Concept Relation Network
(CRN), which is efficiently constructed and maintained
using existing web search engines. CRN tackles the
uncertainty and dynamics of web content, and thus is
optimized for many important web applications, such as
social networks and search engines. It is a large
semantic network for the collection, analysis, and
interpretation of web content, and serves as a
cornerstone for applications such as web search
engines, recommendation systems, and social networks
that can benefit from a large-scale knowledge base. In
this article, we present two applications for CRN: (1)
search engine and web analytic and (2) semantic
information retrieval. Experimental results show that
CRN effectively enhances these applications by
considering the heterogeneous and polysemous nature of
web content.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Malik:2016:SRE,
author = "Zaki Malik and Brahim Medjahed and Abdelmounaam
Rezgui",
title = "{sCARE}: Reputation Estimation for Uncertain {Web}
Services",
journal = j-TOIT,
volume = "16",
number = "1",
pages = "7:1--7:??",
month = feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2792979",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In this article, we propose a Statistical
Cloud-Assisted Reputation Estimation (sCARE) approach
for service-oriented environments in uncertain
situations. sCARE uses the ratings from cooperating
service consumers to uniformly describe the randomness
and fuzziness of the different submitted ratings and
their associated relationships in quantitative terms.
We also define discriminant functions to model the
honesty (or lack thereof) of the service raters.
Experiment results show that our proposed model
performs in a fairly accurate manner for a number of
real-world scenarios. A comparison study with similar
existing works is also provided to asses sCARE's
performance.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ko:2016:STU,
author = "In-Young Ko and Han-Gyu Ko and Angel Jimenez Molina
and Jung-Hyun Kwon",
title = "{SoIoT}: Toward A User-Centric {IoT}-Based Service
Framework",
journal = j-TOIT,
volume = "16",
number = "2",
pages = "8:1--8:??",
month = apr,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2835492",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "An emerging issue in urban computing environments is
the seamless selection, composition, and delivery of
user-centric services that run over what is known as
the Internet of Things (IoT). This challenge is about
enabling services actuated by IoT devices to be
delivered spontaneously from the perspective of users.
To accomplish this goal, we propose the
Service-Oriented Internet of Things (SoIoT), a
user-centric IoT-based service framework, which
integrates services that utilize IoT resources in an
urban computing environment. This framework provides a
task-oriented computing approach that enables the
composition of IoT-based services in a spontaneous
manner to accomplish a user task. Tasks can also be
recommended to users based on the available IoT
resources in an environment and on the contextual
knowledge that is represented and managed in social,
spatial, and temporal aspects. These tasks are then
bound to a set of service instances and performed in a
distributed manner. This final composition ensures the
Quality of Service (QoS) requirements of the tasks and
is assigned to multiple client devices for the
efficient utilization of IoT resources. We prove the
practicality of our approach by showing a real-case
service scenario implemented in our IoT-based test-bed
as well as experimental results.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yao:2016:TIR,
author = "Lina Yao and Quan Z. Sheng and Anne H. H. Ngu and Xue
Li",
title = "Things of Interest Recommendation by Leveraging
Heterogeneous Relations in the {Internet of Things}",
journal = j-TOIT,
volume = "16",
number = "2",
pages = "9:1--9:??",
month = apr,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2837024",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The emerging Internet of Things (IoT) bridges the gap
between the physical and the digital worlds, which
enables a deeper understanding of user preferences and
behaviors. The rich interactions and relations between
users and things call for effective and efficient
recommendation approaches to better meet users'
interests and needs. In this article, we focus on the
problem of things recommendation in IoT, which is
important for many applications such as e-Commerce and
health care. We discuss the new properties of
recommending things of interest in IoT, and propose a
unified probabilistic factor based framework by fusing
relations across heterogeneous entities of IoT, for
example, user-thing relations, user-user relations, and
thing-thing relations, to make more accurate
recommendations. Specifically, we develop a hypergraph
to model things' spatiotemporal correlations, on top of
which implicit things correlations can be generated. We
have built an IoT testbed to validate our approach and
the experimental results demonstrate its feasibility
and effectiveness.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Lippi:2016:AMS,
author = "Marco Lippi and Paolo Torroni",
title = "Argumentation Mining: State of the Art and Emerging
Trends",
journal = j-TOIT,
volume = "16",
number = "2",
pages = "10:1--10:??",
month = apr,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850417",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Argumentation mining aims at automatically extracting
structured arguments from unstructured textual
documents. It has recently become a hot topic also due
to its potential in processing information originating
from the Web, and in particular from social media, in
innovative ways. Recent advances in machine learning
methods promise to enable breakthrough applications to
social and economic sciences, policy making, and
information technology: something that only a few years
ago was unthinkable. In this survey article, we
introduce argumentation models and methods, review
existing systems and applications, and discuss
challenges and perspectives of this exciting new
research area.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Vogler:2016:SFP,
author = "Michael V{\"o}gler and Johannes M. Schleicher and
Christian Inzinger and Schahram Dustdar",
title = "A Scalable Framework for Provisioning Large-Scale
{IoT} Deployments",
journal = j-TOIT,
volume = "16",
number = "2",
pages = "11:1--11:??",
month = apr,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850416",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Internet of Things (IoT) devices are usually
considered external application dependencies that only
provide data or process and execute simple
instructions. The recent emergence of IoT devices with
embedded execution environments allows practitioners to
deploy and execute custom application logic directly on
the device. This approach fundamentally changes the
overall process of designing, developing, deploying,
and managing IoT systems. However, these devices
exhibit significant differences in available execution
environments, processing, and storage capabilities. To
accommodate this diversity, a structured approach is
needed to uniformly and transparently deploy
application components onto a large number of
heterogeneous devices. This is especially important in
the context of large-scale IoT systems, such as in the
smart city domain. In this article, we present LEONORE,
an infrastructure toolset that provides elastic
provisioning of application components on
resource-constrained and heterogeneous edge devices in
large-scale IoT deployments. LEONORE supports
push-based as well as pull-based deployments. To
improve scalability and reduce generated network
traffic between cloud and edge infrastructure, we
present a distributed provisioning approach that
deploys LEONORE local nodes within the deployment
infrastructure close to the actual edge devices. We
show that our solution is able to elastically provision
large numbers of devices using a testbed based on a
real-world industry scenario.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bing:2016:UEP,
author = "Lidong Bing and Tak-Lam Wong and Wai Lam",
title = "Unsupervised Extraction of Popular Product Attributes
from E-Commerce {Web} Sites by Considering Customer
Reviews",
journal = j-TOIT,
volume = "16",
number = "2",
pages = "12:1--12:??",
month = apr,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2857054",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We develop an unsupervised learning framework for
extracting popular product attributes from product
description pages originated from different E-commerce
Web sites. Unlike existing information extraction
methods that do not consider the popularity of product
attributes, our proposed framework is able to not only
detect popular product features from a collection of
customer reviews but also map these popular features to
the related product attributes. One novelty of our
framework is that it can bridge the vocabulary gap
between the text in product description pages and the
text in customer reviews. Technically, we develop a
discriminative graphical model based on hidden
Conditional Random Fields. As an unsupervised model,
our framework can be easily applied to a variety of new
domains and Web sites without the need of labeling
training samples. Extensive experiments have been
conducted to demonstrate the effectiveness and
robustness of our framework.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Amato:2016:MOB,
author = "Alba Amato and Salvatore Venticinque",
title = "Multiobjective Optimization for Brokering of
Multicloud Service Composition",
journal = j-TOIT,
volume = "16",
number = "2",
pages = "13:1--13:??",
month = apr,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2870634",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The choice of cloud providers whose offers best fit
the requirements of a particular application is a
complex issue due to the heterogeneity of the services
in terms of resources, costs, technology, and service
levels that providers ensure. This article investigates
the effectiveness of multiobjective genetic algorithms
to resolve a multicloud brokering problem. Experimental
results provide clear evidence about how such a
solution improves the choice made manually by users
returning in real time optimal alternatives. It also
investigates how the optimality depends on different
genetic algorithms and parameters, problem type, and
time constraints.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Courcoubetis:2016:NPP,
author = "Costas Courcoubetis and Laszlo Gyarmati and Nikolaos
Laoutaris and Pablo Rodriguez and Kostas Sdrolias",
title = "Negotiating Premium Peering Prices: a Quantitative
Model with Applications",
journal = j-TOIT,
volume = "16",
number = "2",
pages = "14:1--14:??",
month = apr,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2883610",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 20 07:06:50 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We have developed a novel methodology for deriving
bandwidth prices for premium direct peering between
Access ISPs (A-ISPs) and Content and Service Providers
(CSPs) that want to deliver content and services in
premium quality. Our methodology establishes a direct
link between service profitability, for example, from
advertising, user and subscriber loyalty,
interconnection costs, and finally bandwidth price for
peering. Unlike existing work in both the networking
and economics literature, our resulting computational
model, built around Nash bargaining, can be used for
deriving quantitative results comparable to actual
market prices. We analyze the U.S. market and derive
prices for video, that compare favorably with existing
prices for transit and paid peering. We also observe
that the fair prices returned by the model for
high-profit/low-volume services such as search, are
orders of magnitude higher than current bandwidth
prices. This implies that resolving existing (fierce)
interconnection tussles may require per service,
instead of wholesale, peering between A-ISPs and CSPs.
Our model can be used for deriving initial benchmark
prices for such negotiations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Leitner:2016:PCS,
author = "Philipp Leitner and J{\"u}rgen Cito",
title = "Patterns in the Chaos --- A Study of Performance
Variation and Predictability in Public {IaaS} Clouds",
journal = j-TOIT,
volume = "16",
number = "3",
pages = "15:1--15:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2885497",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Nov 17 08:48:51 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Benchmarking the performance of public cloud providers
is a common research topic. Previous work has already
extensively evaluated the performance of different
cloud platforms for different use cases, and under
different constraints and experiment setups. In this
article, we present a principled, large-scale
literature review to collect and codify existing
research regarding the predictability of performance in
public Infrastructure-as-a-Service (IaaS) clouds. We
formulate 15 hypotheses relating to the nature of
performance variations in IaaS systems, to the factors
of influence of performance variations, and how to
compare different instance types. In a second step, we
conduct extensive real-life experimentation on four
cloud providers to empirically validate those
hypotheses. We show that there are substantial
differences between providers. Hardware heterogeneity
is today less prevalent than reported in earlier
research, while multitenancy has a dramatic impact on
performance and predictability, but only for some cloud
providers. We were unable to discover a clear impact of
the time of the day or the day of the week on cloud
performance.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "15",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Cao:2016:MMR,
author = "Tien-Dung Cao and Tran-Vu Pham and Quang-Hieu Vu and
Hong-Linh Truong and Duc-Hung Le and Schahram Dustdar",
title = "{MARSA}: a Marketplace for Realtime Human Sensing
Data",
journal = j-TOIT,
volume = "16",
number = "3",
pages = "16:1--16:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2883611",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Nov 17 08:48:51 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article introduces a dynamic cloud-based
marketplace of near-realtime human sensing data (MARSA)
for different stakeholders to sell and buy
near-realtime data. MARSA is designed for environments
where information technology (IT) infrastructures are
not well developed but the need to gather and sell
near-realtime data is great. To this end, we present
techniques for selecting data types and managing data
contracts based on different cost models, quality of
data, and data rights. We design our MARSA platform by
leveraging different data transferring solutions to
enable an open and scalable communication mechanism
between sellers (data providers) and buyers (data
consumers). To evaluate MARSA, we carry out several
experiments with the near-realtime transportation data
provided by people in Ho Chi Minh City, Vietnam, and
simulated scenarios in multicloud environments.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "16",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Rodriguez:2016:MQA,
author = "Carlos Rodr{\'\i}guez and Florian Daniel and Fabio
Casati",
title = "Mining and Quality Assessment of Mashup Model Patterns
with the Crowd: a Feasibility Study",
journal = j-TOIT,
volume = "16",
number = "3",
pages = "17:1--17:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2903138",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Nov 17 08:48:51 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Pattern mining, that is, the automated discovery of
patterns from data, is a mathematically complex and
computationally demanding problem that is generally not
manageable by humans. In this article, we focus on
small datasets and study whether it is possible to mine
patterns with the help of the crowd by means of a set
of controlled experiments on a common crowdsourcing
platform. We specifically concentrate on mining model
patterns from a dataset of real mashup models taken
from Yahoo! Pipes and cover the entire pattern mining
process, including pattern identification and quality
assessment. The results of our experiments show that a
sensible design of crowdsourcing tasks indeed may
enable the crowd to identify patterns from small
datasets (40 models). The results, however, also show
that the design of tasks for the assessment of the
quality of patterns to decide which patterns to retain
for further processing and use is much harder (our
experiments fail to elicit assessments from the crowd
that are similar to those by an expert). The problem is
relevant in general to model-driven development (e.g.,
UML, business processes, scientific workflows), in that
reusable model patterns encode valuable modeling and
domain knowledge, such as best practices,
organizational conventions, or technical choices, that
modelers can benefit from when designing their own
models.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "17",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Copil:2016:RFS,
author = "Georgiana Copil and Daniel Moldovan and Hong-Linh
Truong and Schahram Dustdar",
title = "{rSYBL}: a Framework for Specifying and Controlling
Cloud Services Elasticity",
journal = j-TOIT,
volume = "16",
number = "3",
pages = "18:1--18:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2925990",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Nov 17 08:48:51 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Cloud applications can benefit from the on-demand
capacity of cloud infrastructures, which offer
computing and data resources with diverse capabilities,
pricing, and quality models. However, state-of-the-art
tools mainly enable the user to specify
``if-then-else'' policies concerning resource usage and
size, resulting in a cumbersome specification process
that lacks expressiveness for enabling the control of
complex multilevel elasticity requirements. In this
article, first we propose SYBL, a novel language for
specifying elasticity requirements at multiple levels
of abstraction. Second, we design and develop the rSYBL
framework for controlling cloud services at multiple
levels of abstractions. To enforce user-specified
requirements, we develop a multilevel elasticity
control mechanism enhanced with conflict resolution.
rSYBL supports different cloud providers and is highly
extensible, allowing service providers or developers to
define their own connectors to the desired
infrastructures or tools. We validate it through
experiments with two distinct services, evaluating
rSYBL over two distinct cloud infrastructures, and
showing the importance of multilevel elasticity
control.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "18",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Farias:2016:IDT,
author = "Delia Iraz{\'u} Hern{\'a}ndez Far{\'\i}as and Viviana
Patti and Paolo Rosso",
title = "Irony Detection in {Twitter}: The Role of Affective
Content",
journal = j-TOIT,
volume = "16",
number = "3",
pages = "19:1--19:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2930663",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Nov 17 08:48:51 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Irony has been proven to be pervasive in social media,
posing a challenge to sentiment analysis systems. It is
a creative linguistic phenomenon where affect-related
aspects play a key role. In this work, we address the
problem of detecting irony in tweets, casting it as a
classification problem. We propose a novel model that
explores the use of affective features based on a wide
range of lexical resources available for English,
reflecting different facets of affect. Classification
experiments over different corpora show that affective
information helps in distinguishing among ironic and
nonironic tweets. Our model outperforms the state of
the art in almost all cases.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "19",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Costa:2016:MBC,
author = "Gianni Costa and Riccardo Ortale",
title = "Model-Based Collaborative Personalized Recommendation
on Signed Social Rating Networks",
journal = j-TOIT,
volume = "16",
number = "3",
pages = "20:1--20:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2934681",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Nov 17 08:48:51 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Recommendation on signed social rating networks is
studied through an innovative approach. Bayesian
probabilistic modeling is used to postulate a realistic
generative process, wherein user and item interactions
are explained by latent factors, whose relevance varies
within the underlying network organization into user
communities and item groups. Approximate posterior
inference captures distrust propagation and drives
Gibbs sampling to allow rating and (dis)trust
prediction for recommendation along with the
unsupervised exploratory analysis of network
organization. Comparative experiments reveal the
superiority of our approach in rating and link
prediction on Epinions and Ciao, besides community
quality and recommendation sensitivity to network
organization.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "20",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhang:2016:DEP,
author = "Rui Zhang and Rui Xue and Ting Yu and Ling Liu",
title = "Dynamic and Efficient Private Keyword Search over
Inverted Index-Based Encrypted Data",
journal = j-TOIT,
volume = "16",
number = "3",
pages = "21:1--21:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2940328",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Nov 17 08:48:51 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Querying over encrypted data is gaining increasing
popularity in cloud-based data hosting services.
Security and efficiency are recognized as two important
and yet conflicting requirements for querying over
encrypted data. In this article, we propose an
efficient private keyword search (EPKS) scheme that
supports binary search and extend it to dynamic
settings (called DEPKS ) for inverted index--based
encrypted data. First, we describe our approaches of
constructing a searchable symmetric encryption (SSE)
scheme that supports binary search. Second, we present
a novel framework for EPKS and provide its formal
security definitions in terms of plaintext privacy and
predicate privacy by modifying Shen et al.'s security
notions [Shen et al. 2009]. Third, built on the
proposed framework, we design an EPKS scheme whose
complexity is logarithmic in the number of keywords.
The scheme is based on the groups of prime order and
enjoys strong notions of security, namely statistical
plaintext privacy and statistical predicate privacy.
Fourth, we extend the EPKS scheme to support dynamic
keyword and document updates. The extended scheme not
only maintains the properties of logarithmic-time
search efficiency and plaintext privacy and predicate
privacy but also has fewer rounds of communications for
updates compared to existing dynamic search encryption
schemes. We experimentally evaluate the proposed EPKS
and DEPKS schemes and show that they are significantly
more efficient in terms of both keyword search
complexity and communication complexity than existing
randomized SSE schemes.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "21",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bertino:2016:ITI,
author = "Elisa Bertino and Kim-Kwang Raymond Choo and Dimitrios
Georgakopolous and Surya Nepal",
title = "{Internet of Things (IoT)}: Smart and Secure Service
Delivery",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "22:1--22:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3013520",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Internet of Things (IoT) is the latest Internet
evolution that incorporates a diverse range of things
such as sensors, actuators, and services deployed by
different organizations and individuals to support a
variety of applications. The information captured by
IoT present an unprecedented opportunity to solve
large-scale problems in those application domains to
deliver services; example applications include
precision agriculture, environment monitoring, smart
health, smart manufacturing, and smart cities. Like all
other Internet based services in the past, IoT-based
services are also being developed and deployed without
security consideration. By nature, IoT devices and
services are vulnerable to malicious cyber threats as
they cannot be given the same protection that is
received by enterprise services within an enterprise
perimeter. While IoT services will play an important
role in our daily life resulting in improved
productivity and quality of life, the trend has also
``encouraged'' cyber-exploitation and evolution and
diversification of malicious cyber threats. Hence,
there is a need for coordinated efforts from the
research community to address resulting concerns, such
as those presented in this special section. Several
potential research topics are also identified in this
special section.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "22",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Duan:2016:SDC,
author = "Li Duan and Dongxi Liu and Yang Zhang and Shiping Chen
and Ren Ping Liu and Bo Cheng and Junliang Chen",
title = "Secure Data-Centric Access Control for Smart Grid
Services Based on Publish\slash Subscribe Systems",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "23:1--23:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3007190",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The communication systems in existing smart grids
mainly take the request/reply interaction model, in
which data access is under the direct control of data
producers. This tightly controlled interaction model is
not scalable to support complex interactions among
smart grid services. On the contrary, the
publish/subscribe system features a loose coupling
communication infrastructure and allows indirect,
anonymous and multicast interactions among smart grid
services. The publish/subscribe system can thus support
scalable and flexible collaboration among smart grid
services. However, the access is not under the direct
control of data producers, it might not be easy to
implement an access control scheme for a
publish/subscribe system. In this article, we propose a
Data-Centric Access Control Framework (DCACF) to
support secure access control in a publish/subscribe
model. This framework helps to build scalable smart
grid services, while keeping features of service
interactions and data confidentiality at the same time.
The data published in our DCACF is encrypted with a
fully homomorphic encryption scheme, which allows
in-grid homomorphic aggregation of the encrypted data.
The encrypted data is accompanied by Bloom-filter
encoded control policies and access credentials to
enable indirect access control. We have analyzed the
correctness and security of our DCACF and evaluated its
performance in a distributed environment.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "23",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhang:2016:PAG,
author = "Yuexin Zhang and Yang Xiang and Xinyi Huang",
title = "Password-Authenticated Group Key Exchange: a
Cross-Layer Design",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "24:1--24:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2955095",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Two-party password-authenticated key exchange (2PAKE)
protocols provide a natural mechanism for secret key
establishment in distributed applications, and they
have been extensively studied in past decades. However,
only a few efforts have been made so far to design
password-authenticated group key exchange (GPAKE)
protocols. In a 2PAKE or GPAKE protocol, it is assumed
that short passwords are preshared among users. This
assumption, however, would be impractical in certain
applications. Motivated by this observation, this
article presents a GPAKE protocol without the password
sharing assumption. To obtain the passwords, wireless
devices, such as smart phones, tablets, and laptops,
are used to extract short secrets at the physical
layer. Using the extracted secrets, users in our
protocol can establish a group key at higher layers
with light computation consumptions. Thus, our GPAKE
protocol is a cross-layer design. Additionally, our
protocol is a compiler, that is, our protocol can
transform any provably secure 2PAKE protocol into a
GPAKE protocol with only one more round of
communications. Besides, the proposed protocol is
proved secure in the standard model.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "24",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Saxena:2016:API,
author = "Neetesh Saxena and Santiago Grijalva and Narendra S.
Chaudhari",
title = "Authentication Protocol for an {IoT}-Enabled {LTE}
Network",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "25:1--25:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2981547",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Evolved Packet System-based Authentication and Key
Agreement (EPS-AKA) protocol of the long-term evolution
(LTE) network does not support Internet of Things (IoT)
objects and has several security limitations, including
transmission of the object's (user/device) identity and
key set identifier in plaintext over the network,
synchronization, large overhead, limited identity
privacy, and security attack vulnerabilities. In this
article, we propose a new secure and efficient AKA
protocol for the LTE network that supports secure and
efficient communications among various IoT devices as
well as among the users. Analysis shows that our
protocol is secure, efficient, and privacy preserved,
and reduces bandwidth consumption during
authentication.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "25",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Siboni:2016:AST,
author = "Shachar Siboni and Asaf Shabtai and Nils O.
Tippenhauer and Jemin Lee and Yuval Elovici",
title = "Advanced Security Testbed Framework for Wearable {IoT}
Devices",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "26:1--26:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2981546",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Analyzing the security of Wearable Internet-of-Things
(WIoT) devices is considered a complex task due to
their heterogeneous nature. In addition, there is
currently no mechanism that performs security testing
for WIoT devices in different contexts. In this
article, we propose an innovative security testbed
framework targeted at wearable devices, where a set of
security tests are conducted, and a dynamic analysis is
performed by realistically simulating environmental
conditions in which WIoT devices operate. The
architectural design of the proposed testbed and a
proof-of-concept, demonstrating a preliminary analysis
and the detection of context-based attacks executed by
smartwatch devices, are presented.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "26",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Saeed:2016:IID,
author = "Ahmed Saeed and Ali Ahmadinia and Abbas Javed and Hadi
Larijani",
title = "Intelligent Intrusion Detection in Low-Power {IoTs}",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "27:1--27:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2990499",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Security and privacy of data are one of the prime
concerns in today's Internet of Things (IoT).
Conventional security techniques like signature-based
detection of malware and regular updates of a signature
database are not feasible solutions as they cannot
secure such systems effectively, having limited
resources. Programming languages permitting immediate
memory accesses through pointers often result in
applications having memory-related errors, which may
lead to unpredictable failures and security
vulnerabilities. Furthermore, energy efficient IoT
devices running on batteries cannot afford the
implementation of cryptography algorithms as such
techniques have significant impact on the system power
consumption. Therefore, in order to operate IoT in a
secure manner, the system must be able to detect and
prevent any kind of intrusions before the network
(i.e., sensor nodes and base station) is destabilised
by the attackers. In this article, we have presented an
intrusion detection and prevention mechanism by
implementing an intelligent security architecture using
random neural networks (RNNs). The application's source
code is also instrumented at compile time in order to
detect out-of-bound memory accesses. It is based on
creating tags, to be coupled with each memory
allocation and then placing additional tag checking
instructions for each access made to the memory. To
validate the feasibility of the proposed security
solution, it is implemented for an existing IoT system
and its functionality is practically demonstrated by
successfully detecting the presence of any suspicious
sensor node within the system operating range and
anomalous activity in the base station with an accuracy
of 97.23\%. Overall, the proposed security solution has
presented a minimal performance overhead.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "27",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Do:2016:CMD,
author = "Ngoc Do and Ye Zhao and Cheng-Hsin Hsu and Nalini
Venkatasubramanian",
title = "Crowdsourced Mobile Data Transfer with Delay Bound",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "28:1--28:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2939376",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In this article, we design a crowdsourcing system,
CrowdMAC, where mobile devices form a local community
or marketplace to share network access and transfer
data for each other. CrowdMAC enables (i) mobile
clients to select and exploit multiple mobile hotspots
in its vicinity for data transfer and (ii) mobile
hotspots to open their cellular connectivity to
admit/serve delay-bounded requests from mobile users
for a fee. The evaluations of CrowdMAC indicate that
(i) mobile clients can tune preferred trade-offs
between cost and delay through a control knob, (ii)
mobile hotspots comply with all delay bounds, and (iii)
the system ensures stable and efficient transfer.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "28",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Das:2016:CWM,
author = "Aveek K. Das and Parth H. Pathak and Chen-Nee Chuah
and Prasant Mohapatra",
title = "Characterization of Wireless Multidevice Users",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "29:1--29:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2955096",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The number of wireless-enabled devices owned by a user
has had huge growth over the past few years. Over one
third of adults in the United States currently own
three wireless devices: a smartphone, laptop, and
tablet. This article provides a study of the network
usage behavior of today's multidevice users. Using data
collected from a large university campus, we provide a
detailed multidevice user (MDU) measurement study of
more than 30,000 users. The major objective of this
work is to study how the presence of multiple wireless
devices affects the network usage behavior of users.
Specifically, we characterize the usage pattern of the
different device types in terms of total and
intermittent usage, how the usage of different devices
overlap over time, and uncarried device usage
statistics. We also study user preferences of accessing
sensitive content and device-specific factors that
govern the choice of WiFi encryption type. The study
reveals several interesting findings about MDUs. We see
how the use of tablets and laptops are interchangeable
and how the overall multidevice usage is additive
instead of being shared among the devices. We also
observe how current DHCP configurations are oblivious
to multiple devices, which results in inefficient
utilization of available IP address space. All findings
about multidevice usage patterns have the potential to
be utilized by different entities, such as app
developers, network providers, security researchers,
and analytics and advertisement systems, to provide
more intelligent and informed services to users who
have at least two devices among a smartphone, tablet,
and laptop.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "29",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Clavel:2017:AIA,
author = "Chlo{\'e} Clavel and Rossana Damiano and Viviana Patti
and Paolo Rosso",
title = "Affect and Interaction in Agent-Based Systems and
Social Media: {Guest Editors}' Introduction",
journal = j-TOIT,
volume = "17",
number = "1",
pages = "1:1--1:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3018980",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yuksel:2017:BBH,
author = "Beste F. Yuksel and Penny Collisson and Mary
Czerwinski",
title = "Brains or Beauty: How to Engender Trust in User-Agent
Interactions",
journal = j-TOIT,
volume = "17",
number = "1",
pages = "2:1--2:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2998572",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Software-based agents are becoming increasingly
ubiquitous and automated. However, current technology
and algorithms are still fallible, which considerably
affects users' trust and interaction with such agents.
In this article, we investigate two factors that can
engender user trust in agents: reliability and
attractiveness of agents. We show that agent
reliability is not more important than agent
attractiveness. Subjective user ratings of agent trust
and perceived accuracy suggest that attractiveness may
be even more important than reliability.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Mancini:2017:IEL,
author = "Maurizio Mancini and Beatrice Biancardi and Florian
Pecune and Giovanna Varni and Yu Ding and Catherine
Pelachaud and Gualtiero Volpe and Antonio Camurri",
title = "Implementing and Evaluating a Laughing Virtual
Character",
journal = j-TOIT,
volume = "17",
number = "1",
pages = "3:1--3:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2998571",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Laughter is a social signal capable of facilitating
interaction in groups of people: it communicates
interest, helps to improve creativity, and facilitates
sociability. This article focuses on: endowing virtual
characters with computational models of laughter
synthesis, based on an expressivity-copying paradigm;
evaluating how the physically co-presence of the
laughing character impacts on the user's perception of
an audio stimulus and mood. We adopt music as a means
to stimulate laughter. Results show that the character
presence influences the user's perception of music and
mood. Expressivity-copying has an influence on the
user's perception of music, but does not have any
significant impact on mood.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Dastani:2017:OCM,
author = "Mehdi Dastani and Alexander Pankov",
title = "Other-Condemning Moral Emotions: Anger, Contempt and
Disgust",
journal = j-TOIT,
volume = "17",
number = "1",
pages = "4:1--4:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2998570",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article studies and analyzes three
other-condemning moral emotions: anger, contempt, and
disgust. We utilize existing psychological
theories-appraisal theories of emotion and the CAD
triad hypothesis-and incorporate them into a unified
framework. A semiformal specification of the
elicitation conditions and prototypical coping
strategies for the other-condemning emotions are
proposed. The appraisal conditions are specified in
terms of cognitive and social concepts such as goals,
beliefs, actions, control and accountability, while
coping strategies are classified as belief-, goal- and
intention-affecting strategies, and specified in terms
of action specifications. Our conceptual analysis and
semiformal specification of the three other-condemning
moral emotions are illustrated by means of an example
of trolling in the domain of social media.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Alfonso:2017:TFM,
author = "Bexy Alfonso and Emilio Vivancos and Vicente Botti",
title = "Toward Formal Modeling of Affective Agents in a {BDI}
Architecture",
journal = j-TOIT,
volume = "17",
number = "1",
pages = "5:1--5:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3001584",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Affective characteristics are crucial factors that
influence human behavior, and often, the prevalence of
either emotions or reason varies on each individual. We
aim to facilitate the development of agents' reasoning
considering their affective characteristics. We first
identify core processes in an affective BDI agent, and
we integrate them into an affective agent architecture
( GenIA$^3$ ). These tasks include the extension of the
BDI agent reasoning cycle to be compliant with the
architecture, the extension of the agent language
(Jason) to support affect-based reasoning, and the
adjustment of the equilibrium between the agent's
affective and rational sides.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Otterbacher:2017:SMY,
author = "Jahna Otterbacher and Chee Siang Ang and Marina Litvak
and David Atkins",
title = "Show Me You Care: Trait Empathy, Linguistic Style, and
Mimicry on {Facebook}",
journal = j-TOIT,
volume = "17",
number = "1",
pages = "6:1--6:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2996188",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Linguistic mimicry, the adoption of another's language
patterns, is a subconscious behavior with pro-social
benefits. However, some professions advocate its
conscious use in empathic communication. This involves
mutual mimicry; effective communicators mimic their
interlocutors, who also mimic them back. Since mimicry
has often been studied in face-to-face contexts, we ask
whether individuals with empathic dispositions have
unique communication styles and/or elicit mimicry in
mediated communication on Facebook. Participants
completed Davis's Interpersonal Reactivity Index and
provided access to Facebook activity. We confirm that
dispositional empathy is correlated to the use of
particular stylistic features. In addition, we identify
four empathy profiles and find correlations to writing
style. When a linguistic feature is used, this often
``triggers'' use by friends. However, the presence of
particular features, rather than participant
disposition, best predicts mimicry. This suggests that
machine-human communications could be enhanced based on
recently used features, without extensive user
profiling.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Meo:2017:PAS,
author = "Rosa Meo and Emilio Sulis",
title = "Processing Affect in Social Media: a Comparison of
Methods to Distinguish Emotions in Tweets",
journal = j-TOIT,
volume = "17",
number = "1",
pages = "7:1--7:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2996187",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Emotion analysis in social media is challenging. While
most studies focus on positive and negative sentiments,
the differentiation between emotions is more difficult.
We investigate the problem as a collection of binary
classification tasks on the basis of four opposing
emotion pairs provided by Plutchik. We processed the
content of messages by three alternative methods:
structural and lexical features, latent factors, and
natural language processing. The final prediction is
suggested by classifiers deriving from the state of the
art in machine learning. Results are convincing in the
possibility to distinguish the emotions pairs in social
media.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Meo:2017:UCM,
author = "Pasquale {De Meo} and Katarzyna Musial-Gabrys and
Domenico Rosaci and Giuseppe M. L. Sarn{\`e} and Lora
Aroyo",
title = "Using Centrality Measures to Predict Helpfulness-Based
Reputation in Trust Networks",
journal = j-TOIT,
volume = "17",
number = "1",
pages = "8:1--8:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2981545",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In collaborative Web-based platforms, user reputation
scores are generally computed according to two
orthogonal perspectives: (a) helpfulness-based
reputation (HBR) scores and (b) centrality-based
reputation (CBR) scores. In HBR approaches, the most
reputable users are those who post the most helpful
reviews according to the opinion of the members of
their community. In CBR approaches, a
``who-trusts-whom'' network-known as a trust network
-is available and the most reputable users occupy the
most central position in the trust network, according
to some definition of centrality. The identification of
users featuring large HBR scores is one of the most
important research issue in the field of Social
Networks, and it is a critical success factor of many
Web-based platforms like e-marketplaces, product review
Web sites, and question-and-answering systems.
Unfortunately, user reviews/ratings are often sparse,
and this makes the calculation of HBR scores
inaccurate. In contrast, CBR scores are relatively easy
to calculate provided that the topology of the trust
network is known. In this article, we investigate if
CBR scores are effective to predict HBR ones, and, to
perform our study, we used real-life datasets extracted
from CIAO and Epinions (two product review Web sites)
and Wikipedia and applied five popular centrality
measures-Degree Centrality, Closeness Centrality,
Betweenness Centrality, PageRank and Eigenvector
Centrality-to calculate CBR scores. Our analysis
provides a positive answer to our research question:
CBR scores allow for predicting HBR ones and
Eigenvector Centrality was found to be the most
important predictor. Our findings prove that we can
leverage trust relationships to spot those users
producing the most helpful reviews for the whole
community.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Binmad:2017:IEO,
author = "Ruchdee Binmad and Mingchu Li",
title = "Improving the Efficiency of an Online Marketplace by
Incorporating Forgiveness Mechanism",
journal = j-TOIT,
volume = "17",
number = "1",
pages = "9:1--9:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2996189",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Reputation plays a key role in online marketplace
communities improving trust among community members.
Reputation works as a decision-making tool for
understanding the behavior of the business partners.
Success of any online business depends on the trust the
business agents share with each other. However,
untrustworthy agents have anno place in online
marketplaces and are forced to leave the market even if
they will potentially cooperate. In this study, we
propose an exploration strategy based on a forgiveness
mechanism for untrustworthy agents to recover their
reputation. Furthermore, a number of experiments based
on the NetLogo simulation are performed to validate the
applicability of the proposed mechanism. The results
show that the online marketplaces incorporating a
forgiveness mechanism can be used with the existing
reputation systems and improve the efficiency of online
marketplaces.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Drosatos:2017:PET,
author = "George Drosatos and Aimilia Tasidou and Pavlos S.
Efraimidis",
title = "Privacy-Enhanced Television Audience Measurements",
journal = j-TOIT,
volume = "17",
number = "1",
pages = "10:1--10:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3009969",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Internet-enabled television systems (SmartTVs) are a
development that introduces these devices into the
interconnected environment of the Internet of Things.
We propose a privacy-preserving application for
computing Television Audience Measurement (TAM)
ratings. SmartTVs communicate over the Internet to
calculate aggregate measurements. Contemporary
cryptographic building blocks are utilized to ensure
the privacy of the participating individuals and the
validity of the computed TAM ratings. Additionally,
user compensation capabilities are introduced to bring
some of the company profits back to the data owners. A
prototype implementation is developed on an
Android-based SmartTV platform and experimental results
illustrate the feasibility of the approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Chopra:2017:ISI,
author = "Amit K. Chopra and Erez Shmueli and Vivek K. Singh",
title = "Introduction to the Special Issue on Advances in
Social Computing",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "11:1--11:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3080258",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Rosenthal:2017:DIM,
author = "Sara Rosenthal and Kathleen Mckeown",
title = "Detecting Influencers in Multiple Online Genres",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "12:1--12:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3014164",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Social media has become very popular and mainstream,
leading to an abundance of content. This wealth of
content contains many interactions and conversations
that can be analyzed for a variety of information. One
such type of information is analyzing the roles people
take in a conversation. Detecting influencers, one such
role, can be useful for political campaigning,
successful advertisement strategies, and detecting
terrorist leaders. We explore influence in discussion
forums, weblogs, and micro-blogs through the
development of learned language analysis components to
recognize known indicators of influence. Our components
are author traits, agreement, claims, argumentation,
persuasion, credibility, and certain dialog patterns.
Each of these components is motivated by social science
through Robert Cialdini's ``Weapons of Influence''
[Cialdini 2007]. We classify influencers across five
online genres and analyze which features are most
indicative of influencers in each genre. First, we
describe a rich suite of features that were generated
using each of the system components. Then, we describe
our experiments and results, including using domain
adaptation to exploit the data from multiple online
genres.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Perentis:2017:AUF,
author = "Christos Perentis and Michele Vescovi and Chiara
Leonardi and Corrado Moiso and Mirco Musolesi and Fabio
Pianesi and Bruno Lepri",
title = "Anonymous or Not? {Understanding} the Factors
Affecting Personal Mobile Data Disclosure",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "13:1--13:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3017431",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The wide adoption of mobile devices and social media
platforms have dramatically increased the collection
and sharing of personal information. More and more
frequently, users are called to make decisions
concerning the disclosure of their personal
information. In this study, we investigate the factors
affecting users' choices toward the disclosure of their
personal data, including not only their demographic and
self-reported individual characteristics, but also
their social interactions and their mobility patterns
inferred from months of mobile phone data activity. We
report the findings of a field study conducted with a
community of 63 subjects provided with (i) a
smart-phone and (ii) a Personal Data Store (PDS)
enabling them to control the disclosure of their data.
We monitor the sharing behavior of our participants
through the PDS and evaluate the contribution of
different factors affecting their disclosing choices of
location and social interaction data. Our analysis
shows that social interaction inferred by mobile phones
is an important factor revealing willingness to share,
regardless of the data type. In addition, we provide
further insights on the individual traits relevant to
the prediction of sharing behavior.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Goncalves:2017:ESK,
author = "Jorge Goncalves and Simo Hosio and Vassilis Kostakos",
title = "Eliciting Structured Knowledge from Situated Crowd
Markets",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "14:1--14:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3007900",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We present a crowdsourcing methodology to elicit
highly structured knowledge for arbitrary questions.
The method elicits potential answers (``options''),
criteria against which those options should be
evaluated, and a ranking of the top ``options.'' Our
study shows that situated crowdsourcing markets can
reliably elicit/moderate knowledge to generate a
ranking of options based on different criteria that
correlate with established online platforms. Our
evaluation also shows that local crowds can generate
knowledge that is missing from online platforms and on
how a local crowd perceives a certain issue. Finally,
we discuss the benefits and challenges of eliciting
structured knowledge from local crowds.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Roy:2017:FRD,
author = "Atanu Roy and Ayush Singhal and Jaideep Srivastava",
title = "Formation and Reciprocation of Dyadic Trust",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "15:1--15:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2996184",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This paper reports a detailed empirical study of
interpersonal trust in a multi-relational online social
network. This study addresses two main aspects of
interpersonal trust: formation and reciprocation.
Computational models developed, using multi-relational
networks, for these processes provide interesting
insights about online social interactions. Our findings
for trust formation (initiation) indicate a strong role
of lower familiarity interactions before trust(high
familiarity relationship) is formed. Similarly, trust
reciprocation is not automatic, but strongly depends on
enough lower familiarity interactions. This study is
the first quantification of the ``scaffolding role''
played by lower familiarity interactions, in formation
of high familiarity relationships.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "15",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ruan:2017:MTB,
author = "Yefeng Ruan and Ping Zhang and Lina Alfantoukh and
Arjan Durresi",
title = "Measurement Theory-Based Trust Management Framework
for Online Social Communities",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "16:1--16:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015771",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We propose a trust management framework based on
measurement theory to infer indirect trust in online
social communities using trust's transitivity property.
Inspired by the similarities between human trust and
measurement, we propose a new trust metric, composed of
impression and confidence, which captures both trust
level and its certainty. Furthermore, based on error
propagation theory, we propose a method to compute
indirect confidence according to different trust
transitivity and aggregation operators. We perform
experiments on two real data sets, Epinions.com and
Twitter, to validate our framework. Also, we show that
inferring indirect trust can connect more pairs of
users.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "16",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Weth:2017:CPS,
author = "Christian {Von Der Weth} and Ashraf M. Abdul and Mohan
Kankanhalli",
title = "Cyber-Physical Social Networks",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "17:1--17:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2996186",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In the offline world, getting to know new people is
heavily influenced by people's physical context, that
is, their current geolocation. People meet in classes,
bars, clubs, public transport, and so on. In contrast,
first-generation online social networks such as
Facebook or Google+ do not consider users' context and
thus mainly reflect real-world relationships (e.g.,
family, friends, colleagues). Location-based social
networks, or second-generation social networks, such as
Foursquare or Facebook Places, take the physical
location of users into account to find new friends.
However, with the increasing number and wide range of
popular platforms and services on the Web, people spend
a considerable time moving through the online worlds.
In this article, we introduce cyber-physical social
networks (CPSN) as the third generation of online
social networks. Beside their physical locations, CPSN
consider also users' virtual locations for connecting
to new friends. In a nutshell, we regard a web page as
a place where people can meet and interact. The
intuition is that a web page is a good indicator for a
user's current interest, likings, or information needs.
Moreover, we link virtual and physical locations,
allowing for users to socialize across the online and
offline world. Our main contributions focus on the two
fundamental tasks of creating meaningful virtual
locations as well as creating meaningful links between
virtual and physical locations, where ``meaningful''
depends on the application scenario. To this end, we
present OneSpace, our prototypical implementation of a
cyber-physical social network. OneSpace provides a live
and social recommendation service for touristic venues
(e.g., hotels, restaurants, attractions). It allows
mobile users close to a venue and web users browsing
online content about the venue to connect and interact
in an ad hoc manner. Connecting users based on their
shared virtual and physical locations gives way to a
plethora of novel use cases for social computing, as we
will illustrate. We evaluate our proposed methods for
constructing and linking locations and present the
results of a first user study investigating the
potential impact of cyber-physical social networks.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "17",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Alsaedi:2017:CWP,
author = "Nasser Alsaedi and Pete Burnap and Omer Rana",
title = "Can We Predict a Riot? {Disruptive} Event Detection
Using {Twitter}",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "18:1--18:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2996183",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In recent years, there has been increased interest in
real-world event detection using publicly accessible
data made available through Internet technology such as
Twitter, Facebook, and YouTube. In these highly
interactive systems, the general public are able to
post real-time reactions to ``real world'' events,
thereby acting as social sensors of terrestrial
activity. Automatically detecting and categorizing
events, particularly small-scale incidents, using
streamed data is a non-trivial task but would be of
high value to public safety organisations such as local
police, who need to respond accordingly. To address
this challenge, we present an end-to-end integrated
event detection framework that comprises five main
components: data collection, pre-processing,
classification, online clustering, and summarization.
The integration between classification and clustering
enables events to be detected, as well as related
smaller-scale ``disruptive events,'' smaller incidents
that threaten social safety and security or could
disrupt social order. We present an evaluation of the
effectiveness of detecting events using a variety of
features derived from Twitter posts, namely temporal,
spatial, and textual content. We evaluate our framework
on a large-scale, real-world dataset from Twitter.
Furthermore, we apply our event detection system to a
large corpus of tweets posted during the August 2011
riots in England. We use ground-truth data based on
intelligence gathered by the London Metropolitan Police
Service, which provides a record of actual terrestrial
events and incidents during the riots, and show that
our system can perform as well as terrestrial sources,
and even better in some cases.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "18",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yang:2017:DSC,
author = "Zhenguo Yang and Qing Li and Zheng Lu and Yun Ma and
Zhiguo Gong and Wenyin Liu",
title = "Dual Structure Constrained Multimodal Feature Coding
for Social Event Detection from {Flickr} Data",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "19:1--19:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015463",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In this work, a three-stage social event detection
(SED) framework is proposed to discover events from
Flickr-like data. First, multiple bipartite graphs are
constructed for the heterogeneous feature modalities to
achieve fused features. Furthermore, considering the
geometrical structures of dictionary and data, a dual
structure constrained multimodal feature coding model
is designed to learn discriminative feature codes by
incorporating corresponding regularization terms into
the objective. Finally, clustering models utilizing
density or label knowledge and data recovery residual
models are devised to discover real-world events. The
proposed SED approach achieves the highest performance
on the MediaEval 2014 SED dataset.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "19",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ciesielczyk:2017:PRI,
author = "Michal Ciesielczyk and Andrzej Szwabe and Mikolaj
Morzy and Pawel Misiorek",
title = "Progressive Random Indexing: Dimensionality Reduction
Preserving Local Network Dependencies",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "20:1--20:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2996185",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The vector space model is undoubtedly among the most
popular data representation models used in the
processing of large networks. Unfortunately, the vector
space model suffers from the so-called curse of
dimensionality, a phenomenon where data become
extremely sparse due to an exponential growth of the
data space volume caused by a large number of
dimensions. Thus, dimensionality reduction techniques
are necessary to make large networks represented in the
vector space model available for analysis and
processing. Most dimensionality reduction techniques
tend to focus on principal components present in the
data, effectively disregarding local relationships that
may exist between objects. This behavior is a
significant drawback of current dimensionality
reduction techniques, because these local relationships
are crucial for maintaining high accuracy in many
network analysis tasks, such as link prediction or
community detection. To rectify the aforementioned
drawback, we propose Progressive Random Indexing, a new
dimensionality reduction technique. Built upon
Reflective Random Indexing, our method significantly
reduces the dimensionality of the vector space model
while retaining all important local relationships
between objects. The key element of the Progressive
Random Indexing technique is the use of the gain value
at each reflection step, which determines how much
information about local relationships should be
included in the space of reduced dimensionality. Our
experiments indicate that when applied to large
real-world networks (Facebook social network, MovieLens
movie recommendations), Progressive Random Indexing
outperforms state-of-the-art methods in link prediction
tasks.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "20",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Billet:2017:SOP,
author = "Benjamin Billet and Val{\'e}rie Issarny",
title = "{Spinel}: an Opportunistic Proxy for Connecting
Sensors to the {Internet of Things}",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "21:1--21:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3041025",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Nowadays, various static wireless sensor networks
(WSN) are deployed in the environment for many
purposes: traffic control, pollution monitoring, and so
on. The willingness to open these legacy WSNs to the
users is emerging, by integrating them to the Internet
network as part of the future Internet of Things (IoT),
for example, in the context of smart cities and open
data policies. While legacy sensors cannot be directly
connected to the Internet in general, emerging
standards such as 6LoWPAN are aimed at solving this
issue but require us to update or replace the existing
devices. As a solution to connect legacy sensors to the
IoT, we propose to take advantage of the multi-modal
connectivity as well as the mobility of smartphones to
use phones as opportunistic proxies, that is, mobile
proxies that opportunistically discover closeby static
sensors and act as intermediaries with the IoT, with
the additional benefit of bringing fresh information
about the environment to the smartphones' owners.
However, this requires us to monitor the smartphone's
mobility and further infer when to discover and
register the sensors to guarantee the efficiency and
reliability of opportunistic proxies. To that end, we
introduce and evaluate an approach based on mobility
analysis that uses a novel path prediction technique to
predict when and where the user is not moving, and
thereby serves to anticipate the registration of
sensors within communication range. We show that this
technique enables the deployment of low-cost
resource-efficient mobile proxies to connect legacy
WSNs with the IoT.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "21",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Liu:2017:SLD,
author = "Xumin Liu and Weishi Shi and Arpeet Kale and Chen Ding
and Qi Yu",
title = "Statistical Learning of Domain-Specific
Quality-of-Service Features from User Reviews",
journal = j-TOIT,
volume = "17",
number = "2",
pages = "22:1--22:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3053381",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "With the fast increase of online services of all
kinds, users start to care more about the Quality of
Service (QoS) that a service provider can offer besides
the functionalities of the services. As a result,
QoS-based service selection and recommendation have
received significant attention since the mid-2000s.
However, existing approaches primarily consider a small
number of standard QoS parameters, most of which relate
to the response time, fee, availability of services,
and so on. As online services start to diversify
significantly over different domains, these small set
of QoS parameters will not be able to capture the
different quality aspects that users truly care about
over different domains. Most existing approaches for
QoS data collection depend on the information from
service providers, which are sensitive to the
trustworthiness of the providers. Some service
monitoring mechanisms collect QoS data through actual
service invocations but may be affected by actual
hardware/software configurations. In either case,
domain-specific QoS data that capture what users truly
care about have not been successfully collected or
analyzed by existing works in service computing. To
address this demanding issue, we develop a statistical
learning approach to extract domain-specific QoS
features from user-provided service reviews. In
particular, we aim to classify user reviews based on
their sentiment orientations into either a positive or
negative category. Meanwhile, statistical feature
selection is performed to identify statistically
nontrivial terms from review text, which can serve as
candidate QoS features. We also develop a topic
models-based approach that automatically groups
relevant terms and returns the term groups to users,
where each term group corresponds to one high-level
quality aspect of services. We have conducted extensive
experiments on three real-world datasets to
demonstrates the effectiveness of our approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "22",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Gurevych:2017:ASM,
author = "Iryna Gurevych and Marco Lippi and Paolo Torroni",
title = "Argumentation in Social Media",
journal = j-TOIT,
volume = "17",
number = "3",
pages = "23:1--23:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3056539",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:26 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "23",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Lawrence:2017:DTD,
author = "John Lawrence and Mark Snaith and Barbara Konat and
Katarzyna Budzynska and Chris Reed",
title = "Debating Technology for Dialogical Argument:
Sensemaking, Engagement, and Analytics",
journal = j-TOIT,
volume = "17",
number = "3",
pages = "24:1--24:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3007210",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:26 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Debating technologies, a newly emerging strand of
research into computational technologies to support
human debating, offer a powerful way of providing
naturalistic, dialogue-based interaction with complex
information spaces. The full potential of debating
technologies for dialogical argument can, however, only
be realized once key technical and engineering
challenges are overcome, namely data structure, data
availability, and interoperability between components.
Our aim in this article is to show that the Argument
Web, a vision for integrated, reusable, semantically
rich resources connecting views, opinions, arguments,
and debates online, offers a solution to these
challenges. Through the use of a running example taken
from the domain of citizen dialogue, we demonstrate for
the first time that different Argument Web components
focusing on sensemaking, engagement, and analytics can
work in concert as a suite of debating technologies for
rich, complex, dialogical argument.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "24",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Lawrence:2017:UAS,
author = "John Lawrence and Joonsuk Park and Katarzyna Budzynska
and Claire Cardie and Barbara Konat and Chris Reed",
title = "Using Argumentative Structure to Interpret Debates in
Online Deliberative Democracy and {eRulemaking}",
journal = j-TOIT,
volume = "17",
number = "3",
pages = "25:1--25:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3032989",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:26 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Governments around the world are increasingly
utilising online platforms and social media to engage
with, and ascertain the opinions of, their citizens.
Whilst policy makers could potentially benefit from
such enormous feedback from society, they first face
the challenge of making sense out of the large volumes
of data produced. In this article, we show how the
analysis of argumentative and dialogical structures
allows for the principled identification of those
issues that are central, controversial, or popular in
an online corpus of debates. Although areas such as
controversy mining work towards identifying issues that
are a source of disagreement, by looking at the deeper
argumentative structure, we show that a much richer
understanding can be obtained. We provide results from
using a pipeline of argument-mining techniques on the
debate corpus, showing that the accuracy obtained is
sufficient to automatically identify those issues that
are key to the discussion, attracting proportionately
more support than others, and those that are divisive,
attracting proportionately more conflicting
viewpoints.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "25",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Mohammad:2017:SST,
author = "Saif M. Mohammad and Parinaz Sobhani and Svetlana
Kiritchenko",
title = "Stance and Sentiment in Tweets",
journal = j-TOIT,
volume = "17",
number = "3",
pages = "26:1--26:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3003433",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:26 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We can often detect from a person's utterances whether
he or she is in favor of or against a given target
entity-one's stance toward the target. However, a
person may express the same stance toward a target by
using negative or positive language. Here for the first
time we present a dataset of tweet-target pairs
annotated for both stance and sentiment. The targets
may or may not be referred to in the tweets, and they
may or may not be the target of opinion in the tweets.
Partitions of this dataset were used as training and
test sets in a SemEval-2016 shared task competition. We
propose a simple stance detection system that
outperforms submissions from all 19 teams that
participated in the shared task. Additionally, access
to both stance and sentiment annotations allows us to
explore several research questions. We show that
although knowing the sentiment expressed by a tweet is
beneficial for stance classification, it alone is not
sufficient. Finally, we use additional unlabeled data
through distant supervision techniques and word
embeddings to further improve stance classification.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "26",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Kokciyan:2017:AAR,
author = "Nadin K{\"o}kciyan and Nefise Yaglikci and Pinar
Yolum",
title = "An Argumentation Approach for Resolving Privacy
Disputes in Online Social Networks",
journal = j-TOIT,
volume = "17",
number = "3",
pages = "27:1--27:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3003434",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:26 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Preserving users' privacy is important for Web
systems. In systems where transactions are managed by a
single user, such as e-commerce systems, preserving
privacy of the transactions is merely the capability of
access control. However, in online social networks,
where each transaction is managed by and has effect on
others, preserving privacy is difficult. In many cases,
the users' privacy constraints are distributed,
expressed in a high-level manner, and would depend on
information that only becomes available over
interactions with others. Hence, when a content is
being shared by a user, others who might be affected by
the content should discuss and agree on how the content
will be shared online so that none of their privacy
constraints are violated. To enable this, we model
users of the social networks as agents that represent
their users' privacy constraints as semantic rules.
Agents argue with each other on propositions that
enable their privacy rules by generating facts and
assumptions from their ontology. Moreover, agents can
seek help from others by requesting new information to
enrich their ontology. Using assumption-based
argumentation, agents decide whether a content should
be shared or not. We evaluate the applicability of our
approach on real-life privacy scenarios in comparison
with user surveys.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "27",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Wachsmuth:2017:UMD,
author = "Henning Wachsmuth and Benno Stein",
title = "A Universal Model for Discourse-Level Argumentation
Analysis",
journal = j-TOIT,
volume = "17",
number = "3",
pages = "28:1--28:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2957757",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:26 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The argumentative structure of texts is increasingly
exploited for analysis tasks, for example, for stance
classification or the assessment of argumentation
quality. Most existing approaches, however, model only
the local structure of single arguments. This article
considers the question of how to capture the global
discourse-level structure of a text for
argumentation-related analyses. In particular, we
propose to model the global structure as a flow of
``task-related rhetorical moves,'' such as discourse
functions or aspect-based sentiment. By comparing the
flow of a text to a set of common flow patterns, we map
the text into the feature space of global structures,
thus capturing its discourse-level argumentation. We
show how to identify different types of flow patterns,
and we provide evidence that they generalize well
across different domains of texts. In our evaluation
for two analysis tasks, the classification of review
sentiment and the scoring of essay organization, the
features derived from flow patterns prove both
effective and more robust than strong baselines. We
conclude with a discussion of the universality of
modeling flow for discourse-level argumentation
analysis.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "28",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Awad:2017:EAA,
author = "Edmond Awad and Jean-Fran{\c{c}}ois Bonnefon and
Martin Caminada and Thomas W. Malone and Iyad Rahwan",
title = "Experimental Assessment of Aggregation Principles in
Argumentation-Enabled Collective Intelligence",
journal = j-TOIT,
volume = "17",
number = "3",
pages = "29:1--29:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3053371",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:26 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "On the Web, there is always a need to aggregate
opinions from the crowd (as in posts, social networks,
forums, etc.). Different mechanisms have been
implemented to capture these opinions such as Like in
Facebook, Favorite in Twitter, thumbs-up/-down,
flagging, and so on. However, in more contested domains
(e.g., Wikipedia, political discussion, and climate
change discussion), these mechanisms are not
sufficient, since they only deal with each issue
independently without considering the relationships
between different claims. We can view a set of
conflicting arguments as a graph in which the nodes
represent arguments and the arcs between these nodes
represent the defeat relation. A group of people can
then collectively evaluate such graphs. To do this, the
group must use a rule to aggregate their individual
opinions about the entire argument graph. Here we
present the first experimental evaluation of different
principles commonly employed by aggregation rules
presented in the literature. We use randomized
controlled experiments to investigate which principles
people consider better at aggregating opinions under
different conditions. Our analysis reveals a number of
factors, not captured by traditional formal models,
that play an important role in determining the efficacy
of aggregation. These results help bring formal models
of argumentation closer to real-world application.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "29",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Carstens:2017:UAI,
author = "Lucas Carstens and Francesca Toni",
title = "Using Argumentation to Improve Classification in
Natural Language Problems",
journal = j-TOIT,
volume = "17",
number = "3",
pages = "30:1--30:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3017679",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:26 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Argumentation has proven successful in a number of
domains, including Multi-Agent Systems and decision
support in medicine and engineering. We propose its
application to a domain yet largely unexplored by
argumentation research: computational linguistics. We
have developed a novel classification methodology that
incorporates reasoning through argumentation with
supervised learning. We train classifiers and then
argue about the validity of their output. To do so, we
identify arguments that formalise prototypical
knowledge of a problem and use them to correct
misclassifications. We illustrate our methodology on
two tasks. On the one hand, we address cross-domain
sentiment polarity classification, where we train
classifiers on one corpus, for example, Tweets, to
identify positive/negative polarity and classify
instances from another corpus, for example, sentences
from movie reviews. On the other hand, we address a
form of argumentation mining that we call
Relation-based Argumentation Mining, where we classify
pairs of sentences based on whether the first sentence
attacks or supports the second or whether it does
neither. Whenever we find that one sentence
attacks/supports the other, we consider both to be
argumentative, irrespective of their stand-alone
argumentativeness. For both tasks, we improve
classification performance when using our methodology,
compared to using standard classifiers only.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "30",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Hu:2017:MDS,
author = "Yan Hu and Weisong Shi and Hong Li and Xiaohui Hu",
title = "Mitigating Data Sparsity Using Similarity
Reinforcement-Enhanced Collaborative Filtering",
journal = j-TOIT,
volume = "17",
number = "3",
pages = "31:1--31:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3062179",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:26 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The data sparsity problem has attracted significant
attention in collaborative filtering-based recommender
systems. To alleviate data sparsity, several previous
efforts employed hybrid approaches that incorporate
auxiliary data sources into recommendation techniques,
like content, context, or social relationships.
However, due to privacy and security concerns, it is
generally difficult to collect such auxiliary
information. In this article, we focus on the pure
collaborative filtering methods without relying on any
auxiliary data source. We propose an improved
memory-based collaborative filtering approach enhanced
by a novel similarity reinforcement mechanism. It can
discover potential similarity relationships between
users or items by making better use of known but
limited user-item interactions, thus to extract
plentiful historical rating information from similar
neighbors to make more reliable and accurate rating
predictions. This approach integrates user similarity
reinforcement and item similarity reinforcement into a
comprehensive framework and lets them enhance each
other. Comprehensive experiments conducted on several
public datasets demonstrate that, in the face of data
sparsity, our approach achieves a significant
improvement in prediction accuracy when compared with
the state-of-the-art memory-based and model-based
collaborative filtering algorithms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "31",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Balsa:2017:TIC,
author = "Ero Balsa and Cristina P{\'e}rez-Sol{\`a} and Claudia
Diaz",
title = "Towards Inferring Communication Patterns in Online
Social Networks",
journal = j-TOIT,
volume = "17",
number = "3",
pages = "32:1--32:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3093897",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:26 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The separation between the public and private spheres
on online social networks is known to be, at best,
blurred. On the one hand, previous studies have shown
how it is possible to infer private attributes from
publicly available data. On the other hand, no
distinction exists between public and private data when
we consider the ability of the online social network
(OSN) provider to access them. Even when OSN users go
to great lengths to protect their privacy, such as by
using encryption or communication obfuscation,
correlations between data may render these solutions
useless. In this article, we study the relationship
between private communication patterns and publicly
available OSN data. Such a relationship informs both
privacy-invasive inferences as well as OSN
communication modelling, the latter being key toward
developing effective obfuscation tools. We propose an
inference model based on Bayesian analysis and
evaluate, using a real social network dataset, how
archetypal social graph features can lead to inferences
about private communication. Our results indicate that
both friendship graph and public traffic data may not
be informative enough to enable these inferences, with
time analysis having a non-negligible impact on their
precision.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "32",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Chapman:2017:GEP,
author = "Adriane Chapman and James Cheney and Simon Miles",
title = "Guest Editorial: The Provenance of Online Data",
journal = j-TOIT,
volume = "17",
number = "4",
pages = "33:1--33:??",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3108938",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:05 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "33",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bates:2017:TCT,
author = "Adam Bates and Dave (Jing) Tian and Grant Hernandez
and Thomas Moyer and Kevin R. B. Butler and Trent
Jaeger",
title = "Taming the Costs of Trustworthy Provenance through
Policy Reduction",
journal = j-TOIT,
volume = "17",
number = "4",
pages = "34:1--34:??",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3062180",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:05 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Provenance is an increasingly important tool for
understanding and even actively preventing system
intrusion, but the excessive storage burden imposed by
automatic provenance collection threatens to undermine
its value in practice. This situation is made worse by
the fact that the majority of this metadata is unlikely
to be of interest to an administrator, instead
describing system noise or other background activities
that are not germane to the forensic investigation. To
date, storing data provenance in perpetuity was a
necessary concession in even the most advanced
provenance tracking systems in order to ensure the
completeness of the provenance record for future
analyses. In this work, we overcome this obstacle by
proposing a policy-based approach to provenance
filtering, leveraging the confinement properties
provided by Mandatory Access Control (MAC) systems in
order to identify and isolate subdomains of system
activity for which to collect provenance. We introduce
the notion of minimal completeness for provenance
graphs, and design and implement a system that provides
this property by exclusively collecting provenance for
the trusted computing base of a target application. In
evaluation, we discover that, while the efficacy of our
approach is domain dependent, storage costs can be
reduced by as much as 89\% in critical scenarios such
as provenance tracking in cloud computing data centers.
To the best of our knowledge, this is the first
policy-based provenance monitor to appear in the
literature.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "34",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Moreau:2017:CFP,
author = "Luc Moreau",
title = "A Canonical Form for {PROV} Documents and Its
Application to Equality, Signature, and Validation",
journal = j-TOIT,
volume = "17",
number = "4",
pages = "35:1--35:??",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3032990",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:05 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We present a canonical form for prov that is a
normalized way of representing prov documents as
mathematical expressions. As opposed to the normal form
specified by the prov-constraints recommendation, the
canonical form we present is defined for all prov
documents, irrespective of their validity, and it can
be serialized in a unique way. The article makes the
case for a canonical form for prov and its potential
uses, namely comparison of prov documents in different
formats, validation, and signature of prov documents. A
signature of a prov document allows the integrity and
the author of provenance to be ascertained; since the
signature is based on the canonical form, these checks
are not tied to a particular encoding, but can be
performed on any representation of prov.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "35",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Neves:2017:MPI,
author = "Vitor C. Neves and Daniel {De Oliveira} and Kary A. C.
S. Oca{\~n}a and Vanessa Braganholo and Leonardo
Murta",
title = "Managing Provenance of Implicit Data Flows in
Scientific Experiments",
journal = j-TOIT,
volume = "17",
number = "4",
pages = "36:1--36:??",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3053372",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:05 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Scientific experiments modeled as scientific workflows
may create, change, or access data products not
explicitly referenced in the workflow specification,
leading to implicit data flows. The lack of knowledge
about implicit data flows makes the experiments hard to
understand and reproduce. In this article, we present
ProvMonitor, an approach that identifies the creation,
change, or access to data products even within implicit
data flows. ProvMonitor links this information with the
workflow activity that generated it, allowing for
scientists to compare data products within and
throughout trials of the same workflow, identifying
side effects on data evolution caused by implicit data
flows. We evaluated ProvMonitor and observed that it
could answer queries for scenarios that demand specific
knowledge related to implicit provenance.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "36",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Stamatogiannakis:2017:PPP,
author = "Manolis Stamatogiannakis and Elias Athanasopoulos and
Herbert Bos and Paul Groth",
title = "{PROV$_{2R}$}: Practical Provenance Analysis of
Unstructured Processes",
journal = j-TOIT,
volume = "17",
number = "4",
pages = "37:1--37:??",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3062176",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:05 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Information produced by Internet applications is
inherently a result of processes that are executed
locally. Think of a web server that makes use of a CGI
script, or a content management system where a post was
first edited using a word processor. Given the impact
of these processes to the content published online, a
consumer of that information may want to understand
what those impacts were. For example, understanding
from where text was copied and pasted to make a post,
or if the CGI script was updated with the latest
security patches, may all influence the confidence on
the published content. Capturing and exposing this
information provenance is thus important to
ascertaining trust to online content. Furthermore,
providers of internet applications may wish to have
access to the same information for debugging or audit
purposes. For processes following a rigid structure
(such as databases or workflows), disclosed provenance
systems have been developed that efficiently and
accurately capture the provenance of the produced data.
However, accurately capturing provenance from
unstructured processes, for example, user-interactive
computing used to produce web content, remains a
problem to be tackled. In this article, we address the
problem of capturing and exposing provenance from
unstructured processes. Our approach, called
PROV$_{2R}$ (PROVenance Record and Replay) is composed
of two parts: (a) the decoupling of provenance analysis
from its capture; and (b) the capture of high-fidelity
provenance from unmodified programs. We use techniques
originating in the security and reverse engineering
communities, namely, record and replay and taint
tracking. Taint tracking fundamentally addresses the
data provenance problem but is impractical to apply at
runtime due to extremely high overhead. With a number
of case studies, we demonstrate that PROV$_{2R}$
enables the use of taint analysis for high-fidelity
provenance capture, while keeping the runtime overhead
at manageable levels. In addition, we show how captured
information can be represented using the W3C PROV
provenance model for exposure on the Web.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "37",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Weber:2017:FAI,
author = "Steven Weber",
title = "Facilitating Adoption of {Internet} Technologies and
Services with Externalities via Cost Subsidization",
journal = j-TOIT,
volume = "17",
number = "4",
pages = "38:1--38:??",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3091109",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:05 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article models the temporal adoption dynamics of
an abstracted Internet technology or service, where the
instantaneous net value of the service perceived by
each (current or potential) user/customer incorporates
three key features: (i) user service affinity
heterogeneity, (ii) a network externality, and (iii) a
subscription cost. Internet technologies and services
with network externalities face a ``chicken-and-egg''
adoption problem in that the service requires an
established customer base to attract new customers. In
this article, we study cost subsidization as a means to
``reach the knee,'' at which point the externality
drives rapid service adoption, and thereby change the
equilibrium service fractional adoption level from an
initial near-zero level to a final near-one level (full
adoption). We present three simple subsidy models and
evaluate them under two natural performance metrics:
(i) the duration required for the subsidized service to
reach a given target adoption level and (ii) the
aggregate cost of the subsidy born by the service
provide. First, we present a ``two-target adoption
subsidy'' that subsidizes the cost to keep the fraction
of users with positive net utility at a (constant)
target level until the actual adoption target is
reached. Second, we study a special case of the above
where the target ensures all users have positive net
utility, corresponding to a ``quickest adoption''
subsidy (QAS). Third, we introduce an approximation of
QAS that only requires the service provider adjust the
subsidy level a prescribed number of times. Fourth, we
study equilibria and their stability under uniformly
and normally distributed user service affinities,
highlighting the unstable equilibrium in each case as
the natural target adoption level for the provider.
Finally, we provide a fictional case study to
illustrate the application of the results in a
(hopefully) realistic scenario, along with a brief
discussion of the limitations of the model and
analysis.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "38",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Garcia-Dorado:2017:BMW,
author = "Jos{\'e} Luis Garc{\'\i}a-Dorado",
title = "Bandwidth Measurements within the Cloud:
Characterizing Regular Behaviors and Correlating
Downtimes",
journal = j-TOIT,
volume = "17",
number = "4",
pages = "39:1--39:??",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3093893",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:05 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The search for availability, reliability, and quality
of service has led cloud infrastructure customers to
disseminate their services, contents, and data over
multiple cloud data centers, often involving several
Cloud service providers (CSPs). The consequence of this
is that a large amount of data must be transmitted
across the public Cloud. However, little is known about
the bandwidth dynamics involved. To address this, we
have conducted a measurement campaign for bandwidth
between 18 data centers of four major CSPs. This
extensive campaign allowed us to characterize the
resulting time series of bandwidth as the addition of a
stationary component and some infrequent excursions
(typically downtimes). While the former provides a
description of the bandwidth users can expect in the
Cloud, the latter is closely related to the robustness
of the Cloud (i.e., the occurrence of downtimes is
correlated). Both components have been studied further
by applying factor analysis, specifically analysis of
variance, as a mechanism to formally compare data
centers' behaviors and extract generalities. The
results show that the stationary process is closely
related to the data center locations and CSPs involved
in transfers that, fortunately, make the Cloud more
predictable and allow the set of reported measurements
to be extrapolated. On the other hand, although
correlation in the Cloud is low, that is, only 10\% of
the measured pair of paths showed some correlation, we
found evidence that such correlation depends on the
particular relationships between pairs of data centers
with little connection to more general factors.
Positively, this implies that data centers either in
the same area or within the same CSP do not show
qualitatively more correlation than other data centers,
which eases the deployment of robust infrastructures.
On the downside, this metric is scarcely generalizable
and, consequently, calls for exhaustive monitoring.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "39",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Shao:2017:ECI,
author = "Jianhua Shao and Hoang Ong",
title = "Exploiting Contextual Information in Attacking
Set-Generalized Transactions",
journal = j-TOIT,
volume = "17",
number = "4",
pages = "40:1--40:??",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3106165",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:05 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Transactions are records that contain a set of items
about individuals. For example, items browsed by a
customer when shopping online form a transaction.
Today, many activities are carried out on the Internet,
resulting in a large amount of transaction data being
collected. Such data are often shared and analyzed to
improve business and services, but they also contain
private information about individuals that must be
protected. Techniques have been proposed to sanitize
transaction data before their release, and set-based
generalization is one such method. In this article, we
study how well set-based generalization can protect
transactions. We propose methods to attack
set-generalized transactions by exploiting contextual
information that is available within the released data.
Our results show that set-based generalization may not
provide adequate protection for transactions, and up to
70\% of the items added into the transactions during
generalization to obfuscate original data can be
detected by our methods with a precision over 80\%.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "40",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Damiani:2017:EOS,
author = "Ernesto Damiani and Ryszard Kowalczyk and Gerard
Parr",
title = "Extending the Outreach: From Smart Cities to Connected
Communities",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "1:1--1:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3140543",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Connected Communities (CCs) are socio-technical
systems that rely on an information and communication
technology (ICT) infrastructure to integrate people and
organizations (companies, schools, hospitals,
universities, local and national government agencies)
willing to share information and perform joint
decision-making to create sustainable and equitable
work and living environments. We discuss a research
agenda considering CCs from three distinct but
complementary points of view: CC metaphors, models, and
services.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhang:2017:AMR,
author = "Haibo Zhang and Luming Wan and Yawen Chen and Laurence
T. Yang and Lizhi Peng",
title = "Adaptive Message Routing and Replication in Mobile
Opportunistic Networks for Connected Communities",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "2:1--2:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3122984",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Mobile opportunistic networking is a promising
technology that can supplement existing cellular and
WiFi networks to provide desirable services for smart
and connected communities. Message routing is the most
compelling challenge in mobile opportunistic networks
due to the lack of contemporaneous end-to-end paths and
the resource constraints at mobile devices. To improve
the probability of successful message delivery, most
existing routing schemes use the past contact history
to predict future contacts for message forwarding, and
exploit message replication and redundancy for
multicopy routing. However, most existing
prediction-based routing schemes simply use the average
pairwise contact probability as the routing metric and
neglect the benefits of exploring fine-grained contact
information such as pairwise repeated contact patterns
to improve the accuracy of predicting future contacts.
Moreover, there is no efficient mechanism that can
adaptively control message replication in a
decentralized manner to achieve both high probability
of successful message delivery and low message
overhead. To address these problems, we present FGAR, a
routing protocol designed for mobile opportunistic
networks by leveraging fine-grained contact
characterization and adaptive message replication. In
FGAR, contact history is characterized in a
fine-grained manner with timing information using a
sliding window mechanism, and future contacts are
predicted based on the fine-grained contact
information, thereby improving the accuracy of contact
prediction. We further design an efficient message
replication scheme in which message replication is
controlled in a fully decentralized manner by taking
into account the expected message delivery probability,
the replication history, and the quality of the
encountered device. A replica is generated only when it
is necessary to fulfill the expected message delivery
probability. We evaluate our scheme through
trace-driven simulations, and the simulation results
show that FGAR outperforms existing schemes. In
comparison with PRoPHET, FGAR can achieve more than
20\% improvement on average on successful message
delivery, whereas the message overhead has been reduced
by a factor up to 15.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Kim:2017:MDS,
author = "Taehun Kim and Junsung Lim and Heesuk Son and
Byoungheon Shin and Dongman Lee and Soon J. Hyun",
title = "A Multi-Dimensional Smart Community Discovery Scheme
for {IoT}-Enriched Smart Homes",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "3:1--3:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3062178",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The proliferation of the Internet into every household
has provided more opportunities for residents to become
closer to each other than before. However, solid
structural barrier is raised and social relationships
within such neighborhoods are weak compared to those in
traditional towns. Accordingly, activating communities
and ultimately enhancing a sense of community through
constructive participation and communal sharing of
labor among residents has currently emerged as a
challenging issue in a contemporary housing complex. In
an effort to activate those communities, a notion of
smart community is presented in which multiple smart
homes are equipped with Internet of Things and
interconnected with each other. Beyond the unadorned
smart community composed by physical proximity, it is
essential to discover a human-centric community that
achieves communal benefits and enables residents to
maximize individual economic gain by leveraging
collective intelligence. In this article, we present a
multi-dimensional smart community discovery scheme that
enables householders to find human-centric community
considering multi-dimensional factors in terms of
physical, social, and economical aspects. We conduct
experiments with 30 real households by applying a
community-based energy saving scenario. Experiment
results show that the proposed scheme performs better
when compared to the physical proximity-based one in
energy consumption and user satisfaction.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Prandi:2017:NTS,
author = "Catia Prandi and Silvia Mirri and Stefano Ferretti and
Paola Salomoni",
title = "On the Need of Trustworthy Sensing and Crowdsourcing
for Urban Accessibility in {Smart City}",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "4:1--4:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3133327",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Mobility in urban environments is an undisputed key
factor that can affect citizens' well-being and quality
of life. This is particularly relevant for those people
with disabilities or with reduced mobility who have to
face the presence of barriers in urban areas. In this
scenario, the availability of information about such
architectural elements (together with facilities) can
greatly support citizens' mobility by enhancing their
independence and their abilities in conducting daily
outdoor activities. With this in mind, we have designed
and developed mobile Pervasive Accessibility Social
Sensing (mPASS), a system that provides users with
personalized paths, computed on the basis of their own
preferences and needs, with a customizable and
accessible interface. The system collects data from
crowdsourcing and crowdsensing to map urban and
architectural accessibility by providing reliable
information coming from different data sources with
different levels of trustworthiness. In this context,
reliability can be ensured by properly managing
crowdsourced and crowdsensed data, combined when
possible with authoritative datasets, provided by
disability rights organizations and local authorities.
To demonstrate this claim, in this article we present
our trustworthiness model and discuss results we have
obtained by simulations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Longo:2017:CSD,
author = "Antonella Longo and Marco Zappatore and Mario
Bochicchio and Shamkant B. Navathe",
title = "Crowd-Sourced Data Collection for Urban Monitoring via
Mobile Sensors",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "5:1--5:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3093895",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "A considerable amount of research has addressed
Internet of Things and connected communities. It is
possible to exploit the sensing capabilities of
connected communities, by leveraging the continuously
growing use of cloud computing solutions and mobile
devices. The pervasiveness of mobile sensors also
enables the Mobile Crowd Sensing (MCS) paradigm, which
aims at using mobile-embedded sensors to extend
monitoring of multiple (environmental) phenomena in
expansive urban areas. In this article, we discuss our
approach with a cloud-based platform to pave the way
for applying crowd sensing in urban scenarios. We have
implemented a complete solution for environmental
monitoring of several pollutants, like noise, air,
electromagnetic fields, and so on in an urban area
based on this paradigm. Through extensive
experimentation, specifically on noise pollution, we
show how the proposed infrastructure exhibits the
ability to collect data from connected communities, and
enables a seamless support of services needed for
improving citizens' quality of life and eventually
helps city decision makers in urban planning.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ambrosin:2017:OBB,
author = "Moreno Ambrosin and Paolo Braca and Mauro Conti and
Riccardo Lazzeretti",
title = "{ODIN}: Obfuscation-Based Privacy-Preserving Consensus
Algorithm for Decentralized Information Fusion in Smart
Device Networks",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "6:1--6:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3137573",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The large spread of sensors and smart devices in urban
infrastructures are motivating research in the area of
the Internet of Things (IoT) to develop new services
and improve citizens' quality of life. Sensors and
smart devices generate large amounts of measurement
data from sensing the environment, which is used to
enable services such as control of power consumption or
traffic density. To deal with such a large amount of
information and provide accurate measurements, service
providers can adopt information fusion, which given the
decentralized nature of urban deployments can be
performed by means of consensus algorithms. These
algorithms allow distributed agents to (iteratively)
compute linear functions on the exchanged data, and
take decisions based on the outcome, without the need
for the support of a central entity. However, the use
of consensus algorithms raises several security
concerns, especially when private or security critical
information is involved in the computation. In this
article we propose ODIN, a novel algorithm allowing
information fusion over encrypted data. ODIN is a
privacy-preserving extension of the popular consensus
gossip algorithm, which prevents distributed agents
from having direct access to the data while they
iteratively reach consensus; agents cannot access even
the final consensus value but can only retrieve partial
information (e.g., a binary decision). ODIN uses
efficient additive obfuscation and proxy re-encryption
during the update steps and garbled circuits to make
final decisions on the obfuscated consensus. We discuss
the security of our proposal and show its
practicability and efficiency on real-world
resource-constrained devices, developing a prototype
implementation for Raspberry Pi devices.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bellini:2017:QRE,
author = "Emanuele Bellini and Paolo Ceravolo and Paolo Nesi",
title = "Quantify Resilience Enhancement of {UTS} through
Exploiting Connected Community and {Internet} of
Everything Emerging Technologies",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "7:1--7:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3137572",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This work aims at investigating and quantifying the
Urban Transport System (UTS) resilience enhancement
enabled by the adoption of emerging technology such as
Internet of Everything (IoE) and the new trend of the
Connected Community (CC). A conceptual extension of
Functional Resonance Analysis Method (FRAM) and its
formalization have been proposed and used to model UTS
complexity. The scope is to identify the system
functions and their interdependencies with a particular
focus on those that have a relation and impact on
people and communities. Network analysis techniques
have been applied to the FRAM model to identify and
estimate the most critical community-related functions.
The notion of Variability Rate (VR) has been defined as
the amount of output variability generated by an
upstream function that can be tolerated/absorbed by a
downstream function, without significantly increasing
of its subsequent output variability. A fuzzy-based
quantification of the VR based on expert judgment has
been developed when quantitative data are not
available. Our approach has been applied to a critical
scenario as flash flooding considering two cases: when
UTS has CC and IoE implemented or not. However, the
method can be applied in different scenarios and
critical infrastructures. The results show a remarkable
VR enhancement if CC and IoE are deployed.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Rathore:2017:HBI,
author = "M. Mazhar Rathore and Anand Paul and Awais Ahmad and
Marco Anisetti and Gwanggil Jeon",
title = "{Hadoop-Based Intelligent Care System (HICS)}:
Analytical Approach for Big Data in {IoT}",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "8:1--8:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3108936",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Internet of Things (IoT) is increasingly becoming
a worldwide network of interconnected things that are
uniquely addressable, via standard communication
protocols. The use of IoT for continuous monitoring of
public health is being rapidly adopted by various
countries while generating a massive volume of
heterogeneous, multisource, dynamic, and sparse
high-velocity data. Handling such an enormous amount of
high-speed medical data while integrating, collecting,
processing, analyzing, and extracting knowledge
constitutes a challenging task. On the other hand, most
of the existing IoT devices do not cooperate with one
another by using the same medium of communication. For
this reason, it is a challenging task to develop
healthcare applications for IoT that fulfill all user
needs through real-time monitoring of health
parameters. Therefore, to address such issues, this
article proposed a Hadoop-based intelligent care system
(HICS) that demonstrates IoT-based collaborative
contextual Big Data sharing among all of the devices in
a healthcare system. In particular, the proposed system
involves a network architecture with enhanced
processing features for data collection generated by
millions of connected devices. In the proposed system,
various sensors, such as wearable devices, are attached
to the human body and measure health parameters and
transmit them to a primary mobile device (PMD). The
collected data are then forwarded to intelligent
building (IB) using the Internet where the data are
thoroughly analyzed to identify abnormal and serious
health conditions. Intelligent building consists of (1)
a Big Data collection unit (used for data collection,
filtration, and load balancing); (2) a Hadoop
processing unit (HPU) (composed of Hadoop distributed
file system (HDFS) and MapReduce); and (3) an analysis
and decision unit. The HPU, analysis, and decision unit
are equipped with a medical expert system, which reads
the sensor data and performs actions in the case of an
emergency situation. To demonstrate the feasibility and
efficiency of the proposed system, we use publicly
available medical sensory datasets and real-time sensor
traffic while identifying the serious health conditions
of patients by using thresholds, statistical methods,
and machine-learning techniques. The results show that
the proposed system is very efficient and able to
process high-speed WBAN sensory data in real time.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Wang:2017:RTT,
author = "Di Wang and Ahmad Al-Rubaie and Sandra Stinci{\'c}
Clarke and John Davies",
title = "Real-Time Traffic Event Detection From Social Media",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "9:1--9:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3122982",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Smart communities are composed of groups,
organizations, and individuals who share information
and make use of that shared information for better
decision making. Shared information can come from many
sources, particularly, but not exclusively, from
sensors and social media. Social media has become an
important source of near-instantaneous user-generated
information that can be shared and analyzed to support
better decision making. One domain where social media
data can add value is transportation and traffic
management. This article looks at the exploitation of
Twitter data in the traffic reporting domain. A key
challenge is how to identify relevant information from
a huge amount of user-generated data and then analyze
the relevant data for automatic geocoded incident
detection. The article proposes an instant traffic
alert and warning system based on a novel latent
Dirichlet allocation (LDA) approach (``tweet-LDA'').
The system is evaluated and shown to perform better
than related approaches.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Fujikawa:2017:SVN,
author = "Hiroshi Fujikawa and Hirofumi Yamaki and Setsuo
Tsuruta",
title = "Seamless Virtual Network for International Business
Continuity in Presence of Intentional Blocks",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "10:1--10:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3133325",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In developing countries, links are poor among domestic
communities or internet service providers. Besides,
international internet channels are suddenly blocked by
such as Golden Shield (GS) in China. Offshore business
communications are involved in these. To avoid such
involvement, a seamless virtual network is proposed as
an international business communication bridging
solution. This uses Round Trip Time (RTT) based
multiple thresholds for differential switch to Virtual
Private Network (VPN) bypass. The characteristics are
(1) using multiple threshold integrated differential
calculus of RTT increase, a sign of the block is
recognized as the steep staircase increase of RTT, (2)
followed by the immediate automatic switch to VPN
having RTT below 200ms. (3) Asymmetrically, only the
absolute threshold value and continuation time are used
to determine when to switch back. This method is
analytically and statistically evaluated as being
successful (below 3\% errors), using around 200 cases
of data on GS blocks. Furthermore, it has been
validated by the real seamless usage in more than 20
offshore companies for three years. Besides response
time in offshore applications, our method can also
alleviate problems such as voice echoes and video
jitters which irritate business users. These effects
were validated analytically and by questionnaires to
scores of business customers.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Lopez:2017:BMC,
author = "Claudia L{\'o}pez and Rosta Farzan and Yu-Ru Lin",
title = "Behind the Myths of Citizen Participation: Identifying
Sustainability Factors of Hyper-Local Information
Systems",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "11:1--11:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3093892",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Various information systems have emerged to facilitate
citizen participation in the life of their communities.
However, there is a lack of robust understanding of
what enables the sustainability of such systems. This
work introduces a framework to identify and analyze
various factors that influence the sustainability of
``hyper-local'' information systems. Using longitudinal
observations of participation from 35 online
neighborhood discussion forums over six years, we
analyze the relationship between sustainability and
online-offline community characteristics. Our results
not only show patterns consistent with previous
observations but reveal the dubious influences of
member heterogeneity and network structure. Design
insights are discussed.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Singh:2017:TR,
author = "Munindar P. Singh",
title = "{TOIT} Reviewers over 2015 and 2016",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "12:1--12:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3140541",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Kafali:2017:GEI,
author = "{\"O}zg{\"u}r Kafali and Natalia Criado and Martin
Rehak and Jose M. Such and Pinar Yolum",
title = "{Guest Editors}' Introduction",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "26:1--26:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3177884",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "26",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Saenko:2017:GAS,
author = "Igor Saenko and Igor Kotenko",
title = "Genetic Algorithms for Solving Problems of Access
Control Design and Reconfiguration in Computer
Networks",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "27:1--27:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3093898",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "To create solutions for providing the required access
control in computer networks it is not sufficient to
have only tools and protocols in the network that are
needed for it. It is necessary to create corresponding
configuration, or scheme, of such tools, which will
allow us to satisfy the existing security requirements.
At the same time, the problems of creating an access
control scheme, as a rule, are NP-complete and require
heuristic models for their solving. In this article, we
propose a unified approach to creation of control
access schemes, based on usage of genetic algorithms.
The approach is applied not only to original schemes
configuration but to reconfiguration as well.
Successful testing of the suggested approach on RBAC,
VLAN, and VPN schemes allows us to suppose that it may
be applied to other types of access control schemes as
well. Experimental testing of suggested genetic
algorithms, performed on a specially designed test bed,
showed their sufficiently high efficiency.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "27",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Stolba:2017:QPL,
author = "Michal Stolba and Jan Tozicka and Anton{\'\i}n
Komenda",
title = "Quantifying Privacy Leakage in Multi-Agent Planning",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "28:1--28:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3133326",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Multi-agent planning using MA-STRIPS-related models is
often motivated by the preservation of private
information. Such a motivation is not only natural for
multi-agent systems but also is one of the main reasons
multi-agent planning problems cannot be solved with a
centralized approach. Although the motivation is common
in the literature, the formal treatment of privacy is
often missing. In this article, we expand on a privacy
measure based on information leakage introduced in
previous work, where the leaked information is measured
in terms of transition systems represented by the
public part of the problem with regard to the
information obtained during the planning process.
Moreover, we present a general approach to computing
privacy leakage of search-based multi-agent planners by
utilizing search-tree reconstruction and classification
of leaked superfluous information about the
applicability of actions. Finally, we present an
analysis of the privacy leakage of two well-known
algorithms-multi-agent forward search (MAFS) and
Secure-MAFS-both in general and on a particular
example. The results of the analysis show that
Secure-MAFS leaks less information than MAFS.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "28",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Codetta-Raiteri:2017:DNS,
author = "Daniele Codetta-Raiteri and Luigi Portinale",
title = "Decision Networks for Security Risk Assessment of
Critical Infrastructures",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "29:1--29:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3137570",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We exploit Decision Networks (DN) for the analysis of
attack/defense scenarios in critical infrastructures.
DN extend Bayesian Networks (BN) with decision and
value nodes. DN inherit from BN the possibility to
naturally address uncertainty at every level, making
possible the modeling of situations that are not
limited to Boolean combinations of events. By means of
decision nodes, DN can include the interaction level of
attacks and countermeasures. Inference algorithms can
be directly exploited for implementing a probabilistic
analysis of both the risk and the importance of the
attacks. Thanks to value nodes, a sound decision
theoretic analysis has the goal of selecting the
optimal set of countermeasures to activate.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "29",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Jajodia:2017:SSH,
author = "Sushil Jajodia and Noseong Park and Edoardo Serra and
V. S. Subrahmanian",
title = "{SHARE}: a {Stackelberg} Honey-Based Adversarial
Reasoning Engine",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "30:1--30:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3137571",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "A ``noisy-rich'' (NR) cyber-attacker (Lippmann et al.
2012) is one who tries all available vulnerabilities
until he or she successfully compromises the targeted
network. We develop an adversarial foundation, based on
Stackelberg games, for how NR-attackers will explore an
enterprise network and how they will attack it, based
on the concept of a system vulnerability dependency
graph. We develop a mechanism by which the network can
be modified by the defender to induce deception by
placing honey nodes and apparent vulnerabilities into
the network to minimize the expected impact of the
NR-attacker's attacks (according to multiple measures
of impact). We also consider the case where the
adversary learns from blocked attacks using
reinforcement learning. We run detailed experiments
with real network data (but with simulated attack data)
and show that Stackelberg Honey-based Adversarial
Reasoning Engine performs very well, even when the
adversary deviates from the initial assumptions made
about his or her behavior. We also develop a method for
the attacker to use reinforcement learning when his or
her activities are stopped by the defender. We propose
two stopping policies for the defender: Stop Upon
Detection allows the attacker to learn about the
defender's strategy and (according to our experiments)
leads to significant damage in the long run, whereas
Stop After Delay allows the defender to introduce
greater uncertainty into the attacker, leading to
better defendability in the long run.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "30",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Padget:2017:FGA,
author = "Julian A. Padget and Wamberto W. Vasconcelos",
title = "Fine-Grained Access Control via Policy-Carrying Data",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "31:1--31:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3133324",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We address the problem of associating access policies
with datasets and how to monitor compliance via
policy-carrying data. Our contributions are a formal
model in first-order logic inspired by normative
multi-agent systems to regulate data access, and a
computational model for the validation of specific use
cases and the verification of policies against
criteria. Existing work on access policy identifies
roles as a key enabler, with which we concur, but much
of the rest focusses on authentication and
authorization technology. Our proposal aims to address
the normative principles put forward in Berners-Lee's
bill of rights for the internet, through human-readable
but machine-processable access control policies.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "31",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yao:2017:CLR,
author = "Lina Yao and Quan Z. Sheng and Xianzhi Wang and Wei
Emma Zhang and Yongrui Qin",
title = "Collaborative Location Recommendation by Integrating
Multi-dimensional Contextual Information",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "32:1--32:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3134438",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Point-of-Interest (POI) recommendation is a new type
of recommendation task that comes along with the
prevalence of location-based social networks and
services in recent years. Compared with traditional
recommendation tasks, POI recommendation focuses more
on making personalized and context-aware
recommendations to improve user experience.
Traditionally, the most commonly used contextual
information includes geographical and social context
information. However, the increasing availability of
check-in data makes it possible to design more
effective location recommendation applications by
modeling and integrating comprehensive types of
contextual information, especially the temporal
information. In this article, we propose a
collaborative filtering method based on Tensor
Factorization, a generalization of the Matrix
Factorization approach, to model the multi-dimensional
contextual information. Tensor Factorization naturally
extends Matrix Factorization by increasing the
dimensionality of concerns, within which the
three-dimensional model is the one most popularly used.
Our method exploits a high-order tensor to fuse
heterogeneous contextual information about users'
check-ins instead of the traditional two-dimensional
user-location matrix. The factorization of this tensor
leads to a more compact model of the data that is
naturally suitable for integrating contextual
information to make POI recommendations. Based on the
model, we further improve the recommendation accuracy
by utilizing the internal relations within users and
locations to regularize the latent factors.
Experimental results on a large real-world dataset
demonstrate the effectiveness of our approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "32",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Shen:2017:TES,
author = "Haiying Shen and Harrison Chandler and Haoyu Wang",
title = "Toward Efficient Short-Video Sharing in the {YouTube}
Social Network",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "33:1--33:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3137569",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The past few years have seen an explosion in the
popularity of online short-video sharing in YouTube. As
the number of users continue to grow, the bandwidth
required to maintain acceptable quality of service
(QoS) has greatly increased. Peer-to-peer (P2P)
architectures have shown promise in reducing the
bandwidth costs; however, the previous works build one
P2P overlay for each video, which provides limited
availability of video providers and produces high
overlay maintenance overhead. To handle these problems,
in this work, we novelly leverage the existing social
network in YouTube, where a user subscribes to another
user's channel to track all his/her uploaded videos.
The subscribers of a channel tend to watch the
channel's videos and common-interest nodes tend to
watch the same videos. Also, the popularity of videos
in one channel varies greatly. We study real trace data
to confirm these properties. Based on these properties,
we propose SocialTube, which builds the subscribers of
one channel into a P2P overlay and also clusters
common-interest nodes in a higher level. It also
incorporates a prefetching algorithm that prefetches
higher-popularity videos. To enhance the system
performance, we further propose the demand/supply-based
cache management scheme and reputation-based neighbor
management scheme. Extensive trace-driven simulation
results and PlanetLab real-world experimental results
verify the effectiveness of SocialTube at reducing
server load and overlay maintenance overhead and at
improving QoS for users.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "33",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Xu:2017:CBD,
author = "Zhen Xu and James Miller",
title = "Cross-Browser Differences Detection Based on an
Empirical Metric for {Web} Page Visual Similarity",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "34:1--34:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3140544",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This article aims to develop a method to detect visual
differences introduced into web pages when they are
rendered in different browsers. To achieve this goal,
we propose an empirical visual similarity metric by
mimicking human mechanisms of perception. The Gestalt
laws of grouping are translated into a computer
compatible rule set. A block tree is then parsed by the
rules for similarity calculation. During the
translation of the Gestalt laws, experiments are
performed to obtain metrics for proximity, color
similarity, and image similarity. After a validation
experiment, the empirical metric is employed to detect
cross-browser differences. Experiments and case studies
on the world's most popular web pages provide positive
results for this methodology.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "34",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhang:2017:LBF,
author = "Wei Emma Zhang and Quan Z. Sheng and Lina Yao and
Kerry Taylor and Ali Shemshadi and Yongrui Qin",
title = "A Learning-Based Framework for Improving Querying on
{Web} Interfaces of Curated Knowledge Bases",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "35:1--35:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3155806",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Knowledge Bases (KBs) are widely used as one of the
fundamental components in Semantic Web applications as
they provide facts and relationships that can be
automatically understood by machines. Curated knowledge
bases usually use Resource Description Framework (RDF)
as the data representation model. To query the
RDF-presented knowledge in curated KBs, Web interfaces
are built via SPARQL Endpoints. Currently, querying
SPARQL Endpoints has problems like network instability
and latency, which affect the query efficiency. To
address these issues, we propose a client-side caching
framework, SPARQL Endpoint Caching Framework (SECF),
aiming at accelerating the overall querying speed over
SPARQL Endpoints. SECF identifies the potential issued
queries by leveraging the querying patterns learned
from clients' historical queries and prefecthes/caches
these queries. In particular, we develop a distance
function based on graph edit distance to measure the
similarity of SPARQL queries. We propose a feature
modelling method to transform SPARQL queries to vector
representation that are fed into machine-learning
algorithms. A time-aware smoothing-based method,
Modified Simple Exponential Smoothing (MSES), is
developed for cache replacement. Extensive experiments
performed on real-world queries showcase the
effectiveness of our approach, which outperforms the
state-of-the-art work in terms of the overall querying
speed.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "35",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zander:2017:WTY,
author = "Sebastian Zander and Xuequn Wang",
title = "Are We There Yet? {IPv6} in {Australia} and {China}",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "36:1--36:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3158374",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "IP (Internet Protocol) version 6 (IPv6) was
standardised in 1998 to address the expected runout of
IP version 4 (IPv4) addresses. However, the transition
from IPv4 to IPv6 has been very slow in many countries.
We investigate the state of IPv6 deployment in
Australian and Chinese organisations based on a survey
of organisations' IT staff. Compared to earlier
studies, IPv6 deployment has advanced markedly, but it
is still years away for a significant portion of
organisations. We provide insights into the deployment
problems, arguments for deploying IPv6, and how to
speed up the transition, which are relevant for many
countries.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "36",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhang:2017:DDP,
author = "Wei Emma Zhang and Quan Z. Sheng and Jey Han Lau and
Ermyas Abebe and Wenjie Ruan",
title = "Duplicate Detection in Programming Question Answering
Communities",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "37:1--37:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3169795",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Community-based Question Answering (CQA) websites are
attracting increasing numbers of users and contributors
in recent years. However, duplicate questions
frequently occur in CQA websites and are currently
manually identified by the moderators. Automatic
duplicate detection, on one hand, alleviates this
laborious effort for moderators before taking close
actions, and, on the other hand, helps question issuers
quickly find answers. A number of studies have looked
into related problems, but very limited works target
Duplicate Detection in Programming CQA (PCQA), a branch
of CQA that is dedicated to programmers. Existing works
framed the task as a supervised learning problem on the
question pairs and relied on only textual features.
Moreover, the issue of selecting candidate duplicates
from large volumes of historical questions is often
un-addressed. To tackle these issues, we model
duplicate detection as a two-stage
``ranking-classification'' problem over question pairs.
In the first stage, we rank the historical questions
according to their similarities to the newly issued
question and select the top ranked ones as candidates
to reduce the search space. In the second stage, we
develop novel features that capture both textual
similarity and latent semantics on question pairs,
leveraging techniques in deep learning and information
retrieval literature. Experiments on real-world
questions about multiple programming languages
demonstrate that our method works very well; in some
cases, up to 25\% improvement compared to the
state-of-the-art benchmarks.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "37",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Guo:2017:PGE,
author = "Tian Guo and Prashant Shenoy",
title = "Providing Geo-Elasticity in Geographically Distributed
Clouds",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "38:1--38:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3169794",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Geographically distributed cloud platforms are well
suited for serving a geographically diverse user base.
However, traditional cloud provisioning mechanisms that
make local scaling decisions are not adequate for
delivering the best possible performance for modern web
applications that observe both temporal and spatial
workload fluctuations. We propose GeoScale, a system
that provides geo-elasticity by combining model-driven
proactive and agile reactive provisioning approaches.
GeoScale can dynamically provision server capacity at
any location based on workload dynamics. We conduct a
detailed evaluation of GeoScale on Amazon's
geo-distributed cloud and show up to 40\% improvement
in the 95th percentile response time when compared to
traditional elasticity techniques.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "38",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Guo:2017:IAC,
author = "Yonghong Guo and Lu Liu and Yan Wu and James Hardy",
title = "Interest-Aware Content Discovery in Peer-to-Peer
Social Networks",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "39:1--39:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3176247",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "With the increasing popularity and rapid development
of Online Social Networks (OSNs), OSNs not only bring
fundamental changes to information and communication
technologies, but also make an extensive and profound
impact on all aspects of our social life. Efficient
content discovery is a fundamental challenge for
large-scale distributed OSNs. However, the similarity
between social networks and online social networks
leads us to believe that the existing social theories
are useful for improving the performance of social
content discovery in online social networks. In this
article, we propose an interest-aware social-like
peer-to-peer (IASLP) model for social content discovery
in OSNs by mimicking ten different social theories and
strategies. In the IASLP network, network nodes with
similar interests can meet, help each other, and
co-operate autonomously to identify useful contents.
The presented model has been evaluated and simulated in
a dynamic environment with an evolving network. The
experimental results show that the recall of IASLP is
20\% higher than the existing method SESD while the
overhead is 10\% lower. The IASLP can generate higher
flexibility and adaptability and achieve better
performance than the existing methods.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "39",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Xie:2018:ISI,
author = "Tao Xie and Andre van Hoorn and Huaimin Wang and Ingo
Weber",
title = "Introduction to the Special Issue on Emerging Software
Technologies for {Internet}-Based Systems: Internetware
and {DevOps}",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "13:1--13:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3173572",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Liu:2018:JIO,
author = "Xuanzhe Liu and Meihua Yu and Yun Ma and Gang Huang
and Hong Mei and Yunxin Liu",
title = "{i-Jacob}: an Internetware-Oriented Approach to
Optimizing Computation-Intensive Mobile {Web}
Browsing",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "14:1--14:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3093899",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/java2010.bib;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Web browsing is always a key requirement of Internet
users. Current mobile Web apps can contain
computation-intensive JavaScript logics and thus affect
browsing performance. Learning from our over-decade
research and development experiences of the
Internetware paradigm, we present the novel and generic
i-Jacob approach to improving the performance of mobile
Web browsing with effective JavaScript-code offloading.
Our approach proposes a programming abstraction to make
mobile Web situational and adaptive to contexts, by
specifying the computation-intensive and `` offloadable
'' code, and develops a platform-independent
lightweight runtime spanning the mobile devices and the
cloud. We demonstrate the efficiency of i-Jacob with
some typical computation-intensive tasks over various
combinations of hardware, operating systems, browsers,
and network connections. The improvements can reach up
to 49$ \times $ speed-up in response time and 90\%
saving in energy.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ouyang:2018:ASE,
author = "Xue Ouyang and Peter Garraghan and Bernhard Primas and
David Mckee and Paul Townend and Jie Xu",
title = "Adaptive Speculation for Efficient {Internetware}
Application Execution in Clouds",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "15:1--15:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3093896",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Modern Cloud computing systems are massive in scale,
featuring environments that can execute highly dynamic
Internetware applications with huge numbers of
interacting tasks. This has led to a substantial
challenge-the straggler problem, whereby a small subset
of slow tasks significantly impede parallel job
completion. This problem results in longer service
responses, degraded system performance, and late timing
failures that can easily threaten Quality of Service
(QoS) compliance. Speculative execution (or
speculation) is the prominent method deployed in Clouds
to tolerate stragglers by creating task replicas at
runtime. The method detects stragglers by specifying a
predefined threshold to calculate the difference
between individual tasks and the average task
progression within a job. However, such a static
threshold debilitates speculation effectiveness as it
fails to capture the intrinsic diversity of timing
constraints in Internetware applications, as well as
dynamic environmental factors, such as resource
utilization. By considering such characteristics,
different levels of strictness for replica creation can
be imposed to adaptively achieve specified levels of
QoS for different applications. In this article, we
present an algorithm to improve the execution
efficiency of Internetware applications by dynamically
calculating the straggler threshold, considering key
parameters including job QoS timing constraints, task
execution progress, and optimal system resource
utilization. We implement this dynamic straggler
threshold into the YARN architecture to evaluate it's
effectiveness against existing state-of-the-art
solutions. Results demonstrate that the proposed
approach is capable of reducing parallel job response
time by up to 20\% compared to the static threshold, as
well as a higher speculation success rate, achieving up
to 66.67\% against 16.67\% in comparison to the static
method.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "15",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ferry:2018:CMD,
author = "Nicolas Ferry and Franck Chauvel and Hui Song and
Alessandro Rossini and Maksym Lushpenko and Arnor
Solberg",
title = "{CloudMF}: Model-Driven Management of Multi-Cloud
Applications",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "16:1--16:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3125621",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "While the number of cloud solutions is continuously
increasing, the development and operation of
large-scale and distributed cloud applications are
still challenging. A major challenge is the lack of
interoperability between the existing cloud solutions,
which increases the complexity of maintaining and
evolving complex applications potentially deployed
across multiple cloud infrastructures and platforms. In
this article, we show how the Cloud Modelling Framework
leverages model-driven engineering and supports the
DevOps ideas to tame this complexity by providing: (i)
a domain-specific language for specifying the
provisioning and deployment of multi-cloud
applications, and (ii) a models@run-time environment
for their continuous provisioning, deployment, and
adaptation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "16",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Pahl:2018:APC,
author = "Claus Pahl and Pooyan Jamshidi and Olaf Zimmermann",
title = "Architectural Principles for Cloud Software",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "17:1--17:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3104028",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib;
http://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "A cloud is a distributed Internet-based software
system providing resources as tiered services. Through
service-orientation and virtualization for resource
provisioning, cloud applications can be deployed and
managed dynamically. We discuss the building blocks of
an architectural style for cloud-based software
systems. We capture style-defining architectural
principles and patterns for control-theoretic,
model-based architectures for cloud software. While
service orientation is agreed on in the form of
service-oriented architecture and microservices,
challenges resulting from multi-tiered, distributed and
heterogeneous cloud architectures cause uncertainty
that has not been sufficiently addressed. We define
principles and patterns needed for effective
development and operation of adaptive cloud-native
systems.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "17",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Jiang:2018:FCC,
author = "He Jiang and Xin Chen and Tieke He and Zhenyu Chen and
Xiaochen Li",
title = "Fuzzy Clustering of Crowdsourced Test Reports for
Apps",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "18:1--18:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3106164",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "DevOps is a new approach to drive a seamless
Application (App) cycle from development to delivery.
As a critical part to promote the successful
implementation of DevOps, testing can significantly
improve team productivity and reliably deliver user
experience. However, it is difficult to use traditional
testing to cover diverse mobile phones, network
environments, operating systems, and so on. Hence, many
large companies crowdsource their App testing tasks to
workers from open platforms. In crowdsourced testing,
test reports submitted by workers may be highly
redundant, and their quality may vary sharply.
Meanwhile, multi-bug test reports may be submitted, and
their root causes are hard to diagnose. Hence, it is a
time-consuming and tedious task for developers to
manually inspect these test reports. To help developers
address the above challenges, we issue the new problem
of Fuzzy Clustering Test Reports (FULTER). Aiming to
resolve FULTER, a series of barriers need to be
overcome. In this study, we propose a new framework
named Test Report Fuzzy Clustering Framework (TERFUR)
by aggregating redundant and multi-bug test reports
into clusters to reduce the number of inspected test
reports. First, we construct a filter to remove invalid
test reports to break through the invalid barrier.
Then, a preprocessor is built to enhance the
descriptions of short test reports to break through the
uneven barrier. Last, a two-phase merging algorithm is
proposed to partition redundant and multi-bug test
reports into clusters that can break through the
multi-bug barrier. Experimental results over 1,728 test
reports from five industrial Apps show that TERFUR can
cluster test reports by up to 78.15\% in terms of
AverageP, 78.41\% in terms of AverageR, and 75.82\% in
terms of AverageF1 and outperform comparative methods
by up to 31.69\%, 33.06\%, and 24.55\%, respectively.
In addition, the effectiveness of TERFUR is validated
in prioritizing test reports for manual inspection.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "18",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Peng:2018:COM,
author = "Xin Peng and Jingxiao Gu and Tian Huat Tan and Jun Sun
and Yijun Yu and Bashar Nuseibeh and Wenyun Zhao",
title = "{CrowdService}: Optimizing Mobile Crowdsourcing and
Service Composition",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "19:1--19:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3108935",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Some user needs can only be met by leveraging the
capabilities of others to undertake particular tasks
that require intelligence and labor. Crowdsourcing such
capabilities is one way to achieve this. But providing
a service that leverages crowd intelligence and labor
is a challenge, since various factors need to be
considered to enable reliable service provisioning. For
example, the selection of an optimal set of workers
from those who bid to perform a task needs to be made
based on their reliability, expected reward, and
distance to the target locations. Moreover, for an
application involving multiple services, the overall
cost and time constraints must be optimally allocated
to each involved service. In this article, we develop a
framework, named CrowdService, that supplies crowd
intelligence and labor as publicly accessible crowd
services via mobile crowdsourcing. The article extends
our earlier work by providing an approach for
constraints synthesis and worker selection. It employs
a genetic algorithm to dynamically synthesize and
update near-optimal cost and time constraints for each
crowd service involved in a composite service and
selects a near-optimal set of workers for each crowd
service to be executed. We implement the proposed
framework on Android platforms and evaluate its
effectiveness, scalability, and usability in both
experimental and user studies.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "19",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yang:2018:IVA,
author = "Wenhua Yang and Chang Xu and Minxue Pan and Xiaoxing
Ma and Jian Lu",
title = "Improving Verification Accuracy of {CPS} by Modeling
and Calibrating Interaction Uncertainty",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "20:1--20:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3093894",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Cyber-Physical Systems (CPS) intrinsically combine
hardware and physical systems with software and
network, which are together creating complex and
correlated interactions. CPS applications often
experience uncertainty in interacting with environment
through unreliable sensors. They can be faulty and
exhibit runtime errors if developers have not
considered environmental interaction uncertainty
adequately. Existing work in verifying CPS applications
ignores interaction uncertainty and thus may overlook
uncertainty-related faults. To improve verification
accuracy, in this article we propose a novel approach
to verifying CPS applications with explicit modeling of
uncertainty arisen in the interaction between them and
the environment. Our approach builds an Interactive
State Machine network for a CPS application and models
interaction uncertainty by error ranges and
distributions. Then it encodes both the application and
uncertainty models to Satisfiability Modulo Theories
(SMT) formula to leverage SMT solvers searching for
counterexamples that represent application failures.
The precision of uncertainty model can affect the
verification results. However, it may be difficult to
model interaction uncertainty precisely enough at the
beginning, because of the uncontrollable noise of
sensors and insufficient data sample size. To further
improve the accuracy of the verification results, we
propose an approach to identifying and calibrating
imprecise uncertainty models. We exploit the
inconsistency between the counterexamples' estimate and
actual occurrence probabilities to identify possible
imprecision in uncertainty models, and the calibration
of imprecise models is to minimize the inconsistency,
which is reduced to a Search-Based Software Engineering
problem. We experimentally evaluated our verification
and calibration approaches with real-world CPS
applications, and the experimental results confirmed
their effectiveness and efficiency.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "20",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Willnecker:2018:MOO,
author = "Felix Willnecker and Helmut Krcmar",
title = "Multi-Objective Optimization of Deployment Topologies
for Distributed Applications",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "21:1--21:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3106158",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Modern applications are typically implemented as
distributed systems comprising several components.
Deciding where to deploy which component is a difficult
task that today is usually assisted by logical topology
recommendations. Choosing inefficient topologies
allocates the wrong amount of resources, leads to
unnecessary operation costs, or results in poor
performance. Testing different topologies to find good
solutions takes a lot of time and might delay
productive operations. Therefore, this work introduces
a software-based deployment topology optimization
approach for distributed applications. We use an
enhanced performance model generator that extracts
models from operational monitoring data of running
applications. The extracted model is used to simulate
performance metrics (e.g., resource utilization,
response times, throughput) and runtime costs of
distributed applications. Subsequently, we introduce a
deployment topology optimizer, which selects an
optimized topology for a specified workload and
considers on-premise, cloud, and hybrid topologies. The
following three optimization goals are presented in
this work: (i) minimum response time for an optimized
user experience, (ii) approximate resource utilization
around certain peaks, and (iii) minimum cost for
running the application. To evaluate the approach, we
use the SPECjEnterpriseNEXT industry benchmark as
distributed application in an on-premise and in a
cloud/on-premise hybrid environment. The evaluation
demonstrates the accuracy of the simulation compared to
the actual deployment by deploying an optimized
topology and comparing measurements with simulation
results.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "21",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Saez:2018:UBD,
author = "Santiago G{\'o}mez S{\'a}ez and Vasilios Andrikopoulos
and Marina Bitsaki and Frank Leymann and Andr{\'e} van
Hoorn",
title = "Utility-Based Decision Making for Migrating
Cloud-Based Applications",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "22:1--22:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3140545",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Nowadays, cloud providers offer a broad catalog of
services for migrating and distributing applications in
the cloud. However, the existence of a wide spectrum of
cloud services has become a challenge for deciding
where to host applications, as these vary in
performance and cost. This work addresses such a
challenge, and provides a utility-based decision
support model and method that evaluates and ranks
during design time potential application distributions
spanned among heterogeneous cloud services. The utility
model is evaluated using the MediaWiki (Wikipedia)
application, and shows an improved efficiency for
selecting cloud services in comparison to other
decision making approaches.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "22",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhou:2018:OAT,
author = "Bowen Zhou and Amir Vahid Dastjerdi and Rodrigo N.
Calheiros and Rajkumar Buyya",
title = "An Online Algorithm for Task Offloading in
Heterogeneous Mobile Clouds",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "23:1--23:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3122981",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Mobile cloud computing is emerging as a promising
approach to enrich user experiences at the mobile
device end. Computation offloading in a heterogeneous
mobile cloud environment has recently drawn increasing
attention in research. The computation offloading
decision making and tasks scheduling among
heterogeneous shared resources in mobile clouds are
becoming challenging problems in terms of providing
global optimal task response time and energy
efficiency. In this article, we address these two
problems together in a heterogeneous mobile cloud
environment as an optimization problem. Different from
conventional distributed computing system scheduling
problems, our joint offloading and scheduling
optimization problem considers unique contexts of
mobile clouds such as wireless network connections and
mobile device mobility, which makes the problem more
complex. We propose a context-aware mixed integer
programming model to provide off-line optimal solutions
for making the offloading decisions and scheduling the
offloaded tasks among the shared computing resources in
heterogeneous mobile clouds. The objective is to
minimize the global task completion time (i.e.,
makespan). To solve the problem in real time, we
further propose a deterministic online algorithm-the
Online Code Offloading and Scheduling (OCOS)
algorithm-based on the rent/buy problem and prove the
algorithm is 2-competitive. Performance evaluation
results show that the OCOS algorithm can generate
schedules that have around two times shorter makespan
than conventional independent task scheduling
algorithms. Also, it can save around 30\% more on
makespan of task execution schedules than conventional
offloading strategies, and scales well as the number of
users grows.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "23",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Palanisamy:2018:PPP,
author = "Balaji Palanisamy and Ling Liu and Yang Zhou and
Qingyang Wang",
title = "Privacy-Preserving Publishing of Multilevel
Utility-Controlled Graph Datasets",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "24:1--24:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3125622",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Conventional private data publication schemes are
targeted at publication of sensitive datasets either
after the k -anonymization process or through
differential privacy constraints. Typically these
schemes are designed with the objective of retaining as
much utility as possible for the aggregate queries
while ensuring the privacy of the individual records.
Such an approach, though suitable for publishing
aggregate information as public datasets, is
inapplicable when users have different levels of access
to the same data. We argue that existing schemes either
result in increased disclosure of private information
or lead to reduced utility when some users have more
access privileges than the others. In this article, we
present an anonymization framework for publishing large
datasets with the goals of providing different levels
of utility to the users based on their access privilege
levels. We design and implement our proposed multilevel
utility-controlled anonymization schemes in the context
of large association graphs considering three levels of
user utility, namely, (1) users having access to only
the graph structure, (2) users having access to the
graph structure and aggregate query results, and (3)
users having access to the graph structure, aggregate
query results, and individual associations. Our
experiments on real large association graphs show that
the proposed techniques are effective and scalable and
yield the required level of privacy and utility for
each user privacy and access privilege level.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "24",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Angiulli:2018:ECS,
author = "Fabrizio Angiulli and Luciano Argento and Angelo
Furfaro",
title = "Exploiting Content Spatial Distribution to Improve
Detection of Intrusions",
journal = j-TOIT,
volume = "18",
number = "2",
pages = "25:1--25:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3143422",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:08 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We present PCkAD, a novel semisupervised anomaly-based
IDS (Intrusion Detection System) technique, detecting
application-level content-based attacks. Its
peculiarity is to learn legitimate payloads by
splitting packets into chunks and determining the
within-packet distribution of n-grams. This strategy is
resistant to evasion techniques as blending. We prove
that finding the right legitimate content is NP-hard in
the presence of chunks. Moreover, it improves the
false-positive rate for a given detection rate with
respect to the case where the spatial information is
not considered. Comparison with well-known IDSs using
n-grams highlights that PCkAD achieves state-of-the-art
performances.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "25",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Baroglio:2018:SIC,
author = "Cristina Baroglio and Olivier Boissier and Axel
Polleres",
title = "Special Issue: Computational Ethics and
Accountability",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "40:1--40:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3195835",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "40",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Kayal:2018:ARN,
author = "Alex Kayal and Willem-Paul Brinkman and Mark A.
Neerincx and M. Birna {Van Riemsdijk}",
title = "Automatic Resolution of Normative Conflicts in
Supportive Technology Based on User Values",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "41:1--41:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3158371",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Social commitments (SCs) provide a flexible,
norm-based, governance structure for sharing and
receiving data. However, users of data sharing
applications can subscribe to multiple SCs, possibly
producing opposing sharing and receiving requirements.
We propose resolving such conflicts automatically
through a conflict resolution model based on relevant
user values such as privacy and safety. The model
predicts a user's preferred resolution by choosing the
commitment that best supports the user's values. We
show through an empirical user study ( n = 396) that
values, as well as recency and norm type, significantly
improve a system's ability to predict user preference
in location sharing conflicts.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "41",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Kekulluoglu:2018:PPS,
author = "Dilara Kekulluoglu and Nadin Kokciyan and Pinar
Yolum",
title = "Preserving Privacy as Social Responsibility in Online
Social Networks",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "42:1--42:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3158373",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Online social networks provide an environment for
their users to share content with others, where the
user who shares a content item is put in charge,
generally ignoring others that might be affected by it.
However, a content that is shared by one user can very
well violate the privacy of other users. To remedy
this, ideally, all users who are related to a content
should get a say in how the content should be shared.
Recent approaches advocate the use of agreement
technologies to enable stakeholders of a post to
discuss the privacy configurations of a post. This
allows related individuals to express concerns so that
various privacy violations are avoided up front.
Existing techniques try to establish an agreement on a
single post. However, most of the time, agreement
should be established over multiple posts such that the
user can tolerate slight breaches of privacy in return
of a right to share posts themselves in future
interactions. As a result, users can help each other
preserve their privacy, viewing this as their social
responsibility. This article develops a
reciprocity-based negotiation for reaching privacy
agreements among users and introduces a negotiation
architecture that combines semantic privacy rules with
utility functions. We evaluate our approach over
multiagent simulations with software agents that mimic
users based on a user study.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "42",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Verdiesen:2018:MMA,
author = "Ilse Verdiesen and Virginia Dignum and Jeroen {Van Den
Hoven}",
title = "Measuring Moral Acceptability in E-deliberation: a
Practical Application of Ethics by Participation",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "43:1--43:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3183324",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Current developments in governance and policy setting
are challenging traditional top-down models of
decision-making. Whereas, on the one hand, citizens are
increasingly demanding and expected to participate
directly on governance questions, social networking
platforms are, on the other hand, increasingly
providing podia for the spread of unfounded, extremist
and/or harmful ideas. Participatory deliberation is a
form of democratic policy making in which deliberation
is central to decision-making using both consensus
decision-making and majority rule. However, by
definition, it will lead to socially accepted results
rather than ensuring the moral acceptability of the
result. In fact, participation per se offers no
guidance regarding the ethics of the decisions taken,
nor does it provide means to evaluate alternatives in
terms of their moral ``quality.'' This article proposes
an open participatory model, Massive Open Online
Deliberation (MOOD), that can be used to solve some of
the current policy authority deficits. MOOD taps on
individual understanding and opinions by harnessing
open, participatory, crowd-sourced, and wiki-like
methodologies, effectively producing collective
judgements regarding complex political and social
issues in real time. MOOD offers the opportunity for
people to develop and draft collective judgements on
complex issues and crises in real time. MOOD is based
on the concept of Ethics by Participation, a formalized
and guided process of moral deliberation that extends
deliberative democracy platforms to identify morally
acceptable outcomes and enhance critical thinking and
reflection among participants.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "43",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bahri:2018:EAS,
author = "Leila Bahri and Barbara Carminati and Elena Ferrari
and Andrea Bianco",
title = "Enhanced Audit Strategies for Collaborative and
Accountable Data Sharing in Social Networks",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "44:1--44:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3134439",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Data sharing and access control management is one of
the issues still hindering the development of
decentralized online social networks (DOSNs), which are
now gaining more research attention with the recent
developments in P2P computing, such as the secure
public ledger-based protocols (Blockchains) for
monetary systems. In a previous work, we proposed an
initial audit-based model for access control in DOSNs.
In this article, we focus on enhancing the audit
strategies and the privacy issues emerging from records
kept for audit purposes. We propose enhanced audit and
collaboration strategies, for which experimental
results, on a real online social network graph with
simulated sharing behavior, show an improvement in the
detection rate of bad behavior of more than 50\%
compared to the basic model. We also provide an
analysis of the related privacy issues and discuss
possible privacy-preserving alternatives.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "44",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Gkatziaki:2018:EEU,
author = "Vasiliki Gkatziaki and Symeon Papadopoulos and Richard
Mills and Sotiris Diplaris and Ioannis Tsampoulatidis
and Ioannis Kompatsiaris",
title = "{easIE}: Easy-to-Use Information Extraction for
Constructing {CSR} Databases From the {Web}",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "45:1--45:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3155807",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Public awareness of and concerns about companies'
social and environmental impacts have seen a marked
increase over recent decades. In parallel, the quantity
of relevant information has increased, as states pass
laws requiring certain forms of reporting, researchers
investigate companies' performance, and companies
themselves seek to gain a competitive advantage by
being seen to operate fairly and transparently.
However, this information is typically dispersed and
non-standardized, making it complicated to collect and
analyze. To address this challenge, the WikiRate
platform aims to collect this information and store it
in a standardized format within a centralized public
repository, making it much more amenable to analysis.
In the context of WikiRate, this article introduces
easIE, an easy-to-use information extraction (IE)
framework that leverages general Web IE principles for
building datasets with environmental, social, and
governance information from the Web. To demonstrate the
flexibility and value of easIE, we built a large-scale
corporate social responsibility database comprising
654,491 metrics related to 49,009 companies spending
less than 16 hours for data engineering, collection,
and indexing. Finally, a data collection exercise
involving 12 subjects was performed to showcase the
ease of use of the developed framework.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "45",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Gavanelli:2018:APA,
author = "Marco Gavanelli and Marco Alberti and Evelina Lamma",
title = "Accountable Protocols in Abductive Logic Programming",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "46:1--46:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3107936",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Finding the entity responsible for an unpleasant
situation is often difficult, especially in artificial
agent societies. S CIFF is a formalization of agent
societies, including a language to describe rules and
protocols, and an abductive proof procedure for
compliance checking. However, how to identify the
entity responsible for a violation is not always clear.
In this work, a definition of accountability for
artificial societies is formalized in S CIFF. Two tools
are provided for the designer of interaction protocols:
a guideline, in terms of syntactic features that ensure
accountability of the protocol, and an algorithm
(implemented in a software tool) to investigate if, for
a given protocol, nonaccountability issues could
arise.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "46",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Bohme:2018:SIE,
author = "Rainer B{\"o}hme and Richard Clayton and Jens
Grossklags and Katrina Ligett and Patrick Loiseau and
Galina Schwartz",
title = "Special Issue on the Economics of Security and
Privacy: {Guest Editors}' Introduction",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "47:1--47:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3216902",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "This editorial introduces the special issue on the
economics of security and privacy.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "47",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Laszka:2018:ASR,
author = "Aron Laszka and Benjamin Johnson and Jens Grossklags",
title = "On the Assessment of Systematic Risk in Networked
Systems",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "48:1--48:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3166069",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "In a networked system, the risk of security
compromises depends not only on each node's security
but also on the topological structure formed by the
connected individuals, businesses, and computer
systems. Research in network security has been
exploring this phenomenon for a long time, with a
variety of modeling frameworks predicting how many
nodes we should expect to lose, on average, for a given
network topology, after certain types of incidents.
Meanwhile, the pricing of insurance contracts for risks
related to information technology (better known as
cyber-insurance) requires determining additional
information, for example, the maximum number of nodes
we should expect to lose within a 99.5\% confidence
interval. Previous modeling research in network
security has not addressed these types of questions,
while research on cyber-insurance pricing for networked
systems has not taken into account the network's
topology. Our goal is to bridge that gap, by providing
a mathematical basis for the assessment of systematic
risk in networked systems. We define a loss-number
distribution to be a probability distribution on the
total number of compromised nodes within a network
following the occurrence of a given incident, and we
provide a number of modeling results that aim to be
useful for cyber-insurers in this context. We prove
NP-hardness for the general case of computing the
loss-number distribution for an arbitrary network
topology but obtain simplified computable formulas for
the special cases of star topologies, ER-random
topologies, and uniform topologies. We also provide a
simulation algorithm that approximates the loss-number
distribution for an arbitrary network topology and that
appears to converge efficiently for many common classes
of topologies. Scale-free network topologies have a
degree distribution that follows a power law and are
commonly found in real-world networks. We provide an
example of a scale-free network in which a
cyber-insurance pricing mechanism that relies naively
on incidence reporting data will fail to accurately
predict the true risk level of the entire system. We
offer an alternative mechanism that yields an accurate
forecast by taking into account the network topology,
thus highlighting the lack/importance of topological
data in security incident reporting. Our results
constitute important steps toward the understanding of
systematic risk and help to contribute to the emergence
of a viable cyber-insurance market.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "48",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Tajalizadehkhoob:2018:RAB,
author = "Samaneh Tajalizadehkhoob and Rainer B{\"o}hme and
Carlos Ga{\~n}{\'a}n and Maciej Korczy{\'n}ski and
Michel {Van Eeten}",
title = "Rotten Apples or Bad Harvest? {What} We Are Measuring
When We Are Measuring Abuse",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "49:1--49:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3122985",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Internet security and technology policy research
regularly uses technical indicators of abuse to
identify culprits and to tailor mitigation strategies.
As a major obstacle, current inferences from abuse data
that aim to characterize providers with poor security
practices often use a naive normalization of abuse
(abuse counts divided by network size) and do not take
into account other inherent or structural properties of
providers. Even the size estimates are subject to
measurement errors relating to attribution,
aggregation, and various sources of heterogeneity. More
precise indicators are costly to measure at Internet
scale. We address these issues for the case of hosting
providers with a statistical model of the abuse data
generation process, using phishing sites in hosting
networks as a case study. We decompose error sources
and then estimate key parameters of the model,
controlling for heterogeneity in size and business
model. We find that 84\% of the variation in abuse
counts across 45,358 hosting providers can be explained
with structural factors alone. Informed by the fitted
model, we systematically select and enrich a subset of
105 homogeneous ``statistical twins'' with additional
explanatory variables, unreasonable to collect for all
hosting providers. We find that abuse is positively
associated with the popularity of websites hosted and
with the prevalence of popular content management
systems. Moreover, hosting providers who charge higher
prices (after controlling for level differences between
countries) witness less abuse. These structural factors
together explain a further 77\% of the remaining
variation. This calls into question premature
inferences from raw abuse indicators about the security
efforts of actors, and suggests the adoption of similar
analysis frameworks in all domains where network
measurement aims at informing technology policy.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "49",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Moore:2018:RRB,
author = "Tyler Moore and Nicolas Christin and Janos Szurdi",
title = "Revisiting the Risks of {Bitcoin} Currency Exchange
Closure",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "50:1--50:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3155808",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Bitcoin has enjoyed wider adoption than any previous
cryptocurrency; yet its success has also attracted the
attention of fraudsters who have taken advantage of
operational insecurity and transaction irreversibility.
We study the risk that investors face from the closure
of Bitcoin exchanges, which convert between Bitcoins
and hard currency. We examine the track record of 80
Bitcoin exchanges established between 2010 and 2015. We
find that nearly half (38) have since closed, with
customer account balances sometimes wiped out.
Fraudsters are sometimes to blame, but not always.
Twenty-five exchanges suffered security breaches, 15 of
which subsequently closed. We present logistic
regressions using longitudinal data on Bitcoin
exchanges aggregated quarterly. We find that
experiencing a breach is correlated with a 13 times
greater odds that an exchange will close in that same
quarter. We find that higher-volume exchanges are less
likely to close (each doubling in trade volume
corresponds to a 12\% decrease in the odds of closure).
We also find that exchanges that derive most of their
business from trading less popular (fiat) currencies,
which are offered by at most one competitor, are less
likely to close.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "50",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Achara:2018:FGC,
author = "Jagdish Prasad Achara and Javier Parra-Arnau and
Claude Castelluccia",
title = "Fine-Grained Control over Tracking to Support the
Ad-Based {Web} Economy",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "51:1--51:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3158372",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The intrusiveness of Web tracking and the increasing
invasiveness of digital advertising have raised serious
concerns regarding user privacy and Web usability,
leading a substantial chunk of the populace to adopt
ad-blocking technologies in recent years. The problem
with these technologies, however, is that they are
extremely limited and radical in their approach, and
they completely disregard the underlying economic model
of the Web, in which users get content free in return
for allowing advertisers to show them ads. Nowadays,
with around 200 million people regularly using such
tools, said economic model is in danger. In this
article, we investigate an Internet technology that
targets users who are not, in general, against
advertising, accept the trade-off that comes with the
``free'' content, but-for privacy concerns-they wish to
exert fine-grained control over tracking. Our working
assumption is that some categories of web pages (e.g.,
related to health or religion) are more
privacy-sensitive to users than others (e.g., about
education or science). Capitalizing on this, we propose
a technology that allows users to specify the
categories of web pages that are privacy-sensitive to
them and block the trackers present on such web pages
only. As tracking is prevented by blocking network
connections of third-party domains, we avoid not only
tracking but also third-party ads. Since users continue
receiving ads on those web pages that belong to
non-sensitive categories, our approach may provide a
better point of operation within the trade-off between
user privacy and the Web economy. To test the
appropriateness and feasibility of our solution, we
implemented it as a Web-browser plug-in, which is
currently available for Google Chrome and Mozilla
Firefox. Experimental results from the collected data
of 746 users during one year show that only 16.25\% of
ads are blocked by our tool, which seems to indicate
that the economic impact of the ad-blocking exerted by
privacy-sensitive users could be significantly
reduced.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "51",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Binns:2018:MTP,
author = "Reuben Binns and Jun Zhao and Max {Van Kleek} and
Nigel Shadbolt",
title = "Measuring Third-party Tracker Power across {Web} and
Mobile",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "52:1--52:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3176246",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Third-party networks collect vast amounts of data
about users via websites and mobile applications.
Consolidations among tracker companies can
significantly increase their individual tracking
capabilities, prompting scrutiny by competition
regulators. Traditional measures of market share, based
on revenue or sales, fail to represent the tracking
capability of a tracker, especially if it spans both
web and mobile. This article proposes a new approach to
measure the concentration of tracking capability, based
on the reach of a tracker on popular websites and apps.
Our results reveal that tracker prominence and
parent-subsidiary relationships have significant impact
on accurately measuring concentration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "52",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zaeem:2018:PAS,
author = "Razieh Nokhbeh Zaeem and Rachel L. German and K.
Suzanne Barber",
title = "{PrivacyCheck}: Automatic Summarization of Privacy
Policies Using Data Mining",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "53:1--53:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3127519",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Prior research shows that only a tiny percentage of
users actually read the online privacy policies they
implicitly agree to while using a website. Prior
research also suggests that users ignore privacy
policies because these policies are lengthy and, on
average, require 2 years of college education to
comprehend. We propose a novel technique that tackles
this problem by automatically extracting summaries of
online privacy policies. We use data mining models to
analyze the text of privacy policies and answer 10
basic questions concerning the privacy and security of
user data, what information is gathered from them, and
how this information is used. In order to train the
data mining models, we thoroughly study privacy
policies of 400 companies (considering 10\% of all
listings on NYSE, Nasdaq, and AMEX stock markets)
across industries. Our free Chrome browser extension,
PrivacyCheck, utilizes the data mining models to
summarize any HTML page that contains a privacy policy.
PrivacyCheck stands out from currently available
counterparts because it is readily applicable on any
online privacy policy. Cross-validation results show
that PrivacyCheck summaries are accurate 40\% to 73\%
of the time. Over 400 independent Chrome users are
currently using PrivacyCheck.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "53",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Graves:2018:SCC,
author = "James T. Graves and Alessandro Acquisti and Nicolas
Christin",
title = "Should Credit Card Issuers Reissue Cards in Response
to a Data Breach?: Uncertainty and Transparency in
Metrics for Data Security Policymaking",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "54:1--54:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3122983",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "When card data is exposed in a data breach but has not
yet been used to attempt fraud, the overall social
costs of that breach depend on whether the financial
institutions that issued those cards immediately cancel
them and issue new cards or instead wait until fraud is
attempted. This article empirically investigates the
social costs and benefits of those options. We use a
parameterized model and Monte Carlo simulation to
compare the cost of reissuing cards to the total
expected cost of fraud if cards are not reissued. The
ranges and distributions in our model are informed by
publicly available information, from which we
extrapolate estimates of the number of credit card
records historically exposed in data breaches, the
probability that a card exposed in a breach will be
used for fraud, and the associated expected cost of
existing-account credit card fraud. We find that
automatically reissuing cards may have lower social
costs than the costs of waiting until fraud is
attempted, although the range of results is
considerably broad.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "54",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Rezvani:2018:PAM,
author = "Mohsen Rezvani and Aleksandar Ignjatovic and Elisa
Bertino",
title = "A Provenance-Aware Multi-dimensional Reputation System
for Online Rating Systems",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "55:1--55:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3183323",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Online rating systems are widely accepted as means for
quality assessment on the web and users increasingly
rely on these systems when deciding to purchase an item
online. This makes such rating systems frequent targets
of attempted manipulation by posting unfair rating
scores. Therefore, providing useful, realistic rating
scores as well as detecting unfair behavior are both of
very high importance. Existing solutions are mostly
majority based, also employing temporal analysis and
clustering techniques. However, they are still
vulnerable to unfair ratings. They also ignore
distances between options, the provenance of
information, and different dimensions of cast rating
scores while computing aggregate rating scores and
trustworthiness of users. In this article, we propose a
robust iterative algorithm which leverages information
in the profile of users and provenance of information,
and which takes into account the distance between
options to provide both more robust and informative
rating scores for items and trustworthiness of users.
We also prove convergence of iterative ranking
algorithms under very general assumptions, which are
satisfied by the algorithm proposed in this article. We
have implemented and tested our rating method using
both simulated data as well as four real-world datasets
from various applications of reputation systems. The
experimental results demonstrate that our model
provides realistic rating scores even in the presence
of a massive amount of unfair ratings and outperforms
the well-known ranking algorithms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "55",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yang:2018:GTM,
author = "Zhi Yang and Wei Chen",
title = "A Game Theoretic Model for the Formation of Navigable
Small-World Networks-The Tradeoff between Distance and
Reciprocity",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "56:1--56:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3183325",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Kleinberg proposed a family of small-world networks to
explain the navigability of large-scale real-world
social networks. However, the underlying mechanism that
drives real networks to be navigable is not yet well
understood. In this article, we present a game
theoretic model for the formation of navigable
small-world networks. We model the network formation as
a game called the Distance-Reciprocity Balanced (DRB)
game in which people seek for both high reciprocity and
long-distance relationships. We show that the game has
only two Nash equilibria: One is the navigable
small-world network, and the other is the random
network in which each node connects with each other
node with equal probability, and any other network
state can reach the navigable small world via a
sequence of best-response moves of nodes. We further
show that the navigable small-world equilibrium is very
stable-(a) no collusion of any size would benefit from
deviating from it; and (b) after an arbitrary
deviations of a large random set of nodes, the network
would return to the navigable small world as soon as
every node takes one best-response step. In contrast,
for the random network, a small group collusion or
random perturbations is guaranteed to bring the network
out of the random-network equilibrium and move to the
navigable network as soon as every node takes one
best-response step. Moreover, we show that navigable
small-world equilibrium has much better social welfare
than the random network, and we provide the
price-of-anarchy and price-of-stability results of the
game. Our empirical evaluation further demonstrates
that the system always converges to the navigable
network even when limited or no information about other
players' strategies is available, and the DRB game
simulated on real-world networks leads to navigability
characteristic that is very close to that of the real
networks, even though the real-world networks have
non-uniform population distributions different from
Kleinberg's small-world model. Our theoretical and
empirical analyses provide important new insight on the
connection between distance, reciprocity, and
navigability in social networks.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "56",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Singh:2018:TR,
author = "Munindar P. Singh",
title = "{TOIT} Reviewers over 2017",
journal = j-TOIT,
volume = "18",
number = "4",
pages = "57:1--57:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3232919",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "57",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yu:2019:FGE,
author = "Zhiwen Yu and Fei Yi and Chao Ma and Zhu Wang and Bin
Guo and Liming Chen",
title = "Fine-grained Emotion Role Detection Based on Retweet
Information",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "1:1--1:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3191820",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "User behaviors in online social networks convey not
only literal information but also one's emotional
attitudes towards the information. To compute this
attitude, we define the concept of emotion role as the
concentrated reflection of a user's online emotional
characteristics. Emotion role detection aims to better
understand the structure and sentiments of online
social networks and support further analysis, e.g.,
revealing public opinions, providing personalized
recommendations, and detecting influential users. In
this article, we first introduce the definition of a
fine-grained emotion role, which consists of two
dimensions: emotion orientation (i.e., positive,
negative, and neutral) and emotion influence (i.e.,
leader and follower). We then propose a
Multi-dimensional Emotion Role Mining model (MERM) to
determine a user's emotion role in online social
networks. Specifically, we tend to identify emotion
roles by combining a set of features that reflect a
user's online emotional status, including degree of
emotional characteristics, accumulated emotion
preference, structural factor, temporal factor, and
emotion change factor. Experiment results on a
real-life micro-blog reposting dataset show that the
classification accuracy of the proposed model can
achieve up to 90.1\%.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Shih:2019:GPB,
author = "Timothy K. Shih and W. K. T. M. Gunarathne and
Ankhtuya Ochirbat and Huang-Ming Su",
title = "Grouping Peers Based on Complementary Degree and
Social Relationship using Genetic Algorithm",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "2:1--2:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3193180",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The aim of this article is to propose a new innovative
grouping approach using the genetic algorithm (GA) to
enhance the interaction and collaboration among peers
by considering the complementary degree of students'
learning status and their social relationships. In
order to validate our approach, experiments were
designed with a group of students and the outcomes were
tested with an e-Learning system. The auto-grouping
mechanism is developed using GA for better learning
results, which is justified based on the performance of
students tested on the e-Learning system. The outcomes
clearly indicate that the proposed approach can
generate a high degree of heterogeneous grouping and
encourage students to learn better. The technical
contribution of this article can be implemented in any
massive open online course platforms with thousands of
students, with regard to identifying peers for
collaborative works.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Novo:2019:MCT,
author = "Oscar Novo",
title = "Making Constrained Things Reachable: a Secure
{IP}-Agnostic {NAT} Traversal Approach for {IoT}",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "3:1--3:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3230640",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The widespread adoption of the Internet of Things
(IoT) has created a demand for ubiquitous connectivity
of IoT devices into the Internet. While end-to-end
connectivity for IoT requires in practice IPv6, a vast
majority of nodes in Internet are only IPv4-capable. To
address this issue, the use of Network Address
Translation (NAT) at the IoT network boundary becomes
necessary. However, the constrained nature of the IoT
devices hinders the integration of traditional NAT
traversal architectures through IoT networks. In this
article, we introduce a novel transition mechanism that
transparently enables IoT devices behind NATs to
connect across different network-layer infrastructures.
Our mechanism adopts the IoT standards to provide a
global connectivity solution in a transparent, secure,
and elegant way. Additionally, we revisit the NAT
solutions for IoT and describe and evaluate our current
implementation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ouni:2019:HAI,
author = "Ali Ouni and Hanzhang Wang and Marouane Kessentini and
Salah Bouktif and Katsuro Inoue",
title = "A Hybrid Approach for Improving the Design Quality of
{Web} Service Interfaces",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "4:1--4:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3226593",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "A key success of a Web service is to appropriately
design its interface to make it easy to consume and
understand. In the context of service-oriented
computing (SOC), the service's interface is the main
source of interaction with the consumers to reuse the
service functionality in real-world applications. The
SOC paradigm provides a collection of principles and
guidelines to properly design services to provide best
practice of third-party reuse. However, recent studies
showed that service designers tend to pay little care
to the design of their service interfaces, which often
lead to several side effects known as antipatterns. One
of the most common Web service interface antipatterns
is to expose a large number of semantically unrelated
operations, implementing different abstractions, in one
single interface. Such bad design practices may have a
significant impact on the service reusability,
understandability, as well as the development and
run-time characteristics. To address this problem, in
this article, we propose a hybrid approach to improve
the design quality of Web service interfaces and fix
antipatterns as a combination of both deterministic and
heuristic-based approaches. The first step consists of
a deterministic approach using a graph
partitioning-based technique to split the operations of
a large service interface into more cohesive
interfaces, each one representing a distinct
abstraction. Then, the produced interfaces will be
checked using a heuristic-based approach based on the
non-dominated sorting genetic algorithm (NSGA-II) to
correct potential antipatterns while reducing the
interface design deviation to avoid taking the service
away from its original design. To evaluate our
approach, we conduct an empirical study on a benchmark
of 26 real-world Web services provided by Amazon and
Yahoo. Our experiments consist of a quantitative
evaluation based on design quality metrics, as well as
a qualitative evaluation with developers to assess its
usefulness in practice. The results show that our
approach significantly outperforms existing approaches
and provides more meaningful results from a developer's
perspective.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "4",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Neiat:2019:IBC,
author = "Azadeh Ghari Neiat and Athman Bouguettaya and Sajib
Mistry",
title = "Incentive-Based Crowdsourcing of Hotspot Services",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "5:1--5:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3229047",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We present a new spatio-temporal incentive-based
approach to achieve a geographically balanced coverage
of crowdsourced services. The proposed approach is
based on a new spatio-temporal incentive model that
considers multiple parameters including location
entropy, time of day, and spatio-temporal density to
encourage the participation of crowdsourced service
providers. We present a greedy network flow algorithm
that offers incentives to redistribute crowdsourced
service providers to improve the crowdsourced coverage
balance within an area. A novel participation
probability model is also introduced to estimate the
expected number of crowdsourced service providers'
movement based on spatio-temporal features.
Experimental results validate the efficiency and
effectiveness of the proposed approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Tata:2019:GEI,
author = "Samir Tata and Quan Z. Sheng and Eleni Stroulia",
title = "{Guest Editors}' Introduction for Special Issue on
Service Management for the {Internet of Things}",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "6:1--6:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3293539",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Taherkordi:2019:CDR,
author = "Amir Taherkordi and Frank Eliassen and Michael
Mcdonald and Geir Horn",
title = "Context-Driven and Real-Time Provisioning of
Data-Centric {IoT} Services in the Cloud",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "7:1--7:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3151006",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The convergence of Internet of Things (IoT) and the
Cloud has significantly facilitated the provision and
management of services in large-scale applications,
such as smart cities. With a huge number of IoT
services accessible through clouds, it is very
important to model and expose cloud-based IoT services
in an efficient manner, promising easy and real-time
delivery of cloud-based, data-centric IoT services. The
existing work in this area has adopted a uniform and
flat view to IoT services and their data, making it
difficult to achieve the above goal. In this article,
we propose a software framework, Context-driven And
Real-time IoT (CARIoT) for real-time provisioning of
cloud-based IoT services and their data, driven by
their contextual properties. The main idea behind the
proposed framework is to structure the description of
data-centric IoT services and their real-time and
historical data in a hierarchical form in accordance
with the end-user application's context model. CARIoT
features design choices and software services to
realize this service provisioning model and the
supporting data structures for hierarchical IoT data
access. Using this approach, end-user applications can
access IoT services and subscribe to their real-time
and historical data in an efficient manner at different
contextual levels, e.g., from a municipal district to a
street in smart city use cases. We leverage a popular
cloud-based data storage platform, called Firebase, to
implement the CARIoT framework and evaluate its
efficiency. The evaluation results show that CARIoT's
hierarchical structure imposes no additional overhead
with less data notification delay as compared to
existing flat structures.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Mezghani:2019:ACP,
author = "Emna Mezghani and Ernesto Exposito and Khalil Drira",
title = "An Autonomic Cognitive Pattern for Smart {IoT}-Based
System Manageability: Application to Comorbidity
Management",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "8:1--8:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3166070",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The adoption of the Internet of Things (IoT)
drastically witnesses an increase in different domains
and contributes to the fast digitalization of the
universe. Henceforth, next generation of IoT-based
systems are set to become more complex to design and
manage. Collecting real-time IoT-generated data
unleashes a new wave of opportunities for business to
take more precise and accurate decisions at the right
time. However, a set of challenges, including the
design complexity of IoT-based systems and the
management of the ensuing heterogeneous big data as
well as the system scalability, need to be addressed
for the development of flexible smart IoT-based
systems. Consequently, we proposed a set of design
patterns that diminish the system design complexity
through selecting the appropriate combination of
patterns based on the system requirements. These
patterns identify four maturity levels for the design
and development of smart IoT-based systems. In this
article, we are mainly dealing with the system design
complexity to manage the context changeability at
runtime. Thus, we delineate the autonomic cognitive
management pattern, which is at the most mature level.
Based on the autonomic computing, this pattern
identifies a combination of management processes able
to continuously detect and manage the context changes.
These processes are coordinated based on cognitive
mechanisms that allow the system perceiving and
understanding the meaning of the received data to make
business decisions, as well as dynamically discovering
new processes that meet the requirements evolution at
runtime. We demonstrated the use of the proposed
pattern with a use case from the healthcare domain;
more precisely, the patient comorbidity management
based on wearables.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Mahmud:2019:LAA,
author = "Redowan Mahmud and Kotagiri Ramamohanarao and Rajkumar
Buyya",
title = "Latency-Aware Application Module Management for Fog
Computing Environments",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "9:1--9:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3186592",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The fog computing paradigm has drawn significant
research interest as it focuses on bringing cloud-based
services closer to Internet of Things (IoT) users in an
efficient and timely manner. Most of the physical
devices in the fog computing environment, commonly
named fog nodes, are geographically distributed,
resource constrained, and heterogeneous. To fully
leverage the capabilities of the fog nodes, large-scale
applications that are decomposed into interdependent
Application Modules can be deployed in an orderly way
over the nodes based on their latency sensitivity. In
this article, we propose a latency-aware Application
Module management policy for the fog environment that
meets the diverse service delivery latency and amount
of data signals to be processed in per unit of time for
different applications. The policy aims to ensure
applications' Quality of Service (QoS) in satisfying
service delivery deadlines and to optimize resource
usage in the fog environment. We model and evaluate our
proposed policy in an iFogSim-simulated fog
environment. Results of the simulation studies
demonstrate significant improvement in performance over
alternative latency-aware strategies.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Konstantinidis:2019:IDP,
author = "Andreas Konstantinidis and Panagiotis Irakleous and
Zacharias Georgiou and Demetrios Zeinalipour-Yazti and
Panos K. Chrysanthis",
title = "{IoT} Data Prefetching in Indoor Navigation {SOAs}",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "10:1--10:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3177777",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Internet-based Indoor Navigation Service-Oriented
Architectures (IIN-SOA) organize signals collected by
IoT-based devices to enable a wide range of novel
applications indoors, where people spend 80--90\% of
their time. In this article, we study the problem of
prefetching (or hoarding) the most important IoT data
from an IIN-SOA to a mobile device, without knowing its
user's destination during navigation. Our proposed Grap
(Graph Prefetching) framework structurally analyzes
building topologies to identify important areas that
become virtual targets to an online heuristic search
algorithm we developed. We tested Grap with datasets
from a real IIN-SOA and found it to be impressively
accurate.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ghose:2019:GEI,
author = "Aditya Ghose and Hamid R. Motahari Nezhad and Manfred
Reichert",
title = "{Guest Editors}' Introduction to the Special Issue on
Knowledge-Driven Business Process Management",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "11:1--11:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3296981",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "11",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Eshuis:2019:RAP,
author = "Rik Eshuis and Richard Hull and Mengfei Yi",
title = "Reasoning About Property Preservation in Adaptive Case
Management",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "12:1--12:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3177778",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Adaptive Case Management (ACM) has emerged as a key
BPM technology for supporting the unstructured business
process. A key problem in ACM is that case schemas need
to be changed to best fit the case at hand. Such
changes are ad hoc, and may result in schemas that do
not reflect the intended logic or properties. This
article presents a formal approach for reasoning about
which properties of a case schema are preserved after a
modification, and describes change operations that are
guaranteed to preserve certain properties. The approach
supports reasoning about rollbacks. The Case Management
model used here is a variant of the
Guard-Stage-Milestone model for declarative business
artifacts. A real-life example illustrates
applicability.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "12",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Pourmirza:2019:BRN,
author = "Shaya Pourmirza and Sander Peters and Remco Dijkman
and Paul Grefen",
title = "{BPMS-RA}: a Novel Reference Architecture for Business
Process Management Systems",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "13:1--13:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3232677",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3232677",
abstract = "A growing number of business process management
systems is under development both in academia and in
practice. These systems typically are based on modern
system engineering principles, such as service-oriented
architecture. At the same time, the advent of big data
analytics has changed the scope of these systems,
including functionality such as data mining. However,
existing reference architectures for business process
management systems date back 20 years and,
consequently, are not up-to-date with these modern
developments. To fill the gap, this article proposes an
up-to-date reference architecture, called BPMS-RA, for
modern business process management systems. BPMS-RA is
based on analysis of recent literature and of existing
commercial implementations. This reference architecture
aims to provide a guideline template for the
development of modern-day business process management
systems by specifying functions and interfaces that
need to be provided by these systems as well as a set
of quality criteria that they need to meet.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "13",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yousfi:2019:ABP,
author = "Alaaeddine Yousfi and Kimon Batoulis and Mathias
Weske",
title = "Achieving Business Process Improvement via Ubiquitous
Decision-Aware Business Processes",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "14:1--14:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3298986",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Business process improvement is an endless challenge
for many organizations. As long as there is a process,
it must be improved. Nowadays, improvement initiatives
are driven by professionals. This is no longer
practical because people cannot perceive the enormous
data of current business environments. Here, we
introduce ubiquitous decision-aware business processes.
They pervade the physical space, analyze the
ever-changing environments, and make decisions
accordingly. We explain how they can be built and used
for improvement. Our approach can be a valuable
improvement option to alleviate the workload of
participants by helping focus on the crucial rather
than the menial tasks.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "14",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Estrada-Torres:2019:MPK,
author = "Bedilia Estrada-Torres and Pedro Henrique Piccoli
Richetti and Adela Del-R{\'\i}o-Ortega and Fernanda
Araujo Bai{\~a}o and Manuel Resinas and Fl{\'a}via
Maria Santoro and Antonio Ruiz-Cort{\'e}s",
title = "Measuring Performance in Knowledge-intensive
Processes",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "15:1--15:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3289180",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Knowledge-intensive Processes (KIPs) are processes
whose execution is heavily dependent on knowledge
workers performing various interconnected
knowledge-intensive decision-making tasks. Among other
characteristics, KIPs are usually non-repeatable,
collaboration-oriented, unpredictable, and, in many
cases, driven by implicit knowledge, derived from the
capabilities and previous experiences of participants.
Despite the growing body of research focused on
understanding KIPs and on proposing systems to support
these KIPs, the research question on how to define
performance measures thereon remains open. In this
article, we address this issue with a proposal to
enable the performance management of KIPs. Our approach
comprises an ontology that allows us to define process
performance indicators (PPIs) in the context of KIPs,
and a methodology that builds on the ontology and the
concepts of lead and lag indicators to provide process
participants with actionable guidelines that help them
conduct the KIP in a way that fulfills a set of
performance goals. Both the ontology and the
methodology have been applied to a case study of a real
organization in Brazil to manage the performance of an
Incident Troubleshooting Process within an ICT
(Information and Communications Technology) Outsourcing
Company.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "15",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Armas-Cervantes:2019:LCD,
author = "Abel Armas-Cervantes and Marlon Dumas and Marcello {La
Rosa} and Abderrahmane Maaradji",
title = "Local Concurrency Detection in Business Process Event
Logs",
journal = j-TOIT,
volume = "19",
number = "1",
pages = "16:1--16:??",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3289181",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Process mining techniques aim at analyzing records
generated during the execution of a business process in
order to provide insights on the actual performance of
the process. Detecting concurrency relations between
events is a fundamental primitive underpinning a range
of process mining techniques. Existing approaches to
this problem identify concurrency relations at the
level of event types under a global interpretation. If
two event types are declared to be concurrent, every
occurrence of one event type is deemed to be concurrent
to one occurrence of the other. In practice, this
interpretation is too coarse-grained and leads to
over-generalization. This article proposes a
finer-grained approach, whereby two event types may be
deemed to be in a concurrency relation relative to one
state of the process, but not relative to other states.
In other words, the detected concurrency relation holds
locally, relative to a set of states. Experimental
results both with artificial and real-life logs show
that the proposed local concurrency detection approach
improves the accuracy of existing concurrency detection
techniques.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "16",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Longo:2019:GEI,
author = "Francesco Longo and Antonio Puliafito and Omer Rana",
title = "{Guest Editors}' Introduction to the Special Issue on
Fog, Edge, and Cloud Integration for Smart
Environments",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "17:1--17:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3319404",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3319404",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "17",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Puliafito:2019:FCI,
author = "Carlo Puliafito and Enzo Mingozzi and Francesco Longo
and Antonio Puliafito and Omer Rana",
title = "Fog Computing for the {Internet of Things}: a Survey",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "18:1--18:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3301443",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3301443",
abstract = "Research in the Internet of Things (IoT) conceives a
world where everyday objects are connected to the
Internet and exchange, store, process, and collect data
from the surrounding environment. IoT devices are
becoming essential for supporting the delivery of data
to enable electronic services, but they are not
sufficient in most cases to host application services
directly due to their intrinsic resource constraints.
Fog Computing (FC) can be a suitable paradigm to
overcome these limitations, as it can coexist and
cooperate with centralized Cloud systems and extends
the latter toward the network edge. In this way, it is
possible to distribute resources and services of
computing, storage, and networking along the
Cloud-to-Things continuum. As such, FC brings all the
benefits of Cloud Computing (CC) closer to end (user)
devices. This article presents a survey on the
employment of FC to support IoT devices and services.
The principles and literature characterizing FC are
described, highlighting six IoT application domains
that may benefit from the use of this paradigm. The
extension of Cloud systems towards the network edge
also creates new challenges and can have an impact on
existing approaches employed in Cloud-based
deployments. Research directions being adopted by the
community are highlighted, with an indication of which
of these are likely to have the greatest impact. An
overview of existing FC software and hardware platforms
for the IoT is also provided, along with the
standardisation efforts in this area initiated by the
OpenFog Consortium (OFC).",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "18",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Pore:2019:CEE,
author = "Madhurima Pore and Vinaya Chakati and Ayan Banerjee
and Sandeep K. S. Gupta",
title = "{ContextAiDe}: End-to-End Architecture for Mobile
Crowd-sensing Applications",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "19:1--19:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3301444",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3301444",
abstract = "Mobile crowd-sensing (MCS) enables development of
context-aware applications by mining relevant
information from a large set of devices selected in an
ad hoc manner. For example, MCS has been used for
real-time monitoring such as Vehicle ad hoc
Networks-based traffic updates as well as offline data
mining and tagging for future use in applications with
location-based services. However, MCS could be
potentially used for much more demanding applications
such as real-time perpetrator tracking by online mining
of images from nearby mobile users. A recent example is
tracking the miscreant responsible for the Boston
bombing. We present a new design approach for tracking
using MCS for such complex processing in real time.
Since MCS applications assume an unreliable underlying
computational platform, most typically sample size for
recruited devices is guided by concerns such as fault
tolerance and reliability of information. As the
real-time requirements get stricter coupled with
increasing complexity of data-mining approaches, the
communication and computation overheads can impose a
very tight constraint on the sample size of devices
needed for realizing real-time operation. This results
in trade-off in acquiring context-relevant data and
resource usage incurred while the real-time operation
requirements get updated dynamically. Such effects have
not been properly studied and optimized to enable
real-time MCS applications such as perpetrator
tracking. In this article, we propose ContextAiDe
architecture, a combination of API, middleware, and
optimization engine. The key innovation in ContextAiDe
is context-optimized recruitment for execution of
computation- and communication-heavy MCS applications
in edge environment. ContextAiDe uses a notion of two
types of contexts, exact (hard constraints), which have
to be satisfied, and preferred (soft constraints),
which may be satisfied to a certain degree. By
adjusting the preferred contexts, ContextAiDe can
optimize the operational overheads to enable real-time
operation. ContextAiDe provides an API to specify
contexts requirements and the code of MCS app, offload
execution environment, a middleware that enables
context-optimized and a fault-tolerant distributed
execution. ContextAiDe evaluation using a real-time
perpetrator tracking application shows reduced energy
consumption of 37.8\%, decrease in data transfer of
24.8\%, and 43\% less time compared to existing
strategy. In spite of a small increase in the minimum
distance from the perpetrator, iterations of
optimization tracks the perpetrator successfully.
Pro-actively learning the context and using stochastic
optimization strategy minimizes the performance
degradation caused due to uncertainty (\<20\%) in
usage-dependent contexts.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "19",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Concone:2019:FBA,
author = "Federico Concone and Giuseppe {Lo Re} and Marco
Morana",
title = "A Fog-Based Application for Human Activity Recognition
Using Personal Smart Devices",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "20:1--20:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3266142",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3266142",
abstract = "The diffusion of heterogeneous smart devices capable
of capturing and analysing data about users, and/or the
environment, has encouraged the growth of novel sensing
methodologies. One of the most attractive scenarios in
which such devices, such as smartphones, tablet
computers, or activity trackers, can be exploited to
infer relevant information is human activity
recognition (HAR). Even though some simple HAR
techniques can be directly implemented on mobile
devices, in some cases, such as when complex activities
need to be analysed timely, users' smart devices can
operate as part of a more complex architecture. In this
article, we propose a multi-device HAR framework that
exploits the fog computing paradigm to move heavy
computation from the sensing layer to intermediate
devices and then to the cloud. As compared to
traditional cloud-based solutions, this choice allows
to overcome processing and storage limitations of
wearable devices while also reducing the overall
bandwidth consumption. Experimental analysis aims to
evaluate the performance of the entire platform in
terms of accuracy of the recognition process while also
highlighting the benefits it might bring in smart
environments.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "20",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Li:2019:DRS,
author = "He Li and Kaoru Ota and Mianxiong Dong",
title = "Deep Reinforcement Scheduling for Mobile Crowdsensing
in Fog Computing",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "21:1--21:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3234463",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3234463",
abstract = "Mobile crowdsensing becomes a promising technology for
the emerging Internet of Things (IoT) applications in
smart environments. Fog computing is enabling a new
breed of IoT services, which is also a new opportunity
for mobile crowdsensing. Thus, in this article, we
introduce a framework enabling mobile crowdsensing in
fog environments with a hierarchical scheduling
strategy. We first introduce the crowdsensing framework
that has a hierarchical structure to organize different
resources. Since different positions and performance of
fog nodes influence the quality of service (QoS) of IoT
applications, we formulate a scheduling problem in the
hierarchical fog structure and solve it by using a deep
reinforcement learning-based strategy. From extensive
simulation results, our solution outperforms other
scheduling solutions for mobile crowdsensing in the
given fog computing environment.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "21",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Samie:2019:OOO,
author = "Farzad Samie and Vasileios Tsoutsouras and Lars Bauer
and Sotirios Xydis and Dimitrios Soudris and J{\"o}rg
Henkel",
title = "{Oops}: Optimizing Operation-mode Selection for {IoT}
Edge Devices",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "22:1--22:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3230642",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3230642",
abstract = "The massive increase of IoT devices and their
collected data raises the question of how to analyze
all that data. Edge computing provides a suitable
compromise, but the question remains: How much
processing should be done locally vs. offloaded to
other devices? The diverse application requirements and
limited resources at the edge extend the challenges. We
propose Oops, an optimization framework to adapt the
resource management at runtime distributedly. It
orchestrates the IoT devices and adapts their operation
mode with respect to their constraints and the
gateway's limited shared resources. Oops reduces
runtime overhead significantly while increasing user
utility compared to state-of-the-art.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "22",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Avgeris:2019:ARA,
author = "Marios Avgeris and Dimitrios Dechouniotis and Nikolaos
Athanasopoulos and Symeon Papavassiliou",
title = "Adaptive Resource Allocation for Computation
Offloading: a Control-Theoretic Approach",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "23:1--23:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3284553",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3284553",
abstract = "Although mobile devices today have powerful hardware
and networking capabilities, they fall short when it
comes to executing compute-intensive applications.
Computation offloading (i.e., delegating
resource-consuming tasks to servers located at the edge
of the network) contributes toward moving to a mobile
cloud computing paradigm. In this work, a two-level
resource allocation and admission control mechanism for
a cluster of edge servers offers an alternative choice
to mobile users for executing their tasks. At the lower
level, the behavior of edge servers is modeled by a set
of linear systems, and linear controllers are designed
to meet the system's constraints and quality of service
metrics, whereas at the upper level, an optimizer
tackles the problems of load balancing and application
placement toward the maximization of the number the
offloaded requests. The evaluation illustrates the
effectiveness of the proposed offloading mechanism
regarding the performance indicators, such as
application average response time, and the optimal
utilization of the computational resources of edge
servers.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "23",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Mazouzi:2019:DEE,
author = "Houssemeddine Mazouzi and Nadjib Achir and Khaled
Boussetta",
title = "{DM2-ECOP}: an Efficient Computation Offloading Policy
for Multi-user Multi-cloudlet Mobile Edge Computing
Environment",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "24:1--24:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3241666",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3241666",
abstract = "Mobile Edge Computing is a promising paradigm that can
provide cloud computing capabilities at the edge of the
network to support low latency mobile services. The
fundamental concept relies on bringing cloud
computation closer to users by deploying cloudlets or
edge servers, which are small clusters of servers that
are mainly located on existing wireless Access Points
(APs), set-top boxes, or Base Stations (BSs). In this
article, we focus on computation offloading over a
heterogeneous cloudlet environment. We consider several
users with different energy-and latency-constrained
tasks that can be offloaded over cloudlets with
differentiated system and network resources capacities.
We investigate offloading policies that decide which
tasks should be offloaded and select the assigned
cloudlet, accordingly with network and system
resources. The objective is to minimize an offloading
cost function, which we defined as a combination of
tasks' execution time and mobiles' energy consumption.
We formulate this problem as a Mixed-Binary
Programming. Since the centralized optimal solution is
NP-hard, we propose a distributed linear
relaxation-based heuristic approach that relies on the
Lagrangian decomposition method. To solve the
subproblems, we also propose a greedy heuristic
algorithm that computes the best cloudlet selection and
bandwidth allocation following tasks' offloading costs.
Numerical results show that our offloading policy
achieves a good solution quickly. We also discuss the
performances of our approach for large-scale scenarios
and compare it to state-of-the-art approaches from the
literature.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "24",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Vasconcelos:2019:CFM,
author = "D. R. Vasconcelos and R. M. C. Andrade and V. Severino
and J. N. {De Souza}",
title = "Cloud, Fog, or Mist in {IoT}? {That} Is the Question",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "25:1--25:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3309709",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3309709",
abstract = "Internet of Things (IoT) has been commercially
explored as Platforms as a Services (PaaS). The
standard solution for this kind of service is to
combine the Cloud computing infrastructure with IoT
software, services, and protocols also known as CoT
(Cloud of Things). However, the use of CoT in
latency-sensitive applications has been shown to be
unfeasible due to the inherent latency of cloud
computing services. One proposal to solve this problem
is the use of the computational resources available at
the edge of the network, which is called Fog computing.
Fog computing solves the problem of latency but adds
complexity to the use of these resources due to the
dynamism and heterogeneity of the IoT. An even more
accentuated form of fog computing is Mist computing,
where the use of the computational resources is limited
to the close neighborhood of the client device. The
decision of what computing infrastructure (Fog, Mist,
or Cloud computing) is the best to provide
computational resources is not always simple,
especially in cases where latency requirements should
be met by CoT. This work proposes an algorithm for
selecting the best physical infrastructure to use the
computational resource (Fog, Mist, or Cloud computing)
based on cost, bandwidth, and latency criteria defined
by the client device, resource availability, and
topology of the network. The article also introduces
the concept of feasible Fog that limits the growth of
device search time in the neighborhood of the client
device. Simulation results suggest the algorithm's
choice adequately attends the client's device
requirements and that the proposed method can be used
in IoT environment located on the edge of the
network.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "25",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Feng:2019:PPP,
author = "Jun Feng and Laurence T. Yang and Ronghao Zhang",
title = "Practical Privacy-preserving High-order Bi-{Lanczos}
in Integrated Edge-Fog-Cloud Architecture for
Cyber-Physical-Social Systems",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "26:1--26:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3230641",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3230641",
abstract = "Smart environments, also referred to as
cyber-physical-social systems (CPSSs), are expected to
significantly benefit from the integration of edge,
fog, and cloud for intelligence service flexibility,
efficiency, and cost saving. High-order Bi-Lanczos
method has emerged as a powerful tool serving as
multi-dimensional data processing, such as prevailing
feature extraction, classification, and clustering of
high-order data, in CPSSs. However, integrated
edge-fog-cloud architecture is open and users have very
limited control; how to carry out big data processing
without compromising the security and privacy is a
challenging issue in edge-fog-cloud-assisted smart
applications. In this work, we propose a novel and
practical privacy-preserving high-order Bi-Lanczos
scheme in integrated edge-fog-cloud architectural
paradigm for smart environments. More precisely, we
first propose a privacy-preserving big data processing
model using the synergy of edge, fog, and cloud. The
proposed model enables edge, fog, and cloud to
cooperatively complete big data processing without
compromising users' privacy for large-scale tensor data
in CPSSs. Subsequently, making use of the model, we
present a privacy-preserving high-order Bi-Lanczos
scheme. Finally, we theoretically and empirically
analyze the security and efficiency of the proposed
privacy-preserving high-order Bi-Lanczos scheme based
on an intelligent surveillance system case study. And
the results demonstrate that the proposed scheme
provides a privacy-preserving and efficient way of
computations in integrated edge-fog-cloud paradigm for
smart environments.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "26",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Ferretti:2019:FBS,
author = "Luca Ferretti and Mirco Marchetti and Michele
Colajanni",
title = "Fog-based Secure Communications for Low-power {IoT}
Devices",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "27:1--27:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3284554",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3284554",
abstract = "Designing secure, scalable, and resilient IoT networks
is a challenging task because of resource-constrained
devices and no guarantees of reliable network
connectivity. Fog computing improves the resiliency of
IoT, but its security model assumes that fog nodes are
fully trusted. We relax this latter constraint by
proposing a solution that guarantees confidentiality of
messages exchanged through semi-honest fog nodes thanks
to a lightweight proxy re-encryption scheme. We
demonstrate the feasibility of the solution by applying
it to IoT networks of low-power devices through
experiments on microcontrollers and ARM-based
architectures.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "27",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Merlino:2019:EWE,
author = "Giovanni Merlino and Rustem Dautov and Salvatore
Distefano and Dario Bruneo",
title = "Enabling Workload Engineering in Edge, Fog, and Cloud
Computing through {OpenStack}-based Middleware",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "28:1--28:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3309705",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3309705",
abstract = "To enable and support smart environments, a recent ICT
trend promotes pushing computation from the remote
Cloud as close to data sources as possible, resulting
in the emergence of the Fog and Edge computing
paradigms. Together with Cloud computing, they
represent a stacked architecture, in which raw datasets
are first pre-processed locally at the Edge and then
vertically offloaded to the Fog and/or the Cloud.
However, as hardware is becoming increasingly powerful,
Edge devices are seen as candidates for offering data
processing capabilities, able to pool and share
computing resources to achieve better performance at a
lower network latency-a pattern that can be also
applied to Fog nodes. In these circumstances, it is
important to enable efficient, intelligent, and
balanced allocation of resources, as well as their
further orchestration, in an elastic and transparent
manner. To address such a requirement, this article
proposes an OpenStack-based middleware platform through
which resource containers at the Edge, Fog, and Cloud
levels can be discovered, combined, and provisioned to
end users and applications, thereby facilitating and
orchestrating offloading processes. As demonstrated
through a proof of concept on an intelligent
surveillance system, by converging the Edge, Fog, and
Cloud, the proposed architecture has the potential to
enable faster data processing, as compared to
processing at the Edge, Fog, or Cloud levels
separately. This also allows architects to combine
different offloading patterns in a flexible and
fine-grained manner, thus providing new workload
engineering patterns. Measurements demonstrated the
effectiveness of such patterns, even outperforming edge
clusters.",
acknowledgement = ack-nhfb,
ajournal = "ACM Trans. Internet Technol.",
articleno = "28",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Baresi:2019:UMM,
author = "L. Baresi and D. F. Mendon{\c{c}}a and M. Garriga and
S. Guinea and G. Quattrocchi",
title = "A Unified Model for the Mobile-Edge-Cloud Continuum",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "29:1--29:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3226644",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "http://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=32
