@inproceedings{thakkar04:pswgs,
   Author = "Snehal Thakkar and Jos\'{e} Luis Ambite and Craig A. Knoblock",
   Title = "A Data Integration Approach to Automatically Composing and Optimizing Web Services",
   BookTitle = "Proceedings of 2004 ICAPS Workshop on Planning and Scheduling for Web and Grid Services",
   Address= "Whistler, BC, Canada",
   Year = "2004",
   urlPaper= "http://usc-isi-i2.github.io/papers/thakkar04-icapswkshp.pdf",
   Keywords = {"Data Integration"} }

@ARTICLE{Lerman04adaptive,
  author =       {Kristina Lerman},
  title =        {A Model of Adaptation in Collaborative Multi-Agent Systems},
  journal =      {Adaptive Behavior},
  year =         {2004},
  volume =       {12},
  number =       {3--4},
  pages =        {187--198},
  urlPaper={http://www.isi.edu/~lerman/papers/lerman05adaptive.pdf},
  annote =       {Same as Lerman03insects, MASI-03 workshop, Atlanta, GA, December 2003.},
  keywords =    {multi-agent-systems},
}

@INPROCEEDINGS{French200409,
Author = {French, Matthew},
Booktitle = {7th Annual International Conference on Military and Aerospace Programmable Logic Devices},
Title = {A Power Efficient Image Convolution Engine for Field Programmable Gate Arrays},
year = {2004},
month = {September},
keywords={Low power; FPGA; Image convolution},
isbn = {},
url = {http://klabs.org/mapld04/},
address = {Washington, DC},
}

@inproceedings{harth_www_2004,
author = {Harth, Andreas and Decker, Stefan and He, Yu and Tangmunarunkit, Hongsuda and Kesselman, Carl},
title = {A Semantic Matchmaker Service on the Grid},
year = {2004},
isbn = {1581139128},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1013367.1013458},
doi = {10.1145/1013367.1013458},
abstract = {A fundamental task on the Grid is to decide what jobs to run on what computing resources based on job or application requirements. Our previous work on ontology-based matchmaking discusses a resource matchmaking mechanism using Semantic Web technologies. We extend our previous work to provide dynamic access to such matchmaking capability by building a persistent online matchmaking service. Our implementation uses the Globus Toolkit for the Grid service development, and exploits the monitoring and discovery service in the Grid infrastructure to dynamically discover and update resource information. We describe the architecture of our semantic matchmaker service in the poster.},
booktitle = {Proceedings of the 13th International World Wide Web Conference on Alternate Track Papers & Posters},
pages = {326–327},
numpages = {2},
keywords = {resource selection, networking and distributed web applications, resource allocation, grid services, semantic web},
location = {New York, NY, USA},
series = {WWW Alt. '04}
}

A fundamental task on the Grid is to decide what jobs to run on what computing resources based on job or application requirements. Our previous work on ontology-based matchmaking discusses a resource matchmaking mechanism using Semantic Web technologies. We extend our previous work to provide dynamic access to such matchmaking capability by building a persistent online matchmaking service. Our implementation uses the Globus Toolkit for the Grid service development, and exploits the monitoring and discovery service in the Grid infrastructure to dynamically discover and update resource information. We describe the architecture of our semantic matchmaker service in the poster.

@inproceedings{proc_silva:statisticaldicrimination:icslp04,
 address = {Jeju Island, Korea},
 author = {Silva, Jorge and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/SilvaInterSpeech2004.pdf},
 month = {Oct},
 pages = {657-660},
 title = {A Statistical Discrimination Measure for Hidden Markov Models Based on Divergence},
 year = {2004}
}

@inproceedings{proc_kyujeong:distributedspeechreco:icslp04,
 address = {Jeju Island, Korea},
 author = {Han, Kyu Jeong and Srinivasamurthy, Naveen and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/HanInterSpeech2004[1].pdf},
 month = {Oct},
 pages = {2121-2124},
 title = {A distributed speech recognition system in multi-user environments},
 year = {2004}
}

@inproceedings{proc_dagen:linearfold:icassp04,
 address = {Montreal, Canada},
 author = {Wang, Dagen and Narayanan, Shrikanth S.},
 booktitle = {Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2004.1326038},
 link = {http://sail.usc.edu/publications/files/wangicassp2004.pdf},
 month = {May},
 pages = {525-528},
 title = {A multi-pass linear fold algorithm for sentence boundary detection using prosodic cues},
 year = {2004}
}

@article{DBLP:journals/ws/BadaSGGABCHL04,
  author       = {Michael Bada and
                  Robert Stevens and
                  Carole A. Goble and
                  Yolanda Gil and
                  Michael Ashburner and
                  Judith A. Blake and
                  J. Michael Cherry and
                  Midori A. Harris and
                  Suzanna Lewis},
  title        = {A short study on the success of the Gene Ontology},
  journal      = {J. Web Semant.},
  volume       = {1},
  number       = {2},
  pages        = {235--240},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.websem.2003.12.003},
  doi          = {10.1016/J.WEBSEM.2003.12.003},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ws/BadaSGGABCHL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{proc_unal:hummingsystems:acmsigmmmir04,
 address = {New York City, NY},
 author = {Unal, Erdem and Narayanan, Shrikanth S. and Chew, Elaine},
 bib2html_rescat = {},
 booktitle = {Proceedings of the ACM SIGMM International Workshop on Multimedia Information Retrieval (MIR)},
 doi = {10.1145/1026711.1026731},
 link = {http://sail.usc.edu/publications/files/unalmir2004.pdf},
 month = {Oct},
 pages = {113-118},
 title = {A statistical approach to retrieval under user-dependent uncertainty in query-by-humming systems},
 year = {2004}
}

@article{mirkovic2004taxonomy,
  title={A taxonomy of DDoS attacks and DDoS defense mechanisms},
  author={Mirkovic, Jelena and Martin, Janice and Reiher, Peter},
  journal={ACM SIGCOMM Computer Communication Review},
  volume={34},
  number={2},
  pages={39--53},
  year={2004}
}

@inproceedings{proc_ganjavi:transcriptionscheme:coling04,
 address = {Geneva, Switzerland},
 author = {Ganjavi, Shadi and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of the International Conference on Computational Linguistics},
 link = {http://sail.usc.edu/publications/files/ganjavicoling2004.pdf},
 month = {Aug},
 title = {A transcription scheme for languages employing the Arabic script motivated by speech processing applications},
 year = {2004}
}

@article{Li2004Adaptivespeakeridentificationwith,
 author = {Li, Ying and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 doi = {10.1016/j.patrec.2004.01.004},
 journal = {Pattern Recognition Letters},
 keyword = {adaptive speaker identification, mouth detection and tracking, movie content analysis, speech segmentation and clustering, unsupervised speaker model adaptation},
 link = {http://sail.usc.edu/publications/files/liprl2004.pdf},
 month = {May},
 number = {7},
 pages = {777-791},
 title = {Adaptive speaker identification with audiovisual cues for movie content analysis},
 volume = {25},
 year = {2004}
}

@inproceedings{tuchinda04:iui,
  author = "Rattapoom Tuchinda and Craig A. Knoblock",
  title = "Agent Wizard: Building Information Agents by Answering Questions",
  booktitle = "Proceedings of Intelligent User Interfaces",
  address = "Island of Madeira, Portugal",
  year = "2004",
  urlPaper= "http://usc-isi-i2.github.io/papers/tuchinda04-iui.pdf",
  Keywords = {"Information Agents"}
}

@article{lee2004agent,
	author = {Lee, George and Bauer, Steven and Faratin, Peyman and Wroclawski, John},
	title = {An Agent for Interactively Learning User Preferences On-Linefor Wireless Services Provisioning},
	year = {2004}}

@article{Narayanan2004Anapproachtoreal-time,
 author = {Narayanan, Shrikanth S. and Nayak, Krishna S. and Lee, Sungbok and Sethy, Abhinav and Byrd, Dani},
 bib2html_rescat = {span},
 doi = {10.1121/1.1652588},
 journal = {Journal of the Acoustical Society of America},
 link = {http://sail.usc.edu/publications/files/MRI_SS.pdf},
 month = {Apr},
 number = {4},
 pages = {1771-1776},
 title = {An Approach to Real-time Magnetic Resonance Imaging for Speech Production},
 volume = {115},
 year = {2004}
}

@TechReport{Heidemann04a,
	author = 	"John Heidemann and Ramesh Govindan",
	title = 	"An Overview of Embedded Sensor Networks",
	institution = 	"USC/Information Sciences Institute",
	year = 		2004,
	sortdate = 		"2004-11-01",
	project = "ant, nocredit",
	jsubject = "sensornet_general",
	number =	"ISI-TR-2004-594",
	month =		nov,
	location =	"johnh: pafile",
	note =	"book chapter to appear in \emph{Handbook of Networked and Embedded Control Systems}, D. Hristu-Varsakelis and W.S. Levine, editors, Springer-Verlag, 2004",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann04a.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann04a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
No formal abstract, but this paper provides an overview of embedded
sensor networks, including hardware platforms, software and protocols,
and applications.
",
}

No formal abstract, but this paper provides an overview of embedded sensor networks, including hardware platforms, software and protocols, and applications.

@inproceedings{proc_yildrim:emotions:icslp04,
 address = {Jeju Island, Korea},
 author = {Yildirim, Serdar and Bulut, Murtaza and Lee, Chul Min and Kazemzadeh, Abe and Busso, Carlos and Deng, Zhigang and Lee, Sungbok and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/YildirimInterSpeech2004.pdf},
 month = {Oct},
 pages = {2193-2196},
 title = {An acoustic study of emotions expressed in speech},
 year = {2004}
}

@inproceedings{collins2004empirical,
  title={An empirical analysis of target-resident DoS filters},
  author={Collins, Michael and Reiter, Michael},
  booktitle={IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004},
  pages={103--114},
  year={2004},
  organization={IEEE}
}

@inproceedings{DBLP:conf/iui/KimSG04,
  author       = {Jihie Kim and
                  Marc Spraragen and
                  Yolanda Gil},
  editor       = {Jean Vanderdonckt and
                  Nuno Jardim Nunes and
                  Charles Rich},
  title        = {An intelligent assistant for interactive workflow composition},
  booktitle    = {Proceedings of the 9th International Conference on Intelligent User
                  Interfaces, {IUI} 2004, Funchal, Madeira, Portugal, January 13-16,
                  2004},
  pages        = {125--131},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/964442.964466},
  doi          = {10.1145/964442.964466},
  timestamp    = {Tue, 06 Nov 2018 11:07:40 +0100},
  biburl       = {https://dblp.org/rec/conf/iui/KimSG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{tran_interdisciplinary_2004,
	address = {Orlando, Florida},
	title = {An interdisciplinary approach to the study of battlefield simulation systems},
	booktitle = {Interservice/{Industry} {Training}, {Simulation}, and {Education} {Conference} ({I}/{ITSEC}) 2004},
	author = {Tran, John J. and Curiel, Jacqueline M. and Yao, Ke-Thia},
	month = dec,
	year = {2004},
}

@inproceedings{proc_busso:emotionrecogntion:icmi04,
 address = {State Park, PA},
 author = {Busso, Carlos and Deng, Zhigang and Yildirim, Serdar and Bulut, Murtaza and Lee, Chul Min and Kazemzadeh, Abe and Lee, Sungbok and Neumann, Ulrich and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of the International Conference on Multimodal Interfaces},
 doi = {10.1145/1027933.1027968},
 link = {http://sail.usc.edu/publications/files/Busso_2004.pdf},
 location = {[Ten Year Technical Impact Award, 2014 ICMI]},
 month = {Oct},
 pages = {205-211},
 title = {Analysis of emotion recognition using facial expressions, speech and multimodal information},
 year = {2004}
}

@inproceedings{proc_monatari:interplay:instil04,
 address = {Venice, Italy},
 author = {Montanari, Simona and Yildirim, Serdar and Khurana, Sonia and Landes, Marni and Lawyer, Lewis and Andersen, Elaine and Narayanan, Shrikanth S.},
 bib2html_rescat = {care},
 booktitle = {Proceedings of the InSTIL/ICALL Symposium},
 link = {http://sail.usc.edu/publications/files/montanari_instill_2004.pdf},
 month = {Jun},
 title = {Analyzing the interplay between spoken language and gestural cues in conversational child-machine interactions in pre/early literate age group},
 year = {2004}
}

@inproceedings{DBLP:conf/lcn/StathopoulosKEHZ04,
  author       = {Thanos Stathopoulos and
                  Rahul Kapur and
                  Deborah Estrin and
                  John S. Heidemann and
                  Lixia Zhang},
  title        = {Application-Based Collision Avoidance in Wireless Sensor Networks},
  booktitle    = {29th Annual {IEEE} Conference on Local Computer Networks {(LCN} 2004),
                  16-18 November 2004, Tampa, FL, USA, Proceedings},
  pages        = {506--514},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/LCN.2004.24},
  doi          = {10.1109/LCN.2004.24},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lcn/StathopoulosKEHZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@InProceedings{Krishnamachari04a,
	author = "Bhaskar Krishnamachari and John Heidemann",
	title = 	"Application-specific Modelling of Information
                         Routing in Sensor Networks",
	booktitle = 	"Proceedings of the " # "IEEE International on Performance, Computing, and Communications Conference",
	year = 		2004,
	sortdate = "2004-04-01",
	project = "ilense, scadds",
	jsubject = "sensornet_data_dissemination",
	publisher =	"IEEE",
	address =	"Phoenix, Arizona, USA",
	month =		apr,
	pages =		"717--722",
	location =	"johnh: pafile",
	keywords =	"diffusion, trade-offs",
	otherurl =	"http://ieeexplore.ieee.org/iel5/9115/28907/01301184.pdf?isNumber=28907&prod=STD&arnumber=1301184&arNumber=1301184&arSt=+717&ared=+722&arAuthor=+Krishnamachari%2C+B.%3B++Heidemann%2C+J.",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Krishnamachari04a.html",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Krishnamachari04a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "IEEE",
	copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	abstract = "
Sensor network applications have a diverse set of requirements--some
involve extraction of sensor data to a single point, others exploit
sensor-to-sensor communication; some employ long-lasting data streams
while connections in others are mainly ephemeral. Different variants
of the directed diffusion routing protocol--pull-based, push-based and
hybrid rendezvous-based--have been developed, along with in-network
processing and geographic routing techniques. However, there has been
no prior systematic study comparing their performance with respect to
the diverse application characteristics.  In this paper, we develop
novel abstract parameterized models for traffic and topology that can
incorporate data aggregation and geographic scoping. Using these
models, we mathematically analyze the performance of these routing
techniques across a range of application scenarios (with varying
numbers of nodes, sources, sinks, data settings etc.). Besides
quantifying the conditions under which the different routing
algorithms outperform each other, we obtain a number of useful design
insights. Our analysis shows that algorithms mismatched to
applications can result in drastically poor performance; demonstrates
the desirability of reducing flooded interest and exploratory messages
when data aggregation is used; and suggests that it may be difficult
to implement efficient hybrid schemes because their performance is
very sensitive to the optimal placement of rendezvous points.
",
}

Sensor network applications have a diverse set of requirements–some involve extraction of sensor data to a single point, others exploit sensor-to-sensor communication; some employ long-lasting data streams while connections in others are mainly ephemeral. Different variants of the directed diffusion routing protocol–pull-based, push-based and hybrid rendezvous-based–have been developed, along with in-network processing and geographic routing techniques. However, there has been no prior systematic study comparing their performance with respect to the diverse application characteristics. In this paper, we develop novel abstract parameterized models for traffic and topology that can incorporate data aggregation and geographic scoping. Using these models, we mathematically analyze the performance of these routing techniques across a range of application scenarios (with varying numbers of nodes, sources, sinks, data settings etc.). Besides quantifying the conditions under which the different routing algorithms outperform each other, we obtain a number of useful design insights. Our analysis shows that algorithms mismatched to applications can result in drastically poor performance; demonstrates the desirability of reducing flooded interest and exploratory messages when data aggregation is used; and suggests that it may be difficult to implement efficient hybrid schemes because their performance is very sensitive to the optimal placement of rendezvous points.

@InProceedings{ambite2004:dgo-sd,
  author = 	 {Jos\'{e}  Luis Ambite and Genevieve Giuliano and Peter Gordon and
Andreas Harth and Karanbir Jassar and Qisheng Pan and LanLan Wang},
  title = 	 {Argos: An Ontology and Web Service Composition Infrastructure for Goods Movement Analysis},
  booktitle = {Proceedings of the 5th Annual National Conference on Digital Government Research (dg.o2004)},
  year = 	 {2004},
  urlPaper="http://www.isi.edu/~ambite/ambite-dgo2004-sd.pdf",
  address = 	 {Seattle, Washington},
  note = 	 {System Demonstration},
}

@InProceedings{ambite2004:dgo-po,
  author = 	 {Jos\'{e}  Luis Ambite and Genevieve Giuliano and Peter Gordon and
Andreas Harth and LanLan Wang and Qisheng Pan and Stefan Decker},
  title = 	 {Argos: Dynamic Composition of Web Services for Goods Movement Analysis and Planning},
  booktitle = {Proceedings of the 5th Annual National Conference on Digital Government Research (dg.o2004)},
  year = 	 {2004},
  urlPaper = {http://www.isi.edu/~ambite/ambite-dgo2004-ph.pdf},
  address = 	 {Seattle, Washington},
  note = 	 {Project Highlight},
}

@inproceedings{DBLP:conf/aaai/TuchindaTGD04,
  author       = {Rattapoom Tuchinda and
                  Snehal Thakkar and
                  Yolanda Gil and
                  Ewa Deelman},
  editor       = {Deborah L. McGuinness and
                  George Ferguson},
  title        = {Artemis: Integrating Scientific Data on the Grid},
  booktitle    = {Proceedings of the Nineteenth National Conference on Artificial Intelligence,
                  Sixteenth Conference on Innovative Applications of Artificial Intelligence,
                  July 25-29, 2004, San Jose, California, {USA}},
  pages        = {892--899},
  publisher    = {{AAAI} Press / The {MIT} Press},
  year         = {2004},
  timestamp    = {Wed, 21 Jul 2004 09:49:06 +0200},
  biburl       = {https://dblp.org/rec/conf/aaai/TuchindaTGD04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@Article{	  gil2004ai,
  Author	= {Yolanda Gil and Ewa Deelman and Jim Blythe and Carl
		  Kesselman and Hongsuda Tangmurarunkit},
  URL		= {http://pegasus.isi.edu/publications/ewa/ieee_is04.pdf},
  Title		= {Artificial Intelligence and Grids: Workflow Planning and
		  Beyond},
  Journal	= {IEEE Intelligent Systems},
  Month		= {January},
  Year		= {2004}
}

@article{blythe_is_04,
  author = {Yolanda Gil and Ewa Deelman and Jim Blythe and Carl Kesselman and Hongsuda Tangmunarunkit},
  title = {Artificial Intelligence and Grids: Workflow Planning and Beyond},
  booktitle = {IEEE Intelligent Systems},
  year = {2004}
  }

@inproceedings{proc_deng:headmotion:etp2004,
 address = {New York, NY},
 author = {Deng, Zhigang and Busso, Carlos and Narayanan, Shrikanth S. and Neumann, Ulrich},
 booktitle = {Proceedings of the ACM SIGMM Effective Telepresence Workshop (ETP)},
 doi = {10.1145/1026776.1026784},
 keyword = {audio-based, computer graphics, data-driven, facial animation, head motion synthesis, K nearest neighbor, keyframing control, telepresence systems},
 link = {http://sail.usc.edu/publications/files/dengetp2004.pdf},
 month = {Oct},
 pages = {24-30},
 publisher = {ACM Press},
 title = {Audio-based head motion synthesis for avatar-based telepresence systems},
 year = {2004}
}

@inproceedings{proc_deng:expression:casa2004,
 address = {Geneva, Switzerland},
 author = {Deng, Zhigang and Bulut, Murtaza and Neumann, Ulrich and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of the IEEE Computer Animation and Social Agents (CASA)},
 link = {http://sail.usc.edu/publications/files/10.1.1.74.1239.pdf},
 month = {Jul},
 pages = {267-274},
 publisher = {IEEE Press},
 title = {Automatic dynamic expression synthesis for speech animation},
 year = {2004}
}

@article{DBLP:journals/expert/BlytheDG04,
  author       = {Jim Blythe and
                  Ewa Deelman and
                  Yolanda Gil},
  title        = {Automatically Composed Workflows for Grid Environments},
  journal      = {{IEEE} Intell. Syst.},
  volume       = {19},
  number       = {4},
  pages        = {16--23},
  year         = {2004},
  url          = {https://doi.org/10.1109/MIS.2004.24},
  doi          = {10.1109/MIS.2004.24},
  timestamp    = {Tue, 16 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/expert/BlytheDG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{chen04:acmgis,
	Author = "Ching-Chien Chen and Craig A. Knoblock and Cyrus Shahabi and Snehal Thakkar and Yao-Yi Chiang",
	Title = "Automatically and Accurately Conflating Orthoimagery and Street Maps",
	BookTitle = "Proceedings of the 12th ACM International Symposium on Advances in Geographic Information Systems (ACM-GIS'04)",
	Year = "2004",
	urlPaper= "http://usc-isi-i2.github.io/papers/chen04-acmgis.pdf",
       	Keywords = {"Map Conflation","Geospatial Integration"},
	}

@TechReport{Stann04a,
	author = 	"Fred Stann and John Heidemann",
	title = 	"BARD: Bayesian-Assisted Resource Discovery In Sensor Networks",
	institution = 	"USC/Information Sciences Institute",
	year = 		2004,
	sortdate = "2004-05-01",
	project = "ilense, scadds, whumls",
	jsubject = "chronological",
	number =	"ISI-TR-2004-593",
	month =		jul,
	location =	"johnh: pafile",
	keywords =	"bard, baysian, diffusion routing",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Stann04a.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Stann04a.pdf",
	otherurl =	"http://www.isi.edu/%7efstann/papers/ISI-TR-2004-593.p",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
Data dissemination in sensor networks requires four components:
resource discovery, route establishment, packet forwarding, and route
maintenance. Resource discovery can be the most costly aspect if
meta-data does not exist to guide the search. Geographic routing can
minimize search cost when resources are defined by location, and
hash-based techniques like data-centric storage can make searching
more efficient, subject to increased storage cost. In general,
however, flooding is required to locate all resources matching a
specification. In this paper, we propose BARD, Bayesian-Assisted
Resource Discovery, an approach that optimizes resource discovery in
sensor networks by modelling search and routing as a stochastic
process.  BARD exploits the attribute structure of diffusion and prior
routing history to avoid flooding for similar queries. BARD models
attributes as random variables and finds routes to arbitrary value
sets via Bayesian estimation. Results of occasional flooded queries
establish a baseline probability distribution, which is used to focus
additional queries. Since this process is probabilistic and
approximate, even partial matches from prior searches can still reduce
the scope of search. We evaluate the benefits of BARD by extending
directed diffusion and examining control overhead with and without our
Bayesian filter. These simulations demonstrate a 28\% to 73\%
reduction in control traffic, depending on the number and locations of
sources and sinks.
",
}

Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the most costly aspect if meta-data does not exist to guide the search. Geographic routing can minimize search cost when resources are defined by location, and hash-based techniques like data-centric storage can make searching more efficient, subject to increased storage cost. In general, however, flooding is required to locate all resources matching a specification. In this paper, we propose BARD, Bayesian-Assisted Resource Discovery, an approach that optimizes resource discovery in sensor networks by modelling search and routing as a stochastic process. BARD exploits the attribute structure of diffusion and prior routing history to avoid flooding for similar queries. BARD models attributes as random variables and finds routes to arbitrary value sets via Bayesian estimation. Results of occasional flooded queries establish a baseline probability distribution, which is used to focus additional queries. Since this process is probabilistic and approximate, even partial matches from prior searches can still reduce the scope of search. We evaluate the benefits of BARD by extending directed diffusion and examining control overhead with and without our Bayesian filter. These simulations demonstrate a 28% to 73% reduction in control traffic, depending on the number and locations of sources and sinks.

@inproceedings{knoblock04:enter,
  author = "Craig A. Knoblock",
  title = "Building Software Agents for Planning, Monitoring, and Optimizing Travel",
  booktitle = "Information and Communication Technologies in Tourism 2004: Proceedings of the Eleventh International Conference on Information Technology and Travel \& Tourism",
  publisher = "Springer-Verlag, New York",
  editor = "Andrew J. Frew",
  year = 2004,
  pages = "1-15",
  urlPresentation= "http://usc-isi-i2.github.io/slides/knoblock04-enter-slides.pdf",
  urlPaper= "http://usc-isi-i2.github.io/papers/knoblock04-enter.pdf",
  Keywords = {"Information Agents"}
  } 

@incollection{Lerman02nasa,
  author =       "Kristina Lerman and Aram Galstyan",
  editor =       "Kagan Tumer and David Wolpert",
  title =        "Collectives and Design of Complex Systems",
  chapter =      "Two Paradigms for the Design of Artificial Collectives",
  pages =        "231--256",
  publisher =    "Springer Verlag",
  year =         "2004",
  volume =       "",
  number =       "",
  series =       "",
  address =      "New York",
  annote = "NASA-Ames August 2002 workshop",
  keywords =    {multi-agent-systems},
}

@inproceedings{proc_tsuzuki:emotionalspeechsynthesis:icslp04,
 address = {Jeju Island, Korea},
 author = {Tsuzuki, Ryosuke and Zen, Heiga and Tokuda, Keiichi and Kitamura, Tadashi and Bulut, Murtaza and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/tsuzuki_icslp_2004.pdf},
 month = {Oct},
 pages = {1185-1188},
 title = {Constructing emotional speech synthesizers with limited speech database},
 year = {2004}
}

@article{Li2004Content-basedmovieanalysisand,
 author = {Li, Ying and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 bib2html_rescat = {},
 doi = {10.1109/TCSVT.2004.831968},
 journal = {IEEE Transactions on Circuits and Systems for Video Technology},
 link = {http://sail.usc.edu/publications/files/LiCSVT2004.pdf},
 month = {Aug},
 number = {8},
 pages = {1073-1085},
 title = {Content-based movie analysis and indexing based on audiovisual cues},
 volume = {14},
 year = {2004}
}

@inproceedings{proc_panayiotis:persiantrancripts:icslp04,
 address = {Jeju Island, Korea},
 author = {Georgiou, Panayiotis and Mehr, Hooman Shirani and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/georgiouinterspeech2004.pdf},
 month = {Oct},
 pages = {853-856},
 title = {Context dependent statistical augmentation of Persian transcripts},
 year = {2004}
}

@inproceedings{proc_belvin:doctorpatientdialogue:lrec04,
 address = {Lisbon, Portugal},
 author = {Belvin, Robert and May, Win and Narayanan, Shrikanth S. and Georgiou, Panayiotis and Ganjavi, Shadi},
 booktitle = {Proceedings of the International Conference on Language Resources and Evaluation (LREC)},
 link = {http://sail.usc.edu/publications/files/belvinlrec2004.pdf},
 month = {May},
 title = {Creation of a doctor-patient dialogue corpus using standardized patients},
 year = {2004}
}

@InProceedings{Wang04d,
	author = 	"Xi Wang and Fabio Silva and John Heidemann",
	title = 	"Demo Abstract: Follow-Me Application---Active Visitor Guidance System",
	booktitle = 	"Proceedings of the " # "Second" # " ACM {SenSys} Conference ",
	year = 		2004,
	sortdate = "2004-11-01",
	project = "ilense, whumls, surese",
	jsubject = "sensornet_general",
	publisher =	"ACM",
	address =	"Baltimore, Maryland, USA",
	month =		nov,
	xpages =	"xxx",
	location =	"johnh: pafile",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Wang04d.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Wang04d.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "ACM",
	copyrightterms = "Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ",
	abstract = "
(no abstract) This abstract describes the
``follow-me'' application of sensor networks that was demonstrated at
Sensys 2004.
",
}

(no abstract) This abstract describes the ``follow-me'' application of sensor networks that was demonstrated at Sensys 2004.

@INPROCEEDINGS{French200406,
Author = {French, Matthew and Graham, Paul and Wirthlin, Michael and Larchev, Greg and Bellows, Peter},
Booktitle = {NASA Earth Science Technology Conference},
Title = { Design Tools for Reconfigurable Hardware in Orbit (RHinO) },
year = {2004},
month = {June},
keywords={power; reliability; FPGA},
isbn = { 0-9785223-5-4},
address = {Palo Alto, CA},
}

@TechReport{Chen04a,
	author = 	"Xuan Chen and John Heidemann",
	title = 	"Detecting Early Worm Propagation through Packet Matching",
	institution = 	"USC/Information Sciences Institute",
	year = 		2004,
	sortdate = 		"2004-02-01",
	project = "ant, saman, conser",
	jsubject =  "network_security",
	number =	"ISI-TR-2004-585",
	month =		feb,
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"DEWP, worm propagation, NEWS",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chen04a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Chen04a.pdf",
	copyrightholder = "authors",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
In this paper, we present DEWP, a router-based system designed to
automatically detect and quarantine Internet worm propagation. DEWP
detects worm probing traffic by matching destination port numbers
between incoming and outgoing connections. This approach does not
require knowledge of worm packet contents or profiles of normal
traffic conditions; it can automatically detect and suppress worms due
to their unusual traffic patterns.  We describe how DEWP works and
evaluate its performance with simulations. We study the speed of
detection and the effectiveness of vulnerable host protection relative
to factors including worm scanning techniques, DEWP deployment
coverage and detection intervals. We also investigate false detections
with network trace playback. We show that DEWP detects worm
propagation within about 4 seconds. By blocking worm probing traffic
automatically, DEWP can protect more than 99\% hosts from
random-scanning worms.
",
}

In this paper, we present DEWP, a router-based system designed to automatically detect and quarantine Internet worm propagation. DEWP detects worm probing traffic by matching destination port numbers between incoming and outgoing connections. This approach does not require knowledge of worm packet contents or profiles of normal traffic conditions; it can automatically detect and suppress worms due to their unusual traffic patterns. We describe how DEWP works and evaluate its performance with simulations. We study the speed of detection and the effectiveness of vulnerable host protection relative to factors including worm scanning techniques, DEWP deployment coverage and detection intervals. We also investigate false detections with network trace playback. We show that DEWP detects worm propagation within about 4 seconds. By blocking worm probing traffic automatically, DEWP can protect more than 99% hosts from random-scanning worms.

@TechReport{Silva04a,
	author = 	"Fabio Silva and John Heidemann and Ramesh Govindan and Deborah Estrin",
	title = 	"Directed Diffusion",
	institution = 	"USC/Information Sciences Institute",
	year = 		2004,
	sortdate = "2004-01-01",
	project = "ilense, scadds",
	jsubject = "sensornet_data_dissemination",
	number =	"ISI-TR-2004-586",
	month =		jan,
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	note =		"To appear in \emph{Frontiers in Distributed
                         Sensor Networks}, S. S. Iyengar and R. R. Brooks, eds.",
	keywords =	"directed diffusion, sensor networks, in [Iyengar05a]",
	copyrightholder = "authors",
	myorganization =	"USC/Information Sciences Institute",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Silva04a.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Silva04a.pdf",
	abstract = "(No formal abstract, but:  This paper is an
                         overview of directed diffusion.)",
}

(No formal abstract, but: This paper is an overview of directed diffusion.)

@article{hussain2004distinguishing,
  title={Distinguishing between single and multi-source attacks using signal processing},
  author={Hussain, Alefiya and Heidemann, John and Papadopoulos, Christos},
  journal={Computer Networks},
  volume={46},
  number={4},
  pages={479--503},
  year={2004},
  publisher={Elsevier}
}

@InProceedings{Galstyan04ipsn,
  author =       "Aram Galstyan and Bhaskar Krishnamachari and Sundeep Pattem and Kristina Lerman",
  title =        "{Distributed Online Localization in Sensor Networks Using a Moving Target}",
  month={apr},
  year =         "2004",
  booktitle =    "Information Processing in Sensor Networks (IPSN-2004), Berkeley, CA",
  pages =        "",
  keywords =    {multi-agent-systems},
}

@inproceedings{proc_lee:emotionreco:icslp04,
 address = {Jeju Island, Korea},
 author = {Lee, Chul Min and Yildirim, Serdar and Bulut, Murtaza and Kazemzadeh, Abe and Busso, Carlos and Deng, Zhigang and Lee, Sungbok and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of InterSpeech},
 keyword = {EMOTION},
 link = {http://sail.usc.edu/publications/files/LeeInterSpeech2004.pdf},
 month = {Oct},
 pages = {889-892},
 title = {Emotion recognition based on phoneme classes},
 year = {2004}
}

@TechReport{Heidemann04c,
	author = 	"John Heidemann and Wei Ye",
	title = 	"Energy Conservation in Sensor Networks at the Link and Network Layers",
	institution = 	"USC/Information Sciences Institute",
	year = 		2004,
	sortdate = 		"2004-11-01",
	project = "ilense, macss",
	jsubject = "sensornet_general",
	month = nov,
	number =	"ISI-TR-2004-599",
	note =	"book chapter to appear in \emph{Wireless Sensor
                         Networks: A Systems Perspective}, Nirupama Bulusu and Sanjay Jha (editors), Artech House, 2005",
	keywords =	"sensor network overview, energy conservation overview",
	location =	"johnh: pafile",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann04c.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann04c.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
This chapter surveys network-level approaches to conserve energy in
sensor networks. We consider protocols for transmission power control,
media access control, topology control, and energy-aware routing,
surveying relevant literature and describing approaches that have been
considered.
",
}

This chapter surveys network-level approaches to conserve energy in sensor networks. We consider protocols for transmission power control, media access control, topology control, and energy-aware routing, surveying relevant literature and describing approaches that have been considered.

@TechReport{Li04b,
	author = 	"Yuan Li and Wei Ye and John Heidemann",
	title = 	"Energy and Latency Control in Low Duty Cycle {MAC} Protocols",
	institution = 	"USC/Information Sciences Institute",
	year = 		2004,
	sortdate = "2007-05-01",
	project = "ilense, macss, cisoft",
	jsubject = "sensornet_subtransport",
	number =	"ISI-TR-2004-595",
	month =		sep,
	location =	"johnh: folder: pafile",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Li04b.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Li04b.pdf",
	otherurl = "http://www-scf.usc.edu/%7eyuanl/myresearch/smac_schedules.pdf",
	copyrightholder = "authors",
	myorganization = 	"USC/Information Sciences Institute",
	abstract = "
Recently, several MAC protocols such as S-MAC and T-MAC have exploited
scheduled sleep/wakeup cycles to conserve energy in sensor
networks. Until now, most protocols have assumed all nodes in the
network were configured to follow the same schedule, or they assumed
border nodes would follow multiple schedules, but did not evaluate
those cases. This paper develops two new algorithms to control and
exploit the presence of multiple schedules to reduce energy
consumption and latency. The first one is
the \emph{global schedule algorithm} (GSA).
Through experiments, we demonstrate that, because of
radio propagation vagaries, large sensor networks have very ragged,
overlapping borders where many nodes listen to two or more
schedules. GSA is a fully distributed algorithm that allows a large
network to converge on a single global schedule to conserve
energy. Secondly, we demonstrate that strict schedules incur a latency
penalty in a multi-hop network when packets must wait for the next
schedule for transmission.  To reduce latency in multi-hop paths we
develop the \emph{fast path algorithm} (FPA). FPA provides fast data
forwarding paths by adding additional wake-up periods on the nodes
along paths from sources to sinks. We evaluate both algorithms through
experiments on Berkeley motes and demonstrate that the protocols
accomplish their goals of reducing energy consumption and latency in
large sensor networks.
",
}

Recently, several MAC protocols such as S-MAC and T-MAC have exploited scheduled sleep/wakeup cycles to conserve energy in sensor networks. Until now, most protocols have assumed all nodes in the network were configured to follow the same schedule, or they assumed border nodes would follow multiple schedules, but did not evaluate those cases. This paper develops two new algorithms to control and exploit the presence of multiple schedules to reduce energy consumption and latency. The first one is the \emphglobal schedule algorithm (GSA). Through experiments, we demonstrate that, because of radio propagation vagaries, large sensor networks have very ragged, overlapping borders where many nodes listen to two or more schedules. GSA is a fully distributed algorithm that allows a large network to converge on a single global schedule to conserve energy. Secondly, we demonstrate that strict schedules incur a latency penalty in a multi-hop network when packets must wait for the next schedule for transmission. To reduce latency in multi-hop paths we develop the \emphfast path algorithm (FPA). FPA provides fast data forwarding paths by adding additional wake-up periods on the nodes along paths from sources to sinks. We evaluate both algorithms through experiments on Berkeley motes and demonstrate that the protocols accomplish their goals of reducing energy consumption and latency in large sensor networks.

@inproceedings{proc_naveen:distributedspeechreco:icassp04,
 address = {Montreal, Canada},
 author = {Srinivasamurthy, Naveen and Ortega, Antonio and Narayanan, Shrikanth S.},
 booktitle = {Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},
 doi = {10.1109/icassp.2004.1326028},
 link = {http://sail.usc.edu/publications/files/SrinivasamurthyICASSP2004.pdf},
 month = {May},
 pages = {485-488},
 title = {Enhanced standard compliant distributed speech recognition (AURORA encoder) using rate allocation},
 year = {2004}
}

@InProceedings{Son04a,
	author = 	"Dongjin Son and Bhaskar Krishnamachari and John Heidemann",
	title = 	"Experimental study of the effects of Transmission Power Control and Blacklisting in Wireless Sensor Networks",
	booktitle = 	"Proceedings of the " # "First" # " IEEE Conference on Sensor and Adhoc Communication and Networks ",
	year = 		2004,
	sortdate = "2004-10-01",
	project = "ilense, macss",
	jsubject = "sensornet_subtransport",
	publisher =	"IEEE",
	address =	"Santa Clara, California, USA",
	month =		oct,
	pages =		"289--298",
	location =	"johnh: pafile",
	keywords =	"blacklisting, power transmission control,
                         sensor network",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Son04a.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Son04a.pdf",
	copyrightholder = "IEEE",
	copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	abstract = "
We experimentally investigate the impact of variable
transmission power on link quality, and propose variable power link
quality control techniques to enhance the performance of data delivery
in wireless sensor networks. This study extends the state of the art
in two key respects: first, while there are a number of previous
results on power control techniques for wireless ad hoc and sensor
networks, to our knowledge nearly all of them have been simulation or
analytical studies that assume idealized link conditions; second,
while there are several recent experimental studies that have shown
the prevalence of non-ideal unreliable communication links in sensor
networks, these have not thoroughly investigated the impact of
variable transmission power. We perform a systematic set of
experiments to analyze how transmission power changes affect the
quality of low power RF wireless links between nodes. These
experiments show how significant variation in link qualities occur in
real-world deployments and how these effects strongly influence the
effectiveness of transmission power control. We then present a
packet-based transmission power control mechanism that incorporates
blacklisting to enhance link reliability while minimizing
interference. The effectiveness of the proposed scheme is demonstrated
via testbed experiments.
",
}

We experimentally investigate the impact of variable transmission power on link quality, and propose variable power link quality control techniques to enhance the performance of data delivery in wireless sensor networks. This study extends the state of the art in two key respects: first, while there are a number of previous results on power control techniques for wireless ad hoc and sensor networks, to our knowledge nearly all of them have been simulation or analytical studies that assume idealized link conditions; second, while there are several recent experimental studies that have shown the prevalence of non-ideal unreliable communication links in sensor networks, these have not thoroughly investigated the impact of variable transmission power. We perform a systematic set of experiments to analyze how transmission power changes affect the quality of low power RF wireless links between nodes. These experiments show how significant variation in link qualities occur in real-world deployments and how these effects strongly influence the effectiveness of transmission power control. We then present a packet-based transmission power control mechanism that incorporates blacklisting to enhance link reliability while minimizing interference. The effectiveness of the proposed scheme is demonstrated via testbed experiments.

@inproceedings{bakshi04:acmgis,
	Author = "Rahul Bakshi and Craig A. Knoblock and Snehal Thakkar",
	Title = "Exploiting Online Sources to Accurately Geocode Addresses",
	BookTitle = "Proceedings of the 12th ACM International Symposium on Advances in Geographic Information Systems (ACM-GIS'04)",
	Year = "2004",
	urlPaper= "http://usc-isi-i2.github.io/papers/bakshi04-acmgis.pdf",
       	Keywords = {"Geocoding"} }

@inproceedings{michalowski04:iiweb,
   Author = "Martin Michalowski and Snehal Thakkar and Craig A. Knoblock",
   Title = "Exploiting Secondary Sources for Unsupervised Record Linkage",
   BookTitle = "Proceedings of the 2004 VLDB Workshop on Information Integration on the Web",
   Year = "2004",
   urlPaper= "http://usc-isi-i2.github.io/papers/michalowski04-vldbwkshp.pdf",
    Keywords = {"Record Linkage"} }

@InBook{Silva04b,
	author =	"Fabio Silva and John Heidemann and Ramesh Govindan and Deborah Estrin",
	title = "Frontiers in Distributed Sensor Networks",
	chapter = 	"Directed Diffusion",
	publisher = 	"CRC Press, Inc.",
	year = 		2004,
	sortdate = "2004-10-01",
	project = "ilense, scadds",
	jsubject = "chronological",
	address =	"Boca Raton, Florida, USA",
	note = "refernece is superseded by [Silva05a]",
	month =		oct,
	pages =		"to appear",
	editor =		"S. S. Iyengar and R. R. Brooks",
	location =	"johnh: not on file",
	keywords = "directed diffusion, sensor networks, in [Iyengar05a]",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Silva04b.html",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "Artech House, Inc.",
	availability = {
This paper is available only as a chapter in the book \emph{Frontiers in Distributed Sensor Networks}, S. S. Iyengar and R. R. Brooks, editors.
A <a href="Silva04a.html">similar but different version</a>
is available electronically.
},
	abstract = "(No formal abstract, but:  This paper is an
                         overview of directed diffusion.)",
}

(No formal abstract, but: This paper is an overview of directed diffusion.)

@article{ editor-ieee-is-04,
 title = {Guest Editor\textquotesingle s Introduction to the Special Issue on e-Science},
 author = {David DeRoure and Yolanda Gil and Jim Hendler (Eds)},
 journal = {IEEE Intelligent Systems},
 year = {2004},
 url = {http://csdl.computer.org/comp/mags/ex/2004/01/x1024.pdf }
 }

@InBook{Heidemann04b,
	author =	"John Heidemann and Ramesh Govindan",
	title = 	"Handbook of Networked and Embedded Control Systems",
	chapter = 	"Embedded Sensor Networks",
	publisher = 	"Springer-Verlag",
	year = 		2004,
	sortdate = 		"2004-10-01",
	project = "ilense, nocredit",
	jsubject = "chronological",
	pages =		"721--738",
	xeditor =		"D. Hristu-Varsakelis and W.S. Levine",
	location =	"johnh: pafile",
	keywords =	"sensor network overview, CS551-SP2006,
                  CS551-SP2005, CS551-SP2010-supp",
	note = "This reference is superseded by [Heidemann05c]",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann04b.html",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "Springer-Verlag",
	availability = {
This paper is available only as a chapter in the book \emph{Handbook
of Networked and Embedded Control Systems}, D. Hristu-Varsakelis and
W.S. Levine, editors.
A <a href="Heidemann04a.html">similar but different version</a>
is available electronically.
},
	abstract = "
No formal abstract, but this book chapter provides an overview of embedded
sensor networks, including hardware platforms, software and protocols,
and applications.
",
}

No formal abstract, but this book chapter provides an overview of embedded sensor networks, including hardware platforms, software and protocols, and applications.

@Article{ambite2004:heracles,
  author = 	 {Jos\'{e} Luis Ambite and Craig A. Knoblock and Maria Muslea and Steven Minton},
  title = 	 {Heracles {II}: Conditional Constraint Networks for Interleaved Planning and Information Gathering},
  journal = 	 {IEEE Intelligent Systems},
  year = 	 {2004},
}

@inproceedings{DeAngelis2004,
address = {Notre Dame, Indiana},
author = {DeAngelis, David and Okojie, Robert},
booktitle = {The TMS 46th Electronic Materials Conference (EMC 2004)},
file = {:home/dave/Documents/References/DeAngelis, Okojie - 2004 - In-Situ Characterization of Ohmic Contacts to N-Type SiC Under High Temperature and Current.pdf:pdf},
title = {In-Situ Characterization of Ohmic Contacts to N-Type SiC Under High Temperature and Current},
url = {https://www.tms.org/Meetings/Specialty/EMC04/EMC04-pdfs.html},
year = {2004}
}

@inproceedings{DBLP:conf/www/BlytheG04,
  author       = {Jim Blythe and
                  Yolanda Gil},
  editor       = {Stuart I. Feldman and
                  Mike Uretsky and
                  Marc Najork and
                  Craig E. Wills},
  title        = {Incremental formalization of document annotations through ontology-based
                  paraphrasing},
  booktitle    = {Proceedings of the 13th international conference on World Wide Web,
                  {WWW} 2004, New York, NY, USA, May 17-20, 2004},
  pages        = {455--461},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/988672.988734},
  doi          = {10.1145/988672.988734},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/www/BlytheG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@InProceedings{Wang04c,
	author = 	"Xi Wang and Fabio Silva and John Heidemann",
	title = 	"Infrastructureless Location Aware Configuration for Sensor Networks",
	booktitle = 	"IEEE Workshop on Mobile Computing Systems and Applications",
	year = 		2004,
	sortdate = "2004-12-01",
	project = "ilense, whumls, surese",
	jsubject = "sensornet_general",
	publisher =	"IEEE",
	address =	"English Lake District, United Kingdom",
	month =		dec,
	pages =		"174--183",
	location =	"johnh: pafile",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Wang04c.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Wang04c.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "IEEE",
	copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	abstract = "
In large sensor networks nodes must self-configure their
communication, location, and other characteristics. GPS and similar
systems determine location today, but they require substantial
infrastructure in the environment or on sensor nodes to locate nodes
in a physical coordinate system. For many applications, \emph{logical}
location---the relationhip of nodes with each other and their
environment---can be more important than physical location. For
example, distance along a road and presence of intersections may be
more relevant than Euclidean coordinates for applications that track
or guide drivers. In this paper we present a novel algorithm,
\emph{deployment order}, for logical location determination. Deployment order
exploits node deployment patterns and simple user interactions to
define logical topologies in a completely distributed manner. With
minimal user interaction it can establish arbitrarily complex logical
topologies. We illustrate the algorithm through the ``follow-me''
application, which is an easy-to-deploy sensornet guidance system
suitable for use in office buildings as well as inhospitable
environments (underground, in damaged buildings, etc.). Finally, we
demonstrate how the addition of landmarks allows the conversion from
logical locations to approximate physical locations.
",
}

In large sensor networks nodes must self-configure their communication, location, and other characteristics. GPS and similar systems determine location today, but they require substantial infrastructure in the environment or on sensor nodes to locate nodes in a physical coordinate system. For many applications, \emphlogical location—the relationhip of nodes with each other and their environment—can be more important than physical location. For example, distance along a road and presence of intersections may be more relevant than Euclidean coordinates for applications that track or guide drivers. In this paper we present a novel algorithm, \emphdeployment order, for logical location determination. Deployment order exploits node deployment patterns and simple user interactions to define logical topologies in a completely distributed manner. With minimal user interaction it can establish arbitrarily complex logical topologies. We illustrate the algorithm through the ``follow-me'' application, which is an easy-to-deploy sensornet guidance system suitable for use in office buildings as well as inhospitable environments (underground, in damaged buildings, etc.). Finally, we demonstrate how the addition of landmarks allows the conversion from logical locations to approximate physical locations.

@mastersthesis{bakshi04:thesis,
   Author = "Rahul Bakshi",
   Title = "Integrating and Reasoning about Online Sources to Accurately Geocode Addresses",
   School = "Department of Computer Science, University of Southern California",
   Year = "2004",
       	Keywords = {"Geocoding"} }

@InProceedings{Gnawali04a,
	 author = 	"Omprakash Gnawali and Mark Yarvis and John Heidemann and Ramesh Govindan",
	 title = 	"Interaction of Retransmission, Blacklisting, and Routing Metrics for Reliability in Sensor Network Routing",
	 booktitle = 	"Proceedings of the " # "First" # " IEEE Conference on Sensor and Adhoc Communication and Networks ",
	 year = 		2004,
	sortdate = 		"2004-10-01",
	project = "ilense, cens, macss, whumls",
	jsubject = "sensornet_subtransport",
	 publisher =	"IEEE",
	 address =	"Santa Clara, California, USA",
	 month =		oct,
	 pages =		"34--43",
	 location =	"johnh: pafile",
	 keywords =	"ETX, metric-based routing, blacklisting, CS551-SP2006",
	 url =		"http://www.isi.edu/%7ejohnh/PAPERS/Gnawali04a.html",
	 pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Gnawali04a.pdf",
	 copyrightholder = "IEEE",
	 copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	 abstract = "
 Unpredictable and heterogeneous links in a wireless sensor network
 require techniques to avoid low delivery rate and high delivery
 cost. Three commonly used techniques to help discover high quality
 paths include (1) link-layer retransmission, (2) blacklisting bad
 links, and (3) end-to-end routing metrics. Using simulation and
 testbed experiments, we present the first systematic exploration of
 the tradeoffs of combinations of these approaches, quantifying the
 effects of each of these three techniques. We identify several key
 results: One is that per-hop retransmissions (ARQ) is a necessary
 addition to any other mechanism if reliable data delivery is a
 goal. Additional interactions between the services are more
 subtle. First, in a multihop network, either blacklisting or
 reliability metrics like ETX can provide consistent high-reliability
 paths when added to ARQ. Second, at higher deployment densities,
 blacklisting has a lower routing overhead than ETX. But at lower
 densities, blacklisting becomes less stable as the network
 partitions. These results are consistent across both simulation and
 testbed experiments. We conclude that ETX with retransmissions is the
 best choice in general, but that blacklisting may be worth considering
 at higher densities, either with or without ETX.
 ",
}

Unpredictable and heterogeneous links in a wireless sensor network require techniques to avoid low delivery rate and high delivery cost. Three commonly used techniques to help discover high quality paths include (1) link-layer retransmission, (2) blacklisting bad links, and (3) end-to-end routing metrics. Using simulation and testbed experiments, we present the first systematic exploration of the tradeoffs of combinations of these approaches, quantifying the effects of each of these three techniques. We identify several key results: One is that per-hop retransmissions (ARQ) is a necessary addition to any other mechanism if reliable data delivery is a goal. Additional interactions between the services are more subtle. First, in a multihop network, either blacklisting or reliability metrics like ETX can provide consistent high-reliability paths when added to ARQ. Second, at higher deployment densities, blacklisting has a lower routing overhead than ETX. But at lower densities, blacklisting becomes less stable as the network partitions. These results are consistent across both simulation and testbed experiments. We conclude that ETX with retransmissions is the best choice in general, but that blacklisting may be worth considering at higher densities, either with or without ETX.

@misc{dittrich2004internet,
  title={Internet Denial of Service: Attack and Defense Mechanisms},
  author={Dittrich, David and Mirkovic, Jelena and Reiher, Peter and Dietrich, Sven},
  year={2004},
  publisher={Pearson Education}
}

@article{mirkovic2004internet,
  title={Internet Denial of Service: Attack and Defense Mechanisms (Radia Perlman Computer Networking and Security)},
  author={Mirkovic, Jelena and Dietrich, Sven and Dittrich, David and Reiher, Peter},
  year={2004},
  publisher={Prentice Hall PTR}
}

@article{wroclawski2004internet,
	author = {Wroclawski, John},
	title = {Internet Draft David L. Black Document: draft-ietf-rddp-rdma-concerns-01. txt EMC Expires: December 2004 Michael F. Speer Sun},
	year = {2004}}

@InProceedings{Chang04b,
	author = 	"Di-Fa Chang and Ramesh Govindan and John Heidemann",
	title = 	"Locating {BGP} Missing Routes Using Multiple Perspectives",
	booktitle = 	" ACM SIGCOMM Workshop Network Troubleshooting",
	year = 		2004,
	sortdate = 		"2004-09-01", 
	project = "ant, saman, conser, nocredit",
	jsubject = "routing",
	publisher =	"ACM",
	address =	"Portland, Oregon, USA",
	month =		sep,
	pages =		"301--306",
	jlocation =	"johnh: pafile",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chang04b.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Chang04b.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "ACM",
	copyrightterms = "Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ",
	abstract = "
There have been many studies on measuring and interpreting interdomain
routing dynamics. Most of them, however, are based on the approach of
off-line and passive post-processing BGP routing updates.  We propose
a new methodology that uses real-time and active monitoring to
troubleshoot various BGP routing anomalies. This paper focuses on a
specific BGP routing problem---missing routes that occur when some
ASes can reach a prefix while others can't. The idea is to
periodically monitor the BGP routing status at multiple vantage
points, like Route Views, and when a possible missing route event is
detected issue traceroute queries from various looking glasses to
learn of the packet-forwarding path status.  By comparing previous and
current packet-forwarding paths, we can have an idea of where the
missing route event takes place. This paper examines the plausibility
of this methodology and discusses preliminary experimental results.
",
}

There have been many studies on measuring and interpreting interdomain routing dynamics. Most of them, however, are based on the approach of off-line and passive post-processing BGP routing updates. We propose a new methodology that uses real-time and active monitoring to troubleshoot various BGP routing anomalies. This paper focuses on a specific BGP routing problem—missing routes that occur when some ASes can reach a prefix while others can't. The idea is to periodically monitor the BGP routing status at multiple vantage points, like Route Views, and when a possible missing route event is detected issue traceroute queries from various looking glasses to learn of the packet-forwarding path status. By comparing previous and current packet-forwarding paths, we can have an idea of where the missing route event takes place. This paper examines the plausibility of this methodology and discusses preliminary experimental results.

@article{cai2004maan,
  title={Maan: A multi-attribute addressable network for grid information services},
  author={Cai, Min and Frank, Martin and Chen, Jinbo and Szekely, Pedro},
  journal={Journal of Grid Computing},
  volume={2},
  number={1},
  pages={3--14},
  year={2004},
  publisher={Kluwer Academic Publishers}
}

@inproceedings{proc_sethy:measuringconv:icslp04,
 address = {Jeju Island, Korea},
 author = {Sethy, Abhinav and Narayanan, Shrikanth S.},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/SethyInterSpeech2004.pdf},
 month = {Oct},
 pages = {1057-1060},
 title = {Measuring Convergence in Language Model Estimation Using Relative Entropy},
 year = {2004}
}

@article{DBLP:journals/ton/YeHE04,
  author       = {Wei Ye and
                  John S. Heidemann and
                  Deborah Estrin},
  title        = {Medium access control with coordinated adaptive sleeping for wireless
                  sensor networks},
  journal      = {{IEEE/ACM} Trans. Netw.},
  volume       = {12},
  number       = {3},
  pages        = {493--506},
  year         = {2004},
  url          = {https://doi.org/10.1109/TNET.2004.828953},
  doi          = {10.1109/TNET.2004.828953},
  timestamp    = {Thu, 23 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ton/YeHE04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{gates2004more,
  title={More Netflow Tools for Performance and Security.},
  author={Gates, Carrie and Collins, Michael P and Duggan, Michael and Kompanek, Andrew and Thomas, Mark},
  booktitle={LISA},
  volume={4},
  pages={121--132},
  year={2004}
}

@inproceedings{French2004,
	author= {French, Matthew C. and Suh, Jinwoo and Crago, Stephen P. and Damoulakis. John},
	title= {Novel Signal Processing Architectures for Knowledge-based STAP Algorithms},
	booktitle= {IEEE Radar Conference},
	location= {Philadelphia, PA},
	month= {April},
	year= {2004}
}

@INPROCEEDINGS{1316365,
author={French, Matthew and Suh, Jinwoo and Crago, Stephen},
booktitle={Proceedings of the 2004 IEEE Radar Conference (IEEE Cat. No.04CH37509)},
title={Novel Signal Processing Architectures for Knowledge-based STAP Algorithms)},
year={2004},
month={april},
volume={},
number={},
pages={ xxvii+627},
keywords={ GMTI techniques; ISAR techniques; SAR processing techniques; detection techniques; estimation techniques; expert reasoning; knowledge aided sensor signal processing; radar SIGPRO; radar antenna arrays; radar applications; radar imaging; space based technologies; space-time adaptive processing; target tracking; tracking theory; waveform processing; array signal processing; expert systems; knowledge based systems; radar antennas; radar detection; radar imaging; radar signal processing; space-time adaptive processing; synthetic aperture radar; target tracking;},
doi={10.1109/NRC.2004.1316365},
ISSN={1097-5659 },}

@inproceedings{blythe_agc_04,
  author = {Ewa Deelman and Jim Blythe and Yolanda Gil and Carl Kesselman and Gaurang Mehta and S. Patil and M.-H. Su and Karan Vahi and Miron Livny},
  title = {Pegasus: Mapping Scientific Workflows onto the Grid},
  year = {2004},
  booktitle = {Across Grids Conference}
  }

@InProceedings{lerman04:atem,
  author =       "Kristina Lerman and B. Cenk Gazen  and Steven Minton and Craig A. Knoblock",
  title =        "Populating the Semantic Web",
  booktitle =    "Proceedings of the AAAI 2004 Workshop on Advances in Text Extraction and Mining",
  year =         "2004",
  urlPaper= "http://usc-isi-i2.github.io/papers/lerman04-atem.pdf",
  Keywords = {"Wrapper Learning"}
}

@InProceedings{Rajgarhia04a,
	author = 	"Abhishek Rajgarhia and Fred Stann and John Heidemann",
	title = 	"Privacy-Sensitive Monitoring With a Mix of {IR} Sensors and Cameras",
	booktitle = 	"Proceedings of the " # "Second" # " International Workshop on Sensor and Actor Network Protocols and Applications",
	year = 		2004,
	sortdate = "2004-08-01",
	project = "ilense, saman, macss",
	jsubject = "sensornet_general",
	xpublisher =	"ACM",
	address =	"Boston, Massachusetts, USA",
	month =		aug,
	pages =		"21--29",
	location =	"johnh: pafile",
	keywords =	"sensor networks, privacy",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Rajgarhia04a.html",
	pdfurl =	       "http://www.isi.edu/%7ejohnh/PAPERS/Rajgarhia04a.pdf",
	abstract = "
The goal of monitoring an area for security often conflicts
with the inhabitants' right to privacy. This paper argues that
technical choices can be made to balance the privacy-
security tradeoff. We present a privacy-sensitive security
monitoring system which balances privacy and security by
deploying cameras only in public areas and by distributing
information about people's movements in private areas so
that no single computer can track an individual. We show
how this distributed information can be utilized to correlate
an interesting event such as a theft with an image taken by
the cameras deployed at the public areas. We then survey
potential users of our system to evaluate preferences
concerning cameras and motion sensors, and we present
analysis of three alternative locations of storing data.
",
}

The goal of monitoring an area for security often conflicts with the inhabitants' right to privacy. This paper argues that technical choices can be made to balance the privacy- security tradeoff. We present a privacy-sensitive security monitoring system which balances privacy and security by deploying cameras only in public areas and by distributing information about people's movements in private areas so that no single computer can track an individual. We show how this distributed information can be utilized to correlate an interesting event such as a theft with an image taken by the cameras deployed at the public areas. We then survey potential users of our system to evaluate preferences concerning cameras and motion sensors, and we present analysis of three alternative locations of storing data.

@inproceedings{proc_montanari:chidrencomputerspeech:icslp04,
 address = {Jeju Island, Korea},
 author = {Montanari, Simona and Yildirim, Serdar and Andersen, Elaine and Narayanan, Shrikanth S.},
 bib2html_rescat = {bsp},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/montanariinterspeech2004.pdf},
 month = {Oct},
 pages = {1841-1844},
 title = {Reference marking in childrens computer-directed speech: An integrated analysis of discourse and gesture},
 year = {2004}
}

@InProceedings{Galstyan04aamas,
  author =       "Aram Galstyan and Karl Czajkowski and Kristina Lerman",
  title =        "{Resource Allocation in the Grid Using Reinforcement Learning}",
  year =         "2004",
  month="Jul",
  booktitle =    "Proceedings of International Conference on Autonomous Agents and Multi-Agent Systems ({AAMAS}-2004) (poster), New York, NY",
  pages =        "1314-1315",
  keywords =    {multi-agent-systems},
}

@article{michalowski2004b,
   Author = "Martin Michalowski and  Jos\'{e} Luis Ambite and  Craig A. Knoblock and  Steve Minton and  Snehal Thakkar and Rattapoom Tuchinda",
   Title = "Retrieving and Semantically Integrating Heterogeneous Data from the Web",
   Journal = "IEEE Intelligent Systems",
   Volume="19",
   Number="3",
   urlPaper="http://www.isi.edu/%7Emartinm/Papers/IntelligentSystems04.pdf",
   Year = "2004" }

@article{michalowski2004:is,
   Author = "Martin Michalowski and Jos\'{e} Luis Ambite and  Snehal Thakkar and Rattapoom Tuchinda and Craig A. Knoblock and Steve Minton",
   Title = "Retrieving and Semantically Integrating Heterogeneous Data from the Web",
   Journal = "IEEE Intelligent Systems",
   Volume="19",
   Number="3",
   Year = "2004",
   urlPaper= "http://usc-isi-i2.github.io/papers/michalowski04-is.pdf",
   Keywords = {"Data Integration"}}

@inproceedings{proc_kyujeong:robustspeechreco:icslp04,
 address = {Jeju Island, Korea},
 author = {Han, Kyu Jeong and Srinivasamurthy, Naveen and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of InterSpeech},
 doi = {},
 link = {http://sail.usc.edu/publications/files/HanInterSpeech2004[2].pdf},
 month = {Oct},
 pages = {621-624},
 title = {Robust speech recognition over packet networks: An overview},
 year = {2004}
}

@article{DBLP:journals/tecs/BulusuHET04,
  author       = {Nirupama Bulusu and
                  John S. Heidemann and
                  Deborah Estrin and
                  Tommy Tran},
  title        = {Self-configuring localization systems: Design and Experimental Evaluation},
  journal      = {{ACM} Trans. Embed. Comput. Syst.},
  volume       = {3},
  number       = {1},
  pages        = {24--60},
  year         = {2004},
  url          = {https://doi.org/10.1145/972627.972630},
  doi          = {10.1145/972627.972630},
  timestamp    = {Tue, 08 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tecs/BulusuHET04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{proc_farhad:speakerid:icassp04,
 address = {Montreal, Canada},
 author = {Farahani, Farhad and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},
 doi = {https://doi.org/10.1109/icassp.2004.1325929},
 link = {http://sail.usc.edu/publications/files/FarahaniICASSP2004.pdf},
 month = {May},
 pages = {89-92},
 title = {Speaker identification using supra-segmental pitch pattern dynamics},
 year = {2004}
}

@inproceedings{proc_soonil:speakermodelquant:icslp04,
 address = {Jeju Island, Korea},
 author = {Kwon, Soonil and Narayanan, Shrikanth S.},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/kwon_interspeech_2004.pdf},
 month = {Oct},
 pages = {1517-1520},
 title = {Speaker model quantization for unsupervised speaker indexing},
 year = {2004}
}

@article{he2004spectral,
  title={Spectral characteristics of saturated links},
  author={He, Xinming and Papadopoulos, Christos and Heidemann, John and Hussain, Alefiya},
  journal={Under Submission},
  year={2004}
}

@incollection{Bulut2004Synthesizingexpressivespeech,
 author = {Bulut, Murtaza and Narayanan, Shrikanth S. and Johnson, Lewis},
 bib2html_rescat = {emotion},
 booktitle = {Text to speech synthesis: New paradigms and advances},
 editor = {Narayanan, Shrikanth S. and Alwan, Abeer},
 publisher = {Prentice Hall},
 title = {Synthesizing expressive speech: Overview, challenges and open questions},
 year = {2004},
 month = {Jun}
}

@inproceedings{proc_mote:learnerspeecherrors:instil04,
 address = {Venice, Italy},
 author = {Mote, Nicolaus and Johnson, Lewis and Sethy, Abhinav and Silva, Jorge and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of the InSTIL/ICALL Symposium},
 doi = {},
 link = {http://sail.usc.edu/publications/files/MoteInSTIL2004.pdf},
 month = {Jul},
 title = {Tactical language detection and modeling of learner speech errors: The case of Arabic tactical language training for American English speakers},
 year = {2004}
}

@inproceedings{proc_johnson:tacticallanguagetraining:its04,
 address = {Berlin, Germany},
 author = {Johnson, W. Lewis and Beal, Carole and Fowles-Winkler, Anna and Lauper, Ursula and Marsella, Stacy and Narayanan, Shrikanth S. and Papachristou, Dimitra and Vilhjalmsson, Hannes},
 booktitle = {Proceedings of the Conference on Intelligent Tutoring Systems (ITS)},
 doi = {10.1007/978-3-540-30139-4_32},
 link = {http://sail.usc.edu/publications/files/johnsonits2004.pdf},
 month = {Jun},
 pages = {336-345},
 title = {Tactical language training system: An interim report},
 year = {2004}
}

@inproceedings{proc_lewis:tacticallanguage:instil04,
 address = {Venice, Italy},
 author = {Johnson, W. Lewis and Marsella, Stacy and Mote, Nicolaus and Vilhjalmsson, Hannes and Narayanan, Shrikanth S. and Choi, Sunhee},
 bib2html_rescat = {},
 booktitle = {Proceedings of the InSTIL/ICALL Symposium},
 doi = {},
 link = {http://sail.usc.edu/publications/files/JohnsonInSTIL2004.pdf},
 month = {Jul},
 title = {Tactical language training system: Supporting the rapid acquisition of foreign language and cultural skills},
 year = {2004}
}

@book{book_narayanan:tts:ttsbook04,
 author = {Narayanan, Shrikanth S. and Alwan, Abeer},
 bib2html_rescat = {rats},
 publisher = {Prentice Hall},
 title = {Text to speech synthesis: New paradigms and advances},
 year = {2004},
 month = {Dec}
}

@inproceedings{graebener_road_2004,
	address = {Orlando, Florida},
	title = {The {Road} to {Successful} {Joint} {Experimentation} {Starts} at the {Data} {Collection} {Trail} - {Part} {II}},
	booktitle = {Interservice/{Industry} {Training}, {Simulation}, and {Education} {Conference} ({I}/{ITSEC}) 2004},
	author = {Graebener, Robert J. and Rafuse, Gregory and Miller, Robert and Yao, Ke-Thia},
	month = dec,
	year = {2004},
}

@inproceedings{hussain2004effect,
  title={The effect of detail on Ethernet simulation},
  author={Hussain, Alefiya and Kapoor, Aman and Heidemann, John},
  booktitle={18th Workshop on Parallel and Distributed Simulation, 2004. PADS 2004.},
  pages={97--104},
  year={2004},
  organization={IEEE}
}

@inproceedings{proc_narayanan:transonics:aaai04,
 address = {Washington, D.C},
 author = {Narayanan, Shrikanth S. and Ananthakrishnan, Sankaranarayanan and Belvin, Robert and Ettelaie, Emil and Gandhe, Sudeep and Ganjavi, Shadi and Georgiou, Panayiotis and Hein, C. M. and Kadambe, S. and Knight, Kevin and Marcu, Daniel and Neely, Howard E. and Srinivasamurthy, Naveen and Traum, David and Wang, Dagen},
 bib2html_rescat = {span},
 booktitle = {Proceedings of the Association for the Advancement of Artificial Intelligence (AAAI) Fall Symposium},
 link = {http://sail.usc.edu/publications/files/narayananaaai2004.pdf},
 month = {Oct},
 pages = {97-103},
 title = {The transonics spoken dialogue translator: An aid for English-Persian doctor-patient interviews},
 year = {2004}
}

@inproceedings{proc_grunwald:cognitivetaskanalysis:Annualmedicine04,
 address = {New Port Beach, CA},
 author = {Grunwald, Tiffany and Clark, Dick and Fisher, Scott and McLaughlin, Margaret and Narayanan, Shrikanth S. and Piepol, Diane},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of the Annual Medicine Meets Virtual Reality (MMVR) Conference},
 link = {http://sail.usc.edu/publications/files/GrunwaldMMVR2004.pdf},
 month = {Jan},
 pages = {114-120},
 title = {Using Cognitive Task Analysis to Facilitate Collaboration in Development of Simulator to Accelerate Surgical Training},
 year = {2004}
}

@InProceedings{lerman04:sigmod,
  author =       "Kristina Lerman and Lise Getoor and Steven Minton and Craig A. Knoblock",
  title =        "{Using the Structure of Web Sites for Automatic Segmentation of Tables}",
  year =         "2004",
  booktitle =    "Proceedings of ACM SIG on Management of Data (SIGMOD-2004)",
  pages =        "",
  urlPaper= "http://usc-isi-i2.github.io/papers/lerman04-sigmod.pdf",
  Keywords = {"Wrapper Learning"}
}

@inproceedings{chen04:stdbm,
        Author = "Ching-Chien Chen and Cyrus Shahabi and Craig A. Knoblock",
        Title = "Utilizing Road Network Data for Automatic Identification of Road Intersections from High Resolution Color Orthoimagery",
        Booktitle = "Proceedings of the 2nd Workshop on Spatio-Temporal Database Management - STDBM'04",
        Year = 2004,
	urlPaper= "http://usc-isi-i2.github.io/papers/chen04-stdbm.pdf",
       	Keywords = {"Map Extraction"}
        }

@INBOOK{Lerman04ve,
  author  =      {Kristina Lerman and Steve Minton and Craig A. Knoblock},
  title =        {Virtual Enterprise Integration: Technological and Organizational Perspective},
  chapter =      {Machine Learning Techniques for Web Wrapper Maintenance, Goran D. Putnik and
Maria Manuela Cunha (Eds)},
  pages =        {},
  publisher =    {Idea Group, Hershey, PA},
  year =         {2004},
  keywords =    {wrapper-maintenance},
}

@InBook{Ye04a,
	author =	"Wei Ye and John Heidemann",
	title = 	"Wireless Sensor Networks",
	chapter = 	"Medium Access Control in Wireless Sensor Networks",
	note =		"Chapter 4, C. S. Raghavendra, Krishna Sivalingam, Ty Znati, editors",
	publisher = 	"Kluwer Academic Publishers",
	year = 		2004,
	sortdate = "2004-01-01",
	project = "ilense, macss, scadds",
	jsubject = "sensornet_subtransport",
	pages =		"73--92",
	location =	"johnh: not on file",
	keywords =	"s-mac, MAC, in [Znati04a]",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye04a.html",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "Kluwer Academic Publishers",
	availability = {
This paper is available only as a chapter in the book \emph{Wireless
Sensor Networks}, Ty Znati, Krishna Sivalingam, C. S. Raghavendra, editors.
A <a href="Ye03c.html">similar but different version</a>
is available electronically.
},
	abstract = "
This paper reviews medium access control (MAC), an enabling technology
in wireless sensor networks. MAC protocols control how sensors access
a shared radio channel to communicate with neighbors. Battery-powered
wireless sensor networks with many nearby nodes challenge traditional
MAC design. This paper discusses design trade-offs with an emphasis on
energy efficiency. It classifies existing MAC protocols and compares
their advantages and disadvantages in the context of sensor
networks. Finally, it presents S-MAC as an example of a MAC protocol
designed specifically for a sensor network, illustrating one
combination of design trade-offs.
",
}

This paper reviews medium access control (MAC), an enabling technology in wireless sensor networks. MAC protocols control how sensors access a shared radio channel to communicate with neighbors. Battery-powered wireless sensor networks with many nearby nodes challenge traditional MAC design. This paper discusses design trade-offs with an emphasis on energy efficiency. It classifies existing MAC protocols and compares their advantages and disadvantages in the context of sensor networks. Finally, it presents S-MAC as an example of a MAC protocol designed specifically for a sensor network, illustrating one combination of design trade-offs.

@TechReport{Conner04a,
	 author = 	"W. Steven Conner and John Heidemann and Lakshman
  Krishnamurthy and Xi Wang and Mark Yarvis",
	 title = "Workplace Applications of Sensor Networks",
	 institution = 	"USC/Information Sciences Institute",
	 year = 		2004,
	sortdate = 		"2004-07-01", 
	project = "ilense, whumls",
	jsubject =  "sensornet_general",
	 number =	"ISI-TR-2004-591",
	 note = "To appear as a chapter in \emph{Wireless Sensor
			  Networks: A Systems Perspective}, Nirupama
			  Bulusu and Sanjay Jha, editors; Artech House,
			  publisher (2004).",
	 month =		jul,
	 location =	"johnh: pafile",
	 keywords =	"sensor network, deployment order",
	 url =		"http://www.isi.edu/%7ejohnh/PAPERS/Conner04a.html",
	 pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Conner04a.pdf",
	 copyrightholder = "authors",
	 myorganization =	"USC/Information Sciences Institute",
	 abstract = "(No formal abstract.  The paper reviews workplace
			  applications of sensor networks, including
			  the Intel Conference Room Application and the
			  ISI Follow-Me Application.)",
}

(No formal abstract. The paper reviews workplace applications of sensor networks, including the Intel Conference Room Application and the ISI Follow-Me Application.)

@TechReport{Hussain03a,
	author = 	"Alefiya Hussain and John Heidemann and Christos Papadopoulos",
	title = 	"A Framework for Classifying Denial of Service Attacks-extended",
	institution = 	"USC/Information Sciences Institute",
	year = 		2003,
	sortdate = 		"2003-06-01",
	project = "ant, saman, conser, cossack",
	jsubject = "network_security",
	number =	"ISI-TR-2003-569b",
	month =		jun,
	note = "(Original TR, February 2003, updated June 2003)",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"ddos classification, spectral analysis",
	otherurl =	"ftp://ftp.isi.edu/isi-pubs/tr-569.pdf",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Hussain03a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Hussain03a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
Launching a denial of service (DoS) attack is trivial, but detection
and response is a painfully slow and often a manual process.
Automatic classification of attacks as single- or multi-source can
help focus a response, but current packet-header-based approaches are
susceptible to spoofing. This paper introduces a framework for
classifying DoS attacks based on header content, transient ramp-up
behavior and novel techniques such as spectral analysis. Although
headers are easily forged, we show that characteristics of attack
ramp-up and attack spectrum are more difficult to spoof. To evaluate
our framework we monitored access links of a regional ISP detecting 80
live attacks. Header analysis identified the number of attackers in 67
attacks, while the remaining 13 attacks were classified based on
ramp-up and spectral analysis. We validate our results through
monitoring at a second site, controlled experiments, and
simulation. We use experiments and simulation to understand the
underlying reasons for the characteristics observed. In addition to
helping understand attack dynamics, classification mechanisms such as
ours are important for the development of realistic models of DoS
traffic, can be packaged as an automated tool to aid in rapid response
to attacks, and can also be used to estimate the level of DoS activity
on the Internet.
",
}

Launching a denial of service (DoS) attack is trivial, but detection and response is a painfully slow and often a manual process. Automatic classification of attacks as single- or multi-source can help focus a response, but current packet-header-based approaches are susceptible to spoofing. This paper introduces a framework for classifying DoS attacks based on header content, transient ramp-up behavior and novel techniques such as spectral analysis. Although headers are easily forged, we show that characteristics of attack ramp-up and attack spectrum are more difficult to spoof. To evaluate our framework we monitored access links of a regional ISP detecting 80 live attacks. Header analysis identified the number of attackers in 67 attacks, while the remaining 13 attacks were classified based on ramp-up and spectral analysis. We validate our results through monitoring at a second site, controlled experiments, and simulation. We use experiments and simulation to understand the underlying reasons for the characteristics observed. In addition to helping understand attack dynamics, classification mechanisms such as ours are important for the development of realistic models of DoS traffic, can be packaged as an automated tool to aid in rapid response to attacks, and can also be used to estimate the level of DoS activity on the Internet.

@inproceedings{kesselman_geoscience_2003,
	title = {A {Geoscience} {Grid}: {The} {Scec} {Community} {Modeling} {Environment} (scec/cme)},
	volume = {1},
	booktitle = {{AGU} {Fall} {Meeting} {Abstracts}},
	author = {Kesselman, C. and Tangmunarunkit, H. and Gil, Y. and Thiebaux, M. and Decker, S. and Jordan, T. H. and Maechling, P.},
	year = {2003},
	pages = {0180},
}

@ARTICLE{LermanJAMAS,
  author =       {Kristina Lerman and Aram Galstyan and T. Hogg},
  title =        {A Methodology for Mathematical Analysis of Multi-Agent Systems},
  journal =      {unpublished},
  year =         {2003},
  keywords =    {multi-agent-systems},
    urlPaper={http://arxiv.org/abs/cs/0404002},
}

@inproceedings{Suh2003c,
	author= {Suh, Jinwoo and Kim, Eun-Gyu and Crago, Stephen P. and Srinivasan, Lakshmi and French, Matthew C.},
	title= {A Performance Characterization of New Microprocessor paradigm on Data-Intensive Kernels},
	booktitle= {Workshop on Performance Characterization, Modeling, and Benchmarking for HPC Systems},
	location= {Emeryville, California},
	month= {May},
	year= {2003}
}

@TechReport{Stathopoulos03b,
	author = 	"Thanos Stathopoulos and John Heidemann and Deborah Estrin",
	title = 	"A Remote Code Update Mechanism for Wireless Sensor Networks",
	institution = 	"University of California, Los Angeles, Center for Embedded Networked Computing",
	year = 		2003,
	sortdate = "2003-11-01",
	project = "ilense, cens, macss",
	jsubject = "sensornet_data_dissemination",
	number =	"CENS-TR-30",
	month =		nov,
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"MOAP, multi-hop over-the-air programming",
	otherurl =		"http://lecs.cs.ucla.edu/%7ethanos/moap-TR.pdf",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Stathopoulos03b.html",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Stathopoulos03b.pdf",
	copyrightholder = "authors", 
	abstract = "
Wireless sensor networks consist of collections of small, low-power
nodes that interface or interact with the physical environment. The
ability to add new functionality or perform software maintenance
without having to physically reach each individual node is already an
essential service, even at the limited scale at which current sensor
networks are deployed. TinyOS supports single-hop over-the-air
reprogramming today, but the need to reprogram sensors in a multihop
network will become particularly critical as sensor networks mature
and move toward larger deployment sizes. In this paper we present
Multihop Over-the-Air Programming (MOAP), a code distribution
mechanism specifically targeted for Mica-2 Motes. We discuss and
analyze the design goals, constraints, choices and optimizations
focusing in particular on dissemination strategies and retransmission
policies. We have implemented MOAP on Mica-2 motes and we evaluate
that implementation using both emulation and testbed experiments. We
show that our dissemination mechanism obtains a 60--90\% performance
improvement in terms of required transmissions compared to
flooding. We also show that a very simple windowed retransmission
tracking scheme is nearly as effective as arbitrary repairs and yet is
much better suited to energy and memory constrained embedded systems.
",
}

Wireless sensor networks consist of collections of small, low-power nodes that interface or interact with the physical environment. The ability to add new functionality or perform software maintenance without having to physically reach each individual node is already an essential service, even at the limited scale at which current sensor networks are deployed. TinyOS supports single-hop over-the-air reprogramming today, but the need to reprogram sensors in a multihop network will become particularly critical as sensor networks mature and move toward larger deployment sizes. In this paper we present Multihop Over-the-Air Programming (MOAP), a code distribution mechanism specifically targeted for Mica-2 Motes. We discuss and analyze the design goals, constraints, choices and optimizations focusing in particular on dissemination strategies and retransmission policies. We have implemented MOAP on Mica-2 motes and we evaluate that implementation using both emulation and testbed experiments. We show that our dissemination mechanism obtains a 60–90% performance improvement in terms of required transmissions compared to flooding. We also show that a very simple windowed retransmission tracking scheme is nearly as effective as arbitrary repairs and yet is much better suited to energy and memory constrained embedded systems.

@inproceedings{proc_shih:hummingtranscription:icme03,
 address = {Baltimore, MD},
 author = {Shih, Hsuan-Huei and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 bib2html_rescat = {mica},
 booktitle = {Proceedings of the IEEE International Conference on Multimedia Expo (ICME)},
 doi = {10.1109/ICME.2003.1220854},
 link = {http://sail.usc.edu/publications/files/ShihICME2003.pdf},
 month = {Jul},
 pages = {61-64},
 title = {A Statistical Multidimensional Humming Transcription Using Phone Level Hidden Markov Models for Query by Humming Systems},
 volume = {1},
 year = {2003}
}

@inproceedings{proc_kwon:genericmodels:asru03,
 address = {St. Thomas, U.S. Virgin Islands},
 author = {Kwon, Soonil and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of the IEEE Workshop on Automatic Speech Recognition and Understanding (ASRU)},
 link = {http://sail.usc.edu/publications/files/KwonASRU2003.pdf},
 month = {Dec},
 pages = {423-428},
 title = {A Study of Generic Models for Unsupervised On-line Speaker Indexing},
 year = {2003}
}

@InProceedings{Lan03b,
	author = 	"Kun-chan Lan and John Heidemann",
	title = 	"A Tool for {RApid} Model Parameterization and its Applications",
	booktitle = 	"Proceedings of the " # " Workshop on Models, Methods and Tools for Reproducible Network Research (MoMeTools)",
	year = 		2003,
	sortdate = 		"2003-08-01", 
	project = "ant, saman",
	jsubject = "traffic_modeling",
	publisher =	"ACM",
	address =	"Karlsruhe, Germany",
	month =		aug,
	pages =		"to appear",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"RAMP, traffic modeling, on-line traffic modeling",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Lan03b.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Lan03b.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "ACM",
	copyrightterms = "Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ",
	abstract = "
The utility of simulations and analysis heavily relies on good models
of network traffic. However, it is difficult to model and simulate the
Internet traffic because of the network's great heterogeneity and
rapid change. The statistical properties of Internet traffic not only
constantly change over time but also vary in other dimensions such as
locations and directions. Previously we have developed a tool RAMP
that supports rapid parameterization of traffic models from live
network measurements. In this paper, we first extend RAMP to support
near-real-time trace-driven simulation.  Next, we demonstrate the
applications of RAMP via three case studies: generation of realistic
traffic model for simulation, generation of high bandwidth synthetic
network traces, and analysis and modeling of malicious
traffic. Finally, we discuss some lessons we learned from using RAMP
for traffic modeling.
",
}

The utility of simulations and analysis heavily relies on good models of network traffic. However, it is difficult to model and simulate the Internet traffic because of the network's great heterogeneity and rapid change. The statistical properties of Internet traffic not only constantly change over time but also vary in other dimensions such as locations and directions. Previously we have developed a tool RAMP that supports rapid parameterization of traffic models from live network measurements. In this paper, we first extend RAMP to support near-real-time trace-driven simulation. Next, we demonstrate the applications of RAMP via three case studies: generation of realistic traffic model for simulation, generation of high bandwidth synthetic network traces, and analysis and modeling of malicious traffic. Finally, we discuss some lessons we learned from using RAMP for traffic modeling.

@inproceedings{thakkar03:p4ws,
   Author = "Snehal Thakkar and Craig A. Knoblock and Jos\'{e} Luis Ambite",
   Title = "A View Integration Approach to Dynamic Composition of Web Services",
   BookTitle = "Proceedings of 2003 ICAPS Workshop on Planning for Web Services",
   Address= "Trento, Italy",
   Year = "2003",
   urlPaper= "http://usc-isi-i2.github.io/papers/thakkar03-p4ws.pdf",
    Keywords = {"Service Composition","Data Integration"} }

@inproceedings{hussain2003framework,
  title={A framework for classifying denial of service attacks},
  author={Hussain, Alefiya and Heidemann, John and Papadopoulos, Christos},
  booktitle={Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications},
  pages={99--110},
  year={2003}
}

@inproceedings{proc_soonil:genericmodels:eurospeech03,
 address = {Geneva, Switzerland},
 author = {Kwon, Soonil and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of InterSpeech},
 doi = {},
 link = {http://sail.usc.edu/publications/files/KwonInterSpeech2003.pdf},
 month = {Sep},
 pages = {2653-2656},
 title = {A method for on-line speaker indexing using generic reference models},
 year = {2003}
}

@inproceedings{Suh:2003:PAP:859618.859665,
 author = {Suh, Jinwoo and Kim, Eun-Gyu and Crago, Stephen P. and Srinivasan, Lakshmi and French, Matthew C.},
 title = {A performance analysis of PIM, stream processing, and tiled processing on memory-intensive signal processing kernels},
 booktitle = {Proceedings of the 30th annual international symposium on Computer architecture},
 series = {ISCA '03},
 year = {2003},
 isbn = {0-7695-1945-8},
 location = {San Diego, California},
 pages = {410--421},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/859618.859665},
 doi = {http://doi.acm.org/10.1145/859618.859665},
 acmid = {859665},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@inproceedings{proc_shadi:ASCIItranscription:asru03,
 address = {St. Thomas, U.S. Virgin Islands},
 author = {Ganjavi, Shadi and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of the IEEE Workshop on Automatic Speech Recognition and Understanding (ASRU)},
 doi = {10.1109/ASRU.2003.1318507},
 link = {http://sail.usc.edu/publications/files/GanjaviASRU2003.pdf},
 month = {Dec},
 title = {ASCII based transcription systems with the Arabic script: The case of Persian},
 year = {2003}
}

@inproceedings{elsayed_atp_2003, 
author={T. {Elsayed} and M. {Hussein} and M. {Youssef} and T. {Nadeem} and A. {Youssef} and L. {Iftode}}, 
booktitle={2003 46th Midwest Symposium on Circuits and Systems}, 
title={ATP: autonomous transport protocol}, 
year={2003}, 
volume={1}, 
number={}, 
pages={436-439 Vol. 1}, 
keywords={data communication;mobility management (mobile radio);peer-to-peer computing;transport protocols;ubiquitous computing;autonomous transport protocol;transport connection;content identifiers;dynamic endpoints relocation;content-based network;active mode;passive mode;instance-based network;mobility management;peer-to-peer systems;ubiquitous computing;Transport protocols;Peer to peer computing;Maintenance;Ubiquitous computing;Computer science;USA Councils;Mobile radio mobility management;Computer network reliability;Application software;Tracking;Autonomous transport protocol;Content-based networks;Instance-based networks;Mobility management;Peer-to-peer systems;Transport protocols;Ubiquitous computing}, 
doi={10.1109/MWSCAS.2003.1562312}, 
ISSN={1548-3746}, 
month={Dec},}

@incollection{knoblock03:iew,
        Author = "Craig A. Knoblock and Kristina Lerman and Steven Minton and Ion Muslea",
        Title = "Accurately and Reliably Extracting Data from the Web: {A} Machine Learning Approach",
        booktitle = "Intelligent Exploration of the Web",
        editor = "Piotr S. Szczepaniak and Javier Segovia and Janusz Kacprzyk and Lotfi A. Zadeh",
        publisher = "Springer-Verlag",
        address = "Berkeley, CA",
        pages = "275--287",
        Year = "2003",
        urlPaper = "http://usc-isi-i2.github.io/papers/knoblock03-iew.pdf",
        Keywords = {"Wrapper Learning"}}

@inproceedings{proc_yildrim:acousticanalysis:icphs03,
 address = {Barcelona, Spain},
 author = {Yildirim, Serdar and Narayanan, Shrikanth S. and Byrd, Dani and Khurana, Sonia},
 bib2html_rescat = {care},
 booktitle = {Proceedings of the International Congresses of Phonetic Sciences (ICPhS)},
 link = {http://sail.usc.edu/publications/files/YildirimICPhS2003.pdf},
 month = {Aug},
 title = {Acoustic analysis of preschool childrens speech},
 year = {2003}
}

@inproceedings{proc_kazemzadeh:usererrorresponse:asru03,
 address = {St. Thomas, U.S. Virgin Islands},
 author = {Kazemzadeh, Abe and Lee, Sungbok and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of the IEEE Workshop on Automatic Speech Recognition and Understanding (ASRU)},
 doi = {10.1109/ASRU.2003.1318443},
 link = {http://sail.usc.edu/publications/files/KazemzadehASRU2003.pdf},
 month = {Dec},
 pages = {215-220},
 title = {Acoustic correlates of user response to error in human-computer dialogues},
 year = {2003}
}

@inproceedings{muslea03:ijcai,
   author  = "Ion Muslea and Steven Minton and Craig A. Knoblock",
   title   = "Active Learning with Strong and Weak Views: A Case Study on Wrapper Induction",
  booktitle = "Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003)",
  address = "Acapulco, Mexico",
   year    = "2003",
   urlPaper= "http://usc-isi-i2.github.io/papers/muslea03-ijcai.pdf",
   Keywords = {"Wrapper Learning","Active Learning"}
}

@InProceedings{Lerman03aamas,
  author =       "Kristina Lerman and Aram Galstyan",
  title =        "{Agent Memory and Adaptation in Multi-Agent Systems}",
  year =         "2003",
  month="Jul",
  booktitle =    "Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems ({AAMAS}-2003), Melbourne, Australia",
  pages =        "797--803",
  urlPaper={http://www.isi.edu/~lerman/papers/lerman-aamas03.pdf},
  keywords =    {multi-agent-systems},
}

@inproceedings{mirkovic2003alliance,
  title={Alliance formation for DDoS defense},
  author={Mirkovic, Jelena and Robinson, Max and Reiher, Peter},
  booktitle={Proceedings of the 2003 workshop on New Security Paradigms},
  pages={11--18},
  year={2003},
  organization={ACM}
}

@inproceedings{proc_sundaram:sponspeechsynthesis:eurospeech03,
 address = {Geneva, Switzerland},
 author = {Sundaram, Shiva and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/SundaramInterSpeech2003.pdf},
 month = {Sep},
 pages = {1221-1224},
 title = {An empirical text transformation method for spontaneous speech synthesizers},
 year = {2003}
}

@inproceedings{DBLP:conf/sensys/GanesanGPEH03,
  author       = {Deepak Ganesan and
                  Ben Greenstein and
                  Denis Perelyubskiy and
                  Deborah Estrin and
                  John S. Heidemann},
  editor       = {Ian F. Akyildiz and
                  Deborah Estrin and
                  David E. Culler and
                  Mani B. Srivastava},
  title        = {An evaluation of multi-resolution storage for sensor networks},
  booktitle    = {Proceedings of the 1st International Conference on Embedded Networked
                  Sensor Systems, SenSys 2003, Los Angeles, California, USA, November
                  5-7, 2003},
  pages        = {89--102},
  publisher    = {{ACM}},
  year         = {2003},
  url          = {https://doi.org/10.1145/958491.958502},
  doi          = {10.1145/958491.958502},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sensys/GanesanGPEH03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{proc_yildrim:informationtheoretic:icassp03,
 address = {Hong Kong},
 author = {Yildirim, Serdar and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2003.1198822},
 link = {http://sail.usc.edu/publications/files/YildirimICASSP2003.pdf},
 month = {Apr},
 pages = {I-480-I-483},
 title = {An information-theoretic analysis of developmental changes in speech},
 year = {2003}
}

@inproceedings{DBLP:conf/ndqa/XuLMMW03,
  author    = {Jinxi Xu and
               Ana Licuanan and
               Jonathan May and
               Scott Miller and
               Ralph M. Weischedel},
  title     = {Answer Selection and Confidence Estimation.},
  booktitle = {New Directions in Question Answering},
  year      = {2003},
  pages     = {134-137},
  crossref  = {DBLP:conf/ndqa/2003},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@TechReport{Krishnamachari03a,
	author = "Bhaskar Krishnamachari and John Heidemann",
	title = 	"Application-specific Modeling of Information
                         Routing in Sensor Networks",
	institution = 	"USC/Information Sciences Institute",
	year = 		2003,
	sortdate = "2003-08-01",
	project = "ilense, scadds",
	jsubject = "sensornet_general",
	number =	"ISI-TR-576",
	month =		aug,
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"directed diffusion, performance modelling",
	otherurl = "ftp://ftp.isi.edu/isi-pubs/tr-567.pdf",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Krishnamachari03a.html",
	organization =	"USC/Information Sciences Institute",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Krishnamachari03a.pdf",
	abstract = "
Sensor network applications have a diverse set of requirements--some
involve extraction of sensor data to a single point, others exploit
sensor-to-sensor communication; some employ long-lasting data streams
while connections in others are mainly ephemeral. Different variants
of the directed diffusion routing protocol--pull-based, push-based and
hybrid rendezvous-based--have been developed, along with in-network
processing and geographic routing techniques. However, there has been
no prior systematic study comparing their performance with respect to
the diverse application characteristics.  In this paper, we develop
novel abstract parameterized models for traffic and topology that can
incorporate data aggregation and geographic scoping. Using these
models, we mathematically analyze the performance of these routing
techniques across a range of application scenarios (with varying
numbers of nodes, sources, sinks, data settings etc.). Besides
quantifying the conditions under which the different routing
algorithms outperform each other, we obtain a number of useful design
insights. Our analysis shows that algorithms mismatched to
applications can result in drastically poor performance; demonstrates
the desirability of reducing flooded interest and exploratory messages
when data aggregation is used; and suggests that it may be difficult
to implement efficient hybrid schemes because their performance is
very sensitive to the optimal placement of rendezvous points.
",
}

Sensor network applications have a diverse set of requirements–some involve extraction of sensor data to a single point, others exploit sensor-to-sensor communication; some employ long-lasting data streams while connections in others are mainly ephemeral. Different variants of the directed diffusion routing protocol–pull-based, push-based and hybrid rendezvous-based–have been developed, along with in-network processing and geographic routing techniques. However, there has been no prior systematic study comparing their performance with respect to the diverse application characteristics. In this paper, we develop novel abstract parameterized models for traffic and topology that can incorporate data aggregation and geographic scoping. Using these models, we mathematically analyze the performance of these routing techniques across a range of application scenarios (with varying numbers of nodes, sources, sinks, data settings etc.). Besides quantifying the conditions under which the different routing algorithms outperform each other, we obtain a number of useful design insights. Our analysis shows that algorithms mismatched to applications can result in drastically poor performance; demonstrates the desirability of reducing flooded interest and exploratory messages when data aggregation is used; and suggests that it may be difficult to implement efficient hybrid schemes because their performance is very sensitive to the optimal placement of rendezvous points.

@inproceedings{Schott:2003:AAC:1119772.1119868,
 author = {Schott, Brian and Bellows, Peter and French, Matthew and Parker, Robert},
 title = {Applications of adaptive computing systems for signal processing challenges},
 booktitle = {Proceedings of the 2003 Asia and South Pacific Design Automation Conference},
 series = {ASP-DAC '03},
 year = {2003},
 isbn = {0-7803-7660-9},
 location = {Kitakyushu, Japan},
 pages = {465--470},
 numpages = {6},
 url = {http://doi.acm.org/10.1145/1119772.1119868},
 doi = {http://doi.acm.org/10.1145/1119772.1119868},
 acmid = {1119868},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@inproceedings{proc_li:audiovisual:icassp03,
 address = {Hong Kong},
 author = {Li, Ying and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2003.1200095},
 link = {http://sail.usc.edu/publications/files/liicassp2003.pdf},
 month = {Apr},
 pages = {565-568},
 title = {Audiovisual-based adaptive speaker identification},
 year = {2003}
}

@inproceedings{chen03:sstd,
    author = "Ching-Chien Chen and Snehal Thakkar and Craig A. Knoblock and Cyrus Shahabi",
    title = "Automatically Annotating and Integrating Spatial Datasets",
    booktitle = "Advances in Spatial and Temporal Databases: 8th International Symposium (SSTD 2003)",
    Address = {Springer, Berlin},
    Volume = {2750},
    Series = {Lecture Notes in Computer Science},
    Pages = "469-488",
    year = "2003",
    urlPaper= "http://usc-isi-i2.github.io/papers/chen03-sstd.pdf",
    Keywords = {"Geospatial Integration"} }

@inproceedings{chen03:ng2i,
  author = "Ching-Chien Chen and Craig A. Knoblock and Cyrus Shahabi and Snehal Thakkar",
  title = "Automatically and Accurately Conflating Satellite Imagery and Maps",
  booktitle = "Proceedings of the International Workshop on Next Generation Geospatial Information",
  address = "Cambridge, MA",
  year = "2003",
  urlPaper= "http://usc-isi-i2.github.io/papers/chen03-ng2i.pdf",
  Keywords = {"Map Conflation","Geospatial Integration"}
}

@inproceedings{barish03:iiweb,
   Author = "Greg Barish and Craig A. Knoblock",
   Title = "Combining Classification and Transduction for Value Prediction in Speculative Plan Execution",
   BookTitle = "Proceedings of 2003 IJCAI Workshop on Information Integration on the Web",
   Address= "Acapulco, Mexico",
   Year = "2003",
   urlPaper = "http://usc-isi-i2.github.io/papers/barish03-iiweb.pdf",
   Keywords = {"Dataflow Execution"} }

@inproceedings{rathnam2003configuration,
  title={Configuration-Based Exploratory Design},
  author={Rathnam, Tarun and Collins, Michael and Paredis, Christiaan JJ},
  booktitle={International Design Engineering Technical Conferences and Computers and Information in Engineering Conference},
  volume={36991},
  pages={279--287},
  year={2003}
}

@inproceedings{papadopoulos2003cossack,
  title={Cossack: Coordinated suppression of simultaneous attacks},
  author={Papadopoulos, Christos and Lindell, Robert and Mehringer, John and Hussain, Alefiya and Govindan, Ramesh},
  booktitle={Proceedings DARPA information survivability conference and exposition},
  volume={1},
  pages={2--13},
  year={2003},
  organization={IEEE}
}

@inproceedings{proc_erdem:hummingsystems:acm03,
 address = {Berkeley, CA},
 author = {Unal, Erdem and Narayanan, Shrikanth S. and Shih, Hsuan-Huei and Chew, Elaine and Kuo, C.-C. Jay},
 bib2html_rescat = {},
 booktitle = {Proceedings of the ACM SIGMM International Workshop on Multimedia Information Retrieval (MIR)},
 doi = {https://doi.org/10.1145/973264.973284},
 link = {http://sail.usc.edu/publications/files/UnalMMSJ2005.pdf},
 month = {Nov},
 pages = {475-483},
 title = {Creating data resources for designing user-centric front-ends for query by humming systems},
 year = {2003}
}

@phdthesis{mirkovic2003d,
  title={D-WARD: source-end defense against distributed denial-of-service attacks},
  author={Mirkovic, Jelena},
  year={2003},
  school={University of California Los Angeles}
}

@inproceedings{robinson2003defcom,
  title={DefCOM: defensive cooperative overlay mesh},
  author={Robinson, Max and Mirkovic, Jelena and Michel, Scott and Schnaider, Matthew and Reiher, Peter},
  booktitle={DARPA Information Survivability Conference and Exposition, 2003. Proceedings},
  volume={2},
  pages={101--102},
  year={2003},
  organization={IEEE}
}

@TechReport{Li03d,
	author = 	"Yuan Li and Wei Ye and John Heidemann",
	title = 	"Demonstration of Schedule and Latency Control in {S-MAC}",
	institution = 	"USC/Information Sciences Institute",
	year = 		2003,
	number =	"ISI-TR-581",
	month =		nov,
	sortdate = "2003-11-01",
	project = "ilense, scadds, macss",
	jsubject = "sensornet_subtransport",
	note = "Demonstration given at ACM Sensys 2003.",
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"S-MAC, global schedule",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Li03d.html",
	pdfurl =	       "http://www.isi.edu/%7ejohnh/PAPERS/Li03d.pdf",
	abstract = "
This technical report describes
a demonstration of schedule and latency control in S-MAC
given at SenSys 2003.
",
}

This technical report describes a demonstration of schedule and latency control in S-MAC given at SenSys 2003.

@inproceedings{knoblock03:ijcai,
  author = "Craig A. Knoblock",
  title = "Deploying Information Agents on the Web",
  booktitle = "Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003)",
  address = "Acapulco, Mexico",
  year = "2003",
  urlPaper= "http://usc-isi-i2.github.io/papers/knoblock03-ijcai.pdf",
  Keywords = {"Information Agents"}
}

@article{DBLP:journals/ton/IntanagonwiwatGEHS03,
  author       = {Chalermek Intanagonwiwat and
                  Ramesh Govindan and
                  Deborah Estrin and
                  John S. Heidemann and
                  Fabio Silva},
  title        = {Directed diffusion for wireless sensor networking},
  journal      = {{IEEE/ACM} Trans. Netw.},
  volume       = {11},
  number       = {1},
  pages        = {2--16},
  year         = {2003},
  url          = {https://doi.org/10.1109/TNET.2002.808417},
  doi          = {10.1109/TNET.2002.808417},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ton/IntanagonwiwatGEHS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{chen2003distributed,
  title={Distributed Resource Allocation: Knowing When To Quit},
  author={Chen, Jinbo and Bugacov, Alejandro and Szekely, Pedro and Frank, Martin and Cai, Min and Kim, Donghan and Robert Neches, R},
  journal={Representations and Approaches for Time-Critical Decentralized Resource/Role/1" ask Allocation Workshop of the Second International Joint Conference on Autonomous Agents \& Multi-Agent Systems (AAMAS 2003). Melbourne, Australia (July 14)},
  year={2003}
}

@inproceedings{Suh2003a,
	author= {Suh, Jinwoo and Kang, Dong-In and Crago, Stephen},
	title= {Dynamic Power Management of Heterogeneous Systems},
	booktitle= {Eleventh International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS) in conjunction with IPDPS},
	location= {Nice, France},
	month= {April},
	year= {2003},
	doi={10.1109/IPDPS.2003.1213247}
}

@inproceedings{lan2003effect,
  title={Effect of malicious traffic on the network},
  author={Lan, Kun-chan and Hussain, Alefiya and Dutta, Debojyoti},
  booktitle={Passive and Active Measurement Workshop (PAM)},
  year={2003}
}

@inproceedings{thakkar03:iiweb,
   Author = "Snehal Thakkar and Craig A. Knoblock",
   Title = "Efficient Execution of Recursive Integration Plans",
   BookTitle = "Proceedings of 2003 IJCAI Workshop on Information Integration on the Web",
   Address= "Acapulco, Mexico",
   Year = "2003",
   urlPaper= "http://usc-isi-i2.github.io/papers/thakkar03-iiweb.pdf",
   Keywords = {"Data Integration"} }

@inproceedings{proc_chul:emotionreco:eurospeech03,
 address = {Geneva, Switzerland},
 author = {Lee, Chul Min and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/LeeInterSpeech2003.pdf},
 month = {Sep},
 pages = {157-160},
 title = {Emotion Recognition Using a Data-driven Fuzzy Inference System},
 year = {2003}
}

@TechReport{Chen03b,
	author = 	"Xuan Chen and John Heidemann",
	title = 	"Experimental Evaluation of an Adaptive Flash Crowd Protection System",
	institution = 	"USC/Information Sciences Institute",
	year = 		2003,
	month = jul,
	sortdate = 		"2003-07-01",
	project = "ant, saman, conser",
	jsubject =  "www",
	number =	"IIS-TR-2003-573",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"NEWS, implementation, admission control",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chen03b.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Chen03b.pdf",
	copyrightholder = "authors",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
\emph{Network early warning system} (NEWS) is an adaptive admission
control scheme that protects server and networks from overloading
during flash crowds, and maintains high performance for accepted
requests. Unlike other admission control systems, NEWS regulates
\emph{requests} by observing \emph{response} performance,
automatically adapting to changing traffic mixes. We have previously
studied NEWS through simulation; this paper presents an implementation
of NEWS on a Linux-based router and evaluates that implementation in
testbed experiments with HTTP server log recorded during a flash
crowd.  This paper has three contributions. First, we use the
implementation to evaluate scenarios not considered in simulation. In
addition to validating our previous simulation results in
network-limited scenario quantitatively, we further consider server
memory-limited scenario, confirming that NEWS is effective in both
cases. Second, we evaluate the run-time cost of NEWS traffic
monitoring in practice, and find that it consumes little CPU time and
relatively small memory. Finally, we extend core NEWS algorithms to
include hot-spot identification function to protect bystander traffic
from flash crowds efficiently.
",
}

\emphNetwork early warning system (NEWS) is an adaptive admission control scheme that protects server and networks from overloading during flash crowds, and maintains high performance for accepted requests. Unlike other admission control systems, NEWS regulates \emphrequests by observing \emphresponse performance, automatically adapting to changing traffic mixes. We have previously studied NEWS through simulation; this paper presents an implementation of NEWS on a Linux-based router and evaluates that implementation in testbed experiments with HTTP server log recorded during a flash crowd. This paper has three contributions. First, we use the implementation to evaluate scenarios not considered in simulation. In addition to validating our previous simulation results in network-limited scenario quantitatively, we further consider server memory-limited scenario, confirming that NEWS is effective in both cases. Second, we evaluate the run-time cost of NEWS traffic monitoring in practice, and find that it consumes little CPU time and relatively small memory. Finally, we extend core NEWS algorithms to include hot-spot identification function to protect bystander traffic from flash crowds efficiently.

@inproceedings{michalowski03:kddwkshp,
   Author = "Martin Michalowski and Snehal Thakkar and Craig A. Knoblock",
   Title = "Exploiting Secondary Sources for Automatic Object Consolidation",
   Booktitle = "Proceedings of the KDD'03 Workshop on Data Cleaning, Record Linkage and Object Consolidation",
   Year = 2003,
   urlPaper = "http://usc-isi-i2.github.io/papers/michalowski03-kddwkshp.pdf",
   Keywords = {"Record Linkage"}}

@inproceedings{lin03:wic,
  author = "Shou-de Lin and Craig A. Knoblock",
  title = " Exploiting a Search Engine to Develop More Flexible Web Agents",
  booktitle = "Proceedings of the 2003 IEEE/WIC International Conference on Web Intelligence (WI2003)",
  address = "Halifax, Canada",
  publisher = "IEEE Computer Society",
  pages = "54-60",
  year = "2003",
  note = "Best Paper Award",
  urlPaper= "http://usc-isi-i2.github.io/papers/lin03-wic.pdf",
  Keywords = {"Information Agents"}
}

@techreport {deelman2003metadata_bl,
	title = {From Metadata to Execution on the Grid Pegasus and the Pulsar Search},
	number = {Technical Report 2003-15},
	year = {2003},
	institution = {GriPhyN},
	url = {http://pegasus.isi.edu/publications/ewa/griphyn_2003_15.pdf},
	author = {Ewa Deelman and James Blythe and Yolanda Gil and Carl Kesselman and Gaurang Mehta and Karan Vahi and Scott Koranda and Albert Lazzarini and Maria Alessandra Papa}
}

@article {Catlett2003_bl,
	title = {Grid Applications and Programming Tools},
	volume = {1},
	year = {2003},
	pages = {409{\textendash}411},
	publisher = {Springer},
	author = {Catlett, Charlie and N{\'e}meth, Formalisms Zsolt and Sunderam, Vaidy and Ewa Deelman and James Blythe and Yolanda Gil and Carl Kesselman and Gaurang Mehta and Karan Vahi and Kent Blackburn and others}
}

@InProceedings{	  deelman2003nvo,
  Author	= {Ewa Deelman and Raymond Plante and Carl Kesselman and
		  Gurmeet Singh and Mei-Hui Su and Gretchen Greene and Robert
		  Hanisch and Niall Gaffney and Antonio Volpicelli and James
		  Annis and Vijay Sekhri and Tamas Budavari and Maria
		  Nieto-Santisteban and William O'Mullane and David Bohlender
		  and Tom McGlynn and Arnold Rots and Olga Pevunova},
  URL		= {http://pegasus.isi.edu/publications/ewa/galmorph_sc03.pdf},
  Title		= {Grid-Based Galaxy Morphology Analysis for the National
		  Virtual Observatory},
  BookTitle	= {Supercomputing 2003},
  Year		= {2003}
}

@inproceedings{Ro2003,
	author= {Ro, Wonwoo and Gaudiot, Jean-Luc and Crago, Stephen P. and Despain, Alvin M.},
	title= {HiDISC: a decoupled architecture for data-intensive applications},
	booktitle= {International Parallel and Distributed Processing Symposium},
	month= {April},
	year= {2003}
}

@TechReport{Hussain03c,
	author = 	"Alefiya Hussain and John Heidemann and Christos Papadopoulos",
	title = 	"Identification of Repeated DoS Attacks using
                         Network Traffic Forensics",
	institution = 	"USC/Information Sciences Institute",
	year = 		2003,
	sortdate = 		"2003-08-01", 
	project = "ant, nocredit, saman, conser, cossack",
	jsubject = "network_security",
	number =	"ISI-TR-2003-577b",
	note = "Originally released August 2003, updated June 2004",
	month =		aug,
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"network forensics, network traffic
                         fingerprinting, spectral analysis, DDoS",
	otherurl =	"https://ant.isi.edu/%7ehussain/pubs/Hussain03c.pdf",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Hussain03c.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Hussain03c.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
Denial-of-service attacks on the Internet today are often launched
from zombies, multiple compromised machines controlled by an
attacker. Attackers often take control of a number of zombies and then
repeatedly use this army to attack a target several times, or to
attack several targets. In this paper, we propose a method to identify
repeated attack scenarios, that is, the combination of a particular
set of hosts and attack tool. Such identification would help a victim
coordinate response to an attack, and ideally would be a useful part
of legal actions. Because packet contents can be forged by the
attacker, we identify an attack scenario by spectral analysis of the
arrival stream of attack traffic. The attack spectrum is derived from
the characteristics of the attack machines and can therefore be
obscured only by reducing attack effectiveness. We designed a
multi-dimensional maximum-likelihood classifier to identify repeated
attack scenarios. To validate this procedure we apply our approach on
real-world attacks captured at a regional ISP, identifying similar
attacks first by header contents (when possible) and comparing these
results to our process. We conduct controlled experiments to identify
and isolate factors that affect the attack fingerprint.
",
}

Denial-of-service attacks on the Internet today are often launched from zombies, multiple compromised machines controlled by an attacker. Attackers often take control of a number of zombies and then repeatedly use this army to attack a target several times, or to attack several targets. In this paper, we propose a method to identify repeated attack scenarios, that is, the combination of a particular set of hosts and attack tool. Such identification would help a victim coordinate response to an attack, and ideally would be a useful part of legal actions. Because packet contents can be forged by the attacker, we identify an attack scenario by spectral analysis of the arrival stream of attack traffic. The attack spectrum is derived from the characteristics of the attack machines and can therefore be obscured only by reducing attack effectiveness. We designed a multi-dimensional maximum-likelihood classifier to identify repeated attack scenarios. To validate this procedure we apply our approach on real-world attacks captured at a regional ISP, identifying similar attacks first by header contents (when possible) and comparing these results to our process. We conduct controlled experiments to identify and isolate factors that affect the attack fingerprint.

@inproceedings{proc_sethy:malachproject:asru03,
 address = {St. Thomas, U.S. Virgin Islands},
 author = {Sethy, Abhinav and Ramabhadran, Bhuvana and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of the IEEE workshop on Automatic Speech Recognition and Understanding (ASRU)},
 doi = {https://doi.org/10.1109/asru.2003.1318416},
 link = {http://sail.usc.edu/publications/files/SethyASRU2003.pdf},
 month = {Dec},
 pages = {129-134},
 title = {Improvements in English ASR for the Malach project using syllable-centric models},
 year = {2003}
}

@article{youssef_instance-based_2003,
	title = {Instance-based Networking: A Communication Paradigm for Mobile Applications},
	volume = {7},
	rights = {All rights reserved},
	issn = {1559-1662},
	url = {http://doi.acm.org/10.1145/965732.965748},
	doi = {10.1145/965732.965748},
	shorttitle = {Instance-based Networking},
	abstract = {In this work we consider the design principles of the Instance-Based Network ({IBN}), an extended version of a generic Content-Based Network ({CBN}). {IBN} acts as an overlay communication platform over which end-point entities, called contents, communicate independently from their physical locations while providing the flexibility of having different instances of the same content. The semantics of different instances are assigned by the application using the {IBN}. Routing in the {IBN} is instance-based; the {IBN} can route a message to a specific content instance or to the closest instance, if no exact match is found for the destination content instance.},
	pages = {66--67},
	number = {4},
	journaltitle = {{SIGMOBILE} Mob. Comput. Commun. Rev.},
	author = {Youssef, Moustafa and Elsayed, Tamer and Hussein, Mohamed and Nadeem, Tamer and Youssef, Adel and Iftode, Liviu},
	urldate = {2019-05-01},
	date = {2003-10},
	year = {2003},
	file = {ACM Full Text PDF:C\:\\Users\\Mohamed Hussein\\Zotero\\storage\\3VA4JZDP\\Youssef et al. - 2003 - Instance-based Networking A Communication Paradig.pdf:application/pdf}
}

In this work we consider the design principles of the Instance-Based Network (IBN), an extended version of a generic Content-Based Network (CBN). IBN acts as an overlay communication platform over which end-point entities, called contents, communicate independently from their physical locations while providing the flexibility of having different instances of the same content. The semantics of different instances are assigned by the application using the IBN. Routing in the IBN is instance-based; the IBN can route a message to a specific content instance or to the closest instance, if no exact match is found for the destination content instance.

@inproceedings{DBLP:conf/dagstuhl/Gil03,
  author       = {Yolanda Gil},
  editor       = {Dieter Fensel and
                  James A. Hendler and
                  Henry Lieberman and
                  Wolfgang Wahlster},
  title        = {Knowledge Mobility: Semantics for the Web as a White Knight for Knowledge-Based
                  Systems},
  booktitle    = {Spinning the Semantic Web: Bringing the World Wide Web to Its Full
                  Potential [outcome of a Dagstuhl seminar]},
  pages        = {253--278},
  publisher    = {{MIT} Press},
  year         = {2003},
  timestamp    = {Thu, 27 Mar 2003 11:07:45 +0100},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/Gil03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{proc_naveen:persianspeechreco:eurospeech03,
 address = {Geneva, Switzerland},
 author = {Srinivasamurthy, Naveen and Narayanan, Shrikanth S.},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/srinivasamurthyinterspeech2003[1].pdf},
 month = {Sep},
 title = {Language-adaptive Persian speech recognition},
 year = {2003}
}

@inproceedings{sharifzadeh03:ng2i,
  author = "Mehdi Sharifzadeh and Cyrus Shahabi and Craig A. Knoblock",
  title = "Learning Approximate Thematic Maps from Labeled Geospatial Data",
  booktitle = "Proceedings of the International Workshop on Next Generation Geospatial Information",
  address = "Cambridge, MA",
  year = "2003",
  urlPaper= "http://usc-isi-i2.github.io/papers/sharifzadeh05-ng2i.pdf",
  Keywords = {"Learning Thematic Maps","Geospatial Integration"}
}

@inproceedings{barish03:ijcai,
  author = "Greg Barish and Craig A. Knoblock",
  title = "Learning Value Predictors for the Speculative Execution of Information Gathering Plans",
  booktitle = "Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003)",
  address = "Acapulco, Mexico",
  year = "2003",
  urlPaper= "http://usc-isi-i2.github.io/papers/barish03-ijcai.pdf",
  Keywords = {"Streaming Dataflow"}
}

@InProceedings{Lerman03iros,
  author =       "Kristina Lerman and Aram Galstyan",
  title =        "{Macroscopic Analysis of Adaptive Task Allocation in Robots}",
  month={oct},
  year =         "2003",
  booktitle =    "Proceedings of the IEEE International Conference on Intelligent Robots and Systems ({IROS}-2003), Las Vegas, NV",
  pages =        "1951--1956",
  keywords =    {multi-agent-systems},
}

@article {deelman2003mapping_bl,
	title = {Mapping Abstract Complex Workflows onto Grid Environments},
	journal = {Journal of Grid Computing},
	volume = {1},
	number = {1},
	year = {2003},
	pages = {25-39},
	url = {http://pegasus.isi.edu/publications/ewa/jogc.pdf},
	author = {Ewa Deelman and James Blythe and Yolanda Gil and Carl Kesselman and Gaurang Mehta and Karan Vahi and Kent Blackburn and Albert Lazzarini and Adam Arbree and Richard Cavanaugh and Scott Koranda}
}

@article{ deelman-etal-jogc03,
 title = {Mapping Abstract Workflows onto Grid Environments},
 author = {Ewa Deelman and Jim Blythe and Yolanda Gil and Carl Kesselman and Gaurang Mehta and Karan Vahi and Kent Blackburn and Albert Lazzarini and Adam Arbree and Richard Cavanaugh and Scott Koranda},
 journal = {Journal of Grid Computing}, 
 volume = {1},
 number = {1},
 year = {2003},
 url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/deelman-etal-jogc03.pdf }
 }

@inproceedings{DBLP:conf/sensys/HeidemannSE03,
  author       = {John S. Heidemann and
                  Fabio Silva and
                  Deborah Estrin},
  editor       = {Ian F. Akyildiz and
                  Deborah Estrin and
                  David E. Culler and
                  Mani B. Srivastava},
  title        = {Matching data dissemination algorithms to application requirements},
  booktitle    = {Proceedings of the 1st International Conference on Embedded Networked
                  Sensor Systems, SenSys 2003, Los Angeles, California, USA, November
                  5-7, 2003},
  pages        = {218--229},
  publisher    = {{ACM}},
  year         = {2003},
  url          = {https://doi.org/10.1145/958491.958517},
  doi          = {10.1145/958491.958517},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sensys/HeidemannSE03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@TechReport{Ye03c,
	author = 	"Wei Ye and John Heidemann",
	title = 	"Medium Access Control in Wireless Sensor Networks",
	institution = 	"USC/Information Sciences Institute",
	year = 		2003,
	sortdate = "2003-10-01",
	project = "ilense, macss, scadds",
	jsubject = "sensornet_subtransport",
	number =	"ISI-TR-2003-580",
	month =		oct,
	note = "To appear as a chapter in \emph{Wireless Sensor
                         Networks}, Taieb Znati, Krishna M. Sivalingam
                         and Cauligi Raghavendra (eds.), Kluwer
                         Academic Publishers",
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"MAC survey paper, book chapter",
	otherurl = "http://www.isi.edu/%7eweiye/pub/smac_tr580.pdf",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye03c.html",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye03c.pdf",
	psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye03c.ps.gz",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
This paper reviews medium access control (MAC), an enabling technology
in wireless sensor networks. MAC protocols control how sensors access
a shared radio channel to communicate with neighbors. Battery-powered
wireless sensor networks with many nearby nodes challenge traditional
MAC design. This paper discusses design trade-offs with an emphasis on
energy efficiency. It classifies existing MAC protocols and compares
their advantages and disadvantages in the context of sensor
networks. Finally, it presents S-MAC as an example of a MAC protocol
designed specifically for a sensor network, illustrating one
combination of design trade-offs.
",
}

This paper reviews medium access control (MAC), an enabling technology in wireless sensor networks. MAC protocols control how sensors access a shared radio channel to communicate with neighbors. Battery-powered wireless sensor networks with many nearby nodes challenge traditional MAC design. This paper discusses design trade-offs with an emphasis on energy efficiency. It classifies existing MAC protocols and compares their advantages and disadvantages in the context of sensor networks. Finally, it presents S-MAC as an example of a MAC protocol designed specifically for a sensor network, illustrating one combination of design trade-offs.

@Article{Ye03b,
	author = 	"Wei Ye and John Heidemann and Deborah Estrin",
	title = 	"Medium Access Control with Coordinated, Adaptive Sleeping for Wireless Sensor Networks",
	journal = 	"ACM/IEEE Transactions on Networking",
	year = 		2003,
	sortdate = "2003-01-01",
	project = "ilense, macss, scowr, scadds",
	jsubject = "chronological",
	note =		"accepted to appear IEEE/ACM Transactions on
                         Networking; draft available as ISI-TR-567",
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"s-mac, adaptive sleep",
}

@TechReport{	  singh2003nvo,
  Author	= {Gurmeet Singh and Ewa Deelman},
  URL		= {http://pegasus.isi.edu/publications/ewa/montage_pegasus.pdf},
  Title		= {Montage on the Grid},
  Institution	= {NVO},
  Number	= {Technical Report},
  Month		= {April},
  Year		= {2003}
}

@InProceedings{	  berriman2003montage,
  Author	= {G. Bruce Berriman and John C. Good and Anastasia C. Laity
		  and A. Bergou and Joseph C. Jacob and Daniel S. Katz and
		  Ewa Deelman and Carl Kesselman and Gurmeet Singh and
		  Mei-Hui Su and Roy Williams},
  URL		= {http://pegasus.isi.edu/publications/ewa/adass_03.pdf},
  Title		= {Montage: A Grid Enabled Image Mosaic Service for the
		  National Virtual Observatory},
  BookTitle	= {ADASS XIII},
  Year		= {2003}
}

@incollection{bookch_li:movieanalysis:videomining03,
 author = {Li, Ying and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 bib2html_rescat = {mica},
 booktitle = {Video Mining},
 chapter = {1},
 doi = {https://doi.org/10.1007/978-1-4757-6928-9_5},
 editor = {Rosenfeld, A. and Doermann, D. and Dementhon, D.},
 link = {http://sail.usc.edu/publications/files/LiVideoMining2003.pdf},
 pages = {1-33},
 publisher = {Kluwer Academic},
 title = {Movie content analysis, indexing and skimming via multimodal information},
 year = {2003}
}

@Article{	  williams2003image,
  Author	= {Roy Williams and G. Bruce Berriman and Ewa Deelman and
		  John Good and Joseph C. Jacob and Carl Kesselman and Carol
		  Lonsdale and Seb Oliver and Thomas A. Prince},
  URL		= {http://pegasus.isi.edu/publications/ewa/montage_paper.pdf},
  Title		= {Multi-Wavelength Image Space: Another Grid-Enabled
		  Science},
  Journal	= {Journal of Concurrency and Computation: Practice and
		  Experience},
  Month		= {March},
  Year		= {2003}
}

@inproceedings{proc_shih:hummingtranscription:icassp03,
 address = {Hong Kong},
 author = {Shih, Hsuan-Huei and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 booktitle = {Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},
 doi = {10.1109/ICME.2003.1220854},
 link = {http://sail.usc.edu/publications/files/ShihICASSP2003.pdf},
 month = {Apr},
 pages = {385-388},
 title = {Multidimensional humming transcription using a statistical approach for query by humming systems},
 year = {2003}
}

@proceedings{DBLP:conf/ndqa/2003,
  editor    = {Mark T. Maybury},
  title     = {New Directions in Question Answering, Papers from 2003 AAAI
               Spring Symposium, Stanford University, Stanford, CA, USA},
  booktitle = {New Directions in Question Answering},
  publisher = {AAAI Press},
  year      = {2003},
  isbn      = {1-57735-184-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{Dutta03a,
	author = "Debojyoti Dutta and Ashish Goel and John Heidemann",
	title = "Oblivious {AQM} and {Nash} Equilibria",
	booktitle = 	"Proceedings of the " # " IEEE Infocom",
	year = 		2003,
	sortdate = "2003-03-01",
	project = "ant, saman",
	jsubject = "networking",
	publisher =	"IEEE",
	address =	"San Francisco, California, USA",
	month =		mar,
	pages =		"106--113",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"router buffer strategies, nash equilibria",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta03a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta03a.pdf",
	otherurl = 	"https://ant.isi.edu/%7eddutta/infocom03.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "IEEE",
	copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	abstract = "
An oblivious Active Queue Management scheme is one which does not
differentiate between packets belonging to different flows. In this
paper, we study the existence and the quality of Nash equilibria
imposed by oblivious AQM schemes on selfish agents. Oblivious AQM
schemes are of obvious importance because of the ease of
implementation and deployment, and Nash equilibrium offers valuable
clues into network performance under non-cooperative user
behavior. Specifically, we ask the following three questions:  1) Do
there exist oblivious AQM schemes that impose Nash equilibria on
selfish agents?  2) Are the imposed equilibria, if they exist,
efficient in terms of the goodput obtained and the drop probability
experienced at the equilibrium?  3) How easy is it for selfish users
to reach the Nash equilib- rium state?  We assume that the traffic
sources are Poisson but the users can control the average rate. We
show that drop-tail and RED do not impose Nash equilibria. We modify
RED slightly to obtain an oblivious scheme, VLRED, that imposes a Nash
equilibrium, but is not efficient. We then present another AQM policy,
EN- AQM, that can impose an efficient Nash equilibrium. Finally, we
show that for any oblivious AQM, the Nash equilibrium imposed on
selfish agents is highly sensitive as the number of agents increases,
thus making it hard for the users to converge to the Nash equilibrium,
and motivating the need for equilibria- aware protocols.
",
}

An oblivious Active Queue Management scheme is one which does not differentiate between packets belonging to different flows. In this paper, we study the existence and the quality of Nash equilibria imposed by oblivious AQM schemes on selfish agents. Oblivious AQM schemes are of obvious importance because of the ease of implementation and deployment, and Nash equilibrium offers valuable clues into network performance under non-cooperative user behavior. Specifically, we ask the following three questions: 1) Do there exist oblivious AQM schemes that impose Nash equilibria on selfish agents? 2) Are the imposed equilibria, if they exist, efficient in terms of the goodput obtained and the drop probability experienced at the equilibrium? 3) How easy is it for selfish users to reach the Nash equilib- rium state? We assume that the traffic sources are Poisson but the users can control the average rate. We show that drop-tail and RED do not impose Nash equilibria. We modify RED slightly to obtain an oblivious scheme, VLRED, that imposes a Nash equilibrium, but is not efficient. We then present another AQM policy, EN- AQM, that can impose an efficient Nash equilibrium. Finally, we show that for any oblivious AQM, the Nash equilibrium imposed on selfish agents is highly sensitive as the number of agents increases, thus making it hard for the users to converge to the Nash equilibrium, and motivating the need for equilibria- aware protocols.

@TechReport{Lan03c,
	author = 	"Kun-chan Lan and John Heidemann",
	title = 	"On the correlation of Internet flow characteristics",
	institution = 	"USC/Information Sciences Institute",
	year = 		2003,
	sortdate = 		"2003-07-01",
	project = "ant, nocredit, saman",
	jsubject = "chronological",
	number =	"ISI-TR-574",
	month =		jul,
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"Internet traffic, elephant, tortise, cheetah,
                         porcupine",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Lan03c.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Lan03c.pdf",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
Previous studies of Internet traffic have shown that a very small
percentage of flows consume most of the network bandwidth. It is
important to understand the characteristics of such flows for traffic
monitoring and modeling purposes.  Several prior researchers have
characterized such flows using different classification schemes: by
size as elephant and mice; by duration as tortoise and dragonfly; and
by burstiness as alpha and beta traffic. However, it is not clear
how these different definitions of flows are related to each other. In
our work, we study these ``heavy-hitter'' flows in four orthogonal
dimensions, namely size, duration, rate and burstiness, and examine
how they are correlated. This paper makes three contributions: First,
we systematically characterize prior definitions for the properties
of such heavy-hitter traffic. Second, we show that there are strong
correlations between some combinations of size, rate and
burstiness. Finally, we show that these correlations can be
explained by transport and application-level protocol mechanisms.
",
}

Previous studies of Internet traffic have shown that a very small percentage of flows consume most of the network bandwidth. It is important to understand the characteristics of such flows for traffic monitoring and modeling purposes. Several prior researchers have characterized such flows using different classification schemes: by size as elephant and mice; by duration as tortoise and dragonfly; and by burstiness as alpha and beta traffic. However, it is not clear how these different definitions of flows are related to each other. In our work, we study these ``heavy-hitter'' flows in four orthogonal dimensions, namely size, duration, rate and burstiness, and examine how they are correlated. This paper makes three contributions: First, we systematically characterize prior definitions for the properties of such heavy-hitter traffic. Second, we show that there are strong correlations between some combinations of size, rate and burstiness. Finally, we show that these correlations can be explained by transport and application-level protocol mechanisms.

@incollection{goos_ontology-based_2003,
	address = {Berlin, Heidelberg},
	title = {Ontology-{Based} {Resource} {Matching} in the {Grid} – {The} {Grid} {Meets} the {Semantic} {Web}},
	volume = {2870},
	isbn = {978-3-540-20362-9 978-3-540-39718-2},
	url = {http://link.springer.com/10.1007/978-3-540-39718-2_45},
	urldate = {2022-02-12},
	booktitle = {The {Semantic} {Web} - {ISWC} 2003},
	publisher = {Springer Berlin Heidelberg},
	author = {Tangmunarunkit, Hongsuda and Decker, Stefan and Kesselman, Carl},
	editor = {Goos, Gerhard and Hartmanis, Juris and van Leeuwen, Jan and Fensel, Dieter and Sycara, Katia and Mylopoulos, John},
	year = {2003},
	doi = {10.1007/978-3-540-39718-2_45},
	note = {Series Title: Lecture Notes in Computer Science},
	pages = {706--721},
}

@TechReport{	  deelman2003architecture,
  Author	= {Ewa Deelman and Ian Foster and Carl Kesselman and Reagan
		  Moore and Sanjay Ranka},
  URL		= {http://pegasus.isi.edu/publications/architecture.pdf},
  Title		= {Overall Architecture and Control Flow},
  Institution	= {GriPhyN},
  Number	= {Technical Report 2004-24},
  Year		= {2003}
}

@inproceedings{deelman2003pulsar,
	title = {Pegasus and the Pulsar Search: From Metadata to Execution on the Grid},
	booktitle = {Applications Grid Workshop, PPAM 2003},
	year = {2003},
	url = {http://pegasus.isi.edu/publications/ewa/agw_ppam2003.pdf},
	author = {Ewa Deelman and James Blythe and Yolanda Gil and Carl Kesselman and Scott Koranda and Albert Lazzarini and Gaurang Mehta and Maria Alessandra Papa and Karan Vahi}
}

@inproceedings{blythe2003workshop,
	title = {Planning for workflow construction and maintenance on the Grid},
	booktitle = {2003 ICAPS Workshop on Planning for Web Services},
	year = {2003},
	url = {http://pegasus.isi.edu/publications/ewa/icaps_workshop.pdf},
	author = {Blythe, Jim and Ewa Deelman and Yolanda Gil}
}

@Article{Chen03a,
	author = 	"Xuan Chen and John Heidemann",
	title = 	"Preferential Treatment for Short Flows to Reduce Web Latency",
	journal = 	"Computer Networks",
	year = 		2003,
	sortdate = 		"2003-04-01",
	project = "ant, saman, conser",
	jsubject =  "www",
	volume =	41,
	number =	6,
	month =		apr,
	pages =		"779--794",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chen03a.html",
	externalurl =		"http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VRG-47DM0WC-2&_user=10&_handle=W-WA-A-A-AW-MsSAYVA-UUA-AUVYCWUCYY-ZZACDVYAA-AW-U&_fmt=summary&_coverDate=04%2F22%2F2003&_rdoc=7&_orig=browse&_srch=%23toc%236234%232003%23999589993%23398718!&_cdi=6234&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=6c7e742608f9849149ede82b9c6eead9",
	privatepdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Chen03a.pdf",
	availability = {
Copies for personal use can be obtained by an <a href="mailto:[email protected]">e-mail request to the authors</a>
or by contacting <a href="http://www.sciencedirect.com/">Elsiver</a>.
If you are unable to do either of those, an earlier draft of the paper
is available as a <a href="https://ant.isi.edu/%7ejohnh/PAPERS/Chen01c.html>USC technical report</a>.
},
	copyrightholder = "Elsevier Science Publishing Co., Inc.",
	copyrightterms = 	"Single photocopies of single articles 	may be made for personal use as allowed by national copyright 	laws. Permission of the Publisher and payment of a fee is required for 	all other photocopying, including multiple or systematic copying, 	copying for advertising or promotional purposes, resale, and all forms 	of document delivery. Special rates are available for educational 	institutions that wish to make photocopies for non-profit educational 	classroom use. Permissions may be sought directly from:  Elsevier 	Global Rights Department / P.O. Box 800 / Oxford OX5 1DX, UK / 	phone: (+44) 1865 843830 / 	fax: (+44) 1865 853333 / 	e-mail: [email protected] ",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
In this paper, we propose SFD algorithm to reduce the user-perceived
web response time (i.e. web latency). This algorithm gives short flows
preferential treatment and penalizes long flows. We implement SFD
algorithm as a simple differentiated services policy and evaluate its
performance in simulation. We find that the transmission latency of
short flows and the response time to retrieve representative web pages
are both reduced by about 30\%. Using web traces we demonstrate that
99\% web pages would be transferred faster. SFD also bounds the
penalty to long flows. We further evaluate how different schemes
trade-off the performance between short and long flows.
",
}

In this paper, we propose SFD algorithm to reduce the user-perceived web response time (i.e. web latency). This algorithm gives short flows preferential treatment and penalizes long flows. We implement SFD algorithm as a simple differentiated services policy and evaluate its performance in simulation. We find that the transmission latency of short flows and the response time to retrieve representative web pages are both reduced by about 30%. Using web traces we demonstrate that 99% web pages would be transferred faster. SFD also bounds the penalty to long flows. We further evaluate how different schemes trade-off the performance between short and long flows.

@TechReport{Rajgarhia03a,
	author = 	"Abhishek Rajgarhia and Fred Stann and John Heidemann",
	title = 	"Privacy-Sensitive Monitoring With a Mix of
                         {IR} Sensors and Cameras (Sensys demo)",
	institution = 	"USC/Information Sciences Institute",
	year = 		2003,
	sortdate = "2003-11-01",
	project = "ilense, saman, macss",
	jsubject = "sensornet_general",
	number =	"ISI-TR-2003-582",
	month =		nov,
	note = "Demonstration given at ACM Sensys 2003.",
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"sensor nets, privacy",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Rajgarhia03a.html",
	pdfurl =	       "http://www.isi.edu/%7ejohnh/PAPERS/Rajgarhia03a.pdf",
	abstract = "
This technical report describes
a demonstration of monitoring using a mix of passive infra-red sensors
and cameras given at SenSys 2003.
",
}

This technical report describes a demonstration of monitoring using a mix of passive infra-red sensors and cameras given at SenSys 2003.

@inproceedings {kim-gil-aied03, 
  title = {Proactive Acquisition from Tutoring and Learning Principles},
  author = {Jihie Kim and Yolanda Gil},
  year = "2003",
  booktitle = "Proceedings of the Eleventh International Conference on Artificial Intelligence in Education (AI-ED)",
  address = "Sydney, Australia",
  url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/kim-gil-aied03.pdf }
}

@inproceedings{ghandeharizadeh03:icws,
     author = "Shahram Ghandeharizadeh and Craig A. Knoblock and Christos Papadopoulos and Cyrus Shahabi and Esam Alwagait and Jos\'{e} Luis Ambite and Min Cai and Ching-Chien Chen and Parikshit Pol and Rolfe Schmidt and Saihong Song and Snehal Thakkar and Runfang Zhou",  
     title = "Proteus: A System for Dynamically Composing and Intelligently Executing Web Services",
     booktitle = "Proceedings of the First International Conference on Web Services (ICWS)", 
     address ="Las Vegas, NV", 
     month = "June",
     year = 2003,
     urlPaper= "http://usc-isi-i2.github.io/papers/ghandeharizadeh03-icws.pdf",
     Keywords = {"Composing Web Services","Data Integration"}} 

@InProceedings{Stann03a,
	author = 	"Fred Stann and John Heidemann",
	title = 	"RMST: Reliable Data Transport in Sensor Networks",
	booktitle = 	"Proceedings of the " # "First" # " International Workshop on Sensor Net Protocols and Applications ",
	year = 		2003,
	sortdate = "2003-04-01",
	project = "ilense, scadds",
	jsubject = "sensornet_data_dissemination",
	publisher =	"IEEE",
	address =	"Anchorage, Alaska, USA",
	month =		apr,
	pages =		"102--112",
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	brag = "99th most cited paper in CS for 2003 according to CiteSeer (as of Feb. 2005)",
	keywords =	"sensor networks, reliable transport layer,
                         RMST, PDSQ",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Stann03a.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Stann03a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "IEEE",
	copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	abstract = "
Reliable data transport in wireless sensor networks is a multifaceted
problem influenced by the physical, MAC, network, and transport
layers. Because sensor networks are subject to strict resource
constraints and are deployed by single organizations, they encourage
revisiting traditional layering and are less bound by standardized
placement of services such as reliability. This paper presents
analysis and experiments resulting in specific recommendations for
implementing reliable data transport in sensor nets. To explore
reliability at the transport layer, we present RMST (Reliable Multi-
Segment Transport), a new transport layer for Directed Diffusion. RMST
provides guaranteed delivery and fragmentation/reassembly for
applications that require them.  RMST is a selective NACK-based
protocol that can be configured for in-network caching and repair.
",
}

%	title = 	"{BARD}: Bayesian-Assisted Resource Discovery In Sensor Networks",

Reliable data transport in wireless sensor networks is a multifaceted problem influenced by the physical, MAC, network, and transport layers. Because sensor networks are subject to strict resource constraints and are deployed by single organizations, they encourage revisiting traditional layering and are less bound by standardized placement of services such as reliability. This paper presents analysis and experiments resulting in specific recommendations for implementing reliable data transport in sensor nets. To explore reliability at the transport layer, we present RMST (Reliable Multi- Segment Transport), a new transport layer for Directed Diffusion. RMST provides guaranteed delivery and fragmentation/reassembly for applications that require them. RMST is a selective NACK-based protocol that can be configured for in-network caching and repair.

@InProceedings{Galstyan03aamas,
  author =       "Aram Galstyan  and  S. Kolar and Kristina Lerman",
  title =        "{Resource Allocation Games with Changing Resource Capacities}",
  year =         "2003",
  booktitle =    "Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems ({AAMAS}-2003), Melbourne, Australia",
  pages =       "145--152",
  keywords =    {multi-agent-systems},
}

@inproceedings{Sharapov2003,
	author= {I. Sharapov and G. Lauterbach and S. Crago},
	title= {Robust Highly-Connected Direct Interconnection Network Topologies},
	booktitle= {International Conference on Parallel and Distributed Processing Techniques and Applications},
	month= {June},
	year= {2003}
}

@article{Potamianos2003Robustrecognitionofchildrens,
 author = {Potamianos, Alexandros and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 doi = {10.1109/TSA.2003.818026},
 journal = {IEEE Transactions on Speech and Audio Processing},
 link = {http://sail.usc.edu/publications/files/potamianossap2003.pdf},
 month = {Nov},
 number = {6},
 pages = {603-616},
 title = {Robust recognition of childrens speech},
 volume = {11},
 year = {2003}
}

@inproceedings{mirkovic2003source,
  title={Source-end DDoS defense},
  author={Mirkovic, Jelena and Prier, Gregory and Reiher, Peter},
  booktitle={Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.},
  pages={171--178},
  year={2003},
  organization={IEEE}
}

@PhDThesis{barish03:thesis,
   Author = "Greg Barish",
   Title = "Speculative Plan Execution for Information Agents",
   School = "Department of Computer Science, University of Southern California",
   Year = "2003",
    Keywords = {"Information Agents"}}

@inproceedings{proc_sethy:hierarchicalspeechreco:icassp03,
 address = {Hong Kong},
 author = {Sethy, Abhinav and Narayanan, Shrikanth S.},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2003.1198895},
 link = {http://sail.usc.edu/publications/files/SethyICASSP2003.pdf},
 month = {Apr},
 pages = {772-775},
 title = {Split-lexicon based hierarchical recognition of speech using syllable and word level acoustic units},
 year = {2003}
}

@inproceedings{DBLP:conf/icra/RahimiSSHE03,
  author       = {Mohammad H. Rahimi and
                  Hardik Shah and
                  Gaurav S. Sukhatme and
                  John S. Heidemann and
                  Deborah Estrin},
  title        = {Studying the Feasibility of Energy Harvesting in a Mobile Sensor Network},
  booktitle    = {Proceedings of the 2003 {IEEE} International Conference on Robotics
                  and Automation, {ICRA} 2003, September 14-19, 2003, Taipei, Taiwan},
  pages        = {19--24},
  publisher    = {{IEEE}},
  year         = {2003},
  url          = {https://doi.org/10.1109/ROBOT.2003.1241567},
  doi          = {10.1109/ROBOT.2003.1241567},
  timestamp    = {Mon, 22 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icra/RahimiSSHE03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{979873,
 author = {Jonathan May and Ada Brunstein and Prem Natarajan and Ralph Weischedel},
 title = {Surprise! What's in a Cebuano or Hindi Name?},
 journal = {ACM Transactions on Asian Language Information Processing (TALIP)},
 volume = {2},
 number = {3},
 year = {2003},
 issn = {1530-0226},
 pages = {169--180},
 doi = {http://doi.acm.org/10.1145/979872.979873},
 publisher = {ACM Press},
 address = {New York, NY, USA},
 }

@inproceedings{Crago2003,
	author= {Crago, Stephen P. and Suh, Jinwoo and C. Chen and Kang, Dong-In and Kim, Eun-Gyu},
	title= {System Architecture Issues for Polymorphous Computing},
	booktitle= {28th Annual GOMACTech Conference},
	month= {April},
	year= {2003}
}

@inproceedings {chklovski-etal-iswc03, 
  title = {TRELLIS: Supporting Decision Making via Argumentation in the Semantic Web},
  author = {Timothy Chklovski and Yolanda Gil and Varun Ratnakar and John Lee},
  year = "2003",
  booktitle = {Proceedings of Second International Semantic Web Conference (ISWC)},
  address = "Sanibel Island, FL"
}

@inproceedings{graebener_road_2003,
	address = {Orlando, Florida},
	title = {The {Road} to {Successful} {Joint} {Experimentation} {Starts} at the {Data} {Collection} {Trail}},
	booktitle = {Interservice/{Industry} {Training}, {Simulation}, and {Education} {Conference} ({I}/{ITSEC}) 2003},
	author = {Graebener, Robert J. and Rafuse, Gregory and Miller, Robert and Yao, Ke-Thia},
	month = dec,
	year = {2003},
}

@inproceedings{Blythe_icaps_2003,
	title = {The Role of Planning in Grid Computing.},
	booktitle = {Icaps},
	year = {2003},
	pages = {153{\textendash}163},
	author = {Blythe, Jim and Ewa Deelman and Yolanda Gil and Carl Kesselman and Amit Agarwal and Gaurang Mehta and Karan Vahi}
}

@InProceedings{Chang03a,
	author = "Di-Fa Chang and Ramesh Govindan and John Heidemann",
	title = 	"The Temporal and Topological Characteristics of BGP Path Changes",
	booktitle = 	"Proceedings of the " # " International Conference on Network Protocols",
	year = 		2003,
	sortdate = 		"2003-11-01", 
	project = "ant, saman, conser",
	jsubject = "routing",
	publisher =	"IEEE",
	address =	"Atlanta, Georga, USA",
	month =		nov,
	pages =		"190--199",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"BGP",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chang03a.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chang03a.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Chang03a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "ACM",
	copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	abstract = "
BGP has been deployed in Internet for more than a decade. However,
the events that cause BGP topological changes are not well
understood. Although large traces of routing updates seen in BGP
operation are collected by RIPE RIS and University of Oregon
RouteViews, previous work examines this data set as individual routing
updates.  This paper describes methods that group routing updates into
events. Since one event (a policy change or peering failure) results
in many update messages, we cluster updates both temporally and
topologically (based on the path vector information). We propose a new
approach to analyzing the update traces, classifying the topological
impact of routing events, and approximating the distance to the the
Autonomous System originating the event. Our analysis provides some
insight into routing behavior: First, at least 45\% path changes are
caused by events on transit peerings. Second, a significant number
(23­37\%) of path changes are transient, in that routing updates
indicate temporary path changes, but they ultimately converge on a
path that is identical from the previously stable path. These
observations suggest that a content provider cannot guarantee
end-to-end routing stability based solely on its relationship with its
immediate ISP, and that better detection of transient changes may
improve routing stability.
",
}

BGP has been deployed in Internet for more than a decade. However, the events that cause BGP topological changes are not well understood. Although large traces of routing updates seen in BGP operation are collected by RIPE RIS and University of Oregon RouteViews, previous work examines this data set as individual routing updates. This paper describes methods that group routing updates into events. Since one event (a policy change or peering failure) results in many update messages, we cluster updates both temporally and topologically (based on the path vector information). We propose a new approach to analyzing the update traces, classifying the topological impact of routing events, and approximating the distance to the the Autonomous System originating the event. Our analysis provides some insight into routing behavior: First, at least 45% path changes are caused by events on transit peerings. Second, a significant number (23­37%) of path changes are transient, in that routing updates indicate temporary path changes, but they ultimately converge on a path that is identical from the previously stable path. These observations suggest that a content provider cannot guarantee end-to-end routing stability based solely on its relationship with its immediate ISP, and that better detection of transient changes may improve routing stability.

@InProceedings{Bugacov+al03,
  author =       "Alejandro Bugacov and Aram Galstyan  and Kristina Lerman",
  title =        "{Threshold Behavior in Boolean Network Model for SAT}",
  year =         "2003",
  month= "jun",
  booktitle =    "Proceedings of the International Conference on Artificial Intelligence ({IC-AI}-2003), Las Vegas, NV",
  pages =        "87--92",
  urlPaper={http://www.isi.edu/~lerman/papers/satbn.pdf},
  keywords =    {multi-agent-systems},
}

@article{2003JPhB...36.3325V,
	Adsnote = {Provided by the SAO/NASA Astrophysics Data System},
	Adsurl = {http://adsabs.harvard.edu/abs/2003JPhB...36.3325V},
	Author = {{Ver Steeg}, Greg~L. and {Bartschat}, K. and {Bray}, I.},
	Doi = {10.1088/0953-4075/36/15/313},
	Journal = {Journal of Physics B Atomic Molecular Physics},
	Month = aug,
	Pages = {3325-3336},
	Title = {{Time-dependent model calculations for a molecular hydrogen ion in a strong ultra-short laser pulse}},
	Volume = 36,
	Year = {2003},
	Bdsk-Url-1 = {http://dx.doi.org/10.1088/0953-4075/36/15/313}}

@inproceedings{etzioni03:kdd,
   Author = "Oren Etzioni and Craig A. Knoblock and Rattapoom Tuchinda and Alexander Yates",
   Title = "To Buy or Not to Buy: Mining Airline Fare Data to Minimize Ticket Purchase Price",
   Booktitle = "Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining",
   Year = 2003,
   urlPaper= "http://usc-isi-i2.github.io/papers/etzioni03-kdd.pdf",
   urlPresentation= "http://usc-isi-i2.github.io/slides/etzioni03-kdd-slides.pdf",
   urlData= "http://usc-isi-i2.github.io/data/Hamlet/dataset.zip",
    Keywords = {"Data Mining"}}

@TechReport{Xu03a,
	author = "Ya Xu and Solomon Bien and Yutaka Mori and
 John Heidemann and Deborah Estrin",
	title = "Topology Control Protocols to Conserve Energy in Wireless Ad Hoc Networks",
	note = 		"submitted for publication",
	institution = 	"University of California, Los Angeles, Center for Embedded Networked Computing",
	year = 		2003,
	sortdate = "2003-01-01",
	project = "ilense, cens, nocredit, scadds",
	jsubject = "sensornet_subtransport",
	number =	6,
	month =		jan,
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"GAF, CEC, AFECA, ad hoc routing, diffusion,
                         adaptive fideltiy",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Xu03a.html",
	psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Xu03a.ps.gz",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Xu03a.pdf",
	organization =	"USC/Information Sciences Institute",
	abstract = "
In wireless ad hoc networks and sensor networks, energy use is in many
cases the most important constraint since it corresponds directly to
operational lifetime. This paper presents two topology control
protocols that extend the lifetime of dense ad hoc networks while
preserving connectivity, the ability for nodes to reach each
other. Our protocols conserve energy by identifying redundant nodes
and turning their radios off. Geographic Adaptive Fidelity (GAF)
identifies redundant nodes by their physical location and a
conservative estimate of radio range. Cluster-based Energy
Conservation (CEC) directly observes radio connectivity to determine
redundancy and so can be more aggressive at identifying duplication
and more robust to radio fading. We evaluate these protocols through
analysis, extensive simulations, and experimental results in two
wireless testbeds, showing that the protocols are robust to variance
in node mobility, radio propagation, node deployment density, and
other factors.
",
}

In wireless ad hoc networks and sensor networks, energy use is in many cases the most important constraint since it corresponds directly to operational lifetime. This paper presents two topology control protocols that extend the lifetime of dense ad hoc networks while preserving connectivity, the ability for nodes to reach each other. Our protocols conserve energy by identifying redundant nodes and turning their radios off. Geographic Adaptive Fidelity (GAF) identifies redundant nodes by their physical location and a conservative estimate of radio range. Cluster-based Energy Conservation (CEC) directly observes radio connectivity to determine redundancy and so can be more aggressive at identifying duplication and more robust to radio fading. We evaluate these protocols through analysis, extensive simulations, and experimental results in two wireless testbeds, showing that the protocols are robust to variance in node mobility, radio propagation, node deployment density, and other factors.

@inproceedings{proc_naveen:optimalencoding:eurospeech03,
 address = {Geneva, Switzerland},
 author = {Srinivasamurthy, Naveen and Ortega, Antonio and Narayanan, Shrikanth S.},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/SrinivasamurthyInterSpeech2003[2].pdf},
 month = {Sep},
 title = {Towards optimal encoding for classification with applications to distributed speech recognition},
 year = {2003}
}

@inproceedings{proc_narayanan:transonics:asru03,
 address = {St.Thomas, U.S. Virgin Islands},
 author = {Narayanan, Shrikanth S. and Ananthakrishnan, Sankaranarayanan and Belvin, Robert and Ettelaie, Emil and Ganjavi, Shadi and Georgiou, Panayiotis and Hein, C. M. and Kadambe, S. and Knight, Kevin and Marcu, Daniel and Neely, Howard E. and Srinivasamurthy, Naveen and Traum, David and Wang, Dagen},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of the IEEE workshop on Automatic Speech Recognition and Understanding (ASRU)},
 doi = {10.1109/ASRU.2003.1318520},
 link = {http://sail.usc.edu/publications/files/01318520.pdf},
 month = {Dec},
 pages = {670-675},
 title = {Transonics: A Speech to Speech System for English-Persian Interactions},
 year = {2003}
}

@inproceedings{DBLP:conf/iaai/BlytheDGK03,
  author       = {Jim Blythe and
                  Ewa Deelman and
                  Yolanda Gil and
                  Carl Kesselman},
  editor       = {John Riedl and
                  Randall W. Hill Jr.},
  title        = {Transparent Grid Computing: {A} Knowledge-Based Approach},
  booktitle    = {Proceedings of the Fifteenth Conference on Innovative Applications
                  of Artificial Intelligence, August 12-14, 2003, Acapulco, Mexico},
  pages        = {57--64},
  publisher    = {{AAAI}},
  year         = {2003},
  url          = {http://www.aaai.org/Library/IAAI/2003/iaai03-008.php},
  timestamp    = {Mon, 04 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iaai/BlytheDGK03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{blythe_iaai_03,
  title = {Transparent Grid Computing: A Knowledge-base Approach},
  author = {Jim Blythe and Ewa Deelman and Yolanda Gil and Carl Kesselman},
  booktitle = {Innovative Applications of Artificial Intelligence (IAAI)},
  year = {2003}
  }

@techreport {blythe2003editors,
	title = {Types of Editors and Specifications},
	number = {Technical Report 2004-23},
	year = {2003},
	institution = {GriPhyN},
	url = {http://pegasus.isi.edu/publications/editors.pdf},
	author = {James Blythe and Richard Cavanaugh and Ewa Deelman and Ian Foster and Seung-Hye Jang and Carl Kesselman and Keith Marzullo and Reagan Moore and Valerie Taylor and Xianan Zhang}
}

@article{2003PhRvA..68b0702B,
	Adsnote = {Provided by the SAO/NASA Astrophysics Data System},
	Adsurl = {http://adsabs.harvard.edu/abs/2003PhRvA..68b0702B},
	Author = {{Bartlett}, P.~L. and {Bray}, I. and {Jones}, S. and {Stelbovics}, A.~T. and {Kadyrov}, A.~S. and {Bartschat}, K. and {Ver Steeg}, Greg and {Scott}, M.~P. and {Burke}, P.~G.},
	Doi = {10.1103/PhysRevA.68.020702},
	Journal = {Physical Review A},
	Keywords = {Atomic excitation and ionization by electron impact},
	Month = aug,
	Number = 2,
	Title = {{Unambiguous ionization amplitudes for electron-hydrogen scattering}},
	Volume = 68,
	Year = {2003},
	Bdsk-Url-1 = {http://dx.doi.org/10.1103/PhysRevA.68.020702}}

@article{Mouchtaris2003Virtualmicrophonesformultichannel,
 author = {Mouchtaris, Athanasios and Narayanan, Shrikanth S. and Kyriakakis, Chris},
 bib2html_rescat = {},
 doi = {10.1155/S1110865703304032},
 journal = {EURASIP Journal on Applied Signal Processing},
 link = {http://sail.usc.edu/publications/files/MouchtarisJASP2003.pdf},
 month = {Sep},
 number = {1},
 pages = {968-979},
 title = {Virtual microphones for multichannel audio resynthesis},
 volume = {10},
 year = {2003}
}

@incollection{yan2003webscripter,
  title={WebScripter: Grass-roots ontology alignment via end-user report creation},
  author={Yan, Baoshi and Frank, Martin and Szekely, Pedro and Neches, Robert and Lopez, Juan},
  booktitle={The Semantic Web-ISWC 2003},
  pages={676--689},
  year={2003},
  publisher={Springer Berlin Heidelberg}
}

@inbook {deelman2003griphyn_bl,
	title = {Workflow Management in GriPhyN},
	booktitle = {Grid Resource Management},
	year = {2003},
	publisher = {Kluwer},
	organization = {Kluwer},
	url = {http://pegasus.isi.edu/publications/ewa/grm_chapter.pdf},
	author = {Ewa Deelman and James Blythe and Yolanda Gil and Carl Kesselman},
	editor = {J. Nabrzyski, J. Schopf, and J. Weglarz}
}

@ARTICLE{lerman03:jair,
  author =       "Kristina Lerman and Steven Minton and Craig A. Knoblock",
  title =        "Wrapper Maintenance: A Machine Learning Approach",
  journal =      "Journal of Artificial Intelligence Research",
  year =         "2003",
  volume =       {18},
  pages =        {149-181},
  urlPaper= "http://usc-isi-i2.github.io/papers/lerman09-eds.pdf",
  Keywords = {"Wrapper Learning"}
}

@inproceedings{DBLP:conf/flairs/GilR02,
  author       = {Yolanda Gil and
                  Varun Ratnakar},
  editor       = {Susan M. Haller and
                  Gene Simmons},
  title        = {A Comparison of (Semantic) Markup Languages},
  booktitle    = {Proceedings of the Fifteenth International Florida Artificial Intelligence
                  Research Society Conference, May 14-16, 2002, Pensacola Beach, Florida,
                  {USA}},
  pages        = {413--418},
  publisher    = {{AAAI} Press},
  year         = {2002},
  url          = {http://www.aaai.org/Library/FLAIRS/2002/flairs02-081.php},
  timestamp    = {Wed, 26 Oct 2022 08:35:33 +0200},
  biburl       = {https://dblp.org/rec/conf/flairs/GilR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@TechReport{Ye02b,
	author = "Wei Ye and John Heidemann and Deborah Estrin",
	title = 	"A Flexible and Reliable Radio Communication Stack on Motes",
	institution = 	"USC/Information Sciences Institute",
	year = 		2002,
	number =	"ISI-TR-2002-565",
	sortdate = "2001-09-01",
	project = "ilense, macss, scadds",
	jsubject = "sensornet_subtransport",
	month =		sep,
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"s-mac, design document",
	otherurl = "http://www.isi.edu/%7eweiye/pub/commstack.pdf",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye02b.html",
	organization =	"USC/Information Sciences Institute",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye02b.pdf",
	psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye02b.ps.gz",
	abstract = "
This technical report describes the radio communication stack on the
Mica Motes developed at USC/ISI and UCLA. It includes the architecture
design, stack implementation, interfaces, and some testing and
measurement results.
",
}

This technical report describes the radio communication stack on the Mica Motes developed at USC/ISI and UCLA. It includes the architecture design, stack implementation, interfaces, and some testing and measurement results.

@inproceedings{ambite2002:edc,
        author="Jos\'{e} Luis Ambite and Yigal Arens and Walter Bourne and Peter T. Davis and Steven Feiner and Eduard H. Hovy and Judith L. Klavans and Andrew Philpot and Samuel Popper and Ken Ross and Ju-Ling Shih and Peter Sommer and Surabhan (Nick) Temiyabutr and Laura Zadoff",
        title="A Portal for Access to Complex Distributed Information about Energy",
        booktitle="Proceedings of the Second National Conference on Digital Government Research (dg.o 2002)",
	urlPaper="http://www.isi.edu/~ambite/02may-dgo-EDC.pdf",
        address="Redondo Beach, California",
        year=2002
}

@inproceedings{Shriver2002,
	author= {Shriver, Patrick M. and Gokhale, Maya B. and Briles, Scott D. and Kang, Dong-in and Cai, Michael and McCabe, Kevin and Crago, Stephen P and Suh, Jinwoo},
title= {A Power-Aware, Satellite-Based Parallel Signal Processing Scheme},
	booktitle= {Power Aware Computing, Series in Computer Science, Kluwer Academic/Plenum Publishers},
	location= {New York, New York},
	year= {2002}
}

@inproceedings{proc_dagen:unsupervisedmap:asilomar02,
 address = {Pacific Grove, CA},
 author = {Wang, Dagen and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of the Asilomar Conference on Signals, Systems and Computers},
 doi = {10.1109/ACSSC.2002.1197181},
 link = {http://sail.usc.edu/publications/files/WangAsilomar2002.pdf},
 month = {Nov},
 pages = {222-226},
 title = {A confidence-score based unsupervised MAP adaptation for speech recognition},
 year = {2002}
}

@inproceedings{proc_shih:hummingrecognition:icassp02,
 address = {Orlando, FL},
 author = {Shih, Hsuan-Huei and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 booktitle = {Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2002.5745628},
 link = {http://sail.usc.edu/publications/files/shih_icassp_2002.pdf},
 month = {May},
 pages = {IV-4175},
 title = {A statistical approach to humming recognition},
 year = {2002}
}

@inproceedings{proc_sethy:syllablereco:isca02,
 address = {Estes Park, Colorado},
 author = {Sethy, Abhinav and Narayanan, Shrikanth S. and Parthasarathy, S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of the International Speech Communication Association (ISCA) Pronunciation Modeling and Lexicon Adaptation Workshop},
 link = {http://sail.usc.edu/publications/files/SethyISCA2002.pdf},
 month = {Sep},
 pages = {1-4},
 title = {A syllable based approach for improved recognition of spoken names},
 year = {2002}
}

@inproceedings{proc_dibazar:pathologicalspeech:asilomar02,
 address = {Pacific Grove, CA},
 author = {Dibazar, Alireza A. and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of the Asilomar Conference on Signals, Systems and Computers},
 link = {http://sail.usc.edu/publications/files/DibazarAsilomar2002.pdf},
 month = {Nov},
 title = {A system for automatic recognition of pathological speech},
 year = {2002}
}

@inproceedings{muslea02:icml-robust,
   author    = "Ion Muslea and Steven Minton and Craig A. Knoblock",
   title     = "Active + semi-supervised learning = robust multi-view learning",
   booktitle = "Proceedings of the 19th International Conference on Machine Learning (ICML-2002)",
   pages     = "435--442",
   address   = "Sydney, Australia",    
   year      = "2002",
   urlPaper="http://usc-isi-i2.github.io/papers/muslea02-icml-robust.pdf",
   Keywords = {"Wrapper Learning","Active Learning"}
}

@PhDThesis{muslea02:thesis,
   Author = "Ion Muslea",
   Title = "Active Learning with Multiple Views",
   School = "Department of Computer Science, University of Southern California",
   Year = "2002",
   urlLink= "http://jair.org/papers/paper2005.html",
   urlPaper= "http://usc-isi-i2.github.io/papers/muslea06-jair.pdf",
    Keywords = {"Wrapper Learning","Active Learning"}}

@ARTICLE{Galstyan02,
  author =       {Aram Galstyan and Kristina Lerman},
  title =        {Adaptive Boolean Networks and Minority Games with Time-Dependent Cutoffs},
  journal =      {Physical Review},
  year =         {2002},
  volume =       {E66},
  number =       {},
  pages =        {015103},
  month =        {},
  urlPaper={http://www.isi.edu/~lerman/papers/mg.pdf},
  keywords =    {multi-agent-systems},
}

@inproceedings{muslea02:isi,
   author    = "Ion Muslea and Steven Minton and Craig A. Knoblock",
   title   = "Adaptive View Validation: A Case study on Wrapper Induction and Text Classification",
   booktitle = "Proceedings of the AAAI-2002 Workshop on Intelligent Services Integration",
   page      = "12--18",
   address = "Edmonton, Alberta, Canada",
   year    = "2002",
   Keywords = {"Wrapper Learning","Active Learning"}
}

@inproceedings{muslea02:icml-view,
   author    = "Ion Muslea and Steven Minton and Craig A. Knoblock",
   title     = "Adaptive View Validation: A First Step Towards Automatic View Detection",
   booktitle = "Proceedings of the 19th International Conference on Machine Learning (ICML-2002)",
   pages     = "443--450",
   address   = "Sydney, Australia",    
   year      = "2002",
   urlPaper="http://usc-isi-i2.github.io/papers/muslea02-icml-view.pdf",
   Keywords = {"Wrapper Learning","Active Learning"}
}
 

@article {elves-aimag02, 
  title = {Agent Technology to Support Human Organizations},
  author = {Hans Chalupsky and Yolanda Gil and Craig Knoblock and Kristina Lerman and Jean Oh and David Pynadath and Thomas Russ and Milind Tambe},
  year = {2002},
  journal = {AI Magazine},
  volume = {23}, 
  number = {2}, 
  url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/elves-aimag02.pdf }
}

@article{knoblock02:is,
  author = 	 "Craig A. Knoblock",
  title = 	 "Agents for Gathering, Integrating, and Monitoring Information for Travel Planning",
  year =         "2002",
  month = "November/December",
  journal = 	 "IEEE Intelligent Systems",
  volume = 17,
  number = 6,
  Keywords = {"Information Agents"}
}

@InProceedings{Chang02a,
	author = 	"Di-Fa Chang and Ramesh Govindan and John Heidemann",
	title = 	"An Empirical Study of Router Response to
                         Large {BGP} Routing Table Load",
	booktitle = 	"Proceedings of the " # "ACM SIGCOMM Internet Measurement Workshop",
	year = 		2002,
	sortdate = 		"2002-11-01", 
	project = "ant, saman, conser",
	jsubject = "routing",
	publisher =	"ACM",
	address =	"Marseille, France",
	month =		nov,
	pages =		"203--208",
	otherurl = 	"https://ant.isi.edu/%7edifac/imw-2002.ps.gz",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chang02a.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chang02a.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Chang02a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightterms = "	Permission to make digital or 	hard copies of part or all of this work for personal or 	classroom use is granted without fee provided that copies 	are not made or distributed for profit or commercial 	advantage and that new copies bear this notice and the full 	citation on the first page. Copyrights for components of this 	work owned by others than ACM must be honored. Abstracting with 	credit  is permitted.   	To copy otherwise, to republish, to post on servers or to 	redistribute to lists, requires prior specific permission 	and/or a fee. Request Permissions from 	Publications Dept, ACM Inc., 	Fax +1 (212) 869--0481, or 	[email protected]. ",
	abstract = "
Anecdotal evidence suggests that misconfiguration of backbone routers
occasionally leads to an injection of large routing tables into the
BGP routing system.  In this paper, we investigate the detailed
mechanics of router response to large BGP routing tables.  We examine
three commercial grade routers, and find that their responses vary
significantly.  Some routers exhibit \emph{table-size oscillations}
that have the potential to cause \emph{cascading failure}.  Others
need operator intervention to recover from large routing tables.  We
also find that deployed resource control mechanisms, such as prefix
limits and route flap damping, are only partially successful in
mitigating the impact of large routing tables.
",
}

Anecdotal evidence suggests that misconfiguration of backbone routers occasionally leads to an injection of large routing tables into the BGP routing system. In this paper, we investigate the detailed mechanics of router response to large BGP routing tables. We examine three commercial grade routers, and find that their responses vary significantly. Some routers exhibit \emphtable-size oscillations that have the potential to cause \emphcascading failure. Others need operator intervention to recover from large routing tables. We also find that deployed resource control mechanisms, such as prefix limits and route flap damping, are only partially successful in mitigating the impact of large routing tables.

@inproceedings{DBLP:conf/infocom/YeHE02,
  author       = {Wei Ye and
                  John S. Heidemann and
                  Deborah Estrin},
  title        = {An Energy-Efficient {MAC} Protocol for Wireless Sensor Networks},
  booktitle    = {Proceedings {IEEE} {INFOCOM} 2002, The 21st Annual Joint Conference
                  of the {IEEE} Computer and Communications Societies, New York, USA,
                  June 23-27, 2002},
  pages        = {1567--1576},
  publisher    = {{IEEE} Computer Society},
  year         = {2002},
  url          = {https://doi.org/10.1109/INFCOM.2002.1019408},
  doi          = {10.1109/INFCOM.2002.1019408},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/infocom/YeHE02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{proc_shih:hummingtranscription:icme02,
 address = {Lausanne, Switzerland},
 author = {Shih, Hsuan-Huei and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 bib2html_rescat = {mica},
 booktitle = {Proceedings of the IEEE International Conference on Multimedia Expo (ICME)},
 doi = {10.1109/ICME.2002.1035787},
 link = {http://sail.usc.edu/publications/files/ShihICME2002.pdf},
 month = {Aug},
 pages = {337-340},
 title = {An HMM-based Approach to Humming Transcription},
 year = {2002}
}

@inproceedings{Kang2002,
	author= {Kang, Dong-In and Suh, Jinwoo and Crago, Stephen},
	title= {An Optimal Voltage Synthesis Technique for a Power-Efficient Satellite Application},
	booktitle= {39th Design Automation Conference (DAC)},
	pages = {492–497},
	location= {New Orleans, Louisanna},
	month= {June},
	year= {2002},
	url = {https://doi.org/10.1145/513918.514043},
    doi = {10.1145/513918.514043},
}

@TechReport{Ahn02a,
	  author = 	"Jong-Suk Ahn and John Heidemann",
	  title = 	"An adpative {FEC} algorithm for Mobile Wireless Networks",
	  institution = 	"USC/Information Sciences Institute",
	  year = 		2002,
	sortdate = "2002-03-01",
	  month =		mar,
	  location =	"johnh: pafile",
	  location =	"johnh: folder: xxx",
	  keywords =	"adaptive FEC, motes",
	project = "conser, ilense",
	jsubject = "chronological",
	  url =		"http://www.isi.edu/%7ejohnh/PAPERS/Ahn02a.html",
	  pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Ahn02a.pdf",
  	otherurl = "ftp://ftp.isi.edu/isi-pubs/tr-555.pdf",
	  copyrightholder = "authors",
	  myorganization = 	"USC/Information Sciences Institute",
	  abstract = "
  Wireless mobile networks tend to drop a large portion of
  packets due to propagation errors.  To improve reliability over noisy
  wireless channels, wireless networks can employ forward error
  correction (FEC) techniques. Static FEC algorithms, however, can
  degrade the performance by poorly matching their overhead to the
  degree of the underlying channel error, especially when the channel
  path loss rate fluctuates widely.  This paper investigates the
  benefits of an adaptable FEC mechanism for wireless networks with
  severe packet loss.  We show that our adaptive FEC technique improves
  the performance by dynamically tuning FEC strength to the current
  amount of wireless channel loss. We quantify these benefits through a
  hybrid simulation integrating packet-level simulation with bit-level
  details and validate the simulation model through experimentation.
  ",
}

Wireless mobile networks tend to drop a large portion of packets due to propagation errors. To improve reliability over noisy wireless channels, wireless networks can employ forward error correction (FEC) techniques. Static FEC algorithms, however, can degrade the performance by poorly matching their overhead to the degree of the underlying channel error, especially when the channel path loss rate fluctuates widely. This paper investigates the benefits of an adaptable FEC mechanism for wireless networks with severe packet loss. We show that our adaptive FEC technique improves the performance by dynamically tuning FEC strength to the current amount of wireless channel loss. We quantify these benefits through a hybrid simulation integrating packet-level simulation with bit-level details and validate the simulation model through experimentation.

@inproceedings{barish02:aips-workshop,
  author = "Greg Barish and Craig A. Knoblock",
  title = "An efficient and expressive language for information gathering on the web",
  booktitle = "Proceedings of the {AIPS-2002} Workshop on Is there life after operator sequencing? -- Exploring real world planning",
  pages = "5--12",
  address = "Tolouse, France",
  year = "2002",
  urlPaper= "http://usc-isi-i2.github.io/papers/barish02-aips-workshop.pdf",
   Keywords = {"Dataflow Execution","Information Gathering"}
}

@conference {abramson2002analysis,
	title = {Analysis of an enhanced signaling network for scalable mobility management in next generation wireless networks},
	booktitle = {Global Telecommunications Conference, 2002. GLOBECOM{\textquoteright}02. IEEE},
	volume = {1},
	month = nov,
	year = {2002},
	pages = {901{\textendash}905},
	publisher = {IEEE},
	organization = {IEEE},
	doi={10.1109/GLOCOM.2002.1188208},
	author = {Abramson, Jeremy and Fang, Xiao-yan and Ghosal, Dipak}
}

@inproceedings{proc_jongho:spokendialogs:icslp02,
 address = {Denver, CO},
 author = {Shin, JongHo and Narayanan, Shrikanth S. and Gerber, Laurie and Kazemzadeh, Abe and Byrd, Dani},
 bib2html_rescat = {annotation modeling},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/shininterspeech2002.pdf},
 month = {Sep},
 pages = {2069-2072},
 title = {Analysis of user behavior under error conditions in spoken dialogs},
 year = {2002}
}

@inproceedings{mirkovic2002attacking,
  title={Attacking DDoS at the source},
  author={Mirkovic, Jelena and Prier, Gregory and Reiher, Peter},
  booktitle={10th IEEE International Conference on Network Protocols (ICNP)},
  pages={312--321},
  year={2002},
  organization={IEEE}
}

@inproceedings{proc_chul:emotions:icme02,
 address = {Lausanne, Switzerland},
 author = {Lee, Chul Min and Narayanan, Shrikanth S. and Pieraccini, Roberto},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of the IEEE International Conference on Multimedia Expo (ICME)},
 doi = {10.1109/ICME.2002.1035887},
 link = {http://sail.usc.edu/publications/files/leeicme2002.pdf},
 month = {Aug},
 pages = {737-740},
 title = {Classifying emotions in human-machine spoken dialogs},
 year = {2002}
}

@inproceedings{allsopp02:ksco,
        Author="David N. Allsopp and Patrick Beautement and Jeffrey M. Bradshaw and Edmund H. Durfee and Michael Kirton and Craig A. Knoblock and Niranjan Suri and Austin Tate and Craig W. Thompson",
        Title="Coalition Agents Experiment: Multi-Agent Co-operation in an International Coalition Setting", 
        Booktitle="Proceedings of the Second International Conference on Knowledge Systems for Coalition Operations (KSCO-2002)",
        Address="Toulouse, France",
        Month="April",
        Year="2002",
       	Keywords = {"Information Agents"}}

@article{allsopp02:ieee-is,
  author = 	 "David N. Allsopp and Patrick Beautement and Michael Kirton and Jeffrey M. Bradshaw and Niranjan Suri and Edmund H. Durfee and Craig A. Knoblock and Austin Tate and Craig W. Thompson",
  title = 	 "Coalition Agents Experiment: Multiagent Cooperation in International Coalitions",
  year =         "2002",
  month = "May/June",
  journal = 	 "IEEE Intelligent Systems",
  pages = "26-35",
  volume = 17,
  number = 3,
   Keywords = {"Information Agents"}
}

@inproceedings{proc_meesookho:sensormetworks:ieeemsa02,
 address = {Arlington, VA},
 author = {Meesookho, Chartchai and Narayanan, Shrikanth S. and Raghavendra, C.},
 booktitle = {Proceedings of the IEEE Sensor Array and Multichannel Signal Processing (SAM) Workshop},
 doi = {10.1109/SAM.2002.1191063},
 link = {http://sail.usc.edu/publications/files/MeesookhoSAM2002.pdf},
 month = {Aug},
 pages = {370-374},
 title = {Collaborative Classification Applications in Sensor Networks},
 year = {2002}
}

@inproceedings{proc_chul:emotionreco:icslp02,
 address = {Denver, CO},
 author = {Lee, Chul Min and Narayanan, Shrikanth S. and Pieraccini, Roberto},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/leeinterspeech2002.pdf},
 month = {Sep},
 title = {Combining acoustic and language information for emotion recognition},
 year = {2002}
}

@inproceedings{proc_shih:melodyextraction:electronicimaging02,
 address = {San Jose, CA},
 author = {Shih, Hsuan-Huei and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 booktitle = {Proceedings of Electronic Imaging (EI) Conference},
 doi = {10.1117/12.451101},
 keyword = {audio database, ESPLE, Lempel Ziv 78, LZ-78, melody search, music database, music indexing, pattern search, repeating patterns},
 link = {http://sail.usc.edu/publications/files/shih_srmd_2002.pdf},
 month = {Jan},
 pages = {306-317},
 title = {Comparison of dictionary-based approaches to automatic repeating melody extraction},
 volume = {4676},
 year = {2002}
}

@article{2002PhRvA..65f2715B,
	Adsnote = {Provided by the SAO/NASA Astrophysics Data System},
	Adsurl = {http://adsabs.harvard.edu/abs/2002PhRvA..65f2715B},
	Author = {{Bartschat}, K. and {Scott}, M.~P. and {Burke}, P.~G. and {Stitt}, T. and {Scott}, N.~S. and {Grum-Grzhimailo}, A.~N. and {Riordan}, S. and {Ver Steeg}, Greg and {Strakhova}, S.~I.},
	Doi = {10.1103/PhysRevA.65.062715},
	Journal = {Physical Review A},
	Keywords = {Atomic excitation and ionization by electron impact},
	Month = jun,
	Number = 6,
	Title = {{Convergence of energy-differential ionization cross sections obtained from a T-matrix approach with R-matrix wave functions}},
	Volume = 65,
	Year = {2002},
	Bdsk-Url-1 = {http://dx.doi.org/10.1103/PhysRevA.65.062715}}

@article{chen2002coordinated,
  title={Coordinated aggressive bidding in distributed combinatorial resource allocation},
  author={Chen, Jinbo and Bugacov, Alejandro and Szekely, Pedro and Frank, Martin and Cai, Min and Kim, Donghan and Neches, Robert},
  year={2002}
}

@article{Narayanan2002Creatingconversationalinterfacesfor,
 author = {Narayanan, Shrikanth S. and Potamianos, Alexandros},
 journal = {IEEE Transactions on Speech and Audio Processing},
 keyword = {automatic speech recognition for children, computer games, conversational agents, human-computer interaction, multimedia interfaces, multimodal systems, spoken dialogue systems},
 link = {http://sail.usc.edu/publications/files/NarayananSAP2002.pdf},
 month = {Feb},
 number = {2},
 pages = {65-78 [IEEE Signal Processing Society Best Paper Award Wnner, 2005]},
 title = {Creating conversational interfaces for children},
 volume = {10},
 year = {2002}
}

@inproceedings{Shank2002,
	author= {Shank, Stephen F. and Crago, Stephen and Pancoast, Rick and J. Racosky and Suh, Jinwoo and L. Trevito},
	title= {DARPA Data Intensive Systems (DIS) Embedded Computing Benchmarks for Critical Defense Signal Processing Applications},
	booktitle= {6th Annual High Performance Embedded Computing Workshop},
	location= {Cambridge, Massachussets},
	month= {September},
	year= {2002}
}

@inproceedings{philpot2002:askcal,
        author="Andrew Philpot and Jos\'{e} Luis Ambite and Eduard Hovy",
        title="{DGRC AskCal}: Natural Language Question Answering for Energy Time Series",
        booktitle="Proceedings of the Second National Conference on Digital Government Research (dg.o 2002)",
        address="Redondo Beach, California",
urlPaper="http://www.isi.edu/~ambite/02may-dgo-AskCal.pdf",
        year=2002
}

@InProceedings{Ganesan02c,
	 author = 	"Deepak Ganesan and Deborah Estrin and John Heidemann",
	 title = 	"DIMENSIONS: Why do we need a new Data
			  Handling architecture for Sensor Networks?",
	 booktitle = 	"Proceedings of the " # "ACM Workshop on Hot Topics in Networks",
	 year = 		2002,
	sortdate = 		"2002-10-01",
	project = "ilense, cens, scadds, nocredit",
	jsubject = "sensornet_general",
	 publisher =	"ACM",
	 address =	"Princeton, NJ, USA",
	 month =		oct,
	 pages =		"143--148",
	 location =	"johnh: folder: xxx",
	 location =	"johnh: pafile",
	 keywords =	"dimensions, sensor network storage",
	 otherurl =		"http://lecs.cs.ucla.edu/%7edeepak/PAPERS/dimensions.pdf",
	 url =		"http://www.isi.edu/%7ejohnh/PAPERS/Ganesan02c.html",
	 pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Ganesan02c.pdf",
	 copyrightholder = "ACM",
	 copyrightterms = "	Permission to make digital or 	hard copies of part or all of this work for personal or 	classroom use is granted without fee provided that copies 	are not made or distributed for profit or commercial 	advantage and that new copies bear this notice and the full 	citation on the first page. Copyrights for components of this 	work owned by others than ACM must be honored. Abstracting with 	credit  is permitted.   	To copy otherwise, to republish, to post on servers or to 	redistribute to lists, requires prior specific permission 	and/or a fee. Request Permissions from 	Publications Dept, ACM Inc., 	Fax +1 (212) 869--0481, or 	[email protected]. ",
	 myorganization =	"USC/Information Sciences Institute",
	 abstract = "
 An important class of networked systems is emerging that involve very
 large numbers of small, low-power, wireless devices. These systems
 offer the ability to sense the environment densely, offering
 unprecedented opportunities for many scientific disciplines to observe
 the physical world. In this paper, we argue that a data handling
 architecture for these devices should incorporate their extreme
 resource constraints---energy, storage and processing---and
 spatio-temporal interpretation of the physical world in the design,
 cost model, and metrics of evaluation. We describe DIMENSIONS, a
 system that provides a unified view of data handling in sensor
 networks, incorporating long-term storage, multi-resolution data
 access and spatio-temporal pattern mining.
 ",
}

An important class of networked systems is emerging that involve very large numbers of small, low-power, wireless devices. These systems offer the ability to sense the environment densely, offering unprecedented opportunities for many scientific disciplines to observe the physical world. In this paper, we argue that a data handling architecture for these devices should incorporate their extreme resource constraints—energy, storage and processing—and spatio-temporal interpretation of the physical world in the design, cost model, and metrics of evaluation. We describe DIMENSIONS, a system that provides a unified view of data handling in sensor networks, incorporating long-term storage, multi-resolution data access and spatio-temporal pattern mining.

@InCollection{ambite2002:kluwer,
  author = 	 {Jos\'{e} Luis Ambite and Yigal Arens and Walter Bourne and Steve Feiner and Luis Gravano and Vasileios Hatzivassiloglou and Eduard Hovy and Judith Klavans and Andrew Philpot and Usha Ramachandran and Kenneth Ross and Jay Sandhaus and Deniz Sarioz and Rolfe R. Schmidt and Cyrus Shahabi and Anurag Singla and Surabhan Temiyabutr and Brian Whitman},
  title = 	 {Data Integration and Access: The Digital Government Research Center's Energy Data Collection {(EDC)} Project},
  booktitle = 	 {Advances in Digital Government: Technology, Human Factors, and Policy},
  publisher = {Kluwer Academic Publishers},
  year = 	 {2002},
  editor = 	 {William J. McIver and Ahmed K. Elmagarmid},
}

@inproceedings{DBLP:conf/its/KimG02,
  author       = {Jihie Kim and
                  Yolanda Gil},
  editor       = {Stefano A. Cerri and
                  Guy Gouard{\`{e}}res and
                  F{\'{a}}bio Paragua{\c{c}}u},
  title        = {Deriving Acquisition Principles from Tutoring Principles},
  booktitle    = {Intelligent Tutoring Systems, 6th International Conference, {ITS}
                  2002, Biarritz, France and San Sebastian, Spain, June 2-7, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2363},
  pages        = {661--670},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-47987-2\_67},
  doi          = {10.1007/3-540-47987-2\_67},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/its/KimG02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@TechReport{Heidemann02a,
	author = "John Heidemann and Fabio Silva and Yan Yu and Deborah Estrin and Padmaparma Haldar",
	title = 	"Diffusion Filters as a Flexible Architecture for Event Notification in Wireless Sensor Networks",
	institution = 	"USC/Information Sciences Institute",
	year = 		2002,
	sortdate = 		"2002-04-01",
	project = "ilense, scadds, scowr",
	jsubject = "sensornet_data_dissemination",
	number =	"ISI-TR-556",
	month =		apr,
	location =	"johnh: folder: xxx",
	location =	"johnh: pafiles",
	keywords =	"diffusion software structure, micronetworking",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann02a.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann02a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
Wireless sensor networks represent an increasingly important example
of distributed event systems.  Unlike Internet-based distributed event
systems, sensor networks are very bandwidth constrained and use sensor
nodes that are often dedicated to the network and controlled by a
single organization.  Bandwidth constraints require, and
administrative homogeneity allows, sensor networks to employ
in-network processing, where application-specific code is used in the
network to optimize data movement.  The contribution of this paper is
to describe the \emph{diffusion filter architecture}, a software
structure for a distributed event system that allows user-supplied
software to interact with event routing.  Sensor network nodes will
span a wide range of capabilities, from tiny single-address space
embedded processors to to desktop-class 32-bit computers.  A second
contribution of our architecture that it scales from 16- to 32-bit
computers with OS support for single or multiple address spaces.  We
describe what software approaches facilitate this flexibility and
quantify the performance differences.
",
}

Wireless sensor networks represent an increasingly important example of distributed event systems. Unlike Internet-based distributed event systems, sensor networks are very bandwidth constrained and use sensor nodes that are often dedicated to the network and controlled by a single organization. Bandwidth constraints require, and administrative homogeneity allows, sensor networks to employ in-network processing, where application-specific code is used in the network to optimize data movement. The contribution of this paper is to describe the \emphdiffusion filter architecture, a software structure for a distributed event system that allows user-supplied software to interact with event routing. Sensor network nodes will span a wide range of capabilities, from tiny single-address space embedded processors to to desktop-class 32-bit computers. A second contribution of our architecture that it scales from 16- to 32-bit computers with OS support for single or multiple address spaces. We describe what software approaches facilitate this flexibility and quantify the performance differences.

@inproceedings{proc_mcerlean:sensornetworks:asilomar02,
 address = {Pacific Grove, CA},
 author = {McErlean, Donal and Narayanan, Shrikanth S.},
 booktitle = {Proceedings of the Asilomar Conference on Signals, Systems and Computers},
 link = {http://sail.usc.edu/publications/files/mcerleanasilomar2002.pdf},
 month = {Nov},
 pages = {1174-1178},
 title = {Distribution detection and tracking in sensor networks},
 year = {2002}
}

@inproceedings{Suh2002,
	author= {Suh, Jinwoo and Kang, Dong-In and Crago, Stephen},
	title= {Dynamic Power Management of Multiprocessor Systems}, 
	booktitle= {Tenth International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS) in conjunction with IPDPS},
	location= {Fort Lauderdale, Florida},
	month= {April},
	year= {2002},
	doi={10.1109/IPDPS.2002.1016483}
}

@inproceedings{ko_dynamic_2002,
	address = {Honolulu Hawaii},
	title = {Dynamic coordination of information management services for processing dynamic web content},
	booktitle = {Proceedings of the {Eleventh} {International} {World} {Wide} {Web} {Conference}, {WWW2002}},
	publisher = {ACM},
	author = {Ko, In-Young and Yao, Ke-Thia and Neches, Robert},
	month = may,
	year = {2002},
	pages = {355--365},
}

@inproceedings{thakkar02:isi,
    author = "Snehal Thakkar and Craig A. Knoblock and Jos\'{e} Luis Ambite and Cyrus Shahabi",
    title = "Dynamically Composing Web Services from On-line Sources",
    booktitle = "Proceeding of {AAAI-2002} Workshop on Intelligent Service Integration",
    month = "July",
    address = "Edmonton, Alberta, Canada",
    pages = "1--7",
    year = "2002",
    urlPaper= "http://usc-isi-i2.github.io/papers/thakkar02-isi.pdf",
    Keywords = {"Service Composition","Data Integration"}
}

@inproceedings{proc_mouchtaris:audiosynthesis:eusipco02,
 address = {Toulose, France},
 author = {Mouchtaris, Athanasios and Narayanan, Shrikanth S. and Kyriakakis, Chris},
 booktitle = {Proceedings of the European Signal Processing Conference (EUSIPCO)},
 link = {http://sail.usc.edu/publications/files/mouchtaris_spc_2002.pdf},
 month = {Sep},
 pages = {413-416},
 title = {Efficient multichannel audio resynthesis by subband-based spectral conversion},
 year = {2002}
}

@article{chalupsky02:aimag,
       author="Hans Chalupsky and Yolanda Gil and Craig A. Knoblock and Kristina Lerman and Jean Oh and David V. Pynadath and Thomas Russ and Milind Tambe",
       title="Electric Elves: Agent Technology for Supporting Human Organizations",
       journal="AI Magazine",
       volume = 23,
       number = 2,
       month = "Summer",
       pages = "11-24",
       year=2002,
       urlPaper= "http://usc-isi-i2.github.io/papers/chalupsky02-aimag.pdf",
       	Keywords = {"Information Agents"}}

@Article{ElvesAIM,
  author =       "H. Chalupsky and Y. Gil and Craig A. Knoblock and Kristina Lerman and J. Oh and D.V. Pynadath and T.A. Russ and M. Tambe",
  title =        "Electric Elves: Applying Agent Technology to Support Human Organizations",
  pages =        "11--24",
  journal =      "AI Magazine",
  year =         "2002",
  volume =       {23},
  number =       {2},
  annote =    {also in Proceedings of the Thirteenth Annual Conference on Innovative Applications of
                    Artificial Intelligence ({IAAI}-2001), Seattle, WA},
  keywords =    {semantic-modeling},
  }

@inproceedings{proc_bulut:expressivespeech:icslp02,
 address = {Denver, CO},
 author = {Bulut, Murtaza and Narayanan, Shrikanth S. and Syrdal, Ann},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/bulutinterspeech2002.pdf},
 month = {Sep},
 pages = {1265-1268},
 title = {Expressive speech synthesis using a concatenative synthesizer},
 year = {2002}
}

@article{2002PhRvA..65f0701B,
	Adsnote = {Provided by the SAO/NASA Astrophysics Data System},
	Adsurl = {http://adsabs.harvard.edu/abs/2002PhRvA..65f0701B},
	Author = {{Bartschat}, K. and {Riordan}, S. and {Ver Steeg}, Greg},
	Doi = {10.1103/PhysRevA.65.060701},
	Journal = {Physical Review A},
	Keywords = {Atomic excitation and ionization by electron impact},
	Month = jun,
	Number = 6,
	Title = {{Extraction of energy-differential ionization cross sections in time-dependent calculations}},
	Volume = 65,
	Year = {2002},
	Bdsk-Url-1 = {http://dx.doi.org/10.1103/PhysRevA.65.060701}}

@InProceedings{Dutta02d,
	author = "Debojyoti Dutta and Ashish Goel and John Heidemann",
	title = 	"Faster Network Design with Scenario Pre-filtering",
	booktitle = 	"Proceedings of the " # " International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems",
	year = 		2002,
	sortdate = "2002-10-01",
	project = "ant, saman",
	jsubject = "network_simulation",
	publisher =	"IEEE",
	address =	"Fort Worth, Texas, USA",
	month =		oct,
	pages =		"237--246",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"asim, ns-2",
	copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta02d.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta02d.pdf",
	psurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta02d.ps.gz",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
The design and engineering of networks requires the consideration of
many possible configurations (different network topologies,
bandwidths, traffic and policies). Network engineers may use network
simulation to evaluate changes in network configuration, but detailed,
packet-level simulation of many alternatives would be extremely time
consuming.  This paper introduces the concept of scenario
pre-filtering---rather than perform detailed simulation of each
scenario, we propose to quickly evaluate (pre-filter) all scenarios in
order to select only the relevant scenarios and discard those that are
clearly too over- or under-provisioned. To rapidly evaluate scenarios,
we have developed several new analytical techniques to quickly
determine the steady-state behavior of the network with both bulk and
short term TCP flows.  These techniques apply to arbitrary topologies
and routers that use both drop-tail and RED queuing policies. Since we
are only interested in selecting the interesting scenarios for
detailed simulation, the answers need only be approximate.  However,
we show that accuracy is typically within 10\% of detailed
simulation. More importantly, these techniques are 10-300x faster than
detailed simulation, and, hence, pre-filtering is a promising
technique to reduce the total simulation time when many scenarios must
be considered.
",
}

The design and engineering of networks requires the consideration of many possible configurations (different network topologies, bandwidths, traffic and policies). Network engineers may use network simulation to evaluate changes in network configuration, but detailed, packet-level simulation of many alternatives would be extremely time consuming. This paper introduces the concept of scenario pre-filtering—rather than perform detailed simulation of each scenario, we propose to quickly evaluate (pre-filter) all scenarios in order to select only the relevant scenarios and discard those that are clearly too over- or under-provisioned. To rapidly evaluate scenarios, we have developed several new analytical techniques to quickly determine the steady-state behavior of the network with both bulk and short term TCP flows. These techniques apply to arbitrary topologies and routers that use both drop-tail and RED queuing policies. Since we are only interested in selecting the interesting scenarios for detailed simulation, the answers need only be approximate. However, we show that accuracy is typically within 10% of detailed simulation. More importantly, these techniques are 10-300x faster than detailed simulation, and, hence, pre-filtering is a promising technique to reduce the total simulation time when many scenarios must be considered.

@inproceedings{proc_dibazar:pathological:ieeeembs02,
 address = {Houston, Texas},
 author = {Dibazar, Alireza A. and Narayanan, Shrikanth S. and Berger, Theodore W.},
 booktitle = {Proceedings of the IEEE Engineering in Medicine and Biology Society (EMBS) Meeting},
 doi = {10.1109/IEMBS.2002.1134447},
 keyword = {HMM, Mel frequency filters, pathological speech},
 link = {http://sail.usc.edu/publications/files/dibazarembs2002.pdf},
 month = {Oct},
 pages = {182-183},
 title = {Feature analysis for automatic detection of pathological speech},
 year = {2002}
}

@TechReport{Chen02a,
	author = 	"Xuan Chen and John Heidemann",
	title = 	"Flash crowd mitigation via an adaptive admission control based on application-level measurement",
	institution = 	"USC/Information Sciences Institute",
	year = 		2002,
	sortdate = 		"2002-05-01",
	project = "ant, saman, conser",
	jsubject =  "chronological",
	number =	"ISI-TR-557",
	month =		may,
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile xxx",
	keywords =	"NEWS, admission control, congestion control",
	otherurl =	"https://ant.isi.edu/%7exuanc/paper/news.pdf",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chen02a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Chen02a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
We propose the network early warning system (NEWS) to protect servers
and networks from flash crowds, which usually happen when too many
requests are sent to a web site simultaneously. NEWS is an self-tuning
admission control mechanism, which imposes application-level
congestion control (AppCC) between requests and responses. NEWS
detects flash crowds from changes in web response rate.  Based on the
application-level observations, NEWS adjusts the admitted request rate
automatically and adaptively.  Simulation results show that NEWS
detects flash crowds within 10 minutes (about 2-3 detection
intervals). By delaying 56\% of requests, NEWS is able to reduce the
packet drop rate for responses from 17\% to 1\%. The aggregated
response rate for admitted requests is twice as fast with NEWS as
compared to without. This performance is similar to the best possible
rate limiter.
",
}

We propose the network early warning system (NEWS) to protect servers and networks from flash crowds, which usually happen when too many requests are sent to a web site simultaneously. NEWS is an self-tuning admission control mechanism, which imposes application-level congestion control (AppCC) between requests and responses. NEWS detects flash crowds from changes in web response rate. Based on the application-level observations, NEWS adjusts the admitted request rate automatically and adaptively. Simulation results show that NEWS detects flash crowds within 10 minutes (about 2-3 detection intervals). By delaying 56% of requests, NEWS is able to reduce the packet drop rate for responses from 17% to 1%. The aggregated response rate for admitted requests is twice as fast with NEWS as compared to without. This performance is similar to the best possible rate limiter.

@inproceedings{proc_mouchtaris:guassianmixture:audioengg02,
 address = {Los Angeles, CA},
 author = {Mouchtaris, Athanasios and Narayanan, Shrikanth S. and Kyriakakis, Chris},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of the Audio Engineering Society (AES) Convention},
 link = {http://sail.usc.edu/publications/files/MouchtarisAES2002.pdf},
 month = {Oct},
 title = {Gaussian mixture model based methods for virtual microphone signal synthesis},
 year = {2002}
}

@InProceedings{Kamath02a,
	author = 	"Purushotham Kamath and Kun-chan Lan and John Heidemann and Joe Bannister and Joe Touch",
	title = 	"Generation of High Bandwidth Network Traffic Traces",
	booktitle = 	"Proceedings of the " # " International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems",
	year = 		2002,
	sortdate = 		"2002-10-01", 
	project = "ant, saman, conser",
	jsubject = "traffic_modeling",
	publisher =	"IEEE",
	address =	"Fort Worth, Texas, USA",
	month =		oct,
	pages =		"401--410",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"RAMP, trace generation",
	copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Kamath02a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Kamath02a.pdf",
	psurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Kamath02a.ps.gz",
	myorganization =	"USC/Information Sciences Institute",
	usessoftware = "stream_merger",
	abstract = "
High bandwidth network traffic traces are needed to understand the
behavior of high speed networks (such as the Internet
backbone). However, the implementation of a mechanism to collect such
traces is difficult in practice.  In the absence of real traces, tools
to generate high bandwidth traces would aid the study of high speed
network behavior.  We describe three methods of generating high
bandwidth network traces: scaling low bandwidth network traffic
traces, merging multiple low bandwidth traces and generating traces
through simulation by scaling a structural model of real world traces.
We evaluate the generated traces and discuss the advantages and
disadvantages of each method. We also discuss some of the issues
involved in generating traces by the structural model method.",
}

High bandwidth network traffic traces are needed to understand the behavior of high speed networks (such as the Internet backbone). However, the implementation of a mechanism to collect such traces is difficult in practice. In the absence of real traces, tools to generate high bandwidth traces would aid the study of high speed network behavior. We describe three methods of generating high bandwidth network traces: scaling low bandwidth network traffic traces, merging multiple low bandwidth traces and generating traces through simulation by scaling a structural model of real world traces. We evaluate the generated traces and discuss the advantages and disadvantages of each method. We also discuss some of the issues involved in generating traces by the structural model method.

@inproceedings{ambite02:iaai,
        author="Jos\'{e} Luis Ambite and Greg Barish and Craig A. Knoblock and Maria Muslea and Jean Oh and Steven Minton",
        title="Getting from Here to There: Interactive Planning and Agent Execution for Optimizing Travel",
        booktitle="Proceedings of the Fourteenth Conference on Innovative Applications of Artificial Intelligence (IAAI-2002)",
        address="AAAI Press, Menlo Park, CA",
        pages="862--869",
        year=2002,
        urlPaper= "http://usc-isi-i2.github.io/papers/ambite02-iaai.pdf",
       	Keywords = {"Information Agents"}
}

@InProceedings{	  deelman2002ligo,
  Author	= {Ewa Deelman and Carl Kesselman and Gaurang Mehta and Leila
		  Meshkat and Laura Pearlman and Kent Blackburn and Phil
		  Ehrens and Albert Lazzarini and Roy Williams and Scott
		  Koranda},
  URL		= {http://pegasus.isi.edu/publications/ewa/hpdc11.pdf},
  Title		= {GriPhyN and LIGO, Building a Virtual Data Grid for
		  Gravitational Wave Scientists},
  BookTitle	= {High Performance Distributed Computing (HPDC)},
  Year		= {2002}
}

@inproceedings{Venugopal2002Hardware-e,
	abstract = {This paper presents a novel approach to implement a narrow band Finite Impulse Response (FIR) digital filter that requires less hardware than traditional FIR filter implementations. The hardware efficient Canonic Signed Digit (CSD) multiplier is used instead of the conventional multiplier to reduce the hardware. The digital filter has been initially designed using Simulink, DSP Blockset and has been tested for the required frequency response using Matlab. The FIR filter has been modeled and verified using Verilog HDL and is implemented using FPGA Xilinx 4000 technology. The use of the multistage multirate approach for the design of the FIR filter stages results in a hardware saving of about 80{%}.},
	author = {Venugopalan, Vivek and Abed, Khalid and Siferd, Raymond and Nerurkar, Shailesh},
	booktitle = {The 45th Midwest Symposium on Circuits and Systems, (MWSCAS-2002)},
	date-added = {2020-01-15 12:00:21 -0500},
	date-modified = {2020-01-15 12:00:21 -0500},
	keywords = {FIR filters; field programmable gate arrays; frequency response; CSD multiplier; DSP Blockset; FPGA Xilinx 4000; Matlab; Simulink; Verilog HDL model; frequency response; hardware efficiency; multistage multirate design; narrow-band FIR digital filter},
	pages = {223-226},
	title = {{Hardware Efficient Narrow Band FIR Filter}},
	ty = {CONF},
	vo = {2},
	volume = {2},
	year = {2002},
	month = sep,
	Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxAwLi4vLi4vcmVmZXJlbmNlcy9QREYvVmVudWdvcGFsMjAwMkhhcmR3YXJlLWUucGRmTxEBkgAAAAABkgACAAAMTWFjaW50b3NoIEhEAAAAAAAAAAAAAAAAAAAAAAAAAEJEAAH/////G1ZlbnVnb3BhbDIwMDJIYXJkd2FyZS1lLnBkZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP////8AAAAAAAAAAAAAAAAAAgADAAAKIGN1AAAAAAAAAAAAAAAAAANQREYAAAIAQS86VXNlcnM6dml2ZWt2OkRyb3Bib3g6cmVmZXJlbmNlczpQREY6VmVudWdvcGFsMjAwMkhhcmR3YXJlLWUucGRmAAAOADgAGwBWAGUAbgB1AGcAbwBwAGEAbAAyADAAMAAyAEgAYQByAGQAdwBhAHIAZQAtAGUALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAD9Vc2Vycy92aXZla3YvRHJvcGJveC9yZWZlcmVuY2VzL1BERi9WZW51Z29wYWwyMDAySGFyZHdhcmUtZS5wZGYAABMAAS8AABUAAgAN//8AAAAIAA0AGgAkAFcAAAAAAAACAQAAAAAAAAAFAAAAAAAAAAAAAAAAAAAB7Q==}}

This paper presents a novel approach to implement a narrow band Finite Impulse Response (FIR) digital filter that requires less hardware than traditional FIR filter implementations. The hardware efficient Canonic Signed Digit (CSD) multiplier is used instead of the conventional multiplier to reduce the hardware. The digital filter has been initially designed using Simulink, DSP Blockset and has been tested for the required frequency response using Matlab. The FIR filter has been modeled and verified using Verilog HDL and is implemented using FPGA Xilinx 4000 technology. The use of the multistage multirate approach for the design of the FIR filter stages results in a hardware saving of about 80%.

@inproceedings{bnl,
	Author = {Greg {Ver Steeg} and {PHENIX collaboration}},
	Booktitle = {American Physical Society, 2002 Fall Meeting of the Division of Nuclear Physics},
	Number = {2002APS.DNP5P1053V},
	Title = {Hodoscope Tracker Upgrade to PHENIX for Isolating W Production in Polarized Proton Collisions at s=500 GeV at RHIC},
	Year = {2002}}

@inproceedings{DBLP:conf/ekaw/GilR02,
  author       = {Yolanda Gil and
                  Varun Ratnakar},
  editor       = {Asunci{\'{o}}n G{\'{o}}mez{-}P{\'{e}}rez and
                  V. Richard Benjamins},
  title        = {{IKRAFT:} Interactive Knowledge Representation and Acquisition from
                  Text},
  booktitle    = {Knowledge Engineering and Knowledge Management. Ontologies and the
                  Semantic Web, 13th International Conference, {EKAW} 2002, Siguenza,
                  Spain, October 1-4, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2473},
  pages        = {27--36},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45810-7\_5},
  doi          = {10.1007/3-540-45810-7\_5},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/ekaw/GilR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{proc_li:seakerid:icassp02,
 address = {Orlando, FL},
 author = {Li, Ying and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 bib2html_rescat = {mica},
 booktitle = {Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2002.5745047},
 link = {http://sail.usc.edu/publications/files/LiICASSP2002.pdf},
 month = {May},
 pages = {2093-2096},
 title = {Identification of speakers in movie dialogs using audiovisual cues},
 year = {2002}
}

@inproceedings{DBLP:conf/icdcs/IntanagonwiwatEGH02,
  author       = {Chalermek Intanagonwiwat and
                  Deborah Estrin and
                  Ramesh Govindan and
                  John S. Heidemann},
  title        = {Impact of Network Density on Data Aggregation in Wireless Sensor Networks},
  booktitle    = {Proceedings of the 22nd International Conference on Distributed Computing
                  Systems (ICDCS'02), Vienna, Austria, July 2-5, 2002},
  pages        = {457--458},
  publisher    = {{IEEE} Computer Society},
  year         = {2002},
  url          = {https://doi.org/10.1109/ICDCS.2002.1022289},
  doi          = {10.1109/ICDCS.2002.1022289},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icdcs/IntanagonwiwatEGH02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{burns2002implementing,
  title={Implementing Address Assurance in the Intel IXP Router},
  author={Burns, Michael and Prier, Gregory and Mirkovic, Jelena and Reiher, Peter},
  booktitle={Western Network Processors Conference},
  year={2002}
}

@inproceedings{burns2002implementing,
  title={Implementing address assurance in the intel ixp},
  author={Burns, Michael and Prier, Gregory and Mirkovic, Jelena and Reiher, Peter},
  booktitle={Proceedings of the Network Processors Conference (NPC)},
  year={2002}
}

@inproceedings{ambite2002:freight,
        author="Jos\'{e} Luis Ambite and Genevieve Giuliano and Peter Gordon and Qisheng Pan and Sandipan Bhattacharjee",
        title="Integrating Heterogeneous Sources for Better Freight Flow Analysis and Planning",
        booktitle="Proceedings of the Second National Conference on Digital Government Research (dg.o 2002)",
        address="Redondo Beach, California",
	urlPaper="http://www.isi.edu/~ambite/SGER-2002-4-30.pdf",
        year=2002
}

@inproceedings{ gil-kim-cogsci02,
 title = {Interactive Knowledge Acquisition Tools: A Tutoring Perspective},
 author = {Yolanda Gil and Jihie Kim},
 booktitle = {Proceedings of the 24th Annual Meeting of the Cognitive Science Society (CogSci), Fairfax, VA, August 8-10},
 year = {2002},
 url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/gil-kim-cogsci02.pdf }
 }

@article{wroclawski2002internet,
	author = {Wroclawski, John},
	title = {Internet Draft David L. Black Document: draft-black-rdma-concerns-00. txt EMC Expires: November 2002 Michael F. Speer Sun},
	year = {2002}}

@article{hardaker2002justification,
  title={Justification and Requirements for a National {DDoS} Defense Technology Evaluation Facility},
  author={Hardaker, Wes and Kindred, Darrell and Ostrenga, Ron and Sterne, Dan and Thomas, Roshan},
  journal={Network Associates Laboratories Report},
  pages={02--052},
  year={2002},
}

@Inproceedings{tejada02:kdd,
   Author = "Sheila Tejada and Craig A. Knoblock and Steven Minton",
   Title = "Learning Domain-Independent String Transformation Weights for High Accuracy Object Identification",
   Booktitle = "Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2002)",
   Address = "Edmonton, Alberta, Canada", 
   Year = 2002,
   urlPaper= "http://usc-isi-i2.github.io/papers/tejada02-kdd.pdf",
   Keywords = {"Record Linkage"}}

@PhDThesis{tejada02:thesis,
   Author = "Sheila Tejada",
   Title = "Learning Object Identification Rules for Information Integration",
   School = "Department of Computer Science, University of Southern California",
   Year = "2002",
   urlLink= "http://tinyurl.com/y874bhx",
   urlPaper= "http://usc-isi-i2.github.io/papers/tejada01-is.pdf",
   Keywords = {"Record Linkage"}}

@inproceedings{barish02:webdb,
  author = "Greg Barish and Craig A. Knoblock",
  title = "Learning efficient value predictors for speculative plan execution",
  booktitle = "Proceedings of the Fifth International Workshop on the World Wide Web and Databases ({WebDB 2002})",
  address = "Madison, WI",
  pages = "77--82",
  year = "2002",
  urlPaper= "http://usc-isi-i2.github.io/papers/barish02-webdb.pdf",
  Keywords = {"Dataflow Execution","Information Gathering"}
}

@article{vander2002lessons,
  title={Lessons Learned from Users’ Experiences with Spreadsheet Constraints in the Garnet and Amulet Graphical Toolkits},
  author={Vander Zanden, Bradley T and Halterman, Richard and Myers, Brad A and Miller, Rob and Szekely, Pedro and Giuse, Dario A and Kosbie, David and McDaniel, Rich},
  year={2002}
}

@inproceedings{proc_johnson:ldsexpressive:ieeeworkshop02,
 address = {Santa Monica, CA},
 author = {Johnson, Lewis and Narayanan, Shrikanth S. and Whitney, Richard and Das, Rajat and LaBore, Catharine},
 booktitle = {Proceedings of the IEEE Speech Synthesis Workshop},
 doi = {10.1109/WSS.2002.1224399},
 keyword = {EMOTION},
 link = {http://sail.usc.edu/publications/files/JohnsonSpeechSynthesis2002.pdf},
 month = {Sep},
 title = {Limited domain synthesis of expressive military speech for animated characters},
 year = {2002}
}

@inproceedings{Nerurkar2002Low-power-,
	abstract = {This paper presents an efficient design and implementation of a low power sigma delta digital decimation filter. We implement a low power decimation filter with a narrow transition finite impulse response (FIR) filter using a canonic signed digit number (CSD) system. We use multi-stage multi-rate signal processing to design and implement half-band filters and narrow transition band FIR filters. The decimation filter is designed using Simulink, DSP Blockset and simulated using Matlab. The FIR filter has been coded in Verilog and implemented using FPGA Xilinx 4000 technology. The power consumption of the proposed decimation filter is reduced by 67{\%} compared to the conventional 4-stage comb-FIR architecture.},
	author = {Nerurkar, Shailesh and Abed, Khalid and Siferd, Raymond and Venugopalan, Vivek},
	booktitle = {The 45th Midwest Symposium on Circuits and Systems, (MWSCAS-2002)},
	date-added = {2020-01-15 12:00:21 -0500},
	date-modified = {2020-01-15 12:00:21 -0500},
	keywords = {FIR filters; circuit simulation; comb filters; digital arithmetic; integrated circuit design; logic design; logic simulation; low-power electronics; sigma-delta modulation; CSD system; FPGA; canonic signed digit number system; comb filter; digital decimation filter; filter power consumption reduction; finite impulse response filter; half-band filters; low power filter; multi-rate signal processing; multi-stage signal processing; narrow transition FIR filter; sigma delta decimation filter; sigma delta modulator},
	pages = {I--647-50 vol.1},
	title = {Low Power Sigma Delta Decimation Filter},
	ty = {CONF},
	vo = {1},
	volume = {1},
	year = {2002},
	month = aug,
	Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxAvLi4vLi4vcmVmZXJlbmNlcy9QREYvTmVydXJrYXIyMDAyTG93LXBvd2VyLS5wZGZPEQGMAAAAAAGMAAIAAAxNYWNpbnRvc2ggSEQAAAAAAAAAAAAAAAAAAAAAAAAAQkQAAf////8aTmVydXJrYXIyMDAyTG93LXBvd2VyLS5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA/////wAAAAAAAAAAAAAAAAACAAMAAAogY3UAAAAAAAAAAAAAAAAAA1BERgAAAgBALzpVc2Vyczp2aXZla3Y6RHJvcGJveDpyZWZlcmVuY2VzOlBERjpOZXJ1cmthcjIwMDJMb3ctcG93ZXItLnBkZgAOADYAGgBOAGUAcgB1AHIAawBhAHIAMgAwADAAMgBMAG8AdwAtAHAAbwB3AGUAcgAtAC4AcABkAGYADwAaAAwATQBhAGMAaQBuAHQAbwBzAGgAIABIAEQAEgA+VXNlcnMvdml2ZWt2L0Ryb3Bib3gvcmVmZXJlbmNlcy9QREYvTmVydXJrYXIyMDAyTG93LXBvd2VyLS5wZGYAEwABLwAAFQACAA3//wAAAAgADQAaACQAVgAAAAAAAAIBAAAAAAAAAAUAAAAAAAAAAAAAAAAAAAHm}}

This paper presents an efficient design and implementation of a low power sigma delta digital decimation filter. We implement a low power decimation filter with a narrow transition finite impulse response (FIR) filter using a canonic signed digit number (CSD) system. We use multi-stage multi-rate signal processing to design and implement half-band filters and narrow transition band FIR filters. The decimation filter is designed using Simulink, DSP Blockset and simulated using Matlab. The FIR filter has been coded in Verilog and implemented using FPGA Xilinx 4000 technology. The power consumption of the proposed decimation filter is reduced by 67% compared to the conventional 4-stage comb-FIR architecture.

@ARTICLE{Lerman02,
  author =       {Kristina Lerman and Aram Galstyan},
  title =        {Mathematical Model of Foraging in a Group of Robots: Effect of Interference},
  journal =      {Autonomous Robots},
  year =         {2002},
  volume =       {13},
  number =       {2},
  pages =        {127--141},
  month =        {},
  urlPaper={http://www.isi.edu/~lerman/papers/foraging.pdf},
  keywords =    {multi-agent-systems},
}

@inproceedings{proc_mouchtaris:audiosynthesis:asilomar02,
 address = {Pacific Grove, CA},
 author = {Mouchtaris, Athanasios and Narayanan, Shrikanth S. and Kyriakakis, Chris},
 booktitle = {Proceedings of the Asilomar Conference on Signals, Systems and Computers},
 doi = {10.1109/ACSSC.2002.1197182},
 link = {http://sail.usc.edu/publications/files/mouchtarisasilomar2002.pdf},
 month = {Nov},
 pages = {227-232},
 title = {Maximum likelihood constrained adaptation for multichannel audio synthesis},
 year = {2002}
}

@inproceedings{proc_mouchtaris:audioresynthesis:icme02,
 address = {Lausanne, Switzerland},
 author = {Mouchtaris, Athanasios and Narayanan, Shrikanth S. and Kyriakakis, Chris},
 booktitle = {Proceedings of the IEEE International Conference on Multimedia Expo (ICME)},
 doi = {10.1109/ICME.2002.1035574},
 link = {http://sail.usc.edu/publications/files/mouchtarisicme2002.pdf},
 month = {Aug},
 pages = {273- 276},
 title = {Multiresolution spectral conversion for multichannel audio resynthesis},
 year = {2002}
}

@proceedings {abramsonnomad,
	title = {NOMAD-An Integrated Mobility Management Architecture for Cellular and Mobile IP Services},
	journal = {UC Davis Graduate Symposium},
	year = {2002},
	month = mar,
	address = {Davis, California},
	author = {Abramson, Jeremy and Ghosal, Dipak}
}

@Manual{Silva02a,
	title = 	"Network Routing Application Programmer's
                         Interface (API) and Walk Through 9.0.1",
	author =	"Fabio Silva and John Heidemann and Ramesh Govindan",
	organization =	"USC/Information Sciences Institute",
	year =		2002,
	sortdate = "2002-12-01",
	project = "ilense, scadds",
	jsubject = "sensornet_data_dissemination",
	month =		dec,
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"push diffusion documentation",
	otherurl =		"http://www.isi.edu/scadds/papers/nr_api_9_0_1.pdf",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Silva02a.html",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Silva02a.pdf",
	copyrightholder = "authors", 
	myorganization =	"USC/Information Sciences Institute",
	abstract = "(No formal abstract) Programming API to directed
                         diffusion, manual release 9.0.1"
}

(No formal abstract) Programming API to directed diffusion, manual release 9.0.1

@article{tangmunarunkit_acm_2002,
author = {Tangmunarunkit, Hongsuda and Govindan, Ramesh and Jamin, Sugih and Shenker, Scott and Willinger, Walter},
title = {Network Topologies, Power Laws, and Hierarchy},
year = {2002},
issue_date = {January 2002},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {32},
number = {1},
issn = {0146-4833},
url = {https://doi.org/10.1145/510726.510750},
doi = {10.1145/510726.510750},
journal = {SIGCOMM Comput. Commun. Rev.},
month = {jan},
pages = {76},
numpages = {1}
}

@article{tangmunarunkit_sigcomm_2002,
  author = {Tangmunarunkit, Hongsuda and Govindan, Ramesh and Jamin, Sugih and Shenker, Scott and Willinger, Walter},
  title = {Network Topology Generators: Degree-Based vs. Structural},
  year = {2002},
  issue_date = {October 2002},
  publisher = {Association for Computing Machinery},
  address = {New York, NY, USA},
  volume = {32},
  number = {4},
  issn = {0146-4833},
  url = {https://doi.org/10.1145/964725.633040},
  doi = {10.1145/964725.633040},
  abstract = {Following the long-held belief that the Internet is hierarchical, the network topology generators most widely used by the Internet research community, Transit-Stub and Tiers, create networks with a deliberately hierarchical structure. However, in 1999 a seminal paper by Faloutsos et al. revealed that the Internet's degree distribution is a power-law. Because the degree distributions produced by the Transit-Stub and Tiers generators are not power-laws, the research community has largely dismissed them as inadequate and proposed new network generators that attempt to generate graphs with power-law degree distributions.Contrary to much of the current literature on network topology generators, this paper starts with the assumption that it is more important for network generators to accurately model the large-scale structure of the Internet (such as its hierarchical structure) than to faithfully imitate its local properties (such as the degree distribution). The purpose of this paper is to determine, using various topology metrics, which network generators better represent this large-scale structure. We find, much to our surprise, that network generators based on the degree distribution more accurately capture the large-scale structure of measured topologies. We then seek an explanation for this result by examining the nature of hierarchy in the Internet more closely; we find that degree-based generators produce a form of hierarchy that closely resembles the loosely hierarchical nature of the Internet.},
  journal = {SIGCOMM Comput. Commun. Rev.},
  month = {aug},
  pages = {147–159},
  numpages = {13},
  keywords = {degree-based generators, hierarchy, topology generators, topology metrics, network topology, large-scale structure, structural generators, topology characterization}
}

Following the long-held belief that the Internet is hierarchical, the network topology generators most widely used by the Internet research community, Transit-Stub and Tiers, create networks with a deliberately hierarchical structure. However, in 1999 a seminal paper by Faloutsos et al. revealed that the Internet's degree distribution is a power-law. Because the degree distributions produced by the Transit-Stub and Tiers generators are not power-laws, the research community has largely dismissed them as inadequate and proposed new network generators that attempt to generate graphs with power-law degree distributions.Contrary to much of the current literature on network topology generators, this paper starts with the assumption that it is more important for network generators to accurately model the large-scale structure of the Internet (such as its hierarchical structure) than to faithfully imitate its local properties (such as the degree distribution). The purpose of this paper is to determine, using various topology metrics, which network generators better represent this large-scale structure. We find, much to our surprise, that network generators based on the degree distribution more accurately capture the large-scale structure of measured topologies. We then seek an explanation for this result by examining the nature of hierarchy in the Internet more closely; we find that degree-based generators produce a form of hierarchy that closely resembles the loosely hierarchical nature of the Internet.

@TechReport{Dutta02b,
	author = 	"Debojyoti Dutta and Ashish Goel and John Heidemann",
	title = 	"Oblivious AQM and Nash Equilibria",
	institution = 	"University of Southern California Computer Science Department",
	year = 		2002,
	sortdate = 	"2002-07-01", 
	project = "ant, saman",
	jsubject = "networking",
	number =	"02-764",
	month =		jul,
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"router buffer strategies, nash equilibria",
	otherurl =		"ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/02-764.pdf",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta02b.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta02b.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta02b.pdf",
	otherurl = 	"ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/02-764.pdf",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
An oblivious Active Queue Management scheme is one which does not
differentiate between packets belonging to different flows. In this
paper, we study the existence and the quality of Nash equilibria
imposed by oblivious AQM schemes on selfish agents. Oblivious AQM
schemes are of obvious importance because of the ease of
implementation and deployment, and Nash equilibrium offers valuable
clues into network performance under non-cooperative user
behavior. Specifically, we ask the following three questions:  1) Do
there exist oblivious AQM schemes that impose Nash equilibria on
selfish agents?  2) Are the imposed equilibria, if they exist,
efficient in terms of the goodput obtained and the drop probability
experienced at the equilibrium?  3) How easy is it for selfish users
to reach the Nash equilibrium state?  We assume that the traffic
sources are Poisson but the users can control the average rate. We
show that drop-tail and RED do not impose Nash equilibria. We modify
RED slightly to obtain an oblivious scheme, VLRED, that imposes a Nash
equilibrium, but is not efficient. We then present another AQM policy,
EN-AQM, that can impose an efficient Nash equilibrium. Finally, we
show that for any oblivious AQM, the Nash equilibrium imposed on
selfish agents is highly sensitive as the number of agents increases,
thus making it hard for the users to converge to the Nash equilibrium,
and motivating the need for equilibria-aware protocols.
",
}

An oblivious Active Queue Management scheme is one which does not differentiate between packets belonging to different flows. In this paper, we study the existence and the quality of Nash equilibria imposed by oblivious AQM schemes on selfish agents. Oblivious AQM schemes are of obvious importance because of the ease of implementation and deployment, and Nash equilibrium offers valuable clues into network performance under non-cooperative user behavior. Specifically, we ask the following three questions: 1) Do there exist oblivious AQM schemes that impose Nash equilibria on selfish agents? 2) Are the imposed equilibria, if they exist, efficient in terms of the goodput obtained and the drop probability experienced at the equilibrium? 3) How easy is it for selfish users to reach the Nash equilibrium state? We assume that the traffic sources are Poisson but the users can control the average rate. We show that drop-tail and RED do not impose Nash equilibria. We modify RED slightly to obtain an oblivious scheme, VLRED, that imposes a Nash equilibrium, but is not efficient. We then present another AQM policy, EN-AQM, that can impose an efficient Nash equilibrium. Finally, we show that for any oblivious AQM, the Nash equilibrium imposed on selfish agents is highly sensitive as the number of agents increases, thus making it hard for the users to converge to the Nash equilibrium, and motivating the need for equilibria-aware protocols.

@Article{Dutta02c,
	author = "Debojyoti Dutta and Ashish Goel and John Heidemann",
	title = "Oblivious AQM and Nash Equilibria (abstract for SIGCOMM Poster)",
	journal = "ACM Computer Communication Review",
	volume = 32,
	number = 3,
	pages = 20,
	year = 2002,
	sortdate = "2002-07-01",
	project = "ant, saman",
	jsubject = "networking",
	month = jul,
	note = "For full paper, see USC-CS-TR-764, July 2002",
	myorganization = "USC/Information Sciences Institute",
	abstract = "(no abstract)",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta02c.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta02c.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta02c.pdf",
	otherurl = 	"ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/02-764.pdf",
	myorganization =	"USC/Information Sciences Institute",
}

(no abstract)

@techreport {deelman2002pegasus,
	title = {Pegasus: Planning for Execution in Grids},
	number = {Technical Report 2002-20},
	year = {2002},
	institution = {GriPhyN},
	url = {http://pegasus.isi.edu/publications/ewa/pegasus_overview.pdf},
	author = {Ewa Deelman and James Blythe and Yolanda Gil and Carl Kesselman}
}

@inproceedings{10.5555/1289189.1289193,
author = {Boschee, Elizabeth and Miller, Scott and Ramshaw, Lance and Weischedel, Ralph},
title = {Rapid Annotation through Human-Machine Collaboration},
year = {2002},
publisher = {Morgan Kaufmann Publishers Inc.},
address = {San Francisco, CA, USA},
abstract = {This paper addresses the problem of efficiently obtaining training data for a new entity type or relation. We describe a methodology for rapidly obtaining annotation by using seed examples and human feedback, and we show that this method allows annotation to be performed approximately 20 times faster than manual annotation alone, with small degradation in annotation accuracy.},
booktitle = {Proceedings of the Second International Conference on Human Language Technology Research},
pages = {187–189},
numpages = {3},
location = {San Diego, California},
series = {HLT '02}
}

This paper addresses the problem of efficiently obtaining training data for a new entity type or relation. We describe a methodology for rapidly obtaining annotation by using seed examples and human feedback, and we show that this method allows annotation to be performed approximately 20 times faster than manual annotation alone, with small degradation in annotation accuracy.

@Article{Lan02c,
	author = 	"Kun-Chan Lan and John Heidemann",
	title = 	"Rapid model parameteration from traffic measurement",
	journal = 	"ACM Transactions on Modeling and Computer Simulations",
	year = 		2002,
	sortdate = 		"2002-07-01",
	project = "ant, saman",
	jsubject = "traffic_modeling",
	volume =	12,
	number =	3,
	month =		jul,
	pages =		"201--229",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"ramp, model parameterization",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Lan02c.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Lan02c.pdf",
	otherurl = "http://portal.acm.org/citation.cfm?id=643117&coll=portal&dl=ACM&CFID=12087341&CFTOKEN=69397981",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ",
	abstract = "
The utility of simulations and analysis heavily relies on good models
of network traffic. While network traffic constantly changing over
time, existing approaches typically take years from collecting trace,
analyzing the data to finally generating and implementing models. In
this paper, we describe approaches and tools that support rapid
parameterization of traffic models from live network
measurements. Rather than treating measured traffic as a time-series
of statistics, we utilize the traces to estimate end-user behavior and
network conditions to generate application-level simulation models. We
also show multi-scaling analytic techniques are helpful for debugging
and validating the model. To demonstrate our approaches, we develop
structural source-level models for web and FTP traffic and evaluate
their accuracy by comparing the outputs of simulation against the
original trace. We also compare our work with existing traffic
generation tool and show our approach is more flexible in capturing
the heterogeneity of traffic.  Finally, we automate and integrate the
process from trace analysis to model validation for easy model
parameterization from new data.
",
}

The utility of simulations and analysis heavily relies on good models of network traffic. While network traffic constantly changing over time, existing approaches typically take years from collecting trace, analyzing the data to finally generating and implementing models. In this paper, we describe approaches and tools that support rapid parameterization of traffic models from live network measurements. Rather than treating measured traffic as a time-series of statistics, we utilize the traces to estimate end-user behavior and network conditions to generate application-level simulation models. We also show multi-scaling analytic techniques are helpful for debugging and validating the model. To demonstrate our approaches, we develop structural source-level models for web and FTP traffic and evaluate their accuracy by comparing the outputs of simulation against the original trace. We also compare our work with existing traffic generation tool and show our approach is more flexible in capturing the heterogeneity of traffic. Finally, we automate and integrate the process from trace analysis to model validation for easy model parameterization from new data.

@inproceedings{proc_sethy:refinedsegmentation:icslp02,
 address = {Denver, CO},
 author = {Sethy, Abhinav and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/SethyInterSpeech2002.pdf},
 month = {Sep},
 title = {Refined speech segmentation for concatenative synthesis},
 year = {2002}
}

@TechReport{Dutta02a,
	 author = 	"Debojyoti Dutta and Ashish Goel",
	 title = 	"Router mechanisms and Nash Equilibria",
	 institution = 	"University of Southern California Computer Science Department",
	 year = 		2002,
	sortdate = 	"2002-04-01", 
	project = "ant, saman",
	jsubject = "chronological",
	 number =	"02-758",
	 month =		apr,
	 jlocation =	"johnh: folder: xxx",
	 jlocation =	"johnh: pafile",
	 keywords =	"router buffer strategies, nash equilibria",
	 url =		"ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/02-758.pdf",
}

 

@inproceedings{li2002save,
  title={SAVE: Source address validity enforcement protocol},
  author={Li, Jun and Mirkovic, Jelena and Wang, Mengqiu and Reiher, Peter and Zhang, Lixia},
  booktitle={INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE},
  volume={3},
  pages={1557--1566},
  year={2002},
  organization={IEEE}
}

@InProceedings{Bulusu02a,
	 author = 	"Nirupama Bulusu and Vladimir Bychkovskiy and Deborah Estrin and John Heidemann",
	 title = 	"Scalable, Ad Hoc Deployable, RF-Based Localization",
	 booktitle = 	"Proceedings of the " # "Grace Hopper Celebration of Women in Computing",
	 year = 		2002,
	  sortdate = "2002-10-01",
	project = "ilense, scadds, scowr, nocredit",
	jsubject = "sensornet_localization",
	 publisher =	"Institute for Women and Technology",
	 address =	"Vancouver, British Columbia, Canada",
	 month =		oct,
	 xxxpages =	"no paper proceedings",
	 location =	"johnh: folder: xxx",
	 location =	"johnh: pafile",
	 keywords =	"subset of journal paper, localization",
	 otherurl =		"http://www.cs.ucla.edu/%7ebulusu/papers/Bulusu02a.html",
	 url =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu02a.html",
	 pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu02a.pdf",
	 copyrightholder = "authors", 
	 myorganization =	"USC/Information Sciences Institute",
	 abstract = "
 Spatial localization or the ability to locate nodes is an important
 building block for next generation pervasive computing systems, but a
 formidable challenge, particularly, for very small hardware and energy
 constrained devices, for noisy, unpredictable environments and for
 very large ad hoc deployed and networked systems. In this paper, we
 describe, validate and evaluate in real environments a very
 simple \emph{self} localization methodology for RF-based devices based
 only on RF-connectivity constraints to a set of beacons (known nodes),
 applicable outdoors. Beacon placement has a significant impact on the
 localization quality in these systems. To self-configure and adapt the
 localization in noisy environments with unpredictable radio
 propagation vagaries, we introduce the novel concept of \emph{adaptive
 beacon placement}. We propose several novel and density adaptive
 algorithms for beacon placement and demonstrate their effectiveness
 through evaluations.  We also outline an approach in which beacons
 leverage a software controllable variable transmit power capability to
 further improve localization granularity. These combined features
 allow a localization system that is scalable and ad hoc deployable,
 long-lived and robust to noisy environments. The unique aspect of our
 localization approach is our emphasis on \emph{adaptive
 self-configuration}.
 ",
}

Spatial localization or the ability to locate nodes is an important building block for next generation pervasive computing systems, but a formidable challenge, particularly, for very small hardware and energy constrained devices, for noisy, unpredictable environments and for very large ad hoc deployed and networked systems. In this paper, we describe, validate and evaluate in real environments a very simple \emphself localization methodology for RF-based devices based only on RF-connectivity constraints to a set of beacons (known nodes), applicable outdoors. Beacon placement has a significant impact on the localization quality in these systems. To self-configure and adapt the localization in noisy environments with unpredictable radio propagation vagaries, we introduce the novel concept of \emphadaptive beacon placement. We propose several novel and density adaptive algorithms for beacon placement and demonstrate their effectiveness through evaluations. We also outline an approach in which beacons leverage a software controllable variable transmit power capability to further improve localization granularity. These combined features allow a localization system that is scalable and ad hoc deployable, long-lived and robust to noisy environments. The unique aspect of our localization approach is our emphasis on \emphadaptive self-configuration.

@article{ashish02:ijcis,
       author="Naveen Ashish and Craig A. Knoblock and Cyrus Shahabi",
       title="Selectively Materializing Data in Mediators by Analyzing User Queries",
       journal="International Journal of Cooperative Information Systems",
       volume = 11,
       number = 1,
       month="March",
       year="2002",
       urlPaper= "http://usc-isi-i2.github.io/papers/ashish02-ijcis.pdf",
       Keywords = {"Data Integration"}} 

@TechReport{Bulusu02c,
	 author = "Nirupama Bulusu and John Heidemann and
		  Deborah Estrin and Tommy Tran",
	 title = 	"Self-Configuring Localization Systems: Design
		 and Experimental Evaluation",
	 institution = 	"University of California, Los Angeles, Center for Embedded Networked Computing",
	 year = 		2002,
	  sortdate = "2002-09-01",
	project = "ilense, scadds, scowr, nocredit",
	jsubject = "sensornet_localization",
	 number =	8,
	 month =		sep,
	 note =		"Accepted to appear, ACM TOCS",
	 location =	"johnh: folder: xxx",
	 location =	"johnh: pafile",
	 keywords =	"localization",
	 otherurl =		"http://www.cs.ucla.edu/%7ebulusu/papers/Bulusu02c.html",
	 url =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu02c.html",
	 pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu02c.pdf",
	 copyrightholder = "ACM", 
	 copyrightterms = "	Permission to make digital or 	hard copies of part or all of this work for personal or 	classroom use is granted without fee provided that copies 	are not made or distributed for profit or commercial 	advantage and that new copies bear this notice and the full 	citation on the first page. Copyrights for components of this 	work owned by others than ACM must be honored. Abstracting with 	credit  is permitted.   	To copy otherwise, to republish, to post on servers or to 	redistribute to lists, requires prior specific permission 	and/or a fee. Request Permissions from 	Publications Dept, ACM Inc., 	Fax +1 (212) 869--0481, or 	[email protected]. ", 
	 myorganization =	"USC/Information Sciences Institute",
	 abstract = "
 Embedded networked sensors---those that coordinate amongst themselves
 to achieve a sensing task---promise to revolutionize the way we live,
 work and interact with the physical environment.  Fundamental to such
 coordination is \emph{localization}, or the ability to establish
 spatial relationships among such devices.  In very large, ad hoc
 deployed sensor networks, a localization system based on beacons
 (special nodes that are position-aware by virtue of being endowed with
 more sophisticated ranging hardware) can be used to localize smaller
 devices consistently even in a completely decentralized and scalable
 manner.  However, in unattended sensor networks, these localization
 systems must {\emph {self-configure, i.e.,}} autonomously adapt to the
 dynamics of their environmental setting and the availability of
 beacons, instead of relying on extensive pre-configuration or manual
 reconfiguration.  In this paper, we present the motivation, design,
 implementation and experimental evaluation of a self-configuring
 localization system based on beacons. We identify \emph{density} as an
 important parameter in determining localization quality, and propose
 HEAP and STROBE, two algorithms to enable system self-configuration
 based on beacon density. Building on the observation that the quality
 of localization saturates at a transition beacon density, these
 algorithms (i) automate placement of new beacons at low densities to
 significantly improve localization quality or (ii) rotate
 functionality amongst redundant beacons at high beacon densities to
 significantly increase overall system lifetime. Our performance
 results include experimental results from implementation of an
 RF-proximity based localization system using nodes with sharply
 limited resources (8-bit microprocessor, 8-K ROM, 512 bytes RAM,
 limited battery life).
 "
}

Embedded networked sensors—those that coordinate amongst themselves to achieve a sensing task—promise to revolutionize the way we live, work and interact with the physical environment. Fundamental to such coordination is \emphlocalization, or the ability to establish spatial relationships among such devices. In very large, ad hoc deployed sensor networks, a localization system based on beacons (special nodes that are position-aware by virtue of being endowed with more sophisticated ranging hardware) can be used to localize smaller devices consistently even in a completely decentralized and scalable manner. However, in unattended sensor networks, these localization systems must \emph self-configure, i.e., autonomously adapt to the dynamics of their environmental setting and the availability of beacons, instead of relying on extensive pre-configuration or manual reconfiguration. In this paper, we present the motivation, design, implementation and experimental evaluation of a self-configuring localization system based on beacons. We identify \emphdensity as an important parameter in determining localization quality, and propose HEAP and STROBE, two algorithms to enable system self-configuration based on beacon density. Building on the observation that the quality of localization saturates at a transition beacon density, these algorithms (i) automate placement of new beacons at low densities to significantly improve localization quality or (ii) rotate functionality amongst redundant beacons at high beacon densities to significantly increase overall system lifetime. Our performance results include experimental results from implementation of an RF-proximity based localization system using nodes with sharply limited resources (8-bit microprocessor, 8-K ROM, 512 bytes RAM, limited battery life).

@inproceedings{proc_soonil:speakerchangedetection:icslp02,
 address = {Denver, CO},
 author = {Kwon, Soonil and Narayanan, Shrikanth S.},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/KwonInterSpeech2002.pdf},
 month = {Sep},
 pages = {16-20},
 title = {Speaker Change Detection Using a New Weighted Distance Measure},
 year = {2002}
}

@InProceedings{barish02:aips,
        Author="Greg Barish and Craig A. Knoblock",
        Title="Speculative Execution for Information Gathering Plans",
        Booktitle="Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002)",
        Pages = "184-193",
        Address="AAAI Press, Menlo Park, CA",
        Year=2002,
        urlPaper= "http://usc-isi-i2.github.io/papers/barish02-aips.pdf",
       Keywords = {"Dataflow Execution","Information Gathering"}}

@inproceedings{proc_sundaram:spokenlanguagesynthesis:ieeeworkshop02,
 address = {Santa Monica, CA},
 author = {Sundaram, Shiva and Narayanan, Shrikanth S.},
 booktitle = {Proceedings of the IEEE Speech Synthesis Workshop},
 doi = {10.1109/WSS.2002.1224409},
 link = {http://sail.usc.edu/publications/files/sundaram_speechsynth_2002.pdf},
 month = {Sep},
 pages = {203-206},
 title = {Spoken language synthesis: Experiments in synthesis of spontaneous monologues},
 year = {2002}
}

@inproceedings{DBLP:conf/trec/XuLMMW02,
  author    = {Jinxi Xu and
               Ana Licuanan and
               Jonathan May and
               Scott Miller and
               Ralph M. Weischedel},
  title     = {TREC 2002 QA at BBN: Answer Selection and Confidence Estimation.},
  booktitle = {TREC},
  year      = {2002},
  ee        = {http://trec.nist.gov/pubs/trec11/papers/bbn.xu.qa.pdf},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{DBLP:conf/ekaw/GilR02a,
  author       = {Yolanda Gil and
                  Varun Ratnakar},
  editor       = {Asunci{\'{o}}n G{\'{o}}mez{-}P{\'{e}}rez and
                  V. Richard Benjamins},
  title        = {{TRELLIS:} An Interactive Tool for Capturing Information Analysis
                  and Decision Making},
  booktitle    = {Knowledge Engineering and Knowledge Management. Ontologies and the
                  Semantic Web, 13th International Conference, {EKAW} 2002, Siguenza,
                  Spain, October 1-4, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2473},
  pages        = {37--42},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45810-7\_6},
  doi          = {10.1007/3-540-45810-7\_6},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ekaw/GilR02a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{proc_narayanan:modelinguserbehavior:isle02,
 address = {Edinburgh, UK},
 author = {Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of the ISLE Workshop on Multimodal Dialog Tagging},
 link = {http://sail.usc.edu/publications/files/narayanan_isle_2002.pdf},
 month = {Dec},
 title = {Towards modeling user behavior in human-machine interactions: Effect of errors and emotions},
 year = {2002}
}

@inproceedings{DBLP:conf/semweb/GilR02,
  author       = {Yolanda Gil and
                  Varun Ratnakar},
  editor       = {Ian Horrocks and
                  James A. Hendler},
  title        = {Trusting Information Sources One Citizen at a Time},
  booktitle    = {The Semantic Web - {ISWC} 2002, First International Semantic Web Conference,
                  Sardinia, Italy, June 9-12, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2342},
  pages        = {162--176},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-48005-6\_14},
  doi          = {10.1007/3-540-48005-6\_14},
  timestamp    = {Tue, 12 Apr 2022 14:46:29 +0200},
  biburl       = {https://dblp.org/rec/conf/semweb/GilR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@InProceedings{Papadopoulos02a,
	author = 	"Christos Papadopoulos and John Heidemann",
	title = 	"Using Ns in the Classroom and Lab",
	booktitle = 	"Proceedings of the " # " ACM SIGCOMM Workshop on Computer Networking: Curriculum Designs and Educational Challenges",
	year = 		2002,
	sortdate = 	"2002-08-01", 
	project = "ant, conser, nocredit, vint",
	jsubject = "networking_education",
	publisher =	"ACM",
	address =	"Pittsburgh, PA, USA",
	month =		aug,
	pages =		"45--46",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"ns edu, conser",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Papadopoulos02a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Papadopoulos02a.pdf",
	abstract = "
This white paper describes how we are using ns [the ns-2 network
simulator] in networking education. We seek to apply simulation to two
different areas: the classroom and the laboratory. For classroom use,
we seek to augment lectures with animations that show specific
protocol behavior. In laboratory use, students modify simulation
scenarios to explore protocol design choices. Here Ns is used directly
by students, who submit their work for grading. We give a brief
summary of how we have used ns in these roles and changes we have made
to ns to make it more amenable to such purposes.
",
}

This white paper describes how we are using ns [the ns-2 network simulator] in networking education. We seek to apply simulation to two different areas: the classroom and the laboratory. For classroom use, we seek to augment lectures with animations that show specific protocol behavior. In laboratory use, students modify simulation scenarios to explore protocol design choices. Here Ns is used directly by students, who submit their work for grading. We give a brief summary of how we have used ns in these roles and changes we have made to ns to make it more amenable to such purposes.

@inproceedings{Serebrin2002,
	author= {B. Serebrin and J. D. Owens and C. H. Chen and S. P. Crago and U. J. Kapasi and B. Khailany and P. Mattson and J. Namkoong and S. Rixner and W. J. Dally},
	title= {VLSI in Computers and Processors},
	booktitle= {IEEE International Conference on Computer Design: VLSI in Computers and Processors},
	month= {September},
	year= {2002}
}

@inproceedings{frank2002webscripter,
  title={WebScripter: World-Wide Grass-roots OntologyTranslation via Implicit End-User Alignment.},
  author={Frank, Martin R and Szekely, Pedro A and Neches, Robert and Yan, Baoshi and Lopez, Juan},
  booktitle={Semantic Web Workshop},
  year={2002}
}

@techreport{mirkovic2002isave,
  title={iSAVE: Incrementally Deployable Source Address Validation},
  author={Mirkovic, Jelena and Xu, Zhiguo and Li, Jun and Schnaider, Matthew and Reiher, Peter and Zhang, Lixia},
  year={2002},
  institution={UCLA technical report}
}

@TECHREPORT{LermanTR01,
  author =       {Kristina Lerman and Aram Galstyan },
  title =        {A General Methodology for Mathematical Analysis of Multi-Agent Systems},
  institution =  {University of California, Information Sciences Institute},
  year =         {2001},
  number =       {ISI-TR-529},
  address =      {},
  month =        {},
  urlPaper =         {http://www.isi.edu/isi-technical-reports.html},
  keywords =    {multi-agent-systems},
}

@ARTICLE{Lerman01,
  author =       {Kristina Lerman and Aram Galstyan and A. Martinoli and A. Ijspeert},
  title =        {A Macroscopic Analytical Model of Collaboration in Distributed Robotic Systems},
  journal =      {Artificial Life Journal},
  year =         {2001},
  volume =       {7},
  number =       {4},
  pages =        {375--393},
  urlPaper={http://www.isi.edu/~lerman/papers/lerman-alife.pdf},
  keywords =    {multi-agent-systems},
}

@inproceedings{Suh2001d,
	author= {Suh, Jinwoo and Li, Changping and Crago, Stephen P and Parker, Robert},
	title= {A PIM-Based Multiprocessor},
	booktitle= {IPDPS 01},
	location= {San Francisco, California},
	month= {April},
	year= {2001}
}

@article{ko_semantic_2001,
	title = {A {Semantic} {Model} and {Composition} {Mechanism} for {Active} {Document} {Collection} {Templates} in {Web}-based {Information} {Management} {Systems}},
	volume = {5},
	number = {D},
	journal = {Electronic Transactions on Artificial Intelligence (ETAI)},
	author = {Ko, In-Young and Neches, Robert and Yao, Ke-Thia},
	year = {2001},
	pages = {55--71},
}

@inproceedings{proc_shih:repetitivepattern:icme01,
 address = {Tokyo, Japan},
 author = {Shih, Hsuan-Huei and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 bib2html_rescat = {mica},
 booktitle = {Proceedings of the IEEE International Conference on Multimedia and Expo (ICME)},
 doi = {10.1109/ICME.2001.1237711},
 link = {http://sail.usc.edu/publications/files/ShihICME2001.pdf},
 month = {Aug},
 pages = {281-284},
 title = {A dictionary approach to repetitive pattern finding in music},
 year = {2001}
}

@inproceedings{mirkovic2001self,
  title={A self-organizing approach to data forwarding in large-scale sensor networks},
  author={Mirkovic, Jelena and Venkataramani, Geetha Priya and Lu, Songwu and Zhang, Lixia},
  booktitle={IEEE International Conference on Communications (ICC)},
  volume={5},
  pages={1357--1361},
  year={2001},
  organization={IEEE}
}

@Article{KLMM2001,
  author =       "Craig A. Knoblock and Kristina Lerman and Steve Minton and I. Muslea",
  title =        "Accurately and reliably extracting data from the web: A machine learning approach",
  journal =      "IEEE Data Engineering Bulletin",
  year =         "2001",
  volume =       {23},
  number =       {4},
  pages =        {33--41},
  keywords =    {wrapper-maintenance},
}

@InProceedings{Bulusu01a,
	  author =	"Nirupama Bulusu and John Heidemann and Deborah Estrin",
	  title =		"Adaptive Beacon Placement",
	  booktitle =	"Proceedings of the " # "21st" # " International Conference on Distributed Computing Systems",
	  year =		2001,
	  sortdate = "2001-04-01",
	project = "ilense, scowr",
	jsubject = "sensornet_localization",
	  address =	"Phoenix, AZ",
	  month =		apr,
	  pages =		"489--498",
	  keywords =	"localization, beacon placement, self configuration, location",
	  url =	"http://www.isi.edu/%7ebulusu/papers/bulusu-icdcs01.ps",
	  location =	"johnh: folder: vint",
	  keywords =	"beacon placement algorithms, localization",
	  url =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu01a.html",
	  pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu01a.pdf",
	  psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu01a.ps.gz",
	  myorganization =	"USC/Information Sciences Institute",
	  copyrightholder = "IEEE",
	  copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	  abstract = "
  Beacon placement strongly affects the quality of spatial localization,
  a critical service for context-aware applications in wireless sensor
  networks; yet this aspect of localization has received little
  attention. Fixed beacon placement approaches such as uniform and very
  dense placement are not always viable and will be inadequate in very
  noisy environments in which sensor networks may be expected to operate
  (with high terrain and propagation uncertainties). In this paper, we
  motivate the need for empirically adaptive beacon placement and
  outline a general approach based on exploration and instrumentation of
  the terrain conditions by a mobile human or robot agent. We design,
  evaluate and analyze three novel adaptive beacon placement algorithms
  using this approach for localization based on RF-proximity. In our
  evaluation, we find that beacon density rather than noise level has a
  more significant impact on beacon placement algorithms. Our beacon
  placement algorithms are applicable to a low (beacon) density regime
  of operation. Noise makes moderate density regimes more improvable.
  "
}

Beacon placement strongly affects the quality of spatial localization, a critical service for context-aware applications in wireless sensor networks; yet this aspect of localization has received little attention. Fixed beacon placement approaches such as uniform and very dense placement are not always viable and will be inadequate in very noisy environments in which sensor networks may be expected to operate (with high terrain and propagation uncertainties). In this paper, we motivate the need for empirically adaptive beacon placement and outline a general approach based on exploration and instrumentation of the terrain conditions by a mobile human or robot agent. We design, evaluate and analyze three novel adaptive beacon placement algorithms using this approach for localization based on RF-proximity. In our evaluation, we find that beacon density rather than noise level has a more significant impact on beacon placement algorithms. Our beacon placement algorithms are applicable to a low (beacon) density regime of operation. Noise makes moderate density regimes more improvable.

@inproceedings{proc_dutton:complexlist:hlt01,
 address = {San Diego, CA},
 author = {Dutton, Dawn and Chu, Selina and Hubbell, James and Walker, Marilyn and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of the Human Language Technology (HLT) Conference},
 doi = {10.3115/1072133.1072137},
 link = {http://sail.usc.edu/publications/files/duttonhlt2001.pdf},
 month = {Mar},
 pages = {1-6},
 title = {Amount of information presented in a complex list: Effects on user performance},
 year = {2001}
}

@TechReport{Chang01a,
	author = 	"Di-Fa Chang and Ramesh Govindan and John Heidemann",
	title = 	"An Empirical Study of Router Response to
                         Large BGP Routing Table Load",
	institution = 	"USC/Information Sciences Institute",
	year = 		2001,
	sortdate = 		"2001-12-01",
	project = "ant, saman, conser",
	jsubject = "routing",
	number =	"ISI-TR-2001-552",
	month =		dec,
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"cisco juniper failure to bgp routing loads",
	otherurl = 	"https://ant.isi.edu/%7edifac/techreport.ps.gz",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chang01a.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chang01a.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Chang01a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
Anecdotal evidence suggests that misconfiguration of backbone routers
occasionally leads to an injection of large routing tables into the
BGP routing system.  In this paper, we investigate the detailed
mechanics of router response to large BGP routing tables.  We examine
three commercial grade routers, and find that their responses vary
significantly.  Some routers exhibit \emph{table-size oscillations}
that have the potential to cause \emph{cascading failure}.  Others
need operator intervention to recover from large routing tables.  We
also find that deployed resource control mechanisms, such as prefix
limits and route flap damping, are only partially successful in
mitigating the impact of large routing tables.
",
}

Anecdotal evidence suggests that misconfiguration of backbone routers occasionally leads to an injection of large routing tables into the BGP routing system. In this paper, we investigate the detailed mechanics of router response to large BGP routing tables. We examine three commercial grade routers, and find that their responses vary significantly. Some routers exhibit \emphtable-size oscillations that have the potential to cause \emphcascading failure. Others need operator intervention to recover from large routing tables. We also find that deployed resource control mechanisms, such as prefix limits and route flap damping, are only partially successful in mitigating the impact of large routing tables.

@TechReport{Ye01b,
	author = 	"Wei Ye and John Heidemann and Deborah Estrin",
	title = 	"An Energy-Efficient {MAC} protocol for Wireless
                         Sensor Networks",
	institution = 	"USC/Information Sciences Institute",
	year = 		2001,
	sortdate = "2001-09-01",
	project = "ilense, scowr, scadds, saman",
	jsubject = "sensornet_subtransport",
	number =	"ISI-TR-2001-543",
	month =		sep,
	location =	"johnh: pafile",
	location =	"johnh: folder: xxx",
	keywords =	"s-mac, energy-aware mac",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye01b.html",
	organization =	"USC/Information Sciences Institute",
	psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye01b.ps.gz",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye01b.pdf",
	abstract = "
This paper proposes S-MAC, a medium-access control (MAC) protocol
designed for wireless sensor networks. Wireless sensor networks use
battery-operated computing and sensing devices; a network of these
devices will collaborate for a common application such as
environmental monitoring. We expect sensor networks to be deployed in
an ad hoc fashion, with individual nodes remaining largely inactive
for long periods of time, but then becoming suddenly active when
something is detected. These characteristics of sensor networks and
applications motivate a MAC that is different from traditional
wireless MACs such as IEEE 802.11 in almost every way: energy
conservation and self-configuration are a primary goals, while
per-node fairness and latency are less important. S-MAC uses three
novel techniques to reduce energy consumption and support
self-configuration. To reduce energy consumption in listening to an
idle channel, nodes periodically sleep. Neighboring nodes form virtual
clusters to auto-synchronize on sleep schedules.  Inspired by PAMAS
[10], S-MAC also sets the radio to sleep during transmissions of other
nodes. Unlike PAMAS, it only uses in-channel signaling. Finally, S-MAC
applies message passing to reduce contention latency for
sensor-network applications that require store-and-forward processing
as data moves through the network. We evaluate our implementation of
S-MAC over a sample sensor node, the Mote, developed at University of
California, Berkeley (UCB). The experiment results show that, on a
source node, an 802.11-like MAC consumes 2--6 times more energy than
S-MAC for traffic load of 1--10s/message.
",
}

This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices; a network of these devices will collaborate for a common application such as environmental monitoring. We expect sensor networks to be deployed in an ad hoc fashion, with individual nodes remaining largely inactive for long periods of time, but then becoming suddenly active when something is detected. These characteristics of sensor networks and applications motivate a MAC that is different from traditional wireless MACs such as IEEE 802.11 in almost every way: energy conservation and self-configuration are a primary goals, while per-node fairness and latency are less important. S-MAC uses three novel techniques to reduce energy consumption and support self-configuration. To reduce energy consumption in listening to an idle channel, nodes periodically sleep. Neighboring nodes form virtual clusters to auto-synchronize on sleep schedules. Inspired by PAMAS [10], S-MAC also sets the radio to sleep during transmissions of other nodes. Unlike PAMAS, it only uses in-channel signaling. Finally, S-MAC applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data moves through the network. We evaluate our implementation of S-MAC over a sample sensor node, the Mote, developed at University of California, Berkeley (UCB). The experiment results show that, on a source node, an 802.11-like MAC consumes 2–6 times more energy than S-MAC for traffic load of 1–10s/message.

@inproceedings{frank01:iui,
    author = "Martin Frank and Maria Muslea and Jean Oh and Steve Minton and Craig A. Knoblock",
    title = "An Intelligent User Interface for Mixed-Initiative Multi-Source Travel",
    booktitle = "Proceedings of the ACM International Conference on Intelligent User Interfaces",
    address = "Santa Fe, New Mexico", 
    month = "January",
    year = 2001,
    urlPaper= "http://usc-isi-i2.github.io/papers/frank01-iui.pdf",
    Keywords = {"Constraint Reasoning"}}

@inproceedings{DBLP:conf/iui/BlytheKRG01,
  author       = {Jim Blythe and
                  Jihie Kim and
                  Surya Ramachandran and
                  Yolanda Gil},
  editor       = {Candy L. Sidner and
                  Johanna D. Moore},
  title        = {An integrated environment for knowledge acquisition},
  booktitle    = {Proceedings of the 6th International Conference on Intelligent User
                  Interfaces, {IUI} 2001, Santa Fe, NM, USA, January 14-17, 2001},
  pages        = {13--20},
  publisher    = {{ACM}},
  year         = {2001},
  url          = {https://doi.org/10.1145/359784.359819},
  doi          = {10.1145/359784.359819},
  timestamp    = {Tue, 06 Nov 2018 11:07:40 +0100},
  biburl       = {https://dblp.org/rec/conf/iui/BlytheKRG01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{lerman01:atem,
       author="Kristina Lerman and Craig A. Knoblock and Steven Minton",
       title="Automatic Data Extraction from Lists and Tables in Web Sources",
       booktitle="Proceedings of the IJCAI 2001 Workshop on Adaptive Text Extraction and Mining",
       year = 2001,
       address = "Seattle, WA",
       urlPaper= "http://usc-isi-i2.github.io/papers/lerman01-atem.pdf",   
       Keywords = {"Wrapper Learning"}}

@inproceedings{proc_shih:melodyextraction:imvsp01,
 address = {Kowloon Shangri-La, Hong Kong},
 author = {Shih, Hsuan-Huei and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 bib2html_rescat = {mica},
 booktitle = {Proceedings of the International Symposium on Intelligent Multimedia, Video and Speech Processing},
 doi = {10.1109/ISIMP.2001.925317},
 link = {http://sail.usc.edu/publications/files/shihisimp2001.pdf},
 month = {May},
 pages = {9-12},
 title = {Automatic main melody extraction from MIDI files with a modified Lempel-Ziv Algorithm},
 year = {2001}
}

@inproceedings{proc_li:movieindexgeneration:itcom02,
 address = {Denver, CO},
 author = {Li, Ying and Narayanan, Shrikanth S. and Ming, Wei and Kuo, C.-C. Jay},
 bib2html_rescat = {mica},
 booktitle = {Proceedings of the International Symposium on The Convergence of Information Technologies and Communications (ITCom)},
 doi = {10.1117/12.434282},
 link = {http://sail.usc.edu/publications/files/liitcom2001.pdf},
 month = {Aug},
 pages = {42-53},
 title = {Automatic movie index generation based on multimodal information},
 year = {2001}
}

@inproceedings{DBLP:conf/sosp/HeidemannSIGEG01,
  author       = {John S. Heidemann and
                  Fabio Silva and
                  Chalermek Intanagonwiwat and
                  Ramesh Govindan and
                  Deborah Estrin and
                  Deepak Ganesan},
  editor       = {Keith Marzullo and
                  Mahadev Satyanarayanan},
  title        = {Building Efficient Wireless Sensor Networks with Low-Level Naming},
  booktitle    = {Proceedings of the 18th {ACM} Symposium on Operating System Principles,
                  {SOSP} 2001, Chateau Lake Louise, Banff, Alberta, Canada, October
                  21-24, 2001},
  pages        = {146--159},
  publisher    = {{ACM}},
  year         = {2001},
  url          = {https://doi.org/10.1145/502034.502049},
  doi          = {10.1145/502034.502049},
  timestamp    = {Thu, 11 Jul 2019 14:55:12 +0200},
  biburl       = {https://dblp.org/rec/conf/sosp/HeidemannSIGEG01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@InProceedings{Huang01a,
	author = 	"Polly Huang and John Heidemann",
	title = 	"Capturing {TCP} Burstiness in Light-weight Simulations",
	booktitle = 	"Proceedings of the " # " {SCS} Conference on Communication Networks and Distributed Systems Modeling and Simulation",
	year = 		2001,
	sortdate = 		"2001-01-01", 
	project = "ant, nocredit, vint",
	jsubject = "network_simulation",
	publisher =	"Society for Computer Simulation",
	address =	"Phoenix, Arizona, USA",
	month =		jan,
	pages =		"90--96",
	jlocation =	"johnh: pafile",
	jlocation =	"johnh: folder: xxx",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.pdf",
	otherpsurl =	"http://www.tik.ee.ethz.ch/%7ehuang/publication/fsa-sim-cnds01.ps.gz",
	otherpdfurl =	"http://www.tik.ee.ethz.ch/%7ehuang/publication/fsa-sim-cnds01.pdf.gz",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
Burstiness in data traffic is emerging as a critical property that 
protocol analysis nowadays can no longer ignore.  To preserve the
kind of burstiness or scaling phenomena observed in aggregated TCP
traffic, we develop a behavior model that captures TCP's window-based
and closed-loop control.  Through a novel modeling
technique---\emph{exhaustive state exploration}, we systematically
examine each TCP states over a restricted range of connection length
and packet loss.  This restricted rane covers the TCP behavior most
common to web exchanges.  When connections step outside this range
(becoming too long or taking more than one loss) we preserve
simulation accuracy by taking an \emph{abstraction fault} and changing
to a more detailed model.  By counting packets with interarrival
times falling into certain critical intervals---round trip time (RTT)
or retransmission timeout (RTO), we are abale to create finite state
automaton (FSA) with states and transitions indicating rounds of
back-to-back packet tranmissions.  We demonstrate that an FSA approximation
of TCP can produce \emph{light-weight simulation models} of TCP
suitable for background traffic, and that these models accurately reproduce
multifractal scaling behavior in IP network traffic.
",
}

Burstiness in data traffic is emerging as a critical property that protocol analysis nowadays can no longer ignore. To preserve the kind of burstiness or scaling phenomena observed in aggregated TCP traffic, we develop a behavior model that captures TCP's window-based and closed-loop control. Through a novel modeling technique—\emphexhaustive state exploration, we systematically examine each TCP states over a restricted range of connection length and packet loss. This restricted rane covers the TCP behavior most common to web exchanges. When connections step outside this range (becoming too long or taking more than one loss) we preserve simulation accuracy by taking an \emphabstraction fault and changing to a more detailed model. By counting packets with interarrival times falling into certain critical intervals—round trip time (RTT) or retransmission timeout (RTO), we are abale to create finite state automaton (FSA) with states and transitions indicating rounds of back-to-back packet tranmissions. We demonstrate that an FSA approximation of TCP can produce \emphlight-weight simulation models of TCP suitable for background traffic, and that these models accurately reproduce multifractal scaling behavior in IP network traffic.

@article{losalamos,
	Author = {Greg {Ver Steeg}},
	Journal = {Los Alamos Summer School Reports},
	Number = {LA-UR-01-4992},
	Title = {Coherence effects in deep inelastic scattering from nuclei},
	Volume = 4,
	Year = {2001}}

@Article{ambite2001:compilation,
  author = 	 {Jos\'{e} Luis Ambite and Craig A. Knoblock and Ion Muslea And Andrew Philpot},
  title = 	 {Compiling Source Descriptions for Efficient and Flexible Information Integration},
  journal = 	 {Journal of Intelligent Information Systems},
  urlPAper = "http://www.isi.edu/~ambite/ambite-jiis2000.pdf",
  year = 	 {2001},
  volume = 	 {16},
  number = 	 {2},
  pages = 	 {149--187},
}

@article{ambite01:jiis,
  author =       {Jos\'{e} Luis Ambite and Craig A. Knoblock and Ion Muslea and
Andrew Philpot},
  title =        {Compiling Source Descriptions for Efficient and Flexible Information Integration},
  Journal =      {Journal of Intelligent Information Systems},
  volume = 16,
  number = 2,
  month = "March",
  year = 2001,
  pages = "149--187",
  urlLink= "http://tinyurl.com/yevnprn",
  urlPaper= "http://usc-isi-i2.github.io/papers/ambite00-jiis.pdf",
  Keywords = {"Data Integration"}
}

@inproceedings{proc_walker:darpacommunicator:eurospeech01,
 address = {Aalborg, Denmark},
 author = {Walker, Marilyn and Aberdeen, J. and Boland, J. and Bratt, E. and Garafolo, J. and Hirschman, Lynette and Le, A. and Lee, Sungbok and Narayanan, Shrikanth S. and Papineni, K. and Pellom, B. and Polifroni, Joseph and Potamianos, Alexandros and Prabhu, P. and Rudnicky, Alexander I. and Sanders, G. and Seneff, Stephanie and Stallard, D. and Whittaker, Steve},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/walker_interspeech_2001.pdf},
 month = {Sep},
 pages = {1371-1374},
 title = {DARPA communicator dialog travel planning systems: The June 2000 data collection},
 year = {2001}
}

@InProceedings{hovy2001:dgo,
  author = "Eduard Hovy and Andrew Philpot and Jos\'{e} Luis Ambite and Yigal Arens and Judith Klavans and Walter Bourne and Deniz Saroz",
  title = "Data Acquisition and Integration in the {DGRC's} Energy Data Collection Project",
  Booktitle="Proceedings of the First National Conference for Digital Government Research",
  Address="Redondo Beach, CA",
  year = 2001}

@article{tangmunarunkit_acm_2001,
author = {Tangmunarunkit, Hongsuda and Doyle, John and Govindan, Ramesh and Willinger, Walter and Jamin, Sugih and Shenker, Scott},
title = {Does AS Size Determine Degree in as Topology?},
year = {2001},
issue_date = {October 2001},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {31},
number = {5},
issn = {0146-4833},
url = {https://doi.org/10.1145/1037107.1037108},
doi = {10.1145/1037107.1037108},
abstract = {In a recent and much celebrated paper, Faloutsos <i>et al.</i> [6] found that the inter Autonomous System (AS) topology exhibits a power-law degree distribution. This result was quite unexpected in the networking community, and stirred significant interest in exploring the possible causes of this phenomenon. The work of Barabasi <i>et al.</i> [2], and its application to network topology generation in the work of Medina <i>et al.</i> [9], have explored a promising class of models that yield strict power-law degree distributions. These models, which we will refer to collectively as the <i>B-A model</i>, describe the detailed dynamics of the network growth process, modeling the way in which connections are made between ASs. There are two simple connectivity rules that define the evolution of AS connectivity over time: <i>incremental growth</i> where a new AS connects to existing ASs, and <i>preferential connectivity</i> where the likelihood of connecting to an AS is proportional to the vertex outdegree of the target AS. These simple rules, which are similar to the classical "rich get richer" model originally proposed by Simon [12], lead to power-law degree distributions.While the B-A model provably yields power-law vertex degree distributions, recent empirical evidence indicates that the model may not be consistent with the dynamics underlying the evolution of the actual AS topology. First, there is strong evidence [3, 4] that the degree distribution of the actual AS topology does not conform to a strict power law. However, the distribution is certainly <i>heavy-tailed</i> or <i>highly-variable</i> in the sense that the observed vertex degrees typically range over three or four orders of magnitude; in some cases, the <i>tail</i> of the degree distribution may fit a power law. These observations were gleaned from more complete pictures of AS - level connectivity (obtained by augmenting BGP route tables with peering relationships from other sources) than those used by earlier work [2, 6, 9]. Second, the B-A model's AS connectivity evolution rules can be shown to be inconsistent with empirical AS growth measurements [16]. As such, while the B-A model appears to produce topologies whose degree distribution characteristics exhibit power-law behavior, it cannot be a valid <i>explanation</i> for the connectivity evolution in the AS topology.Clearly, some of these empirical observations don't corroborate the claim that the B-A model explains the phenomenon of highly variable vertex degrees in the Internet's AS topology [2]. However, the B-A model was originally proposed as a simple illustration of how some elementary mechanisms or rules can give rise to power law vertex degree distributions. As such, it is likely that the B-A model can be modified to accommodate these more recent findings [1], but we will neither discuss here such modifications nor comment on their possibility for success. Instead, we merely note that any such resulting model would seek, as does the original B-A model, to explain the highly variable degree distribution of the AS topology through the detailed dynamics of how connections between ASs are established.The purpose of this note is to raise the question --- motivated by the B-A approach---of whether the underlying cause of the high variability phenomenon of the vertex degree distribution lies in the detailed dynamics of network growth, or if there are alternative explanations. To that end, we briefly outline an alternative explanation for the AS topology degree distribution. We do not claim to have proven that this explanation holds; our purpose here is merely to expand the dialog to a larger class of explanations for the variability of the AS topology degree distribution.},
journal = {SIGCOMM Comput. Commun. Rev.},
month = {oct},
pages = {7–8},
numpages = {2}
}

In a recent and much celebrated paper, Faloutsos et al. [6] found that the inter Autonomous System (AS) topology exhibits a power-law degree distribution. This result was quite unexpected in the networking community, and stirred significant interest in exploring the possible causes of this phenomenon. The work of Barabasi et al. [2], and its application to network topology generation in the work of Medina et al. [9], have explored a promising class of models that yield strict power-law degree distributions. These models, which we will refer to collectively as the B-A model, describe the detailed dynamics of the network growth process, modeling the way in which connections are made between ASs. There are two simple connectivity rules that define the evolution of AS connectivity over time: incremental growth where a new AS connects to existing ASs, and preferential connectivity where the likelihood of connecting to an AS is proportional to the vertex outdegree of the target AS. These simple rules, which are similar to the classical "rich get richer" model originally proposed by Simon [12], lead to power-law degree distributions.While the B-A model provably yields power-law vertex degree distributions, recent empirical evidence indicates that the model may not be consistent with the dynamics underlying the evolution of the actual AS topology. First, there is strong evidence [3, 4] that the degree distribution of the actual AS topology does not conform to a strict power law. However, the distribution is certainly heavy-tailed or highly-variable in the sense that the observed vertex degrees typically range over three or four orders of magnitude; in some cases, the tail of the degree distribution may fit a power law. These observations were gleaned from more complete pictures of AS - level connectivity (obtained by augmenting BGP route tables with peering relationships from other sources) than those used by earlier work [2, 6, 9]. Second, the B-A model's AS connectivity evolution rules can be shown to be inconsistent with empirical AS growth measurements [16]. As such, while the B-A model appears to produce topologies whose degree distribution characteristics exhibit power-law behavior, it cannot be a valid explanation for the connectivity evolution in the AS topology.Clearly, some of these empirical observations don't corroborate the claim that the B-A model explains the phenomenon of highly variable vertex degrees in the Internet's AS topology [2]. However, the B-A model was originally proposed as a simple illustration of how some elementary mechanisms or rules can give rise to power law vertex degree distributions. As such, it is likely that the B-A model can be modified to accommodate these more recent findings [1], but we will neither discuss here such modifications nor comment on their possibility for success. Instead, we merely note that any such resulting model would seek, as does the original B-A model, to explain the highly variable degree distribution of the AS topology through the detailed dynamics of how connections between ASs are established.The purpose of this note is to raise the question — motivated by the B-A approach—of whether the underlying cause of the high variability phenomenon of the vertex degree distribution lies in the detailed dynamics of network growth, or if there are alternative explanations. To that end, we briefly outline an alternative explanation for the AS topology degree distribution. We do not claim to have proven that this explanation holds; our purpose here is merely to expand the dialog to a larger class of explanations for the variability of the AS topology degree distribution.

@InProceedings{Heidemann01a,
	author = "John Heidemann and Nirupama Bulusu and Jeremy Elson
		 and Chalermek Intanagonwiwat and Kun-chan Lan
		 and Ya Xu and Wei Ye and Deborah Estrin and
	 Ramesh Govindan",
	title = "Effects of Detail in Wireless Network Simulation",
	booktitle = 	"Proceedings of the " # " {SCS} Multiconference on Distributed Simulation",
	year = 		2001,
	sortdate = 		"2001-01-01",
	project = "ant, scadds, scowr",
	jsubject = "network_simulation",
	publisher =	"Society for Computer Simulation",
	address =	"Phoenix, Arizona, USA",
	month =		jan,
	pages =		"3--11",
	jlocation =	"johnh: pafile",
	jlocation =	"johnh: folder: network/simulation",
	keywords =	"network simulation, wireless network simulation;
		simulation validation, detail, accuracy;
		energy-aware ad hoc routing; data diffusion; localization;
		robotics; network protocol visualization",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann01a.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann01a.ps.gz",
	pdfurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann01a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
Experience with wired networks has provides guidance about what level
of detail is appropriate for simulation-based protocol studies.
Wireless simulations raise many new questions about appropriate levels
of detail in simulation models for radio propagation and energy
consumption.  This paper describes the trade-offs associated with
adding detail to simulation models.  We evaluate the effects of detail
in five case studies of wireless simulations for protocol design.
Ultimately the researcher must judge what level of detail is required
for a given question, but we suggest two approaches to cope with
varying levels of detail.  When error is not correlated, networking
algorithms that are robust to a range of errors are often stressed in
similar ways by random error as by detailed models.  We also suggest
visualization techniques that can help pinpoint incorrect details and
manage detail overload.
",
}

Experience with wired networks has provides guidance about what level of detail is appropriate for simulation-based protocol studies. Wireless simulations raise many new questions about appropriate levels of detail in simulation models for radio propagation and energy consumption. This paper describes the trade-offs associated with adding detail to simulation models. We evaluate the effects of detail in five case studies of wireless simulations for protocol design. Ultimately the researcher must judge what level of detail is required for a given question, but we suggest two approaches to cope with varying levels of detail. When error is not correlated, networking algorithms that are robust to a range of errors are often stressed in similar ways by random error as by detailed models. We also suggest visualization techniques that can help pinpoint incorrect details and manage detail overload.

@inproceedings{Suh2001c,
	author= {Suh, Jinwoo and Kang, Dong-In and Crago, Stephen P},
	title= {Efficient Algorithms for Fixed-Point Arithmetic Operations In An Embedded PIM},
	booktitle= {SCI 01},
	location= {Orlando, Florida},
	month= {July},
	year= {2001}
}

@inproceedings{proc_naveen:speechcompression:eurospeech01,
 address = {Aalborg, Denmark},
 author = {Srinivasamurthy, Naveen and Ortega, Antonio and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/SrinivasamurthyInterSpeech2001.pdf},
 month = {Sep},
 pages = {1845-1848},
 title = {Efficient scalable speech compression for scalable speech recognition},
 year = {2001}
}

@inproceedings{shahabi01:acmgis,
       Author="Cyrus Shahabi and Mohammada R. Kolahdouzan and Snehal Thakkar and Jos\'{e} Luis Ambite and Craig A. Knoblock",
       Title="Efficiently Querying Moving Objects with Pre-defined Paths in a Distributed Environment",
       Booktitle="Proceedings of the Ninth ACM International Symposium on Advances in Geographic Information Systems (ACM-GIS)",
       Address="Atlanta, GA",
       Month="November",
       Year="2001",
       urlPaper= "http://usc-isi-i2.github.io/papers/shahabi01-acmgis.pdf",
       Keywords = {"Geospatial Integration"}}

@inproceedings{chalupsky01:iaai,
       author="Hans Chalupsky and Yolanda Gil and Craig A. Knoblock and Kristina Lerman and Jean Oh and David V. Pynadath and Thomas Russ and Milind Tambe",
       title="Electric Elves: Applying Agent Technology to Support Human Organizations",
       booktitle="Proceedings of the Conference on Innovative Applications of Artificial Intelligence",
       year=2001,
      urlPaper= "http://usc-isi-i2.github.io/papers/chalupsky01-iaai.pdf",       
       Keywords = {"Information Agents"}}

@InProceedings{Ye01a,
	author = 	"Wei Ye and Richard T. Vaughyan and Gaurav
	 S. Sukhatme and John Heidemann and Deborah
	 Estrin and Maja J. Matari{\'c}",
	title = "Evaluating Control Strategies for
                   Wireless-Networked Robots Using an Integrated
                         Robot and Network Simulation",
	booktitle = 	"Proceedings of the " # " IEEE International Conference on Robotics and Automation",
	year = 		2001,
	sortdate = "2001-05-01",
	project = "ilense, scadds, conser, saman",
	jsubject = "sensornet_general",
	publisher =	"IEEE",
	address =	"Seoul, Korea",
	month =		may,
	pages =		"2941--2947",
	location =	"johnh: folder: pafiles",
	location =	"johnh: folder: xxx",
	keywords =	"networking and robotics, ns-2, arena, player/stage",
	copyrightterms ="	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	organization =	"USC/Information Sciences Institute",
	doi = "http://dx.doi.org/10.1109/ROBOT.2001.933068",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye01a.html",
	psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye01a.ps.gz",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye01a.pdf",
	abstract = "
Wireless communication is an enabling factor in multiple mobile robot
systems. There is signi cant interaction between robot controllers and
communications sub-systems. We present a method for evaluating
combined robot control/communication strategies for a team of
wireless-networked robots performing a resource transportation
task. Two alternative controller designs are compared under
established communication and radio propagation models. For each we
measure the over-all performance of the robot team including the cost
of communication. The study illustrates how our evaluation tools can
be used for designing controllers for robots operating in wireless
communication environments.
"	
}

Wireless communication is an enabling factor in multiple mobile robot systems. There is signi cant interaction between robot controllers and communications sub-systems. We present a method for evaluating combined robot control/communication strategies for a team of wireless-networked robots performing a resource transportation task. Two alternative controller designs are compared under established communication and radio propagation models. For each we measure the over-all performance of the robot team including the cost of communication. The study illustrates how our evaluation tools can be used for designing controllers for robots operating in wireless communication environments.

@Article{Heidemann01f,
	author = 	"John Heidemann and Kevin Mills and Sri Kumar",
	title = 	"Expanding Confidence in Network Simulation",
	journal = 	"IEEE Network Magazine",
	year = 		2001,
	sortdate = 		"2001-10-01",
	volume =	15,
	number =	5,
	month =		"Sept./Oct.",
	pages =		"58--63",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile xxx",
	keywords =	"vint, networks simulation, data diffusion",
	otherurl =	"http://ieeexplore.ieee.org/iel5/65/20610/00953234.pdf?isNumber=20610",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann01f.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann01f.ps.gz",
	pdfurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann01f.pdf",
	myorganization =	"USC/Information Sciences Institute",
	project = "ant",
	abstract = "
Networking research increasingly depends on simulation to investigate
new protocol behavior, performance, and interactions.  In spite of
wide use of simulation, today there is no common understanding of what
level of simulation validation is required for these tasks, and
limited background of what validation techniques are being used and
their effectiveness.  This paper reports on discussions of these
issues that arose from the Network Simulation Validation Workshop
sponsored by DARPA and NIST in May 1999.  We describe
best-current-practices of general validation and validation of TCP,
how scale and validation interact, and workshop consensus
",
}

Networking research increasingly depends on simulation to investigate new protocol behavior, performance, and interactions. In spite of wide use of simulation, today there is no common understanding of what level of simulation validation is required for these tasks, and limited background of what validation techniques are being used and their effectiveness. This paper reports on discussions of these issues that arose from the Network Simulation Validation Workshop sponsored by DARPA and NIST in May 1999. We describe best-current-practices of general validation and validation of TCP, how scale and validation interact, and workshop consensus

@inproceedings{ramshaw-etal-2001-experiments,
    title = "Experiments in Multi-Modal Automatic Content Extraction",
    author = "Ramshaw, Lance  and
      Boschee, Elizabeth  and
      Bratus, Sergey  and
      Miller, Scott  and
      Stone, Rebecca  and
      Weischedel, Ralph  and
      Zamanian, Alex",
    booktitle = "Proceedings of the First International Conference on Human Language Technology Research",
    year = "2001",
    url = "https://aclanthology.org/H01-1024",
}

@InProceedings{ambite2001:polap,
  author = "Jos\'{e} Luis Ambite and Cyrus Shahabi and Rolfe R. Schmidt and Andrew Philpot", 
  title = "Fast Approximate Evaluation of {OLAP} Queries for Integrated Statistical Data",
  urlPaper="http://www.isi.edu/~ambite/ambite-dgo2001.pdf",
  Booktitle="Proceedings of the First National Conference for Digital Government Research",
  Address="Redondo Beach, CA",
  year = 2001}

@TechReport{Dutta01a,
	author = 	"Debojyoti Dutta and Ashish Goel and John Heidemann",
	title = 	"Faster Network Design with Scenario Pre-filtering",
	institution = 	"USC/Information Sciences Institute",
	year = 		2001,
	sortdate = 	"2001-11-01", 
	project = "ant, saman",
	jsubject = "networking",
	number =	"ISI-TR-550",
	month =		nov,
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"approx-sim, ns-2, simulation pre-filtering",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta01a.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta01a.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Dutta01a.pdf",
	otherurl = 	"https://ant.isi.edu/%7eddutta/ISI-TR-550.pdf",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
Design and engineering of networks requires the consideration of many
possible configurations (different network topologies, bandwidths,
traffic and policies). Network engineers may use network simulation to
evaluate changes in network configuration, but detailed, packet-level
simulation of many alternatives would be extremely time
consuming. This paper introduces the concept of scenario
pre-filtering---rather than perform detailed simulation of each
scenario, we propose to quickly evaluate (pre-filter) all scenarios in
order to select only the relevant scenarios and discard those that are
clearly too over- or under-provisioned. To rapidly evaluate scenarios,
we have developed several new analytical techniques to quickly
determine the steady-state behavior of the network with both bulk and
short term TCP flows. These techniques apply to arbitrary topologies
and routers that use both drop-tail and RED queuing policies. Since we
are only interested in selecting the interesting scenarios for
detailed simulation, the answers need only be approximate. However, we
show that accuracy is typically within 10\% of detailed
simulation. More importantly, these techniques are 10-300x faster than
detailed simulation, and, hence, pre-filtering is a promising
technique to reduce the total simulation time when many scenarios must
be considered.
",
}

Design and engineering of networks requires the consideration of many possible configurations (different network topologies, bandwidths, traffic and policies). Network engineers may use network simulation to evaluate changes in network configuration, but detailed, packet-level simulation of many alternatives would be extremely time consuming. This paper introduces the concept of scenario pre-filtering—rather than perform detailed simulation of each scenario, we propose to quickly evaluate (pre-filter) all scenarios in order to select only the relevant scenarios and discard those that are clearly too over- or under-provisioned. To rapidly evaluate scenarios, we have developed several new analytical techniques to quickly determine the steady-state behavior of the network with both bulk and short term TCP flows. These techniques apply to arbitrary topologies and routers that use both drop-tail and RED queuing policies. Since we are only interested in selecting the interesting scenarios for detailed simulation, the answers need only be approximate. However, we show that accuracy is typically within 10% of detailed simulation. More importantly, these techniques are 10-300x faster than detailed simulation, and, hence, pre-filtering is a promising technique to reduce the total simulation time when many scenarios must be considered.

@article{neches_geoworlds:_2001,
	title = {{GeoWorlds}: {Integrating} {GIS} and {Digital} {Libraries} for {Situation} {Understanding} and {Management}},
	volume = {7},
	journal = {The New Review of Hypermedia and Multimedia (NRHM)},
	author = {Neches, Robert and Yao, Ke-Thia and Ko, In-Young and Bugacov, Alejandro and Kumar, Vished and Eleish, Ragy},
	year = {2001},
	pages = {127--152},
}

@inproceedings{DBLP:conf/mobicom/XuHE01,
  author       = {Ya Xu and
                  John S. Heidemann and
                  Deborah Estrin},
  editor       = {Christopher Rose},
  title        = {Geography-informed energy conservation for Ad Hoc routing},
  booktitle    = {{MOBICOM} 2001, Proceedings of the seventh annual international conference
                  on Mobile computing and networking, Rome, Italy, July 16-21, 2001},
  pages        = {70--84},
  publisher    = {{ACM}},
  year         = {2001},
  url          = {https://doi.org/10.1145/381677.381685},
  doi          = {10.1145/381677.381685},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/mobicom/XuHE01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@Article{Heidemann01b,
	author = 	"John Heidemann",
	title = 	"Getting the Light Out",
	journal = 	"Photo Electronic Imaging",
	year = 		2001,
	sortdate = 		"2001-01-01",
	project = "personal",
	jsubject = "other",
	volume =	44,
	number =	1,
	month =		jan,
	pages =		"30--32",
	location =	"johnh: pafiles",
	location =	"johnh: folder: xxx",
	keywords =	"dark current noise, photoshop, (gimp)",
	officialurl =		"http://www.peimag.com/pdf/pei01/pei0101/pg30-heidemann.pdf",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann01b.html",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann01b.html",
	copyrightholder = "PEI Magazine",
	abstract = "
[This paper describes how to remove dark current noise
from long-exposure digital camera photos in Adobe Photoshop.]
"
}

[This paper describes how to remove dark current noise from long-exposure digital camera photos in Adobe Photoshop.]

@Article{muslea01:jaamas,
   author  = "Ion Muslea and Steven Minton and Craig A. Knoblock",
   title   = "Hierarchical Wrapper Induction for Semistructured Information Sources",
   journal = "Autonomous Agents and Multi-Agent Systems",
   volume = 4,
   number ="1/2",
   month = "March",
   year    = "2001",
   urlPaper= "http://usc-isi-i2.github.io/papers/muslea01-jaamas.pdf",
   Keywords = {"Wrapper Learning"}
}

@TechReport{Intanagonwiwat01b,
	author = 	"Chalermek Intanagonwiwat and Deborah Estrin
		 and Ramesh Govindan and John Heidemann",
	title = "Impact of Network Density on Data Aggregation in Wireless Sensor Networks",
	institution = 	"University of Southern California Computer Science Department",
	year = 		2001,
	sortdate = "2001-11-01",
	project = "ilense, scadds",
	jsubject = "sensornet_data_dissemination",
	number =	"01-750",
	month =		nov,
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"diffusion, greedy vs. opportunistic aggregation",
	otherurl =	"ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/01-750.pdf",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Intanagonwiwat01b.html",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Intanagonwiwat01b.pdf",
	abstract = "
In-network data aggregation is essential for wireless sensor networks
where resources (e.g., bandwidth, energy) are limited. In a previously
proposed data dissemination scheme, data is opportunistically
aggregated at the intermediate nodes on a low-latency tree which may
not necessarily be energy efficient. A more energy-efficient tree is a
greedy tree which can be incrementally constructed by connecting each
source to the closest point of the existing tree. In this paper, we
propose a greedy approach for constructing a greedy aggregation tree
to improve path sharing. We evaluated the performance of this greedy
approach by comparing it to the prior opportunistic approach. Our
preliminary result suggests that although the greedy aggregation and
the opportunistic aggregation are roughly equivalent at low-density
networks, the greedy aggregation can achieve signficant energy savings
at higher densities. In one experiment we found that the greedy
aggregation can achieve up to 45\% energy savings over the
opportunistic aggregation without an adverse impact on latency or
robustness.
",
}

In-network data aggregation is essential for wireless sensor networks where resources (e.g., bandwidth, energy) are limited. In a previously proposed data dissemination scheme, data is opportunistically aggregated at the intermediate nodes on a low-latency tree which may not necessarily be energy efficient. A more energy-efficient tree is a greedy tree which can be incrementally constructed by connecting each source to the closest point of the existing tree. In this paper, we propose a greedy approach for constructing a greedy aggregation tree to improve path sharing. We evaluated the performance of this greedy approach by comparing it to the prior opportunistic approach. Our preliminary result suggests that although the greedy aggregation and the opportunistic aggregation are roughly equivalent at low-density networks, the greedy aggregation can achieve signficant energy savings at higher densities. In one experiment we found that the greedy aggregation can achieve up to 45% energy savings over the opportunistic aggregation without an adverse impact on latency or robustness.

@inproceedings{Suh2001e,
	author= {Suh, Jinwoo and Zhu, Ming and Li, Changping and Crago, Stephen P and Shank, Stephen F. and Chau, Richard H. and Mazur, Walter J. and Pancoast, Rick},
	title= {Implementations of Real-time Data Intensive Applications on PIM-based Multiprocessor Systems},
	booktitle= {Joint WPDRTS and EHPC 01},
	location= {San Francisco, California},
	month= {April},
	year= {2001},
	doi={10.1109/IPDPS.2001.925063}
}

@inproceedings{knoblock01:ic-ai,
        author="Craig A. Knoblock and Jos\'{e} Luis Ambite and Steven Minton and Cyrus Shahabi and Mohammad R. Kolahdouzan and Maria Muslea and Jean Oh and Snehal Thakkar",
        title="Integrating the World: {T}he WorldInfo Assistant",
        booktitle="Proceedings of the 2001 International Conference on Artificial Intelligence (IC-AI 2001)",
        address="Las Vegas, NV",
        year=2001,
        urlPaper="http://usc-isi-i2.github.io/papers/knoblock01-ic-ai.pdf",
        Keywords = {"Constraint Reasoning"}
}

@inproceedings{szekely2001interfaces,
  title={Interfaces for understanding multi-agent behavior},
  author={Szekely, Pedro and Rogers, Craig Milo and Frank, Martin},
  booktitle={Proceedings of the 6th international conference on Intelligent user interfaces},
  pages={161--166},
  year={2001},
  organization={ACM}
}

@inproceedings{tangmunarunkit_spie_2001,
author = {Hongsuda Tangmunarunkit and Ramesh Govindan and Scott Shenker},
title = {Internet path inflation due to policy routing},
volume = {4526},
booktitle = {Scalability and Traffic Control in IP Networks},
editor = {Sonia Fahmy and Kihong Park},
organization = {International Society for Optics and Photonics},
publisher = {SPIE},
pages = {188 -- 195},
keywords = {Internet Paths, Paths, Routing Policy, Policy Routing, Path Inflation},
year = {2001},
doi = {10.1117/12.434394},
URL = {https://doi.org/10.1117/12.434394}
}

@inproceedings{proc_dutton:allthefacts:acm01,
 address = {Seattle, WA},
 author = {Dutton, Dawn and Chu, Selina and Hubbell, James and Walker, Marilyn and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of the ACM Conference on Computer-Human Interaction (CHI)},
 link = {http://sail.usc.edu/publications/files/chi2001_dutton_final.pdf},
 month = {Mar},
 pages = {133-134},
 title = {Just (all) the facts, ma\'am},
 year = {2001}
}

@inproceedings{DBLP:conf/ijcai/KimG01,
  author       = {Jihie Kim and
                  Yolanda Gil},
  editor       = {Bernhard Nebel},
  title        = {Knowledge Analysis on Process Models},
  booktitle    = {Proceedings of the Seventeenth International Joint Conference on Artificial
                  Intelligence, {IJCAI} 2001, Seattle, Washington, USA, August 4-10,
                  2001},
  pages        = {935--942},
  publisher    = {Morgan Kaufmann},
  year         = {2001},
  timestamp    = {Tue, 20 Aug 2019 16:18:14 +0200},
  biburl       = {https://dblp.org/rec/conf/ijcai/KimG01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{ shaken-k-cap-01,
 title = {Knowledge Entry as Graphical Assembly of Components},
 author = {Peter Clark and John Thompson and Ken Barker and Bruce Porter and Vinay Chaudhi and Andres Rodriguez and Jerome Thomere and Sunil Mishra and Yolanda Gil and Pat Hayes and Thomas Reichherzer},
 booktitle = {Proceedings of the First International Conference on Knowledge Capture (K-CAP)},
 address = {Victoria, British Columbia},
 year = {2001},
 url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/shaken-k-cap-01.pdf }
 }

@article{tejada01:is,
      author="Sheila Tejada and Craig A. Knoblock and Steven Minton", 
      title ="Learning Object Identification Rules for Information Integration",
      journal="Information Systems",
      volume=26,
      number=8,
      year="2001",
      urlLink= "http://tinyurl.com/y874bhx",
      urlPaper= "http://usc-isi-i2.github.io/papers/tejada01-is.pdf",
      Keywords = {"Record Linkage"}}

@article{vander2001lessons,
  title={Lessons learned about one-way, dataflow constraints in the Garnet and Amulet graphical toolkits},
  author={Vander Zanden, Bradley T and Halterman, Richard and Myers, Brad A and McDaniel, Rich and Miller, Rob and Szekely, Pedro and Giuse, Dario A and Kosbie, David},
  journal={ACM Transactions on Programming Languages and Systems (TOPLAS)},
  volume={23},
  number={6},
  pages={776--796},
  year={2001},
  publisher={ACM}
}

@InProceedings{Huang01b,
	author = "Polly Huang and John Heidemann",
	title = 	"Minimizing Routing State for Light-Weight Network Simulation",
	booktitle = 	"Proceedings of the " # " International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems",
	year = 		2001,
	sortdate = 		"2001-08-01", 
	project = "ant, vint",
	jsubject = "network_simulation",
	publisher =	"IEEE",
	address =	"Cincinnati, Ohio, USA",
	month =		aug,
	pages =		"to appear",
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"network simulation, routing abstraction",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01b.pdf",
	otherpsurl =	"http://www.tik.ee.ethz.ch/%7ehuang/publication/algo-routing-mascots01.ps.gz",
	otherpdfurl =	"http://www.tik.ee.ethz.ch/%7ehuang/publication/algo-routing-mascots01.pdf",
	abstract = "
We introduce a routing mechanism, referred to as algorith-
mic routing. It is a viable routing alternative for network
simulations with minimal space complexity---O(N). In
theory and for simulations size of the Internet, algorithmic
routing has the potential of reducing memory requirement
by several orders of magnitude. In practice and through ns-
2 simulations on random topologies, we find memory con-
sumption of algorithmic routing exhibits a similar scaling
property. However, routes computed by algorithmic routing
are not all the shortest. Although we find the relative differ-
ence is below 10\% for more than 80\% of the routes, we are
cautious about its applicability to general network simula-
tions. With further discussion on impacts of the distortion,
we derive a set of guidelines and recommend users to apply
this technique only when suitable.
",
}

We introduce a routing mechanism, referred to as algorith- mic routing. It is a viable routing alternative for network simulations with minimal space complexity—O(N). In theory and for simulations size of the Internet, algorithmic routing has the potential of reducing memory requirement by several orders of magnitude. In practice and through ns- 2 simulations on random topologies, we find memory con- sumption of algorithmic routing exhibits a similar scaling property. However, routes computed by algorithmic routing are not all the shortest. Although we find the relative differ- ence is below 10% for more than 80% of the routes, we are cautious about its applicability to general network simula- tions. With further discussion on impacts of the distortion, we derive a set of guidelines and recommend users to apply this technique only when suitable.

@inproceedings{knoblock01:www,
   author = "Craig A. Knoblock and Steven Minton and Jos\'{e} Luis Ambite and Maria Muslea and Jean Oh and Martin Frank",
   title = "Mixed-Initiative, Multi-source Information Assistants",
   booktitle = "Proceedings of the World Wide Web Conference",
   address = "ACM Press, New York, NY",
   pages = "697-707",
   month = "May",
   year = 2001,
   urlPaper= "http://usc-isi-i2.github.io/papers/knoblock01-www.pdf",
   Keywords = {"Constraint Reasoning"}}

@inproceedings{proc_shih:musicindexing:itcom01,
 address = {Denver, CO},
 author = {Shih, Hsuan-Huei and Narayanan, Shrikanth S. and Kuo, C.-C. Jay},
 bib2html_rescat = {},
 booktitle = {Proceedings of the International Symposium on The Convergence of Information Technologies and Communications (ITCom)},
 doi = {10.1117/12.434262},
 link = {http://sail.usc.edu/publications/files/shihitcom2001.pdf},
 month = {Aug},
 pages = {124-135},
 title = {Music indexing with extracted main melody by using modified Lempel-Ziv algorithm},
 year = {2001}
}

@TechReport{Coffin01a,
	 author = 	"Dan Coffin and Dan Van Hook and Ramesh Govindan and John Heidemann and Fabio Silva",
	 title = 	"Network Routing Application Programmer's
			  Interface ({API}) and Walk Through 8.0",
	 institution = 	"USC/ISI",
	 year = 		2001,
	sortdate = 		"2005-08-01", 
	project = "ilense, scadds, nocredit",
	jsubject = "sensornet_data_dissemination",
	 number =	"01-741",
	 month =		mar,
	 location =	"johnh: pafile",
	 location =	"johnh: folder: xxx",
	 keywords =	"data diffusion apis, sensor networks",
	 url =		"http://www.isi.edu/%7ejohnh/PAPERS/Coffin01a.html",
	 psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Coffin01a.ps.gz",
	 pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Coffin01a.pdf",
	 otherurl =		"ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/01-741.ps.gz",
	 copyrightholder = "authors",
	 myorganization = "USC/Information Sciences Institute",
	 abstract = "SCADDS data diffusion (at USC/ISI) and DRP (at MIT/LL) are both based
 on the core concept of subject-based routing. Although there are some
 fundamental differences between these approaches, we believe that both
 can be accommodated with the same Network Routing API. 
 An earlier version of this API was used by both network routing
 approaches. This document describes an updated version of the API,
 used by the SCADDS implementation. In addition to the
 Publish/Subscribe API, we introduce the Filter API in order to better
 support in-network processing (e.g. caching/aggregation) and mobile
 code.
 ",
}

SCADDS data diffusion (at USC/ISI) and DRP (at MIT/LL) are both based on the core concept of subject-based routing. Although there are some fundamental differences between these approaches, we believe that both can be accommodated with the same Network Routing API. An earlier version of this API was used by both network routing approaches. This document describes an updated version of the API, used by the SCADDS implementation. In addition to the Publish/Subscribe API, we introduce the Filter API in order to better support in-network processing (e.g. caching/aggregation) and mobile code.

@inproceedings{proc_rose:asralgorithms:icassp01,
 address = {Salt Lake City, Utah},
 author = {Rose, Richard and Parthasarathy, S. and Gajic, Bojana and Rosenberg, Aaron and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},
 doi = {https://doi.org/10.1109/icassp.2001.940756},
 link = {http://sail.usc.edu/publications/files/RoseICASSP2001.pdf},
 month = {May},
 pages = {17-20},
 title = {On the implementation of ASR algorithms for hand-held wireless mobile devices},
 year = {2001}
}

@inproceedings{DBLP:conf/agents/GilR01,
  author       = {Yolanda Gil and
                  Surya Ramachandran},
  editor       = {Elisabeth Andr{\'{e}} and
                  Sandip Sen and
                  Claude Frasson and
                  J{\"{o}}rg P. M{\"{u}}ller},
  title        = {{PHOSPHORUS:} a task-based agent matchmaker},
  booktitle    = {Proceedings of the Fifth International Conference on Autonomous Agents,
                  {AGENTS} 2001, Montreal, Canada, May 28 - June 1, 2001},
  pages        = {110--111},
  publisher    = {{ACM}},
  year         = {2001},
  url          = {https://doi.org/10.1145/375735.376015},
  doi          = {10.1145/375735.376015},
  timestamp    = {Sat, 30 Sep 2023 09:33:47 +0200},
  biburl       = {https://dblp.org/rec/conf/agents/GilR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Suh2001b,
	author= {Suh, Jinwoo and Crago, Stephen P and Li, Changping and Parker, Robert},
	title= {PIM- and Stream Processor-Based System},
	booktitle= {Fifth Annual High Performance Embedded Computing Workshop},
	location= {Cambridge, Massachusetts},
	month= {November},
	year= {2001}
}

@inproceedings{Suh2001a,
	author= {Suh, Jinwoo and Crago, Stephen P},
	title= {PIM- and Stream Processor-based Processing for Radar Signal Applications},
	booktitle= {The Third Workshop on Media and Streaming Processors in conjunction with The 34th International Symposium on Microarchitecture},
	location= {Austin, Texas},
	month= {December},
	year= {2001}
}

@article{ambite01:jair,
        author="Jos\'{e} Luis Ambite and Craig A. Knoblock",
        title="Planning by Rewriting",
        journal="Journal of Artificial Intelligence Research",
        volume=15,
        pages="207-261",
        year="2001",
        urlPaper= "http://usc-isi-i2.github.io/papers/ambite01-jair.pdf",
        Keywords = {"Planning by Rewriting","Planning"}}

@inproceedings{proc_sudha:childmachine:eurospeech01,
 address = {Aalborg, Denmark},
 author = {Arunachalam, Sudha and Gould, Dylan and Andersen, Elaine and Byrd, Dani and Narayanan, Shrikanth S.},
 bib2html_rescat = {care},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/ArunachalamInterSpeech2001.pdf},
 month = {Sep},
 pages = {2675-2678},
 title = {Politeness and frustration language in child-machine interactions},
 year = {2001}
}

@inproceedings{Kang2001,
	author= {Kang, Dong-In and Crago, Stephen P and Suh, Jinwoo},
	title= {Power-Aware Design Synthesis Techniques for Distributed Real-Time Systems},
	booktitle= {ACM Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES) '01},
	month= {June},
	year= {2001}
}

@TechReport{Chen01c,
	author = "Xuan Chen and John Heidemann",
	title = "Preferential Treatment for Short Flows to Reduce Web Latency",
	institution =  "USC/Information Sciences Institute",
	year = 	       2001,
	sortdate = 	       "2001-10-01", 
	project = "ant, saman, conser",
	jsubject =  "chronological",
	number =       "ISI-TR-548",
	month =	       oct,
	note = "Technical report updated July 2002; published in Computer Networks 41(6), April 2003,
                         pages 779--794",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chen01c.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chen01c.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Chen01c.pdf",
	otherurl = 	"https://ant.isi.edu/%7exuanc/paper/sfd.pdf",
	copyrightholder = "authors",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
In this paper, we propose SFD algorithm to reduce the user-perceived
web response time (i.e. web latency). This algorithm gives short flows
preferential treatment and penalizes long flows. We implement SFD
algorithm as a simple differentiated services policy and evaluate its
performance in simulation. We find that the transmission latency of
short flows and the response time to retrieve representative web pages
are both reduced by about 30\%. Using web traces we demonstrate that
99\% web pages would be transferred faster. SFD also bounds the
penalty to long flows. We further evaluate how different schemes
trade-off the performance between short and long flows.
",
}

In this paper, we propose SFD algorithm to reduce the user-perceived web response time (i.e. web latency). This algorithm gives short flows preferential treatment and penalizes long flows. We implement SFD algorithm as a simple differentiated services policy and evaluate its performance in simulation. We find that the transmission latency of short flows and the response time to retrieve representative web pages are both reduced by about 30%. Using web traces we demonstrate that 99% web pages would be transferred faster. SFD also bounds the penalty to long flows. We further evaluate how different schemes trade-off the performance between short and long flows.

@techreport{frank2001real,
  title={Real-Time MARBLES: A Scheme for Adaptive Distributed Resource Allocation},
  author={Frank, Martin and Szekely, Pedro},
  year={2001},
  institution={UNIVERSITY OF SOUTHERN CALIFORNIA MARINA DEL REY INFORMATION SCIENCES INST}
}

@inproceedings{proc_chul:negativeemotions:asru01,
 address = {Trento, Italy},
 author = {Lee, Chul Min and Narayanan, Shrikanth S. and Pieraccini, Roberto},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of the IEEE Workshop on Automatic Speech Recognition and Understanding (ASRU)},
 doi = {10.1109/ASRU.2001.1034632},
 link = {http://sail.usc.edu/publications/files/leeasru2001.pdf},
 month = {Dec},
 pages = {240-243},
 title = {Recognition of negative emotions from the speech signal},
 year = {2001}
}

@inproceedings{milutinovic2001research,
  title={Research and Development in E-Business on the Internet},
  author={Milutinovic, V and Cvetkovic, D and Aleksic, M and Davidovic, G and Dimitrijevic, Z and Dingarac, D and Grubic, M and Grujic, A and Horvat, D and Horvat, Z and others},
  booktitle={System Sciences, 2001. Proceedings of the 34th Annual Hawaii International Conference on},
  pages={10--pp},
  year={2001},
  organization={IEEE}
}

@InProceedings{ambite2001:afcea,
  author = 	 {Jos\'{e} Luis Ambite and Yigal Arens and Eduard Hovy and Judith Klavans  and Andrew Philpot},
  title = 	 {Scalable Access and Integration of Statistical Data for Digital Government},
  booktitle = 	 {Proceedings of the Armed Forces Communications and Electronics Association {(AFCEA)} Federal Database Colloquium},
  year = 	 {2001},
  address = 	 {San Diego, CA},
}

@InProceedings{Bulusu01c,
	  author = 	"Nirupama Bulusu and Deborah Estrin and Lewis Girod and John Heidemann",
	  title = "Scalable Coordination for Wireless Sensor
			   Networks: Self-Configuring Localization Systems",
	  booktitle = 	"Proceedings of the " # "6th" # " IEEE International Symposium on Communication Theory and Application",
	  year = 		2001,
	  sortdate = "2001-07-01",
	project = "ilense, scadds, scowr",
	jsubject = "sensornet_localization",
	  publisher =	"IEEE",
	  address =	"St.~Martin's College, Ambleside, Cumbria, UK",
	  month =		jul,
	  pages =		"to appear",
	  location =	"johnh: folder: xxx",
	  location =	"johnh: pafile",
	  keywords =	"sensor network design themes, density matters
			   (but not heap or strobe), localization",
	  otherurl =		"http://lecs.cs.ucla.edu/%7egirod/papers/iscta-2001.ps",
	  url =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu01c.html",
	  psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu01c.ps.gz",
	  pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu01c.pdf",
	  copyrightholder = "authors", 
	  myorganization =	"USC/Information Sciences Institute",
	  abstract = "
  Pervasive networks of micro-sensors and actuators offer to
  revolutionize the ways in which we understand and construct complex
  physical systems. Sensor networks must be scalable, long-lived and
  robust systems, overcoming energy limitations and a lack of
  pre-installed infrastructure. We explore three themes in the design of
  self-configuring sensor networks: tuning density to trade operational
  quality against lifetime; using multiple sensor modalities to obtain
  robust measurements; and exploiting fixed environmental
  characteristics. We illustrate these themes through the problem of
  localization, which is a key building block for sensor systems that
  itself requires coordination.
  ",
}

Pervasive networks of micro-sensors and actuators offer to revolutionize the ways in which we understand and construct complex physical systems. Sensor networks must be scalable, long-lived and robust systems, overcoming energy limitations and a lack of pre-installed infrastructure. We explore three themes in the design of self-configuring sensor networks: tuning density to trade operational quality against lifetime; using multiple sensor modalities to obtain robust measurements; and exploiting fixed environmental characteristics. We illustrate these themes through the problem of localization, which is a key building block for sensor systems that itself requires coordination.

@inproceedings{yao_semantic_2001,
	address = {Brisbane, Australia},
	title = {Semantic {Interoperability} {Scripting} and {Measurements}},
	booktitle = {Working {Conference} on {Complex} and {Dynamic} {Systems} {Architecture}},
	author = {Yao, Ke-Thia and Ko, In-Young and Neches, Robert and MacGregor, Robert},
	month = dec,
	year = {2001},
}

@Article{ambite2001:computer,
 Author="Jos\'{e} Luis Ambite and Yigal Arens and Eduard Hovy and Andrew Philpot and Luis Gravano and Vasileios Hatzivassiloglou and Judith Klavans",
 Title="Simplifying Data Access: The Energy Data Collection {(EDC)} Project", 
 urlPaper="http://www.isi.edu/~ambite/EDC-IEEE-Computer-2001.pdf",
 Journal="{IEEE} Computer, Special Issue on Digital Government",
 Volume=34,
 Number=2,
 Month="February",
 Year="2001"}

@TechReport{Lan01a,
	author = 	"Kun-chan Lan and John Heidemann",
	title = 	"Structural Modeling of {RealAudio} Traffic",
	institution = 	"USC/Information Sciences Institute",
	year = 		2001,
	sortdate = 		"2001-09-01", 
	project = "ant, saman",
	jsubject = "traffic_modeling",
	number =	"ISI-TR-544",
	month =		sep,
	jlocation =	"johnh: folder: xxx",
	jlocation =	"johnh: pafile",
	keywords =	"real audio, structural modeling, ",
	otherurl =		"https://ant.isi.edu/%7ekclan/paper/ramodel.ps",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Lan01a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Lan01a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
This paper identifies the structural properties of RealAudio traffic,
develops an application-level model and validates the model using
multi-scale analytic techniques. RealAudio traffic is quite different
from web traffic and constant bit rate traffic, models commonly used
for Internet and multimedia traffic respectively today. We demonstrate
that RealAudio has rich behavior across a range of time scales, with
regularity at large time scales, strong peiodicities from RTT to a few
seconds, and complex behavior at small time scales. A simulation model
was developed which captures the main structural characteristics of
RealAudio, and demonstrates the importance of multi-scale analysis in
validating this model. We also demonstrate via simu- lation that
RealAudio loss rates can be noticeably reduced by slightly changing
its characteristics to reduce burstiness. Although our results focus
on Real Audio traffic, this methodology may be useful for studies of
other types of real-time streaming media.
",
}

This paper identifies the structural properties of RealAudio traffic, develops an application-level model and validates the model using multi-scale analytic techniques. RealAudio traffic is quite different from web traffic and constant bit rate traffic, models commonly used for Internet and multimedia traffic respectively today. We demonstrate that RealAudio has rich behavior across a range of time scales, with regularity at large time scales, strong peiodicities from RTT to a few seconds, and complex behavior at small time scales. A simulation model was developed which captures the main structural characteristics of RealAudio, and demonstrates the importance of multi-scale analysis in validating this model. We also demonstrate via simu- lation that RealAudio loss rates can be noticeably reduced by slightly changing its characteristics to reduce burstiness. Although our results focus on Real Audio traffic, this methodology may be useful for studies of other types of real-time streaming media.

@article{knoblock01:ijcis,
	author="Craig A. Knoblock and Steven Minton and Jos\'{e} Luis Ambite and Naveen Ashish and Ion Muslea and Andrew Philpot and Sheila Tejada",
	title="The {ARIADNE} Approach to Web-based Information Integration",
	journal="International Journal of Cooperative 
	Information Systems (IJCIS), Special Issue on Intelligent Information Agents:  {T}heory and Applications",
         volume = 10,
         number = "1/2",
          pages = "145-169",
	year=2001,
	urlPaper= "http://usc-isi-i2.github.io/papers/knoblock01-ijcis.pdf",
	urlLink = "http://www.worldscinet.com/ijcis/10/1001n02/S0218843001000291.html",
       	Keywords = {"Data Integration"}}

@inproceedings{DBLP:conf/infocom/TangmunarunkitGSE01,
  author       = {Hongsuda Tangmunarunkit and
                  Ramesh Govindan and
                  Scott Shenker and
                  Deborah Estrin},
  title        = {The Impact of Routing Policy on Internet Paths},
  booktitle    = {Proceedings {IEEE} {INFOCOM} 2001, The Conference on Computer Communications,
                  Twentieth Annual Joint Conference of the {IEEE} Computer and Communications
                  Societies, Twenty years into the communications odyssey, Anchorage,
                  Alaska, USA, April 22-26, 2001},
  pages        = {736--742},
  publisher    = {{IEEE} Comptuer Society},
  year         = {2001},
  url          = {https://doi.org/10.1109/INFCOM.2001.916262},
  doi          = {10.1109/INFCOM.2001.916262},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/infocom/TangmunarunkitGSE01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@InProceedings{ambite2001:vldb,
author = "Jos\'{e} Luis Ambite and Craig A. Knoblock and Mohammad R. Kolahdouzan and Maria Muslea and Cyrus Shahabi and Snehal Thakkar",
title = "The WorldInfo Assistant: Spatio-Temporal Information Integration on the Web",
urlPaper="http://www.isi.edu/~ambite/ambite-vldb2001.pdf",
booktitle = "Proceedings of The Twenty Seventh International Conference on Very Large Data Bases (VLDB2001)", 
address = "Rome, Italy",
year = 2001,
note = "System Demonstration"
}

@article{frank2001marbles,
  title={The marbles manifesto: A definition and comparison of cooperative negotiation schemes for distributed resource allocation},
  author={Frank, Martin and Bugacov, Alejandro and Chen, Jinbo and Dakin, Gordon and Szekely, Pedro and Neches, Bob},
  journal={Proceedings of AAAI Symposium on Negotiation Methods for Autonomous Cooperative Systems},
  pages={36--45},
  year={2001}
}

@InProceedings{Bulusu01d,
	  author = 	"Nirupama Bulusu and Deborah Estrin and John Heidemann",
	  title = 	"Tradeoffs in Location Support Systems: The Case for Quality-Expressive Location Models for Applications",
	  booktitle = 	"Proceedings of the " # "Ubicomp Workshop on Location Modeling",
	  year = 		2001,
	  sortdate = "2001-09-01",
	project = "ilense, scowr",
	jsubject = "sensornet_localization",
	  address =	"Atlanta, Georgia, USA",
	  month =		sep,
	  pages =		"7--12",
	  location =	"johnh: folder: xxx",
	  location =	"johnh: pafile",
	  keywords =	"location, xxx",
	  otherurl =		"http://www.isi.edu/%7ebulusu/papers/Bulusu01d.pdf",
	  url =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu01d.html",
	  psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu01d.ps.gz",
	  pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu01d.pdf",
	  copyrightholder = "authors", 
	  myorganization =	"USC/Information Sciences Institute",
	  abstract = "
   Location support systems typically tradeoff positional accuracy,
 uncertainty, and latency in providing location information for ease of
 configuration, lower hardware costs, energy-efficiency, scalability or
 preserving user privacy. In this paper, we explore these tradeoffs by
 discussing the design space of location support systems and their
 impact on applications. Applications informed of these tradeoffs can
 adapt to them and substantially improve their performance. Location
 models and abstractions should therefore be quality expressive
 \emph{i.e.,} provide an explicit representation of parameters such as
 accuracy, timeliness, energy cost
 ",
}

% title should have RF quoted

Location support systems typically tradeoff positional accuracy, uncertainty, and latency in providing location information for ease of configuration, lower hardware costs, energy-efficiency, scalability or preserving user privacy. In this paper, we explore these tradeoffs by discussing the design space of location support systems and their impact on applications. Applications informed of these tradeoffs can adapt to them and substantially improve their performance. Location models and abstractions should therefore be quality expressive \emphi.e., provide an explicit representation of parameters such as accuracy, timeliness, energy cost

@inproceedings{wiecha2001transforming,
  title={Transforming the UI for anyone. anywhere: enabling an increased variety of users, devices, and tasks through interface transformations},
  author={Wiecha, Charles and Szekely, Pedro},
  booktitle={CHI'01 Extended Abstracts on Human Factors in Computing Systems},
  pages={483--484},
  year={2001},
  organization={ACM}
}

@inproceedings{proc_naveen:distributedspeechreco:isca01,
 address = {Sophia Antipolis, France},
 author = {Srinivasamurthy, Naveen and Narayanan, Shrikanth S. and Ortega, Antonio},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of the International Speech Communication Association (ISCA) Workshop on Adaptation Methods for Speech Recognition},
 link = {http://sail.usc.edu/publications/files/SrinivasamurthyISCA2001.pdf},
 month = {Aug},
 pages = {113-116},
 title = {Use of model transformations for distributed speech recognition},
 year = {2001}
}

@article{DBLP:journals/jetai/TallisKG01,
  author       = {Marcelo Tallis and
                  Jihie Kim and
                  Yolanda Gil},
  title        = {User studies of knowledge acquisition tools: methodology and lessons
                  learned},
  journal      = {J. Exp. Theor. Artif. Intell.},
  volume       = {13},
  number       = {4},
  pages        = {359--378},
  year         = {2001},
  url          = {https://doi.org/10.1080/09528130110100261},
  doi          = {10.1080/09528130110100261},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jetai/TallisKG01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@InProceedings{Heidemann01d,
	author = 	"John Heidemann and Nirupama Bulusu",
	title = 	"Using Geospatial Information in Sensor Networks",
	booktitle = 	"Proceedings of the " # "Workshop on Intersections between Geospatial Information and Information Technology",
	year = 		2001,
	sortdate = 		"2001-10-01",
	project = "ilense, scadds",
	jsubject = "sensornet_localization",
	publisher =	"National Research Council",
	address =	"Arlington, VA, USA",
	month =		oct,
	xxxpages =	"no global page numbers",
	location =	"johnh: pafile",
	location =	"johnh: folder: xxx",
	keywords =	"localization, spatial sensor mining, xxx",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann01d.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann01d.pdf",
	xpsurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann01d.ps.gz",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
This paper describes several ways sensor networks can benefit from
geospatial information and identifies two research directions.  First,
better models of localization error, logical location, and
communications costs are required to understand the interactions
between spatial information and control and communications algorithms
in sensor networks.  Second, wider use of spatial information in
densely deployed sensor networks will move sensor networking
applications from simple tracking to object counting and area
monitoring, and can enable the use of data mining techniques to sensor
networks for ``spatial sensor mining''.
",
}

This paper describes several ways sensor networks can benefit from geospatial information and identifies two research directions. First, better models of localization error, logical location, and communications costs are required to understand the interactions between spatial information and control and communications algorithms in sensor networks. Second, wider use of spatial information in densely deployed sensor networks will move sensor networking applications from simple tracking to object counting and area monitoring, and can enable the use of data mining techniques to sensor networks for ``spatial sensor mining''.

@inproceedings{Suh2000b,
	author= {Suh, Jinwoo and Kang, Dong-In and Crago, Stephen P},
	title= {A Communication Scheduling Algorithm for Multi-FPGA Systems},
	booktitle= {IEEE Symposium on Field Programmable Custom Computing Machines (FCCM) 2000},
	location= {Napa, California},
	month= {April},
	year= {2000}
}

@inproceedings{barish00:icai,
        author="Greg Barish and Daniel DiPasquo and Craig A. Knoblock and Steven Minton",
        title="A Dataflow Approach to Agent-based Information Management",
        booktitle="Proceedings of the 2000 International Conference on
                  Artificial Intelligence (IC-AI 2000)",
        address="Computer Science Research, Education, and Applications (CSREA) Press, Athens, GA",
        year=2000,
         urlPaper= "http://usc-isi-i2.github.io/papers/barish00-icai.pdf",
       	Keywords = {"Dataflow Execution","Information Agents"}
}

@inproceedings{Crago2000,
	author= {Crago, Stephen P. and Despain, Alvin M. and Gaudiot,  Jean-Luc and Makhija, Manil and Ro, Wonwoo and Srivastava, Apoorv},
	title= {A High-Performance, Hierarchical Decoupled Architecture},
	booktitle= {MEmory access DEcoupling for superscalar and multiple issue Architectures (MEDEA) Workshop},
	month= {October},
	year= {2000}
}

@inproceedings{proc_rahim:spokendialog:icslp00,
 address = {Beijing, China},
 author = {Rahim, Mazin and Pieraccini, Roberto and Eckert, Wieland and Levin, Esther and Fabbrizio, Giuseppe Di and Riccardi, Giuseppe and Kamm, Candace and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/rahimicslp2000.pdf},
 month = {Oct},
 pages = {736-739},
 title = {A spoken dialog system for conference/workshop services},
 year = {2000}
}

@article{knoblock00:deb,
        Author = "Craig A. Knoblock and Kristina Lerman and Steven Minton and Ion Muslea",
        Title = "Accurately and Reliably Extracting Data from the Web: {A} Machine Learning Approach",
	urlPaper = "http://usc-isi-i2.github.io/papers/knoblock00-deb.pdf",
        journal = "IEEE Data Engineering Bulletin",
        Volume = 23,
        Number = 4, 
        Pages = "33-41",
        Month = "December",
        Year = "2000",
        urlPaper= "http://usc-isi-i2.github.io/papers/knoblock00-deb.pdf",
       	Keywords = {"Wrapper Learning"}}

@inproceedings{DBLP:conf/aaai/KimG00,
  author       = {Jihie Kim and
                  Yolanda Gil},
  editor       = {Henry A. Kautz and
                  Bruce W. Porter},
  title        = {Acquiring Problem-Solving Knowledge from End Users: Putting Interdependency
                  Models to the Test},
  booktitle    = {Proceedings of the Seventeenth National Conference on Artificial Intelligence
                  and Twelfth Conference on on Innovative Applications of Artificial
                  Intelligence, July 30 - August 3, 2000, Austin, Texas, {USA}},
  pages        = {223--229},
  publisher    = {{AAAI} Press / The {MIT} Press},
  year         = {2000},
  url          = {http://www.aaai.org/Library/AAAI/2000/aaai00-034.php},
  timestamp    = {Tue, 05 Sep 2023 09:10:47 +0200},
  biburl       = {https://dblp.org/rec/conf/aaai/KimG00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@TechReport{Xu00a,
	author = 	"Ya Xu and John Heidemann and Deborah Estrin",
	title = 	"Adaptive Energy-Conserving Routing for
                         Multihop Ad Hoc Networks",
	institution = 	"USC/Information Sciences Institute",
	year = 		2000,
	sortdate = "2000-10-01",
	project = "ilense, nocredit, scadds",
	jsubject = "sensornet_subtransport",
	type =		"Research Report",
	number =	527,
	month =		oct,
	location =	"johnh: pafile",
	location =	"johnh: folder: xxx",
	keywords =	"vint, networks simulation, data diffusion,
                         adaptive fidelity",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Xu00a.html",
	psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Xu00a.ps.gz",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Xu00a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
In this paper, we present two algorithms for routing in
energy-constrained, ad hoc, wireless networks.  Nodes running our
algorithms can trade off energy dissipation and data delivery quality
according to application requirements.  Our algorithms work above
existing on-demand ad hoc routing protocols, such as AODV and DSR,
without modification to the underlying routing protocols.  Our major
contributions are: algorithms that \emph{turn off} the radio to reduce
energy consumption with the involvement of \emph{application-level
information}, and the additional \emph{use of node deployment density}
to adaptively adjust routing fidelity to extend network lifetime.
Algorithm analysis and simulation studies show that our
energy-conserving algorithms can consume as little as 50\% of the
energy of an unmodified ad hoc routing protocol. Moreover, simulations
of adaptive fidelity suggest that greater node density can be used to
increase network lifetime; in one example a four-fold increase in
density doubles network lifetime.
",
}

In this paper, we present two algorithms for routing in energy-constrained, ad hoc, wireless networks. Nodes running our algorithms can trade off energy dissipation and data delivery quality according to application requirements. Our algorithms work above existing on-demand ad hoc routing protocols, such as AODV and DSR, without modification to the underlying routing protocols. Our major contributions are: algorithms that \emphturn off the radio to reduce energy consumption with the involvement of \emphapplication-level information, and the additional \emphuse of node deployment density to adaptively adjust routing fidelity to extend network lifetime. Algorithm analysis and simulation studies show that our energy-conserving algorithms can consume as little as 50% of the energy of an unmodified ad hoc routing protocol. Moreover, simulations of adaptive fidelity suggest that greater node density can be used to increase network lifetime; in one example a four-fold increase in density doubles network lifetime.

@article{DBLP:journals/computer/BreslauEFFHHHMVXY00,
  author       = {Lee Breslau and
                  Deborah Estrin and
                  Kevin R. Fall and
                  Sally Floyd and
                  John S. Heidemann and
                  Ahmed Helmy and
                  Polly Huang and
                  Steven McCanne and
                  Kannan Varadhan and
                  Ya Xu and
                  Haobo Yu},
  title        = {Advances in Network Simulation},
  journal      = {Computer},
  volume       = {33},
  number       = {5},
  pages        = {59--67},
  year         = {2000},
  url          = {https://doi.org/10.1109/2.841785},
  doi          = {10.1109/2.841785},
  timestamp    = {Wed, 12 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/computer/BreslauEFFHHHMVXY00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@InProceedings{Mena00a,
	author = 	"Art Mena and John Heidemann",
	title = 	"An Empirical Study of Real Audio Traffic",
	booktitle = 	"Proceedings of the " # " IEEE Infocom",
	year = 		2000,
	sortdate = "2000-03-01",
	project = "ant, nocredit, vint",
	jsubject = "traffic_modeling",
	publisher =	"IEEE",
	address =	"Tel-Aviv, Israel",
	month =		mar,
	pages =		"101--110",
	location =	"johnh: pafiles",
	location =	"johnh: folder: networking/multimedia",
	keywords =	"real audio, traffic studies",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Mena00a.html",
	psurl =	       "http://www.isi.edu/%7ejohnh/PAPERS/Mena00a.ps.gz",
	pdfurl =	       "http://www.isi.edu/%7ejohnh/PAPERS/Mena00a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "IEEE",
	copyrightterms = "	Abstracting is permitted with credit to the source.  Libraries are 	permitted to photocopy beyond the limit of US copyright law, for 	private use of patrons, those articles in this volume that carry a 	code at the bottom of the first page, provided that the per-copy fee 	indicated in the code is paid through the Copyright Clearance Center, 	27 Congress Street, Salem, MA 01970.  For other copying, reprint, or 	republication permission, write to IEEE Copyrights Manager, IEEE 	Service Center, 445 Hoes Lane, PO Box 1331, Piscataway, NJ 08855--1331. ",
	abstract = "
The delivery of multimedia content is a facet of Internet traffic that
is rapidly growing in importance. The new generation of World Wide Web
sites are relying heavily on extensive multimedia content such as
graphics, sound, music and video to attract and retain visitors. While
there have been extensive studies on the growth and effects of Hyper
Text Transfer Protocol (HTTP) traffic used on the Web, little or no
work has been performed in analyzing streaming multimedia traffic. We
present the results of a brief study to examine the traffic emanating
from a popular Internet audio service using the RealAudio program. We
found protocol distributions that show a bias towards non-TCP friendly
protocols. In addition, we observed consistencies in audio traffic
packet sizes and data rate patterns may be useful as a tool for
identifying audio data flows. Our results show that audio flows
exhibit significant consistency in data rates and are considerably
more persistent than HTTP connections.
",
}

The delivery of multimedia content is a facet of Internet traffic that is rapidly growing in importance. The new generation of World Wide Web sites are relying heavily on extensive multimedia content such as graphics, sound, music and video to attract and retain visitors. While there have been extensive studies on the growth and effects of Hyper Text Transfer Protocol (HTTP) traffic used on the Web, little or no work has been performed in analyzing streaming multimedia traffic. We present the results of a brief study to examine the traffic emanating from a popular Internet audio service using the RealAudio program. We found protocol distributions that show a bias towards non-TCP friendly protocols. In addition, we observed consistencies in audio traffic packet sizes and data rate patterns may be useful as a tool for identifying audio data flows. Our results show that audio flows exhibit significant consistency in data rates and are considerably more persistent than HTTP connections.

@inproceedings{yao_asynchronous_2000,
	address = {San Antonio, TX},
	title = {Asynchronous information space analysis architecture using content and structure-based service brokering},
	booktitle = {Proceedings of the {Fifth} {ACM} {Conference} on {Digital} {Libraries}},
	author = {Yao, Ke-Thia and Ko, In-Young and Eleish, Ragy and Neches, Robert},
	year = {2000},
	pages = {133--142},
}

@inproceedings{DBLP:conf/interspeech/PearsonKFK00,
  author       = {Steve Pearson and
                  Roland Kuhn and
                  Steven Fincke and
                  Nick Kibre},
  title        = {Automatic methods for lexical stress assignment and syllabification},
  booktitle    = {Sixth International Conference on Spoken Language Processing, {ICSLP}
                  2000 / {INTERSPEECH} 2000, Beijing, China, October 16-20, 2000},
  pages        = {423--426},
  publisher    = {{ISCA}},
  year         = {2000},
  url          = {https://doi.org/10.21437/ICSLP.2000-298},
  doi          = {10.21437/ICSLP.2000-298},
  timestamp    = {Thu, 22 Jun 2023 16:42:19 +0200},
  biburl       = {https://dblp.org/rec/conf/interspeech/PearsonKFK00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{proc_rose:speechreco:norsig00,
 address = {Kolmaarden, Sweden},
 author = {Rose, Richard and Gajic, Bojana and Narayanan, Shrikanth S. and Parthasarathy, S. and Rosenberg, Aaron},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of the IEEE Nordic Signal Processing Symposium (NORSIG)},
 month = {Jun},
 title = {Automatic speech recognition for mobile communication devices},
 year = {2000}
}

@TechReport{Huang00a,
	author = 	"Polly Huang and John Heidemann",
	title = 	"Capturing {TCP} Burstiness in Light-weight Simulations",
	institution = 	"Institut f{\"u}r Technische Informatik, ETH Z{\"u}rich",
	year = 		2000,
	sortdate = 		"2000-09-01", 
	project = "ant, nocredit, vint",
	jsubject = "network_simulation",
	number =	92,
	month =		sep,
	jlocation =	"johnh: folder: network/simulation",
	jlocation =	"johnh: pafile",
	keywords =	"fsa tcp, tcp abstraction, modeling short tcp connnections",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Huang00a.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Huang00a.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Huang00a.pdf",
	otherpsurl =	"http://www.tik.ee.ethz.ch/%7ehuang/publication/fsa-sim.ps.gz",
	otherpdfurl =	"http://www.tik.ee.ethz.ch/%7ehuang/publication/fsa-sim.pdf.gz",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
Burstiness in data traffic is emerging as a critical property that 
protocol analysis nowadays can no longer ignore.  To preserve the
kind of burstiness or scaling phenomena observed in aggregated TCP
traffic, we develop a behavior model that captures TCP's window-based
and closed-loop control.  Through a novel modeling
technique---\emph{exhaustive state exploration}, we systematically
examine each TCP states over a restricted range of connection length
and packet loss.  This restricted rane covers the TCP behavior most
common to web exchanges.  When connections step outside this range
(becoming too long or taking more than one loss) we preserve
simulation accuracy by taking an \emph{abstraction fault} and changing
to a more detailed model.  By counting packets with interarrival
times falling into certain critical intervals---round trip time (RTT)
or retransmission timeout (RTO), we are abale to create finite state
automaton (FSA) with states and transitions indicating rounds of
back-to-back packet tranmissions.  We demonstrate that an FSA approximation
of TCP can produce \emph{light-weight simulation models} of TCP
suitable for background traffic, and that these models accurately reproduce
multifractal scaling behavior in IP network traffic.
",
}

Burstiness in data traffic is emerging as a critical property that protocol analysis nowadays can no longer ignore. To preserve the kind of burstiness or scaling phenomena observed in aggregated TCP traffic, we develop a behavior model that captures TCP's window-based and closed-loop control. Through a novel modeling technique—\emphexhaustive state exploration, we systematically examine each TCP states over a restricted range of connection length and packet loss. This restricted rane covers the TCP behavior most common to web exchanges. When connections step outside this range (becoming too long or taking more than one loss) we preserve simulation accuracy by taking an \emphabstraction fault and changing to a more detailed model. By counting packets with interarrival times falling into certain critical intervals—round trip time (RTT) or retransmission timeout (RTO), we are abale to create finite state automaton (FSA) with states and transitions indicating rounds of back-to-back packet tranmissions. We demonstrate that an FSA approximation of TCP can produce \emphlight-weight simulation models of TCP suitable for background traffic, and that these models accurately reproduce multifractal scaling behavior in IP network traffic.

@InProceedings{Lerman00,
  author =       "Kristina Lerman and Onn Shehory",
  title =        "{Coalition Formation for Large-Scale Electronic Markets}",
  year =         "2000",
  booktitle =          "Proceedings of the International Conference on Multi-Agent Systems ({ICMAS}'2000), Boston, MA, 2000.",
  pages =       "167--174",
  urlPaper={http://www.isi.edu/~lerman/papers/LerShe99.pdf},
  keywords =    {multi-agent-systems},
}

@inproceedings{barish00:agents,
        author="Greg Barish and Daniel DiPasquo and Craig A. Knoblock and Steven Minton",
        title="Dataflow Plan Execution for Software Agents",
        booktitle="Proceedings of the Fourth International Conference on
                   Autonomous Agents (Agents-2000)",
        address="Barcelona, Spain",
        year=2000,
        urlPaper= "http://usc-isi-i2.github.io/papers/barish00-agents.pdf",
       	Keywords = {"Dataflow Execution","Information Agents"}
}

@inproceedings{Suh2000a,
	author= {Suh, Jinwoo and Crago, Stephen P and Li, Changping and Parker, Robert},
	title= {Distributed Corner Turn on a PIM-Based Multiprocessor},
	booktitle= {Fourth Annual Workshop on High Performance Embedded Computing (HPEC)},
	locations= {Cambridge, Massachusetts},
	month= {September},
	year= {2000}
}

@Unpublished{Heidemann00d,
	author = "John Heidemann and Nirupama Bulusu and Jeremy Elson
 and Chalermek Intanagonwiwat and Kun-chan Lan
 and Ya Xu and Wei Ye and Deborah Estrin and
 Ramesh Govindan and John Heidemann",
	title = "Effects of Detail in Wireless Network Simulation",
	note = "submitted to SCS Communication Networks and Distributed Systems Modeling and Simulation Conference",
	year =		2000,
	sortdate =		"2000-09-01", 
	project = "ant, vint, scadds, scowr",
	jsubject = "chronological",
	month =		sep,
	jlocation =	"johnh: folder: network/simulation",
	jlocation =	"johnh: pafile",
	keywords =	"network simulation",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann00d.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann00d.ps.gz",
	pdfurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann00d.pdf",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
Experience with wired networks has provides guidance about what level
of detail is appropriate for simulation-based protocol studies.
Wireless simulations raise many new questions about approriate levels
of detail in simulation models for radio propagation and energy
consumption.  This paper describes the trade-offs associated with
adding detail to simulation models.  We evaluate the effects of detail
in five case studies of wireless simulations for protocol design.
Ultimately the researcher must judge what level of detail is required
for a given question, but we suggest two approaches to cope with
varying levels of detail.  When error is not correlated, networking
algorithms that are robust to a range of errors are often stressed in
similar ways by random error as by detailed models.  We also suggest
visualization techniques that can help pinpoint incorrect details and
manage detail overload.
"
}

Experience with wired networks has provides guidance about what level of detail is appropriate for simulation-based protocol studies. Wireless simulations raise many new questions about approriate levels of detail in simulation models for radio propagation and energy consumption. This paper describes the trade-offs associated with adding detail to simulation models. We evaluate the effects of detail in five case studies of wireless simulations for protocol design. Ultimately the researcher must judge what level of detail is required for a given question, but we suggest two approaches to cope with varying levels of detail. When error is not correlated, networking algorithms that are robust to a range of errors are often stressed in similar ways by random error as by detailed models. We also suggest visualization techniques that can help pinpoint incorrect details and manage detail overload.

@TechReport{Bulusu00b,
	  author = "Nirupama Bulusu and Jeremy Elson and Deborah Estrin and Ramesh Govindan and John Heidemann and Chalermek Intanagonwiwat and Nader Salehi and Kun-chan Lan and Ya Xu and Wei Ye",
	  title = 	"Effects of Detail in Wireless Network Simulation",
	  institution = 	"USC/Information Sciences Institute",
	  year = 		2000,
	  sortdate = "2000-06-01",
	project = "ilense, vint, ant, scadds, scowr",
	jsubject = "chronological",
	  number =	"ISI-TR-2000-523",
	  note = "An updated version of this paper appears as \url{http://www.isi.edu/%7ejohnh/PAPERS/Heidemann01a.html}",
	  month =		jun,
	  location =	"johnh: pafiles",
	  location =	"johnh: folder: vint",
	  keywords =	"wireless network simulation, detail",
	  url =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu00b.html",
	  pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu00b.pdf",
	  myorganization =	"USC/Information Sciences Institute",
	  copyrightholder = "author",
	  abstract = "
  Experience with wired networks has provides guidance about what level
  of detail is appropriate for simulation-based protocol studies.
  Wireless simulations raise many new questions about approriate levels
  of detail in simulation models for radio propagation and energy
  consumption.  This paper describes the trade-offs in more detailed or
  abstract simulation models.  We evaluate the effects of detail in four
  case studies of wireless simulations for protocol design.  Ultimately
  the researcher must judge what level of detail is required for a given
  question, but we suggest two approaches to cope with varying levels of
  detail.  When error is not correlated, networking algorithms that are
  robust to a range of errors are often stressed in similar ways by
  random error as by detailed models.  We also suggest visualization
  techniques that can help pinpoint incorrect details and manage detail
  overload.
  ",
}

Experience with wired networks has provides guidance about what level of detail is appropriate for simulation-based protocol studies. Wireless simulations raise many new questions about approriate levels of detail in simulation models for radio propagation and energy consumption. This paper describes the trade-offs in more detailed or abstract simulation models. We evaluate the effects of detail in four case studies of wireless simulations for protocol design. Ultimately the researcher must judge what level of detail is required for a given question, but we suggest two approaches to cope with varying levels of detail. When error is not correlated, networking algorithms that are robust to a range of errors are often stressed in similar ways by random error as by detailed models. We also suggest visualization techniques that can help pinpoint incorrect details and manage detail overload.

@Article{Eggert00a,
	author = 	"Lars Eggert and John Heidemann and Joe Touch",
	title = 	"Effects of Ensemble-TCP",
	journal = 	"ACM Computer Communication Review",
	year = 		2000,
	sortdate = 		"2000-01-01",
	project = "ant, lsam",
	jsubject = "www",
	volume =	30,
	number =	1,
	month =		jan,
	pages =		"15--29",
	jlocation =	"johnh: folder: lsam",
	keywords =	"ensemble-tcp, tcp batching",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Eggert00a.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Eggert00a.ps.gz",
	pdfurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Eggert00a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "author",
	abstract = "
TCP currently recalculates the state of each connection from a fixed
set of initial parameters; this recalculation occurs over several
round trips, during which the con-nection can be less than
efficient. TCP control block sharing is a technique for reusing
information among connections in series and aggregating it among
connec-tions in parallel. This paper explores the design space of a
modified TCP stack that utilizes these two ideas, and one possible
design (E-TCP) is presented in detail. E-TCP has been designed so that
the network transmission behavior of group of parallel E-TCP
connections closely resembles that of a single TCP/Reno
connection. Simulated web accesses using HTTP/1.0 over E-TCP show a
significant performance improvement compared to TCP/Reno connection
bundles. This paper is first to evaluate performance using four
different intra-ensem-ble schedulers for different workloads. In one
scenario simulating a common case, E-TCP is 4-75\% faster than Reno for
transmitting the HTML parts of various pages, and 17-61\% faster
transmitting the whole pages. In the same scenario, reusing cached
state speeds up repeated E-TCP page accesses by 17-53\% for the HTML
parts and 10-28\% for the whole pages, compared to the initial
access. E-TCP can also be integrated with other pro-posed TCP
extensions (such as TCP/Vegas or TCP/SACK), to further improve
performance.
",
}

TCP currently recalculates the state of each connection from a fixed set of initial parameters; this recalculation occurs over several round trips, during which the con-nection can be less than efficient. TCP control block sharing is a technique for reusing information among connections in series and aggregating it among connec-tions in parallel. This paper explores the design space of a modified TCP stack that utilizes these two ideas, and one possible design (E-TCP) is presented in detail. E-TCP has been designed so that the network transmission behavior of group of parallel E-TCP connections closely resembles that of a single TCP/Reno connection. Simulated web accesses using HTTP/1.0 over E-TCP show a significant performance improvement compared to TCP/Reno connection bundles. This paper is first to evaluate performance using four different intra-ensem-ble schedulers for different workloads. In one scenario simulating a common case, E-TCP is 4-75% faster than Reno for transmitting the HTML parts of various pages, and 17-61% faster transmitting the whole pages. In the same scenario, reusing cached state speeds up repeated E-TCP page accesses by 17-53% for the HTML parts and 10-28% for the whole pages, compared to the initial access. E-TCP can also be integrated with other pro-posed TCP extensions (such as TCP/Vegas or TCP/SACK), to further improve performance.

@inproceedings{proc_narayanan:multimodal:icslp00,
 address = {Beijing, China},
 author = {Narayanan, Shrikanth S. and Fabbrizio, Giuseppe Di and Kamm, Candace and Hubbell, James and Buntschuh, Bruce and Ruscitti, P. and Wright, Jeremy H.},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/narayananinterspeech2000.pdf},
 month = {Oct},
 pages = {636-639},
 title = {Effects of dialog initiative and multi-modal presentation strategies on large directory information access},
 year = {2000}
}

@article{DBLP:journals/cacm/EstrinGH00,
  author       = {Deborah Estrin and
                  Ramesh Govindan and
                  John S. Heidemann},
  title        = {Embedding the Internet: Introduction},
  journal      = {Commun. {ACM}},
  volume       = {43},
  number       = {5},
  pages        = {38--41},
  year         = {2000},
  url          = {https://doi.org/10.1145/332833.332836},
  doi          = {10.1145/332833.332836},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cacm/EstrinGH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@TechReport{Heidemann00c,
	author = 	"John Heidemann and Kevin Mills and Sri Kumar",
	title = 	"Expanding Confidence in Network Simulation",
	institution = 	"USC/Information Sciences Institute",
	year = 		2000,
	sortdate = 		"2000-04-01",
	project = "ant, vint, saman",
	jsubject = "chronological",
	type =		"Research Report",
	number =	"00-522",
	month =		apr,
	note =		"submitted for publication, IEEE Computer",
	jlocation =	"johnh: folder: xxx",
	keywords =	"vint, networks simulation, data diffusion",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann00c.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann00c.ps.gz",
	pdfurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann00c.pdf",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
Networking research increasingly depends on simulation to investigate
new protocol behavior, performance, and interactions.  In spite of
wide use of simulation, today there is no common understanding of what
level of simulation validation is required for these tasks, and
limited background of what validation techniques are being used and
their effectiveness.  This paper reports on discussions of these
issues that arose from the Network Simulation Validation Workshop
sponsored by DARPA and NIST in May 1999.  We describe
best-current-practices of general validation and validation of TCP,
how scale and validation interact, and workshop consensus
",
}

Networking research increasingly depends on simulation to investigate new protocol behavior, performance, and interactions. In spite of wide use of simulation, today there is no common understanding of what level of simulation validation is required for these tasks, and limited background of what validation techniques are being used and their effectiveness. This paper reports on discussions of these issues that arose from the Network Simulation Validation Workshop sponsored by DARPA and NIST in May 1999. We describe best-current-practices of general validation and validation of TCP, how scale and validation interact, and workshop consensus

@article{ambite00:aij,
  author =       {Jos\'{e} Luis Ambite and Craig A. Knoblock},
  title =        {Flexible and Scalable Cost-Based Query Planning in Mediators: {A} Transformational Approach},
  Journal =      {Artificial Intelligence Journal},
  volume= "118",
  number = "1-2",
  Pages= "115--161",
  month = "April",
  year = 2000,
  urlPaper = "http://usc-isi-i2.github.io/papers/ambite00-aij.pdf",
   Keywords = {"Information Mediators","Planning by Rewriting"}
}

@article{DBLP:journals/wc/BulusuHE00,
  author       = {Nirupama Bulusu and
                  John S. Heidemann and
                  Deborah Estrin},
  title        = {GPS-less low-cost outdoor localization for very small devices},
  journal      = {{IEEE} Wirel. Commun.},
  volume       = {7},
  number       = {5},
  pages        = {28--34},
  year         = {2000},
  url          = {https://doi.org/10.1109/98.878533},
  doi          = {10.1109/98.878533},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/wc/BulusuHE00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{milutinovic2000genetic,
  title={Genetic search based on multiple mutations},
  author={Milutinovic, Veljko and Cvetkovic, Dragana and Mirkovic, Jelena},
  journal={Computer},
  volume={33},
  number={11},
  pages={118--119},
  year={2000},
  publisher={IEEE}
}

@INPROCEEDINGS{govindan_infocom_2000,
author={Govindan, R. and Tangmunarunkit, H.},
booktitle={Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)},
title={Heuristics for Internet map discovery},
year={2000},
volume={3},
number={},
pages={1371-1380 vol.3},
doi={10.1109/INFCOM.2000.832534}
}

@inproceedings{ gil-blythe-aaai00,
 title = {How Can a Structured Representation of Capabilities Help in Planning?},
 author = {Yolanda Gil and Jim Blythe},
 booktitle = {AAAI 2000 Workshop on Representational Issues for Real-world Planning Systems},
 address = {Austin, TX},
 year = {2000}
 }

@article{wroclawski2000integrated,
	author = {Wroclawski, John and Davie, Bruce and Iturralde, Carol},
	title = {Integrated Services in the Presence of Compressible Flows},
	year = {2000}}

@InProceedings{ambite00:aips,
        Author="Jos\'{e} Luis Ambite and Craig A. Knoblock and Steven Minton",
        Title="Learning Plan Rewriting Rules",
        Booktitle="{P}roceedings of the Fifth International Conference
                  on Artificial Intelligence Planning and Scheduling",
        Address="Breckenridge, CO",
        Year=2000,
         urlPaper= "http://usc-isi-i2.github.io/papers/ambite00-aips.pdf",
       	Keywords = {"Planning by Rewriting","Planning"}}


	

@InProceedings{KLerman00,
  author =       "Kristina Lerman and Steven Minton",
  title =        "Learning the Common Structure of Data",
  pages =        "",
  ISBN =         "",
  booktitle =    "Proceedings of the 15th National Conference on
                 Artificial Intelligence ({AAAI}-2000)",
  month =        Jul # "~26--30",
  publisher =    "AAAI Press",
  address =      "Menlo Park",
  year =         "2000",
  urlPaper={http://www.isi.edu/~lerman/papers/KLerman00.pdf},
  keywords =    {semantic-modeling},
}

@InProceedings{Heidemann00b,
	author = "John Heidemann and Dhaval Shah",
	title = 	"Location-Aware Scheduling With Minimal Infrastructure",
	booktitle = 	" {USENIX} Conference Proceedings",
	year = 		2000,
	sortdate = 		"2000-06-01",
	project = "ant, vint, lsam",
	jsubject = "sensornet_localization",
	publisher =	"{USENIX}",
	address =	"San Diego, CA",
	month =		jun,
	pages =		"131--138",
	location =	"johnh: pafile",
	location =	"johnh: folder: mobile computing xxx",
	keywords =	"cron, xcron, lcron, location-awareness,
                         context-awareness, mobile computing",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann00b.html",
	psurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann00b.ps.gz",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Heidemann00b.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
Mobile computers often benefit from software which adapts to their
location.  For example, a computer might be backed up when at the
office, or the default printer might always be a nearby one.  In many
existing systems, location-triggered actions are only possible for
specific applications or with special infrastructure.  This paper
describes \emph{lcron}, a system which
supports \emph{user-configurable}
actions triggered on \emph{change in location} or other events common
to mobile computers.  Key features of \emph{lcron} are its use of existing
clues for location information and mapping low-level location
information into user-sensible terms.  \emph{Lcron} uses a number of
existing sources of location such as network connection and base
station ID, allowing it to work without special hardware or GPS
receivers.  We map sources of low-level information such as IP address
and latitude/longitude into user-meaningful \emph{logical} locations.
We describe the design, implementation and our experiences with this
system.
",
}

Mobile computers often benefit from software which adapts to their location. For example, a computer might be backed up when at the office, or the default printer might always be a nearby one. In many existing systems, location-triggered actions are only possible for specific applications or with special infrastructure. This paper describes \emphlcron, a system which supports \emphuser-configurable actions triggered on \emphchange in location or other events common to mobile computers. Key features of \emphlcron are its use of existing clues for location information and mapping low-level location information into user-sensible terms. \emphLcron uses a number of existing sources of location such as network connection and base station ID, allowing it to work without special hardware or GPS receivers. We map sources of low-level information such as IP address and latitude/longitude into user-meaningful \emphlogical locations. We describe the design, implementation and our experiences with this system.

@article{frank2000marbles,
  title={Marbles: A Family of Cooperative Negotiation Schemes for Real-Time Fault-Tolerant Distributed Resource Allocation},
  author={Frank, Martin and Bugacov, Alejandro and Chen, Jinbo and Dakin, Gordon and Szekely, Pedro and Neches, Bob},
  year={2000}
}

@Article{Estrin00b,
	author = 	"Deborah Estrin and Mark Handley and John Heidemann and Steven McCanne and Ya Xu and Haobo Yu",
	title = 	"Network Visualization with the {Nam}, {VINT} Network Animator",
	journal = 	"IEEE Computer",
	year = 		2000,
	sortdate = 		"2000-11-01", 
	project = "ant, vint",
	jsubject = "network_simulation",
	volume =	33,
	number =	11,
	month =		nov,
	pages =		"63--68",
	jlocation =	"johnh: pafile xxx",
	jlocation =	"johnh: folder: network/visualization",
	keywords =	"nam, network visualization, ns, network
                         simulation, VINT",
	copyrightholder = "IEEE",
	copyrightterms = "	Personal use of this material is permitted.  However, 	permission to reprint/republish this material for advertising 	or promotional purposes or for creating new collective works         for resale or redistribution to servers or lists, 	or to reuse any copyrighted component of this work in other works 	must be obtained from the IEEE. ",
	myorganization =	"USC/Information Sciences Institute",
	officialurl =		"http://dlib.computer.org/co/books/co2000/pdf/ry063.pdf",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Estrin00b.html",
	doi = "http://dx.doi.org/10.1109/2.881696",
	pdfurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Estrin00b.pdf",
	abstract = "
Network protocol designers face difficult tasks, including
simultaneously monitoring state in a potentially large number of
nodes, understanding and analyzing complex message exchanges, and
characterizing dynamic interactions with competing traffic.
% \newparagraph
Researchers have explored network protocol visualization in many
contexts, beginning with static protocol graphs and visualization of
large-scale traffic, and more recently including simulation
visualizations and editors. Network visualization tools allow
designers to take in large amounts of information quickly, visually
identify patterns in communication, and better understand causality
and interaction. 
% \newparagraph
Nam is a network animator that provides packet-level
animation, protocol graphs, traditional time-event plots of protocol
actions, and scenario editing capabilities. Nam benefits from a close
relationship with ns, which can collect detailed protocol information
from a simulation. The authors describe how nam uses preprocessing to
visualize data taken directly from real network traces. They also feel
that visualization tools such as nam make protocol design and
debugging easier.
",
}

Network protocol designers face difficult tasks, including simultaneously monitoring state in a potentially large number of nodes, understanding and analyzing complex message exchanges, and characterizing dynamic interactions with competing traffic. % \newparagraph Researchers have explored network protocol visualization in many contexts, beginning with static protocol graphs and visualization of large-scale traffic, and more recently including simulation visualizations and editors. Network visualization tools allow designers to take in large amounts of information quickly, visually identify patterns in communication, and better understand causality and interaction. % \newparagraph Nam is a network animator that provides packet-level animation, protocol graphs, traditional time-event plots of protocol actions, and scenario editing capabilities. Nam benefits from a close relationship with ns, which can collect detailed protocol information from a simulation. The authors describe how nam uses preprocessing to visualize data taken directly from real network traces. They also feel that visualization tools such as nam make protocol design and debugging easier.

@article{Narayanan2000Noisesourcemodelsfor,
 author = {Narayanan, Shrikanth S. and Alwan, Abeer},
 bib2html_rescat = {},
 doi = {10.1109/89.841215},
 journal = {IEEE Transactions on Speech and Audio Processing},
 link = {http://sail.usc.edu/publications/files/narayanansap2000.pdf},
 month = {Mar},
 number = {2},
 pages = {328-344},
 title = {Noise source models for fricative consonants},
 volume = {8},
 year = {2000}
}

@TECHREPORT{Radoslavov00oncharacterizing,
    author = {Pavlin Radoslavov and Hongsuda Tangmunarunkit and Haobo Yu and Ramesh Govindan and Scott Shenker and Deborah Estrin},
    title = {On Characterizing Network Topologies and Analyzing Their Impact on Protocol Design},
    institution = {University of Southern California},
    year = {2000}
}

@TechReport{Allman00a,
	author = "M. Allman and S. Dawkins and D. Glover and J. Griner
                         and D. Tran and T. Henderson and J. Heidemann
                         and J. Touch and H. Kruse and S. Ostermann
                         and K. Scott and J. Semke",
	title = "Ongoing {TCP} Research Related to Satellites",
	institution =  "Internet Request For Comments",
	year = 	       2000,
	sortdate = 	       "2000-02-01",
	type =	       "RFC",
	number =       2760,
	month =	       feb,
	jlocation =	"johnh: pafiles",
	jlocation =     "johnh: folder: networking/tcp/extensions",
	keywords =     "tcp, slow-start restart",
	url =	       "ftp://ftp.isi.edu/in-notes/rfc2760.txt",
	copyrightholder = "The Internet Society",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Allman00a.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Allman00a.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Allman00a.pdf",
	texturl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Allman00a.txt",
	project = "ant",
	abstract = "
This document outlines possible TCP enhancements that may allow TCP
to better utilize the available bandwidth provided by networks
containing satellite links.  The algorithms and mechanisms outlined
have not been judged to be mature enough to be recommended by the
IETF.  The goal of this document is to educate researchers as to the
current work and progress being done in TCP research related to
satellite networks.
"
}

This document outlines possible TCP enhancements that may allow TCP to better utilize the available bandwidth provided by networks containing satellite links. The algorithms and mechanisms outlined have not been judged to be mature enough to be recommended by the IETF. The goal of this document is to educate researchers as to the current work and progress being done in TCP research related to satellite networks.

@PhDThesis{ashish00:thesis,
   Author = "Naveen Ashish",
   Title = "Optimizing information mediators by selectively materializing data",
   School = "Department of Computer Science, University of Southern California",
   Year = "2000",
       	Keywords = {"Information Mediators","Data Integration"}}

@inproceedings{gil-blythe-planet-aaai00, 
  title = {PLANET: A Shareable and Reusable Ontology for Representing Plans},
  author = {Yolanda Gil and Jim Blythe},
  year = "2000",
  booktitle = "AAAI Workshop on Representational Issues for Real-World Planning Systems",
  address = "Austin, TX"
}

@inbook{Byrd2000Phrasalsignaturesinarticulation,
 address = {New York, NY},
 author = {Byrd, Dani and Kaun, Abigail and Narayanan, Shrikanth S. and Saltzman, Elliot},
 bib2html_rescat = {span},
 chapter = {5},
 editor = {Broe, Michael B. and Pierrehumbert, Janet B.},
 link = {http://sail.usc.edu/publications/files/byrdpapersinlaboratoryphonologyv2000.pdf},
 month = {Mar},
 pages = {70-87},
 publisher = {Cambridge University Press},
 title = {Phrasal signatures in articulation},
 year = {2000}
}

@inproceedings{muslea00:ecai,
   author  = "Ion Muslea and Steven Minton and Craig A. Knoblock",
   title   = "Selective Sampling With Naive Co-Testing: Preliminary Results",
   booktitle = "Proceedings of the ECAI-2000 Workshop On Machine Learning for Information Extraction",
   address = "Berlin, Germany",
   year    = "2000",
   urlPaper = "http://usc-isi-i2.github.io/papers/muslea00-ecai.pdf",
   Keywords = {"Wrapper Learning","Active Learning"}

}

@inproceedings{muslea00:crm,
   author  = "Ion Muslea and Steven Minton and Craig A. Knoblock",
   title   = "Selective sampling with co-testing",
   booktitle = "Proceedings of the CRM Workshop on Selecting and Combining Models with Machine Learning Algorithms",
   address = "Montreal, Canada",
   month = "April",
   year    = "2000",
   Keywords = {"Wrapper Learning","Active Learning"}
}

@inproceedings{muslea00:aaai,
   author  = "Ion Muslea and Steven Minton and Craig A. Knoblock",
   title   = "Selective sampling with redundant views",
   booktitle = "Proceedings of the 17th National Conference on Artificial Intelligence",
   year    = "2000",
   urlPaper = "http://usc-isi-i2.github.io/papers/muslea00-aaai.pdf",
   Keywords = {"Wrapper Learning","Active Learning"}
}

@article{hsu00:tkde,
	author="Chun-Nan Hsu and Craig A. Knoblock",
	title="Semantic Query Optimization for Query Plans of Heterogeneous Multi-Database Systems",
	journal="IEEE Transactions on Knowledge and Data Engineering",
        volume = 12,
        number = 6,
        month = "November/December",
        pages = "959--978",
	year="2000",
	urlPaper = "http://usc-isi-i2.github.io/papers/hsu00-tkde.pdf",
       	Keywords = {"Semantic Query Optimization","Query Planning"}
}

@inproceedings{ko_semantically-based_2000,
	address = {Lisbon, Portugal},
	title = {Semantically-{Based} {Active} {Document} {Collection} {Templates} for {Web} {Information} {Management} {Systems}},
	booktitle = {Proceedings of the {International} {Workshop} on the {Semantic} {Web}},
	author = {Ko, In-Young and Neches, Robert and Yao, Ke-Thia},
	month = sep,
	year = {2000},
}

@inproceedings{barish00:aaai,
        author="Greg Barish and Craig A. Knoblock and Steven Minton",
        title="Speculative Execution for Information Agents",
        booktitle="Proceedings of Seventeenth National Conference on 
                   Artificial Intelligence (AAAI-2000), Student Abstract",
        address="Austin, Texas",
        year=2000,
        urlPaper= "http://usc-isi-i2.github.io/papers/barish00-aaai.pdf",
         Keywords = {"Dataflow Execution","Information Agents"}
}

@inproceedings{proc_levin:communicator:icslp00,
 address = {Beijing, China},
 author = {Levin, Esther and Narayanan, Shrikanth S. and Pieraccini, Roberto and Biatov, Konstantin and Bocchieri, E. and Fabbrizio, Giuseppe Di and Eckert, Wieland and Lee, Sungbok and Pokrovsky, A. and Rahim, Mazin and Ruscitti, P. and Walker, Marilyn},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/levininterspeech2000.pdf},
 month = {Oct},
 pages = {122-125},
 title = {The AT\&T-DARPA communicator mixed-initiative spoken dialog system},
 year = {2000}
}