@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}
}

@inproceedings{LFB+2004,
	author = {Lee, George and Faratin, Peyman and Bauer, Steven and Wroclawski, John},
	booktitle = {Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications},
	date-modified = {2022-02-19 14:08:30 -0800},
	organization = {IEEE},
	pages = {219--228},
	title = {A user-guided cognitive agent for network service selection in pervasive computing environments},
	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{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{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{Stathopoulos04a,
	author = "Thanos Stathopoulos and Rahul Kapur and
 Deborah Estrin and John Heidemann and Lixia Zhang",
	title = "Application-Based Collision Avoidance in Wireless Sensor Networks",
	booktitle = 	"Proceedings of the " # "29th" # " IEEE International Conference on Local Computer Networks",
	year = 		2004,
	sortdate = "2004-11-01",
	project = "ilense, nocredit, cens, macss",
	jsubject = "sensornet_data_dissemination",
	publisher =	"IEEE",
	address =	"Tampa, Flordia, USA",
	month =		nov,
	pages =		"506--514",
	location =	"johnh: pafile",
	doi = "http://dx.doi.org/10.1109/LCN.2004.24",
	otherurl =		"http://lecs.cs.ucla.edu/%7ethanos/collision.pdf",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Stathopoulos04a.html",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Stathopoulos04a.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 = "
Wireless sensor networks are characterized by collections of small,
low-power nodes that collect information about the physical
world. Concurrent transmissions caused by the well-known hidden
terminal problem result in collisions and packet corruption. Since
corrupted packets must be retransmitted, collisions add an additional
burden to the already energy constrained system. In this paper, we
present an application-based approach to collision avoidance.We
propose two specific algorithms; the first one follows TCP's
congestion avoidance algorithm and adjusts the transmission rate when
a collision occurs, while the second one shifts packet transmission
times to minimize collisions. We evaluated both algorithms through
simulations and our results show that our approach can reduce the
number of collision-induced retransmissions by a factor of 8 and the
energy consumption by up to 50\%.
",
}

Wireless sensor networks are characterized by collections of small, low-power nodes that collect information about the physical world. Concurrent transmissions caused by the well-known hidden terminal problem result in collisions and packet corruption. Since corrupted packets must be retransmitted, collisions add an additional burden to the already energy constrained system. In this paper, we present an application-based approach to collision avoidance.We propose two specific algorithms; the first one follows TCP's congestion avoidance algorithm and adjusts the transmission rate when a collision occurs, while the second one shifts packet transmission times to minimize collisions. We evaluated both algorithms through simulations and our results show that our approach can reduce the number of collision-induced retransmissions by a factor of 8 and the energy consumption by up to 50%.

@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{gil_artificial_2004,
	title = {Artificial intelligence and grids: workflow planning and beyond},
	volume = {19},
	issn = {1541-1672},
	shorttitle = {Artificial intelligence and grids},
	url = {http://ieeexplore.ieee.org/document/1265882/},
	doi = {10.1109/MIS.2004.1265882},
	language = {en},
	number = {1},
	urldate = {2022-02-12},
	journal = {IEEE Intelligent Systems},
	author = {Gil, Y. and Deelman, E. and Blythe, J. and Kesselman, C. and Tangmunarunkit, H.},
	month = jan,
	year = {2004},
	pages = {26--33},
}

@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,
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"DEWP, worm propagation, NEWS",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Chen04a.html",
	pdfurl =	"http://www.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{Hussain04b,
	author = 	"Alefiya Hussain and John Heidemann and Christos Papadopoulos",
	title = 	"Distinguishing between Single and Multi-source Attacks using Signal Processing",
	journal = 	"Computer Networks",
	year = 		2004,
	sortdate = 		"2004-11-01", 
	project = "ant, saman, conser, cossack, nocredit, madcat",
	jsubject = "network_security",
	volume =	46,
	number =	4,
	month =		nov,
	pages =		"479--503",
	note =		"this paper is an expanded version of ``A Framework for Classifying Denial of Service Attacks''",
	location =	"johnh: pafile",
	keywords =	"ddos classification, spectral analysis",
	otherurl =	"http://www.isi.edu/%7ehussain/pubs/Hussain04b.pdf",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Hussain04b.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Hussain04b.pdf",
	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{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.)

@techreport{clark2004future,
	author = {Clark, David and Sollins, Karen and Wroclawski, John and Katabi, Dina and Kulik, Joanna},
	institution = {UNIVERSITY OF SOUTHERN CALIFORNIA MARINA DEL REY INFORMATION SCIENCES INST},
	title = {Future Generation Network Architecture (New Arch)},
	year = {2004}}

@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}
}

@TechReport{Wang04a,
	author = 	"Xi Wang and Fabio Silva and John Heidemann",
	title = 	"Infrastructureless Location Aware Configuration for Sensor Networks",
	institution = 	"USC/Information Sciences Institute",
	year = 		2004,
	sortdate = "2004-06-01",
	project = "ilense, whumls, surese",
	jsubject = "chronological",
	number =	"ISI-TR-2004-589",
	month =		jun,
	location =	"johnh: pafile",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Wang04a.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Wang04a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	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{lee2004learning,
	author = {Lee, George and Bauer, Steve and Faratin, Peyman and Wroclawski, John},
	booktitle = {Autonomous Agents and Multiagent Systems, International Joint Conference on},
	organization = {IEEE Computer Society},
	pages = {480--487},
	title = {Learning user preferences for wireless services provisioning},
	volume = {2},
	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",
	location =	"johnh: pafile",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Chang04b.html",
	pdfurl =	"http://www.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.

@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",
	location =	"johnh: pafile",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Chang04b.html",
	pdfurl =	"http://www.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{Ye04b,
	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",
	sortdate = "2004-06-01",
	project = "ilense, macss, scowr, saman, cens",
	jsubject = "sensornet_subtransport",
	year = 		2004,
	volume =	12,
	number =	3,
	month =		jun,
	pages =		"493--506",
	note = "A preprint of this paper was available as ISI-TR-2003-567",
	location =	"johnh: pafile",
	keywords =	"s-mac, adaptive sleep",
	doi = "http://dx.doi.org/10.1109/TNET.2004.828953",
	otherurl = "http://ieeexplore.ieee.org/iel5/90/29000/01306496.pdf?tp=&arnumber=1306496&isnumber=29000&arSt=493&ared=506&arAuthor=Ye%2C+W.%3B++Heidemann%2C+J.%3B++Estrin%2C+D.%3B",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye04b.html",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Ye04b.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 = "
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 nodes remaining largely inactive for long
time, but 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 several ways:  energy conservation and self-configuration are
primary goals, while per-node fairness and latency are less
important. S-MAC uses a few novel techniques to reduce energy
consumption and support self-configuration. It enables low-duty-cycle
operation in a multihop network. Nodes form \emph{virtual clusters} based on
common sleep schedules to reduce control overhead and enable
traffic-adaptive wake-up. S-MAC uses in-channel signaling to avoid
overhearing unnecessary traffic. Finally, S-MAC applies \emph{message
passing} to reduce contention latency for applications that require
in-network data processing. The paper presents measurement results of
S-MAC performance on a sample sensor node, the UC Berkeley Mote, and
reveals fundamental tradeoffs on energy, latency and
throughput. Results show that S-MAC obtains significant energy savings
compared with an 802.11-like MAC without sleeping.
",
}

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 nodes remaining largely inactive for long time, but 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 several ways: energy conservation and self-configuration are primary goals, while per-node fairness and latency are less important. S-MAC uses a few novel techniques to reduce energy consumption and support self-configuration. It enables low-duty-cycle operation in a multihop network. Nodes form \emphvirtual clusters based on common sleep schedules to reduce control overhead and enable traffic-adaptive wake-up. S-MAC uses in-channel signaling to avoid overhearing unnecessary traffic. Finally, S-MAC applies \emphmessage passing to reduce contention latency for applications that require in-network data processing. The paper presents measurement results of S-MAC performance on a sample sensor node, the UC Berkeley Mote, and reveals fundamental tradeoffs on energy, latency and throughput. Results show that S-MAC obtains significant energy savings compared with an 802.11-like MAC without sleeping.

@techreport{clark2004new,
	author = {Clark, David and Braden, Robert and Sollins, Karen and Wroclawski, John and Katabi, Dina},
	institution = {MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE},
	title = {New arch: Future generation internet architecture},
	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{afergan2004benefits,
	author = {Afergan, Mike and Wroclawski, John},
	booktitle = {Proceedings of the ACM SIGCOMM Workshop on Practice and theory of incentives in networked systems},
	pages = {197--204},
	title = {On the benefits and feasibility of incentive based routing infrastructure},
	year = {2004}}

@inproceedings{deelman_pegasus:_2004,
	title = {Pegasus: {Mapping} {Scientific} {Workflows} onto the {Grid}},
	booktitle = {European {Across} {Grids} {Conference}},
	author = {Deelman, Ewa and Blythe, James and Gil, Yolanda and Kesselman, Carl and Mehta, Gaurang and Patil, Sonal and Su, Mei-Hui and Vahi, Karan and Livny, Miron},
	year = {2004},
	pages = {11--20},
}

@InProceedings{Lerman04atem,
  author =       "Kristina Lerman and C. Gazen  and Steve Minton and Craig A. Knoblock",
  title =        "Populating the Semantic Web",
  pages =        "",
  ISBN =         "",
  booktitle =    "Proceedings of the Workshop on Advances in Text Extraction and Mining ({AAAI}-2004)",
  month =        "",
  publisher =    "",
  address=       "",
  year =         "2004",
  keywords =    {semantic-modeling},
}

@inproceedings{SKF+2004,
	author = {Sami, Rahul and Katabi, Dina and Faratin, Peyman and Wroclawski, John},
	booktitle = {ACM SIGCOMM Workshop on Practice and Theory of Incentives in Networked Systems},
	date-modified = {2022-02-19 14:12:41 -0800},
	title = {Practice and theory of incentives in networked systems (PINS): Workshop Report},
	year = {2004}}

@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.

@techreport{zue2004project,
	author = {Zue, Victor and Wroclawski, John and Bolotski, Michael},
	institution = {MIT Laboratory for Computer Science},
	title = {Project Listen Compute Show (LCS)-Marine},
	year = {2004}}

@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{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"}}

@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" }

@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{Bulusu04a,
	 author = 	"Nirupama Bulusu and John Heidemann and Deborah Estrin and Tommy Tran",
	 title = 	"Self-configuring localization systems: Design and Experimental Evaluation",
	 journal = 	"ACM Transactions on Embedded Computing Systems",
	 year = 		2004,
	  sortdate = "2004-02-01",
	project = "ilense, scadds, scowr, nocredit",
	jsubject = "sensornet_localization",
	 volume =	3,
	 number =	1,
	 month =		feb,
	 pages =		"24--60",
	 brag = "98th most cited paper in CS for 2003 according to CiteSeer (as of Feb. 2005)",
	 location =	"johnh: pafile",
	 keywords =	"localization",
	 url =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu04a.html",
	 pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Bulusu04a.pdf",
	 doi = "http://doi.acm.org/10.1145/972627.972630",
	 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. ", 
	 myorganization =	"USC/Information Sciences Institute",
	 abstract = "
 Embedded networked sensors promise to revolutionize the way we
 interact with our physical environment and require scalable, ad hoc
 deployable and energy-efficient node localization/positioning.  This
 paper describes the motivation, design, implementation, and
 experimental evaluation (on sharply resource-constrained devices) of a
 self-configuring localization system using radio beacons. We identify
 beacon density as an important parameter in determining localization
 quality, which saturates at a transition density. We develop
 algorithms to improve localization quality by (i) automating placement
 of new beacons at low densities (HEAP) and (ii) rotating
 functionality among redundant beacons while increasing system lifetime
 at high densities (STROBE).
 ",
}

Embedded networked sensors promise to revolutionize the way we interact with our physical environment and require scalable, ad hoc deployable and energy-efficient node localization/positioning. This paper describes the motivation, design, implementation, and experimental evaluation (on sharply resource-constrained devices) of a self-configuring localization system using radio beacons. We identify beacon density as an important parameter in determining localization quality, which saturates at a transition density. We develop algorithms to improve localization quality by (i) automating placement of new beacons at low densities (HEAP) and (ii) rotating functionality among redundant beacons while increasing system lifetime at high densities (STROBE).

@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}
}

@TechReport{He04a,
	author = 	"Xinming He and Christos Papadopoulos and John Heidemann and Alefiya Hussain",
	title = 	"Spectral Characteristics of Saturated Links",
	institution = 	"University of Southern California Computer Science Department",
	year = 		2004,
	sortdate = 		"2004-06-01",
	project = "ant, madcat, nocredit",
	jsubject = "spectral_network",
	number =	"USC-CSD-TR-827",
	month =		jun,
	note =		"submitted for review",
	location =	"johnh: pafile",
	keywords =	"spectral analysis",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/He04a.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/He04a.pdf",
	otherurl = "http://www.cs.usc.edu/Research/TechReports/04-827.zip",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "
Internet protocols frequently create periodic patterns in traffic. Examples
included packets paced by bottleneck links, periodic exchange of information
such as routing, transport-layer effects such as TCP self-clocking, and
application-level effects. Although measurement of such periodicities could
shed light on Internet traffic, current understanding of periodic behavior
in general traffic is quite limited. This paper explores this area by
studying the spectral behavior of these kinds of traffic. Our technique is
completely passive and can be applied to aggregate traces gathered at
various observation points on the network. Unlike techniques measuring
packet inter-arrival time, our technique does not require per-flow
separation. Our experiments show that the signature of a saturated link
persists in the presence of background traffic or when we observe only a
portion of the traffic through the saturated link. We investigate how such
signatures evolve as the traffic traverses through the network and identify
the major influential factors that affect the signatures. Developing a
technique to detect saturated links is part of our future work.
",
}

Internet protocols frequently create periodic patterns in traffic. Examples included packets paced by bottleneck links, periodic exchange of information such as routing, transport-layer effects such as TCP self-clocking, and application-level effects. Although measurement of such periodicities could shed light on Internet traffic, current understanding of periodic behavior in general traffic is quite limited. This paper explores this area by studying the spectral behavior of these kinds of traffic. Our technique is completely passive and can be applied to aggregate traces gathered at various observation points on the network. Unlike techniques measuring packet inter-arrival time, our technique does not require per-flow separation. Our experiments show that the signature of a saturated link persists in the presence of background traffic or when we observe only a portion of the traffic through the saturated link. We investigate how such signatures evolve as the traffic traverses through the network and identify the major influential factors that affect the signatures. Developing a technique to detect saturated links is part of our future work.

@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{Hussain04a,
	author = 	"Alefiya Hussain and Aman Kapoor and John Heidemann",
	title = 	"The Effect of Detail on Ethernet Simulation",
	booktitle = 	"Proceedings of the " # " ACM Workshop on Parallel and Distributed Simulation",
	year = 		2004,
	sortdate = 		"2004-05-01",
	project = "ant, saman, conser",
	jsubject = "network_simulation",
	publisher =	"ACM",
	address =	"Kufstein, Austria",
	month =		may,
	pages =		"97--104",
	location =	"johnh: pafile",
	keywords =	"network simulation, ethernet, detail",
	otherurl =	"http://www.isi.edu/%7ehussain/pubs/Hussain04a.pdf",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Hussain04a.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Hussain04a.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 = "
An important question for network simulation is what level of
detail is required to obtain a desired level of accuracy. While in
some networks, the level of detail is an open research issue (for
example, radio propagation models in wireless networks), it has long
been assumed that wired networks could be accurately modeled by fairly
simple queues with a bandwidth limit and propagation delay. To our
knowledge this assumption has not been widely tested. In this paper we
evaluate different levels of detail for an Ethernet simulation. We
consider two models for Ethernet simulation; a detailed, CSMA/CD
protocol based model and a more abstract model using a DropTail,
shared queue. Using web traffic with two different TCP simulation
models, we evaluated the accuracy of these Ethernet models as compared
to testbed measurements. We observed the DropTail Ethernet model
requires significantly less execution time and can accurately model
performance using a bandwidth normalization factor.
",
}

An important question for network simulation is what level of detail is required to obtain a desired level of accuracy. While in some networks, the level of detail is an open research issue (for example, radio propagation models in wireless networks), it has long been assumed that wired networks could be accurately modeled by fairly simple queues with a bandwidth limit and propagation delay. To our knowledge this assumption has not been widely tested. In this paper we evaluate different levels of detail for an Ethernet simulation. We consider two models for Ethernet simulation; a detailed, CSMA/CD protocol based model and a more abstract model using a DropTail, shared queue. Using web traffic with two different TCP simulation models, we evaluated the accuracy of these Ethernet models as compared to testbed measurements. We observed the DropTail Ethernet model requires significantly less execution time and can accurately model performance using a bandwidth normalization factor.

@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{Lerman04sigmod,
  author =       "Kristina Lerman and L. Getoor and Steve Minton and Craig A. Knoblock",
  title =        "{Using the Structure of Web Sites for Automatic Segmentation of Tables}",
  month={jun},
  year =         "2004",
  booktitle =    "In \emph{Proceedings of ACM SIG on Management of Data (SIGMOD-2004)}",
  pages =        "",
  urlPaper={http://www.isi.edu/~lerman/papers/lermanSIGMOD04.pdf},
  keywords =    {wrapper-maintenance},
}

@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{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.)

@InProceedings{Hussain03b,
	author = 	"Alefiya Hussain and John Heidemann and Christos Papadopoulos",
	title = 	"A Framework for Classifying Denial of Service Attacks",
	booktitle = 	"Proceedings of the " # " ACM SIGCOMM Conference ",
	year = 		2003,
	sortdate = 		"2003-08-01", 
	project = "ant, saman, conser, cossack",
	jsubject = "network_security",
	publisher =	"ACM",
	address =	"Karlsruhe, Germany",
	month =		aug,
	pages =		"99--110",
	notes = "See ISI-TR-2003-569b for extended discussion.",
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Hussain03b.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Hussain03b.pdf",
	keywords =	"ddos classification, spectral analysis",
	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.

@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)",
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"ddos classification, spectral analysis",
	otherurl =	"ftp://ftp.isi.edu/isi-pubs/tr-569.pdf",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Hussain03a.html",
	pdfurl =	"http://www.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},
}

@inproceedings{CPR+2003,
	author = {Clark, David D. and Partridge, Craig and Ramming, J. Christopher and Wroclawski, John T.},
	booktitle = {Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM 2003)},
	date-modified = {2022-02-19 14:11:21 -0800},
	pages = {3--10},
	title = {A Knowledge Plane for the Internet},
	year = {2003}}

@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",
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"RAMP, traffic modeling, on-line traffic modeling",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Lan03b.html",
	pdfurl =	"http://www.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{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}
}

@article{Suh:2003:PAP:871656.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},
 journal = {SIGARCH Comput. Archit. News},
 volume = {31},
 issue = {2},
 month = {May},
 year = {2003},
 issn = {0163-5964},
 pages = {410--421},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/871656.859665},
 doi = {http://doi.acm.org/10.1145/871656.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{DBLP:series/sfsc/KnoblockLMM03,
  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},
  pages     = {275--287},
  year      = {2003},
  crossref  = {DBLP:series/sfsc/2003-111},
  url       = {https://doi.org/10.1007/978-3-7908-1772-0\_17},
  doi       = {10.1007/978-3-7908-1772-0\_17},
  timestamp = {Sun, 14 Apr 2019 19:26:53 +0200},
  biburl    = {https://dblp.org/rec/series/sfsc/KnoblockLMM03.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@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{clark2003addressing,
	author = {Clark, David D. and Sollins, Karen and Wroclawski, John T. and Faber, Ted},
	booktitle = {Proceedings of the ACM SIGCOMM Workshop on Future Directions in Network Architecture},
	month = {August},
	pages = {247--257},
	title = {Addressing Reality: an Architectural Response to Real-World Demands on the Evolving Internet},
	year = {2003}}

@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{Ganesan03a,
	 author = 	"Deepak Ganesan and Ben Greenstein and Denis
			  Perelyubskiy and Deborah Estrin and John Heidemann",
	 title = 	"An Evaluation of Multi-resolution Storage for Sensor Networks",
	 booktitle = 	"Proceedings of the " # "First" # " ACM {SenSys} Conference ",
	 year = 		2003,
	sortdate = 		"2002-10-01",
	project = "ilense, cens, scadds",
	jsubject = "sensornet_general",
	 publisher =	"ACM",
	 address =	"Los Angeles, California, USA",
	 month =		nov,
	 pages =		"89--102",
	 location =	"johnh: folder: xxx",
	 location =	"johnh: pafile",
	 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. ",
	 myorganization =	"USC/Information Sciences Institute",
	 keywords =	"multiresolution sensor network data storage",
	 url =		"http://www.isi.edu/%7ejohnh/PAPERS/Ganesan03a.html",
	 pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Ganesan03a.pdf",
	 otherurl =	"http://lecs.cs.ucla.edu/%7edeepak/PAPERS/storage.pdf",
	 abstract = "
 Wireless sensor networks enable dense sensing of the environment,
 offering unprecedented opportunities for observing the physical world.
 Centralized data collection and analysis adversely impact sensor node
 lifetime. Previous sensor network research has, therefore, focused on
 in network aggregation and query processing, but has done so for
 applications where the features of interest are known a priori. When
 features are not known a priori, as is the case with many scientific
 applications in dense sensor arrays, efficient support for
 multi-resolution storage and iterative, drill-down queries is
 essential.  Our system demonstrates the use of in-network
 wavelet-based summarization and progressive aging of summaries in
 support of long-term querying in storage and communication-constrained
 networks.  We evaluate the performance of our linux implementation and
 show that it achieves: (a) low communication overhead for
 multi-resolution summarization, (b) highly efficient drill-down search
 over such summaries, and (c) efficient use of network storage capacity
 through load-balancing and progressive aging of summaries.
 ",
}

Wireless sensor networks enable dense sensing of the environment, offering unprecedented opportunities for observing the physical world. Centralized data collection and analysis adversely impact sensor node lifetime. Previous sensor network research has, therefore, focused on in network aggregation and query processing, but has done so for applications where the features of interest are known a priori. When features are not known a priori, as is the case with many scientific applications in dense sensor arrays, efficient support for multi-resolution storage and iterative, drill-down queries is essential. Our system demonstrates the use of in-network wavelet-based summarization and progressive aging of summaries in support of long-term querying in storage and communication-constrained networks. We evaluate the performance of our linux implementation and show that it achieves: (a) low communication overhead for multi-resolution summarization, (b) highly efficient drill-down search over such summaries, and (c) efficient use of network storage capacity through load-balancing and progressive aging of summaries.

@InProceedings{Ganesan03a,
	 author = 	"Deepak Ganesan and Ben Greenstein and Denis
			  Perelyubskiy and Deborah Estrin and John Heidemann",
	 title = 	"An Evaluation of Multi-resolution Storage for Sensor Networks",
	 booktitle = 	"Proceedings of the " # "First" # " ACM {SenSys} Conference ",
	 year = 		2003,
	sortdate = 		"2002-10-01",
	project = "ilense, cens, scadds",
	jsubject = "sensornet_general",
	 publisher =	"ACM",
	 address =	"Los Angeles, California, USA",
	 month =		nov,
	 pages =		"89--102",
	 location =	"johnh: folder: xxx",
	 location =	"johnh: pafile",
	 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. ",
	 myorganization =	"USC/Information Sciences Institute",
	 keywords =	"multiresolution sensor network data storage",
	 url =		"http://www.isi.edu/%7ejohnh/PAPERS/Ganesan03a.html",
	 pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Ganesan03a.pdf",
	 otherurl =	"http://lecs.cs.ucla.edu/%7edeepak/PAPERS/storage.pdf",
	 abstract = "
 Wireless sensor networks enable dense sensing of the environment,
 offering unprecedented opportunities for observing the physical world.
 Centralized data collection and analysis adversely impact sensor node
 lifetime. Previous sensor network research has, therefore, focused on
 in network aggregation and query processing, but has done so for
 applications where the features of interest are known a priori. When
 features are not known a priori, as is the case with many scientific
 applications in dense sensor arrays, efficient support for
 multi-resolution storage and iterative, drill-down queries is
 essential.  Our system demonstrates the use of in-network
 wavelet-based summarization and progressive aging of summaries in
 support of long-term querying in storage and communication-constrained
 networks.  We evaluate the performance of our linux implementation and
 show that it achieves: (a) low communication overhead for
 multi-resolution summarization, (b) highly efficient drill-down search
 over such summaries, and (c) efficient use of network storage capacity
 through load-balancing and progressive aging of summaries.
 ",
}

Wireless sensor networks enable dense sensing of the environment, offering unprecedented opportunities for observing the physical world. Centralized data collection and analysis adversely impact sensor node lifetime. Previous sensor network research has, therefore, focused on in network aggregation and query processing, but has done so for applications where the features of interest are known a priori. When features are not known a priori, as is the case with many scientific applications in dense sensor arrays, efficient support for multi-resolution storage and iterative, drill-down queries is essential. Our system demonstrates the use of in-network wavelet-based summarization and progressive aging of summaries in support of long-term querying in storage and communication-constrained networks. We evaluate the performance of our linux implementation and show that it achieves: (a) low communication overhead for multi-resolution summarization, (b) highly efficient drill-down search over such summaries, and (c) efficient use of network storage capacity through load-balancing and progressive aging of summaries.

@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{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}
}

@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{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{jiang2003data,
  title={Data conversion for process/thread migration and checkpointing},
  author={Jiang, Hai and Chaudhary, Vipin and Walters, John Paul},
  booktitle={2003 International Conference on Parallel Processing, 2003. Proceedings.},
  pages={473--480},
  year={2003},
  organization={IEEE}
}

@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{Intanagonwiwat03a,
	author = 	"Chalermek Intanagonwiwat and Ramesh Govindan and Deborah Estrin and John Heidemann and Fabio Silva",
	title = 	"Directed Diffusion for Wireless Sensor Networking",
	journal = 	"ACM/IEEE Transactions on Networking",
	year = 		2003,
	sortdate = "2003-02-01",
	project = "ilense, scadds",
	jsubject = "sensornet_data_dissemination",
	volume =	"11",
	number =	"1",
	month =		feb,
	pages =		"2--16",
	xnote = "prior refs [Intanagonwiwat02b,Intanagonwiwat01b]",
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"diffusion, analytic results, journal paper,
                         revision of [Intanagonwiwat00a]",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Intanagonwiwat03a.html",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Intanagonwiwat03a.pdf",
	abstract = "
Advances in processor, memory and radio technology will enable small
and cheap nodes capable of sensing, communication and
computation. Networks of such nodes can coordinate to perform
distributed sensing of environmental phenomena. In this paper, we
explore the \emph{directed diffusion} paradigm for such
coordination. Directed diffusion is data-centric in that all
communication is for named data. All nodes in a directed
diffusion-based network are application-aware. This enables diffusion
to achieve energy savings by selecting empirically good paths and by
caching and processing data in-network (\emph{e.g.}, data aggregation). We
explore and evaluate the use of directed diffusion for a simple
remote-surveillance sensor network analytically and
experimentally. Our evaluation indicates that directed diffusion can
achieve significant energy savings and can outperform idealized
traditional schemes (\emph{e.g.}, omniscient multicast) under the
investigated scenarios.
",
}

Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the \emphdirected diffusion paradigm for such coordination. Directed diffusion is data-centric in that all communication is for named data. All nodes in a directed diffusion-based network are application-aware. This enables diffusion to achieve energy savings by selecting empirically good paths and by caching and processing data in-network (\emphe.g., data aggregation). We explore and evaluate the use of directed diffusion for a simple remote-surveillance sensor network analytically and experimentally. Our evaluation indicates that directed diffusion can achieve significant energy savings and can outperform idealized traditional schemes (\emphe.g., omniscient multicast) under the investigated scenarios.

@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{Lan03a,
	author = 	"Kun-Chan Lan and Alefiya Hussain and Debojyoti Dutta",
	title = 	"Effect of Malicious Traffic on the Network",
	booktitle = 	"Proceedings of the " # "PAM Workshop",
	year = 		2003,
	sortdate = 		"2003-08-01", 
	project = "ant, nocredit, saman",
	jsubject = "network_security",
	publisher =	"NLANR",
	month =		apr,
	location =	"johnh: folder: xxx",
	location =	"johnh: pafile",
	keywords =	"DDoS/Worm traffic on regular traffic",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Lan03a.html",
	pdfurl =		"http://www.isi.edu/%7ejohnh/PAPERS/Lan03a.pdf",
	otherurl =		"http://www.isi.edu/%7ehussain/pubs/Lan03a.pdf",
	abstract = "
The Internet has seen a continuous rise in malicious
traffic including DDoS and worm attacks. In this paper, we
study the effect of malicious traffic on the background traffic
by gathering traces from two different locations. We show that
the malicious traffic causes the increases of DNS latency by 230\%
and web latency by 30\% even on highly over-provisioned links.
Using a packet-level simulations based on an empirically derived
model of the worm, we demonstrate that the effect of worm-
infected hosts can be disastrous when they trigger a DDoS attack.
"
}

The Internet has seen a continuous rise in malicious traffic including DDoS and worm attacks. In this paper, we study the effect of malicious traffic on the background traffic by gathering traces from two different locations. We show that the malicious traffic causes the increases of DNS latency by 230% and web latency by 30% even on highly over-provisioned links. Using a packet-level simulations based on an empirically derived model of the worm, we demonstrate that the effect of worm- infected hosts can be disastrous when they trigger a DDoS attack.