@InProceedings{	  srinivasan2014cleanup,
  Author	= {Sudarshan Srinivasan and Gideon Juve and Ferreira da
		  Silva, Rafael and Karan Vahi and Ewa Deelman},
  Title		= {A Cleanup Algorithm for Implementing Storage Constraints
		  in Scientific Workflow Executions},
  BookTitle	= {9th Workshop on Workflows in Support of Large-Scale
		  Science (WORKS)},
  Year		= {2014},
  Note		= {Funding Acknowledgements: OCI SI2-SSI program grant
		  #1148515},
  URL		= {http://pegasus.isi.edu/publications/2014/2014-works.pdf},
  DOI		= {10.1109/WORKS.2014.8}
}

@inproceedings{slepicka2014:iswc-demo,
	author = {Jason Slepicka and Chengye Yin and Pedro Szekely and Craig A. Knoblock},
	title = {A Demonstration of Linked Data Source Discovery and Integration },
	booktitle = {Proceedings of the ISWC 2014 Posters \& Demonstrations Track},
	editors = {Matthew Horridge and Marco Rospocher and Jacco van Ossenbruggen},
	year = {2014},
	publisher = "CEUR, 1272",	
	urlPaper = {http://ceur-ws.org/Vol-1272/paper_129.pdf},
	urlLink = "http://ceur-ws.org/Vol-1272/"
	}

@inproceedings{barnhart2014further,
  title={A Further Look at Potential Impact of Satlets on Design, Production, and Cost of Satellite Systems},
  author={Barnhart, David and Hill, Lisa and Fowler, Erin and Hunter, Roger and Hoag, Lucy and Sullivan, Brook and Will, Peter},
  booktitle={Small Satellite Conference},
  month = aug,
  year={2014}
}

@conference{Shila2014A-Multi-pa,
	author = {Shila, Devu and Venugopalan, Vivek and Murray, Brian},
	booktitle = {CyberSecurity For Cyber-Physical Vehicle Systems},
	date-added = {2021-01-30 10:24:15 -0500},
	date-modified = {2021-01-30 10:24:15 -0500},
	institution = {Society of Automotive Engineers (SAE) International conference},
	keywords = {security},
	month = apr,
	note = {\textbf{[Best Presentation Award]}},
	organization = {Society of Automotive Engineers (SAE) International conference},
	title = {{A Multi-parameter Detection Scheme to Seek Stealthy Hardware Trojan Threats in FPGAs}},
	year = {2014}}

@inproceedings{Chaspari2014NonHomogeneous,
 author = {Chaspari, Theodora and Goodwin, Matthew and Wilder-Smith, Oliver and Gulsrud, Amanda and Mucchetti, Charlotte and Kasari, Connie and Narayanan, Shrikanth},
 bib2html_rescat = {care},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2014.6853870},
 link = {http://sail.usc.edu/publications/files/Chaspari_ICASSP14.pdf},
 location = {Florence, Italy},
 month = {May},
 title = {A Non-Homogeneous Poisson Process Model of Skin Conductance Responses Integrated with Observed Regulatory Behaviors for Autism Intervention},
 year = {2014}
}

@article{simpsom2014,
title = "A Novel Multi-Institutional Database for Tracking and Reporting Dose-Volume Data and Normal Tissue Effects ",
journal = "International Journal of Radiation Oncology *Biology *Physics ",
volume = "90",
number = "1",
pages = "S849 - S850",
year = "2014",
note = "Proceedings of the American Society for Radiation Oncology 56th Annual Meeting ASTRO's 56th Annual Meeting. doi: 10.1016/j.ijrobp.2014.05.2435",
issn = "0360-3016",
doi = "http://dx.doi.org/10.1016/j.ijrobp.2014.05.2435",
url = "http://www.sciencedirect.com/science/article/pii/S0360301614030867",
author = "D.R. Simpson and J.L. Ambite and R. Kosztyla and G. Kumaraguruparan and M. Liu and K.L. Moore and J.D. Murphy and J. Wu and V. Moiseenko"
}

@inproceedings{sathe14sigspatial,
  author = {Mihir Sathe and Craig A. Knoblock and Yao-Yi Chiang and Aaron Harris},
  booktitle = {Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems},
  title = {A Parallel Query Engine for Interactive Spatiotemporal Analysis},
  urlpaper = {http://usc-isi-i2.github.io/papers/sathe14-sigspatial.pdf},
  urlslides = {http://usc-isi-i2.github.io/slides/sathe14-sigspatial-poster.pdf},
  year = {2014}
}

@InProceedings{	  pietri2014estimate,
  Author	= {Ilia Pietri and Gideon Juve and Ewa Deelman and Rizos
		  Sakellariou},
  URL		= {http://pegasus.isi.edu/publications/2014/pietri-works14.pdf},
  Title		= {A Performance Model to Estimate Execution Time of
		  Scientific Workflows on the Cloud},
  BookTitle	= {9th Workshop on Workflows in Support of Large-Scale
		  Science (WORKS)},
  Year		= {2014},
  Note		= {Funding Acknowledgments: DOE contract for dv/dt ER26110},
  DOI		= {10.1109/WORKS.2014.12}
}

@inproceedings{Benitez2014AReal-TimeMRIStudy,
 author = {Benitez, Andres and Ramanarayanan, Vikram and Goldstein, Louis and Narayanan, Shrikanth},
 bib2html_rescat = {span},
 booktitle = {Proceedings of Interspeech},
 doi = {10.1371/journal.pone.0104168},
 link = {http://sail.usc.edu/publications/files/benitez_ramanarayanan_as_l2_is2014.pdf},
 month = {Sep},
 title = {A Real-Time MRI Study of Articulatory Setting in Second Language Speech},
 year = {2014}
}

@inproceedings{taheriyan14:icsc,
  author = {Mohsen Taheriyan and Craig A. Knoblock and Pedro Szekely and Jose Luis Ambite},
  title = {{A Scalable Approach to Learn Semantic Models of Structured Sources}},
  booktitle = {Proceedings of the 8th IEEE International Conference on Semantic Computing (ICSC 2014)},
  year = {2014},
  urlpaper = {http://usc-isi-i2.github.io/papers/taheriyan14-icsc.pdf},
  urlslides = {http://www.slideshare.net/mohsentaheriyan/a-scalable-approach-to-learn-semantic-models-of-structured-sources},
}

@InProceedings{	  santanaperez2014semantic,
  Author	= {Idafen Santana-Perez and Ferreira da Silva, Rafael and
		  Mats Rynge and Ewa Deelman and Maria S. Perez-Hernandez and
		  Oscar Corcho},
  URL		= {http://pegasus.isi.edu/publications/2014/2014-reppar.pdf},
  Title		= {A Semantic-Based Approach to Attain Reproducibility of
		  Computational Environments in Scientific Workflows: A Case
		  Study},
  BookTitle	= {1st International Workshop on Reproducibility in Parallel
		  Computing (REPPAR), in conjunction with Euro-Par 2014},
  Year		= {2014},
  Note		= {Funding Acknowledgments: NSF FutureGrid 0910812}
}

@inproceedings{Papadopoulos2014SupervisedSNR,
 author = {Papadopoulos, Pavlos and Tsiartas, Andreas and Gibson, James and Narayanan, Shrikanth},
 bib2html_rescat = {},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {https://doi.org/10.1109/icassp.2014.6855207},
 link = {http://sail.usc.edu/publications/files/p8287-papadopoulos.pdf},
 location = {Florence, Italy},
 month = {May},
 title = {A Supervised Signal-To-Noise Ratio Estimation Of Speech Signals},
 year = {2014}
}

@article{chiang14:acmsurveys,
  Author = "Yao-Yi Chiang and Stefan Leyk and Craig A. Knoblock",
  title = "A Survey of Digital Map Processing Techniques",
  Journal = "ACM Computing Surveys",
  volume =  "47",
  number =  "1",
  Year =    "2014",
  Pages =   "1--44",
  urlLink= "http://dl.acm.org/citation.cfm?id=2557423",
  urlPaper= "http://usc-isi-i2.github.io/papers/chiang14-acm.pdf",
  Keywords = {"Map Extraction","Geospatial Integration"},
  }
  

@inproceedings{chiang14sigspatial-karma,
  author = {Yao-Yi Chiang and Bo Wu and Akshay Anand and Ketan Akade and Craig A. Knoblock},
  booktitle = {Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems},
  title = {A System for Efficient Cleaning and Transformation of Geospatial Data Attributes},
  urlpaper = {http://usc-isi-i2.github.io/papers/chiang14-sigspatial-arckarma.pdf},
  year = {2014}
}

@InProceedings{	  silva2014modsim,
  Author	= {Ferreira da Silva, Rafael and Thomas Fahringer and Juan J.
		  Durillo and Ewa Deelman},
  URL		= {http://pegasus.isi.edu/publications/2014/2014-modsim.pdf},
  Title		= {A Unified Approach for Modeling and Optimization of
		  Energy, Makespan and Reliability for Scientific Workflows
		  on Large-Scale Computing Infrastructures},
  BookTitle	= {Workshop on Modeling and Simulation of Systems and
		  Applications (MODSIM)},
  Year		= {2014},
  Note		= {Funding Acknowledgments: DOE contract for dv/dt
		  ER26110).}
}

@InProceedings{grycner:akbc14,
    author = "Grycner, Adam and Weikum, Gerhard and Pujara, Jay and Foulds, James and Getoor, Lise",
    bib_url = "/pubs/bib/grycner-akbc14.bib",
    booktitle = "Fourth Workshop on Automated Knowledge Base Construction",
    organization = "NIPS",
    pdf_url = "/pubs/2014/grycner-akbc14/grycner-akbc14.pdf",
    sec = "ws",
    title = "A Unified Probabilistic Approach for Semantic Clustering of Relational Phrases",
    year = "2014"
}

@article{kocoloski2014virtual,
  title={A VIRTUAL CLUSTER TEST ENVIRONMENT FOR OPERATING SYSTEM AND RUNTIME DEVELOPMENT},
  author={KOCOLOSKI, BRIAN J and PEDRETTI, KEVIN T and GRANT, RYAN E and DEBONIS, DAVID},
  journal={CSRI SUMMER PROCEEDINGS 2013},
  pages={176},
  year={2014}
}

@INPROCEEDINGS{Zhu14socialcom,
  AUTHOR =       {Linhong Zhu and Kristina Lerman},
  TITLE =        {A Visibility-based Model for Link Prediction in Social Media},
  BOOKTITLE =    {Proceedings of the ASE/IEEE Conference on Social Computing},
  YEAR =         {2014},
  abstract =     {A core task of social network analysis is to predict the formation of new social links. In the context of social media,
link prediction serves as the foundation for forecasting the evolution of the follower graph and predicting interactions
and the flow of information between users. Previous link prediction methods have generally represented the social
network as a graph and leveraged topological and semantic measures of similarity between two nodes to evaluate the
probability of link formation. In this work, we suggest another link creation mechanism for social media wherein a
user v creates a link to user u after seeing u�s name on his or her screen. In other words, visibility of a user (name) is
a necessary condition for new link formation. We propose a visibility-based model for link prediction, which estimates
the probability of a user views another user�s name, and use this model to predict new links. We further estimate
a set of parameters in the proposed visibility-based model by a Maximum-Likelihood approach with a MM algorithm.
Empirical study shows that the proposed model can more accurately predict both follow and co-mention links than alternative
state-of-the-art methods. Our work suggests that the effort required to discover a new social contact is negatively
correlated with link formation, and the easier it is to discover a user, the higher the likelihood a link to the user
will be created.},
   url = {http://www.isi.edu/integration/people/lerman/papers/SocialCom14.pdf},
  keywords =     {social-dynamics},
}

A core task of social network analysis is to predict the formation of new social links. In the context of social media, link prediction serves as the foundation for forecasting the evolution of the follower graph and predicting interactions and the flow of information between users. Previous link prediction methods have generally represented the social network as a graph and leveraged topological and semantic measures of similarity between two nodes to evaluate the probability of link formation. In this work, we suggest another link creation mechanism for social media wherein a user v creates a link to user u after seeing u�s name on his or her screen. In other words, visibility of a user (name) is a necessary condition for new link formation. We propose a visibility-based model for link prediction, which estimates the probability of a user views another user�s name, and use this model to predict new links. We further estimate a set of parameters in the proposed visibility-based model by a Maximum-Likelihood approach with a MM algorithm. Empirical study shows that the proposed model can more accurately predict both follow and co-mention links than alternative state-of-the-art methods. Our work suggests that the effort required to discover a new social contact is negatively correlated with link formation, and the easier it is to discover a user, the higher the likelihood a link to the user will be created.

@inproceedings{abadi2014collaborative,
  title={A collaborative approach to heading estimation for smartphone-based PDR indoor localisation},
  author={Abadi, Marzieh Jalal and Luceri, Luca and Hassan, Mahbub and Chou, Chun Tung and Nicoli, Monica},
  booktitle={2014 International conference on indoor positioning and indoor navigation (IPIN)},
  pages={554--563},
  year={2014},
  organization={IEEE}
}

@inproceedings{zhang2014distributed,
  title={A distributed optimization algorithm for attack-resilient wide-area monitoring of power systems: Theoretical and experimental methods},
  author={Zhang, Jianhua and Jaipuria, Prateek and Chakrabortty, Aranya and Hussain, Alefiya},
  booktitle={International Conference on Decision and Game Theory for Security},
  pages={350--359},
  year={2014},
  organization={Springer, Cham}
}

@InProceedings{Hutchings2014,
  author       = {Hutchings, Brad L and Monson, Joshua and Savory, Danny and Keeley, Jared},
  title        = {A power side-channel-based digital to analog converterfor Xilinx FPGAs},
  booktitle    = {Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arrays},
  year         = {2014},
  pages        = {113--116},
  organization = {ACM},
  month = feb,
  url = {https://doi.org/10.1145/2554688.2554770},
  doi = {10.1145/2554688.2554770},
}

@inproceedings{Kim2014Astudyofinvariant,
 author = {Kim, Jangwon and Erickson, Donna and Lee, Sungbok and Narayanan, Shrikanth},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of Interspeech},
 link = {http://sail.usc.edu/publications/files/manuscript.pdf},
 month = {Sep},
 title = {A study of invariant properties and variation patterns in the converter/distributor model for emotional speech},
 year = {2014}
}

@inproceedings{DBLP:conf/semweb/KejriwalM14a,
  author    = {Mayank Kejriwal and
               Daniel P. Miranker},
  editor    = {Pavel Shvaiko and
               J{\'{e}}r{\^{o}}me Euzenat and
               Ming Mao and
               Ernesto Jim{\'{e}}nez{-}Ruiz and
               Juanzi Li and
               Axel Ngonga},
  title     = {A two-step blocking scheme learner for scalable link discovery},
  booktitle = {Proceedings of the 9th International Workshop on Ontology Matching
               collocated with the 13th International Semantic Web Conference {(ISWC}
               2014), Riva del Garda, Trentino, Italy, October 20, 2014},
  series    = {{CEUR} Workshop Proceedings},
  volume    = {1317},
  pages     = {49--60},
  publisher = {CEUR-WS.org},
  year      = {2014},
  url       = {http://ceur-ws.org/Vol-1317/om2014\_Tpaper5.pdf},
  timestamp = {Wed, 12 Feb 2020 16:44:51 +0100},
  biburl    = {https://dblp.org/rec/conf/semweb/KejriwalM14a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{ ISI:000343655300141,
Author = {Yang, Zhaojun and Metallinou, Angeliki and Erzin, Engin and Narayanan,
   Shrikanth},
Book-Group-Author = {{IEEE}},
Title = {{ANALYSIS OF INTERACTION ATTITUDES USING DATA-DRIVEN HAND GESTURE PHRASES}},
Booktitle = {{2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL
   PROCESSING (ICASSP)}},
Series = {{International Conference on Acoustics Speech and Signal Processing
   ICASSP}},
Year = {{2014}},
Note = {{IEEE International Conference on Acoustics, Speech and Signal Processing
   (ICASSP), Florence, ITALY, MAY 04-09, 2014}},
Organization = {{IEEE}},
Abstract = {{Hand gesture is one of the most expressive, natural and common types of
   body language for conveying attitudes and emotions in human
   interactions. In this paper, we study the role of hand gesture in
   expressing attitudes of friendliness or conflict towards the
   interlocutors during interactions. We first employ an unsupervised
   clustering method using a parallel HMM structure to extract recurring
   patterns of hand gesture (hand gesture phrases or primitives). We
   further investigate the validity of the derived hand gesture phrases by
   examining the correlation of dyad's hand gesture for different
   interaction types defined by the attitudes of interlocutors. Finally, we
   model the interaction attitudes with SVM using the dynamics of the
   derived hand gesture phrases over an interaction. The classification
   results are promising, suggesting the expressiveness of the derived hand
   gesture phrases for conveying attitudes and emotions.}},
ISSN = {{1520-6149}},
ISBN = {{978-1-4799-2893-4}},
ResearcherID-Numbers = {{Erzin, Engin/H-1716-2011}},
ORCID-Numbers = {{Erzin, Engin/0000-0002-2715-2368}},
Unique-ID = {{ISI:000343655300141}},
}

Hand gesture is one of the most expressive, natural and common types of body language for conveying attitudes and emotions in human interactions. In this paper, we study the role of hand gesture in expressing attitudes of friendliness or conflict towards the interlocutors during interactions. We first employ an unsupervised clustering method using a parallel HMM structure to extract recurring patterns of hand gesture (hand gesture phrases or primitives). We further investigate the validity of the derived hand gesture phrases by examining the correlation of dyad's hand gesture for different interaction types defined by the attitudes of interlocutors. Finally, we model the interaction attitudes with SVM using the dynamics of the derived hand gesture phrases over an interaction. The classification results are promising, suggesting the expressiveness of the derived hand gesture phrases for conveying attitudes and emotions.

@inproceedings{DBLP:conf/icassp/ChoudharyKNM14,
  author       = {Sunav Choudhary and
                  Naveen Kumar and
                  Srikanth Narayanan and
                  Urbashi Mitra},
  title        = {Active target detection with mobile agents},
  booktitle    = {{IEEE} International Conference on Acoustics, Speech and Signal Processing,
                  {ICASSP} 2014, Florence, Italy, May 4-9, 2014},
  pages        = {4185--4189},
  year         = {2014},
  crossref     = {DBLP:conf/icassp/2014},
  url          = {https://doi.org/10.1109/ICASSP.2014.6854390},
  doi          = {10.1109/ICASSP.2014.6854390},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icassp/ChoudharyKNM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Chervenak2014a,
	acmid = {2688395},
	address = {{Piscataway, NJ, USA}},
	author = {Chervenak, Ann L. and Sim, Alex and Gu, Junmin and Schuler, Robert E. and Hirpathak, Nandan},
	booktitle = {Proceedings of the {{Fourth International Workshop}} on {{Network-Aware Data Management}}},
	date-added = {2018-09-12 15:11:16 -0700},
	date-modified = {2020-01-21 15:51:59 -0800},
	isbn = {978-1-4799-7019-3},
	keywords = {bulk data transfer,performance-based adaptation,policy-based resource allocation,resource constrained,throughput},
	pages = {1--8},
	publisher = {{IEEE Press}},
	series = {{{NDM}} '14},
	title = {Adaptation and {{Policy-based Resource Allocation}} for {{Efficient Bulk Data Transfers}} in {{High Performance Computing Environments}}},
	year = {2014}}

@inproceedings{Malandrakis2014AffectiveLangadapt,
 author = {Malandrakis, Nikolaos and Potamianos, Alexandros and J Hsu, Kean and N Babeva, Kalina and C Feng, Michelle and C Davison, Gerald and Narayanan, Shrikanth},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2014.6854521},
 link = {http://sail.usc.edu/publications/files/p4871-malandrakis.pdf},
 location = {Florence, Italy},
 month = {May},
 title = {Affective language model adaptation via corpus selection},
 year = {2014}
}

@article{hussein_alexu-word_2014,
	title = {{AlexU}-Word: A New Dataset for Isolated-Word Closed-Vocabulary Offline Arabic Handwriting Recognition},
	rights = {All rights reserved},
	url = {http://arxiv.org/abs/1411.4670},
	shorttitle = {{AlexU}-Word},
	abstract = {In this paper, we introduce the first phase of a new dataset for offline Arabic handwriting recognition. The aim is to collect a very large dataset of isolated Arabic words that covers all letters of the alphabet in all possible shapes using a small number of simple words. The end goal is to collect a very large dataset of segmented letter images, which can be used to build and evaluate Arabic handwriting recognition systems that are based on segmented letter recognition. The current version of the dataset contains \$25114\$ samples of \$109\$ unique Arabic words that cover all possible shapes of all alphabet letters. The samples were collected from \$907\$ writers. In its current form, the dataset can be used for the problem of closed-vocabulary word recognition. We evaluated a number of window-based descriptors and classifiers on this task and obtained an accuracy of \$92.16{\textbackslash}\%\$ using a {SIFT}-based descriptor and {ANN}.},
	journaltitle = {{arXiv}:1411.4670 [cs]},
	author = {Hussein, Mohamed E. and Torki, Marwan and Elsallamy, Ahmed and Fayyaz, Mahmoud},
	urldate = {2019-05-01},
	date = {2014-11-17},
	year = {2014},
	eprinttype = {arxiv},
	eprint = {1411.4670},
	keywords = {Computer Science - Computer Vision and Pattern Recognition, I.5.2, I.7.5},
	file = {arXiv\:1411.4670 PDF:C\:\\Users\\Mohamed Hussein\\Zotero\\storage\\2R2AFY2X\\Hussein et al. - 2014 - AlexU-Word A New Dataset for Isolated-Word Closed.pdf:application/pdf;arXiv.org Snapshot:C\:\\Users\\Mohamed Hussein\\Zotero\\storage\\3TRZNMC2\\1411.html:text/html}
}

In this paper, we introduce the first phase of a new dataset for offline Arabic handwriting recognition. The aim is to collect a very large dataset of isolated Arabic words that covers all letters of the alphabet in all possible shapes using a small number of simple words. The end goal is to collect a very large dataset of segmented letter images, which can be used to build and evaluate Arabic handwriting recognition systems that are based on segmented letter recognition. The current version of the dataset contains $25114$ samples of $109$ unique Arabic words that cover all possible shapes of all alphabet letters. The samples were collected from $907$ writers. In its current form, the dataset can be used for the problem of closed-vocabulary word recognition. We evaluated a number of window-based descriptors and classifiers on this task and obtained an accuracy of $92.16{\}%$ using a SIFT-based descriptor and ANN.

@InCollection{parundekar2014ldm,
	Author = "Rahul Parundekar and Craig A. Knoblock and Jose Luis Ambite",
	Title = "Aligning ontologies of linked data",
	Editors = " Andreas Harth, Katja Hose, and Ralf Schenkel",
	Booktitle = "Linked Data Management: Principles and Techniques",
	Publisher = "CRC Press", 
	Year = "2014",
	urlPaper= "http://usc-isi-i2.github.io/papers/parundekar14-ldmgmt.pdf"
	}

@article{gil-etal-science14,
 title = {Amplify Scientific Discovery with Artificial Intelligence},
 author = {Yolanda Gil and Mark Greaves and James Hendler and Haym Hirsh},
  journal = {Science},
  volume = 346,
  number = 6206,
  pages = {171-172},
  year      = {2014},
  doi = {10.1126/science.1259439},
  ee = {http://dx.doi.org/10.1126/science.1259439}
}

@InProceedings{may-benjira-echihabi:2014:AMTA,
  author    = {May, Jonathan  and  Benjira, Yassine and Echihabi, Abdessamad},
  title     = {An Arabizi-English Social Media Statistical Machine Translation System},
  booktitle = {Proceedings of the Eleventh Biennial Conference of the
Association for Machine Translation in the Americas},
  month     = {October},
  year      = {2014},
  address   = {Vancouver, Canada},
  publisher = {Association for Machine Translation in the Americas},
}

% missing: "Identifying Useful Human Correction Feedback from an On-line Machine Translation Service", (A. Barrón-Cedeño, L. Màrquez, L., C. Henríquez Q., L. Formiga, E. Romero, & J. May), Proc. IJCAI, 2013.

@inproceedings{Schuler2014b,
	abstract = {Increasingly, advances in biomedical research are the result of combining and analyzing heterogeneous data types from different sources, spanning genomic, proteomic, imaging, and clinical data. Yet despite the proliferation of data-driven methods, tools to support the integration and management of large collections of data for purposes of data driven discovery are scarce, leaving scientists with ad hoc and inefficient processes. The scientific process could benefit significantly from lightweight methods for data integration that allow for exploratory, incrementally refined integration of heterogeneous data. In this paper, we address this problem by introducing a new asset management based approach designed to support continuous integration of biomedical data. We describe the system and our experiences using it in the context of several scientific applications.},
	address = {{Cham}},
	author = {Schuler, Robert E. and Kesselman, Carl and Czajkowski, Karl},
	booktitle = {Data {{Integration}} in the {{Life Sciences}}},
	doi = {10.1007/978-3-319-08590-6_1},
	editor = {Galhardas, Helena and Rahm, Erhard},
	file = {/Users/schuler/Zotero/storage/H8YABUWI/Schuler et al. - 2014 - An Asset Management Approach to Continuous Integra.pdf},
	isbn = {978-3-319-08590-6},
	pages = {1--15},
	publisher = {{Springer International Publishing}},
	title = {An {{Asset Management Approach}} to {{Continuous Integration}} of {{Heterogeneous Biomedical Data}}},
	year = {2014},
	bdsk-url-1 = {https://doi.org/10.1007/978-3-319-08590-6_1}}

Increasingly, advances in biomedical research are the result of combining and analyzing heterogeneous data types from different sources, spanning genomic, proteomic, imaging, and clinical data. Yet despite the proliferation of data-driven methods, tools to support the integration and management of large collections of data for purposes of data driven discovery are scarce, leaving scientists with ad hoc and inefficient processes. The scientific process could benefit significantly from lightweight methods for data integration that allow for exploratory, incrementally refined integration of heterogeneous data. In this paper, we address this problem by introducing a new asset management based approach designed to support continuous integration of biomedical data. We describe the system and our experiences using it in the context of several scientific applications.

@inproceedings{Bone2014AnInvestigationofVocal,
 author = {Bone, Daniel and Lee, Chi-Chun and Potamianos, Alexandros and Narayanan, Shrikanth},
 bib2html_rescat = {care},
 booktitle = {Proceedings of Interspeech},
 link = {http://sail.usc.edu/publications/files/VocalArousalInteraction_Interspeech2014_v3_submission.pdf},
 month = {Sep},
 title = {An Investigation of Vocal Arousal Dynamics in Child-Psychologist  Interactions using Synchrony Measures and a Conversation-based Model},
 year = {2014}
}

@article{Yang2014AnalysisandPredictiveModeling,
 author = {Yang, Zhaojun and Metallinou, Angeliki and Narayanan, Shrikanth S.},
 bib2html_rescat = {bsp},
 doi = {10.1109/TMM.2014.2328311},
 journal = {IEEE Transactions on Multimedia},
 link = {http://sail.usc.edu/publications/files/ZhaojunYang-TMM-2014.pdf},
 month = {Oct},
 number = {6},
 pages = {1766-1778},
 title = {Analysis and Predictive Modeling of Body Language Behavior in Dyadic Interactions from Multimodal Interlocutor Cues},
 volume = {16},
 year = {2014}
}

@inproceedings{Yang2014AnalysisofEmotionalEffect,
 author = {Yang, Zhaojun and Narayanan, Shrikanth},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of Interspeech},
 link = {http://sail.usc.edu/publications/files/emotioneffect_gesturespeechinterplay.pdf},
 month = {Sep},
 title = {Analysis of Emotional Effect on  Speech-Body Gesture Interplay},
 year = {2014}
}

@article{das-etal-aimatters14,
  title = {Announcing the SIGAI Career Network and Conference},
  author = {Sanmay Das and Susan L. Epstein and Yolanda Gil},
  journal = {AI Matters},
  volume = {1},
  number = {1},
  year = {2014},
  url = {http://sigai.acm.org/static/aimatters/aimatters-issue-2014-01.pdf},
  ee = {http://dx.doi.org/10.1145/2639475.2649581}
}

@misc{sankaran2014apparatus,
  title={Apparatus and method for sharing a generic configuration across a group of network devices},
  author={Sankaran, Ganesh Chennimalai},
  year={2014},
  month=aug # "~5",
  note={US Patent 8,554,883}
}

@article{Ramanarayanan2014Arearticulatorysettingsmechanically,
 author = {Ramanarayanan, Vikram and Lammert, Adam and Goldstein, Louis and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 doi = {10.1371/journal.pone.0104168},
 journal = {PLoS One},
 link = {http://sail.usc.edu/publications/files/journal.pone.0104168.PDF},
 month = {Aug},
 number = {8},
 pages = {e104168},
 title = {Are articulatory settings mechanically advantageous for speech motor control?},
 volume = {9},
 year = {2014}
}

@article{DBLP:journals/aimatters/Gil14,
  author       = {Yolanda Gil},
  title        = {Artificial intelligence: no longer just for you and me},
  journal      = {{AI} Matters},
  volume       = {1},
  number       = {1},
  pages        = {4--5},
  year         = {2014},
  url          = {https://doi.org/10.1145/2639475.2639477},
  doi          = {10.1145/2639475.2639477},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/aimatters/Gil14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{khider_assessing_2014,
	title = {Assessing millennial-scale variability during the {Holocene}: {A} perspective from the western tropical {Pacific}},
	volume = {29},
	url = {https://github.com/khider/khider.github.io/blob/master/papers/Khider%20et%20al._2014_Paleoceanography.pdf},
	doi = {10.1002/2013PA002534},
	number = {3},
	journal = {Paleoceanography},
	author = {Khider, Deborah and Jackson, Charles S and Stott, Lowell},
	year = {2014},
	pages = {143--159},
}

@article{Kim2014Automaticintelligibilityclassificationof,
 author = {Kim, Jangwon and Kumar, Naveen and Tsiartas, Andreas and Li, Ming},
 bib2html_rescat = {span},
 doi = {dx.doi.org/10.1016/j.csl.2014.02.001},
 journal = {Computer, Speech, and Language},
 link = {http://sail.usc.edu/publications/files/kim-csl-2014-inpress.pdf},
 title = {Automatic intelligibility classification of sentence-level pathological speech},
 year = {2014}
}

@inproceedings{Can2014Barista,
 author = {Can, Dogan and Gibson, James and Vaz, Colin and Georgiou, Panayiotis and Narayanan, Shrikanth},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2014.6854212},
 link = {http://sail.usc.edu/publications/files/p3330-can.pdf},
 location = {Florence, Italy},
 month = {May},
 pages = {3306-3310},
 title = {Barista: A Framework for Concurrent Speech Processing by USC-SAIL},
 year = {2014}
}

@conference {MuslehCloud2014,
	title = {Bridging the Virtualization Performance Gap for HPC Using {SR-IOV} for {InfiniBand}},
	booktitle = {International Conference on Cloud Computing},
	year = {2014},
	publisher = {IEEE},
	organization = {IEEE},
	url = {http://www.isi.edu/sites/default/files/users/jwalters/papers/Cloud_2014_IB.pdf},
	author = {Musleh, M. and Pai, Vijay S. and Walters, John Paul and Younge, Andrew and Crago, Stephen P.}
}

@Misc{Heidemann14a,
	author = 	"John Heidemann",
	title = 	"Broadening Network Performance: The Edge and Outages",
	howpublished = "Presentation at the Second perfSONAR NSF Workshop",
	month = 	feb,
	year = 	2014,
	sortdate = 	"2014-02-01",
	project = "ant",
	jsubject = "routing",
	jlocation = 	"johnh: pafile",
	keywords = 	"based on [Quan13c]",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann14a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann14a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
Network performance has often been studied through active measurements of
delay and throughput between specific sites.  While important to
understanding performance of the core network and among well-connected
sites, recent work has begun to explore broadening the subject in two
ways.  First, to consider network performance to millions of computers
at the network's edge, not just in a relatively well-connected mesh.
Second, to explore network reliability and outages, in addition to delay
and throughput.  We will report on our recent progress and ongoing work
in these areas.
",
}

Network performance has often been studied through active measurements of delay and throughput between specific sites. While important to understanding performance of the core network and among well-connected sites, recent work has begun to explore broadening the subject in two ways. First, to consider network performance to millions of computers at the network's edge, not just in a relatively well-connected mesh. Second, to explore network reliability and outages, in addition to delay and throughput. We will report on our recent progress and ongoing work in these areas.

@InProceedings{pujara:akbc14,
    author = "Pujara, Jay and Getoor, Lise",
    bib_url = "/pubs/bib/pujara-akbc14.bib",
    booktitle = "Fourth Workshop on Automated Knowledge Base Construction",
    organization = "NIPS",
    pdf_url = "/pubs/2014/pujara-akbc14/pujara-akbc14.pdf",
    sec = "ws",
    title = "Building Dynamic Knowledge Graphs",
    year = "2014"
}

@inproceedings{shi2014cardinal,
  title={Cardinal pill testing of system virtual machines},
  author={Shi, Hao and Alwabel, Abdulla and Mirkovic, Jelena},
  booktitle={23rd USENIX Security Symposium (USENIX Security 14)},
  pages={271--285},
  year={2014}
}

@inproceedings{DBLP:conf/ipaw/GarijoGH14,
  author       = {Daniel Garijo and
                  Yolanda Gil and
                  Andreas Harth},
  editor       = {Bertram Lud{\"{a}}scher and
                  Beth Plale},
  title        = {Challenges for Provenance Analytics Over Geospatial Data},
  booktitle    = {Provenance and Annotation of Data and Processes - 5th International
                  Provenance and Annotation Workshop, {IPAW} 2014, Cologne, Germany,
                  June 9-13, 2014. Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8628},
  pages        = {261--263},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-16462-5\_28},
  doi          = {10.1007/978-3-319-16462-5\_28},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ipaw/GarijoGH14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{garijo-etal-ipaw14,
  author = {Daniel Garijo and Yolanda Gil and Andreas Harth},
  title = {Challenges in Modeling Geospatial Provenance},
  booktitle = {Proceedings of the Fifth International Provenance and Annotation Workshop (IPAW)},
  address = {Cologne, Germany},
  year = {2014},
  url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/garijo-etal-ipaw14.pdf }
}

@article{mirkovic2014class,
  title={Class Capture-the-Flag Exercises},
  author={Mirkovic, Jelena and Peterson, Peter AH},
  journal={2014 USENIX Summit on Gaming, Games, and Gamification in Security Education (3GSE 14)},
  year={2014},
  publisher={USENIX Association}
}

@article{blackhole,
	Abstract = {The fate of classical information incident on a quantum black hole has been the subject of an ongoing controversy in theoretical physics, because a calculation within the framework of semi-classical curved-space quantum field theory appears to show that the incident information is irretrievably lost, in contradiction to time-honored principles such as time-reversibility and unitarity. Here, we show within this framework embedded in quantum communication theory that signaling from past to future null infinity in the presence of a Schwarzschild black hole can occur with arbitrary accuracy, and thus that classical information is not lost in black hole dynamics. The calculation relies on a treatment that is manifestly unitary from the outset, where probability conservation is guaranteed because black holes stimulate the emission of radiation in response to infalling matter. This stimulated radiation is non-thermal and contains all of the information about the infalling matter, while Hawking radiation contains none of it.},
	Author = {Christoph Adami and Greg {Ver Steeg}},
	Journal = {Classical and Quantum Gravity},
	Number = {7},
	Pages = {075015},
	Title = {Classical information transmission capacity of quantum black holes},
	Url = {http://stacks.iop.org/0264-9381/31/i=7/a=075015},
	Volume = {31},
	Year = {2014},
	Bdsk-Url-1 = {http://stacks.iop.org/0264-9381/31/i=7/a=075015}}

The fate of classical information incident on a quantum black hole has been the subject of an ongoing controversy in theoretical physics, because a calculation within the framework of semi-classical curved-space quantum field theory appears to show that the incident information is irretrievably lost, in contradiction to time-honored principles such as time-reversibility and unitarity. Here, we show within this framework embedded in quantum communication theory that signaling from past to future null infinity in the presence of a Schwarzschild black hole can occur with arbitrary accuracy, and thus that classical information is not lost in black hole dynamics. The calculation relies on a treatment that is manifestly unitary from the outset, where probability conservation is guaranteed because black holes stimulate the emission of radiation in response to infalling matter. This stimulated radiation is non-thermal and contains all of the information about the infalling matter, while Hawking radiation contains none of it.

@inproceedings{Van2014ClassificationofCognitiveLoad,
 author = {Van Segbroeck, Maarten and Travadi, Ruchir and Vaz, Colin and Kim, Jangwon and Black, Matthew P. and Potamianos, Alexandros and Narayanan, Shrikanth},
 booktitle = {Proceedings of Interspeech},
 link = {http://sail.usc.edu/publications/files/IS2014_Challenge.pdf},
 location = {Singapore [INTERSPEECH 2014  Computational Paralinguistics Challenge AWARD]},
 month = {Sep},
 title = {Classification of  Cognitive Load from Speech using an i-vector Framework},
 year = {2014}
}

@inproceedings{Tsiartas2014S2Scleannoisybilingual,
 author = {Tsiartas, Andreas and Kumar Ghosh, Prasanta and Georgiou, Panayiotis and Narayanan, Shrikanth},
 bib2html_rescat = {speechlinks},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2014.6853570},
 link = {http://sail.usc.edu/publications/files/p121-tsiartas.pdf},
 location = {Florence, Italy},
 month = {May},
 title = {Classification of clean and noisy bilingual movie audio for speech-to-speech translation corpora design},
 year = {2014}
}

@article{Kim2014Co-registrationofspeechproduction,
 author = {Kim, Jangwon and Lammert, Adam and Ghosh, Prasanta Kumar and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 doi = {10.1121/1.4862880},
 journal = {J. Acoust. Soc. Am.},
 link = {http://sail.usc.edu/publications/files/JASMAN-000135-0EL115_1.pdf},
 month = {Feb},
 number = {2},
 pages = {EL115-EL121},
 title = {Co-registration of speech production datasets from electromagnetic articulography and real-time magnetic resonance imaging},
 volume = {135},
 year = {2014}
}

@article{PhysRevA.90.022119,
  title = {Coherent control of non-Markovian photon-resonator dynamics},
  author = {Levi, A. F. J. and Venuti, L. Campos and Albash, T. and Haas, S.},
  journal = {Phys. Rev. A},
  volume = {90},
  issue = {2},
  pages = {022119},
  numpages = {9},
  year = {2014},
  month = {Aug},
  publisher = {American Physical Society},
  doi = {10.1103/PhysRevA.90.022119},
  url = {https://link.aps.org/doi/10.1103/PhysRevA.90.022119}}

@inproceedings {gil-etal-wssspe14, 
  title = {Collaborative Software Development Needs in Geosciences},
  author = {Yolanda Gil and Eunyoung Moon and James Howison},
  year      = {2014},
 address = {New Orleans, LA},
  booktitle = {Proceedings of the Second Workshop on Sustainable Software for Science: Practice and Experiences (WSSSPE2), held in conjunction with the IEEE ACM International Conference on High Performance Computing (SC)},
 url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/gil-etal-wssspe14.pdf }
}

@article{DBLP:journals/fgcs/GarijoABCGG14,
  author       = {Daniel Garijo and
                  Pinar Alper and
                  Khalid Belhajjame and
                  {\'{O}}scar Corcho and
                  Yolanda Gil and
                  Carole A. Goble},
  title        = {Common motifs in scientific workflows: An empirical analysis},
  journal      = {Future Gener. Comput. Syst.},
  volume       = {36},
  pages        = {338--351},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.future.2013.09.018},
  doi          = {10.1016/J.FUTURE.2013.09.018},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/fgcs/GarijoABCGG14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@InProceedings{	  silva2014community,
  Author	= {Ferreira da Silva, Rafael and Weiwei Chen and Gideon Juve
		  and Karan Vahi and Ewa Deelman},
  URL		= {http://pegasus.isi.edu/publications/2014/2014-escience.pdf},
  Title		= {Community Resources for Enabling Research in Distributed
		  Scientific Workflows},
  BookTitle	= {10th IEEE International Conference on e-Science (eScience
		  2014)},
  Year		= {2014},
  Note		= {Funding Acknowledgements: OCI SI2-SSI program grant
		  #1148515, DOE contract for dv/dt ER26110},
  DOI		= {10.1109/eScience.2014.44}
}

@inproceedings{Gibson2014ComparingTime-FrequencyRepresentationsfor,
 author = {Gibson, James and Van Segbroeck, Maarten and Narayanan, Shrikanth},
 booktitle = {Proceedings of Interspeech},
 link = {http://sail.usc.edu/publications/files/gibson2014comparing.pdf},
 month = {Sep},
 title = {Comparing  Time-Frequency Representations for Directional Derivative Features},
 year = {2014}
}

@article{Lee2014ComputingVocalEntrainment:A,
 author = {Lee, Chi-Chun and Katsamanis, Athanasios and Black, Matthew P. and Baucom, Brian and Christensen, Andrew and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {bsp},
 doi = {10.1016/j.csl.2012.06.006},
 journal = {Computer, Speech, and Language},
 link = {http://sail.usc.edu/publications/files/JeremyLee-CSL2014-ProsodyEntrainment.pdf},
 month = {Mar},
 number = {2},
 pages = {518-539},
 title = {Computing Vocal Entrainment: A Signal-derived PCA-based Quantification Scheme with Application to Affect Analysis in Married Couple Interactions},
 volume = {28},
 year = {2014}
}

@inproceedings{hamilton2014concept,
  title={Concept of a miniature atomic sensor},
  author={Hamilton, Paul and Jaffe, Matt and Brown, Justin M and Estey, Brian and M{\"u}ller, H and Compton, Robert and Nelson, Karl},
  booktitle={2014 International Symposium on Inertial Sensors and Systems (ISISS)},
  pages={1--4},
  year={2014},
  organization={IEEE}
}

@INPROCEEDINGS{6956953,
author={Z. {Cao} and M. {French} and R. {Krishnan} and J. {Ng} and D. {Talmage} and Q. {Zhang}},
booktitle={2014 IEEE Military Communications Conference},
title={Content-Oriented Mobile Edge Technology System Integration Framework and Field Evaluation},
year={2014},
volume={},
number={},
pages={1405-1410},
keywords={Internet;military communication;mobile radio;content-oriented mobile edge technology system integration framework;field evaluation;Internet evolution;on-time situational awareness;soldier;tactical edge;network connectivity;COMET system framework;mobile edge network;innovative system element;content-oriented socket;cosocket;enhanced broadcast abstraction layer;EBAL;large-scale outdoor field experiment;three-squad heterogeneous network;rifleman tactical radio;WiFi link;COMET integrated content-oriented networking;Internet;Reliability;Smart phones;Servers;Mobile communication;IEEE 802.11 Standards;Sockets},
doi={10.1109/MILCOM.2014.233},
ISSN={2155-7578},
month={Oct},}   

@Article{	  malawski2014optimization,
  Author	= {Maciej Malawski and Kamil Figiela and Marian Bubak and Ewa
		  Deelman and Jarek Nabrzyski},
  URL		= {http://dx.doi.org/10.1007/978-3-642-55224-3_24},
  DOI		= {10.1007/978-3-642-55224-3_24},
  Title		= {Cost Optimization of Execution of Multi-level
		  Deadline-Constrained Scientific Workflows on Clouds},
  Journal	= {Parallel Processing and Applied Mathematics},
  Pages		= {251-260},
  Publisher	= {Springer Berlin Heidelberg},
  Year		= {2014},
  Note		= {Funding Acknowledgments: OCI SI2-SSI program grant
		  #1148515}
}

@inproceedings{barnhart2014creating,
  title={Creating a Sustainable Assembly Architecture for Next-Gen Space: The Phoenix Effect},
  author={Barnhart, David and Will, Peter and Sullivan, Brook and Hunter, Rroger and Hill, Lisa},
  booktitle={National Space Symposium Paper},
  year={2014}
}

@inproceedings{sharma2014critter,
  title={Critter: Content-Rich Traffic Trace Repository},
  author={Sharma, Vinod and Bartlett, Genevieve and Mirkovic, Jelena},
  booktitle={Proceedings of the 2014 ACM Workshop on Information Sharing \& Collaborative Security},
  pages={13--20},
  year={2014},
  organization={ACM}
}

@article{nourjou2014data,
  title={Data model of the strategic action planning and scheduling problem in a disaster response team},
  author={Nourjou, Reza and Szekely, Pedro and Hatayama, Michinori and Ghafory-Ashtiany, Mohsen and Smith, Stephen F},
  journal={Journal of Disaster Research},
  volume={9},
  number={3},
  pages={381--399},
  year={2014}
}

@INPROCEEDINGS{steeg2013a,
	title = { Demystifying Information-Theoretic Clustering },
	BOOKTITLE =    {Proc. of ICML'14},
	year = {2014},
	urlpaper = {http://lanl.arxiv.org/abs/1310.4210},
	author = {Greg {Ver Steeg} and Aram Galstyan and Fei Sha and Simon DeDeo}
}

@article{nourjou2014design,
  title={Design of a gis-based assistant software agent for the incident commander to coordinate emergency response operations},
  author={Nourjou, Reza and Hatayama, Michinori and Smith, Stephen F and Sadeghi, Atabak and Szekely, Pedro},
  journal={arXiv preprint arXiv:1401.0282},
  year={2014}
}

@inproceedings{Shila2014Design-imp2,
	author = {Shila, Devu and Venugopalan, Vivek},
	booktitle = {IEEE International Conference on Communications (ICC)},
	date-added = {2020-01-15 12:02:05 -0500},
	date-modified = {2020-01-15 12:02:05 -0500},
	keywords = {Encryption;Field programmable gate arrays;Hardware;Power demand;Timing;Trojan horses;Design;Hardware Trojans;Resiliency;Security},
	month = jun,
	pages = {719-724},
	title = {{Design, Implementation and Security Analysis of Hardware Trojan Threats in FPGA}},
	year = {2014},
	Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxAsLi4vLi4vcmVmZXJlbmNlcy9QREYvU2hpbGEyMDE0RGVzaWduLWltcC5wZGZPEQGCAAAAAAGCAAIAAAxNYWNpbnRvc2ggSEQAAAAAAAAAAAAAAAAAAAAAAAAAQkQAAf////8XU2hpbGEyMDE0RGVzaWduLWltcC5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA/////wAAAAAAAAAAAAAAAAACAAMAAAogY3UAAAAAAAAAAAAAAAAAA1BERgAAAgA9LzpVc2Vyczp2aXZla3Y6RHJvcGJveDpyZWZlcmVuY2VzOlBERjpTaGlsYTIwMTREZXNpZ24taW1wLnBkZgAADgAwABcAUwBoAGkAbABhADIAMAAxADQARABlAHMAaQBnAG4ALQBpAG0AcAAuAHAAZABmAA8AGgAMAE0AYQBjAGkAbgB0AG8AcwBoACAASABEABIAO1VzZXJzL3ZpdmVrdi9Ecm9wYm94L3JlZmVyZW5jZXMvUERGL1NoaWxhMjAxNERlc2lnbi1pbXAucGRmAAATAAEvAAAVAAIADf//AAAACAANABoAJABTAAAAAAAAAgEAAAAAAAAABQAAAAAAAAAAAAAAAAAAAdk=},
	Bdsk-Url-1 = {http://dx.doi.org/10.1109/ICC.2014.6883404}}

@article{Lee2014Developmentalacousticstudyof,
 author = {Lee, Sungbok and Potamianos, Alexandros and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 doi = {dx.doi.org/10.1121/1.4894799},
 journal = {J. Acoust. Soc. Am.},
 link = {http://sail.usc.edu/publications/files/14894799.pdf},
 month = {Oct},
 number = {4},
 pages = {1880-1894},
 title = {Developmental acoustic study of American English diphthongs},
 volume = {136},
 year = {2014}
}

@inproceedings{schuler_digital_2014,
	address = {Belfast, United Kingdom},
	title = {Digital asset management for heterogeneous biomedical data in an era of data-intensive science},
	isbn = {978-1-4799-5669-2},
	url = {http://ieeexplore.ieee.org/document/6999226/},
	doi = {10.1109/BIBM.2014.6999226},
	urldate = {2022-01-15},
	booktitle = {2014 {IEEE} {International} {Conference} on {Bioinformatics} and {Biomedicine} ({BIBM})},
	publisher = {IEEE},
	author = {Schuler, Robert E. and Kesselman, Carl and Czajkowski, Karl},
	month = nov,
	year = {2014},
	pages = {588--592},
}

@article{ver2014discovering,
  title={Discovering structure in high-dimensional data through correlation explanation},
  author={Ver Steeg, Greg and Galstyan, Aram},
  journal={Advances in Neural Information Processing Systems},
  volume={27},
  year={2014}
}

@conference {TranHPEC2014,
	title = {Dynamic Runtime Optimizations for Systems of Heterogeneous Architectures},
	booktitle = {Eighteenth Annual IEEE High Performance Extreme Computing Conference},
	year = {2014},
	publisher = {IEEE},
	organization = {IEEE},
	author = {Tran, Geoffrey P. and Kang, Dong-In and Crago, Stephen P.},
	pages={1-6},
    doi={10.1109/HPEC.2014.7040970}
}

@article{nourjou2014dynamic,
  title={Dynamic assignment of geospatial-temporal macro tasks to agents under human strategic decisions for centralized scheduling in multi-agent systems},
  author={Nourjou, Reza and Smith, Stephen F and Hatayama, Michinori and Okada, Norio and Szekely, Pedro},
  journal={International Journal of Machine Learning and Computing (IJMLC)},
  volume={4},
  number={1},
  pages={39--46},
  year={2014}
}

@misc{ gil-geosoft-14,
  title = {EarthCube EC3 2014 Field Trip Report},
  author = {Yolanda Gil},
  note = {Report of the EarthCube Research Coodination Network on \textquotesingle Earth-Centered Communication for Cyberinfrastructure:  Challenges of field data collection, management, and integration \textquotesingle },
  year = {2014},
  url = {EarthCube-EC3-TripReport-2014/}
}

@misc{ gil-etal-ec14,
  title = {EarthCube: Past, Present, and Future},
  author = {Yolanda Gil and Marjorie Chan and Basil Gomez and Bruce Caron (Eds)},
  note = {EarthCube Project Report EC-2014-3},
  year = {2014},
  url = {http://www.earthcube.org/document/earthcube-past-present-and-future}
}

@inproceedings{Chervenak2014b,
	acmid = {2607437},
	address = {{Washington, DC, USA}},
	author = {Chervenak, Ann L. and Sim, Alex and Gu, Junmin and Schuler, Robert and Hirpathak, Nandan},
	booktitle = {Proceedings of the 2014 {{22Nd Euromicro International Conference}} on {{Parallel}}, {{Distributed}}, and {{Network-Based Processing}}},
	date-added = {2018-09-12 15:11:16 -0700},
	date-modified = {2020-01-21 15:51:59 -0800},
	isbn = {978-1-4799-2729-6},
	keywords = {data transfer,performance-based adaptation,policy-based resource allocation},
	pages = {244--247},
	publisher = {{IEEE Computer Society}},
	series = {{{PDP}} '14},
	title = {Efficient {{Data Staging Using Performance-Based Adaptation}} and {{Policy-Based Resource Allocation}}},
	year = {2014}}

@inproceedings{hussain2014enabling,
  title={Enabling collaborative research for security and resiliency of energy cyber physical systems},
  author={Hussain, Alefiya and Faber, Ted and Braden, Robert and Benzel, Terry and Yardley, Tim and Jones, Jeremy and Nicol, David M and Sanders, William H and Edgar, Thomas W and Carroll, Thomas E and others},
  booktitle={2014 IEEE International Conference on Distributed Computing in Sensor Systems},
  pages={358--360},
  year={2014},
  organization={IEEE}
}

@article{barnhart2014enabling,
  title={Enabling the 2nd Generation in Space: Building blocks for large scale space endeavors},
  author={Barnhart, David and Garretson, Peter and Will, Peter},
  journal={Journal of British Interplanetary Society},
  volume={67},
  year={2014}
}

@conference {KuppannnagariHPEC2014,
	title = {Energy Performance of FPGAs on PERFECT Suite Kernels},
	booktitle = {Eighteenth Annual IEEE High Performance Extreme Computing Conference},
	year = {2014},
	publisher = {IEEE},
	organization = {IEEE},
	author = {Kuppannagari, S.R. and Chen, Ren and Sanny, Andrea and Singapura, Shreyas G. and Tran, Geoffrey Phi and Zhou, S. and Hu, Y. and Crago, Stephen P. and Prasanna, V.K.}
}

@inproceedings{Vaz2014EnergyConstrainedMVR,
 author = {Vaz, Colin and Tsiartas, Andreas and Narayanan, Shrikanth},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2014.6854811},
 link = {http://sail.usc.edu/publications/files/p6316-vaz.pdf},
 location = {Florence, Italy},
 month = {May},
 title = {Energy-Constrained Minimum Variance Response Filter for Robust Vowel Spectral Estimation},
 year = {2014}
}

@inproceedings{Vaz2014EnhancingAudioSourceSeparability,
 author = {Vaz, Colin and B Dimitriadis, Dimitrios and Narayanan, Shrikanth},
 bib2html_rescat = {},
 booktitle = {Proceedings of Interspeech},
 doi = {},
 link = {http://sail.usc.edu/publications/files/vaz-enhancing_source_separation.pdf},
 month = {Sep},
 title = {Enhancing Audio  Source Separability Using Spectro-Temporal Regularization with NMF},
 year = {2014}
}

@article{lanting2014entanglement,
  title={Entanglement in a quantum annealing processor},
  author={Lanting, Trevor and Przybysz, Anthony J and Smirnov, A Yu and Spedalieri, Federico M and Amin, Mohammad H and Berkley, Andrew J and Harris, Richard and Altomare, Fabio and Boixo, Sergio and Bunyk, Paul and others},
  journal={Physical Review X},
  volume={4},
  number={2},
  pages={021041},
  year={2014},
  publisher={APS}
}

@article{PAL:13,
	Author = {Pudenz, Kristen L and Albash, Tameem and Lidar, Daniel A},
	Date = {2014/02/06/online},
	Date-Added = {2014-02-11 21:50:48 +0000},
	Date-Modified = {2015-03-29 00:45:07 +0000},
	Day = {06},
	Doi = {10.1038/ncomms4243},
	Journal = {Nat. Commun.},
	M3 = {Article},
	Month = {02},
	Pages = {3243},
	Publisher = {Nature Publishing Group, a division of Macmillan Publishers Limited. All Rights Reserved.},
	Title = {Error-corrected quantum annealing with hundreds of qubits},
	Ty = {JOUR},
	Url = {dx.doi.org/10.1038/ncomms4243},
	Volume = {5},
	Year = {2014}}

@inproceedings{Kim2014Estimationofthemovement,
 author = {Kim, Jangwon and Lee, Sungbok and Narayanan, Shrikanth},
 bib2html_rescat = {span},
 booktitle = {Proceedings of Interspeech},
 link = {http://sail.usc.edu/publications/files/kim_interspeech_2014.pdf},
 month = {Sep},
 title = {Estimation of the  movement trajectories of non-crucial articulators based on the detection of   crucial moments and physiological constraints},
 year = {2014}
}

@conference {YoungeHPGC2014,
	title = {Evaluating {GPU} Passthrough in {Xen} for High Performance Cloud Computing},
	booktitle = {Workshop on High-Performance Grid and Cloud Computing (HPGC)},
	year = {2014},
	publisher = {IEEE},
	organization = {IEEE},
	url = {http://www.isi.edu/sites/default/files/users/jwalters/papers/HPGC_2014.pdf},
	author = {Younge, Andrew J. and Walters, John Paul and Crago, Stephen P. and Fox, Geoffrey C.}
}

@inproceedings{Venugopalan2014Evaluating,
	abstract = {General purpose extremely large aperture optical/infrared telescopes are instrumental in vastly advancing the astrophysical knowledge on a variety of subjects such as star formation, super-massive black holes, solar magnetic atmosphere, exoplanets and protoplanetary systems. The computational requirements for data processing and real-time control are not feasible using conventional computer and cluster architectures. This paper investigates the latency and throughput bound hardware acceleration of wavefront reconstruction and real-time control algorithms using GPUs and FPGAs. Two different correlation methods are studied and targeted on the hardware accelerators for optimal performance. The GPU-based implementations exhibit lower latency due to its superior floating point capability and supporting libraries. The FPGA-based implementation is slower and requires more fine-tuning to yield more throughput than the GPU implementation.},
	author = {Venugopalan, Vivek},
	booktitle = {IEEE High Performance Extreme Computing Conference (HPEC)},
	date-added = {2020-01-15 12:02:05 -0500},
	date-modified = {2020-01-15 12:02:05 -0500},
	keywords = {adaptive optics;field programmable gate arrays;graphics processing units;optical computing;FPGA;GPU;adaptive optics algorithm;astrophysical knowledge;data processing;extremely large aperture optical telescopes;field programmable gate array;floating point capability;graphics processing unit;infrared telescopes;latency bound hardware acceleration;realtime control algorithm;throughput bound hardware acceleration;wavefront reconstruction;Actuators;Correlation;Field programmable gate arrays;Graphics processing units;Image reconstruction;Mathematical model;Real-time systems;Adaptive optics systems;field programmable gate arrays;graphics processing units;parallel processing;real-time systems;wavefront correction},
	month = sep,
	pages = {1-6},
	title = {{Evaluating Latency and Throughput Bound Acceleration of FPGAs and GPUs for Adaptive Optics Algorithms}},
	year = {2014},
	Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxAyLi4vLi4vcmVmZXJlbmNlcy9QREYvVmVudWdvcGFsYW4yMDE0RXZhbHVhdGluZy5wZGZPEQGaAAAAAAGaAAIAAAxNYWNpbnRvc2ggSEQAAAAAAAAAAAAAAAAAAAAAAAAAQkQAAf////8dVmVudWdvcGFsYW4yMDE0RXZhbHVhdGluZy5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA/////wAAAAAAAAAAAAAAAAACAAMAAAogY3UAAAAAAAAAAAAAAAAAA1BERgAAAgBDLzpVc2Vyczp2aXZla3Y6RHJvcGJveDpyZWZlcmVuY2VzOlBERjpWZW51Z29wYWxhbjIwMTRFdmFsdWF0aW5nLnBkZgAADgA8AB0AVgBlAG4AdQBnAG8AcABhAGwAYQBuADIAMAAxADQARQB2AGEAbAB1AGEAdABpAG4AZwAuAHAAZABmAA8AGgAMAE0AYQBjAGkAbgB0AG8AcwBoACAASABEABIAQVVzZXJzL3ZpdmVrdi9Ecm9wYm94L3JlZmVyZW5jZXMvUERGL1ZlbnVnb3BhbGFuMjAxNEV2YWx1YXRpbmcucGRmAAATAAEvAAAVAAIADf//AAAACAANABoAJABZAAAAAAAAAgEAAAAAAAAABQAAAAAAAAAAAAAAAAAAAfc=},
	Bdsk-Url-1 = {http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7040964},
	Bdsk-Url-2 = {http://dx.doi.org/10.1109/HPEC.2014.7040964}}

General purpose extremely large aperture optical/infrared telescopes are instrumental in vastly advancing the astrophysical knowledge on a variety of subjects such as star formation, super-massive black holes, solar magnetic atmosphere, exoplanets and protoplanetary systems. The computational requirements for data processing and real-time control are not feasible using conventional computer and cluster architectures. This paper investigates the latency and throughput bound hardware acceleration of wavefront reconstruction and real-time control algorithms using GPUs and FPGAs. Two different correlation methods are studied and targeted on the hardware accelerators for optimal performance. The GPU-based implementations exhibit lower latency due to its superior floating point capability and supporting libraries. The FPGA-based implementation is slower and requires more fine-tuning to yield more throughput than the GPU implementation.

@InProceedings{	  glatard2014provenance,
  Author	= {Tristan Glatard and Lindsay B Lewis and Ferreira da Silva,
		  Rafael and Marc-Etienne Rousseau and Claude Lepage and
		  Pierre Rioux and Najmeh Mahani and Ewa Deelman and Alan C
		  Evans},
  URL		= {http://pegasus.isi.edu/publications/2014/2014-neuroinformatics.pdf},
  Title		= {Extending provenance information in CBRAIN to address
		  reproducibility issues across computing platforms},
  BookTitle	= {NeuroInformatics 2014},
  Year		= {2014}
}

@InProceedings{Fisk14a,
	author = 	"Michael E. Fisk and Curtis L. Hash",
	title = 	"FileMap: Map-Reduce Program Execution on Loosely-Coupled Distributed Systems",
	booktitle = 	"Proceedings of the " # "4th" # " International Workshop on Cloud Data and Platforms",
	year = 		2014,
	sortdate = 		"2014-04-01",
	pages = 	"to appear",
	month = 	apr,
	address = 	"Amsterdam, the Netherlands",
	publisher = 	"ACM",
	doi = "http://dx.doi.org/10.1145/2592784.2592790",
	jlocation = 	"johnh: pafile",
	keywords = 	"map/reduce, file map, lanl, retro-future",
	myorganization = "LANL",
	codeurl = 	"http://mfisk.github.io/filemap",
	project = 	"ant, retrofuture",
	abstract = "
In this paper we present FileMap, an open-source,1 alternative map-reduce-based computing system that we have
developed and utilized over the last 5 years. This system features several significant design decisions and performance
aspects that are not found in prevalent map-reduce systems such as Hadoop [16]. The prevailing design goal is
to have a system for scheduling and orchestrating parallel
and distributed data processing, but that does not interpose
itself between data and the serial programs that process data.
FileMap manages the organization of input and output files
and the scheduling of program execution, but does not process files itself and is agnostic to the format in which data is
stored and/or indexed. We layer on top of existing, ubiquitous file systems, security models, and network access software in order to minimize the complexity of FileMap and
maximize the ability of its users to benefit from specialized
compute platforms, file systems, and software.
We measure the performance of FileMap in several instantiations including a heterogeneous “cloud” conglomeration of computers and storage distributed across multiple owning organizations with no cross-organization trust
or synchronization. This “cloud” model intentionally supports distributed sensor systems in which nodes collect their
own data and participate in analysis of data by moving
map/reduce processing upstream to where the data is collected.
Our on SMP systems, clusters built for Hadoop, and
this distributed cloud, show that FileMap outperforms more
prevalent computing systems and models by factors between
2x (compared to Hadoop) and 14x (cloud vs. centralized).

FileMap provides a single programming model that allows processing to seamlessly scale from a single laptop to
data-intensive compute clusters to distributed sensing and
analysis clouds.
This paper introduces our fundamental design decisions
in Section 1 and specifics of the implementation in Section
2. Section 3 describes the use of embedded databases within
our system. Section 4 presents a performance benchmark
measured across a variety of computing environments.
"
}

In this paper we present FileMap, an open-source,1 alternative map-reduce-based computing system that we have developed and utilized over the last 5 years. This system features several significant design decisions and performance aspects that are not found in prevalent map-reduce systems such as Hadoop [16]. The prevailing design goal is to have a system for scheduling and orchestrating parallel and distributed data processing, but that does not interpose itself between data and the serial programs that process data. FileMap manages the organization of input and output files and the scheduling of program execution, but does not process files itself and is agnostic to the format in which data is stored and/or indexed. We layer on top of existing, ubiquitous file systems, security models, and network access software in order to minimize the complexity of FileMap and maximize the ability of its users to benefit from specialized compute platforms, file systems, and software. We measure the performance of FileMap in several instantiations including a heterogeneous “cloud” conglomeration of computers and storage distributed across multiple owning organizations with no cross-organization trust or synchronization. This “cloud” model intentionally supports distributed sensor systems in which nodes collect their own data and participate in analysis of data by moving map/reduce processing upstream to where the data is collected. Our on SMP systems, clusters built for Hadoop, and this distributed cloud, show that FileMap outperforms more prevalent computing systems and models by factors between 2x (compared to Hadoop) and 14x (cloud vs. centralized). FileMap provides a single programming model that allows processing to seamlessly scale from a single laptop to data-intensive compute clusters to distributed sensing and analysis clouds. This paper introduces our fundamental design decisions in Section 1 and specifics of the implementation in Section 2. Section 3 describes the use of embedded databases within our system. Section 4 presents a performance benchmark measured across a variety of computing environments.

@article{WTTM14,
	author = {Vincent Gramoli and Petr Kuznetsov and Srivatsan Ravi},
	title = {Forget about Performance, Think about Concurrency},
	journal = {6th Workshop on the Theory of Transactional Memory, Paris, France},
	
	year = {2014}
	
} 

@inproceedings{DBLP:conf/eScience/GarijoCGGDTT14,
  author       = {Daniel Garijo and
                  {\'{O}}scar Corcho and
                  Yolanda Gil and
                  Boris A. Gutman and
                  Ivo D. Dinov and
                  Paul M. Thompson and
                  Arthur W. Toga},
  title        = {FragFlow Automated Fragment Detection in Scientific Workflows},
  booktitle    = {10th {IEEE} International Conference on e-Science, eScience 2014,
                  Sao Paulo, Brazil, October 20-24, 2014},
  pages        = {281--289},
  publisher    = {{IEEE} Computer Society},
  year         = {2014},
  url          = {https://doi.org/10.1109/eScience.2014.32},
  doi          = {10.1109/ESCIENCE.2014.32},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/eScience/GarijoCGGDTT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{chiang14sigspatial-strabo,
  author = {Yao-Yi Chiang and Sima Moghaddam and Sanjauli Gupta and Renuka Fernandes and Craig A. Knoblock},
  booktitle = {Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems},
  urlpaper = {http://usc-isi-i2.github.io/papers/chiang14-sigspatial-arcstrabo.pdf},
  title = {From Map Images to Geographic Names},
  year = {2014}
}

@inproceedings{Kumar2014DiverseDenoising,
 author = {Kumar, Naveen and Van Segbroeck, Maarten and Audhkhasi, Kartik and Drotar, Peter and Narayanan, Shrikanth},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2014.6854666},
 link = {http://sail.usc.edu/publications/files/p5594-kumar.pdf},
 location = {Florence, Italy},
 month = {May},
 title = {Fusion of Diverse denoising systems for Robust Automatic Speech Recognition},
 year = {2014}
}

@conference {WaltersCloud2014,
	title = {GPU Passthrough Performance: A Comparison of {KVM}, {X}en, {VMWare ESXi}, and {LXC} for {CUDA} and {OpenCL} Applications},
	booktitle = {International Conference on Cloud Computing},
	year = {2014},
	month = jun,
	pages = {636-643},
	publisher = {IEEE},
	organization = {IEEE},
	url = {http://www.isi.edu/sites/default/files/users/jwalters/papers/Cloud_2014.pdf},
	author = {Walters, John Paul and Younge, Andrew and Kang, Dong-In and Yao, Ke and Kang, Mikyung and Crago, Stephen and Fox, Geoffrey},
	doi = {10.1109/CLOUD.2014.90}
}

@misc{harth-gil-lgd14,
  author = {Andreas Harth and Yolanda Gil},
  title = {Geospatial Data Integration with Linked Data and Provenance Tracking},
  note = {W3C/OGC Workshop on Linking Geospatial Data},
  address = {London, UK},
  year = {2014},
  url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/harth-gil-lgd14.pdf }
}

@inproceedings{Yang2014GestureDynamicsModelingFor,
 author = {Yang, Zhaojun and Ortega, Antonio and Narayanan, Shrikanth},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of IEEE International Conference on Image Processing},
 doi = {https://doi.org/10.1109/icip.2014.7025303},
 link = {http://sail.usc.edu/publications/files/1cb0945df7c374523646edaa8f2b8a626e1c.pdf},
 location = {Paris, France},
 month = {Oct},
 title = {Gesture Dynamics  Modeling For Attitude Analysis Using Graph Based Transform},
 year = {2014}
}

@inproceedings{JiunYu2014Graph-basedApproachforMotion,
 author = {Jiun-Yu Kao and Ortega, Antonio and Narayanan, Shrikanth},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of IEEE International Conference on Image Processing},
 doi = {10.1109/ICIP.2014.7025413},
 link = {http://sail.usc.edu/publications/files/kuo_icip_2014.pdf},
 location = {Paris, France},
 month = {Oct},
 title = {Graph-based Approach for Motion Capture Data Representation and Analysis},
 year = {2014}
}

@inproceedings{kocoloski2014hpmmap,
  title={HPMMAP: Lightweight memory management for commodity operating systems},
  author={Kocoloski, Brian and Lange, John},
  booktitle={2014 IEEE 28th International Parallel and Distributed Processing Symposium},
  pages={649--658},
  year={2014},
  organization={IEEE}
}

@Article{	  mclennan2014hubzero,
  Author	= {Michael McLennan and Steven Clark and Ewa Deelman and Mats
		  Rynge and Karan Vahi and Frank McKenna and Derrick Kearney
		  and Carol Song},
  URL		= {http://dx.doi.org/10.1002/cpe.3257},
  DOI		= {10.1002/cpe.3257},
  Title		= {HUBzero and Pegasus: integrating scientific workflows into
		  science gateways},
  Journal	= {Concurrency and Computation: Practice and Experience},
  Year		= {2014},
  Note		= {Funding Acknowledgements: OCI SI2-SSI program grant
		  #1148515, OCI SDCI program grant #0722019}
}

@article{vinci2014hearing,
  title={Hearing the shape of the Ising model with a programmable superconducting-flux annealer},
  author={Vinci, Walter and Markstr{\"o}m, Klas and Boixo, Sergio and Roy, Aidan and Spedalieri, Federico M and Warburton, Paul A and Severini, Simone},
  journal={Scientific reports},
  volume={4},
  number={1},
  pages={1--7},
  year={2014},
  publisher={Nature Publishing Group}
}

@inproceedings{skalicky2014a,
	author = {Sam Skalicky and Andrew G. Schmidt and French, M.},
	booktitle = {International Workshop on FPGAs for Software Programmers},
	title = {High Level Hardware/Software Embedded System Design with Redsharc},
	year = {2014}}

@INPROCEEDINGS{6927475,
author={K. M. {Zick} and and M. {French}},
booktitle={2014 24th International Conference on Field Programmable Logic and Applications (FPL)},
title={High-precision self-characterization for the LUT burn-in information leakage threat},
year={2014},
volume={},
number={},
pages={1-6},
keywords={field programmable gate arrays;table lookup;self-characterization;LUT burn-in information leakage threat;FPGA transistors;clock sweeping;launch-and-capture data;Xilinx Kintex-7 paths;FPGA LUT contents;Delays;Field programmable gate arrays;Clocks;Table lookup;Transistors;Temperature measurement;Temperature sensors;Wear out;aging;self-characterization;data burn-in;data imprinting;FPGA;information leakage},
doi={10.1109/FPL.2014.6927475},
ISSN={1946-147X},
month={Sep.},}

@incollection{fink2014linked,
	Author = {Fink, Eleanor E. and Szekely, Pedro and Knoblock, Craig A.},
	Booktitle = {Digital Heritage: Progress in Cultural Heritage: Documentation, Preservation, and Protection, LNCS 8740},
	Editor = {Marinos Ioannides and Nadia Magnenat-Thalmann and Eleanor Fink and Roko Zarnic and Alex-Yianing Yen and Ewald Quak},
	Pages = {228--237},
	Publisher = {Springer International Publishing},
	Title = {How Linked Open Data Can Help in Locating Stolen or Looted Cultural Property},
	Year = {2014},
	urlPaper= "http://usc-isi-i2.github.io/papers/fink14-euromed.pdf"
	}

@inproceedings{DBLP:conf/icassp/0004N14,
  author       = {Naveen Kumar and
                  Shrikanth S. Narayanan},
  title        = {Hull detection based on largest empty sector angle with application
                  to analysis of realtime {MR} images},
  booktitle    = {{IEEE} International Conference on Acoustics, Speech and Signal Processing,
                  {ICASSP} 2014, Florence, Italy, May 4-9, 2014},
  pages        = {6617--6621},
  year         = {2014},
  crossref     = {DBLP:conf/icassp/2014},
  url          = {https://doi.org/10.1109/ICASSP.2014.6854880},
  doi          = {10.1109/ICASSP.2014.6854880},
  timestamp    = {Fri, 19 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icassp/0004N14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Gurunath2014ImprovingSpeechRecognitionfor,
 author = {Gurunath Shivakumar, Prashanth and Potamianos, Alexandros and Lee, Sungbok and Narayanan, Shrikanth},
 bib2html_rescat = {},
 booktitle = {Proceedings of Workshop on Child, Computer and Interaction (WOCCI 2014)},
 link = {http://sail.usc.edu/publications/files/shivakumaretal_improving.pdf},
 location = {Singapore},
 month = {Sep},
 title = {Improving Speech Recognition for Children using Acoustic Adaptation and Pronunciation Modeling},
 year = {2014}
}

@article{DeAngelis2014,
author = {DeAngelis, David and Barber, K Suzanne},
file = {:home/dave/Documents/References/DeAngelis, Barber - 2014 - Incentives for Online Communities.pdf:pdf},
journal = {International Journal of Computer and Information Technology},
keywords = {-incentives,expert participation,online communities},
number = {06},
pages = {1229--1240},
title = {Incentives for Online Communities},
url = {https://pdfs.semanticscholar.org/8105/f8a93b910ffce001853ee896e4be80ea3075.pdf},
volume = {03},
year = {2014}
}

@article{WTTM3,
	author = {Dan Alistarh and Justin Kopinsky and Petr Kuznetsov and Srivatsan Ravi and Nir Shavit},
	title = {Inherent Limitations of Hybrid Transactional Memory},
	journal = {6th Workshop on the Theory of Transactional Memory, Paris, France},
	
	year = {2014}
	
} 

@inproceedings{narayanan14,
  author = {Shrikanth Narayanan and Ayush Jaiswal and Yao-Yi Chiang and Yanhui Geng and Craig A. Knoblock and Pedro Szekely},
  booktitle = {Proceedings of the First Workshop on Data Integration and Application at the 2014 IEEE International Conference on Data Mining},
  title = {Integration and Automation of Data Preparation and Data Mining},
  urlpaper = {http://usc-isi-i2.github.io/papers/narayanan14-icdm.pdf},
  urlslides = {http://usc-isi-i2.github.io/papers/narayanan14-icdm-slides.pdf},
  year = {2014}
}

@inproceedings{gil-iemss14,
  author = {Yolanda Gil},
  title = {Intelligent Workflow Systems and Provenance-Aware Software},
  booktitle = {Proceedings of the Seventh International Congress on Environmental Modeling and Software},
  address = {San Diego, CA},
  year = {2014},
  url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/gil-iemss14.pdf },
  ee = {http://www.iemss.org/sites/iemss2014/papers/iemss2014_submission_384.pdf}
}

@article{nourjou2014intelligent,
  title={Intelligent algorithm for assignment of agents to human strategy in centralized multi-agent coordination},
  author={Nourjou, Reza and Smith, Stephen F and Hatayama, Michinori and Szekely, Pedro},
  journal={Journal of Software},
  volume={9},
  number={10},
  pages={2586--2597},
  year={2014}
}

@Misc{Heidemann14e,
	author = 	"John Heidemann",
	title = 	"Internet Populations (Good and Bad): Measurement, Estimation, and Correlation",
	howpublished = "Presentation at ICERM Workshop on Cybersecurity",
	address = "Providence, Rhode Island",
	month = 	oct,
	year = 	2014,
	sortdate = "2014-10-22",
	project = "ant, lacrend, retrofuture",
	jsubject = "network_topology",
	jlocation = 	"johnh: pafile",
	keywords = 	"internet census, outages, diurnal, math",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann14e.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann14e.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
Our research studies the Internet's public face.  Since 2006 we have
been taking censuses of the Internet address space (pinging all IPv4
addresses) every 3 months.  Since 2012 we have studied network outages
and events like Hurricane Sandy, using probes of much of the Internet
every 11 minutes.  Most recently we have evaluated the diurnal
Internet, finding countries where most people turn off their computers
at night.  Finally, we have looked at network reputation, identifying
how spam generation correlates with network location, and others have
studies multiple measurements of ``network reputation''. \newline \indent
A common theme across this work is one must estimate characteristics
of the edge of the Internet in spite of noisy measurements and a
underlying changes.  One also need to compare and correlate these
imperfect measurements with other factors (from GDP to
telecommunications policies). \newline \indent
How do these applications relate to the mathematics of census taking
and measurement, estimation, and correlation?  Are there tools we
should be using that we aren't?  Do the properties of the Internet
suggest new approaches (for example where rapid full enumeration is
possible)?  Does correlation and estimates of network ``badness'' help
us improve cybersecurity by treating different parts of the network
differently?
",
}

Our research studies the Internet's public face. Since 2006 we have been taking censuses of the Internet address space (pinging all IPv4 addresses) every 3 months. Since 2012 we have studied network outages and events like Hurricane Sandy, using probes of much of the Internet every 11 minutes. Most recently we have evaluated the diurnal Internet, finding countries where most people turn off their computers at night. Finally, we have looked at network reputation, identifying how spam generation correlates with network location, and others have studies multiple measurements of ``network reputation''. \newline ∈dent A common theme across this work is one must estimate characteristics of the edge of the Internet in spite of noisy measurements and a underlying changes. One also need to compare and correlate these imperfect measurements with other factors (from GDP to telecommunications policies). \newline ∈dent How do these applications relate to the mathematics of census taking and measurement, estimation, and correlation? Are there tools we should be using that we aren't? Do the properties of the Internet suggest new approaches (for example where rapid full enumeration is possible)? Does correlation and estimates of network ``badness'' help us improve cybersecurity by treating different parts of the network differently?

@article{Bone2014IntoxicatedSpeechDetection:A,
 author = {Bone, Daniel and Li, Ming and Black, Matthew P. and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 doi = {dx.doi.org/10.1016/j.csl.2012.09.004.},
 journal = {Computer, Speech, and Language},
 link = {http://sail.usc.edu/publications/files/Bone_et_al_IS11.PDF},
 month = {Mar},
 number = {2},
 pages = {375-391},
 title = {Intoxicated Speech Detection: A Fusion Framework with Speaker-Normalized Hierarchical Functionals and GMM Supervectors},
 volume = {28},
 year = {2014}
}

@INPROCEEDINGS{7035343,
author={Y. {Pino} and V. {Jyothi} and M. {French}},
booktitle={2014 International Test Conference},
title={Intra-die process variation aware anomaly detection in FPGAs},
year={2014},
volume={},
number={},
pages={1-6},
keywords={field programmable gate arrays;hardware-software codesign;integrated circuit testing;invasive software;logic design;VLSI;intradie process variation aware;nondestructive method;hardware trojans;VLSI layer;configurable logic blocks;switch blocks;chip under test;anomaly detection;Xili1nx Virtex-4;Virtex-5;Virtex-6 FPGA devices;Field programmable gate arrays;Trojan horses;Frequency measurement;Hardware;Delays;Correlation;Fabrics},
doi={10.1109/TEST.2014.7035343},
ISSN={1089-3539},
month={Oct},}

@article{journals/corr/OishiCAM14,
  added-at = {2018-08-13T00:00:00.000+0200},
  author = {Oishi, Koji and Cebrian, Manuel and Abeliuk, Andr{\'{e}}s and Masuda, Naoki},
  biburl = {https://www.bibsonomy.org/bibtex/2c007321db634b239e3953aa963f54921/dblp},
  interhash = {0c934cdfdae79770c2a4728ecebd8885},
  intrahash = {c007321db634b239e3953aa963f54921},
  journal = {Scientific reports},
  keywords = {dblp},
  publisher={Nature Publishing Group},
  timestamp = {2018-08-14T12:27:05.000+0200},
  title = {Iterated crowdsourcing dilemma game.},
  url = {https://rdcu.be/ci7Xb},
  volume = {abs/1401.4267},
  month = feb,
  year = 2014
}

@inproceedings{wu2014iteratively,
	Author = {Wu, Bo and Knoblock, Craig A.},
	Booktitle = {Proceedings of the First Workshop on Data Integration and Application at the 2014 IEEE International Conference on Data Mining},
	Organization = {IEEE},
	Pages = {1105--1112},
	Title = {Iteratively Learning Conditional Statements in Transforming Data by Example},
	Year = {2014},
	urlPaper= "http://usc-isi-i2.github.io/papers/wu14-icdm.pdf",
	urlSlides= "http://usc-isi-i2.github.io/slides/wu14-icdm-slides.pdf"
	}

@inproceedings{Vaz2014JointFilteringandFactorization,
 author = {Vaz, Colin and Ramanarayanan, Vikram and Narayanan, Shrikanth},
 bib2html_rescat = {},
 booktitle = {Proceedings of Interspeech},
 doi = {},
 link = {http://sail.usc.edu/publications/files/vaz-joint_filtering_factorization.pdf},
 month = {Sep},
 title = {Joint Filtering  and Factorization for Recovering Latent Structure from Noisy Speech Data},
 year = {2014}
}

@inproceedings{Gibson2014IncrementalDD,
 author = {Gibson, James and Narayanan, Shrikanth},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2014.6854465},
 link = {http://sail.usc.edu/publications/files/p4591-gibson.pdf},
 location = {Florence, Italy},
 month = {May},
 title = {Learning Multiple Concepts with Incremental Diverse Density},
 year = {2014}
}

@inproceedings{peng2014learning,
  title={Learning polylingual topic models from code-switched social media documents},
  author={Peng, Nanyun and Wang, Yiming and Dredze, Mark},
  booktitle={Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)},
  pages={674-679},
  year={2014}
}

@inproceedings{ture-boschee-2014-learning,
    title = "Learning to Translate: A Query-Specific Combination Approach for Cross-Lingual Information Retrieval",
    author = "Ture, Ferhan  and
      Boschee, Elizabeth",
    booktitle = "Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing ({EMNLP})",
    month = oct,
    year = "2014",
    address = "Doha, Qatar",
    publisher = "Association for Computational Linguistics",
    url = "https://aclanthology.org/D14-1064",
    doi = "10.3115/v1/D14-1064",
    pages = "589--599",
}

@InProceedings{	  santanaperez2014reproducibility,
  Author	= {Idafen Santana-Perez and Ferreira da Silva, Rafael and
		  Mats Rynge and Ewa Deelman and Maria S. Perez-Hernandez and
		  Oscar Corcho},
  URL		= {http://pegasus.isi.edu/publications/2014/2014-xsede.pdf},
  Title		= {Leveraging Semantics to Improve Reproducibility in
		  Scientific Workflows},
  BookTitle	= {The reproducibility at XSEDE workshop},
  Year		= {2014},
  Note		= {Funding Acknowledgments: NSF FutureGrid 0910812}
}

@ARTICLE{Lerman14plosone,
  AUTHOR =       {Kristina Lerman and Tad Hogg},
  TITLE =        {Leveraging position bias to improve peer recommendation},
  JOURNAL =      {PLoS One},
  YEAR =         {2014},
  volume =       {9},
  number =       {6},
  pages =        {e98914},
  url = {http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0098914},
  urlBlog={http://crowdresearch.org/blog/?p=8881},
  abstract =     {With the advent of social media and peer production, the amount of new online content has grown dramatically. To identify interesting items in the vast stream of new content, providers must rely on peer recommendation to aggregate opinions of their many users. Due to human cognitive biases,  the presentation order strongly affects how people allocate attention to the available content. Moreover, we can manipulate attention through the presentation order of items to change the way peer recommendation works. We experimentally evaluate this effect using Amazon Mechanical Turk.
We find that different policies for ordering content can steer user attention so as to improve the outcomes of peer recommendation.
},
  keywords =     {social-dynamics},
}

With the advent of social media and peer production, the amount of new online content has grown dramatically. To identify interesting items in the vast stream of new content, providers must rely on peer recommendation to aggregate opinions of their many users. Due to human cognitive biases, the presentation order strongly affects how people allocate attention to the available content. Moreover, we can manipulate attention through the presentation order of items to change the way peer recommendation works. We experimentally evaluate this effect using Amazon Mechanical Turk. We find that different policies for ordering content can steer user attention so as to improve the outcomes of peer recommendation.

@inproceedings{woo2014life,
  title={Life-Experience Passwords (LEPs)},
  author={Woo, Simon S and Mirkovic, Jelena and Artstein, Ron and Kaiser, Elsi},
  booktitle={Symposium on Usable Privacy and Security (SOUPS)},
  year={2014}
}

@article{sankaran2014load,
  title={Load-dependent power-efficient passive optical network architectures},
  author={Sankaran, Ganesh C and Sivalingam, Krishna M},
  journal={IEEE/OSA Journal of Optical Communications and Networking},
  volume={6},
  number={12},
  pages={1104--1114},
  year={2014},
  publisher={IEEE}
}

@inproceedings{jaiswal14-giscience,
  author = {Ayush Jaiswal and Yao-Yi Chiang and Craig A. Knoblock and Liang Lan},
  booktitle = {Proceedings of the 8th Geographic Information Science},
  title = {Location Prediction With Sparse {GPS} Data},
  urlPaper= "http://usc-isi-i2.github.io/papers/jaiswal14-giscience.pdf",
  urlSlides= "http://usc-isi-i2.github.io/slides/jaiswal14-giscience-poster.pdf",
  year = {2014}
}

@article{maxsat,
	Author = {Santra, Siddhartha and Quiroz, Greg and {Ver Steeg}, Greg and Lidar, Daniel},
	Journal = {New J. Phys.},
	Pages = {045006},
	Title = {MAX 2-SAT with up to 108 qubits},
	Volume = {16},
	Year = {2014}}

@conference {WaltersGomac2014,
	title = {Maestro Software and Application Performance},
	booktitle = {GOMACTech-14},
	year = {2014},
	author = {Walters, John Paul and Rogers, Craig M. and Crago, Stephen P.}
}

@inproceedings{dimou2014mapping,
	Author = {Dimou, Anastasia and Sande, Miel Vander and Slepicka, Jason and Szekely, Pedro and Mannens, Erik and Knoblock, Craig A. and Walle, Rik Van de},
	Booktitle = {IEEE International Conference on Semantic Computing (ICSC)},
	Organization = {IEEE},
	Pages = {151--158},
	Title = {Mapping hierarchical sources into RDF using the RML mapping language},
	Year = {2014},
	urlPaper= "http://usc-isi-i2.github.io/papers/dimou14-icsc.pdf",
	urlLink="http://ieeexplore.ieee.org/xpls/icp.jsp?arnumber=6882016"
	}

@inproceedings{ver2014maximally,
  title={Maximally Informative Hierarchical Representations of High-Dimensional Data},
  author={Ver Steeg, Greg and Galstyan, Aram},
  booktitle={Artificial Intelligence and Statistics (AISTATS)},
  year={2014}
}

@Misc{Zhu14c,
	author = 	"Liang Zhu and Duane Wessels and Allison
 Mankin and John Heidemann",
	title = "Measuring {DANE} {TLSA} Deployment",
	howpublished = "Presentation at DNS-OARC Fall Workshop",
	address = "Los Angeles, California, USA",
	month = 	oct,
	year = 	2014,
	sortdate = 	"2014-10-01", 
	jlocation = 	"johnh: pafile",
	keywords = 	"DANE TLSA, DNS, PKI",
	url =	"https://ant.isi.edu/%7ejohnh/PAPERS/Zhu14c.pdf",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Zhu14c.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	project = "ant, lacrend, tdns",
        blogurl = "https://ant.isi.edu/blog/?p=546",
	abstract = "As adoption of DNS Security Extensions (DNSSEC) grows, DNS-based
Authentication of Named Entities (DANE) provides an alternative to
traditional CA-based certificate authentication.  The DANE TLSA
protocol specification was published in 2012.  It's generally unknown
to the DNS community how widely DANE TLSA has been deployed and how
TLSA records are used.   In this talk, we present a survey of current
deployment of DANE TLSA.  We developed PryDane, a tool for actively
probing names possibly having TLSA records validating those records
with the server certificates.  Based on the data we collected, we
conclude that DANE TLSA is not widely deployed at this time.  Our
probing data shows the most common (more than 80\%) usage of TLSA record is:
domain-issued cert matching full cert with SHA-256.  Our validation
results show there are consistently about 7\%--10\% of DANE-enabled
names having invalid TLSA records.  We explored the reasons for
these mismatches, such as wrong certs and incorrect parameters in
TLSA records.",
}

As adoption of DNS Security Extensions (DNSSEC) grows, DNS-based Authentication of Named Entities (DANE) provides an alternative to traditional CA-based certificate authentication. The DANE TLSA protocol specification was published in 2012. It's generally unknown to the DNS community how widely DANE TLSA has been deployed and how TLSA records are used. In this talk, we present a survey of current deployment of DANE TLSA. We developed PryDane, a tool for actively probing names possibly having TLSA records validating those records with the server certificates. Based on the data we collected, we conclude that DANE TLSA is not widely deployed at this time. Our probing data shows the most common (more than 80%) usage of TLSA record is: domain-issued cert matching full cert with SHA-256. Our validation results show there are consistently about 7%–10% of DANE-enabled names having invalid TLSA records. We explored the reasons for these mismatches, such as wrong certs and incorrect parameters in TLSA records.

@inproceedings{wu14:iui,
    author = "Bo Wu and Pedro Szekely and Craig A. Knoblock",
    title = "Minimizing User Effort in Transforming Data by Example",
    booktitle = "{Proceedings of the International Conference on Intelligent User Interface}",
    year = "2014",
    urlPaper= "http://usc-isi-i2.github.io/papers/wu14-iui.pdf",
    urlPoster= "http://usc-isi-i2.github.io/slides/wu14-iui-poster.pdf",
    urlVideo="http://www.youtube.com/watch?v=Qmu8gZJo7jo",
    Keywords = {"Data Cleaning"}}
    

@misc{cho2014mixed,
  title={Mixed Membership Blockmodels for Dynamic Networks with Feedback.},
  author={Cho, Yoon-Sik and Ver Steeg, Greg and Galstyan, Aram},
  year={2014}
}

@inproceedings{Xiao2014ModelingTherapistEmpathythrough,
 author = {Xiao, Bo and Bone, Daniel and Van Segbroeck, Maarten and Imel, Zac E. and Atkins, David and Georgiou, Panayiotis and Narayanan, Shrikanth},
 bib2html_rescat = {bsp, aaa},
 booktitle = {Proceedings of Interspeech},
 link = {http://sail.usc.edu/publications/files/xiao2014_modeling-therap.pdf},
 month = {Sep},
 title = {Modeling Therapist  Empathy through Prosody in Drug Addiction Counseling},
 year = {2014}
}

@article{raghavan2014modeling,
  title={Modeling temporal activity patterns in dynamic social networks},
  author={Raghavan, Vasanthan and Ver Steeg, Greg and Galstyan, Aram and Tartakovsky, Alexander G},
  journal={IEEE Transactions on Computational Social Systems},
  volume={1},
  number={1},
  pages={89--107},
  year={2014},
  publisher={IEEE}
}

@inproceedings{Travadi2014Modified-priori-VectorEstimation,
 author = {Travadi, Ruchir and Van Segbroeck, Maarten and Narayanan, Shrikanth},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of Interspeech},
 link = {http://sail.usc.edu/publications/files/interspeech_paper_submitted_ruchir.pdf},
 month = {Sep},
 title = {Modified- prior i-Vector Estimation for Language Identification of Short Duration Utterances},
 year = {2014}
}

@inproceedings{Ramanarayanan2014Motorcontrolprimitivesarising,
 author = {Ramanarayanan, Vikram and Goldstein, Louis and Narayanan, Shrikanth},
 bib2html_rescat = {span},
 booktitle = {Proceedings of Interspeech},
 doi = {https://doi.org/10.1121/1.4831280},
 link = {http://sail.usc.edu/publications/files/control_primitives_LD_IS2014.pdf},
 month = {Sep},
 title = {Motor  control primitives arising from a learned dynamical systems model of speech  articulation},
 year = {2014}
}

@article{KocarnikPendergrassCartyEtAl2014,
	abstract = {C-reactive protein (CRP) is a biomarker of inflammation. Genome-wide association studies ({GWAS}) have identified single-nucleotide polymorphisms (SNPs) associated with CRP concentrations and inflammation-related traits such as cardiovascular disease, type 2 diabetes mellitus, and obesity. We aimed to replicate previous CRP-{SNP} associations, assess whether these associations generalize to additional race/ethnicity groups, and evaluate inflammation-related SNPs for a potentially pleiotropic association with CRP. We selected and analyzed 16 CRP-associated and 250 inflammation-related {GWAS} SNPs among 40 473 African American, American Indian, Asian/Pacific Islander, European American, and Hispanic participants from 7 studies collaborating in the {Population Architecture using Genomics and Epidemiology} (PAGE) study. Fixed-effect meta-analyses combined study-specific race/ethnicity-stratified linear regression estimates to evaluate the association between each {SNP} and high-sensitivity CRP. Overall, 18 SNPs in 8 loci were significantly associated with CRP (Bonferroni-corrected P<3.1×10(-3) for replication, P<2.0×10(-4) for pleiotropy): Seven of these were specific to European Americans, while 9 additionally generalized to African Americans (1), Hispanics (5), or both (3); 1 {SNP} was seen only in African Americans and Hispanics. Two SNPs in the CELSR2/PSRC1/SORT1 locus showed a potentially novel association with CRP: rs599839 (P=2.0×10(-6)) and rs646776 (P=3.1×10(-5)). We replicated 16 {SNP}-CRP associations, 10 of which generalized to African Americans and/or Hispanics. We also identified potentially novel pleiotropic associations with CRP for two SNPs previously associated with coronary artery disease and/or low-density lipoprotein-cholesterol. These findings demonstrate the benefit of evaluating genotype-phenotype associations in multiple race/ethnicity groups and looking for pleiotropic relationships among SNPs previously associated with related phenotypes.},
	author = {Kocarnik, Jonathan M. and Pendergrass, Sarah A. and Carty, Cara L. and Pankow, James S. and Schumacher, Fredrick R. and Cheng, Iona and Durda, Peter and Ambite, Jos{\'e} Luis and Deelman, Ewa and Cook, Nancy R. and Liu, Simin and Wactawski-Wende, Jean and Hutter, Carolyn and Brown-Gentry, Kristin and Wilson, Sarah and Best, Lyle G. and Pankratz, Nathan and Hong, Ching-Ping and Cole, Shelley A. and Voruganti, V. Saroja and B{\r u}{\v z}kova, Petra and Jorgensen, Neal W. and Jenny, Nancy S. and Wilkens, Lynne R. and Haiman, Christopher A. and Kolonel, Laurence N. and Lacroix, Andrea and North, Kari and Jackson, Rebecca and Le Marchand, Loic and Hindorff, Lucia A. and Crawford, Dana C. and Gross, Myron and Peters, Ulrike},
	chemicals = {C-Reactive Protein},
	citation-subset = {IM},
	completed = {2015-03-09},
	country = {United States},
	doi = {10.1161/CIRCGENETICS.113.000173},
	issn = {1942-3268},
	issn-linking = {1942-3268},
	issue = {2},
	journal = {Circulation. Cardiovascular genetics},
	keywords = {Adult; African Continental Ancestry Group, genetics; Aged; Asian Continental Ancestry Group, genetics; C-Reactive Protein, metabolism; Female; Genetic Variation; Genome-Wide Association Study; Hispanic Americans, genetics; Humans; Indians, North American, genetics; Inflammation, blood, epidemiology, ethnology, genetics; Male; Middle Aged; Polymorphism, Single Nucleotide; United States, epidemiology; Young Adult; C-reactive protein; continental population groups; ethnic groups; genetic pleiotropy; inflammation; molecular epidemiology; polymorphism, single nucleotide},
	mid = {NIHMS575195},
	month = apr,
	nlm-id = {101489144},
	owner = {NLM},
	pages = {178--188},
	pii = {CIRCGENETICS.113.000173},
	pmc = {PMC4104750},
	pmid = {24622110},
	url = {https://pubmed.ncbi.nlm.nih.gov/24622110/},

	pubmodel = {Print-Electronic},
	pubstate = {ppublish},
	revised = {2019-12-20},
	title = {Multiancestral analysis of inflammation-related genetic variants and {C}-reactive protein in the {Population Architecture using Genomics and Epidemiology} study.},
	volume = {7},
	year = {2014},
	bdsk-url-1 = {https://pubmed.ncbi.nlm.nih.gov/24622110/},
	bdsk-url-2 = {https://doi.org/10.1161/CIRCGENETICS.113.000173}}

C-reactive protein (CRP) is a biomarker of inflammation. Genome-wide association studies (GWAS) have identified single-nucleotide polymorphisms (SNPs) associated with CRP concentrations and inflammation-related traits such as cardiovascular disease, type 2 diabetes mellitus, and obesity. We aimed to replicate previous CRP-SNP associations, assess whether these associations generalize to additional race/ethnicity groups, and evaluate inflammation-related SNPs for a potentially pleiotropic association with CRP. We selected and analyzed 16 CRP-associated and 250 inflammation-related GWAS SNPs among 40 473 African American, American Indian, Asian/Pacific Islander, European American, and Hispanic participants from 7 studies collaborating in the Population Architecture using Genomics and Epidemiology (PAGE) study. Fixed-effect meta-analyses combined study-specific race/ethnicity-stratified linear regression estimates to evaluate the association between each SNP and high-sensitivity CRP. Overall, 18 SNPs in 8 loci were significantly associated with CRP (Bonferroni-corrected P<3.1×10(-3) for replication, P<2.0×10(-4) for pleiotropy): Seven of these were specific to European Americans, while 9 additionally generalized to African Americans (1), Hispanics (5), or both (3); 1 SNP was seen only in African Americans and Hispanics. Two SNPs in the CELSR2/PSRC1/SORT1 locus showed a potentially novel association with CRP: rs599839 (P=2.0×10(-6)) and rs646776 (P=3.1×10(-5)). We replicated 16 SNP-CRP associations, 10 of which generalized to African Americans and/or Hispanics. We also identified potentially novel pleiotropic associations with CRP for two SNPs previously associated with coronary artery disease and/or low-density lipoprotein-cholesterol. These findings demonstrate the benefit of evaluating genotype-phenotype associations in multiple race/ethnicity groups and looking for pleiotropic relationships among SNPs previously associated with related phenotypes.

@inproceedings{Gupta2014Multimodalpredictionofaffective,
 author = {Gupta, Rahul and Malandrakis, Nikolaos and Xiao, Bo and Guha, Tanaya and Van Segbroeck, Maarten and Black, Matthew P. and Potamianos, Alexandros and Narayanan, Shrikanth},
 bib2html_rescat = {bsp, emotion},
 booktitle = {4th International Workshop on Audio/Visual Emotion Challenge},
 doi = {10.1145/2661806.2661810},
 link = {http://sail.usc.edu/publications/files/guptaacm2014.pdf},
 location = {Orlando},
 pages = {33-40},
 publisher = {ACM},
 title = {Multimodal prediction of affective dimensions and depression in human-computer interactions},
 year = {2014}
}

@inproceedings{Kooti14icwsm,
    abstract = {Social networks have many counter-intuitive properties, including the
"friendship paradox" that states, on average, your friends have more friends
than you do. Recently, a variety of other paradoxes were demonstrated in online
social networks. This paper explores the origins of these network paradoxes.
Specifically, we ask whether they arise from mathematical properties of the
networks or whether they have a behavioral origin. We show that sampling from
heavy-tailed distributions always gives rise to a paradox in the mean, but not
the median. We propose a strong form of network paradoxes, based on utilizing
the median, and validate it empirically using data from two online social
networks. Specifically, we show that for any user the majority of user's
friends and followers have more friends, followers, etc. than the user, and
that this cannot be explained by statistical properties of sampling. Next, we
explore the behavioral origins of the paradoxes by using the shuffle test to
remove correlations between node degrees and attributes. We find that paradoxes
for the mean persist in the shuffled network, but not for the median. We
demonstrate that strong paradoxes arise due to the assortativity of user
attributes, including degree, and correlation between degree and attribute.},
    author = {Kooti, Farshad and Hodas, Nathan O. and Lerman, Kristina},
    booktitle = {International Conference on Weblogs and Social Media (ICWSM)},
    keywords = {social-networks},
    month = mar,
    title = {Network Weirdness: Exploring the Origins of Network Paradoxes},
    url = {http://arxiv.org/abs/1403.7242},
    year = {2014},
    urlBlog={http://crowdresearch.org/blog/?p=8749}
}

Social networks have many counter-intuitive properties, including the "friendship paradox" that states, on average, your friends have more friends than you do. Recently, a variety of other paradoxes were demonstrated in online social networks. This paper explores the origins of these network paradoxes. Specifically, we ask whether they arise from mathematical properties of the networks or whether they have a behavioral origin. We show that sampling from heavy-tailed distributions always gives rise to a paradox in the mean, but not the median. We propose a strong form of network paradoxes, based on utilizing the median, and validate it empirically using data from two online social networks. Specifically, we show that for any user the majority of user's friends and followers have more friends, followers, etc. than the user, and that this cannot be explained by statistical properties of sampling. Next, we explore the behavioral origins of the paradoxes by using the shuffle test to remove correlations between node degrees and attributes. We find that paradoxes for the mean persist in the shuffled network, but not for the median. We demonstrate that strong paradoxes arise due to the assortativity of user attributes, including degree, and correlation between degree and attribute.

@misc{collins2014network,
  title={Network security through data analysis: building situational awareness},
  author={Collins, Michael and Collins, Michael S},
  year={2014},
  publisher={" O'Reilly Media, Inc."}
}

@InProceedings{Monson2014,
  author       = {Monson, Joshua S and Hutchings, Brad},
  title        = {New approaches for in-system debug of behaviorally-synthesized FPGA circuits},
  booktitle    = {Field Programmable Logic and Applications (FPL), 2014 24th International Conference on},
  year         = {2014},
  pages        = {1--6},
  organization = {IEEE},
  month = sep,
  doi          = {10.1109/FPL.2014.6927495}
}

@conference {7337,
	title = {OSDC BigDataBus: Towards an Unified Architecture for Scientific Data Aggregation - Poster},
	booktitle = {XSEDE14 Conference},
	year = {2014},
	month = {07/2014},
	address = {Atlanta, Georgia},
	url = {https://urldefense.com/v3/__https://www.xsede.org/web/conference/posters__;!!FjuHKAHQs5udqho!OrfqNEjI8IYnpYEY3Wc7S4oSY6Kf82MHM8jGAJar7qa8MoXzNwtTTC2HiJsVSREP5YicoFyUQE2tuQ$ },
	author = {Pedro Bello-Maldonado and Ana Oprescu and Paola Grosso and Heidi Alvarez and Indira Gutierrez}
}

@article{Sarkar2014Occlusion-,
	abstract = {Occlusion edges in images which correspond to range discontinuity in the scene from the point of view of the observer are an important prerequisite for many vision and mobile robot tasks. Although they can be extracted from range data however extracting them from images and videos would be extremely beneficial. We trained a deep convolutional neural network (CNN) to identify occlusion edges in images and videos with both RGB-D and RGB inputs. The use of CNN avoids hand-crafting of features for automatically isolating occlusion edges and distinguishing them from appearance edges. Other than quantitative occlusion edge detection results, qualitative results are provided to demonstrate the trade-off between high resolution analysis and frame-level computation time which is critical for real-time robotics applications.},
	author = {Sarkar, Soumik and Venugopalan Vivek and Reddy, Kishore and Giering, Michael and Ryde, Julian and Jaitly,Navdeep},
	date-added = {2020-01-20 18:26:26 -0500},
	date-modified = {2020-01-20 18:26:26 -0500},
	eprint = {1412.7007},
	month = dec,
	year = {2014},
	title = {{Occlusion Edge Detection in RGB-D Frames Using Deep Convolutional Networks}},
	url = {http://arxiv.org/abs/1412.7007},
	Bdsk-Url-1 = {http://arxiv.org/abs/1412.7007}}

Occlusion edges in images which correspond to range discontinuity in the scene from the point of view of the observer are an important prerequisite for many vision and mobile robot tasks. Although they can be extracted from range data however extracting them from images and videos would be extremely beneficial. We trained a deep convolutional neural network (CNN) to identify occlusion edges in images and videos with both RGB-D and RGB inputs. The use of CNN avoids hand-crafting of features for automatically isolating occlusion edges and distinguishing them from appearance edges. Other than quantitative occlusion edge detection results, qualitative results are provided to demonstrate the trade-off between high resolution analysis and frame-level computation time which is critical for real-time robotics applications.

@inproceedings{DBLP:conf/semweb/KejriwalM14,
  author    = {Mayank Kejriwal and
               Daniel P. Miranker},
  editor    = {Matthew Horridge and
               Marco Rospocher and
               Jacco van Ossenbruggen},
  title     = {On Linking Heterogeneous Dataset Collections},
  booktitle = {Proceedings of the {ISWC} 2014 Posters {\&} Demonstrations Track a
               track within the 13th International Semantic Web Conference, {ISWC}
               2014, Riva del Garda, Italy, October 21, 2014},
  series    = {{CEUR} Workshop Proceedings},
  volume    = {1272},
  pages     = {217--220},
  publisher = {CEUR-WS.org},
  year      = {2014},
  url       = {http://ceur-ws.org/Vol-1272/paper\_17.pdf},
  timestamp = {Tue, 07 Sep 2021 13:47:43 +0200},
  biburl    = {https://dblp.org/rec/conf/semweb/KejriwalM14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{conf/atal/AbeliukBH14,
  added-at = {2014-09-25T00:00:00.000+0200},
  author = {Abeliuk, Andr{\'{e}}s and Berbeglia, Gerardo and Hentenryck, Pascal Van},
  biburl = {https://www.bibsonomy.org/bibtex/20aae72ad9b129a6c76cdb4e57e44df5a/dblp},
  booktitle = {AAMAS},
  crossref = {conf/atal/2014},
  editor = {Bazzan, Ana L. C. and Huhns, Michael N. and Lomuscio, Alessio and Scerri, Paul},
  ee = {http://dl.acm.org/citation.cfm?id=2616041},
  interhash = {f569a85e77276e361214907e5837a42d},
  intrahash = {0aae72ad9b129a6c76cdb4e57e44df5a},
  isbn = {978-1-4503-2738-1},
  keywords = {dblp},
  pages = {1519-1520},
  publisher = {IFAAMAS/ACM},
  timestamp = {2015-04-28T17:57:34.000+0200},
  title = {One-way games.},
  url = {http://dl.acm.org/citation.cfm?id=2616041},
  month = may,
  year = 2014
}

@misc{ ogc-prov-report-14,
  title = {Open Geospatial Consortium Testbed 10 Provenance Engineering Report},
  author = {Joan Maso and Guillem Closa and Yolanda Gil and Benjamin Pross},
  note = {Open Geospatial Consortium (OGC) Technical Report 14-001},
  year = {2014},
  url = {https://portal.opengeospatial.org/files/?artifact_id=58967}
}

@conference {7338,
	title = {Openwave: Collaboration Between Industry and Government},
	booktitle = {Managing Critical Infrastructure in a Changing Natural and Socio-Economic Environment, 2014 ICPC Plenary Meeting},
	year = {2014},
	month = {03/2014},
	address = {Dubai},
	author = {Heidi Alvarez and Donald A. Cox and Julio Ibarra}
}

@article{allahverdyan2014opinion,
  title={Opinion dynamics with confirmation bias},
  author={Allahverdyan, Armen E and Galstyan, Aram},
  journal={PloS one},
  volume={9},
  number={7},
  pages={e99557},
  year={2014},
  publisher={Public Library of Science}
}

@article{woo2014optimal,
  title={Optimal Application Allocation on Multiple Public Clouds},
  author={Woo, Simon S and Mirkovic, Jelena},
  journal={Computer Networks},
  year={2014},
  publisher={Elsevier}
}

@Article{konstantinidis2014:pvldb,
  author = 	 {George Konstantinidis and Jos\'{e} Luis Ambite},
  title = 	 {Optimizing the Chase: Scalable Data Integration under Constraints},
  journal = 	 {PVLDB},
  year = 	 {2014},
  volume = 	 {7},
  number = 	 {14},
  pages = 	 {1869-1880},
}

@article{ver2014phase,
  title={Phase transitions in community detection: A solvable toy model},
  author={Ver Steeg, Greg and Moore, Cristopher and Galstyan, Aram and Allahverdyan, Armen},
  journal={EPL (Europhysics Letters)},
  volume={106},
  number={4},
  pages={48004},
  year={2014},
  publisher={IOP Publishing}
}

@INPROCEEDINGS{Intagorn14acmgis,
  AUTHOR =       {Suradej Intagorn and Kristina Lerman},
  TITLE =        {Placing User-generated Content on the Map with Confidence},
  BOOKTITLE =    {ACM GIS},
  YEAR =         {2014},
  abstract =     {We describe a method that predicts the location of user-generated
content using textual features alone. Unlike previous methods for
geotagging text documents, our proposed method is not sensitive
to how we discretize space. We also discover that spatial resolu-
tion has an impact on the prediction accuracy, which allows us to
trade-off the spatial resolution of the predicted location against our
confidence about its accuracy. Our method can be used to estimate
the error in document�s predicted location, enabling us to filter out
poor quality predictions. We evaluate the proposed method exten-
sively on user-generated content collected from two different social
media sites, Flickr and Twitter. Our evaluation examines its perfor-
mance on the geotagging task and with respect to different parame-
ters. We achieve state-of-the-art results for all three tasks: location
prediction, error estimation and result ranking and also provide a
theoretical explanation of the effect of spatial resolution factor on
geotagging accuracy. Our findings provide valuable insights into
the design of geotagging systems and their quality control.},
  keywords =     {social-annotation},
  url={http://www.isi.edu/integration/people/lerman/papers/Intagorn14acmgis.pdf}
}

We describe a method that predicts the location of user-generated content using textual features alone. Unlike previous methods for geotagging text documents, our proposed method is not sensitive to how we discretize space. We also discover that spatial resolu- tion has an impact on the prediction accuracy, which allows us to trade-off the spatial resolution of the predicted location against our confidence about its accuracy. Our method can be used to estimate the error in document�s predicted location, enabling us to filter out poor quality predictions. We evaluate the proposed method exten- sively on user-generated content collected from two different social media sites, Flickr and Twitter. Our evaluation examines its perfor- mance on the geotagging task and with respect to different parame- ters. We achieve state-of-the-art results for all three tasks: location prediction, error estimation and result ranking and also provide a theoretical explanation of the effect of spatial resolution factor on geotagging accuracy. Our findings provide valuable insights into the design of geotagging systems and their quality control.

@inproceedings{DBLP:conf/semweb/Kejriwal14,
  author    = {Mayank Kejriwal},
  editor    = {Peter Mika and
               Tania Tudorache and
               Abraham Bernstein and
               Chris Welty and
               Craig A. Knoblock and
               Denny Vrandecic and
               Paul Groth and
               Natasha F. Noy and
               Krzysztof Janowicz and
               Carole A. Goble},
  title     = {Populating Entity Name Systems for Big Data Integration},
  booktitle = {The Semantic Web - {ISWC} 2014 - 13th International Semantic Web Conference,
               Riva del Garda, Italy, October 19-23, 2014. Proceedings, Part {II}},
  series    = {Lecture Notes in Computer Science},
  volume    = {8797},
  pages     = {521--528},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-319-11915-1\_34},
  doi       = {10.1007/978-3-319-11915-1\_34},
  timestamp = {Tue, 07 Sep 2021 13:48:13 +0200},
  biburl    = {https://dblp.org/rec/conf/semweb/Kejriwal14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Xiao2014PSAHeadMotion,
 author = {Xiao, Bo and Georgiou, Panayiotis and Baucom, Brian and Narayanan, Shrikanth},
 bib2html_rescat = {bsp},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2014.6854472},
 link = {http://sail.usc.edu/publications/files/xiao_icassp_2017.pdf},
 location = {Florence, Italy},
 month = {May},
 title = {Power-Spectral Analysis of Head Motion Signal for Behavioral Modeling in Human Interaction},
 year = {2014}
}

@TechReport{	  juve2014monitoring,
  Author	= {Gideon Juve and Benjamin Tovar and Ferreira da Silva,
		  Rafael and Casey Robinson and Douglas Thain and Ewa Deelman
		  and William Allcock and Miron Livny},
  URL		= {http://pegasus.isi.edu/publications/2014/2014-dvdtreport.pdf},
  Title		= {Practical Resource Monitoring for Robust High Throughput
		  Computing},
  Institution	= {University of Southern California},
  Number	= {Technical Report 14-950},
  Year		= {2014},
  Note		= {Funding Acknowledgments: DOE contract for dv/dt ER26110}
}

@inproceedings{Gupta2014PredictingClientsinclinationtowards,
 author = {Gupta, Rahul and Georgiou, Panayiotis and Atkins, David and Narayanan, Shrikanth},
 bib2html_rescat = {bsp},
 booktitle = {Proceedings of Interspeech},
 doi = {},
 link = {http://sail.usc.edu/publications/files/bi_modelling.pdf},
 month = {Sep},
 title = {Predicting Clients inclination towards Target Behavior Change in  Motivational Interviewing and investigating the role of laughter},
 year = {2014}
}

@inproceedings{pujara:baylearn14,
    Author = "Pujara, Jay and Murphy, Kevin and Dong, Xin Luna and Janssen, Curtis",
    Booktitle = "Bay Area Machine Learning Symposium",
    Title = "{Probabilistic Models for Collective Entity Resolution Between Knowledge Graphs}",
    Year = "2014",
    bib_url = "/pubs/bib/pujara-baylearn14.bib",
    pdf_url = "/pubs/2014/pujara-baylearn14/pujara-baylearn14.pdf",
    sec = "ws"
}

@article{lin_probabilistic_2014,
	title = {Probabilistic sequence alignment of stratigraphic records},
	volume = {29},
	url = {https://github.com/khider/khider.github.io/blob/master/papers/Lin%20et%20al._2014_Paleoceanography.pdf},
	doi = {10.1002/2014PA002713},
	number = {10},
	journal = {Paleoceanography},
	author = {Lin, Luan and Khider, Deborah and Lisiecki, Lorraine E and Lawrence, Charles E},
	year = {2014},
	pages = {976--989},
}

@article{maleshkova2014proceedings,
  title={Proceedings of the Second Workshop on Services and Applications over Linked APIs and Data},
  author={Maleshkova, Maria and Verborgh, Ruben and Stadtm{\"u}ller, Steffen and Szekely, Pedro},
  year={2014}
}

@article{szekely2014publishing,
  title={Publishing the Data of the Smithsonian American Art Museum to the Linked Data Cloud},
  author={Szekely, Pedro and Knoblock, Craig A and Yang, Fengyu and Fink, Eleanor E and Gupta, Shubham and Allen, Rachel and Goodlander, Georgina},
  journal={International Journal of Humanities and Arts Computing},
  volume={8},
  number={supplement},
  pages={152--166},
  year={2014},
  publisher={Edinburgh University Press 22 George Square, Edinburgh EH8 9LF UK}
}

@article{szekely14:ijhac,
  title = {Publishing the Data of the Smithsonian American Art Museum to the Linked Data Cloud},
  author = {Pedro Szekely and Craig A. Knoblock and Fengyu Yang and Xuming Zhu and Eleanor Fink and Rachel Allen and Georgina Goodlander},
  journal = {International Journal of Humanities and Art Computing (IJHAC)},
  year = {2014},
  mont = {March},
  volume=8,
  pages={152-166},
  urlPaper= "http://usc-isi-i2.github.io/papers/szekely14-ijhac.pdf",
  urlLink="http://www.euppublishing.com/doi/abs/10.3366/ijhac.2014.0104"
}

@article{Narayanan2014Real-timemagneticresonanceimaging,
 author = {Narayanan, Shrikanth S. and Toutios, Asterios and Ramanarayanan, Vikram and Lammert, Adam and Kim, Jangwon and Lee, Sungbok and Nayak, Krishna S. and Kim, Yoon-Chul and Zhu, Yinghua and Goldstein, Louis and Byrd, Dani and Bresch, Erik and Ghosh, Prasanta Kumar and Katsamanis, Athanasios and Proctor, Michael I.},
 bib2html_rescat = {span},
 doi = {dx.doi.org/10.1121/1.4890284},
 journal = {J. Acoust. Soc. Am.},
 link = {http://sail.usc.edu/publications/files/14890284.pdf},
 month = {Sep},
 number = {3},
 pages = {1307-1311},
 title = {Real-time magnetic resonance imaging and electromagnetic articulography database for speech production research (TC)},
 volume = {136},
 year = {2014}
}

@article{kocarnik2014:id,
  author = 	 {Kocarnik, Jonathan M AND Park, S Lani AND Han, Jiali AND Dumitrescu, Logan AND Cheng, Iona AND Wilkens, Lynne R AND Schumacher, Fredrick R AND Kolonel, Laurence AND Carlson, Chris S AND Crawford, Dana C AND Goodloe, Robert J AND Dilks, Holli AND Baker, Paxton AND Richardson, Danielle AND Ambite, Jos\'{e} Luis AND Song, Fengju AND Quresh, Abrar A AND Zhang, Mingfeng AND Duggan, David AND Hutter, Carolyn AND Hindorff, Lucia A AND Bush, William S AND Kooperberg, Charles AND Le Marchand, Loic AND Peters, Ulrike},
  title = 	 {{Replication of Associations Between GWAS SNPs and Melanoma Risk in the Population Architecture Using Genomics and Epidemiology (PAGE) Study}},
  journal = 	 {Journal of Investigative Dermatology},
  year = 	 {2014},
  volume = 	 {134},
  number = 	 {7},
  pages =        {2049--52},
  note = 	 {doi: 10.1038/jid.2014.53},
}

@ARTICLE{Ghosh14dcds,
  AUTHOR =       {Rumi Ghosh and Kristina Lerman},
  TITLE =        {Rethinking Centrality: The Role of Dynamical Processes in Social Network Analysis},
  JOURNAL =      {Discrete and Continuous Dynamical Systems Series B},
  YEAR =         {2014},
  volume =       {19},
  number =       {5},
  pages =        {1355 -- 1372},
  month =        {July},
  note =         {},
  abstract =     {Many popular measures used in social network analysis, including
centrality, are based on the random walk. The random walk is a model of a
stochastic process where a node interacts with one other node at a time. How-
ever, the random walk may not be appropriate for modeling social phenomena,
including epidemics and information diffusion, in which one node may interact
with many others at the same time, for example, by broadcasting the virus or
information to its neighbors. To produce meaningful results, social network
analysis algorithms have to take into account the nature of interactions be-
tween the nodes. In this paper we classify dynamical processes as conservative
and non-conservative and relate them to well-known measures of centrality
used in network analysis: PageRank and Alpha-Centrality. We demonstrate,
by ranking users in online social networks used for broadcasting information,
that non-conservative Alpha-Centrality generally leads to a better agreement
with an empirical ranking scheme than the conservative PageRank. http://arxiv.org/abs/1209.4616},
  keywords =     {social-networks},
    url = {http://aimsciences.org/journals/displayArticlesnew.jsp?paperID=9862},
}

Many popular measures used in social network analysis, including centrality, are based on the random walk. The random walk is a model of a stochastic process where a node interacts with one other node at a time. How- ever, the random walk may not be appropriate for modeling social phenomena, including epidemics and information diffusion, in which one node may interact with many others at the same time, for example, by broadcasting the virus or information to its neighbors. To produce meaningful results, social network analysis algorithms have to take into account the nature of interactions be- tween the nodes. In this paper we classify dynamical processes as conservative and non-conservative and relate them to well-known measures of centrality used in network analysis: PageRank and Alpha-Centrality. We demonstrate, by ranking users in online social networks used for broadcasting information, that non-conservative Alpha-Centrality generally leads to a better agreement with an empirical ranking scheme than the conservative PageRank. http://arxiv.org/abs/1209.4616

@inproceedings{Ganapathy2014RobustLanguageIdentificationUsing,
 author = {Ganapathy, Sriram and Han, Kyu Jeong and Samuel, Thomas and Omar, Mohamed K. and Van Segbroeck, Maarten and Narayanan, Shrikanth},
 bib2html_rescat = {rats},
 booktitle = {Proceedings  of Interspeech},
 link = {http://sail.usc.edu/publications/files/ganapathy_interspeech_14.pdf},
 month = {Sep},
 title = {Robust Language Identification Using Convolutional Neural Network Features},
 year = {2014}
}

@article{kotru2014robust,
  title={Robust Ramsey sequences with Raman adiabatic rapid passage},
  author={Kotru, Krish and Brown, Justin M and Butts, David L and Kinast, Joseph M and Stoner, Richard E},
  journal={Physical Review A},
  volume={90},
  number={5},
  pages={053611},
  year={2014},
  publisher={APS}
}

@article{Bone2014RobustUnsupervisedArousalRating:,
 author = {Bone, Daniel and Lee, Chi-Chun and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 doi = {10.1109/TAFFC.2014.2326393},
 journal = {IEEE Transactions on Affective Computing},
 link = {http://sail.usc.edu/publications/files/bone_ieeetaffc_2014.pdf},
 month = {Apr},
 number = {1},
 pages = {201-213},
 title = {Robust Unsupervised Arousal Rating: A rule-based framework with knowledge-inspired vocal features},
 volume = {5},
 year = {2014}
}

@article{Kumar2014Robustobjectclassificationin,
 author = {Kumar, Naveen and Mitra, Urbashi and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 doi = {https://doi.org/10.1109/joe.2014.2344971},
 journal = {IEEE Journal of Oceanic Engineering},
 title = {Robust object classification in underwater sidescan sonar images by using reliability aware fusion of shadow features},
 year = {2014}
}

@inproceedings{Zervanou2014SAIL-GRS:GrammarInductionfor,
 author = {Zervanou, Kalliopi and Malandrakis, Nikolaos and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of SemEval 2014},
 doi = {https://doi.org/10.3115/v1/s14-2088},
 link = {http://sail.usc.edu/publications/files/semeval2014_gr.pdf},
 location = {Dublin, Ireland},
 month = {Aug},
 title = {SAIL-GRS: Grammar Induction for Spoken Dialogue Systems using CF-IRF Rule Similarity},
 year = {2014}
}

@inproceedings{Mal2014SAIL:SentimentAnalysisusing,
 author = {Malandrakis, Nikolaos and Falcone, Michael and Vaz, Colin and Bisogni, Jesse and Potamianos, Alexandros and Narayanan, Shrikanth S.},
 booktitle = {Proceedings of SemEval 2014},
 keyword = {emotion},
 link = {http://sail.usc.edu/publications/files/semeval2014.pdf},
 location = {Dublin, Ireland},
 month = {Aug},
 title = {SAIL: Sentiment Analysis using Semantic Similarity and Contrast Features},
 year = {2014}
}

@inproceedings{yu2014senss,
  title={SENSS: Software Defined Security Service},
  author={Yu, Minlan and Zhang, Ying and Mirkovic, Jelena and Alwabel, Abdulla},
  booktitle={Open Networking Summit (ONS 2014)},
  year={2014}
}

@inproceedings{alwabel2014safe,
  title={Safe and automated live malware experimentation on public testbeds},
  author={Alwabel, Abdulla and Shi, Hao and Bartlett, Genevieve and Mirkovic, Jelena},
  booktitle={7th Workshop on Cyber Security Experimentation and Test (CSET 14)},
  year={2014}
}

@inproceedings{sankaran2014scheduling,
  title={Scheduling in data center networks with optical traffic grooming},
  author={Sankaran, Ganesh C and Sivalingam, Krishna M},
  booktitle={2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)},
  pages={179--184},
  year={2014},
  organization={IEEE}
}

@inproceedings{DBLP:conf/ssdbm/TianKM14,
  author    = {Aibo Tian and
               Mayank Kejriwal and
               Daniel P. Miranker},
  editor    = {Christian S. Jensen and
               Hua Lu and
               Torben Bach Pedersen and
               Christian Thomsen and
               Kristian Torp},
  title     = {Schema matching over relations, attributes, and data values},
  booktitle = {Conference on Scientific and Statistical Database Management, {SSDBM}
               '14, Aalborg, Denmark, June 30 - July 02, 2014},
  pages     = {28:1--28:12},
  publisher = {{ACM}},
  year      = {2014},
  url       = {https://doi.org/10.1145/2618243.2618248},
  doi       = {10.1145/2618243.2618248},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/ssdbm/TianKM14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@InProceedings{wang2014, 
  author = 	 {L Wang and KI Alpert and V Calhoun and D Keator and M King and A Kogan and D Landis and M Tallis and SG Potkin and JA Turner and JL Ambite},
  title = 	 {SchizConnect: Large-Scale Schizophrenia Neuroimaging Data Integration and Sharing},
  booktitle = {Annual Meeting of the American College of Neuropsychopharmacology (ACNP)},
  year = 	 {2014},
  address = 	 {Phoenix, Arizona},
  note = 	 {Abstract+Poster},
}

@inproceedings{Prasad2014Selectionofoptimalvocal,
 author = {Prasad, Abhay and Ghosh, Prasanta Kumar and Narayanan, Shrikanth},
 bib2html_rescat = {span},
 booktitle = {Proceedings of Interspeech},
 keyword = {SPAN},
 month = {Sep},
 title = {Selection of optimal vocal tract regions using real-time magnetic resonance imaging for robust voice activity detection},
 year = {2014}
}

@inproceedings{Audhkhasi2014SemiSupervisedTW,
 author = {Audhkhasi, Kartik and Sethy, Abhinav and Ramabhadran, Bhuvana and Narayanan, Shrikanth},
 bib2html_rescat = {span},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2014.6855132},
 link = {http://sail.usc.edu/publications/files/p7919-audhkhasi.pdf},
 location = {Florence, Italy},
 month = {May},
 title = {Semi-supervised term-weighted value rescoring for keyword search},
 year = {2014}
}

@misc{sankaran2014service,
  title={Service directory for quick and simplified application identification},
  author={Sankaran, Ganesh Chennimalai and Karthikeyan, Krishnamoorthy},
  year={2014},
  month=sep # "~18",
  note={US Patent 10,608,899}
}

@Misc{Heidemann14b,
	author = 	"John Heidemann",
	title = 	"Sharing Network Data: Bright Gray Days Ahead",
	howpublished = "Keynote talk at Passive and Active
                  Measurements Conference",
	month = 	mar,
	year = 	2014,
	sortdate = 	"2014-03-01",
	project = "ant, lacrend",
	jsubject = "network_observation",
	jlocation = 	"johnh: pafile",
	keywords = 	"data sharing, predict, lander, lacrend, keynote",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann14b.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann14b.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
Sharing data is what we expect as a community.  From the IMC best
paper award requiring a public dataset to NSF data management plans,
we know that data is crucial to reproducible science.  Yet privacy
concerns today make data acquisition difficult and sharing harder
still.  AOL and Netflix have released anonymized datasets that leaked
customer information, at least for a few customers and with some
effort.  With the EU suggesting that IP addresses are personally
identifiable information, are we doomed to IP-address free ``Internet''
datasets? \newline \indent
In this talk I will explore the issues in data sharing, suggesting
that we need to move beyond black and white definitions of private and
public datasets, to embrace the gray shades of data sharing in our
future.  Gray need not be gloomy.  I will discuss some new ideas in
sharing that suggest that, if we move beyond ``anonymous ftp'' as our
definition, the future may be gray but bright.
",
}

%	correcttitle = 	"{T-DNS}: Connection-Oriented {DNS} to Improve Privacy and Security",

Sharing data is what we expect as a community. From the IMC best paper award requiring a public dataset to NSF data management plans, we know that data is crucial to reproducible science. Yet privacy concerns today make data acquisition difficult and sharing harder still. AOL and Netflix have released anonymized datasets that leaked customer information, at least for a few customers and with some effort. With the EU suggesting that IP addresses are personally identifiable information, are we doomed to IP-address free ``Internet'' datasets? \newline ∈dent In this talk I will explore the issues in data sharing, suggesting that we need to move beyond black and white definitions of private and public datasets, to embrace the gray shades of data sharing in our future. Gray need not be gloomy. I will discuss some new ideas in sharing that suggest that, if we move beyond ``anonymous ftp'' as our definition, the future may be gray but bright.

@article{DBLP:journals/is/BergmannG14,
  author       = {Ralph Bergmann and
                  Yolanda Gil},
  title        = {Similarity assessment and efficient retrieval of semantic workflows},
  journal      = {Inf. Syst.},
  volume       = {40},
  pages        = {115--127},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.is.2012.07.005},
  doi          = {10.1016/J.IS.2012.07.005},
  timestamp    = {Tue, 16 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/is/BergmannG14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{Li2014SimplifiedSupervisedI-vectorModeling,
 author = {Li, Ming and Narayanan, Shrikanth},
 bib2html_rescat = {},
 doi = {10.1016/j.csl.2014.02.004},
 journal = {Computer, Speech, and Language},
 link = {http://sail.usc.edu/publications/files/li-csl-2014-simplifiedsupervisedi-vector.pdf},
 title = {Simplified Supervised I-vector Modeling with application to Robust and Efficient Language Identification and Speaker Verification},
 year = {2014}
}

@inproceedings{Shivakumar2014SimplifiedIvector,
 author = {Gurunath Shivakumar, Prashanth and Li, Ming and Dhandhania, Vedant and Narayanan, Shrikanth},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2014.6854520},
 link = {http://sail.usc.edu/publications/files/p4866-gurunath_shivakumar.pdf},
 location = {Florence, Italy},
 month = {May},
 title = {Simplified and Supervised i-vector Modeling for Speaker Age Regression},
 year = {2014}
}

@inproceedings{bernstein2014solid,
  title={Solid state electrochemical alkali sources for cold atom sensing},
  author={Bernstein, Jonathan and Whale, Alison and Brown, Justin D and Johnson, Cort and Cook, Eugene and Calvez, Laurent and Zhang, Xianghua and Martin, Steve W},
  booktitle={Solid State Sensors, Actuators and Microsystems Workshop},
  year={2014}
}

@inbook{Lee2014SpeechinAffectiveComputing,
 author = {Lee, Chi-Chun and Kim, Jangwon and Metallinou, Angeliki and Busso, Carlos and Lee, Sungbok and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 chapter = {12},
 doi = {10.1093/oxfordhb/9780199942237.013.021},
 pages = {xx-yy},
 publisher = {Oxford University Press},
 series = {Handbook of Affective Computing},
 title = {Speech in Affective Computing},
 year = {2014}
}

@inproceedings{cotterell2014stochastic,
  title={Stochastic Contextual Edit Distance and Probabilistic FSTs},
  author={Cotterell, Ryan and Peng, Nanyun and Eisner, Jason},
  booktitle={Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics},
  year={2014}
}

@article{DeAngelis2014a,
abstract = {Online communities such as question and answer (QA) systems are growing rapidly and we increasingly rely on them for valuable information and entertainment. However, finding meaningful rewards to motivate participation from the most qualified users, or experts, presents researchers with two main challenges: identifying these users and (2) rewarding their participation. Using an interdisciplinary theoretical framework, we illustrate possibilities for identifying and motivating the most valuable contributors to online communities. We suggest that access to peer-generated content can directly motivate people to apply their own expertise, thereby generating more content. Survey data from 380 participants suggests that users strongly prefer a novel class of incentives—reciprocal systemic rewards—to traditional achievement-based rewards. Overall, this research presents important considerations for many different types of online communities, including social networking and news aggregation sites.},
author = {DeAngelis, David and Barber, Suzanne},
doi = {10.4018/ijats.2014040102},
file = {:home/dave/Documents/References/DeAngelis, Barber - 2014 - Systemic Reciprocal Rewards.pdf:pdf},
issn = {1943-0744},
journal = {International Journal of Agent Technologies and Systems},
keywords = {expertise,motivation,online communities,recommendation,systemic reciprocal rewards,trust},
month = {apr},
number = {2},
pages = {30--50},
title = {Systemic Reciprocal Rewards},
url = {http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijats.2014040102},
volume = {6},
year = {2014}
}

Online communities such as question and answer (QA) systems are growing rapidly and we increasingly rely on them for valuable information and entertainment. However, finding meaningful rewards to motivate participation from the most qualified users, or experts, presents researchers with two main challenges: identifying these users and (2) rewarding their participation. Using an interdisciplinary theoretical framework, we illustrate possibilities for identifying and motivating the most valuable contributors to online communities. We suggest that access to peer-generated content can directly motivate people to apply their own expertise, thereby generating more content. Survey data from 380 participants suggests that users strongly prefer a novel class of incentives—reciprocal systemic rewards—to traditional achievement-based rewards. Overall, this research presents important considerations for many different types of online communities, including social networking and news aggregation sites.

@Misc{Heidemann14c,
	author = 	"John Heidemann",
	title = 	"T-DNS: Connection-Oriented {DNS} to Improve Privacy and Security",
	howpublished = "Presentation at the Spring DNS-OARC Meeting",
	month = 	may,
	year = 	2014,
	sortdate = 	"2014-05-01",
	project = "ant, lacrend, tdns",
	jsubject = "dns",
	jlocation = 	"johnh: pafile",
	keywords = 	"based on [Zhu14a]",
	note = "This talk is about the technical report
                  ISI-TR-2014-688, joint work with Liang Zhu, Zi Hu,
                  duane Wessels, Allison Mankin, and Nikita Somaiya",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann14c.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann14c.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	blogurl = "https://ant.isi.edu/blog/?p=491",
	abstract = "
This talk will discuss \emph{connection-oriented DNS} to improve DNS
security and privacy.  DNS is the canonical example of a
connectionless, single packet, request/response protocol, with UDP as
its dominant transport.  Yet DNS today is challenged by eavesdropping
that compromises privacy, source-address spoofing that results in
denial-of-service (DoS) attacks on the server and third parties,
injection attacks that exploit fragmentation, and size limitations
that constrain policy and operational choices.  We propose \emph{t-DNS} 
to address these problems:  it uses TCP to smoothly
support large payloads and mitigate spoofing and amplification for
DoS.  T-DNS uses transport-layer security (TLS) to provide privacy
from users to their DNS resolvers and optionally to authoritative
servers.  \newline \indent
Traditional wisdom is that connection setup will balloon latency for
clients and overwhelm servers.  We provide data to show that these
assumptions are overblown---our model of end-to-end latency shows
\emph{TLS to the recursive resolver is only about 5--24\% slower}, with
UDP to the authoritative server.  End-to-end latency is 19--33\% slower
with TLS to recursive and TCP to authoritative.  Experiments behind
these models show that after connection establishment, TCP and TLS
latency is equivalent to UDP.  Using diverse trace data we show that
frequent connection reuse is possible (60--95\% for stub and recursive
resolvers, although half that for authoritative servers).  With
conservative timeouts (20 s at authoritative servers and 60 s
elsewhere) we show that \emph{server memory requirements match current
hardware}:  a large recursive resolver may have 25k active connections
consuming about 9 GB of RAM.  These results depend on specific
design and implementation decisions---query pipelining, out-of-order
responses, TLS connection resumption, and plausible timeouts.  \newline \indent
We hope to solicit feedback from the OARC community about this work to
understand design and operational concerns if T-DNS deployment was
widespread.  The work in the talk is by Liang Zhu, Zi Hu, and John Heidemann
(all of USC/ISI), Duane Wessels and Allison Mankin (both of Verisign),
and Nikita Somaiya (USC/ISI).    \newline \indent
A technical report describing the work is
at \url{https://ant.isi.edu/%7ejohnh/PAPERS/Zhu14a.pdf}
and the protocol changes are described 
as \url{http://datatracker.ietf.org/doc/draft-hzhwm-start-tls-for-dns/}.
",
}


%	correcttitle = 	"{Internet} Populations (Good and Bad): Measurement, Estimation, and Correlation",

This talk will discuss \emphconnection-oriented DNS to improve DNS security and privacy. DNS is the canonical example of a connectionless, single packet, request/response protocol, with UDP as its dominant transport. Yet DNS today is challenged by eavesdropping that compromises privacy, source-address spoofing that results in denial-of-service (DoS) attacks on the server and third parties, injection attacks that exploit fragmentation, and size limitations that constrain policy and operational choices. We propose \empht-DNS to address these problems: it uses TCP to smoothly support large payloads and mitigate spoofing and amplification for DoS. T-DNS uses transport-layer security (TLS) to provide privacy from users to their DNS resolvers and optionally to authoritative servers. \newline ∈dent Traditional wisdom is that connection setup will balloon latency for clients and overwhelm servers. We provide data to show that these assumptions are overblown—our model of end-to-end latency shows \emphTLS to the recursive resolver is only about 5–24% slower, with UDP to the authoritative server. End-to-end latency is 19–33% slower with TLS to recursive and TCP to authoritative. Experiments behind these models show that after connection establishment, TCP and TLS latency is equivalent to UDP. Using diverse trace data we show that frequent connection reuse is possible (60–95% for stub and recursive resolvers, although half that for authoritative servers). With conservative timeouts (20 s at authoritative servers and 60 s elsewhere) we show that \emphserver memory requirements match current hardware: a large recursive resolver may have 25k active connections consuming about 9 GB of RAM. These results depend on specific design and implementation decisions—query pipelining, out-of-order responses, TLS connection resumption, and plausible timeouts. \newline ∈dent We hope to solicit feedback from the OARC community about this work to understand design and operational concerns if T-DNS deployment was widespread. The work in the talk is by Liang Zhu, Zi Hu, and John Heidemann (all of USC/ISI), Duane Wessels and Allison Mankin (both of Verisign), and Nikita Somaiya (USC/ISI). \newline ∈dent A technical report describing the work is at ˘rlhttps://ant.isi.edu/%7ejohnh/PAPERS/Zhu14a.pdf and the protocol changes are described as ˘rlhttp://datatracker.ietf.org/doc/draft-hzhwm-start-tls-for-dns/.

@TechReport{Zhu14a,
	author = 	"Liang Zhu and Zi Hu and John Heidemann and
 Duane Wessels and Allison Mankin and Nikita Somaiya",
	title = "T-{DNS}: Connection-Oriented {DNS} to Improve Privacy and Security",
	institution = 	"USC/Information Sciences Institute",
	note = "This technical report has been superceeded by ISI-TR-2014-693",
	year = 		2014,
	sortdate = 		"2014-02-01",
	number =	"ISI-TR-2014-688",
	month =		feb,
	jlocation =	"johnh: pafile",
	keywords =	"network outage detection, hurricane sandy",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Zhu14a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Zhu14a.pdf",
	otherurl = "ftp://ftp.isi.edu/isi-pubs/tr-688.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	project = "ant, lacrend, tdns",
	abstract = "This paper explores \emph{connection-oriented DNS} to improve DNS
security and privacy.  DNS is the canonical example of a
connectionless, single packet, request/response protocol, with UDP as
its dominant transport.  Yet DNS today is challenged by eavesdropping
that compromises privacy, source-address spoofing that results in
denial-of-service (DoS) attacks on the server and third parties,
injection attacks that exploit fragmentation, and size limitations
that constrain policy and operational choices.  We propose
\emph{t-DNS} to address these problems:  it combines TCP to smoothly
support large payloads and mitigate spoofing and amplification for
DoS\@.  T-DNS uses transport-layer security (TLS) to provide privacy
from users to their DNS resolvers and optionally to authoritative
servers.  Traditional wisdom is that connection setup will balloon
latency for clients and overwhelm servers.  These are myths---our
model of end-to-end latency shows \emph{TLS to the recursive resolver
is only about 21\% slower}, with UDP to the authoritative server.
End-to-end latency is 90\% slower with TLS to recursive and TCP to
authoritative.  Experiments behind these models show that after
connection establishment, TCP and TLS latency is equivalent to UDP\@.
Using diverse trace data we show that frequent connection reuse is
possible (60--95\% for stub and recursive resolvers, although half
that for authoritative servers).  With conservative timeouts (20\,s at
authoritative servers and 60\,s elsewhere) we show that \emph{server
memory requirements match current hardware}:  a large recursive
resolver may have 25k active connections consuming about 9\,GB of
RAM\@.  We identify the key design and implementation decisions needed
to minimize overhead---query pipelining, out-of-order responses, TLS
connection resumption, and plausible timeouts.",
}

%	correcttitle = "{T-DNS}: Connection-Oriented {DNS} to Improve Privacy and Security (extended)",

This paper explores \emphconnection-oriented DNS to improve DNS security and privacy. DNS is the canonical example of a connectionless, single packet, request/response protocol, with UDP as its dominant transport. Yet DNS today is challenged by eavesdropping that compromises privacy, source-address spoofing that results in denial-of-service (DoS) attacks on the server and third parties, injection attacks that exploit fragmentation, and size limitations that constrain policy and operational choices. We propose \empht-DNS to address these problems: it combines TCP to smoothly support large payloads and mitigate spoofing and amplification for DoS\@. T-DNS uses transport-layer security (TLS) to provide privacy from users to their DNS resolvers and optionally to authoritative servers. Traditional wisdom is that connection setup will balloon latency for clients and overwhelm servers. These are myths—our model of end-to-end latency shows \emphTLS to the recursive resolver is only about 21% slower, with UDP to the authoritative server. End-to-end latency is 90% slower with TLS to recursive and TCP to authoritative. Experiments behind these models show that after connection establishment, TCP and TLS latency is equivalent to UDP\@. Using diverse trace data we show that frequent connection reuse is possible (60–95% for stub and recursive resolvers, although half that for authoritative servers). With conservative timeouts (20\,s at authoritative servers and 60\,s elsewhere) we show that \emphserver memory requirements match current hardware: a large recursive resolver may have 25k active connections consuming about 9\,GB of RAM\@. We identify the key design and implementation decisions needed to minimize overhead—query pipelining, out-of-order responses, TLS connection resumption, and plausible timeouts.

@TechReport{Zhu14b,
	author = 	"Liang Zhu and Zi Hu and John Heidemann and
 Duane Wessels and Allison Mankin and Nikita Somaiya",
	title = "T-{DNS}: Connection-Oriented {DNS} to Improve Privacy and Security (extended)",
	institution = 	"USC/Information Sciences Institute",
	year = 		2014,
	sortdate = 		"2014-06-01",
	number =	"ISI-TR-2014-693",
	month =		jun,
	jlocation =	"johnh: pafile",
	keywords =	"network outage detection, hurricane sandy",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Zhu14b.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Zhu14b.pdf",
	otherurl = "ftp://ftp.isi.edu/isi-pubs/tr-693.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	project = "ant, retrofuture, lacrend, tdns",
	blogurl = 	"https://ant.isi.edu/blog/?p=508",
        datasetlurl =   "https://ant.isi.edu/datasets/all.html",
        codeurl =       "https://ant.isi.edu/software/tdns/index.html",
	abstract = "
DNS is the canonical protocol for connectionless UDP.  Yet DNS today
is challenged by eavesdropping that compromises privacy,
source-address spoofing that results in denial-of-service (DoS)
attacks on the server and third parties, injection attacks that
exploit fragmentation, and size limitations that constrain policy and
operational choices.  We propose \emph{T-DNS} to address these
problems.  It uses TCP to smoothly support large payloads and to
mitigate spoofing and amplification for DoS.  T-DNS uses
transport-layer security (TLS) to provide privacy from users to their
DNS resolvers and optionally to authoritative servers.  Expectations
about DNS suggest connections will balloon client latency and
overwhelm server with state, but our evaluation shows costs are
modest:  end-to-end latency 
from \emph{TLS to the recursive resolver is only about 9\% slower} 
when UDP is used to the authoritative
server, and 22\% slower with TCP to the authoritative.  With diverse
traces we show that frequent connection reuse is possible (60--95\%
for stub and recursive resolvers, although half that for authoritative
servers), and after connection establishment, we show TCP and TLS
latency is equivalent to UDP.  With conservative timeouts (20\,s at
authoritative servers and 60\,s elsewhere) and conservative estimates
of connection state memory requirements, we show 
that \emph{server memory requirements match current hardware}:  
a large recursive
resolver may have 24k active connections requiring about 3.6\,GB
additional RAM.  We identify the key design and implementation
decisions needed to minimize overhead: query pipelining, out-of-order
responses, TLS connection resumption, and plausible timeouts.
",
}

DNS is the canonical protocol for connectionless UDP. Yet DNS today is challenged by eavesdropping that compromises privacy, source-address spoofing that results in denial-of-service (DoS) attacks on the server and third parties, injection attacks that exploit fragmentation, and size limitations that constrain policy and operational choices. We propose \emphT-DNS to address these problems. It uses TCP to smoothly support large payloads and to mitigate spoofing and amplification for DoS. T-DNS uses transport-layer security (TLS) to provide privacy from users to their DNS resolvers and optionally to authoritative servers. Expectations about DNS suggest connections will balloon client latency and overwhelm server with state, but our evaluation shows costs are modest: end-to-end latency from \emphTLS to the recursive resolver is only about 9% slower when UDP is used to the authoritative server, and 22% slower with TCP to the authoritative. With diverse traces we show that frequent connection reuse is possible (60–95% for stub and recursive resolvers, although half that for authoritative servers), and after connection establishment, we show TCP and TLS latency is equivalent to UDP. With conservative timeouts (20\,s at authoritative servers and 60\,s elsewhere) and conservative estimates of connection state memory requirements, we show that \emphserver memory requirements match current hardware: a large recursive resolver may have 24k active connections requiring about 3.6\,GB additional RAM. We identify the key design and implementation decisions needed to minimize overhead: query pipelining, out-of-order responses, TLS connection resumption, and plausible timeouts.

@Misc{Zhu14d,
	author = 	"Liang Zhu and Zi Hu and John Heidemann and
 Allison Mankin and Duane Wessels",
	title = "T-DNS: Connection-Oriented {DNS} to Improve Privacy
                  and Security (poster abstract)",
	howpublished = "Poster at SIGCOMM 2014",
	month = 	aug,
	year = 	2014,
	keywords = 	"DNS, privacy, t-dns, dns-over-tcp, dns-over-tls",
	jlocation = 	"johnh: pafile xxx not on file",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Zhu14d.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Zhu14d.pdf",
	doi = "http://dx.doi.org/10.1145/2740070.2631442",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "DNS is the canonical protocol for connectionless UDP. Yet DNS today is challenged by eavesdropping that compromises privacy, source-address spoofing that results in denial-of-service (DoS) attacks on the server and third parties, injection attacks that exploit fragmentation, and size limitations that constrain policy and operational choices. We propose T-DNS to address these problems. It uses TCP to smoothly support large payloads and to mitigate spoofing and amplification for DoS. T-DNS uses transport-layer security (TLS) to provide privacy from users to their DNS resolvers and optionally to authoritative servers. Our model shows end-to-end latency from TLS to the recursive resolver is only about 9\% slower when UDP is used to the authoritative server, and 22\% slower with TCP to the authoritative. With diverse traces we show that frequent connection reuse is possible (60-95\% for stub and recursive resolvers, although half that for authoritative servers). Our experiment shows that after connection establishment, TCP and TLS latency is equivalent to UDP. With conservative timeouts (20 s at authoritative servers and 60 s elsewhere) and conservative estimates of connection state memory requirements, we show that server memory requirements well within current, commodity server hardware. We identify the key design and implementation decisions needed to minimize overhead: query pipelining, out-of-order responses, TLS connection resumption, and plausible timeouts. This poster abstract summarizes work we describe in detail in ISI-TR-2014-693."
}

DNS is the canonical protocol for connectionless UDP. Yet DNS today is challenged by eavesdropping that compromises privacy, source-address spoofing that results in denial-of-service (DoS) attacks on the server and third parties, injection attacks that exploit fragmentation, and size limitations that constrain policy and operational choices. We propose T-DNS to address these problems. It uses TCP to smoothly support large payloads and to mitigate spoofing and amplification for DoS. T-DNS uses transport-layer security (TLS) to provide privacy from users to their DNS resolvers and optionally to authoritative servers. Our model shows end-to-end latency from TLS to the recursive resolver is only about 9% slower when UDP is used to the authoritative server, and 22% slower with TCP to the authoritative. With diverse traces we show that frequent connection reuse is possible (60-95% for stub and recursive resolvers, although half that for authoritative servers). Our experiment shows that after connection establishment, TCP and TLS latency is equivalent to UDP. With conservative timeouts (20 s at authoritative servers and 60 s elsewhere) and conservative estimates of connection state memory requirements, we show that server memory requirements well within current, commodity server hardware. We identify the key design and implementation decisions needed to minimize overhead: query pipelining, out-of-order responses, TLS connection resumption, and plausible timeouts. This poster abstract summarizes work we describe in detail in ISI-TR-2014-693.

@inproceedings{DBLP:conf/sc/Gil14,
  author       = {Yolanda Gil},
  editor       = {Sushil K. Prasad},
  title        = {Teaching parallelism without programming: a data science curriculum
                  for non-CS students},
  booktitle    = {Proceedings of the Workshop on Education for High-Performance Computing,
                  EduHPC '14, New Orleans, Louisiana, USA, November 16-21, 2014},
  pages        = {42--48},
  publisher    = {{IEEE} Computer Society},
  year         = {2014},
  url          = {https://doi.org/10.1109/EduHPC.2014.12},
  doi          = {10.1109/EDUHPC.2014.12},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sc/Gil14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ploscb/GoodmanPBBCCSGGHHKMSS14,
  author       = {Alyssa Goodman and
                  Alberto Pepe and
                  Alexander W. Blocker and
                  Christine L. Borgman and
                  Kyle Cranmer and
                  Merc{\`{e}} Crosas and
                  Rosanne Di Stefano and
                  Yolanda Gil and
                  Paul Groth and
                  Margaret L. Hedstrom and
                  David W. Hogg and
                  Vinay Kashyap and
                  Ashish Mahabal and
                  Aneta Siemiginowska and
                  Aleksandra B. Slavkovic},
  title        = {Ten Simple Rules for the Care and Feeding of Scientific Data},
  journal      = {PLoS Comput. Biol.},
  volume       = {10},
  number       = {4},
  year         = {2014},
  url          = {https://doi.org/10.1371/journal.pcbi.1003542},
  doi          = {10.1371/JOURNAL.PCBI.1003542},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ploscb/GoodmanPBBCCSGGHHKMSS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/aimatters/Gil14a,
  author       = {Yolanda Gil},
  title        = {Ten simple rules for starting a research group},
  journal      = {{AI} Matters},
  volume       = {1},
  number       = {2},
  pages        = {4--10},
  year         = {2014},
  url          = {https://doi.org/10.1145/2685328.2685330},
  doi          = {10.1145/2685328.2685330},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/aimatters/Gil14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{burns-etal-aimag14,
  title = {The AAAI Fall Symposium on Discovery Informatics: AI Takes a Science-Centered View on Big Data},
  author = {Gully APC Burns and Yolanda Gil and Natalia Villanueva-Rosales and Yan Liu},
  journal = {AI Magazine},
  volume = {35},
  number = {2},
  year = {2014}
}

@inproceedings{Ghosh14kdd,
    abstract = {We study the interplay between a dynamic process and the structure of the
network on which it is defined. Specifically, we examine the impact of this
interaction on the quality-measure of network clusters and node centrality.
This enables us to effectively identify network communities and important nodes
participating in the dynamics. As the first step towards this objective, we
introduce an umbrella framework for defining and characterizing an ensemble of
dynamic processes on a network. This framework generalizes the traditional
Laplacian framework to continuous-time biased random walks and also allows us
to model some epidemic processes over a network. For each dynamic process in
our framework, we can define a function that measures the quality of every
subset of nodes as a potential cluster (or community) with respect to this
process on a given network. This subset-quality function generalizes the
traditional conductance measure for graph partitioning. We partially justify
our choice of the quality function by showing that the classic Cheeger's
inequality, which relates the conductance of the best cluster in a network with
a spectral quantity of its Laplacian matrix, can be extended from the
Laplacian-conductance setting to this more general setting.},
    author = {Ghosh, Rumi and Lerman, Kristina and Teng, Shang-Hua and Yan, Xiaoran},
    booktitle = {Proceedings of the 20th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'2014)},
    keywords = {social-networks},
    url = {http://arxiv.org/abs/1406.3387},
    title = {The Interplay Between Dynamics and Networks: Centrality, Communities, and Cheeger Inequality},
    year = {2014}
}

We study the interplay between a dynamic process and the structure of the network on which it is defined. Specifically, we examine the impact of this interaction on the quality-measure of network clusters and node centrality. This enables us to effectively identify network communities and important nodes participating in the dynamics. As the first step towards this objective, we introduce an umbrella framework for defining and characterizing an ensemble of dynamic processes on a network. This framework generalizes the traditional Laplacian framework to continuous-time biased random walks and also allows us to model some epidemic processes over a network. For each dynamic process in our framework, we can define a function that measures the quality of every subset of nodes as a potential cluster (or community) with respect to this process on a given network. This subset-quality function generalizes the traditional conductance measure for graph partitioning. We partially justify our choice of the quality function by showing that the classic Cheeger's inequality, which relates the conductance of the best cluster in a network with a spectral quantity of its Laplacian matrix, can be extended from the Laplacian-conductance setting to this more general setting.

@InProceedings{Hu14b,
	author = 	"Zi Hu and Liang Zhu and Calvin Ardi and Ethan Katz-Bassett and Harsha V. Madhyastha and John Heidemann and Minlan Yu",
	title = 	"The Need for End-to-End Evaluation of Cloud Availability",
	booktitle = 	"Proceedings of the " # " Passive and Active Measurement Workshop",
	year = 		2014,
	sortdate = 		"2014-03-01",
	project = "ant, retrofuture, lacrend",
	jsubject = "routing",
	pages = 	"119--130",
	month = 	mar,
	address = 	"Marina del Rey, California, USA",
	publisher = 	"Springer",
	  copyrightholder = "Springer",
	  copyrightterms = "An author may self-archive an author-created version of his/her article on his/her own website and or in his/her institutional repository. He/she may also deposit this version on his/her funder's or funder's designated repository at the funder's request or as a result of a legal obligation, provided it is not made publicly available until 12 months after official publication. He/she may not use the publisher's PDF version, which is posted on \url{www.springerlink.com}, for the purpose of self-archiving or deposit. Furthermore, the author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: ``The final publication is available at www.springerlink.com''. " ,
	jlocation = 	"johnh: pafile",
	keywords = 	"cloud, reliability, outages, ping, TCP, end-to-end",
	doi = "10.1007/978-3-319-04918-2_12",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Hu14b.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Hu14b.pdf",
	otherurl = "http://link.springer.com/chapter/10.1007/978-3-319-04918-2_12",
	blogurl = 	"https://ant.isi.edu/blog/?p=455",
	abstract = "
People's computing lives are moving into the cloud, making
understanding cloud availability increasingly critical.  Prior studies
of Internet outages have used ICMP-based pings and traceroutes.  While
these studies can detect network availability, we show that they can
be inaccurate at estimating \emph{cloud} availability.  Without care,
ICMP probes can \emph{underestimate} availability because ICMP is not
as robust as application-level measurements such as HTTP.  They can
\emph{overestimate} availability if they measure reachability of the
cloud's edge, missing failures in the cloud's back-end.  We develop
methodologies sensitive to five ``nines'' of reliability, and then we
compare ICMP and end-to-end measurements for both cloud VM and storage
services.  We show case studies where one fails and the other
succeeds, and our results highlight the importance of
application-level retries to reach high precision.  When possible, we
recommend end-to-end measurement with application-level protocols to
evaluate the availability of cloud services.
",
}

People's computing lives are moving into the cloud, making understanding cloud availability increasingly critical. Prior studies of Internet outages have used ICMP-based pings and traceroutes. While these studies can detect network availability, we show that they can be inaccurate at estimating \emphcloud availability. Without care, ICMP probes can \emphunderestimate availability because ICMP is not as robust as application-level measurements such as HTTP. They can \emphoverestimate availability if they measure reachability of the cloud's edge, missing failures in the cloud's back-end. We develop methodologies sensitive to five ``nines'' of reliability, and then we compare ICMP and end-to-end measurements for both cloud VM and storage services. We show case studies where one fails and the other succeeds, and our results highlight the importance of application-level retries to reach high precision. When possible, we recommend end-to-end measurement with application-level protocols to evaluate the availability of cloud services.

@article{Bone2014ThePsychologistasan,
 author = {Bone, Daniel and Black, Matthew P. and Lee, Chi-Chun and Williams, Marian and Levitt, Pat and Lee, Sungbok and Narayanan, Shrikanth S.},
 bib2html_rescat = {care},
 doi = {10.1044/2014_JSLHR-S-13-0062},
 journal = {Journal of Speech, Language, and Hearing Research},
 keyword = {CARE},
 link = {http://sail.usc.edu/publications/files/Bone_JSLHR_2014.pdf},
 month = {Aug},
 pages = {1162-1177},
 title = {The Psychologist as an Interlocutor in Autism Spectrum Disorder Assessment: Insights from a Study of Spontaneous Prosody},
 volume = {57},
 year = {2014}
}

@misc{1401.4307,
	title        = {The Research Object Suite of Ontologies: Sharing and Exchanging Research Data and Methods on the Open Web},
	author       = {Belhajjame, Khalid and Zhao, Jun and Garijo, Daniel and Hettne, Kristina M. and Palma, Ra{\'{u}}l and Corcho, {\'{O}}scar and Manu{\'{e}}l G{\'{o}}mez{-}P{\'{e}}rez, Jos{\'{e}} and Bechhofer, Sean and Klyne, Graham and Goble, Carole A.},
	year         = {2014},
	url          = {http://dgarijo.com/papers/ro.pdf},
	Eprint       = {arXiv:1401.4307},
	Howpublished = {http://arxiv.org/abs/1401.4307}
}

@article{Hodas14srep,
    author = {Hodas, Nathan O. and Lerman, Kristina},
    doi = {10.1038/srep04343},
    journal = {Scientific Reports},
    keywords = {social-dynamics},
    title = {The Simple Rules of Social Contagion},
    urlPaper = {http://dx.doi.org/10.1038/srep04343},
    abstract={It is commonly believed that information spreads between individuals like a pathogen, with each exposure by an informed friend potentially resulting in a naive individual becoming infected. However, empirical studies of social media suggest that individual response to repeated exposure to information is far more complex. As a proxy for intervention experiments, we compare user responses to multiple exposures on two different social media sites, Twitter and Digg. We show that the position of exposing messages on the user-interface strongly affects social contagion. Accounting for this visibility significantly simplifies the dynamics of social contagion. The likelihood an individual will spread information increases monotonically with exposure, while explicit feedback about how many friends have previously spread it increases the likelihood of a response. We provide a framework for unifying information visibility, divided attention, and explicit social feedback to predict the temporal dynamics of user behavior.},
    volume = {4},
    year = {2014}
}

It is commonly believed that information spreads between individuals like a pathogen, with each exposure by an informed friend potentially resulting in a naive individual becoming infected. However, empirical studies of social media suggest that individual response to repeated exposure to information is far more complex. As a proxy for intervention experiments, we compare user responses to multiple exposures on two different social media sites, Twitter and Digg. We show that the position of exposing messages on the user-interface strongly affects social contagion. Accounting for this visibility significantly simplifies the dynamics of social contagion. The likelihood an individual will spread information increases monotonically with exposure, while explicit feedback about how many friends have previously spread it increases the likelihood of a response. We provide a framework for unifying information visibility, divided attention, and explicit social feedback to predict the temporal dynamics of user behavior.

@article{Audhkhasi2014TheoreticalAnalysisofDiversity,
 author = {Audhkhasi, Kartik and Zavou, Andreas and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {rats},
 doi = {https://doi.org/10.1109/TASLP.2014.2303295},
 journal = {IEEE/ACM Transactions on Audio, Speech and Language Processing},
 link = {http://sail.usc.edu/publications/files/diverse_asr_ensemble_taslp2014.pdf},
 number = {3},
 title = {Theoretical Analysis of Diversity in an Ensemble of Automatic Speech Recognition Systems},
 volume = {22},
 year = {2014}
}

@Misc{Heidemann14f,
	author = 	"John Heidemann",
	title = 	"Towards Understanding Internet Reliability",
	howpublished = "Presentation at DHS Cyber Security Division
                  R\&D Showcase and Technical Workshop",
	month = 	dec,
	year = 	2014,
	sortdate = "2014-12-16",
	project = "ant, lacrend, duoi",
	jsubject = "network_topology",
	sortdate = 	"2014-12-01",
	jlocation = 	"johnh: pafile",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann14f.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann14f.pdf",
	otherurl = "https://www.signup4.net/public/ap.aspx?EID=20142362E&OID=167",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
Since 2006, we have been studying the public face of
the Internet.  We take regular censuses of the Internet address space,
pinging all IPv4 addresses.  Recently have studied network outages and
events like Hurricane Sandy, probing much of the Internet every 11
minutes.  This talk will examine how a single computer can observe
outages over the whole Internet continuously.  We will discuss how
these ideas transition from research to practice.  Our work has
includes technology transfer and sharing with academia and industry,
through hundreds of datasets to more than 50 researchers so far, and
joint evaluation of the techniques with other parts of government.",
}

Since 2006, we have been studying the public face of the Internet. We take regular censuses of the Internet address space, pinging all IPv4 addresses. Recently have studied network outages and events like Hurricane Sandy, probing much of the Internet every 11 minutes. This talk will examine how a single computer can observe outages over the whole Internet continuously. We will discuss how these ideas transition from research to practice. Our work has includes technology transfer and sharing with academia and industry, through hundreds of datasets to more than 50 researchers so far, and joint evaluation of the techniques with other parts of government.

@inproceedings{DBLP:conf/sc/GarijoGC14,
  author       = {Daniel Garijo and
                  Yolanda Gil and
                  {\'{O}}scar Corcho},
  editor       = {Johan Montagnat and
                  Ian J. Taylor},
  title        = {Towards workflow ecosystems through semantic and standard representations},
  booktitle    = {Proceedings of the 9th Workshop on Workflows in Support of Large-Scale
                  Science, {WORKS} '14, New Orleans, Louisiana, USA, November 16-21,
                  2014},
  pages        = {94--104},
  publisher    = {{IEEE}},
  year         = {2014},
  url          = {https://doi.org/10.1109/WORKS.2014.13},
  doi          = {10.1109/WORKS.2014.13},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sc/GarijoGC14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Gupta2014cDiverselassifiers,
 author = {Gupta, Rahul and Audhkhasi, Kartik and Narayanan, Shrikanth},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of IEEE International Conference on Audio, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2014.6854136},
 link = {http://sail.usc.edu/publications/files/p2951-gupta.pdf},
 location = {Florence, Italy},
 month = {May},
 title = {Training ensemble of diverse classifiers on feature subsets},
 year = {2014}
}

@inproceedings{Zhu14sigmod,
    abstract = {The growing popularity of social media (e.g, Twitter) allows users to easily
share information with each other and influence others by expressing their own
sentiments on various subjects. In this work, we propose an unsupervised
\emph{tri-clustering} framework, which analyzes both user-level and tweet-level
sentiments through co-clustering of a tripartite graph. A compelling feature of
the proposed framework is that the quality of sentiment clustering of tweets,
users, and features can be mutually improved by joint clustering. We further
investigate the evolution of user-level sentiments and latent feature vectors
in an online framework and devise an efficient online algorithm to sequentially
update the clustering of tweets, users and features with newly arrived data.
The online framework not only provides better quality of both dynamic
user-level and tweet-level sentiment analysis, but also improves the
computational and storage efficiency. We verified the effectiveness and
efficiency of the proposed approaches on the November 2012 California ballot
Twitter data.},
    author = {Zhu, Linhong and Galstyan, Aram and Cheng, James and Lerman, Kristina},
    booktitle = {Proceedings of the ACM SIGMOD/PODS},
    keywords = {social-networks},
    title = {Tripartite Graph Clustering for Dynamic Sentiment Analysis on Social Media},
    urlPaper = {http://arxiv.org/abs/1402.6010},
    year = {2014}
}

The growing popularity of social media (e.g, Twitter) allows users to easily share information with each other and influence others by expressing their own sentiments on various subjects. In this work, we propose an unsupervised \emphtri-clustering framework, which analyzes both user-level and tweet-level sentiments through co-clustering of a tripartite graph. A compelling feature of the proposed framework is that the quality of sentiment clustering of tweets, users, and features can be mutually improved by joint clustering. We further investigate the evolution of user-level sentiments and latent feature vectors in an online framework and devise an efficient online algorithm to sequentially update the clustering of tweets, users and features with newly arrived data. The online framework not only provides better quality of both dynamic user-level and tweet-level sentiment analysis, but also improves the computational and storage efficiency. We verified the effectiveness and efficiency of the proposed approaches on the November 2012 California ballot Twitter data.

@inproceedings{Van2014UBMFusedTotalVariability,
 author = {Van Segbroeck, Maarten and Travadi, Ruchir and Narayanan, Shrikanth},
 bib2html_rescat = {rats},
 booktitle = {Proceedings  of Interspeech},
 link = {http://sail.usc.edu/publications/files/is14_maarten.pdf},
 month = {Sep},
 pages = {3027-3031},
 title = {UBM Fused Total Variability Modeling for Language Identification},
 year = {2014}
}

@inproceedings{acl2014,
	Author = {Shuyang Gao and Greg {Ver Steeg} and Aram Galstyan},
	Booktitle = {(submitted)},
	Title = {Understanding Stylistic Coordination in Dialogues},
	Year = {2014}}

@article{gao2014understanding,
  title={Understanding confounding effects in linguistic coordination: an information-theoretic approach},
  author={Gao, Shuyang and Ver Steeg, Greg and Galstyan, Aram},
  journal={arXiv preprint arXiv:1412.0696},
  year={2014}
}
%%2013

@inproceedings{Huang2014UnsupervisedSpeakerDiarizationUsing,
 author = {Huang, Che Wei and Xiao, Bo and Georgiou, Panayiotis and Narayanan, Shrikanth},
 bib2html_rescat = {},
 booktitle = {Proceedings of Interspeech},
 doi = {},
 link = {http://sail.usc.edu/publications/files/IS14_poster.pdf},
 month = {Sep},
 title = {Unsupervised Speaker Diarization Using Riemannian Manifold Clustering},
 year = {2014}
}

@misc{garijo-etal-provanalytics14,
  author = {Daniel Garijo and Yolanda Gil and Andreas Harth},
  title = {User Requirements for Geospatial Provenance},
  note = {Provenance Analytics, co-located with the Fifth International Provenance and Annotation Workshop (IPAW)},
  address = {Cologne, Germany},
  year = {2014},
  url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/garijo-etal-provanalytics14.pdf }
}

@inproceedings{Gupta2014VariableSpanDisfluencyDetection,
 author = {Gupta, Rahul and Ananthakrishnan, Sankaranarayanan and Yang, Zhaojun and Narayanan, Shrikanth},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of Interspeech},
 link = {http://sail.usc.edu/publications/files/gupta_interspeech_2014.pdf},
 month = {Sep},
 title = {Variable Span Disfluency Detection in ASR Transcripts},
 year = {2014}
}

@Article{Quan14d,
	author = 	"Lin Quan and John Heidemann and Yuri Pradkin",
	title = 	"Visualizing Sparse Internet Events: Network Outages and Route Changes",
	journal = 	"Computing",
	publisher = "Springer",
	month = jan,
	year = 		2014,
	sortdate = 		"2014-01-01",
	project = "ant, nocredit, lacrend, lander, duoi",
	jsubject = "topology_modeling",
	volume = 	"96",
	number = "1",
	pages = 	"39--51",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "Springer",
	jlocation = 	"johnh: pafile",
	keywords = 	"internet visualization, workshop, front matter",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Quan14d.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Quan14d.pdf",
	doi = 	"10.1007/s00607-013-0283-7",
	abstract = "To understand network behavior, researchers and enterprise network
operators must interpret large amounts of network data.  To understand
and manage network events such as outages, route instability, and spam
campaigns, they must interpret data that covers a range of networks
and evolves over time.  We propose a simple clustering algorithm that
helps identify spatial clusters of network events based on
correlations in event timing, producing 2-D visualizations.  We show
that these visualizations where they reveal the extent, timing, and
dynamics of network outages such as January 2011 Egyptian change of
government, and the March 2011 Japanese earthquake.  We also show they
reveal correlations in routing changes that are hidden from AS-path
analysis.",
}
                  

To understand network behavior, researchers and enterprise network operators must interpret large amounts of network data. To understand and manage network events such as outages, route instability, and spam campaigns, they must interpret data that covers a range of networks and evolves over time. We propose a simple clustering algorithm that helps identify spatial clusters of network events based on correlations in event timing, producing 2-D visualizations. We show that these visualizations where they reveal the extent, timing, and dynamics of network outages such as January 2011 Egyptian change of government, and the March 2011 Japanese earthquake. We also show they reveal correlations in routing changes that are hidden from AS-path analysis.

@TechReport{Ardi14a,
	author = 	"Calvin Ardi and John Heidemann",
	title = "Web-scale Content Reuse Detection (extended)",
	institution = 	"USC/Information Sciences Institute",
	year = 		2014,
	sortdate = 		"2014-06-01",
	number =	"ISI-TR-2014-692",
	month =		jun,
	jlocation =	"johnh: pafile",
	keywords =	"hashing, content reuse, wikipedia, copying",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Ardi14a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Ardi14a.pdf",
	otherurl = "ftp://ftp.isi.edu/isi-pubs/tr-692.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	project = "ant, mega",
	abstract = "
With the vast amount of accessible, online content, it is not
surprising that unscrupulous entities ``borrow'' from the web to
provide filler for advertisements, link farms, and spam and make a
quick profit.  Our insight is that cryptographic hashing and
fingerprinting can efficiently identify content reuse for web-size
corpora.  We develop two related algorithms, one to 
automatically \emph{discover} previously unknown 
duplicate content in the web, and
the second to \emph{detect} copies of discovered or manually
identified content in the web.  Our detection can also \emph{bad
neighborhoods}, clusters of pages where copied content is frequent.
We verify our approach with controlled experiments with two large
datasets: a Common Crawl subset the web, and a copy of Geocities, an
older set of user-provided web content.  We then demonstrate that we
can discover otherwise unknown examples of duplication for spam, and
detect both discovered and expert-identified content in these large
datasets.  Utilizing an original copy of Wikipedia as identified
content, we find 40 sites that reuse this content, 86\% for commercial
benefit.
",
}

With the vast amount of accessible, online content, it is not surprising that unscrupulous entities ``borrow'' from the web to provide filler for advertisements, link farms, and spam and make a quick profit. Our insight is that cryptographic hashing and fingerprinting can efficiently identify content reuse for web-size corpora. We develop two related algorithms, one to automatically \emphdiscover previously unknown duplicate content in the web, and the second to \emphdetect copies of discovered or manually identified content in the web. Our detection can also \emphbad neighborhoods, clusters of pages where copied content is frequent. We verify our approach with controlled experiments with two large datasets: a Common Crawl subset the web, and a copy of Geocities, an older set of user-provided web content. We then demonstrate that we can discover otherwise unknown examples of duplication for spam, and detect both discovered and expert-identified content in these large datasets. Utilizing an original copy of Wikipedia as identified content, we find 40 sites that reuse this content, 86% for commercial benefit.

@InProceedings{Quan14c,
	author = 	"Lin Quan and John Heidemann and Yuri Pradkin",
	title = 	"When the {Internet} Sleeps: Correlating
                  Diurnal Networks With External Factors" ,
	booktitle = 	"Proceedings of the " # "ACM Internet Measurement Conference",
	year = 		2014,
	sortdate = 		"2014-11-01", 
	project = "ant, lacrend, retrofuture, duoi",
	jsubject = "routing",
	pages = 	"87--100",
	month = 	nov,
	address = 	"Vancouver, BC, Canada",
	publisher = 	"ACM",
	jlocation = 	"johnh: pafile",
	keywords = 	"routing outage detection, diurnal network
                  behavior, active probing,
                  ntework outages",
	doi = "http://dx.doi.org/10.1145/2663716.2663721",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Quan14b.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Quan14b.pdf",
	otherurl =	"ftp://ftp.isi.edu/isi-pubs/tr-699b.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	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. Copyrights for components of this 	work owned by others than ACM must be 	honored. Abstracting with credit is permitted. To 	copy otherwise, or republish, to post on servers or 	to redistribute to lists, requires prior specific 	permission and/or a fee. Request permissions from 	[email protected]. Copyright is held by the 	owner/author(s). Publication rights licensed to ACM. ",
	abstract = "
As the Internet matures, policy questions loom larger in its
operation.  When should an ISP, city, or government invest in
infrastructure?  How do their policies affect use?  In this work, we
develop a new approach to evaluate how policies, economic conditions
and technology correlates with Internet use around the world.  First,
we develop an adaptive and accurate approach to
estimate \emph{block availability}, 
the fraction of active IP addresses in each /24 block
over short timescales (every 11 minutes).  Our estimator provides a
new lens to interpret data taken from existing long-term outage
measurements, thus requiring no additional traffic.  (If new
collection was required, it would be lightweight, since on average,
outage detection requires less than 20 probes per hour per /24 block;
less than 1\% of background radiation.)  Second, we show that spectral
analysis of this measure can identify \emph{diurnal usage}: blocks
where addresses are regularly used during part of the day and idle in
other times.  Finally, we analyze data for the entire responsive
Internet (3.7M /24 blocks) over 35 days.  These global observations
show \emph{when} and \emph{where} the Internet sleeps---networks are
mostly always-on in the US and Western Europe, and diurnal in much of
Asia, South America, and Eastern Europe.  ANOVA (Analysis of Variance)
testing shows that diurnal networks correlate negatively with country
GDP and electrical consumption, quantifying that national policies and
economics relate to networks.
",
}

As the Internet matures, policy questions loom larger in its operation. When should an ISP, city, or government invest in infrastructure? How do their policies affect use? In this work, we develop a new approach to evaluate how policies, economic conditions and technology correlates with Internet use around the world. First, we develop an adaptive and accurate approach to estimate \emphblock availability, the fraction of active IP addresses in each /24 block over short timescales (every 11 minutes). Our estimator provides a new lens to interpret data taken from existing long-term outage measurements, thus requiring no additional traffic. (If new collection was required, it would be lightweight, since on average, outage detection requires less than 20 probes per hour per /24 block; less than 1% of background radiation.) Second, we show that spectral analysis of this measure can identify \emphdiurnal usage: blocks where addresses are regularly used during part of the day and idle in other times. Finally, we analyze data for the entire responsive Internet (3.7M /24 blocks) over 35 days. These global observations show \emphwhen and \emphwhere the Internet sleeps—networks are mostly always-on in the US and Western Europe, and diurnal in much of Asia, South America, and Eastern Europe. ANOVA (Analysis of Variance) testing shows that diurnal networks correlate negatively with country GDP and electrical consumption, quantifying that national policies and economics relate to networks.

@TechReport{Quan14b,
	author = 	"Lin Quan and John Heidemann and Yuri Pradkin",
	title = 	"When the {Internet} Sleeps: Correlating
                  Diurnal Networks With External Factors (extended)" ,
	institution = 	"USC/Information Sciences Institute",
	year = 		2014,
	sortdate = "2014-05-01",
	project = "ant, lacrend, retrofuture, duoi",
	jsubject = "routing",
	number = 	"ISI-TR-2014-691b",
	month = 	may,
	note = "(updated August 2014)",
	jlocation = 	"johnh: pafile",
	keywords = 	"routing outage detection, diurnal network
                  behavior, active probing,
                  ntework outages",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Quan14b.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Quan14b.pdf",
	otherurl =	"ftp://ftp.isi.edu/isi-pubs/tr-699b.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
As the Internet matures, policy questions loom larger in its
operation.  When should an ISP, city, or government invest in
infrastructure?  How do their policies affect use?  In this work, we
develop a new approach to evaluate how policies, economic conditions
and technology correlates with Internet use around the world.  First,
we develop an adaptive and accurate approach to estimate \emph{block
  availability}, the fraction of active IP addresses in each /24 block
over short timescales (every 11 minutes).  Our estimator provides a
new lens to interpret data taken from existing long-term outage
measurements, this requiring no no additional traffic.  (If new
collection was required, it would be lightweight, since on average,
outage detection requires less than 20 probes per hour per /24 block;
less than 1\% of background radiation.)  Second, we show that spectral
analysis of this measure can identify \emph{diurnal usage}: blocks
where addresses are regularly used during part of the day and idle in
other times.  Finally, we analyze data for the entire responsive
Internet (3.7M /24 blocks) over 35 days.  These global observations
show \emph{when} and \emph{where} the Internet sleeps---networks are
mostly always-on in the US and Western Europe, and diurnal in much of
Asia, South America, and Eastern Europe.  ANOVA testing shows that
diurnal networks correlate negatively with country GDP and electrical
consumption, quantifying that national policies and economics relate
to networks.
",
}

As the Internet matures, policy questions loom larger in its operation. When should an ISP, city, or government invest in infrastructure? How do their policies affect use? In this work, we develop a new approach to evaluate how policies, economic conditions and technology correlates with Internet use around the world. First, we develop an adaptive and accurate approach to estimate \emphblock availability, the fraction of active IP addresses in each /24 block over short timescales (every 11 minutes). Our estimator provides a new lens to interpret data taken from existing long-term outage measurements, this requiring no no additional traffic. (If new collection was required, it would be lightweight, since on average, outage detection requires less than 20 probes per hour per /24 block; less than 1% of background radiation.) Second, we show that spectral analysis of this measure can identify \emphdiurnal usage: blocks where addresses are regularly used during part of the day and idle in other times. Finally, we analyze data for the entire responsive Internet (3.7M /24 blocks) over 35 days. These global observations show \emphwhen and \emphwhere the Internet sleeps—networks are mostly always-on in the US and Western Europe, and diurnal in much of Asia, South America, and Eastern Europe. ANOVA testing shows that diurnal networks correlate negatively with country GDP and electrical consumption, quantifying that national policies and economics relate to networks.

@inproceedings{cho2014and,
  title={Where and why users “check in”},
  author={Cho, Yoon-Sik and Ver Steeg, Greg and Galstyan, Aram},
  booktitle={Proc. of AAAI},
  volume={14},
  pages={269--275},
  year={2014}
}

@article{torki_window-based_2014,
	title = {Window-Based Descriptors for Arabic Handwritten Alphabet Recognition: A Comparative Study on a Novel Dataset},
	rights = {All rights reserved},
	url = {http://arxiv.org/abs/1411.3519},
	shorttitle = {Window-Based Descriptors for Arabic Handwritten Alphabet Recognition},
	abstract = {This paper presents a comparative study for window-based descriptors on the application of Arabic handwritten alphabet recognition. We show a detailed experimental evaluation of different descriptors with several classifiers. The objective of the paper is to evaluate different window-based descriptors on the problem of Arabic letter recognition. Our experiments clearly show that they perform very well. Moreover, we introduce a novel spatial pyramid partitioning scheme that enhances the recognition accuracy for most descriptors. In addition, we introduce a novel dataset for Arabic handwritten isolated alphabet letters, which can serve as a benchmark for future research.},
	journaltitle = {{arXiv}:1411.3519 [cs]},
	author = {Torki, Marwan and Hussein, Mohamed E. and Elsallamy, Ahmed and Fayyaz, Mahmoud and Yaser, Shehab},
	urldate = {2019-05-01},
	date = {2014-11-13},
	year = {2014},
	eprinttype = {arxiv},
	eprint = {1411.3519},
	keywords = {Computer Science - Computer Vision and Pattern Recognition, I.5.2, I.7.5},
	file = {arXiv\:1411.3519 PDF:C\:\\Users\\Mohamed Hussein\\Zotero\\storage\\ZRQW78SU\\Torki et al. - 2014 - Window-Based Descriptors for Arabic Handwritten Al.pdf:application/pdf;arXiv.org Snapshot:C\:\\Users\\Mohamed Hussein\\Zotero\\storage\\REA9GRJU\\1411.html:text/html}
}

This paper presents a comparative study for window-based descriptors on the application of Arabic handwritten alphabet recognition. We show a detailed experimental evaluation of different descriptors with several classifiers. The objective of the paper is to evaluate different window-based descriptors on the problem of Arabic letter recognition. Our experiments clearly show that they perform very well. Moreover, we introduce a novel spatial pyramid partitioning scheme that enhances the recognition accuracy for most descriptors. In addition, we introduce a novel dataset for Arabic handwritten isolated alphabet letters, which can serve as a benchmark for future research.

@inproceedings{DBLP:conf/eScience/GarijoCGBHHJTT14,
  author       = {Daniel Garijo and
                  {\'{O}}scar Corcho and
                  Yolanda Gil and
                  Meredith N. Braskie and
                  Derrek P. Hibar and
                  Xue Hua and
                  Neda Jahanshad and
                  Paul M. Thompson and
                  Arthur W. Toga},
  title        = {Workflow Reuse in Practice: {A} Study of Neuroimaging Pipeline Users},
  booktitle    = {10th {IEEE} International Conference on e-Science, eScience 2014,
                  Sao Paulo, Brazil, October 20-24, 2014},
  pages        = {239--246},
  publisher    = {{IEEE} Computer Society},
  year         = {2014},
  url          = {https://doi.org/10.1109/eScience.2014.33},
  doi          = {10.1109/ESCIENCE.2014.33},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/eScience/GarijoCGBHHJTT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Lamberti2014xDEFENSE:-,
	abstract = {In this work, we propose a modified DEFENSE architecture termed as xDEFENSE that can detect and react to hardware attacks in real-time. In the past, several Root of Trust architectures such as DEFENSE and RETC have been proposed to foil attempts by hardware Trojans to leak sensitive information. In a typical Root of Trust architecture scenario, hardware is allowed to access the memory only by responding properly to a challenge requested by the memory guard. However in a recent effort, we observed that these architectures can in fact be susceptible to a variety of threats ranging from denial of service attacks, privilege escalation to information leakage, by injecting a Trojan into the Root of Trust modules such as memory guards and authorized hardware. In our work, we propose a security monitor that monitors all transactions between the authorized hardware, memory guard and memory. It also authenticates these components through the use of Hashed Message Authentication Codes (HMAC) to detect any invalid memory access or denial of service attack by disrupting the challenge-response pairs. The proposed xDEFENSE architecture was implemented on a Xilinx SPARTAN 3 FPGA evaluation board and our results indicate that xDEFENSE requires 143 additional slices as compared to DEFENSE and incurs a monitoring latency of 22ns.},
	acmid = {2554714},
	address = {New York, NY, USA},
	author = {Lamberti, James and Shila, Devu and Venugopalan, Vivek},
	booktitle = {Proceedings of the 2014 ACM/SIGDA International Symposium on Field-programmable Gate Arrays},
	date-added = {2021-01-30 10:24:01 -0500},
	date-modified = {2021-01-30 10:24:01 -0500},
	isbn = {978-1-4503-2671-1},
	keywords = {architecture, denial of service attacks, hardware trojan threats, information leakage, root of trust, security monitor, trojan detection},
	location = {Monterey, California, USA},
	month = feb,
	numpages = {1},
	pages = {253-253},
	publisher = {ACM},
	series = {FPGA 14},
	title = {{xDEFENSE: An Extended DEFENSE for Mitigating Next Generation Intrusions}},
	year = {2014}}

In this work, we propose a modified DEFENSE architecture termed as xDEFENSE that can detect and react to hardware attacks in real-time. In the past, several Root of Trust architectures such as DEFENSE and RETC have been proposed to foil attempts by hardware Trojans to leak sensitive information. In a typical Root of Trust architecture scenario, hardware is allowed to access the memory only by responding properly to a challenge requested by the memory guard. However in a recent effort, we observed that these architectures can in fact be susceptible to a variety of threats ranging from denial of service attacks, privilege escalation to information leakage, by injecting a Trojan into the Root of Trust modules such as memory guards and authorized hardware. In our work, we propose a security monitor that monitors all transactions between the authorized hardware, memory guard and memory. It also authenticates these components through the use of Hashed Message Authentication Codes (HMAC) to detect any invalid memory access or denial of service attack by disrupting the challenge-response pairs. The proposed xDEFENSE architecture was implemented on a Xilinx SPARTAN 3 FPGA evaluation board and our results indicate that xDEFENSE requires 143 additional slices as compared to DEFENSE and incurs a monitoring latency of 22ns.

@Article{	  vahi2013jgc,
  Author	= {Karan Vahi and Ian Harvey and Taghrid Samak and Daniel
		  Gunter and Kieran Evans and David Rogers and Ian Taylor and
		  Monte Goode and Fabio Silva and Eddie Al-Shakarchi and
		  Gaurang Mehta and Ewa Deelman andrew Jones},
  URL		= {http://link.springer.com/article/10.1007%2Fs10723-013-9265-4},
  Title		= {A Case Study into Using Common Real-Time Workflow
		  Monitoring Infrastructure for Scientific Workflows},
  Journal	= {Journal of Grid Computing},
  Volume	= {11},
  Number	= {3},
  Pages		= {381-406},
  Year		= {2013},
  Note		= {Funding Acknowledgements: NSF grant OCI-0943705}
}

@article {chiang13:ijdar,
   author = {Yao-Yi Chiang and Craig A. Knoblock},
   title = {A General Approach for Extracting Road Vector Data from Raster Maps},
   journal = {International Journal on Document Analysis and Recognition},
   publisher = {Springer, Berlin / Heidelberg},
   year = {2013},
   volume=16,
   number=1,
   pages="55-81",
   urlPaper = "http://usc-isi-i2.github.io/papers/chiang11-ijdar.pdf",
   urlLink = "http://www.springerlink.com/content/p050045151145470/",
   keyword = {"Map Extraction"}
   }

@article{Audhkhasi2013AGlobally-VariantLocally-ConstantModel,
 abstract = {Researchers have shown that fusion of categorical labels from multiple experts humans or machine classifiers improves the accuracy and generalizability of the overall classification system. Simple plurality is a popular technique for performing this fusion, but it gives equal importance to labels from all experts, who may not be equally reliable or consistent across the dataset. Estimation of expert reliability without knowing the reference labels is, however, a challenging problem. Most previous works deal with these challenges by modeling expert reliability as constant over the entire data (feature) space. This paper presents a model based on the consideration that in dealing with real-world data, expert reliability is variable over the complete feature space but constant over local clusters of homogeneous instances. This model jointly learns a classifier and expert reliability parameters without assuming knowledge of the reference labels using the Expectation-Maximization (EM) algorithm. Classification experiments on simulated data, data from the UCI Machine Learning Repository, and two emotional speech classification datasets show the benefits of the proposed model. Using a metric based on the Jensen-Shannon divergence, we empirically show that the proposed model gives greater benefit for datasets where expert reliability is highly variable over the feature space.},
 author = {Audhkhasi, Kartik and Narayanan, Shrikanth S.},
 bib2html_rescat = {annotation modeling},
 doi = {doi.ieeecomputersociety.org/10.1109/TPAMI.2012.139},
 journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
 link = {http://sail.usc.edu/publications/files/06226422.pdf},
 month = {Apr},
 number = {4},
 pages = {769-783},
 title = {A Globally-Variant Locally-Constant Model for Fusion of Labels from Multiple Diverse Experts Without Using Reference Labels},
 volume = {35},
 year = {2013}
}

Researchers have shown that fusion of categorical labels from multiple experts humans or machine classifiers improves the accuracy and generalizability of the overall classification system. Simple plurality is a popular technique for performing this fusion, but it gives equal importance to labels from all experts, who may not be equally reliable or consistent across the dataset. Estimation of expert reliability without knowing the reference labels is, however, a challenging problem. Most previous works deal with these challenges by modeling expert reliability as constant over the entire data (feature) space. This paper presents a model based on the consideration that in dealing with real-world data, expert reliability is variable over the complete feature space but constant over local clusters of homogeneous instances. This model jointly learns a classifier and expert reliability parameters without assuming knowledge of the reference labels using the Expectation-Maximization (EM) algorithm. Classification experiments on simulated data, data from the UCI Machine Learning Repository, and two emotional speech classification datasets show the benefits of the proposed model. Using a metric based on the Jensen-Shannon divergence, we empirically show that the proposed model gives greater benefit for datasets where expert reliability is highly variable over the feature space.

@inproceedings{taheriyan13:iswc,
	author = 	"Mohsen Taheriyan and Craig A. Knoblock and Pedro Szekely and Jose Luis Ambite",
 	title = 	"A Graph-based Approach to Learn Semantic Descriptions of Data Sources",
	booktitle = {Proceedings of the 12th International Semantic Web Conference (ISWC 2013)},
	year = 	"2013",
       	Keywords = {"Source modeling"},
	urlPaper= "http://usc-isi-i2.github.io/papers/taheriyan13-iswc.pdf",
	urlSlides={http://www.slideshare.net/slideshow/embed_code/27603846},
	urlLink={http://link.springer.com/book/10.1007\%2F978-3-642-41335-3},
	urlBook={http://www.springer.com/computer/ai/book/978-3-642-41334-6}
	}	

@TechReport{Cai13c,
	author = 	"Xue Cai and John Heidemann and Walter Willinger",
	title = 	"A Holistic Framework for Bridging Regional Threats to
User {QoE}",
	 institution = 	"USC/Information Sciences Institute",
	 year = 		2013,
	 sortdate = 		"2013-12-01",
	project = "ant, lacrend",
	jsubject = "routing",
	 number =	"ISI-TR-2013-687",
	 month = 	dec,
	 jlocation = 	"johnh: pafile",
	 keywords =	"threat models, QoE",
	 copyrightholder = "author",
	 url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Cai13c.html",
	 pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Cai13c.pdf",
	 otherurl = "ftp://ftp.isi.edu/isi-pubs/tr-687.pdf",
	 myorganization =	"USC/Information Sciences Institute",
	blogurl = 	"https://ant.isi.edu/blog/?p=427",
	 abstract = "\emph{Submarine cable cuts} have become
increasingly common, with five
incidents breaking more than ten cables in the last three years.
Today, around%7e300 cables carry the majority of international Internet
traffic, so a single cable cut can affect millions of users, and
repairs to any cut are expensive and time consuming.  Prior work has
either measured the impact following incidents, or predicted the
results of network changes to relatively abstract Internet topological
models.  In this paper, we develop a new approach to model cable cuts.
Our approach differs by following \emph{problems} drawn from
real-world occurrences all the way to their impact on
\emph{end-users}.  Because our approach spans many layers, no single
organization can provide all the data needed to apply the model.  We
therefore perform \emph{what-if} analysis to study a range of
possibilities.  With this approach we evaluate four incidents in 2012
and 2013; our analysis suggests general rules that assess the degree
of a country's vulnerability to a cut.
"
}

\emphSubmarine cable cuts have become increasingly common, with five incidents breaking more than ten cables in the last three years. Today, around%7e300 cables carry the majority of international Internet traffic, so a single cable cut can affect millions of users, and repairs to any cut are expensive and time consuming. Prior work has either measured the impact following incidents, or predicted the results of network changes to relatively abstract Internet topological models. In this paper, we develop a new approach to model cable cuts. Our approach differs by following \emphproblems drawn from real-world occurrences all the way to their impact on \emphend-users. Because our approach spans many layers, no single organization can provide all the data needed to apply the model. We therefore perform \emphwhat-if analysis to study a range of possibilities. With this approach we evaluate four incidents in 2012 and 2013; our analysis suggests general rules that assess the degree of a country's vulnerability to a cut.

@article{Arbib2013a,
	abstract = {We present principles for an integrated neuroinformatics framework which makes explicit how models are grounded on empirical evidence, explain (or not) existing empirical results and make testable predictions. The new ontological framework makes explicit how models bring together structural, functional, and related empirical observations. We emphasize schematics of the model's operation linked to summaries of empirical data (SEDs) used in both the design and testing of the model, with tests comparing SEDs to summaries of simulation results (SSRs) from the model. We stress the importance of protocols for models as well as experiments. We complement the structural ontology of nested brain structures with a functional ontology of Brain Operating Principles (BOPs) for observed neural function and an ontological framework for grounding models in empirical data. We present an implementation of this ontological framework in the Brain Operation Database (BODB), an environment in which modelers and experimentalists can work together by making use of their shared empirical data, models and expertise.},
	author = {Arbib, Michael A and Plangprasopchok, Anon and Bonaiuto, James and Schuler, Robert E},
	bdsk-url-2 = {https://doi.org/10.1007/s12021-013-9209-y},
	date-added = {2018-09-12 15:47:54 -0700},
	date-modified = {2020-10-12 10:35:01 -0700},
	file = {/Users/schuler/Zotero/storage/ASW8DVTK/Arbib et al. - 2013 - A Neuroinformatics of Brain Modeling and its Imple.pdf},
	issn = {1559-0089},
	journal = {Neuroinformatics},
	month = nov,
	number = {1},
	pmid = {24234915},
	title = {A {{Neuroinformatics}} of {{Brain Modeling}} and Its {{Implementation}} in the {{Brain Operation Database BODB}}.},
	volume = {12},
	year = {2013}}

We present principles for an integrated neuroinformatics framework which makes explicit how models are grounded on empirical evidence, explain (or not) existing empirical results and make testable predictions. The new ontological framework makes explicit how models bring together structural, functional, and related empirical observations. We emphasize schematics of the model's operation linked to summaries of empirical data (SEDs) used in both the design and testing of the model, with tests comparing SEDs to summaries of simulation results (SSRs) from the model. We stress the importance of protocols for models as well as experiments. We complement the structural ontology of nested brain structures with a functional ontology of Brain Operating Principles (BOPs) for observed neural function and an ontological framework for grounding models in empirical data. We present an implementation of this ontological framework in the Brain Operation Database (BODB), an environment in which modelers and experimentalists can work together by making use of their shared empirical data, models and expertise.

@misc{w3c-provenance-primer-13,
 title = {A Primer for the PROV Provenance Model},
 author = {Yolanda Gil and Simon Miles and Khalid Belhajjame and Henela Deus and Daniel Garijo and Graham Klyne and Paolo Missier and Stian Soiland-Reyes and Stephan Zednik},
 note = {World Wide Web Consortium (W3C)},
 year = {2013},
 url = {http://www.w3.org/TR/prov-primer/ }
}

@inproceedings{zhang13:ijcai,
  	author = {Ying Zhang and Yao-Yi Chiang and Pedro Szekely and Craig A. Knoblock},
  	title = {A Semantic Approach to Retrieving, Linking, and Integrating Heterogeneous Geospatial Data},
  	booktitle = {Proceedings of the 2013 IJCAI Workshop on Semantic Cities},
 	year = {2013},
  	urlpaper = {http://usc-isi-i2.github.io/papers/zhang13-semantic-cities.pdf},
	urlslides = {http://www.slideshare.net/slideshow/embed_code/28009324}
}

@inproceedings{Tsiartas2013AStudyonthe,
 author = {Tsiartas, Andreas and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 booktitle = {International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2013.6639303},
 link = {http://sail.usc.edu/publications/files/STUDAFFE_AT.pdf},
 location = {Vancouver, Canada},
 month = {May},
 title = {A Study on the Effect of prosodic emphasis on overall speech translation quality},
 year = {2013}
}

@article{lan2013clock,
  title={A clock directly linking time to a particle's mass},
  author={Lan, Shau-Yu and Kuan, Pei-Chen and Estey, Brian and English, Damon and Brown, Justin M and Hohensee, Michael A and M{\"u}ller, Holger},
  journal={Science},
  volume={339},
  number={6119},
  pages={554--557},
  year={2013},
  publisher={American Association for the Advancement of Science}
}

@inproceedings{barnhart2013market,
  title={A market for satellite cellularization: a first look at the implementation and potential impact of satlets},
  author={Barnhart, David and Hill, Lisa and Fowler, Erin and Hunter, Roger and Hoag, Lucille and Sullivan, Brook and Will, Peter},
  booktitle={Proceedings of AIAA Space 2013Conference and Exposition. Washington DC: AIAA},
  pages={2579--2589},
  year={2013},
  month = jan
}

@inproceedings{walters2013practical,
  title={A practical characterization of a NASA SpaceCube application through fault emulation and laser testing},
  author={Walters, John Paul and Zick, Kenneth M and French, Matthew},
  booktitle={2013 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)},
  pages={1--8},
  year={2013},
  organization={IEEE}
}

@inproceedings{Van2013Arobustfrontendfor,
 author = {Van Segbroeck, Maarten and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
 doi = {https://doi.org/10.1109/icassp.2013.6639039},
 link = {http://sail.usc.edu/publications/files/ROBFRONT_MVS.pdf},
 location = {Vancouver, Canada},
 month = {May},
 title = {A robust frontend for ASR: combining denoising, noise masking and feature normalization},
 year = {2013}
}

@inproceedings{Vaz2013Atwosteptechniquefor,
 author = {Vaz, Colin and Ramanarayanan, Vikram and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/vaz_best_paper.pdf},
 location = {Lyon, France  [BEST STUDENT PAPER]},
 month = {Aug},
 title = {A two-step technique for MRI audio enhancement using dictionary learning and wavelet packet analysis},
 year = {2013}
}

@inproceedings{belhajjame2013workflow,
	title        = {A workflow PROV-corpus based on taverna and wings},
	author       = {Belhajjame, Khalid and Zhao, Jun and Garijo, Daniel and Garrido, Aleix and Soiland-Reyes, Stian and Alper, Pinar and Corcho, Oscar},
	year         = 2013,
	booktitle    = {Proceedings of the Joint EDBT/ICDT 2013 Workshops},
	pages        = {331--332},
	doi          = {10.1145/2457317.2457376},
	url          = {https://dgarijo.com/papers/prov-bench-paper.pdf},
	organization = {ACM}
}

@article{Gupta2013ASSESSMENTOFACHILDS,
 author = {Gupta, Rahul and Lee, Chi-Chun and Lee, Sungbok and Narayanan, Shrikanth},
 bib2html_rescat = {},
 doi = {},
 journal = {Workshop on Affective social speech signals, Grenoble},
 link = {http://sail.usc.edu/publications/files/rabc_paper (1).pdf},
 title = {ASSESSMENT OF A CHILDS ENGAGEMENT USING SEQUENCE MODEL BASED FEATURES},
 year = {2013}
}

@inproceedings{Venugopal2013Accelerati,
	abstract = {Light Detection and Ranging (LiDAR) sensors are used for acquiring high density topographical data with extremely high spatial resolution. Many LiDAR-based applications, e.g. unmanned autonomous ground and air vehicles require realtime processing capabilities for navigation. The processing of the massive LiDAR data is time consuming due to the magnitude of the data produced and also due to the computationally iterative nature of the algorithms. Graphics Processing Units (GPU) consist of massively parallel cores, have high memory bandwidth and are being widely used as specialized hardware accelerators. A GPU-based parallel LiDAR processing algorithm is implemented with GPU specific memory architecture optimizations. The GPU implementation in this study significantly reduces the processing time of the LiDAR data as compared to CPU-based implementation.},
	author = {Venugopalan, Vivek and Kannan, Suresh},
	booktitle = {IEEE 56th International Midwest Symposium on Circuits and Systems (MWSCAS)},
	date-added = {2020-01-15 12:02:05 -0500},
	date-modified = {2020-01-15 12:02:05 -0500},
	issn = {1548-3746},
	keywords = {LiDAR;graphics processing units;parallel processing;unmanned autonomous vehicles},
	month = aug,
	pages = {1168-1171},
	title = {{Accelerating Real-Time LIDAR Data Processing Using GPUs}},
	year = {2013},
	Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxAwLi4vLi4vcmVmZXJlbmNlcy9QREYvVmVudWdvcGFsMjAxM0FjY2VsZXJhdGkucGRmTxEBkgAAAAABkgACAAAMTWFjaW50b3NoIEhEAAAAAAAAAAAAAAAAAAAAAAAAAEJEAAH/////G1ZlbnVnb3BhbDIwMTNBY2NlbGVyYXRpLnBkZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP////8AAAAAAAAAAAAAAAAAAgADAAAKIGN1AAAAAAAAAAAAAAAAAANQREYAAAIAQS86VXNlcnM6dml2ZWt2OkRyb3Bib3g6cmVmZXJlbmNlczpQREY6VmVudWdvcGFsMjAxM0FjY2VsZXJhdGkucGRmAAAOADgAGwBWAGUAbgB1AGcAbwBwAGEAbAAyADAAMQAzAEEAYwBjAGUAbABlAHIAYQB0AGkALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAD9Vc2Vycy92aXZla3YvRHJvcGJveC9yZWZlcmVuY2VzL1BERi9WZW51Z29wYWwyMDEzQWNjZWxlcmF0aS5wZGYAABMAAS8AABUAAgAN//8AAAAIAA0AGgAkAFcAAAAAAAACAQAAAAAAAAAFAAAAAAAAAAAAAAAAAAAB7Q==},
	Bdsk-Url-1 = {http://dx.doi.org/10.1109/MWSCAS.2013.6674861}}

Light Detection and Ranging (LiDAR) sensors are used for acquiring high density topographical data with extremely high spatial resolution. Many LiDAR-based applications, e.g. unmanned autonomous ground and air vehicles require realtime processing capabilities for navigation. The processing of the massive LiDAR data is time consuming due to the magnitude of the data produced and also due to the computationally iterative nature of the algorithms. Graphics Processing Units (GPU) consist of massively parallel cores, have high memory bandwidth and are being widely used as specialized hardware accelerators. A GPU-based parallel LiDAR processing algorithm is implemented with GPU specific memory architecture optimizations. The GPU implementation in this study significantly reduces the processing time of the LiDAR data as compared to CPU-based implementation.

@inproceedings{Bone2013Acoustic-ProsodicTurn-takingandLanguage,
 author = {Bone, Daniel and Lee, Chi-Chun and Chaspari, Theodora and Black, Matthew P. and Williams, Marian and Lee, Sungbok and Levitt, Pat and Narayanan, Shrikanth S.},
 bib2html_rescat = {care},
 booktitle = {Proceedings of InterSpeech},
 doi = {10.21437/Interspeech.2016-1073},
 link = {http://sail.usc.edu/publications/files/bone_acoustic.PDF},
 location = {Lyon, France},
 month = {Aug},
 pages = {2400-2404},
 title = {Acoustic-Prosodic, Turn-taking, and Language Cues in Child-Psychologist Interactions for Varying Social Demand},
 year = {2013}
}

@incollection{galstyan2013activation,
  title={Activation Cascades in Structured Populations},
  author={Galstyan, Aram},
  booktitle={Handbook of Human Computation},
  pages={779--789},
  year={2013},
  publisher={Springer, New York, NY}
}

@Misc{Heidemann13d,
	author = 	"John Heidemann",
	title = 	"Active Probing of Edge Networks: 
                   {Hurricane} {Sandy} and Beyond",
	howpublished = "Talk given at FCC Workshop on Network Resiliency",
	month = 	feb,
	year = 	2013,
	sortdate = 	"2013-02-06",
	project = "ant, lacrend, lander, duoi",
	jsubject = "routing",
	jlocation = 	"johnh: pafile",
	keywords = 	"ant, network outages, hurricane sandy, fcc",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13d.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13d.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "No formal abstract, but this talk summarized our
                  analysis of outages in edge networks at the time of
                  Hurricane Sandy.  This analysis showed U.S. networks
                  had double the outage rate (from 0.2\% to 0.4\%) on
                  2012-10-30, the day after Sandy landfall, and
                  recovered after four days.  It also describes our
                  goal of tracking all outages in the Internet.
		The talk was part of the
                  FCC workshop on Network Resiliency,
		hosted at Brooklyn Law College by Henning Schulzrinne.",
}

No formal abstract, but this talk summarized our analysis of outages in edge networks at the time of Hurricane Sandy. This analysis showed U.S. networks had double the outage rate (from 0.2% to 0.4%) on 2012-10-30, the day after Sandy landfall, and recovered after four days. It also describes our goal of tracking all outages in the Internet. The talk was part of the FCC workshop on Network Resiliency, hosted at Brooklyn Law College by Henning Schulzrinne.

@Misc{Heidemann13b,
	author = 	"John Heidemann",
	title = 	"Active Probing of Edge Networks: Outages
                  During {Hurricane} {Sandy}",
	howpublished = "Talk given at NANOG57 as part of panel
                  hosted by James Cowie",
	month = 	feb,
	year = 	2013,
	sortdate = 	"2013-02-06",
	project = "ant, lacrend, lander, duoi",
	jsubject = "routing",
	jlocation = 	"johnh: pafile",
	keywords = 	"ant, network outages, hurricane sandy",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13b.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13b.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "No formal abstract, but this talk summarizes our
                  analysis of outages in edge networks at the time of
                  Hurricane Sandy.  This analysis showed U.S. networks
                  had double the outage rate (from 0.2\% to 0.4\%) on
                  2012-10-30, the day after Sandy landfall, and
                  recovered after four days.  The talk was part of the
                  panel ``Internet Impacts of Hurricane Sandy'',
                  moderated by James Cowie, with presentations 
		by John Heidemann, USC/Information Sciences Institute;
		Emile Aben, RIPE NCC; Patrick Gilmore, Akamai;
		Doug Madory, Renesys",
}

No formal abstract, but this talk summarizes our analysis of outages in edge networks at the time of Hurricane Sandy. This analysis showed U.S. networks had double the outage rate (from 0.2% to 0.4%) on 2012-10-30, the day after Sandy landfall, and recovered after four days. The talk was part of the panel ``Internet Impacts of Hurricane Sandy'', moderated by James Cowie, with presentations by John Heidemann, USC/Information Sciences Institute; Emile Aben, RIPE NCC; Patrick Gilmore, Akamai; Doug Madory, Renesys

@inproceedings{Gibson2013AnAudio-VisualApproachTo,
 author = {Gibson, James and Xiao, Bo and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {bsp},
 booktitle = {Proceedings of the IEEE International Conference on Multimedia \& Expo (ICME)},
 doi = {10.1109/ICMEW.2013.6618248},
 link = {http://sail.usc.edu/publications/files/gibson_icme_2013.pdf},
 location = {San Jose, CA},
 month = {Jul},
 title = {An Audio-Visual Approach To Learning Salient Behaviors In Couples Problem Solving Discussions},
 year = {2013}
}

@article{Ramanarayanan2013Aninvestigationofarticulatory,
 author = {Ramanarayanan, Vikram and Goldstein, Louis and Byrd, Dani and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 doi = {10.1121/1.4807639},
 journal = {The Journal of the Acoustical Society of America},
 link = {http://sail.usc.edu/publications/files/Vikram-AS-JASA-2013.pdf},
 month = {Jul},
 number = {1},
 pages = {510-519},
 title = {An Investigation of Articulatory Setting Using Real-time Magnetic Resonance Imaging},
 volume = {134},
 year = {2013}
}

@article{Richard2013AnOverviewonPerceptually,
 author = {Richard, Gael and Sundaram, Shiva and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 doi = {https://doi.org/10.1109/jproc.2013.2251591},
 journal = {Proceedings of IEEE},
 month = {Sep},
 number = {9},
 pages = {1939 - 1954},
 title = {An Overview on Perceptually Motivated Audio Indexing and Classification},
 volume = {101},
 year = {2013}
}

@inproceedings{DBLP:conf/icdm/KejriwalM13,
  author    = {Mayank Kejriwal and
               Daniel P. Miranker},
  editor    = {Hui Xiong and
               George Karypis and
               Bhavani M. Thuraisingham and
               Diane J. Cook and
               Xindong Wu},
  title     = {An Unsupervised Algorithm for Learning Blocking Schemes},
  booktitle = {2013 {IEEE} 13th International Conference on Data Mining, Dallas,
               TX, USA, December 7-10, 2013},
  pages     = {340--349},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {https://doi.org/10.1109/ICDM.2013.60},
  doi       = {10.1109/ICDM.2013.60},
  timestamp = {Fri, 03 Apr 2020 17:07:23 +0200},
  biburl    = {https://dblp.org/rec/conf/icdm/KejriwalM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iui/GilKZZS13,
  author       = {Yolanda Gil and
                  Angela Knight and
                  Kevin Zhang and
                  Larry Zhang and
                  Ricky J. Sethi},
  editor       = {Jihie Kim and
                  Jeffrey Nichols and
                  Pedro A. Szekely},
  title        = {An initial analysis of semantic wikis},
  booktitle    = {18th International Conference on Intelligent User Interfaces, {IUI}
                  '13, Santa Monica, CA, USA, March 19-22, 2013, Companion Volume},
  pages        = {109--110},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2451176.2451224},
  doi          = {10.1145/2451176.2451224},
  timestamp    = {Sun, 26 Nov 2023 00:57:51 +0100},
  biburl       = {https://dblp.org/rec/conf/iui/GilKZZS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Bone2013AnalyzingEye-VoiceCoordinationin,
 author = {Bone, Daniel and Lee, Chi-Chun and Ramanarayanan, Vikram and Narayanan, Shrikanth S. and Hoedemaker, Renske S. and Gordon, Peter C.},
 bib2html_rescat = {bsp},
 booktitle = {Proceedings of InterSpeech},
 doi = {10.1186/1866-1955-6-33},
 link = {http://sail.usc.edu/publications/files/bone_ran.PDF},
 location = {Lyon, France},
 month = {Aug},
 pages = {2425-2429},
 title = {Analyzing Eye-Voice Coordination in Rapid Automatized Naming},
 year = {2013}
}

@inproceedings{Chaspari2013Analyzingthestructureof,
 author = {Chaspari, Theodora and Mower Provost, Emily and Narayanan, Shrikanth S.},
 bib2html_rescat = {care},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/chaspari_entity.PDF},
 location = {Lyon, France},
 month = {Aug},
 title = {Analyzing the structure of parent-moderated narratives from children with ASD using an entity-based approach},
 year = {2013}
}

@inproceedings{Kim2013AnnotationAndClassificationOf,
 author = {Kim, Samuel and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {mica},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/kim_political.PDF},
 location = {Lyon, France},
 month = {Aug},
 title = {Annotation And Classification Of Political Advertisements},
 year = {2013}
}

@inproceedings{Metallinou2013AnnotationandProcessingof,
 author = {Metallinou, Angeliki and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 booktitle = {2nd International Workshop on Emotion Representation, Analysis and Synthesis in Continuous Time and Space (EmoSPACE 2013)},
 doi = {https://doi.org/10.1109/fg.2013.6553804},
 keywird = {emotion},
 link = {http://sail.usc.edu/publications/files/Metallinou-Emospace-2013.pdf},
 location = {Shanghai, China},
 month = {Apr},
 title = {Annotation and Processing of Continuous Emotional Attributes: Challenges and Opportunities},
 year = {2013}
}

@misc{sankaran2013apparatus,
  title={Apparatus and method for sharing a generic configuration across a group of network devices},
  author={Sankaran, Ganesh C},
  year={2013},
  month=oct # "~8",
  note={US Patent 8,799,427}
}

@inproceedings{Toutios2013ArticulatorySynthesisofFrench,
 author = {Toutios, Asterios and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/toutios_articulatory.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {Articulatory Synthesis of French Connected Speech from EMA Data},
 year = {2013}
}

@inproceedings{Ramanarayanan2013Articulatorysettingsfacilitatemechanically,
 author = {Ramanarayanan, Vikram and Lammert, Adam and Goldstein, Louis and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/vikram_articulatory.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {Articulatory settings facilitate mechanically advantageous motor control of vocal tract articulators},
 year = {2013}
}

@article{ParkChengPendergrassEtAl2013,
	abstract = {Common obesity risk variants have been associated with macronutrient intake; however, these associations' generalizability across populations has not been demonstrated. We investigated the associations between 6 obesity risk variants in (or near) the NEGR1, TMEM18, BDNF, FTO, MC4R, and KCTD15 genes and macronutrient intake (carbohydrate, protein, ethanol, and fat) in 3 {Population Architecture using Genomics and Epidemiology} (PAGE) studies: the Multiethnic Cohort Study (1993-2006) (n = 19,529), the Atherosclerosis Risk in Communities Study (1987-1989) (n = 11,114), and the Epidemiologic Architecture for Genes Linked to Environment (EAGLE) Study, which accesses data from the Third National Health and Nutrition Examination Survey (1991-1994) (n = 6,347). We used linear regression, with adjustment for age, sex, and ethnicity, to estimate the associations between obesity risk genotypes and macronutrient intake. A fixed-effects meta-analysis model showed that the FTO rs8050136 A allele (n = 36,973) was positively associated with percentage of calories derived from fat (βmeta = 0.2244 (standard error, 0.0548); P = 4 × 10(-5)) and inversely associated with percentage of calories derived from carbohydrate (βmeta = -0.2796 (standard error, 0.0709); P = 8 × 10(-5)). In the Multiethnic Cohort Study, percentage of calories from fat assessed at baseline was a partial mediator of the rs8050136 effect on body mass index (weight (kg)/height (m)(2)) obtained at 10 years of follow-up (mediation of effect = 0.0823 kg/m(2), 95% confidence interval: 0.0559, 0.1128). Our data provide additional evidence that the association of FTO with obesity is partially mediated by dietary intake.},
	author = {Park, Sungshim Lani and Cheng, Iona and Pendergrass, Sarah A. and Kucharska-Newton, Anna M. and Lim, Unhee and Ambite, Jose Luis and Caberto, Christian P. and Monroe, Kristine R. and Schumacher, Fredrick and Hindorff, Lucia A. and Oetjens, Matthew T. and Wilson, Sarah and Goodloe, Robert J. and Love, Shelly-Ann and Henderson, Brian E. and Kolonel, Laurence N. and Haiman, Christopher A. and Crawford, Dana C. and North, Kari E. and Heiss, Gerardo and Ritchie, Marylyn D. and Wilkens, Lynne R. and Le Marchand, Lo{\"\i}c},
	chemicals = {Dietary Fats, Proteins, Alpha-Ketoglutarate-Dependent Dioxygenase FTO, FTO protein, human},
	citation-subset = {IM},
	completed = {2013-11-04},
	country = {United States},
	doi = {10.1093/aje/kwt028},
	issn = {1476-6256},
	issn-linking = {0002-9262},
	issue = {5},
	journal = {American journal of epidemiology},
	keywords = {Adult; Aged; Alpha-Ketoglutarate-Dependent Dioxygenase FTO; Continental Population Groups, genetics; Diet; Dietary Fats, administration & dosage; Energy Intake; Ethnic Groups, genetics; Female; Genotype; Humans; Male; Middle Aged; Obesity, ethnology, genetics; Polymorphism, Single Nucleotide; Proteins, genetics; Risk Factors; energy intake; fat mass and obesity-associated (FTO) gene; obesity; percent calories from fat; race/ethnicity},
	month = sep,
	nlm-id = {7910653},
	owner = {NLM},
	pages = {780--790},
	pii = {kwt028},
	pmc = {PMC3755639},
	pmid = {23820787},
	url = {https://pubmed.ncbi.nlm.nih.gov/23820787/},

	pubmodel = {Print-Electronic},
	pubstate = {ppublish},
	revised = {2018-11-13},
	title = {Association of the {FTO} obesity risk variant rs8050136 with percentage of energy intake from fat in multiple racial/ethnic populations: the {PAGE} study.},
	volume = {178},
	year = {2013},
	bdsk-url-1 = {https://pubmed.ncbi.nlm.nih.gov/23820787/},
	bdsk-url-2 = {https://doi.org/10.1093/aje/kwt028}}

Common obesity risk variants have been associated with macronutrient intake; however, these associations' generalizability across populations has not been demonstrated. We investigated the associations between 6 obesity risk variants in (or near) the NEGR1, TMEM18, BDNF, FTO, MC4R, and KCTD15 genes and macronutrient intake (carbohydrate, protein, ethanol, and fat) in 3 Population Architecture using Genomics and Epidemiology (PAGE) studies: the Multiethnic Cohort Study (1993-2006) (n = 19,529), the Atherosclerosis Risk in Communities Study (1987-1989) (n = 11,114), and the Epidemiologic Architecture for Genes Linked to Environment (EAGLE) Study, which accesses data from the Third National Health and Nutrition Examination Survey (1991-1994) (n = 6,347). We used linear regression, with adjustment for age, sex, and ethnicity, to estimate the associations between obesity risk genotypes and macronutrient intake. A fixed-effects meta-analysis model showed that the FTO rs8050136 A allele (n = 36,973) was positively associated with percentage of calories derived from fat (βmeta = 0.2244 (standard error, 0.0548); P = 4 × 10(-5)) and inversely associated with percentage of calories derived from carbohydrate (βmeta = -0.2796 (standard error, 0.0709); P = 8 × 10(-5)). In the Multiethnic Cohort Study, percentage of calories from fat assessed at baseline was a partial mediator of the rs8050136 effect on body mass index (weight (kg)/height (m)(2)) obtained at 10 years of follow-up (mediation of effect = 0.0823 kg/m(2), 95% confidence interval: 0.0559, 0.1128). Our data provide additional evidence that the association of FTO with obesity is partially mediated by dietary intake.

@inproceedings{Hodas13icme,
    abstract = {As the rate of content production grows, we must make a staggering number of
daily decisions about what information is worth acting on. For any flourishing
online social media system, users can barely keep up with the new content
shared by friends. How does the user-interface design help or hinder users'
ability to find interesting content? We analyze the choices people make about
which information to propagate on the social media sites Twitter and Digg. We
observe regularities in behavior which can be attributed directly to cognitive
limitations of humans, resulting from the different visibility policies of each
site. We quantify how people divide their limited attention among competing
sources of information, and we show how the user-interface design can mediate
information spread.},
    author = {Hodas, Nathan O. and Lerman, Kristina},
    keywords = {social-dynamics},
    title = {Attention and Visibility in an Information Rich World},
    booktitle = {Proceedings of the 2nd International ICME Workshop on Social Multimedia Research},
    urlPaper = {http://arxiv.org/abs/1307.4798},
    year = {2013}
}

As the rate of content production grows, we must make a staggering number of daily decisions about what information is worth acting on. For any flourishing online social media system, users can barely keep up with the new content shared by friends. How does the user-interface design help or hinder users' ability to find interesting content? We analyze the choices people make about which information to propagate on the social media sites Twitter and Digg. We observe regularities in behavior which can be attributed directly to cognitive limitations of humans, resulting from the different visibility policies of each site. We quantify how people divide their limited attention among competing sources of information, and we show how the user-interface design can mediate information spread.

@inproceedings{Li2013AutomaticClassificationofPalatal,
 author = {Li, Ming and Lammert, Adam and Kim, Jangwon and Ghosh, Prasanta Kumar and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 booktitle = {ISCA Workshop on Speech Production in Automatic Speech Recognition (SPASR)},
 link = {http://sail.usc.edu/publications/files/LI_INTERSPEECH_2013.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {Automatic Classification of Palatal and Pharyngeal Wall Shape Categories from Speech Acoustics and Inverted Articulatory Signals},
 year = {2013}
}

@inbook{inbook,
author = {Boschee, Elizabeth and Natarajan, Premkumar and Weischedel, Ralph},
year = {2013},
month = {11},
pages = {51-67},
title = {Automatic Extraction of Events from Open Source Text for Predictive Forecasting},
journal = {Handbook of Computational Approaches to Counterterrorism},
doi = {10.1007/978-1-4614-5311-6_3}
}

@article{Li2013AutomaticSpeakerAgeand,
 author = {Li, Ming and Han, Kyu Jeong and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 doi = {dx.doi.org/10.1016/j.csl.2012.01.008.},
 journal = {Computer, Speech, and Language},
 link = {http://sail.usc.edu/publications/files/1-s2.0-S0885230812000101-main.pdf},
 month = {Jan},
 number = {1},
 pages = {151-167},
 title = {Automatic Speaker Age and Gender Recognition Using Acoustic and Prosodic Level Information Fusion},
 volume = {27},
 year = {2013}
}

@InProceedings{	  chen2013balanced,
  Author	= {Weiwei Chen and Ferreira da Silva, Rafael and Ewa Deelman
		  and Rizos Sakellariou},
  URL		= {http://pegasus.isi.edu/publications/2013/chen-clustering-escience2013.pdf},
  Title		= {Balanced Task Clustering in Scientific Workflows},
  BookTitle	= {9th IEEE International Conference on e-Science (eScience
		  2013)},
  Year		= {2013},
  Note		= {Funding Acknowledgments: NSF IIS-0905032 and NSF
		  FutureGrid 0910812}
}

@article{Narayanan2013BehavioralSignalProcessing:Deriving,
 author = {Narayanan, Shrikanth S. and Georgiou, Panayiotis},
 bib2html_rescat = {bsp},
 doi = {10.1109/JPROC.2012.2236291},
 journal = {Proceedings of IEEE},
 link = {http://sail.usc.edu/publications/files/bsp-ieeeproc-narayanan-2013.pdf},
 month = {May},
 number = {5},
 pages = {1203-1233},
 title = {Behavioral Signal Processing: Deriving Human Behavioral Informatics from Speech and Language},
 volume = {101},
 year = {2013}
}

@InProceedings{	  mclennan2013masses,
  Author	= {Michael McLennan and Steve Clark and Frank McKenna and Ewa
		  Deelman and Mats Rynge and Karan Vahi and Derrick Kearney
		  and Carol Song},
  URL		= {http://pegasus.isi.edu/publications/2013/McLennan_Pegasus_Hubzero.pdf},
  Title		= {Bringing Scientific Workflow to the Masses via Pegasus and
		  HUBzero},
  BookTitle	= {Proceedings of the 5th International Workshop on Science
		  Gateways},
  Year		= {2013},
  Note		= {Funding Acknowledgements: NSF grants CBET-0941302,
		  CMMI-0927178, OCI-1148515, and OCI-0943705}
}

@inproceedings{kale-etal-aaaifssdi13, 
  title = {Capturing Data Analysis Expertise with Visualization in Workflows},
  author = {David Kale and Samuel Di and Yan Liu and Yolanda Gil},
  year      = {2013},
 address = {Arlington, Virginia},
  booktitle = {AAAI Fall Symposium on Discovery Informatics: AI Takes a Science-Centered View on Big Data},
 url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/kale-etal-aaaifss13.pdf}
}

@Article{	  juve2013characterizing,
  Author	= {Gideon Juve and Ann Chervenak and Ewa Deelman and Shishir
		  Bharathi and Gaurang Mehta and Karan Vahi},
  URL		= {http://pegasus.isi.edu/publications/2013/JuveG-Characterizing.pdf},
  Title		= {Characterizing and Profiling Scientific Workflows},
  Journal	= {Future Generation Computer Systems},
  Volume	= {29},
  Number	= {3},
  Pages		= {682-692},
  Month		= {March},
  Year		= {2013}
}

@inproceedings{Bone2013ClassifyingLanguage-RelatedDevelopmentalDisorders,
 author = {Bone, Daniel and Chaspari, Theodora and Audhkhasi, Kartik and Gibson, James and Tsiartas, Andreas and Van Segbroeck, Maarten and Li, Ming and Lee, Sungbok and Narayanan, Shrikanth S.},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/bone_language.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {Classifying Language-Related Developmental Disorders from Speech Cues: the Promise and the Potential Confounds},
 year = {2013}
}

@article{PhysRevA.88.012103,
  title = {Coarse graining can beat the rotating-wave approximation in quantum Markovian master equations},
  author = {Majenz, Christian and Albash, Tameem and Breuer, Heinz-Peter and Lidar, Daniel A.},
  journal = {Phys. Rev. A},
  volume = {88},
  issue = {1},
  pages = {012103},
  numpages = {16},
  year = {2013},
  month = {Jul},
  publisher = {American Physical Society},
  doi = {10.1103/PhysRevA.88.012103},
  url = {https://link.aps.org/doi/10.1103/PhysRevA.88.012103}
}

@article{kianercy2013coevolutionary,
  title={Coevolutionary networks of reinforcement-learning agents},
  author={Kianercy, Ardeshir and Galstyan, Aram},
  journal={Physical Review E},
  volume={88},
  number={1},
  pages={012815},
  year={2013},
  publisher={American Physical Society}
}

@inproceedings{Tan2013CombiningWindowPredictionsEfficiently--,
 author = {Tan, Qun Feng and Narayanan, Shrikanth S.},
 booktitle = {International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2013.6639030},
 link = {http://sail.usc.edu/publications/files/tan_icassp_2013.pdf},
 location = {Vancouver, Canada},
 month = {May},
 title = {Combining Window Predictions Efficiently-- A new imputation Approach for noise robust Automatic Speech Recognition},
 year = {2013}
}

@article{garijo-etal-fgcs13, 
  title = {Common Motifs in Scientific Workflows: An Empirical Analysis},
  author = {Daniel Garijo and Pinar Alper and Khalid Belhajjame and Oscar Corcho and Yolanda Gil and Carole Goble},
  year      = {2013},
 journal = {Future Generation Computer Systems},
  ee = {http://dx.doi.org/10.1016/j.future.2013.09.018}
}

@Article{	  juve2013comparing,
  Author	= {Gideon Juve and Mats Rynge and Ewa Deelman and Jens-S.
		  Vöckler and G. Bruce Berriman},
  URL		= {http://pegasus.isi.edu/publications/2013/JuveG-Comparing.pdf},
  Title		= {Comparing FutureGrid, Amazon EC2, and Open Science Grid
		  for Scientific Workflows},
  Journal	= {Computing in Science and Engineering},
  Volume	= {15},
  Number	= {4},
  Pages		= {20-29},
  Year		= {2013},
  Note		= {Funding: NSF OCI-0943725 and OCI-0910812, Amazon Web
		  Services Educational Grant).}
}

@inproceedings{szekely13:eswc,
  title = {Connecting the Smithsonian American Art Museum to the Linked Data Cloud},
  author = {Pedro Szekely and Craig A. Knoblock and Fengyu Yang and Xuming Zhu and Eleanor Fink and Rachel Allen and Georgina Goodlander},
  booktitle = {Proceedings of the 10th Extended Semantic Web Conference},
  address = {Montpellier},
  month = {May},
  year = {2013},
  urlSlides = {http://www.slideshare.net/slideshow/embed_code/22842834"},
  urlPaper= "http://usc-isi-i2.github.io/papers/szekely13-eswc.pdf",
  note = "Awarded Best In-Use Paper at ESWC 2013"
}

@inproceedings{Mal2013ContinuousmodelsofAffect,
 author = {Malandrakis, Nikolaos and Potamianos, Alexandros and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 booktitle = {International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2013.6639324},
 link = {http://sail.usc.edu/publications/files/06639324.pdf},
 location = {Vancouver, Canada},
 month = {May},
 title = {Continuous models of Affect from text using n-grams},
 year = {2013}
}

@article{galstyan2013continuous,
  title={Continuous strategy replicator dynamics for multi-agent q-learning},
  author={Galstyan, Aram},
  journal={Autonomous agents and multi-agent systems},
  volume={26},
  number={1},
  pages={37--53},
  year={2013},
  publisher={Springer US}
}

@inproceedings{raghavan2013coupled,
  title={Coupled hidden markov models for user activity in social networks},
  author={Raghavan, Vasanthan and Ver Steeg, Greg and Galstyan, Aram and Tartakovsky, Alexander G},
  booktitle={2013 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)},
  pages={1--6},
  year={2013},
  organization={IEEE}
}

@inproceedings{sullivan2013darpa,
  title={DARPA phoenix payload orbital delivery system (PODs):"FedEx to GEO"},
  author={Sullivan, Brook and Barnhart, David and Hill, Lisa and Oppenheimer, Paul and Benedict, Bryan L and Van Ommering, Gerrit and Chappell, Laurie and Ratti, John and Will, Peter},
  booktitle={AIAA SPACE 2013 conference and exposition},
  pages={5484},
  year={2013},
  doi= 10.2514/6.2013-5484
}

@InProceedings{Marchetta13a,
	author = 	"Pietro Marchetta and Antonio Pescap{\'e}",
	title = 	"DRAGO: Detecting, Quantifying and Locating
Hidden Routers in Traceroute {IP} Paths",
	booktitle = 	"Proceedings of the " # "16th" # " IEEE Global Internet Symposium",
	year = 		2013,
	pages = 	"to appear",
	month = 	apr,
	address = 	"Turin, Italy",
	publisher = 	"IEEE",
	jlocation = 	"johnh: pafile",
	keywords = 	"uses lander datasets (hitlist)",
	url = 	"http://wpage.unina.it/pescape/doc/gi_infocom_2013_ca.pdf",
}

@inproceedings{Xiao2013Datadrivenmodelingof,
 author = {Xiao, Bo and Georgiou, Panayiotis and Baucom, Brian and Narayanan, Shrikanth S.},
 bib2html_rescat = {bsp},
 booktitle = {International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2013.6638362},
 keyword = {BSP},
 link = {http://sail.usc.edu/publications/files/DATADRIVEN_BX.pdf},
 location = {Vancouver, Canada},
 month = {May},
 title = {Data driven modeling of head motion toward analysis of behaviors in couple interactions},
 year = {2013}
}

@inproceedings{Mal2013DeepPurpleLexicalStringand,
 author = {Malandrakis, Nikolaos and Elias, Iosif and Prokopi, Vassiliki and Potamianos, Alexandros and Narayanan, Shrikanth S.},
 booktitle = {Second Joint Conference on Lexical and Computational Semantics (*SEM), Volume 1: Proceedings of the Main Conference and the Shared Task: Semantic Textual Similarity},
 link = {http://sail.usc.edu/publications/files/nikos-sem-s13-1014.pdf},
 location = {Atlanta, GA},
 month = {Jun},
 pages = {103-108},
 publisher = {Association for Computational Linguistics},
 title = {DeepPurple: Lexical, String and Affective Feature Fusion for Sentence-Level Semantic Similarity Estimation},
 year = {2013}
}

@inproceedings{ver2013demystifying,
  title={Demystifying information-theoretic clustering},
  author={Ver Steeg, Greg and Galstyan, Aram and Sha, Fei and DeDeo, Simon},
  booktitle={ICML},
  year={2013}
}

@InProceedings{Marchetta13c,
	author = 	"Pietro Marchetta and Walter de Donato and Antonio Pescap{\'e}",
	title = 	"Detecting Third-party Addresses in Traceroute Traces with {IP} Timestamp Option",
	booktitle = 	"Proceedings of the " # " Passive and Active Measurement Workshop",
	year = 		2013,
	month = 	mar,
	address = 	"Hong Kong, China",
	publisher = 	"Springer",
	jlocation = 	"johnh: pafile",
	keywords = 	"traceroute, uses hitlists",
	url = 	"http://wpage.unina.it/pietro.marchetta/pubs/tpa_pam2013.pdf",
}

@inproceedings{DBLP:conf/kcap/GarijoCG13,
  author       = {Daniel Garijo and
                  {\'{O}}scar Corcho and
                  Yolanda Gil},
  editor       = {V. Richard Benjamins and
                  Mathieu d'Aquin and
                  Andrew Gordon},
  title        = {Detecting common scientific workflow fragments using templates and
                  execution provenance},
  booktitle    = {Proceedings of the 7th International Conference on Knowledge Capture,
                  {K-CAP} 2013, Banff, Canada, June 23-26, 2013},
  pages        = {33--40},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2479832.2479848},
  doi          = {10.1145/2479832.2479848},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/kcap/GarijoCG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{mirkovic2013deterlab,
  title={Deterlab testbed for cybersecurity research and education},
  author={Mirkovic, Jelena and Benzel, Terry},
  journal={Journal of Computing Sciences in Colleges},
  volume={28},
  number={4},
  pages={163--163},
  year={2013},
  publisher={Consortium for Computing Sciences in Colleges}
}

@inproceedings{parundekar13:ijcai,
	author = 	"Rahul Parundekar and Craig A. Knoblock and Jose Luis Ambite",
 	title = 	"Discovering Alignments in Ontologies of Linked Data",
	booktitle = {Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI)},
	year = 	"2013",
       	Keywords = {"Linked Data"},
	urlPaper= "http://usc-isi-i2.github.io/papers/parundekar13-ijcai.pdf",
	urlPoster= "http://usc-isi-i2.github.io/slides/parundekar13-ijcai-poster.pdf",
	urlSlides= "http://www.slideshare.net/slideshow/embed_code/28005519",
	}	

@article{Mal2013DistributionalSemanticModelsfor,
 author = {Malandrakis, Nikolaos and Potamianos, Alexandros and Elias, Iosif and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 doi = {10.1109/TASL.2013.2277931},
 journal = {IEEE Transactions on Audio, Speech and Language Processing},
 link = {http://sail.usc.edu/publications/files/06578101.pdf},
 month = {Nov},
 number = {11},
 pages = {2379-2392},
 title = {Distributional Semantic Models for Affective Text Analysis},
 volume = {21},
 year = {2013}
}

@InProceedings{Marchetta13b,
	author = 	"Pietro Marchetta and Valerio Persico and
 Antonio Pescap{\'e} and Ethan Katz-Bassett",
	title = "Don’t Trust Traceroute (Completely)",
	booktitle = 	"Proceedings of the " # " ACM CoNEXT Student Workshop",
	year = 		2013,
	pages = 	"5--8",
	month = 	dec,
	address = 	"Santa Barbara, CA, USA",
	publisher = 	"ACM",
	jlocation = 	"johnh: pafile",
	keywords = 	"uses hitlists, traceroute, paris traceroute",
	doi = 	"https://doi.org/10.1145/2537148.2537155",
	url = 	"http://wpage.unina.it/pietro.marchetta/pubs/MarchettaConext13abstract.pdf",
}

@techreport{dcprov,
	title        = {Dublin Core to {PROV} Mapping},
	author       = {Daniel Garijo and Kai Eckert},
	year         = 2013,
	month        = apr,
	url          = {http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/},
	note         = {http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/},
	type         = {{W3C} Note},
	institution  = {W3C}
}

@inproceedings{Audhkhasi2013Empiricallinkbetweenhypothesis,
 author = {Audhkhasi, Kartik and Zavou, Andreas and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/audhkhasi_interspeech_2013.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {Empirical link between hypothesis diversity and fusion performance in an ensemble of automatic speech recognition systems},
 year = {2013}
}

@article{Shin2013EnablingEffectiveDesignof,
 author = {Shin, JongHo and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 doi = {http://dx.doi.org/10.1016/j.csl.2012.02.001},
 journal = {Computer, Speech, and Language},
 link = {http://sail.usc.edu/publications/files/1-s2.0-S0885230812000113-main.pdf},
 month = {Feb},
 number = {2},
 pages = {554-571},
 title = {Enabling Effective Design of Multimodal Interfaces for Speech-to-Speech Translation System: An Empirical Study of Longitudinal User Behaviors over Time and User Strategies for Coping with Errors},
 volume = {27},
 year = {2013}
}

@InProceedings{	  pietri2013energy,
  Author	= {Ilia Pietri and Maciej Malawski and Gideon Juve and Ewa
		  Deelman and Jarek Nabrzyski and Rizos Sakellariou},
  URL		= {http://pegasus.isi.edu/publications/2013/PietriI-Energy.pdf},
  Title		= {Energy-Constrained Provisioning for Scientific Workflow
		  Ensembles},
  BookTitle	= {IEEE International Conference on Cloud and Green Computing
		  (CGC13)},
  Year		= {2013}
}

@article{Sridhar2013Enrichingmachine-mediatedspeech-to-speechtranslation,
 author = {Sridhar, Vivek Kumar Rangarajan and Bangalore, Srinivas and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 doi = {10.1016/j.csl.2011.08.001.},
 journal = {Computer, Speech, and Language},
 link = {http://sail.usc.edu/publications/files/1-s2.0-S0885230811000428-main.pdf},
 month = {Feb},
 number = {2},
 pages = {492-508},
 title = {Enriching machine-mediated speech-to-speech translation using contextual information},
 volume = {27},
 year = {2013}
}

@InProceedings{Fan13a,
	author = 	"Xun Fan and John Heidemann and Ramesh Govindan",
	title = 	"Evaluating Anycast in the Domain Name System",
	booktitle = 	"Proceedings of the " # " IEEE Infocom",
	year = 		2013,
	sortdate = 		"2013-04-01",
	project = "ant, amite, lacrend, lander, research_root",
	jsubject = "traffic_detection",
	pages = 	"1681--1689",
	month = 	apr,
	address = 	"Turin, Italy",
	publisher = 	"IEEE",
	jlocation = 	"johnh: pafile",
	keywords = 	"anycast, detection",
	jlocation = 	"johnh: pafile",
	keywords = 	"anycast, discovery, topology, DNS, F-root, PCH, Netalyzr",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Fan13a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Fan13a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "IEEE",
	copyrightterms = "	Personal use of this material is permitted.  Permission from IEEE must 	be obtained for all other uses, in any current or future media, 	including reprinting/republishing this material for advertising or 	promotional purposes, creating new collective works, for resale or 	redistribution to servers or lists, or reuse of any copyrighted 	component of this work in other works.   ",
	abstract = "IP anycast is a central part of production DNS.  While prior work has
explored proximity, affinity and load balancing for some anycast
services, there has been little attention to third-party discovery and
enumeration of components of an anycast service.  Enumeration can
reveal abnormal service configurations, benign masquerading or hostile
hijacking of anycast services, and help characterize anycast
deployment.  In this paper, we discuss two methods to identify and
characterize anycast nodes.  The first uses an existing anycast
diagnosis method based on CHAOS-class DNS records but augments it with
traceroute to resolve ambiguities.  The second proposes Internet-class
DNS records which permit accurate discovery through the use of
existing recursive DNS infrastructure.  We validate these two methods
against three widely-used anycast DNS services, using a very large
number (60k and 300k) of vantage points, and show that they can
provide excellent precision and recall.  Finally, we use these methods
to evaluate anycast deployments in top-level domains (TLDs), and find
one case where a third-party operates a server masquerading as a root
DNS anycast node as well as a noticeable proportion of unusual DNS
proxies.  We also show that, across all TLDs, up to 72\% use anycast."
,}

IP anycast is a central part of production DNS. While prior work has explored proximity, affinity and load balancing for some anycast services, there has been little attention to third-party discovery and enumeration of components of an anycast service. Enumeration can reveal abnormal service configurations, benign masquerading or hostile hijacking of anycast services, and help characterize anycast deployment. In this paper, we discuss two methods to identify and characterize anycast nodes. The first uses an existing anycast diagnosis method based on CHAOS-class DNS records but augments it with traceroute to resolve ambiguities. The second proposes Internet-class DNS records which permit accurate discovery through the use of existing recursive DNS infrastructure. We validate these two methods against three widely-used anycast DNS services, using a very large number (60k and 300k) of vantage points, and show that they can provide excellent precision and recall. Finally, we use these methods to evaluate anycast deployments in top-level domains (TLDs), and find one case where a third-party operates a server masquerading as a root DNS anycast node as well as a noticeable proportion of unusual DNS proxies. We also show that, across all TLDs, up to 72% use anycast.

@Misc{Heidemann13f,
	author = 	"John Heidemann",
	title = 	"Evaluating Anycast in the {Domain} {Name} {System}",
	howpublished = "Presentation at DNS-OARC Meeting",
	month = 	may,
	year = 	2013,
	sortdate = 	"2013-05-12",
	project = "ant, lacrend, lander",
	jsubject = "traffic_detection",
	jlocation = 	"johnh: pafile",
	keywords = 	"based on [Fan13a]",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13f.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13f.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "We have evaluated techniques to enumerate instances of DNS anycast,
comparing the use of CHAOS records, traceroute, and a new proposal
using IN TXT records.  Enumeration allows a third party to evaluate
the size of an anycast service, and in some cases to identify
masqueraders operating on the same anycast address.
\newline \indent
We have evaluated our approaches on F-root, Packet Clearinghouse, and
the AS112 anycast infrastructures to compare the completeness of our
approaches.  Joe Abley and L-Root has deployed an IN-based system to
support these approaches, and we have also compared tehse results
against their ground truth.
\newline \indent
We will describe our approach, and we invite feedback on its
interation with large DNS operations.  We also plan to discuss options
that would support some control over enumeration by an anycast
operator.
\newline \indent
A technical paper describing some of this work is at
\url{https://ant.isi.edu/%7ejohnh/PAPERS/Fan13a.pdf}.
",
}

We have evaluated techniques to enumerate instances of DNS anycast, comparing the use of CHAOS records, traceroute, and a new proposal using IN TXT records. Enumeration allows a third party to evaluate the size of an anycast service, and in some cases to identify masqueraders operating on the same anycast address. \newline ∈dent We have evaluated our approaches on F-root, Packet Clearinghouse, and the AS112 anycast infrastructures to compare the completeness of our approaches. Joe Abley and L-Root has deployed an IN-based system to support these approaches, and we have also compared tehse results against their ground truth. \newline ∈dent We will describe our approach, and we invite feedback on its interation with large DNS operations. We also plan to discuss options that would support some control over enumeration by an anycast operator. \newline ∈dent A technical paper describing some of this work is at ˘rlhttps://ant.isi.edu/%7ejohnh/PAPERS/Fan13a.pdf.

@InProceedings{	  mandal2013io,
  Author	= {Anirban Mandal and Paul Ruth and Ilya Baldin and Yufeng
		  Xin and Claris Castillo and Mats Rynge and Ewa Deelman},
  URL		= {http://pegasus.isi.edu/publications/2013/io-aware-network-management-ndm2013.pdf},
  Title		= {Evaluating I/O Aware Network Management for Scientific
		  Workflows on Networked Clouds},
  BookTitle	= {The 3rd International Workshop on Network-aware Data
		  Management, in conjunction with SC13},
  Year		= {2013},
  Note		= {Funding Acknowledgments: NSF CC-NIE ADAMANT project (NSF
		  ACI 1245926), DoE DROPS project (ASCR DE-SC0005286), DoE
		  SciDAC SUPER project (DE-FG02-11ER26050/DE-SC0006925), NSF
		  SDCI Missing Link project (NSF ACI 1032573), and the NSF
		  GENI project (GENI Project Office Award #1872)}
}

@article{Zu2013Evaluationofswallowfunction,
 author = {Zu, Yihe and Narayanan, Shrikanth S. and Kim, Yoon-Chul and Nayak, Krishna S. and Bronson-Lowe, Christina and Villegas, Brenda and Ouyoung, Melody and Sinha, Uttam},
 bib2html_rescat = {span},
 doi = {10.1001/jamaoto.2013.5444},
 journal = {JAMA Otolaryngology -  Head \& Neck Surgery},
 link = {http://sail.usc.edu/publications/files/nihms558501.pdf},
 month = {Dec},
 number = {12},
 pages = {1312-1319},
 title = {Evaluation of swallow function post tongue cancer treatment using real-time MRI: A pilot study},
 volume = {139},
 year = {2013}
}

@InProceedings{fernandez2013:ASHG,
  author = 	 {L. Fernández-Rhodes AND C. Carty AND C. Kooperberg AND U. Peters AND T. Matise AND J. L. Ambite AND E. Demerath AND J. Dreyfus AND M. Gross AND N. Pankratz AND E. Ramos AND L. Hindorff AND M. Daviglus AND R. Kaplan AND S. Castañeda AND G. Heiss AND U. Lim AND C. Haiman AND L. Le Marchand AND K. E. North AND N. Franceschini},
  title = 	 {Evidence for shared genetic loci between body mass index and menarche timing among 5,357 Hispanic/Latina women in the Population Architecture using Genomics and Epidemiology Study},
  booktitle = {63nd Annual Meeting of the American Society of Human Genetics (ASHG)},
  year = 	 {2013},
  address = 	 {Boston, MA},
  note = 	 {Abstract + Poster},
}

@article{boixo2013experimental,
  title={Experimental signature of programmable quantum annealing},
  author={Boixo, Sergio and Albash, Tameem and Spedalieri, Federico M and Chancellor, Nicholas and Lidar, Daniel A},
  journal={Nature communications},
  volume={4},
  number={1},
  pages={1--8},
  year={2013},
  publisher={Nature Publishing Group}
}

@INPROCEEDINGS{gao2013a,
	title = { Explaining Away Stylistic Coordination },
	BOOKTITLE =    {WIN Workshop, New York},
	year = {2013},
	urlpaper = {http://www.isi.edu/~galstyan/papers/Gao-coordination.pdf},
	author = {Shuyang Gao and Greg {Ver Steeg} and Aram Galstyan}

}

@InProceedings{pujara:s4bd13,
    author = "Pujara, Jay and Miao, Hui and Getoor, Lise and Cohen, William W.",
    bib_url = "/pubs/bib/pujara-s4bd13.bib",
    booktitle = "AAAI Fall Symposium on Semantics for Big Data",
    pdf_url = "/pubs/2013/pujara-sbd13/pujara-s4bd13.pdf",
    sec = "ws",
    title = "Extended Abstract: Large-Scale Knowledge Graph Identification using PSL",
    year = "2013"
}

@inproceedings{DBLP:conf/ijcnn/ZhouKM13,
  author    = {Zihao Zhou and
               Mayank Kejriwal and
               Risto Miikkulainen},
  title     = {Extended scaled neural predictor for improved branch prediction},
  booktitle = {The 2013 International Joint Conference on Neural Networks, {IJCNN}
               2013, Dallas, TX, USA, August 4-9, 2013},
  pages     = {1--7},
  publisher = {{IEEE}},
  year      = {2013},
  url       = {https://doi.org/10.1109/IJCNN.2013.6707059},
  doi       = {10.1109/IJCNN.2013.6707059},
  timestamp = {Wed, 16 Oct 2019 14:14:55 +0200},
  biburl    = {https://dblp.org/rec/conf/ijcnn/ZhouKM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{schmidt2013a,
	author = {Andrew G. Schmidt and French, M.},
	booktitle = {Proceedings of the 24th Annual International Conference on Application-Specific Systems Architectures and Processors (ASAP{\textquoteright}13)},
	publisher = {IEEE},
	title = {Fast Lossless Image Compression with Radiation Hardening By Hardware/Software Co-Design on Platform FPGAs},
	year = {2013}}

@inproceedings{Zhu2013Faster3DVocalTract,
 author = {Zhu, Yinghua and Toutios, Asterios and Narayanan, Shrikanth S. and Nayak, Krishna S.},
 bib2html_rescat = {span},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/psf_v4.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {Faster 3D Vocal Tract Real-time MRI Using Constrained Reconstruction},
 year = {2013}
}

@techreport{szekely2013first,
  title={First Principles Selection of Social Media Visualizations},
  author={Szekely, Pedro},
  year={2013},
  institution={INFERLINK CORP EL SEGUNDO CA}
}

@inproceedings{Zhu2013FlexibleDynamicPhantomsfor,
 author = {Zhu, Yinghua and Narayanan, Shrikanth S. and Nayak, Krishna S.},
 bib2html_rescat = {span},
 booktitle = {Proc. ISMRM Workshop on Data Sampling and Image Reconstruction},
 keyword = {SPAN},
 link = {http://sail.usc.edu/publications/files/zhuetal_flexible.pdf},
 location = {Sedona, AZ},
 month = {Feb},
 title = {Flexible Dynamic Phantoms for Evaluating MRI Data Sampling and Reconstruction Methods},
 year = {2013}
}

@article{PhysRevE.88.032146,
  title = {Fluctuation theorems for quantum processes},
  author = {Albash, Tameem and Lidar, Daniel A. and Marvian, Milad and Zanardi, Paolo},
  journal = {Phys. Rev. E},
  volume = {88},
  issue = {3},
  pages = {032146},
  numpages = {14},
  year = {2013},
  month = {Sep},
  publisher = {American Physical Society},
  doi = {10.1103/PhysRevE.88.032146},
  url = {https://link.aps.org/doi/10.1103/PhysRevE.88.032146}
}

@inproceedings{Hodas13icwsm,
    abstract = {Feld's friendship paradox states that `your friends have more
friends than you, on average.' This paradox arises because extremely popular people,
despite being rare, are overrepresented when averaging over friends.
Using a sample of the Twitter firehose, we confirm that the friendship
paradox holds for >0.98 of Twitter users. Because of the directed nature of the
follower graph on Twitter, we are further able to confirm more detailed forms
of the friendship paradox: everyone you follow or who follows you has
more friends and followers than you. This is likely caused by a correlation
    we demonstrate between Twitter activity, number of friends, and number of
    followers. In addition, we discover two new paradoxes: the virality paradox
    that states `your friends receive more viral content than you, on average,'
    and the activity paradox, which states `your friends are more active than you, on average.'
    The latter paradox is important in regulating online communication. It may result in
    users having difficulty maintaining optimal incoming information rates,
    because following additional users causes the volume of incoming tweets to
    increase super-linearly. While users may compensate for increased
    information flow by increasing their own activity, users become information
    overloaded when they receive more information than they are able or
    willing to process. We compare the average size of cascades that are sent and
    received by overloaded and underloaded users. And we show that overloaded users
    post and receive larger cascades and they are poor detector of small cascades.},
    author = {Nathan O. Hodas and Farshad Kooti and Kristina Lerman},
    booktitle = {Proceedings of the 7Th International AAAI Conference On Weblogs And Social Media (ICWSM)},
    keywords = {social-networks},
    title = {Friendship Paradox Redux: Your Friends Are More Interesting Than You},
    year = {2013},
    url = {http://arxiv.org/abs/1304.3480},
    urlBlog={http://crowdresearch.org/blog/?p=7618},
    urlPresentation = {http://prezi.com/18rmya6ucitr/friendship-paradox-redux-icwsm-2013/},
    note={Honorable mention paper}
}

Feld's friendship paradox states that `your friends have more friends than you, on average.' This paradox arises because extremely popular people, despite being rare, are overrepresented when averaging over friends. Using a sample of the Twitter firehose, we confirm that the friendship paradox holds for >0.98 of Twitter users. Because of the directed nature of the follower graph on Twitter, we are further able to confirm more detailed forms of the friendship paradox: everyone you follow or who follows you has more friends and followers than you. This is likely caused by a correlation we demonstrate between Twitter activity, number of friends, and number of followers. In addition, we discover two new paradoxes: the virality paradox that states `your friends receive more viral content than you, on average,' and the activity paradox, which states `your friends are more active than you, on average.' The latter paradox is important in regulating online communication. It may result in users having difficulty maintaining optimal incoming information rates, because following additional users causes the volume of incoming tweets to increase super-linearly. While users may compensate for increased information flow by increasing their own activity, users become information overloaded when they receive more information than they are able or willing to process. We compare the average size of cascades that are sent and received by overloaded and underloaded users. And we show that overloaded users post and receive larger cascades and they are poor detector of small cascades.

@article{Kazemzadeh2013FuzzyLogicModelsfor,
 abstract = {This paper presents two models that use interval type-2 fuzzy sets (IT2 FSs) for representing the
meaning of words that refer to emotions. In the first model, the meaning of an emotion word is represented
by IT2 FSs on valence, activation, and dominance scales. In the second model, the meaning of an emotion
word is represented by answers to an open-ended set of questions from the game of Emotion Twenty
Questions (EMO20Q). The notion of meaning in the two proposed models is made explicit using the
Fregean framework of extensional and intensional components of meaning. Inter- and intra-subject uncertainty is captured by using IT2 FSs learned from interval approach surveys. Similarity and subsethood operators are used for comparing the meaning of pairs of words. For the first model, we apply similarity and
subsethood operators for the task of translating one emotional vocabulary, represented as a computing with
words (CWW) codebook, to another. This act of translation is shown to be an example of CWW that is
extended to use the three scales of valence, activation, and dominance to represent a single variable. We
experimentally evaluate the use of the first model for translations and mappings between vocabularies.
Accuracy is high when using a small emotion vocabulary as an output, but performance decreases when the
output vocabulary is larger. The second model was devised to deal with larger emotion vocabularies, but
presents interesting technical challenges in that the set of scales underlying two different emotion words
may not be the same. We evaluate the second model by comparing it with results from a single-slider survey.
We discuss the theoretical insights that the two models allow and the advantages and disadvantages of each.},
 author = {Kazemzadeh, Abe and Lee, Sungbok and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 doi = {10.1109/MCI.2013.2247824},
 journal = {IEEE Computational Intelligence Magazine},
 link = {http://sail.usc.edu/publications/files/abeFuzzyLogicModelsForTheMeaningOfEmotionWords.pdf},
 month = {May},
 number = {2},
 pages = {34-49},
 title = {Fuzzy Logic Models for the Meaning of Emotion Words},
 volume = {8},
 year = {2013}
}

This paper presents two models that use interval type-2 fuzzy sets (IT2 FSs) for representing the meaning of words that refer to emotions. In the first model, the meaning of an emotion word is represented by IT2 FSs on valence, activation, and dominance scales. In the second model, the meaning of an emotion word is represented by answers to an open-ended set of questions from the game of Emotion Twenty Questions (EMO20Q). The notion of meaning in the two proposed models is made explicit using the Fregean framework of extensional and intensional components of meaning. Inter- and intra-subject uncertainty is captured by using IT2 FSs learned from interval approach surveys. Similarity and subsethood operators are used for comparing the meaning of pairs of words. For the first model, we apply similarity and subsethood operators for the task of translating one emotional vocabulary, represented as a computing with words (CWW) codebook, to another. This act of translation is shown to be an example of CWW that is extended to use the three scales of valence, activation, and dominance to represent a single variable. We experimentally evaluate the use of the first model for translations and mappings between vocabularies. Accuracy is high when using a small emotion vocabulary as an output, but performance decreases when the output vocabulary is larger. The second model was devised to deal with larger emotion vocabularies, but presents interesting technical challenges in that the set of scales underlying two different emotion words may not be the same. We evaluate the second model by comparing it with results from a single-slider survey. We discuss the theoretical insights that the two models allow and the advantages and disadvantages of each.

@inproceedings{Tokgoz2013GPU-Accele,
	abstract = {Multi-objective path planning during autonomous navigation of rotorcraft is very important to accomplish critical missions in dangerous territories. Besides other objectives, it is desired to know in advance if two-way communications between rotorcraft, and downlink and uplink communications with ground control stations will be maintained during a critical mission. In addition, it is required to predict how communication links change if the scene of the autonomous flight is constantly varying. Hence, it is critical to instantly compute the coverage of antennas on rotorcraft or at ground stations in an urban environment. However, fast computation of antenna coverage becomes very challenging as the scene gets larger compared to a wavelength. In this paper, a technique based on iterative physical optics (IPO) accelerated using graphical processing units (GPU) is presented to predict radio frequency (RF) propagation in urban environments. Results of physical optics (PO) and IPO for RF propagation in an urban environment will be presented along with the speedup achieved using GPUs compared to central processing unit (CPU) based implementations.},
	author = {Tokgoz, Cagatay and Venugopalan, Vivek},
	booktitle = {IEEE Antennas and Propagation Society International Symposium (APSURSI)},
	date-added = {2020-01-15 12:02:05 -0500},
	date-modified = {2020-01-15 12:02:05 -0500},
	issn = {1522-3965},
	keywords = {aircraft antennas;aircraft communication;graphics processing units;helicopters;iterative methods;path planning;physical optics;radiowave propagation;CPU;GPU accelerated iterative physical optics;IPO;RF propagation prediction;antenna coverage;autonomous flight scene;autonomous rotorcraft navigation;central processing unit;communication links;downlink communications;graphical processing units;ground control stations;multiobjective path planning;radiofrequency propagation prediction;two-way rotorcraft communications;uplink communications;urban environments;Antennas;Graphics processing units;Physical optics;Radio frequency;Surface impedance;Urban areas},
	month = jul,
	pages = {1878-1879},
	title = {{GPU Accelerated Iterative Physical Optics to Predict RF Propagation in Urban Environments}},
	year = {2013},
	Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxAtLi4vLi4vcmVmZXJlbmNlcy9QREYvVG9rZ296MjAxM0dQVS1BY2NlbGUucGRmTxEBhAAAAAABhAACAAAMTWFjaW50b3NoIEhEAAAAAAAAAAAAAAAAAAAAAAAAAEJEAAH/////GFRva2dvejIwMTNHUFUtQWNjZWxlLnBkZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP////8AAAAAAAAAAAAAAAAAAgADAAAKIGN1AAAAAAAAAAAAAAAAAANQREYAAAIAPi86VXNlcnM6dml2ZWt2OkRyb3Bib3g6cmVmZXJlbmNlczpQREY6VG9rZ296MjAxM0dQVS1BY2NlbGUucGRmAA4AMgAYAFQAbwBrAGcAbwB6ADIAMAAxADMARwBQAFUALQBBAGMAYwBlAGwAZQAuAHAAZABmAA8AGgAMAE0AYQBjAGkAbgB0AG8AcwBoACAASABEABIAPFVzZXJzL3ZpdmVrdi9Ecm9wYm94L3JlZmVyZW5jZXMvUERGL1Rva2dvejIwMTNHUFUtQWNjZWxlLnBkZgATAAEvAAAVAAIADf//AAAACAANABoAJABUAAAAAAAAAgEAAAAAAAAABQAAAAAAAAAAAAAAAAAAAdw=},
	Bdsk-Url-1 = {http://dx.doi.org/10.1109/APS.2013.6711597}}

Multi-objective path planning during autonomous navigation of rotorcraft is very important to accomplish critical missions in dangerous territories. Besides other objectives, it is desired to know in advance if two-way communications between rotorcraft, and downlink and uplink communications with ground control stations will be maintained during a critical mission. In addition, it is required to predict how communication links change if the scene of the autonomous flight is constantly varying. Hence, it is critical to instantly compute the coverage of antennas on rotorcraft or at ground stations in an urban environment. However, fast computation of antenna coverage becomes very challenging as the scene gets larger compared to a wavelength. In this paper, a technique based on iterative physical optics (IPO) accelerated using graphical processing units (GPU) is presented to predict radio frequency (RF) propagation in urban environments. Results of physical optics (PO) and IPO for RF propagation in an urban environment will be presented along with the speedup achieved using GPUs compared to central processing unit (CPU) based implementations.

@InProceedings{kocarnik2013:ASHG,
  author = 	 {J. M. Kocarnik AND C. L. Carty AND A. Reiner AND C. L. Avery AND C. M. Ballantyne AND J. Haessler AND A. LaCroix AND A. Young AND T. L. Assimes AND M. Barbalic AND W. Tang AND L. G. Best AND J. L. Ambite AND I. Cheng AND L. A. Hindorff AND G. Heiss AND C. A. Haiman AND C. L. Kooperberg AND L. Le Marchand AND U. Peters},
  title = 	 {Genetic variants associated with C-reactive protein in African Americans: a MetaboChip analysis in the Population Architecture using Genomics and Epidemiology ({PAGE}) study},
  booktitle = {63nd Annual Meeting of the American Society of Human Genetics (ASHG)},
  year = 	 {2013},
  address = 	 {Boston, MA},
  note = 	 {Abstract + Poster},
}

@Article{fesinmeyer2013,
AUTHOR = {Fesinmeyer, Megan and Meigs, James and North, Kari and Schumacher, Fredrick and Buzkova, Petra and Franceschini, Nora and Haessler, Jeffrey and Goodloe, Robert and Spencer, Kylee and Voruganti, Venkata and Howard, Barbara and Jackson, Rebecca and Kolonel, Laurence and Liu, Simin and Manson, JoAnn and Monroe, Kristine and Mukamal, Kenneth and Dilks, Holli and Pendergrass, Sarah and Nato, Andrew and Wan, Peggy and Wilkens, Lynne and Marchand, Loic and Ambite, Jos\'{e} Luis and Buyske, Steven and Florez, Jose and Crawford, Dana and Hindorff, Lucia and Haiman, Christopher and Peters, Ulrike and Pankow, James},
TITLE = {Genetic variants associated with fasting glucose and insulin concentrations in an ethnically diverse population: results from the Population Architecture using Genomics and Epidemiology (PAGE) study},
JOURNAL = {BMC Medical Genetics},
VOLUME = {14},
YEAR = {2013},
NUMBER = {1},
PAGES = {98},
URL = {http://www.biomedcentral.com/1471-2350/14/98},
DOI = {10.1186/1471-2350-14-98},
PubMedID = {24063630},
ISSN = {1471-2350}}

@inproceedings{liu_global_2013,
	title = {Global {Model} for {Failure} {Prediction} for {Rod} {Pump} {Artificial} {Lift} {Systems}},
	booktitle = {{SPE} {Western} {Regional} {Conference}},
	publisher = {Society of Petroleum Engineers},
	author = {Liu, Yintao and Yao, Ke-Thia and Raghavendra, Cauligi S. and Wu, Anqi and Guo, Dong and Zheng, Jingwen and Olabinjo, Lanre and Balogun, Oluwafemi and Ershaghi, Iraj},
	year = {2013},
}

@inproceedings{Venugopal2013Hardware-a,
	abstract = {Field programmable gate arrays (FPGA) are extensively used for rapid prototyping in embedded system applications. While hardware acceleration can be done via specialized processors like a Graphical Processing Unit (GPU), they can also be accomplished with FPGAs for more specialized scenarios. GPUs essentially consist of massively parallel cores and have high memory bandwidth; FPGAs, on the other hand, provide flexibility in terms of customizable I/O and computational resources. In this paper, we explore the usage of GPUs and FPGAs as cryptographic co-processors in streaming dataflow systems with huge rate of data inhalation. Two classic lightweight encryption algorithms, Tiny Encryption Algorithm (TEA) and Extended Tiny Encryption Algorithm (XTEA), are targeted for implementation on GPUs and FPGAs. The GPU implementations of TEA and XTEA in this study depict a maximum speedup of 13x over CPU based implementation. The pipelined FPGA implementation is able to realize a throughput of 6-9x more than the GPU for small plaintext sizes.},
	acmid = {2435326},
	address = {New York, NY, USA},
	author = {Venugopalan, Vivek and Shila, Devu},
	booktitle = {Proceedings of the ACM/SIGDA International Symposium on Field Programmable Gate Arrays},
	date-added = {2021-01-30 10:24:01 -0500},
	date-modified = {2021-01-30 10:24:01 -0500},
	isbn = {978-1-4503-1887-7},
	keywords = {cryptography, field programmable gate arrays, graphics processing units, parallel processing, tiny encryption algorithm},
	location = {Monterey, California, USA},
	month = feb,
	numpages = {1},
	pages = {270-270},
	publisher = {ACM},
	series = {FPGA 13},
	title = {{Hardware acceleration of TEA and XTEA algorithms on FPGA, GPU and multi-core processors}},
	year = {2013},
	Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxA9Li4vLi4vLi4vRG9jdW1lbnRzL3JlZmVyZW5jZXMvUERGL1ZlbnVnb3BhbDIwMTNIYXJkd2FyZS1hLnBkZk8RAZYAAAAAAZYAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAAAAAABCRAAB/////xtWZW51Z29wYWwyMDEzSGFyZHdhcmUtYS5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/////AAAAAAAAAAAAAAAAAAMABAAACiBjdQAAAAAAAAAAAAAAAAADUERGAAACAEMvOlVzZXJzOnZpdmVrdjpEb2N1bWVudHM6cmVmZXJlbmNlczpQREY6VmVudWdvcGFsMjAxM0hhcmR3YXJlLWEucGRmAAAOADgAGwBWAGUAbgB1AGcAbwBwAGEAbAAyADAAMQAzAEgAYQByAGQAdwBhAHIAZQAtAGEALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAEFVc2Vycy92aXZla3YvRG9jdW1lbnRzL3JlZmVyZW5jZXMvUERGL1ZlbnVnb3BhbDIwMTNIYXJkd2FyZS1hLnBkZgAAEwABLwAAFQACAA3//wAAAAgADQAaACQAZAAAAAAAAAIBAAAAAAAAAAUAAAAAAAAAAAAAAAAAAAH+}}

Field programmable gate arrays (FPGA) are extensively used for rapid prototyping in embedded system applications. While hardware acceleration can be done via specialized processors like a Graphical Processing Unit (GPU), they can also be accomplished with FPGAs for more specialized scenarios. GPUs essentially consist of massively parallel cores and have high memory bandwidth; FPGAs, on the other hand, provide flexibility in terms of customizable I/O and computational resources. In this paper, we explore the usage of GPUs and FPGAs as cryptographic co-processors in streaming dataflow systems with huge rate of data inhalation. Two classic lightweight encryption algorithms, Tiny Encryption Algorithm (TEA) and Extended Tiny Encryption Algorithm (XTEA), are targeted for implementation on GPUs and FPGAs. The GPU implementations of TEA and XTEA in this study depict a maximum speedup of 13x over CPU based implementation. The pipelined FPGA implementation is able to realize a throughput of 6-9x more than the GPU for small plaintext sizes.

@inproceedings{Xiao2013Headmotionsynchronyand,
 author = {Xiao, Bo and Georgiou, Panayiotis and Baucom, Brian and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 booktitle = {Proceedings of the IEEE International Conference on Multimedia \& Expo (ICME)},
 doi = {10.1109/ICME.2013.6607480},
 link = {http://sail.usc.edu/publications/files/paper_273.pdf},
 location = {San Jose, CA},
 month = {Jul},
 title = {Head motion synchrony and its correlation to affectivity in dyadic interactions},
 year = {2013}
}

@article{raghavan2013hidden,
  title={Hidden Markov models for the activity profile of terrorist groups},
  author={Raghavan, Vasanthan and Galstyan, Aram and Tartakovsky, Alexander G},
  journal={The Annals of Applied Statistics},
  pages={2402--2430},
  year={2013},
  publisher={Institute of Mathematical Statistics}
}

@inproceedings{Venugopal2013High-throu,
	abstract = {Cryptography algorithms are ranked by their speed in encrypting/decrypting data and their robustness to withstand attacks. Real-time processing of data encryption/decryption is essential in network based applications to keep pace with the input data inhalation rate. The encryption/decryption steps are computationally intensive and exhibit high degree of parallelism. Field programmable gate arrays (FPGA) and graphics processing units (GPU) are being employed as cryptographic coprocessors to target different cryptography algorithms. In this paper, we target different encryption algorithms (TEA and XTEA) on GPU and FPGA platforms. We investigate the performance of the algorithms in terms of latency, throughput, gate equivalence, cost and ease of mapping on both platforms. We employ optimization techniques to realize high throughput in our custom configured implementations for coarse-grained parallel architectures. We propose a tool called Cryptographic Hardware Acceleration and Analysis Tool (CHAAT) that selects an optimal algorithm depending on the user's constraints with respect to hardware utilization, cost and security.},
	author = {Venugopalan, Vivek and Shila, Devu},
	booktitle = {IEEE International Instrumentation and Measurement Technology Conference (I2MTC)},
	date-added = {2020-01-15 12:02:05 -0500},
	date-modified = {2020-01-15 12:02:05 -0500},
	issn = {1091-5281},
	keywords = {Encryption;Field programmable gate arrays;Graphics processing units;Hardware;Logic gates;Throughput;Tiny Encryption Algorithm;cryptography;field programmable gate arrays;graphics processing units;parallel processing},
	month = may,
	pages = {723-727},
	title = {{High Throughput Implementations of Cryptography Algorithms on GPU and FPGA}},
	year = {2013},
	Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxAwLi4vLi4vcmVmZXJlbmNlcy9QREYvVmVudWdvcGFsMjAxM0hpZ2gtdGhyb3UucGRmTxEBkgAAAAABkgACAAAMTWFjaW50b3NoIEhEAAAAAAAAAAAAAAAAAAAAAAAAAEJEAAH/////G1ZlbnVnb3BhbDIwMTNIaWdoLXRocm91LnBkZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP////8AAAAAAAAAAAAAAAAAAgADAAAKIGN1AAAAAAAAAAAAAAAAAANQREYAAAIAQS86VXNlcnM6dml2ZWt2OkRyb3Bib3g6cmVmZXJlbmNlczpQREY6VmVudWdvcGFsMjAxM0hpZ2gtdGhyb3UucGRmAAAOADgAGwBWAGUAbgB1AGcAbwBwAGEAbAAyADAAMQAzAEgAaQBnAGgALQB0AGgAcgBvAHUALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAD9Vc2Vycy92aXZla3YvRHJvcGJveC9yZWZlcmVuY2VzL1BERi9WZW51Z29wYWwyMDEzSGlnaC10aHJvdS5wZGYAABMAAS8AABUAAgAN//8AAAAIAA0AGgAkAFcAAAAAAAACAQAAAAAAAAAFAAAAAAAAAAAAAAAAAAAB7Q==},
	Bdsk-Url-1 = {http://dx.doi.org/10.1109/I2MTC.2013.6555510}}

Cryptography algorithms are ranked by their speed in encrypting/decrypting data and their robustness to withstand attacks. Real-time processing of data encryption/decryption is essential in network based applications to keep pace with the input data inhalation rate. The encryption/decryption steps are computationally intensive and exhibit high degree of parallelism. Field programmable gate arrays (FPGA) and graphics processing units (GPU) are being employed as cryptographic coprocessors to target different cryptography algorithms. In this paper, we target different encryption algorithms (TEA and XTEA) on GPU and FPGA platforms. We investigate the performance of the algorithms in terms of latency, throughput, gate equivalence, cost and ease of mapping on both platforms. We employ optimization techniques to realize high throughput in our custom configured implementations for coarse-grained parallel architectures. We propose a tool called Cryptographic Hardware Acceleration and Analysis Tool (CHAAT) that selects an optimal algorithm depending on the user's constraints with respect to hardware utilization, cost and security.

@article{Tsiartas2013High-qualitybilingualsubtitledocument,
 author = {Tsiartas, Andreas and Ghosh, Prasanta Kumar and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 doi = {10.1016/j.csl.2011.10.002},
 journal = {Computer, Speech, and Language},
 link = {http://sail.usc.edu/publications/files/1-s2.0-S088523081100060X-main.pdf},
 month = {Feb},
 number = {2},
 pages = {572-591},
 title = {High-quality bilingual subtitle document alignments with application to spontaneous speech translation},
 volume = {27},
 year = {2013}
}

@inproceedings{gowayyed_histogram_2013,
	title = {Histogram of Oriented Displacements ({HOD}): Describing Trajectories of Human Joints for Action Recognition},
	rights = {Authors who submit to this conference agree to the following terms:    a) Authors transfer their copyrights in their paper to the International Joint Conferences on Artificial Intelligence, Inc. ({IJCAI}), in order to deal with future requests for reprints, translations, anthologies, reproductions, excerpts, and other publications. This grant will include, without limitation, the entire copyright in the paper in all countries of the world, including all renewals, extensions, and reversions thereof, whether such rights currently exist or hereafter come into effect, and also the exclusive right to create electronic versions of the paper, to the extent that such right is not subsumed under copyright.    b) Every named author warrants that he/she is the sole author and owner of the copyright in the paper, except for those portions shown to be in quotations; that the paper is original throughout; and that their right to make the grants set forth above is complete and unencumbered. If anyone brings any claim or action alleging facts that, if true, constitute a breach of any of the foregoing warranties, each author, individually and collectively, will hold harmless and indemnify {IJCAI}, their grantees, their licensees, and their distributors against any liability, whether under judgment, decree, or compromise, and any legal fees and expenses arising out of that claim or actions, and the undersigned will cooperate fully in any defense {IJCAI} may make to such claim or action. Moreover, each author agrees to cooperate in any claim or other action seeking to protect or enforce any right the author has granted to {IJCAI} in the paper. If any such claim or action fails because of facts that constitute a breach of any of the foregoing warranties, each author agrees to reimburse whomever brings such claim or action for expenses and attorney\’s fees incurred therein.   c) \ In return for these rights, {IJCAI} hereby grants to each author, and the employers for whom the work was performed, royalty-free permission to: 1. retain all proprietary rights (such as patent rights) other than copyright and the publication rights transferred to {IJCAI}; 2. personally reuse all or portions of the paper in other works of their own authorship; 3. make oral presentation of the material in any forum; 4. reproduce, or have reproduced, the  paper for the author\’s personal use, or for company use provided that {IJCAI} copyright and the source are indicated, and that the copies are not used in a way that implies {IJCAI} endorsement of a product or service of an employer, and that the copies per se are not offered for sale. The foregoing right shall not permit the posting of the paper in electronic or digital form on any computer network, except by the author or the author\’s employer, and then only on the author\’s or the employer\’s own World Wide Web page or ftp site. Such Web page or ftp site, in addition to the aforementioned requirements of this Paragraph, must provide an electronic reference or link back to the {IJCAI} electronic server (http://www.ijcai.org), and shall not post other {IJCAI} copyrighted materials not of the author\’s or the employer\’s creation (including tables of contents with links to other papers) without {IJCAI}\’s written permission; \>5. make limited distribution of all or portions of the above paper prior to publication. 6. In the case of work performed under U.S. Government contract, {IJCAI} grants the U.S. Government royalty-free permission to reproduce all or portions of the above paper, and to authorize others to do so, for U.S. Government purposes. In the event the above paper is not accepted and published by {IJCAI}, or is withdrawn by the author(s) before acceptance by {IJCAI}, this agreement becomes null and void.},
	url = {https://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6967},
	shorttitle = {Histogram of Oriented Displacements ({HOD})},
	abstract = {Creating descriptors for trajectories has many applications in robotics/human motion analysis and video copy detection. Here, we propose a novel descriptor for 2D trajectories: Histogram of Oriented Displacements ({HOD}). Each displacement in the trajectory votes with its length in a histogram of orientation angles. 3D trajectories are described by the {HOD} of their three projections. We use {HOD} to describe the 3D trajectories of body joints to recognize human actions, which is a challenging machine vision task, with applications in human-robot/machine interaction, interactive entertainment, multimedia information retrieval, and surveillance. The descriptor is fixed-length, scale-invariant and speed-invariant. Experiments on {MSR}-Action3D and {HDM}05 datasets show that the descriptor outperforms the state-of-the-art when using off-the-shelf classification tools.},
	eventtitle = {Twenty-Third International Joint Conference on Artificial Intelligence},
	booktitle = {Twenty-Third International Joint Conference on Artificial Intelligence},
	author = {Gowayyed, Mohammad Abdelaziz and Torki, Marwan and Hussein, Mohammed Elsayed and El-Saban, Motaz},
	urldate = {2019-05-01},
	date = {2013-06-30},
	year = {2013},
	langid = {english},
	file = {Full Text PDF:C\:\\Users\\Mohamed Hussein\\Zotero\\storage\\IVA94IWX\\Gowayyed et al. - 2013 - Histogram of Oriented Displacements (HOD) Describ.pdf:application/pdf;Snapshot:C\:\\Users\\Mohamed Hussein\\Zotero\\storage\\RB84LZY4\\6967.html:text/html}
}

Creating descriptors for trajectories has many applications in robotics/human motion analysis and video copy detection. Here, we propose a novel descriptor for 2D trajectories: Histogram of Oriented Displacements (HOD). Each displacement in the trajectory votes with its length in a histogram of orientation angles. 3D trajectories are described by the HOD of their three projections. We use HOD to describe the 3D trajectories of body joints to recognize human actions, which is a challenging machine vision task, with applications in human-robot/machine interaction, interactive entertainment, multimedia information retrieval, and surveillance. The descriptor is fixed-length, scale-invariant and speed-invariant. Experiments on MSR-Action3D and HDM05 datasets show that the descriptor outperforms the state-of-the-art when using off-the-shelf classification tools.

@Inbook{Albash2013,
author={Albash, Tameem and Johnson, Clifford V. and McDonald, Scott},
editor={Kharzeev, Dmitri and Landsteiner, Karl and Schmitt, Andreas and Yee, Ho-Ung},
title={Holography, Fractionalization and Magnetic Fields},
bookTitle={Strongly Interacting Matter in Magnetic Fields},
year={2013},
publisher={pringer Berlin Heidelberg},
address={Berlin, Heidelberg},
pages={537-554},
isbn={978-3-642-37305-3},
doi={10.1007/978-3-642-37305-3_20},
url={http://dx.doi.org/10.1007/978-3-642-37305-3_20}
}

@Article{	  deelman2013hosted,
  Author	= {Ewa Deelman and Gideon Juve and Maciej Malawski and Jarek
		  Nabrzyski},
  URL		= {http://www.worldscientific.com/doi/pdf/10.1142/S0129626413400045},
  Title		= {Hosted Science: Managing Computational Workloads in the
		  Cloud},
  Journal	= {Parallel Processing Letters},
  Volume	= {23},
  Number	= {2},
  Month		= {June},
  Year		= {2013},
  Note		= {Funding: NSF OCI-0943725 and OCI-1148515}
}

@inproceedings{hussein_human_2013,
	title = {Human Action Recognition Using a Temporal Hierarchy of Covariance Descriptors on 3D Joint Locations},
	rights = {Authors who submit to this conference agree to the following terms:    a) Authors transfer their copyrights in their paper to the International Joint Conferences on Artificial Intelligence, Inc. ({IJCAI}), in order to deal with future requests for reprints, translations, anthologies, reproductions, excerpts, and other publications. This grant will include, without limitation, the entire copyright in the paper in all countries of the world, including all renewals, extensions, and reversions thereof, whether such rights currently exist or hereafter come into effect, and also the exclusive right to create electronic versions of the paper, to the extent that such right is not subsumed under copyright.    b) Every named author warrants that he/she is the sole author and owner of the copyright in the paper, except for those portions shown to be in quotations; that the paper is original throughout; and that their right to make the grants set forth above is complete and unencumbered. If anyone brings any claim or action alleging facts that, if true, constitute a breach of any of the foregoing warranties, each author, individually and collectively, will hold harmless and indemnify {IJCAI}, their grantees, their licensees, and their distributors against any liability, whether under judgment, decree, or compromise, and any legal fees and expenses arising out of that claim or actions, and the undersigned will cooperate fully in any defense {IJCAI} may make to such claim or action. Moreover, each author agrees to cooperate in any claim or other action seeking to protect or enforce any right the author has granted to {IJCAI} in the paper. If any such claim or action fails because of facts that constitute a breach of any of the foregoing warranties, each author agrees to reimburse whomever brings such claim or action for expenses and attorney\’s fees incurred therein.   c) \ In return for these rights, {IJCAI} hereby grants to each author, and the employers for whom the work was performed, royalty-free permission to: 1. retain all proprietary rights (such as patent rights) other than copyright and the publication rights transferred to {IJCAI}; 2. personally reuse all or portions of the paper in other works of their own authorship; 3. make oral presentation of the material in any forum; 4. reproduce, or have reproduced, the  paper for the author\’s personal use, or for company use provided that {IJCAI} copyright and the source are indicated, and that the copies are not used in a way that implies {IJCAI} endorsement of a product or service of an employer, and that the copies per se are not offered for sale. The foregoing right shall not permit the posting of the paper in electronic or digital form on any computer network, except by the author or the author\’s employer, and then only on the author\’s or the employer\’s own World Wide Web page or ftp site. Such Web page or ftp site, in addition to the aforementioned requirements of this Paragraph, must provide an electronic reference or link back to the {IJCAI} electronic server (http://www.ijcai.org), and shall not post other {IJCAI} copyrighted materials not of the author\’s or the employer\’s creation (including tables of contents with links to other papers) without {IJCAI}\’s written permission; \>5. make limited distribution of all or portions of the above paper prior to publication. 6. In the case of work performed under U.S. Government contract, {IJCAI} grants the U.S. Government royalty-free permission to reproduce all or portions of the above paper, and to authorize others to do so, for U.S. Government purposes. In the event the above paper is not accepted and published by {IJCAI}, or is withdrawn by the author(s) before acceptance by {IJCAI}, this agreement becomes null and void.},
	url = {https://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6869},
	abstract = {Human action recognition from videos is a challenging machine vision task with multiple important application domains, such as human-robot/machine interaction, interactive entertainment, multimedia information retrieval, and surveillance. In this paper, we present a novel approach to human action recognition from 3D skeleton sequences extracted from depth data. We use the covariance matrix for skeleton joint locations over time as a discriminative descriptor for a sequence. To encode the relationship between joint movement and time, we deploy multiple covariance matrices over sub-sequences in a hierarchical fashion. The descriptor has a fixed length that is independent from the length of the described sequence. Our experiments show that using the covariance descriptor with an off-the-shelf classification algorithm outperforms the state of the art in action recognition on multiple datasets, captured either via a Kinect-type sensor or a sophisticated motion capture system. We also include an evaluation on a novel large dataset using our own annotation.},
	eventtitle = {Twenty-Third International Joint Conference on Artificial Intelligence},
	booktitle = {Twenty-Third International Joint Conference on Artificial Intelligence},
	author = {Hussein, Mohamed E. and Torki, Marwan and Gowayyed, Mohammad A. and El-Saban, Motaz},
	urldate = {2019-05-01},
	date = {2013-06-30},
	year = {2013},
	langid = {english},
	file = {Full Text PDF:C\:\\Users\\Mohamed Hussein\\Zotero\\storage\\TFVT8K65\\Hussein et al. - 2013 - Human Action Recognition Using a Temporal Hierarch.pdf:application/pdf;Snapshot:C\:\\Users\\Mohamed Hussein\\Zotero\\storage\\GCTVR8WW\\6869.html:text/html}
}

Human action recognition from videos is a challenging machine vision task with multiple important application domains, such as human-robot/machine interaction, interactive entertainment, multimedia information retrieval, and surveillance. In this paper, we present a novel approach to human action recognition from 3D skeleton sequences extracted from depth data. We use the covariance matrix for skeleton joint locations over time as a discriminative descriptor for a sequence. To encode the relationship between joint movement and time, we deploy multiple covariance matrices over sub-sequences in a hierarchical fashion. The descriptor has a fixed length that is independent from the length of the described sequence. Our experiments show that using the covariance descriptor with an off-the-shelf classification algorithm outperforms the state of the art in action recognition on multiple datasets, captured either via a Kinect-type sensor or a sophisticated motion capture system. We also include an evaluation on a novel large dataset using our own annotation.

@inproceedings{Huang13icdm,
    author = {Yi-hung Huang and Chun-Nan Hsu and Kristina Lerman},
    booktitle = {Proc. of IEEE International Conference on Data Mining},
    keywords = {social-dynamics},
    title = {Identifying Transformative Scientific Research},
    urlPaper = {http://www.isi.edu/integration/people/lerman/papers/ICDM13.pdf},
    year = {2013}
}

@InProceedings{	  chen2013imbalance,
  Author	= {Weiwei Chen and Ewa Deelman and Rizos Sakellariou},
  Title		= {Imbalance Optimization in Scientific Workflows},
  BookTitle	= {International Conference on Supercomputing (ICS 2013)},
  Year		= {2013},
  Note		= {Funding Acknowledgments: NSF IIS-0905032 and NSF
		  FutureGrid 0910812}
}

@inproceedings{Suh2013,
	author= {Suh, Jinwoo and Kang, Dong-In and Crago, Stephen P.},
	title= {Implementation of Kernels on the Maestro Processor},
	booktitle= {IEEE Aerospace Conference},
	location= {Big Sky, Montana},
	month= {March},
	year= {2013},
	pages={1-6},
    doi={10.1109/AERO.2013.6496949}
}

@InProceedings{Monson2013a,
  author        = {Monson, Josh and Wirthlin, Mike and Hutchings, Brad L},
  title         = {Implementing high-performance, low-power FPGA-based optical flow accelerators in C},
  booktitle     = {Application-Specific Systems, Architectures and Processors (ASAP), 2013 IEEE 24th International Conference on},
  year          = {2013},
  pages         = {363--369},
  organization  = {IEEE},
  __markedentry = {[jmonson:6]},
  doi           = {10.1109/ASAP.2013.6567602}
}

@article{kocoloski2013improving,
  title={Improving compute node performance using virtualization},
  author={Kocoloski, Brian and Lange, John},
  journal={The International journal of high performance computing applications},
  volume={27},
  number={2},
  pages={124--135},
  year={2013},
  publisher={Sage Publications Sage UK: London, England}
}

@article{amin2013quest,
  title={In quest of benchmarking security risks to cyber-physical systems},
  author={Amin, Saurabh and Schwartz, Galina A and Hussain, Alefiya},
  journal={IEEE Network},
  volume={27},
  number={1},
  pages={19--24},
  year={2013},
  publisher={IEEE}
}

@inproceedings{Ghosh2013Informationtheoreticacousticfeature,
 author = {Ghosh, Prasanta Kumar and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/PrasantaKumarGhosh_InformationTheoreticAcoustic.pdf},
 location = {Lyon, France},
 month = {Aug},
 pages = {3177-3181},
 title = {Information Theoretic Acoustic Feature Selection for Acoustic-to-Articulatory Inversion},
 year = {2013}
}

@inproceedings{wsdm2013,
	Author = {Greg {Ver Steeg} and Aram Galstyan},
	Booktitle = {Proceedings of the 6th International Conference on Web Search and Data Mining (WSDM)},
	Organization = {ACM},
	Title = {Information-Theoretic Measures of Influence Based on Content Dynamics},
	Year = {2013}}

@misc{gil-etal-cbbw13, 
  title = {Intelligent Assistance to Disseminate Best Practices and Accelerate Discoveries in Cancer Omics},
  author = {Yolanda Gil and Christopher E. Mason and Christina Zheng and Shannon McWeeney},
  year      = {2013},
  note = {2013 NCI EDRN Cancer Biomarkers Bioinformatics Workshop, Pasadena, CA},
  url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/gil-etal-cbbw13.pdf} 
}

@Article{Heidemann13a,
	author = 	"John Heidemann and Walter Willinger",
	title = 	"Internet Visualization",
	journal = 	"Computing",
	publisher = "Springer",
	year = 		2013,
	sortdate = 		"2013-01-05",
	project = "ant, nocredit, lacrend, amite",
	jsubject = "topology_modeling",
	volume = 	"96",
	number = "1",
	pages = 	"1--2",
	note = 	"(Editorial discussing the First ACM Workshop on Internet Visualization)",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	jlocation = 	"johnh: pafile",
	keywords = 	"internet visualization, workshop, front matter",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13a.pdf",
	doi = 	"10.1007/s00607-013-0284-6",
	abstract = "No formal abstract, but this editorial describes
                  the First Workshop on Internet Visualization from
                  the point of view of the Program Committee chairs.",
}

No formal abstract, but this editorial describes the First Workshop on Internet Visualization from the point of view of the Program Committee chairs.

@article{Lammert2013InterspeakerVariabilityinHard,
 author = {Lammert, Adam and Proctor, Michael I. and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 doi = {10.1044/1092-4388(2013/12-0211)},
 journal = {Journal of Speech, Language, and Hearing Research},
 link = {http://sail.usc.edu/publications/files/lammert13_JSLHR_interspeaker_variability.pdf},
 month = {Dec},
 number = {6},
 pages = {1924-1933},
 title = {Interspeaker Variability in Hard Palate Morphology and Vowel Production},
 volume = {56},
 year = {2013}
}

@InProceedings{	  azarnoosh2013precip,
  Author	= {Sepideh Azarnoosh and Mats Rynge and Gideon Juve and Ewa
		  Deelman Michal Nieć and Maciej Malawski and Ferreira da
		  Silva, Rafael},
  URL		= {http://pegasus.isi.edu/publications/2013/precip-cloudcom-2013.pdf},
  Title		= {Introducing PRECIP: An API for Managing Repeatable
		  Experiments in the Cloud},
  BookTitle	= {Workshop on Cloud Computing for Research Collaborations
		  (CRC)},
  Year		= {2013},
  Note		= {Funding Acknowledgments: National Science Foundation under
		  Grant No. 0910812 and AWS Educational Grant}
}

@article{taylor2013,
AUTHOR = {Taylor, Kira and Carty, Cara and Dumitrescu, Logan and Buzkova, Petra and Cole, Shelley and Hindorff, Lucia and Schumacher, Fred and Wilkens, Lynne and Shohet, Ralph and Quibrera, P and Johnson, Karen and Henderson, Brian and Haessler, Jeff and Franceschini, Nora and Eaton, Charles and Duggan, David and Cochran, Barbara and Cheng, Iona and Carlson, Chris and Brown-Gentry, Kristin and Anderson, Garnet and Ambite, Jos\'{e} Luis and Haiman, Christopher and Le Marchand, Loic and Kooperberg, Charles and Crawford, Dana and Buyske, Steven and North, Kari and Fornage, Myriam and for the PAGE Study},
TITLE = {Investigation of gene-by-sex interactions for lipid traits in diverse populations from the population architecture using genomics and epidemiology study},
JOURNAL = {BMC Genetics},
VOLUME = {14},
YEAR = {2013},
NUMBER = {1},
PAGES = {33},
URL = {http://www.biomedcentral.com/1471-2156/14/33},
DOI = {10.1186/1471-2156-14-33},
PubMedID = {23634756},
ISSN = {1471-2156},
}

@article{Busso2013IterativeFeatureNormalizationScheme,
 author = {Busso, Carlos and Mariooryad, Soroosh and Metallinou, Angeliki and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 doi = {10.1109/T-AFFC.2013.26},
 journal = {IEEE Transactions on Affective Computing},
 link = {http://sail.usc.edu/publications/files/06645371.pdf},
 month = {Oct},
 number = {4},
 pages = {386-397},
 title = {Iterative Feature Normalization Scheme for Automatic Emotion Detection from Speech},
 volume = {4},
 year = {2013}
}

@inproceedings{pujara:wtbudg13,
    Author = "Pujara, Jay and Miao, Hui and Getoor, Lise",
    Booktitle = "Workshop on Machine Learning with Test-Time Budgets",
    Title = "{Joint Judgments with a Budget: Strategies for Reducing the Cost of Inference}",
    Year = "2013",
    bib_url = "/pubs/bib/pujara-icmlws13.bib",
    organization = "ICML",
    pdf_url = "/pubs/2013/pujara-wtbudg13/pujara-wtbudg13.pdf",
    sec = "ws"
}

@inproceedings{Sethy2013Jointtrainingofinterpolated,
 author = {Sethy, Abhinav and Chen, Stanley and Arisoy, Ebru and Ramabhadran, Bhuvana and Audhkhasi, Kartik and Narayanan, Shrikanth S. and Vozila, Paul},
 booktitle = {Proceedings of IEEE Workshop on Automatic Speech Recognition and Understanding},
 doi = {10.1109/ASRU.2013.6707700},
 link = {http://sail.usc.edu/publications/files/06707700.pdf},
 month = {Dec},
 pages = {25-30},
 title = {Joint Training of Interpolated Exponential N-gram Models},
 year = {2013}
}

@InProceedings{pujara:iswc13,
    author = "Pujara, Jay and Miao, Hui and Getoor, Lise and Cohen, William W.",
    acceptrate = "21.5\%",
    bib_url = "/pubs/bib/pujara-iswc13.bib",
    booktitle = "{International Semantic Web Conference (ISWC)}",
    code_url = "https://github.com/linqs/KnowledgeGraphIdentification/tree/iswc13",
    doi_url = "https://doi.org/10.1007/978-3-642-41335-3\_34",
    note = "\textbf{Winner of Best Student Paper award}",
    pdf_url = "/pubs/2013/pujara-iswc13/pujara-iswc13.pdf",
    sec = "conf",
    slides_url = "/pubs/slides/pujara-iswc13.pdf",
    title = "Knowledge Graph Identification",
    video_url = "http://videolectures.net/iswc2013\_pujara\_graph\_identification/",
    year = "2013"
}

@inproceedings{DBLP:conf/kcap/GilR13,
  author       = {Yolanda Gil and
                  Varun Ratnakar},
  editor       = {V. Richard Benjamins and
                  Mathieu d'Aquin and
                  Andrew Gordon},
  title        = {Knowledge capture in the wild: a perspective from semantic wiki communities},
  booktitle    = {Proceedings of the 7th International Conference on Knowledge Capture,
                  {K-CAP} 2013, Banff, Canada, June 23-26, 2013},
  pages        = {49--56},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2479832.2479858},
  doi          = {10.1145/2479832.2479858},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/kcap/GilR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Kang13aaai,
    author = {Jeon-hyung Kang and Kristina Lerman},
    title = {LA-CTR: A Limited Attention Collaborative Topic Regression for Social Media},
    booktitle={Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI)},
    keywords = {social-annotation},
    year = {2013},
    urlPaper = {http://www.isi.edu/integration/people/lerman/papers/AAAI2013.pdf},
    urlPresentation={https://www.dropbox.com/s/ayn36qipqkpl94u/AAAI13.ppt},
}

@inproceedings{Kang13sbp,
    author = {Jeon-hyung Kang and Kristina Lerman and Lise Getoor},
    title = {LA-LDA: A Limited Attention Model for Social Recommendation},
    booktitle={International Conference on Social Computing, Behavioral-Cultural Modeling, and Prediction (SBP)},
    keywords = {social-annotation},
    year = {2013},
    note={(Terry Lyons Memorial Award for Best Student Paper)},
    urlPaper = {http://arxiv.org/abs/1301.6277},
    urlPresentation={https://www.dropbox.com/s/xafev7d92w7qxdl/SBP.ppt},
}

@inproceedings{pujara:slg13,
    Author = "Pujara, Jay and Miao, Hui and Getoor, Lise and Cohen, William W.",
    Booktitle = "Workshop on Structured Learning",
    Date-Modified = "2015-12-10 01:35:22 +0000",
    Title = "{{Large-Scale Knowledge Graph Identification using PSL}}",
    Year = "2013",
    bib_url = "/pubs/bib/pujara-slg13.bib",
    organization = "ICML",
    pdf_url = "/pubs/2013/pujara-slg13/pujara-slg13.pdf",
    sec = "ws"
}

@inproceedings{DBLP:conf/mm/SethiGJP13,
  author       = {Ricky J. Sethi and
                  Yolanda Gil and
                  Hyunjoon Jo and
                  Andrew Philpot},
  editor       = {Alejandro Jaimes and
                  Nicu Sebe and
                  Nozha Boujemaa and
                  Daniel Gatica{-}Perez and
                  David A. Shamma and
                  Marcel Worring and
                  Roger Zimmermann},
  title        = {Large-scale multimedia content analysis using scientific workflows},
  booktitle    = {{ACM} Multimedia Conference, {MM} '13, Barcelona, Spain, October 21-25,
                  2013},
  pages        = {813--822},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2502081.2502082},
  doi          = {10.1145/2502081.2502082},
  timestamp    = {Tue, 16 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mm/SethiGJP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{cho2013latent,
  title={Latent self-exciting point process model for spatial-temporal networks},
  author={Cho, Yoon-Sik and Galstyan, Aram and Brantingham, P Jeffrey and Tita, George},
  journal={arXiv preprint arXiv:1302.2671},
  year={2013}
}

%2012

@inproceedings{Lerman13society,
    author = {Kristina Lerman and Prachi Jain and Rumi Ghosh and Jeon-Hyung Kang and Ponnurangam Kumaraguru},
    booktitle = {Proceedings of  International Conference on Social Intelligence and Technology (SOCIETY)},
    keywords = {social-networks},
    title = {Limited Attention and Centrality in Social Networks},
    year = {2013},
    urlPaper = {http://arxiv.org/abs/1303.4451},
}

@Misc{Heidemann13e,
	author = 	"John Heidemann",
	title = 	"Long-term Data Collection and Analysis of
                  Outages at the Edge",
	howpublished = "Talk given at CAIDA Workshop on Active
                  Internet Measurement Systems",
	month = 	feb,
	year = 	2013,
	sortdate = 	"2013-02-08",
	project = "ant, lacrend, lander, duoi",
	jsubject = "routing",
	jlocation = 	"johnh: pafile",
	keywords = 	"ant, network outages, hurricane sandy,
                  long-term data analysis",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13e.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13e.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "No formal abstract, but this talk described our
                  analysis of outages in edge networks at the time of
                  Hurricane Sandy, and how that work was enabled by
                  long-term data collection.  The analysis showed U.S. networks
                  had double the outage rate (from 0.2\% to 0.4\%) on
                  2012-10-30, the day after Sandy landfall, and
                  recovered after four days.  We highlighted long-term
                  data collection of Internet Surveys, a random sample
                  of about 41,000 /24 blocks.
		The talk was part of the
		CAIDA Workshop on Active
                  Internet Measurement Systems,
		hosted at UCSD.",
}

No formal abstract, but this talk described our analysis of outages in edge networks at the time of Hurricane Sandy, and how that work was enabled by long-term data collection. The analysis showed U.S. networks had double the outage rate (from 0.2% to 0.4%) on 2012-10-30, the day after Sandy landfall, and recovered after four days. We highlighted long-term data collection of Internet Surveys, a random sample of about 41,000 /24 blocks. The talk was part of the CAIDA Workshop on Active Internet Measurement Systems, hosted at UCSD.

@techreport{Qian2013,
        Author = {M. Qian, A. Wood, M. French, P. Marshall},
        title ={Managing Uncertainty in Developing Cognitive Electronic Warfare Strategies},
        institution = {University of Southern California, Information Sciences Institute},
       Year = {2013}
    }

   
    

@inproceedings{DBLP:conf/semco/Gil13,
  author       = {Yolanda Gil},
  title        = {Mapping Semantic Workflows to Alternative Workflow Execution Engines},
  booktitle    = {2013 {IEEE} Seventh International Conference on Semantic Computing,
                  Irvine, CA, USA, September 16-18, 2013},
  pages        = {377--382},
  publisher    = {{IEEE} Computer Society},
  year         = {2013},
  url          = {https://doi.org/10.1109/ICSC.2013.70},
  doi          = {10.1109/ICSC.2013.70},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/semco/Gil13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@TechReport{Calder13b,
	author = 	"Matt Calder and Xun Fan and Zi Hu and Ethan
                  Katz-Bassett and John Heidemann and Ramesh Govindan",
	title = 	"Mapping the Expansion of {Google's} Serving Infrastructure",
	institution = 	"University of Southern California Computer Science Department",
	year = 		2013,
	sortdate = 		"2013-06-01",
	project = "ant, lacrend, retrofuture, ethancampusnfs",
	jsubject = "omit",
	number = 	"TR 13-935",
	month = 	jun,
	jlocation = 	"johnh: pafile",
	keywords = 	"CDN mapping, clustering, google",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Calder13b.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Calder13b.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "Modern content-distribution networks both provide bulk content and act as
``serving infrastructure'' for web services in order to reduce user-perceived
latency. These serving infrastructures (such as Google's) are now critical to
the online economy, making it imperative to understand their size, geographic
distribution, and growth strategies. To this end, we develop techniques that
enumerate servers in these infrastructures, find their geographic location,
and identify the association between clients and servers. While general
techniques for server enumeration and geolocation can exhibit large error, our
techniques exploit the design and mechanisms of serving infrastructure to
improve accuracy. We use the EDNS-client-subnet extension to DNS to measure
which clients a service maps to which of its servers. We devise a novel
technique that uses this mapping to geolocate servers by combining noisy
information about client locations with speed-of-light constraints. We
demonstrate that this technique substantially improves geolocation accurate
relative to existing approaches. We also cluster servers into physical sites
by measuring RTTs and adapting the cluster thresholds dynamically. Google's
serving infrastructure has grown dramatically in the last six months, and we
use our methods to chart its growth and understand its content serving
strategy. We find that Google has almost doubled in size, and that most of the
growth has occurred by placing servers in large and small ISPs across the
world, not by expanding on Google's backbone.",
}

Modern content-distribution networks both provide bulk content and act as ``serving infrastructure'' for web services in order to reduce user-perceived latency. These serving infrastructures (such as Google's) are now critical to the online economy, making it imperative to understand their size, geographic distribution, and growth strategies. To this end, we develop techniques that enumerate servers in these infrastructures, find their geographic location, and identify the association between clients and servers. While general techniques for server enumeration and geolocation can exhibit large error, our techniques exploit the design and mechanisms of serving infrastructure to improve accuracy. We use the EDNS-client-subnet extension to DNS to measure which clients a service maps to which of its servers. We devise a novel technique that uses this mapping to geolocate servers by combining noisy information about client locations with speed-of-light constraints. We demonstrate that this technique substantially improves geolocation accurate relative to existing approaches. We also cluster servers into physical sites by measuring RTTs and adapting the cluster thresholds dynamically. Google's serving infrastructure has grown dramatically in the last six months, and we use our methods to chart its growth and understand its content serving strategy. We find that Google has almost doubled in size, and that most of the growth has occurred by placing servers in large and small ISPs across the world, not by expanding on Google's backbone.

@misc{sankaran2013method,
  title={Method and system for network management using wire tapping},
  author={Sankaran, Ganesh Chennimalai and Venkat, Balaji},
  year={2013},
  month=jan # "~8",
  publisher={Google Patents},
  note={US Patent 8,352,590}
}

@patent{porikli_method_2013,
	title = {Method for tracking tumors in bi-plane images},
	rights = {All rights reserved},
	url = {https://patents.google.com/patent/US8358823B2/en},
	holder = {Mitsubishi Electric Research Laboratories Inc},
	type = {patentus},
	number = {8358823B2},
	author = {Porikli, Fatih M. and Hussein, Mohamed},
	urldate = {2019-05-01},
	date = {2013-01-22},
	year = {2013},
	langid = {english},
	keywords = {bi, method, segmentation, tumor, vertices},
	file = {Fulltext PDF:C\:\\Users\\Mohamed Hussein\\Zotero\\storage\\88B9J5FZ\\Porikli and Hussein - 2013 - Method for tracking tumors in bi-plane images.pdf:application/pdf}
}

@inproceedings{win2013,
	Author = {Greg {Ver Steeg} and Aram Galstyan},
	Booktitle = {Workshop on Information in Networks(WIN)},
	Title = {Minimal Assumption Tests for Contagion in Observational Social Network Studies},
	Year = {2013}}

@misc{mattmann-etal-earthzine13,
  author = {Chris A. Mattmann and Duane Waliser and Jinwon Kim and Paul Ramirez and Cameron Goodale and
Andrew F. Hart and Paul Loikith and Huikyo Lee and Michael Joyce and Maziyar Boustani and
Shakeh Khudikyan and Kim Whitehall and Jesslyn Whittell and Paul Zimdars and Daniel Crichton and
Yolanda Gil and Luca Cinquini},
  title = {Model Evaluation Using the NASA Regional Climate Model Evaluation System (RCMES)},
  note = {IEEE Earthzine},
  year = {2013},
  ee = {http://www.earthzine.org/2013/12/02/model-evaluation-using-the-nasa-regional-climate-model-evaluation-system-rcmes/ }
}

@inproceedings{Xiao2013ModelingTherapistEmpathyand,
 author = {Xiao, Bo and Georgiou, Panayiotis and Imel, Zac E. and Atkins, David and Narayanan, Shrikanth S.},
 bib2html_rescat = {bsp},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/d91f432cf09299023482dea6f1690c7523ff.pdf},
 location = {Lyon, France},
 month = {Aug},
 pages = {2861-2865},
 title = {Modeling Therapist Empathy and Vocal Entrainment in Drug Addiction Counseling},
 year = {2013}
}

@InProceedings{hopkins-may:2013:ACL2013,
  author    = {Hopkins, Mark  and  May, Jonathan},
  title     = {Models of Translation Competitions},
  booktitle = {Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)},
  month     = {August},
  year      = {2013},
  address   = {Sofia, Bulgaria},
  publisher = {Association for Computational Linguistics},
  pages     = {1416--1424},
  url       = {http://www.aclweb.org/anthology/P13-1139}
}

@article{Lammert2013MorphologicalVariationinthe,
 author = {Lammert, Adam and Proctor, Michael I. and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 doi = {https://doi.org/10.1044/1092-4388(2012/12-0059)},
 journal = {Journal of Speech, Language, and Hearing Research},
 link = {http://sail.usc.edu/publications/files/Lammert_et_al-2013-Journal_of_Speech,_Language,_and_Hearing_Research.pdf},
 month = {Apr},
 number = {2},
 pages = {521-530},
 title = {Morphological Variation in the Adult Hard Palate and Posterior Pharyngeal Wall},
 volume = {56},
 year = {2013}
}

@inproceedings{Tsiartas2013Multi-bandlong-termsignalvariability,
 author = {Tsiartas, Andreas and Chaspari, Theodora and Katsamanis, Athanasios and Ghosh, Prasanta Kumar and Li, Ming and Van Segbroeck, Maarten and Potamianos, Alexandros and Narayanan, Shrikanth S.},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/andreastsiartas_multi-bandlong-termsignal.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {Multi-band long-term signal variability features for robust voice activity detection},
 year = {2013}
}

@inproceedings{Narang13snakdd,
    author = {Kanika Narang and Kristina Lerman and Ponnurangam Kumaraguru},
    title = {Network Flows and the Link Prediction Problem},
    booktitle = {Proceedings of KDD workshop on Social Network Analysis (SNA-KDD)},
    keywords = {social-networks},
    year = {2013},
    urlPaper = {http://www.isi.edu/integration/people/lerman/papers/Narang13snakdd.pdf},
}

@techreport{French2013,
        Author = {M. French, M. Qian, A. Wood, P. Marshall},
        title ={Network Level Performance Evaluation of Complex Networks under Electronic Warfare Attack},
        institution = {University of Southern California, Information Sciences Institute},
       Year = {2013}
    }

@article{dumitrescu2013:hg,
title={No evidence of interaction between known lipid-associated genetic variants and smoking in the multi-ethnic PAGE population},
url={http://dx.doi.org/10.1007/s00439-013-1375-3},
publisher={Springer Berlin Heidelberg},
author={Dumitrescu, Logan and Carty, CaraL. and Franceschini, Nora and Hindorff, LuciaA. and Cole, ShelleyA. and BBuzkova, Petra and Schumacher, FredrickR. and Eaton, CharlesB. and Goodloe, RobertJ. and Duggan, DavidJ. and Haessler, Jeff and Cochran, Barbara and Henderson, BrianE. and Cheng, Iona and Johnson, KarenC. and Carlson, ChrisS. and Love, Shelly-Anne and Brown-Gentry, Kristin and Nato, AlejandroQ. and Quibrera, Miguel and Shohet, RalphV. and Ambite, Jos\'{e} Luis and Wilkens, Lynne R. and Marchand, Loic and Haiman, ChristopherA. and Buyske, Steven and Kooperberg, Charles and North, KariE. and Fornage, Myriam and Crawford, DanaC.},
pages={1427-1431},
language={English},
year={2013},
issn={0340-6717},
journal={Human Genetics},
volume={132},
number={12},
doi={10.1007/s00439-013-1375-3}
}

@article{sankaran2013onu,
  title={ONU buffer reduction for power efficiency in passive optical networks},
  author={Sankaran, Ganesh C and Sivalingam, Krishna M},
  journal={Optical Switching and Networking},
  volume={10},
  number={4},
  pages={416--429},
  year={2013},
  publisher={Elsevier}
}

@article{Ghosh2013Onsmoothingarticulatorytrajectories,
 author = {Ghosh, Prasanta Kumar and Narayanan, Shrikanth S.},
 bib2html_rescat = {speechlinks},
 doi = {10.1121/1.4813590},
 journal = {J. Acoust. Soc. Am. Express Letters},
 link = {http://sail.usc.edu/publications/files/JASMAN-000134-0EL258_1.pdf},
 month = {Aug},
 number = {2},
 pages = {EL258-EL264},
 title = {On smoothing articulatory trajectories obtained from Gaussian Mixture Model based acoustic-to-articulatory inversion},
 volume = {134},
 year = {2013}
}

@inproceedings{holl2013specifying,
	title        = {On specifying and sharing scientific workflow optimization results using research objects},
	author       = {Holl, Sonja and Garijo, Daniel and Belhajjame, Khalid and Zimmermann, Olav and De Giovanni, Renato and Obst, Matthias and Goble, Carole},
	year         = 2013,
	booktitle    = {Proceedings of the 8th Workshop on Workflows in Support of Large-Scale Science},
	pages        = {28--37},
	doi          = {10.1145/2534248.2534251},
	url          = {https://dgarijo.com/papers/works13.pdf},
	organization = {ACM}
}

@inproceedings{Can2013OntheComputationof,
 author = {Can, Dogan and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {Proceedings of InterSpeech},
 doi = {},
 link = {http://sail.usc.edu/publications/files/DoganCan_ComputationOfDocumentFrequency.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {On the Computation of Document Frequency Statistics from Spoken Corpora using Factor Automata},
 year = {2013}
}

@inproceedings{Ramanarayanan2013Onthenatureof,
 author = {Ramanarayanan, Vikram and Van Segbroeck, Maarten and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 booktitle = {ISCA Workshop on Speech Production in Automatic Speech Recognition (SPASR)},
 doi = {},
 link = {http://sail.usc.edu/publications/files/primitives_classification.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {On the nature of data-driven primitive representations of speech articulation},
 year = {2013}
}

@inproceedings{Kim2013On-linegenreclassificationof,
 author = {Kim, Samuel and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {mica},
 booktitle = {International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2013.6637758},
 link = {http://sail.usc.edu/publications/files/06637758.pdf},
 location = {Vancouver, Canada},
 month = {May},
 pages = {798-802},
 title = {On-line Genre Classification of TV Programs Using Audio Content},
 year = {2013}
}

@article{harthfly,
  title={On-the-fly Integration of Static and Dynamic Linked Data},
  author={Harth, Andreas and Knoblock, Craig A and Stadtm{\"u}ller, Steffen and Studer, Rudi and Szekely, Pedro},
  journal={Proceedings of the Fourth International Workshop on Consuming Linked Data co-located with the 12th International Semantic Web Conference},
  year={2013},
  pages={1613--0073}
}

@inproceedings{harth13:cold,
  	author = {Andreas Harth and Craig Knoblock and Steffen Stadtm�ller and Rudi Studer and Pedro Szekely},
  	title = {On-the-fly Integration of Static and Dynamic Sources},
  	booktitle = {Proceedings of the Fourth International Workshop on Consuming Linked Data (COLD2013)},
	 year = {2013},
	urlPaper = {http://ceur-ws.org/Vol-1034/HarthEtAl_COLD2013.pdf},
	urlLink = {http://ceur-ws.org/Vol-1034/}
}

@inproceedings{pujara:akbc13,
    Author = "Pujara, Jay and Miao, Hui and Getoor, Lise and Cohen, William W.",
    Booktitle = "Third Workshop on Automatic Knowledge Base Construction",
    Title = "{{Ontology-Aware Partitioning for Knowledge Graph Identification}}",
    Year = "2013",
    bib_url = "/pubs/bib/pujara-akbc13.bib",
    comment = "Selected for a spotlight talk",
    organization = "CIKM",
    pdf_url = "/pubs/2013/pujara-akbc13/pujara-akbc13.pdf",
    sec = "ws",
    slides_url = "https://www.jaypujara.org/pdf/slides/pujara-akbc13.pdf"
}

@conference {7339,
	title = {Open Science Data Cloud Automate Provisioning},
	booktitle = {Lightening Talks: Trans-European Research and Education Networking Association TNC2013},
	year = {2013},
	month = {06/2013},
	address = {Maastricht, Netherlands},
	url = {https://urldefense.com/v3/__https://tnc2013.terena.org/__;!!FjuHKAHQs5udqho!OrfqNEjI8IYnpYEY3Wc7S4oSY6Kf82MHM8jGAJar7qa8MoXzNwtTTC2HiJsVSREP5YicoFx-SpfAUA$ },
	author = {Robert Grossman and Heidi Alvarez and Paula Grosso and Adam Barker and Vasilka Chergarova}
}

@inproceedings{soni-2013-bitstream-fccm13,
        Author = {Ritesh Kumar Soni and Neil Steiner and Matthew French},
        Booktitle = {Proceedings of the 21st Annual IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2013 (Seattle, Washington), April 28--30},
        Title = {Open-Source Bitstream Generation},
        Year = {2013}
    }

@InProceedings{Monson2013,
  author        = {Monson, Josh and Wirthlin, Mike and Hutchings, Brad L},
  title         = {Optimization techniques for a high level synthesis implementation of the sobel filter},
  booktitle     = {Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference on},
  year          = {2013},
  pages         = {1--6},
  organization  = {IEEE},
  __markedentry = {[jmonson:]},
  doi           = {10.1109/ReConFig.2013.6732315}
}

@misc{w3c-provenance-dm-13,
 title = {PROV-DM: The PROV Data Model},
 author = {Luc Moreau and Paolo Missier and Khalid Belhajjame and Reza B\textquotesingle Far and James Cheney and Sam Coppens and Stephen Cresswell and Yolanda Gil and Paul Groth and Graham Klyne and Timothy Lebo and Jim McCusker and Simon Miles and James Myers and Satya Sahoo and Curt Tilmes},
 note = {World Wide Web Consortium (W3C)},
 year = {2013},
 url = {http://www.w3.org/TR/prov-dm/ }
}

@misc{w3c-provenance-dm-13,
 title = {PROV-DM: The PROV Data Model},
 author = {Luc Moreau and Paolo Missier and Khalid Belhajjame and Reza B\textquotesingle Far and James Cheney and Sam Coppens and Stephen Cresswell and Yolanda Gil and Paul Groth and Graham Klyne and Timothy Lebo and Jim McCusker and Simon Miles and James Myers and Satya Sahoo and Curt Tilmes},
 note = {World Wide Web Consortium (W3C)},
 year = {2013},
 url = {http://www.w3.org/TR/prov-dm/ }
}

@techreport{lebo2013prov,
	title        = {{PROV-O}: The {PROV} ontology},
	author       = {Lebo, Timothy and Sahoo, Satya and McGuinness, Deborah and Belhajjame, Khalid and Cheney, James and Corsar, David and Garijo, Daniel and Soiland-Reyes, Stian and Zednik, Stephan and Zhao, Jun},
	year         = 2013,
	journal      = {W3C recommendation},
	publisher    = {W3C},
	volume       = 30,
	url          = {https://www.w3.org/TR/2013/REC-prov-o-20130430/}
}

@misc{sankaran2013packet,
  title={Packet drop analysis for flows of data},
  author={Sankaran, Ganesh Chennimalai and Sivaraj, Dinesh},
  year={2013},
  month=dec # "~10",
  publisher={Google Patents},
  note={US Patent 8,605,588}
}

@article{Proctor2013ParalinguisticMechanismsofProduction,
 author = {Proctor, Michael I. and Bresch, Erik and Byrd, Dani and Nayak, Krishna S. and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 doi = {10.1121/1.4773865},
 journal = {Journal of the Acoustical Society of America},
 link = {http://sail.usc.edu/publications/files/JASMAN-000133-001043_1.pdf},
 month = {Feb},
 number = {2},
 pages = {1043-1054},
 title = {Paralinguistic Mechanisms of Production in Human Beatboxing: a Real-time Magnetic Resonance Imaging Study},
 volume = {133},
 year = {2013}
}

@article{Schuller2013ParalinguisticsinSpeechand,
 author = {Schuller, Bjorn and Steidl, Stefan and Batliner, Anton and Burkhardt, Felix and Devillers, Laurence and Muller, Christian and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 doi = {dx.doi.org/10.1016/j.csl.2012.02.005.},
 journal = {Computer, Speech, and Language},
 link = {http://sail.usc.edu/publications/files/1-s2.0-S0885230812000162-main.pdf},
 month = {Jan},
 number = {1},
 pages = {4-39},
 title = {Paralinguistics in Speech and Language--State-of-the-Art and the Challenge},
 volume = {27},
 year = {2013}
}

@article{sivakumar2013performance,
  title={Performance analysis of ONU-wavelength grouping schemes for efficient scheduling in long reach-PONs},
  author={Sivakumar, Anusha and Sankaran, Ganesh C and Sivalingam, Krishna M},
  journal={Optical Switching and Networking},
  volume={10},
  number={4},
  pages={465--474},
  year={2013},
  publisher={Elsevier}
}

@InProceedings{ambite2013:ASHG,
  author = 	 {Jos\'{e} Luis Ambite and Leslie Lange and Shefali Sharma and Serban Voinea and Chun-Nan Hsu and Yigal Arens},
  title = 	 {PhenoExplorer: a tool to help researchers identify relevant studies and phenotypic variables in dbGaP},
  booktitle = {63nd Annual Meeting of the American Society of Human Genetics (ASHG)},
  year = 	 {2013},
  address = 	 {Boston, MA},
  note = 	 {Abstract + Poster},
}

@article{pendergrass2013,
  author = {Pendergrass, Sarah A. AND Brown-Gentry, Kristin AND Dudek, Scott AND Frase, Alex AND Torstenson, Eric S. AND Goodloe, Robert AND Ambite, Jos\'{e} Luis AND Avery, Christy L. AND Buyske, Steve AND Buzkova, Petra AND Deelman, Ewa AND Fesinmeyer, Megan D. AND Haiman, Christopher A. AND Heiss, Gerardo AND Hindorff, Lucia A. AND Hsu, Chu-Nan AND Jackson, Rebecca D. AND Kooperberg, Charles AND Le Marchand, Loic AND Lin, Yi AND Matise, Tara C. AND Monroe, Kristine R. AND Moreland, Larry AND Park, Sungshim L. AND Reiner, Alex AND Wallace, Robert AND Wilkens, Lynn R. AND Crawford, Dana C. AND Ritchie, Marylyn D.},
  journal = {PLoS Genetics},
  publisher = {Public Library of Science},
  title = {Phenome-Wide Association Study ({PheWAS}) for Detection of Pleiotropy within the Population Architecture using Genomics and Epidemiology ({PAGE}) Network},
  year = {2013},
  volume = {9},
  url = {http://dx.doi.org/10.1371%2Fjournal.pgen.1003087},
  pages = {e1003087},
  number = {1},
  doi = {10.1371/journal.pgen.1003087}
}    

@inproceedings{barnhart2013phoenix,
  title={Phoenix program status-2013},
  author={Barnhart, David and Sullivan, Brook and Hunter, Roger and Bruhn, Janine and Fowler, Erin and Hoag, Lucille M and Chappie, Scott and Henshaw, Glen and Kelm, Bernie E and Kennedy, Tim and others},
  booktitle={AIAA SPACE 2013 conference and exposition},
  pages={5341},
  month = sep,
  year={2013},
  isbn = {978-1-62410-239-4},
  doi = {10.2514/6.2013-5341}
}

@article{cheng2013,
author = {Cheng, Iona and Kocarnik, Jonathan M and Dumitrescu, Logan and Lindor, Noralane M and Chang-Claude, Jenny and Avery, Christy L and Caberto, Christian P and Love, Shelly-Ann and Slattery, Martha L and Chan, Andrew T and Baron, John A and Hindorff, Lucia A and Park, Sungshim Lani and Schumacher, Fredrick R and Hoffmeister, Michael and Kraft, Peter and Butler, Anne M and Duggan, David J and Hou, Lifang and Carlson, Chris S and Monroe, Kristine R and Lin, Yi and Carty, Cara L and Mann, Sue and Ma, Jing and Giovannucci, Edward L and Fuchs, Charles S and Newcomb, Polly A and Jenkins, Mark A and Hopper, John L and Haile, Robert W and Conti, David V and Campbell, Peter T and Potter, John D and Caan, Bette J and Schoen, Robert E and Hayes, Richard B and Chanock, Stephen J and Berndt, Sonja I and Küry, Sebastien and Bézieau, Stephane and Ambite, Jos\'{e} Luis and Kumaraguruparan, Gowri and Richardson, Danielle M and Goodloe, Robert J and Dilks, Holli H and Baker, Paxton and Zanke, Brent W and Lemire, Mathieu and Gallinger, Steven and Hsu, Li and Jiao, Shuo and Harrison, Tabitha A and Seminara, Daniela and Haiman, Christopher A and Kooperberg, Charles and Wilkens, Lynne R and Hutter, Carolyn M and White, Emily and Crawford, Dana C and Heiss, Gerardo and Hudson, Thomas J and Brenner, Hermann and Bush, William S and Casey, Graham and Le Marchand, Loïc and Peters, Ulrike}, 
title = {Pleiotropic effects of genetic risk variants for other cancers on colorectal cancer risk: {PAGE}, {GECCO} and {CCFR} consortia},
year = {2013}, 
doi = {10.1136/gutjnl-2013-305189}, 
URL = {http://gut.bmj.com/content/early/2013/08/09/gutjnl-2013-305189.abstract}, 
eprint = {http://gut.bmj.com/content/early/2013/08/09/gutjnl-2013-305189.full.pdf+html}, 
journal = {Gut} 
}

@article{dumitrescu2013:ahg,
  author = 	 {Dumitrescu, Logan and Carty, Cara L. and Franceschini, Nora and Hindorff, Lucia A. and Cole, Shelley A. and Bůžková, Petra and Schumacher, Fredrick R. and Eaton, Charles B. and Goodloe, Robert J. and Duggan, David J. and Haessler, Jeff and Cochran, Barbara and Henderson, Brian E. and Cheng, Iona and Johnson, Karen C. and Carlson, Chris S. and Love, Shelly-Ann and Brown-Gentry, Kristin and Nato, Alejandro Q. and Quibrera, Miguel and Anderson, Garnet and Shohet, Ralph V. and Ambite, José Luis and Wilkens, Lynne R. and Marchand, Loïc Le and Haiman, Christopher A. and Buyske, Steven and Kooperberg, Charles and North, Kari E. and Fornage, Myriam and Crawford, Dana C.},
  title = 	 {Post-Genome-Wide Association Study Challenges for Lipid Traits: Describing Age as a Modifier of Gene-Lipid Associations in the Population Architecture Using Genomics and Epidemiology {PAGE} Study},
journal = {Annals of Human Genetics},
volume = {77},
number = {5},
issn = {1469-1809},
url = {http://dx.doi.org/10.1111/ahg.12027},
doi = {10.1111/ahg.12027},
pages = {416--425},
keywords = {PAGE, modifier, age, lipids, genetic association},
year = {2013},
}

@InProceedings{Quan13a,
	author = 	"Lin Quan and John Heidemann and Yuri Pradkin",
	title = 	"Poster Abstract: Towards Active Measurements of Edge Network Outages",
	booktitle = 	"Proceedings of the " # " Passive and Active Measurement Workshop",
	year = 		2013,
	sortdate = 		"2013-03-01",
	project = "ant, lacrend, lander, retrofuture, duoi",
	jsubject = "routing",
	pages = 	"276--279",
	month = 	mar,
	address = 	"Hong Kong, China",
	publisher = 	"Springer",
	jlocation = 	"johnh: pafile",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "Springer",
	copyrightterms = "An author may self-archive an author-created version of his/her article on his/her own website and or in his/her institutional repository. He/she may also deposit this version on his/her funder's or funder's designated repository at the funder's request or as a result of a legal obligation, provided it is not made publicly available until 12 months after official publication. He/she may not use the publisher's PDF version, which is posted on \url{www.springerlink.com}, for the purpose of self-archiving or deposit. Furthermore, the author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: ``The final publication is available at www.springerlink.com''. " ,
	keywords = 	"routing outages, poster abstract",
	doi = "10.1007/978-3-642-36516-4_33",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Quan13a.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Quan13a.pdf",
	myorganization =	"USC/Information Sciences Institute",
	abstract = "(The full paper is the abtract, but in brief, the
                  poster describes preliminary work to interpret ICMP echo replys
                  for network blocks as outages.)",
}

% Quan13b superseded by Quan14d

(The full paper is the abtract, but in brief, the poster describes preliminary work to interpret ICMP echo replys for network blocks as outages.)

@article{journals/algorithms/AbeliukCN13,
  added-at = {2018-08-14T00:00:00.000+0200},
  author = {Abeliuk, Andr{\'{e}}s and C{\'{a}}novas, Rodrigo and Navarro, Gonzalo},
  biburl = {https://www.bibsonomy.org/bibtex/20782f182ab3a13dc0f7827e29c2a7f85/dblp},
  ee = {https://doi.org/10.3390/a6020319},
  interhash = {b14f4b201fe0a9f2b8d13bd9f44ca914},
  intrahash = {0782f182ab3a13dc0f7827e29c2a7f85},
  journal = {Algorithms},
  keywords = {dblp},
  number = 2,
  pages = {319-351},
  timestamp = {2018-08-15T11:48:05.000+0200},
  title = {Practical Compressed Suffix Trees.},
  url = {http://dblp.uni-trier.de/db/journals/algorithms/algorithms6.html#AbeliukCN13},
  volume = 6,
  year = 2013,
  month = may,
  doi = {10.3390/a6020319}
}

@article{verborgh2013proceedings,
  title={Proceedings of the first workshop on services and applications over linked APIs and data},
  author={Verborgh, Ruben and Maleshkova, Maria and Stadtm{\"u}ller, Steffen and Steiner, Thomas and Szekely, Pedro},
  year={2013}
}

@InProceedings{	  rynge2013adass,
  Author	= {Mats Rynge and Gideon Juve and Jamie Kinney and John Good
		  and G. Bruce Berriman and Ann Merrihew and Ewa Deelman},
  URL		= {http://pegasus.isi.edu/publications/2013/rynge-montage-pegasus-amazon-adass2013.pdf},
  Title		= {Producing an Infrared Multiwavelength Galactic Plane Atlas
		  using Montage, Pegasus and Amazon Web Services},
  BookTitle	= {23rd Annual Astronomical Data Analysis Software and
		  Systems (ADASS) Conference},
  Year		= {2013},
  Note		= {Funding Acknowledgments: OCI SI2-SSI program grant
		  #1148515}
}

@inproceedings{knoblock13:iswc-demo,
	author = {Craig A. Knoblock and Pedro Szekely and Shubham Gupta and Animesh Manglik and Ruben Verborgh and Fengyu Yang and Rik Van de Walle},
	title = {Publishing Data from the Smithsonian American Art Museum as Linked Open Data },
	booktitle = {Proceedings of the ISWC 2013 Posters \& Demonstrations Track},
	editors = {Eva Blomqvist and Tudor Groza},
	pages = {129-132},
	year = {2013},
	urlPaper = {http://ceur-ws.org/Vol-1035/iswc2013_demo_33.pdf},
	urlPoster = {http://usc-isi-i2.github.io/slides/knoblock13-iswc-demo-poster.pdf},
	urlVideo = {http://youtu.be/1Vaytr09H1w},
	urlLink = {http://ceur-ws.org/Vol-1035/}
}

@inproceedings{knoblock2013publishing,
  title={Publishing Data from the Smithsonian American Art Museum as Linked Open Data.},
  author={Knoblock, Craig A and Szekely, Pedro A and Gupta, Shubham and Manglik, Animesh and Verborgh, Ruben and Yang, Fengyu and Van de Walle, Rik},
  booktitle={International Semantic Web Conference (Posters \& Demos)},
  pages={129--132},
  year={2013}
}

@inproceedings{Metallinou2013QuantifyingAtypicalityInAffective,
 author = {Metallinou, Angeliki and Grossman, Ruth and Narayanan, Shrikanth S.},
 bib2html_rescat = {care},
 booktitle = {Proceedings of the IEEE International Conference on Multimedia Expo (ICME)},
 doi = {10.1109/ICME.2013.6607640},
 link = {http://sail.usc.edu/publications/files/paper-icme-2013.pdf},
 location = {San Jose, CA},
 month = {Jul},
 title = {Quantifying Atypicality In Affective Facial Expressions Of Children With Autism Spectrum Disorders},
 year = {2013}
}

@article{garijo2013quantifying,
	title        = {Quantifying reproducibility in computational biology: the case of the tuberculosis drugome},
	author       = {Garijo, Daniel and Kinnings, Sarah and Xie, Li and Xie, Lei and Zhang, Yinliang and Bourne, Philip E and Gil, Yolanda},
	year         = 2013,
	journal      = {PloS one},
	publisher    = {Public Library of Science},
	volume       = 8,
	number       = 11,
	pages        = {e80278},
	doi          = {10.1371/journal.pone.0080278},
	url          = {https://dgarijo.com/papers/plos.pdf}
}

@TechReport{Zhang13b,
	author = 	"Chengjie Zhang and John Heidemann",
	title = 	"Reducing False Alarms with Multi-modal
                  Sensing for Pipeline Blockage (extended)",
	institution = 	"USC/Information Sciences Institute",
	year = 		2013,
	sortdate = "2013-06-01",
	project = "ilense, cisoft",
	jsubject = "sensornet_fusion",
	number =	"ISI-TR-2013-686b",
	month =		jun,
	note = "(revised July 2013)",
	location =	"johnh: pafile",
	keywords =	"sensornet, multi-sensor fusion, cold oil blockage, cisoft",
	url =		"http://www.isi.edu/%7ejohnh/PAPERS/Zhang13b.html",
	pdfurl =	"http://www.isi.edu/%7ejohnh/PAPERS/Zhang13b.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "Industrial sensing applications place a premium on cost-effectiveness
and accuracy.  Traditional approaches often use expensive, invasive
sensors, because inexpensive sensors suffer from false positive
detections.  Sensor cost means automation is sparse or avoided when
the value of specific sites cannot be justified.  In this paper, we
show combining different types of sensors can allow low-cost sensors
to avoid false positives, enable much greater levels of automation in
some applications.  We explore this problem by studying a specific
application:  blockages in oil pipelines common in cold weather.  We
use pipe skin temperature to infer changes in fluid flow, and combine
readings with acoustic data to avoid false positives and be robust to
environmental changes.  We demonstrate that our approach is effective
with field experiments.  Finally, suggest that this approach
generalizes to other classes of problems where false positives from
one sensing modality can be resolved by multi-modal sensing.",
}

Industrial sensing applications place a premium on cost-effectiveness and accuracy. Traditional approaches often use expensive, invasive sensors, because inexpensive sensors suffer from false positive detections. Sensor cost means automation is sparse or avoided when the value of specific sites cannot be justified. In this paper, we show combining different types of sensors can allow low-cost sensors to avoid false positives, enable much greater levels of automation in some applications. We explore this problem by studying a specific application: blockages in oil pipelines common in cold weather. We use pipe skin temperature to infer changes in fluid flow, and combine readings with acoustic data to avoid false positives and be robust to environmental changes. We demonstrate that our approach is effective with field experiments. Finally, suggest that this approach generalizes to other classes of problems where false positives from one sensing modality can be resolved by multi-modal sensing.

@inproceedings{hussain2013replay,
  title={Replay of malicious traffic in network testbeds},
  author={Hussain, Alefiya and Pradkin, Yuri and Heidemann, John},
  booktitle={2013 IEEE International Conference on Technologies for Homeland Security (HST)},
  pages={322--327},
  year={2013},
  organization={IEEE}
}

@article{sankaran2013report,
  title={Report duration computation schemes in reduced-buffer optical network units for passive optical networks},
  author={Sankaran, Ganesh C and Sivalingam, Krishna M},
  journal={IEEE/OSA Journal of Optical Communications and Networking},
  volume={5},
  number={11},
  pages={1157--1167},
  year={2013},
  publisher={IEEE}
}

@mastersthesis {abramson2013resiliency_2,
	title = {Resiliency-aware scheduling},
	month = mar,
	year = {2013},
	school = {University of Southern California},
	type = {phd},
	author = {Abramson, Jeremy}
}

@InProceedings{	  vahi2013rethinking,
  Author	= {Karan Vahi and Mats Rynge and Gideon Juve and Rajiv Mayani
		  and Ewa Deelman},
  URL		= {http://pegasus.isi.edu/publications/2013/Vahi-PegasusLite-IEEE-BigData-2013.pdf},
  Title		= {Rethinking Data Management for Big Data Scientific
		  Workflows},
  BookTitle	= {Workshop on Big Data and Science: Infrastructure and
		  Services},
  Year		= {2013},
  Note		= {Funding Acknowledgments: OCI SDCI program grant #0722019
		  and OCI SI2-SSI program grant #1148515}
}

@inproceedings{Mal2013SAIL:Ahybridapproach,
 author = {Malandrakis, Nikolaos and Kazemzadeh, Abe and Potamianos, Alexandros and Narayanan, Shrikanth S.},
 bib2html_rescat = {emotion},
 booktitle = {Second Joint Conference on Lexical and Computational Semantics (*SEM), Volume 2: Proceedings of the Seventh International Workshop on Semantic Evaluation (SemEval 2013)},
 link = {http://sail.usc.edu/publications/files/Nikos-SemEval-S13-2072.pdf},
 month = {Jun},
 pages = {438-442},
 publisher = {Association for Computational Linguistics},
 title = {SAIL: A hybrid approach to sentiment analysis},
 year = {2013}
}

@inproceedings{ICDCS13,
	author    = {Hagit Attiya and
	Sandeep Hans and
	Petr Kuznetsov and
	Srivatsan Ravi},
	title     = {Safety of Deferred Update in Transactional Memory},
	booktitle = {{IEEE} 33rd International Conference on Distributed Computing Systems,
	{ICDCS} 2013, 8-11 July, 2013, Philadelphia, Pennsylvania, {USA}},
	pages     = {601--610},
	publisher = {{IEEE} Computer Society},
	year      = {2013}
}

@InProceedings{konstantinidis2013,
  author    = {George Konstantinidis and Jos\'{e} Luis Ambite},
  title = 	 {Scalable Containment for Unions of Conjunctive Queries Under Constraints},
  booktitle = {5th International Workshop on Semantic Web Information Management (SWIM 2013)},
  year = 	 {2013},
  address = 	 {New York, NY}
}

@INPROCEEDINGS{Kang13dubmod,
  AUTHOR =       {Jeon-hyung Kang and Kristina Lerman},
  TITLE =        {Scalable Mining of Social Data using Stochastic Gradient Fisher Scoring},
  BOOKTITLE =    {Proc. CIKM workshop on Data-driven User Behavioral Modelling and Mining from Social Media (DUBMOD)},
  YEAR =         {2013},
   urlPaper = {http://www.isi.edu/integration/people/lerman/papers/dubmod05-kang.pdf},
  keywords =     {social-annotation},
}

@inproceedings{knoblock13:sbd,
	author = {Craig A. Knoblock and Pedro Szekely},
	title = {Semantics for Big Data Integration and Analysis },
	booktitle = {Proceedings of the AAAI Fall Symposium on Semantics for Big Data},
	year = {2013},
	urlPaper= "http://usc-isi-i2.github.io/papers/knoblock13-sbd.pdf",
	urlSlides="http://www.slideshare.net/CraigKnoblock/semantics-for-big-data-integration-and-analysis"
}

@inproceedings{kim2013sentiment,
  title={Sentiment prediction using collaborative filtering},
  author={Kim, Jihie and Yoo, Jaebong and Lim, Ho and Qiu, Huida and Kozareva, Zornitsa and Galstyan, Aram},
  booktitle={Proceedings of the International AAAI Conference on Web and Social Media},
  volume={7},
  number={1},
  pages={685--688},
  year={2013}
}

@INCOLLECTION{Lerman13hcbook,
  AUTHOR =       {Kristina Lerman},
  editor =       {Pietro Michelucci},
  BOOKTITLE =        {Handbook of Social Computation},
  TITLE =      {Social Informatics: Using Big Data to Understand Social Behavior},
  pages =        {},
  PUBLISHER =    {Springer},
  YEAR =         {2013},
  address =      {},
  note =         {},
  keywords =     {social-dynamics},
}

@incollection{DBLP:reference/sp/Gil13,
  author       = {Yolanda Gil},
  editor       = {Pietro Michelucci},
  title        = {Social Knowledge Collection},
  booktitle    = {Handbook of Human Computation},
  pages        = {285--296},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-1-4614-8806-4\_24},
  doi          = {10.1007/978-1-4614-8806-4\_24},
  timestamp    = {Tue, 01 Jun 2021 15:21:28 +0200},
  biburl       = {https://dblp.org/rec/reference/sp/Gil13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{cho2013socially,
  title={Socially relevant venue clustering from check-in data},
  author={Cho, Yoon-Sik and Ver Steeg, Greg and Galstyan, Aram},
  booktitle={KDD Workshop on Mining and Learning with Graphs},
  year={2013}
}

@inproceedings{Kim2013Spatialandtemporalalignment,
 author = {Kim, Jangwon and Lammert, Adam and Ghosh, Prasanta Kumar and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 booktitle = {International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
 doi = {10.1109/ICASSP.2013.6638336},
 link = {http://sail.usc.edu/publications/files/registration_ema_mri.pdf},
 location = {Vancouver, Canada},
 month = {May},
 pages = {3637-3641},
 title = {Spatial and Temporal Alignment of Multimodal Human Speech Production Data: Realtime Imaging, Flesh Point Tracking and Audio},
 year = {2013}
}

@article{Ramanarayanan2013Spatio-temporalarticulatorymovementprimitives,
 author = {Ramanarayanan, Vikram and Goldstein, Louis and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 doi = {10.1121/1.4812765},
 journal = {J. Acoust. Soc. Am.},
 link = {http://sail.usc.edu/publications/files/Ramanarayanan-Primitives-JASA2013.pdf},
 month = {Aug},
 number = {2},
 pages = {1378-1394},
 title = {Spatio-temporal articulatory movement primitives during speech production -- extraction, interpretation and validation},
 volume = {134},
 year = {2013}
}

@inproceedings{Li2013Speakerverificationbasedon,
 author = {Li, Ming and Kim, Jangwon and Ghosh, Prasanta Kumar and Ramanarayanan, Vikram and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 booktitle = {Proceedings of InterSpeech},
 doi = {10.1016/j.csl.2015.05.003},
 link = {http://sail.usc.edu/publications/files/MingLi_SpeakerVerification.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {Speaker verification based on fusion of acoustic and articulatory Information},
 year = {2013}
}

@inproceedings{Li2013Speakerverificationusingsimplified,
 author = {Li, Ming and Tsiartas, Andreas and Van Segbroeck, Maarten and Narayanan, Shrikanth S.},
 bib2html_rescat = {},
 booktitle = {International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
 doi = {https://doi.org/10.1109/icassp.2013.6639060},
 link = {http://sail.usc.edu/publications/files/SPVer_ML.pdf},
 location = {Vancouver, Canada},
 month = {May},
 title = {Speaker verification using simplified and supervised i-vector modeling},
 year = {2013}
}

@article{Smith13spectral,
    abstract = {Spectral clustering is widely used to partition graphs into distinct modules
or communities. Existing methods for spectral clustering use the eigenvalues
and eigenvectors of the graph Laplacian, an operator that is closely associated
with random walks on graphs. We propose a new spectral partitioning method that
exploits the properties of epidemic diffusion. An epidemic is a dynamic process
that, unlike the random walk, simultaneously transitions to all the neighbors
of a given node. We show that the replicator, an operator describing epidemic
diffusion, is equivalent to the symmetric normalized Laplacian of a reweighted
graph with edges reweighted by the eigenvector centralities of their incident
nodes. Thus, more weight is given to edges connecting more central nodes. We
describe a method that partitions the nodes based on the componentwise ratio of
the replicator's second eigenvector to the first, and compare its performance
to traditional spectral clustering techniques on synthetic graphs with known
community structure. We demonstrate that the replicator gives preference to
dense, clique-like structures, enabling it to more effectively discover
communities that may be obscured by dense intercommunity linking.},
    journal = {Physical Review E},
  volume =       {88},
  number =       {4},
  pages =        {042813},
    author = {Smith, Laura M. and Lerman, Kristina and Garcia-Cardona, Cristina and Percus, Allon G. and Ghosh, Rumi},
    keywords = {social-networks},
    title = {Spectral Clustering with Epidemic Diffusion},
    UrlPaper = {http://arxiv.org/abs/1303.2663},
    year = {2013}
}

Spectral clustering is widely used to partition graphs into distinct modules or communities. Existing methods for spectral clustering use the eigenvalues and eigenvectors of the graph Laplacian, an operator that is closely associated with random walks on graphs. We propose a new spectral partitioning method that exploits the properties of epidemic diffusion. An epidemic is a dynamic process that, unlike the random walk, simultaneously transitions to all the neighbors of a given node. We show that the replicator, an operator describing epidemic diffusion, is equivalent to the symmetric normalized Laplacian of a reweighted graph with edges reweighted by the eigenvector centralities of their incident nodes. Thus, more weight is given to edges connecting more central nodes. We describe a method that partitions the nodes based on the componentwise ratio of the replicator's second eigenvector to the first, and compare its performance to traditional spectral clustering techniques on synthetic graphs with known community structure. We demonstrate that the replicator gives preference to dense, clique-like structures, enabling it to more effectively discover communities that may be obscured by dense intercommunity linking.

@inproceedings{Gibson2013Spectro-TemporalDirectionalDerivativeFeatures,
 author = {Gibson, James and Van Segbroeck, Maarten and Ortega, Antonio and Georgiou, Panayiotis and Narayanan, Shrikanth S.},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of InterSpeech},
 doi = {10.1007/s11042-014-1973-7},
 link = {http://sail.usc.edu/publications/files/JamesGibson_Spectro-TemporalFeatures.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {Spectro-Temporal Directional Derivative Features for Automatic Speech Recognition},
 year = {2013}
}

@inproceedings{Gupta2013Speechparalinguisticeventdetection,
 author = {Gupta, Rahul and Audhkhasi, Kartik and Lee, Sungbok and Narayanan, Shrikanth S.},
 bib2html_rescat = {bsp},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/RahulGupta_SpeechParalinguisticDetection.pdf},
 location = {Lyon, France  [INTERSPEECH 2013 PARALINGUISTICS CHALLENGE AWARD]},
 month = {Aug},
 title = {Speech paralinguistic event detection using probabilistic time-series smoothing and masking},
 year = {2013}
}

@inproceedings{Smith2013Stablearticulatorytasksand,
 author = {Smith, Caitlin and Proctor, Michael I. and Iskarous, Khalil and Goldstein, Louis and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/smith_interspeech_2013.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {Stable articulatory tasks and their variable formation: Tamil retroflex consonants},
 year = {2013}
}

@article{Lammert2013StatisticalMethodsforEstimation,
 abstract = {We present and evaluate two statistical methods for estimating kinematic relationships of the speech production system: artificial neural
networks and locally-weighted regression. The work is motivated by the need to characterize this motor system, with particular focus
on estimating differential aspects of kinematics. Kinematic analysis will facilitate progress in a variety of areas, including the nature of
speech production goals, articulatory redundancy and, relatedly, acoustic-to-articulatory inversion. Statistical methods must be used to
estimate these relationships from data since they are infeasible to express in closed form. Statistical models are optimized and evaluated
using a heldout data validation procedure on two sets of synthetic speech data. The theoretical and practical advantages of both methods
are also discussed. It is shown that both direct and differential kinematics can be estimated with high accuracy, even for complex, nonlinear relationships. Locally-weighted regression displays the best overall performance, which may be due to practical advantages in
its training procedure. Moreover, accurate estimation can be achieved using only a modest amount of training data, as judged by convergence
of performance. The algorithms are also applied to real-time MRI data, and the results are generally consistent with those
obtained from synthetic data.},
 author = {Lammert, Adam and Goldstein, Louis and Narayanan, Shrikanth S. and Iskarous, Khalil},
 bib2html_rescat = {},
 doi = {dx.doi.org/10.1016/j.specom.2012.08.001},
 journal = {Speech Communication},
 link = {http://sail.usc.edu/publications/files/Lammert-SPECOM-InvKin2013.pdf},
 number = {1},
 pages = {147-161},
 title = {Statistical Methods for Estimation of Direct and Differential Kinematics of the Vocal Tract},
 volume = {55},
 year = {2013}
}

We present and evaluate two statistical methods for estimating kinematic relationships of the speech production system: artificial neural networks and locally-weighted regression. The work is motivated by the need to characterize this motor system, with particular focus on estimating differential aspects of kinematics. Kinematic analysis will facilitate progress in a variety of areas, including the nature of speech production goals, articulatory redundancy and, relatedly, acoustic-to-articulatory inversion. Statistical methods must be used to estimate these relationships from data since they are infeasible to express in closed form. Statistical models are optimized and evaluated using a heldout data validation procedure on two sets of synthetic speech data. The theoretical and practical advantages of both methods are also discussed. It is shown that both direct and differential kinematics can be estimated with high accuracy, even for complex, nonlinear relationships. Locally-weighted regression displays the best overall performance, which may be due to practical advantages in its training procedure. Moreover, accurate estimation can be achieved using only a modest amount of training data, as judged by convergence of performance. The algorithms are also applied to real-time MRI data, and the results are generally consistent with those obtained from synthetic data.

@INPROCEEDINGS{steeg2012statistical,
	title = {Statistical Tests for Contagion in Observational Social Network Studies},
	BOOKTITLE =    {AISTATS'13},
	year = {2013},
	urlpaper = {http://arxiv.org/abs/1211.4889},
	author = {Greg {Ver Steeg} and Aram Galstyan}
}

@article{Hogg13socialcom,
    abstract = {User response to contributed content in online social media depends on many
factors. These include how the site lays out new content, how frequently the
user visits the site, how many friends the user follows, how active these
friends are, as well as how interesting or useful the content is to the user.
We present a stochastic modeling framework that relates a user's behavior to
details of the site's user interface and user activity and describe a procedure
for estimating model parameters from available data. We apply the model to
study discussions of controversial topics on Twitter, specifically, to predict
how followers of an advocate for a topic respond to the advocate's posts. We
show that a model of user behavior that explicitly accounts for a user
transitioning through a series of states before responding to an advocate's
post better predicts response than models that fail to take these states into
account. We demonstrate other benefits of stochastic models, such as their
ability to identify users who are highly interested in advocate's posts.},
    author = {Hogg, Tad and Lerman, Kristina and Smith, Laura M.},
    journal = {ASE HUMAN},
volume={2},
number={1},
    keywords = {social-dynamics},
    title = {Stochastic Models Predict User Behavior in Social Media},
    urlPaper = {http://arxiv.org/abs/1308.2705},
    year = {2013}
}

User response to contributed content in online social media depends on many factors. These include how the site lays out new content, how frequently the user visits the site, how many friends the user follows, how active these friends are, as well as how interesting or useful the content is to the user. We present a stochastic modeling framework that relates a user's behavior to details of the site's user interface and user activity and describe a procedure for estimating model parameters from available data. We apply the model to study discussions of controversial topics on Twitter, specifically, to predict how followers of an advocate for a topic respond to the advocate's posts. We show that a model of user behavior that explicitly accounts for a user transitioning through a series of states before responding to an advocate's post better predicts response than models that fail to take these states into account. We demonstrate other benefits of stochastic models, such as their ability to identify users who are highly interested in advocate's posts.

@inproceedings{Kang13hypertext,
    author = {Jeon-hyung Kang and Kristina Lerman},
    booktitle = {Proceedings of  24th ACM Conference on Hypertext and Social Media (HyperText)},
    keywords = {social-networks},
    title = {Structural and Cognitive Bottlenecks to Information Access in Social Networks},
    urlPaper = {http://arxiv.org/abs/1303.0861},
    year = {2013},
}

@article{DBLP:journals/prl/SethiJG13,
  author       = {Ricky J. Sethi and
                  Hyunjoon Jo and
                  Yolanda Gil},
  title        = {Structured analysis of the {ISI} Atomic Pair Actions dataset using
                  workflows},
  journal      = {Pattern Recognit. Lett.},
  volume       = {34},
  number       = {15},
  pages        = {2023--2032},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.patrec.2012.12.015},
  doi          = {10.1016/J.PATREC.2012.12.015},
  timestamp    = {Tue, 16 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/prl/SethiJG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Han2013TRAPLanguageIdentificationSystem,
 author = {Han, Kyu Jeong and Ganapathy, Sriram and Li, Ming and Omar, Mohamed K. and Narayanan, Shrikanth S.},
 bib2html_rescat = {rats},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/KyuHan_LanguageIDSystem.pdf},
 location = {Lyon, France},
 month = {Aug},
 pages = {1502-1506},
 title = {TRAP Language Identification System for RATS Phase II Evaluation},
 year = {2013}
}

@article{gil-hirsh-aimag13, 
  title = {The AAAI Fall Symposium on "Discovery Informatics: The Role of AI Research in Innovating Scientific Processes},
  author = {Yolanda Gil and Haym Hirsh},
  year      = {2013},
 journal = {AI Magazine},
 volume=34,
 number=1,
 url = {https://knowledgecaptureanddiscovery.github.io/yolanda_gil_website/papers/gil-hirsh-aimag13.pdf}
}

@Article{	  berriman2013royal,
  Author	= {G. Bruce Berriman and Gideon Juve and Jens-S. Vöckler and
		  Ewa Deelman and Mats Rynge},
  URL		= {http://rsta.royalsocietypublishing.org/content/371/1983/20120066.abstract},
  Title		= {The Application of Cloud Computing to Scientific
		  Workflows: A Study of Cost and Performance},
  Journal	= {Proceedings of the Royal Society A},
  Volume	= {371},
  Number	= {1983},
  Month		= {January},
  Year		= {2013},
  Note		= {Funding Acknowledgments: NSF OCI-0910812, NSF OCI-0943725,
		  NASA NCC5-626, and Amazon Educational Grant}
}

@inproceedings{DBLP:conf/semco/GilKZZRS13,
  author       = {Yolanda Gil and
                  Angela Knight and
                  Kevin Zhang and
                  Larry Zhang and
                  Varun Ratnakar and
                  Ricky J. Sethi},
  title        = {The Democratization of Semantic Properties: An Analysis of Semantic
                  Wikis},
  booktitle    = {2013 {IEEE} Seventh International Conference on Semantic Computing,
                  Irvine, CA, USA, September 16-18, 2013},
  pages        = {206--211},
  publisher    = {{IEEE} Computer Society},
  year         = {2013},
  url          = {https://doi.org/10.1109/ICSC.2013.44},
  doi          = {10.1109/ICSC.2013.44},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/semco/GilKZZRS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{hill2013market,
  title={The Market for Satellite Cellularization: A historical view of the impact of the satlet morphology on the space industry},
  author={Hill, Lisa and Barnhart, David and Fowler, Erin and Hunter, Roger and Hoag, Lucille M and Sullivan, Brook and Will, Peter},
  booktitle={AIAA SPACE 2013 Conference and Exposition},
  pages={5486},
  month = sep,
  year={2013},
  isbn = {978-1-62410-239-4},
  doi = {10.2514/6.2013-5486}
}

@inproceedings{Smith13socialcom,
    abstract = {In recent years, social media has revolutionized
how people communicate and share information. Twitter and
other blogging sites have seen an increase in political and
social activism. Previous studies on the behaviors of users in
politics have focused on electoral candidates and election results.
Our paper investigates the role of social media in discussing
and debating controversial topics. We apply sentiment analysis
techniques to classify the position (for, against, neutral) expressed
in a tweet about a controversial topic and use the results in
our study of user behavior. Our findings suggest that Twitter is
primarily used for spreading information to like-minded people
rather than debating issues. Users are quicker to rebroadcast
information than to address a communication by another user.
Individuals typically take a position on an issue prior to posting
about it and are not likely to change their tweeting opinion.},
    author = {Smith, Laura M. and Linhong Zhu and Kristina Lerman and Zornitsa Kozareva},
    booktitle = {ASE/IEEE International Conference on Social Computing},
    keywords = {social-dynamics},
    title = {The Role of Social Media in the Discussion of Controversial Topics},
    urlPaper = {http://www.isi.edu/integration/people/lerman/papers/Smith13socialcom.pdf},
    year = {2013}
}

In recent years, social media has revolutionized how people communicate and share information. Twitter and other blogging sites have seen an increase in political and social activism. Previous studies on the behaviors of users in politics have focused on electoral candidates and election results. Our paper investigates the role of social media in discussing and debating controversial topics. We apply sentiment analysis techniques to classify the position (for, against, neutral) expressed in a tweet about a controversial topic and use the results in our study of user behavior. Our findings suggest that Twitter is primarily used for spreading information to like-minded people rather than debating issues. Users are quicker to rebroadcast information than to address a communication by another user. Individuals typically take a position on an issue prior to posting about it and are not likely to change their tweeting opinion.

@inproceedings{Yang2013Theeffectofword,
 author = {Yang, Zhaojun and Ramanarayanan, Vikram and Byrd, Dani and Narayanan, Shrikanth S.},
 bib2html_rescat = {span},
 booktitle = {Proceedings of InterSpeech},
 link = {http://sail.usc.edu/publications/files/zhaojunyang_effectofwordfrequency.pdf},
 location = {Lyon, France},
 month = {Aug},
 title = {The effect of word frequency and lexical class on articulatory-acoustic coupling},
 year = {2013}
}

@InProceedings{Heidemann13c,
	author = 	"John Heidemann",
	title = 	"Third-Party Measurement of Network Outages in {Hurricane} {Sandy}",
	booktitle = 	"Proceedings of the " # " FCC Workshop on Network Resiliency",
	year = 		2013,
	sortdate = 		"2013-02-01",
	month = 	feb,
	address = 	"Brooklyn, New York, USA",
	keywords = 	"ant, network outages, hurricane sandy, fcc, duoi",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13d.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann13d.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	project = "ant, lander, retrofuture, duoi",
	abstract = "No formal abstract, but this extended abstract
                  summarizes our ability, as a third party,
		  to measure outages in edge networks at the time of
                  Hurricane Sandy.  This analysis showed U.S. networks
                  had double the outage rate (from 0.2\% to 0.4\%) on
                  2012-10-30, the day after Sandy landfall, and
                  recovered after four days.",
}

No formal abstract, but this extended abstract summarizes our ability, as a third party, to measure outages in edge networks at the time of Hurricane Sandy. This analysis showed U.S. networks had double the outage rate (from 0.2% to 0.4%) on 2012-10-30, the day after Sandy landfall, and recovered after four days.

@inproceedings{DBLP:conf/sc/GilRVHRMSP09,
  author       = {Yolanda Gil and
                  Varun Ratnakar and
                  Rishi Verma and
                  Andrew F. Hart and
                  Paul M. Ramirez and
                  Chris Mattmann and
                  Arni Sumarlidason and
                  Samuel L. Park},
  editor       = {Johan Montagnat and
                  Ian J. Taylor},
  title        = {Time-bound analytic tasks on large datasets through dynamic configuration
                  of workflows},
  booktitle    = {Proceedings of {WORKS} 2013: 8th Workshop On Workflows in Support
                  of Large-Scale Science, Held in conjunction with SC13, Denver, CO,
                  USA, November 17, 2013},
  pages        = {88--97},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2534248.2534257},
  doi          = {10.1145/2534248.2534257},
  timestamp    = {Tue, 16 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sc/GilRVHRMSP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@Article{Syed13a,
	author = 	"Affan A. Syed and John Heidemann and Wei Ye",
	title = 	"Tones for Real: Managing Multipath in Underwater Acoustic Wakeup",
	journal = 	"ACM Transactions on Sensor Networks",
	year = 		2013,
	sortdate = "2013-08-01",
	project = "ilense, ortun, cisoft",
	jsubject = "sensornet_high_latency",
	volume = 	9,
	number = 	3,
	pages = 	"27:1--27:24",
	month = 	aug,
	location = 	"johnh: pafile",
	keywords = 	"underwater MAC, self-reflection",
	url = "http://www.isi.edu/%7ejohnh/PAPERS/Syed13a.html",
	pdfurl = "http://www.isi.edu/%7ejohnh/PAPERS/Syed13a.pdf",
	doi = "http://dx.doi.org/http://dx.doi.org/10.1145/2422966.2422984",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "ACM",
	copyrightterms = "	Permission to make digital or hard  	copies of portions of this work for personal or  	classroom use is granted without fee provided that  	the 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 in  	print or the first screen in digital  	media. Copyrights for components of this work owned  	by others than ACM must be honored. Abstracting with  	credit is permitted.   	otherwise, to republish, to post on servers, or to  	redistribute to lists, requires prior specific  	permission and/or a fee. Send written requests for  	republication to ACM Publications, Copyright &  	Permissions at the address above or fax +1 (212)  	869-0481 or email [email protected]." ,
	abstract = "The principles of sensor networks---low-power, wireless, in-situ
sensing with many inexpensive sensors---are only recently penetrating
into underwater research.  Acoustic communication is best suited for
underwater communication, with much lower attenuation than RF, but
acoustic propagation is five orders-of-magnitude slower than RF, so
propagation times stretch to hundreds of milliseconds.  Low-power
wakeup tones are present in new underwater acoustic modems, and when
added to applications and MAC protocols they reduce energy consumption
wasted on idle listening.  Unfortunately, underwater acoustic tones
suffer from \emph{self-multipath}---echoes unique to the latency that
can completely defeat their protocol advantages.  We introduce
\emph{Self-Reflection Tone Learning} (SRTL), a novel approach where
nodes use Bayesian techniques to address interference by learning to
discriminate self-reflections from noise and independent
communication.  We present detailed experiments using an acoustic
modem in controlled and uncontrolled, in-air and underwater
environments.  These experiments demonstrate that SRTL's knowledge
corresponds to physical-world predictions, that it can cope with
underwater noise and reasonable levels of artificial noise, and that
it can track a changing multi-path environment.  Simulations confirm
that these real-world experiments generalize over a wide range of
conditions."
,}

The principles of sensor networks—low-power, wireless, in-situ sensing with many inexpensive sensors—are only recently penetrating into underwater research. Acoustic communication is best suited for underwater communication, with much lower attenuation than RF, but acoustic propagation is fi