%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.34", %%% date = "19 March 2012", %%% time = "17:13:04 MDT", %%% filename = "toit.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% FAX = "+1 801 581 4148", %%% URL = "http://www.math.utah.edu/~beebe", %%% checksum = "56718 5805 29016 278542", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "bibliography, BibTeX, ACM Transactions on %%% Internet Technology", %%% license = "public domain", %%% supported = "no", %%% docstring = "This is a COMPLETE BibTeX bibliography for %%% the journal ACM Transactions on Internet %%% Technology (CODEN none, ISSN 1046-8188), for %%% 2001--date. %%% %%% Publication began with volume 1, number 1, in %%% August 2001. The journal appears quarterly, %%% in February, May, August, and November. %%% %%% The journal has a World-Wide Web site at: %%% %%% http://www.acm.org/pubs/toit %%% %%% Tables-of-contents of all issues are %%% available at: %%% %%% http://www.acm.org/pubs/contents/journals/toit/ %%% http://portal.acm.org/browse_dl.cfm?idx=J780 %%% %%% Qualified subscribers can retrieve the full %%% text of recent articles in PDF form. %%% %%% At version 1.34, the COMPLETE journal %%% coverage looked like this: %%% %%% 2001 ( 7) 2005 ( 21) 2009 ( 16) %%% 2002 ( 12) 2006 ( 15) 2010 ( 12) %%% 2003 ( 14) 2007 ( 28) 2011 ( 12) %%% 2004 ( 17) 2008 ( 16) 2012 ( 9) %%% %%% Article: 179 %%% %%% Total entries: 179 %%% %%% The initial draft of this bibliography was %%% derived from data at the ACM Web site. %%% %%% ACM copyrights explicitly permit abstracting %%% with credit, so article abstracts, keywords, %%% and subject classifications have been %%% included in this bibliography wherever %%% available. %%% %%% The bibsource keys in the bibliography %%% entries below indicate the data sources. %%% %%% URL keys in the bibliography point to %%% World Wide Web locations of additional %%% information about the entry. %%% %%% Spelling has been verified with the UNIX %%% spell and GNU ispell programs using the %%% exception dictionary stored in the %%% companion file with extension .sok. %%% %%% BibTeX citation tags are uniformly chosen %%% as name:year:abbrev, where name is the %%% family name of the first author or editor, %%% year is a 4-digit number, and abbrev is a %%% 3-letter condensation of important title %%% words. Citation tags were automatically %%% generated by software developed for the %%% BibNet Project. %%% %%% In this bibliography, entries are sorted in %%% publication order, using ``bibsort -byvolume.'' %%% %%% The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ==================================================================== @Preamble{"\input bibnames.sty"} %%% ==================================================================== %%% Acknowledgement abbreviations: @String{ack-nhfb = "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|http://www.math.utah.edu/~beebe/|"} %%% ==================================================================== %%% Journal abbreviations: @String{j-TOIT = "ACM Transactions on Internet Technology (TOIT)"} %%% ==================================================================== %%% Publisher abbreviations: @String{pub-ACM = "ACM Press"} @String{pub-ACM:adr = "New York, NY 10036, USA"} %%% ==================================================================== %%% Bibliography entries: @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } %%% [23-Aug-2006] TO DO: Volume 6 number 2 is missing from ACM Portal database @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 = "http://doi.acm.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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, fjournal = "ACM Transactions on Internet Technology (TOIT)", 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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, articleno = "1", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "2", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "3", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "4", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "5", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "6", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "7", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "8", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "9", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "10", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "11", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "12", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "13", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, articleno = "14", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "15", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "16", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "17", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "18", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, articleno = "19", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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 fulfils the requirements for a search support system, providing evaluation results where applicable.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "21", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "22", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "23", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "1", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, articleno = "2", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "3", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "4", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "5", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "1", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, articleno = "2", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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{\trademark} (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, articleno = "3", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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 http://137.204.74.83/{\sim}lot/) have confirmed the viability of our approach.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "5", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "11", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @Article{Engelen: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 = "http://doi.acm.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, articleno = "12", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "13", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "14", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "15", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "16", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "17", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "18", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "19", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "20", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "21", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "1", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "2", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "3", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "4", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "5", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, articleno = "6", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "7", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "8", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "9", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "10", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "11", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "12", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "13", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "14", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "15", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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 $FI$). 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, articleno = "16", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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, articleno = "1", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, articleno = "2", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, articleno = "3", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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, articleno = "4", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://doi.acm.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, articleno = "5", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "6", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "7", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "8", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "9", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "10", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "11", fjournal = "ACM Transactions on Internet Technology (TOIT)", 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 = "http://doi.acm.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, articleno = "12", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "13", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "14", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "15", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "16", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "1", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "2", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "3", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "4", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "5", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "6", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "7", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "8", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "9", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "10", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "11", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "12", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "13", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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, articleno = "14", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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/tois.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, articleno = "15", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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/tois.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, articleno = "16", fjournal = "ACM Transactions on Internet Technology (TOIT)", } @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 = "http://dx.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/tois.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, articleno = "17", fjournal = "ACM Transactions on Internet Technology (TOIT)", }