@article {20322,
	title = {Hydroclimatic sustainability assessment of changing climate on cholera in the Ganges-Brahmaputra basin},
	journal = {Advances in Water Resources},
	volume = {108},
	year = {2017},
	month = {Jan-10-2017},
	pages = {332 - 344},
	abstract = {The association of cholera and climate has been extensively documented. However, determining the effects of changing climate on the occurrence of disease remains a challenge. Bimodal peaks of cholera in Bengal Delta are hypothesized to be linked to asymmetric flow of the Ganges and Brahmaputra rivers. Spring cholera is related to intrusion of bacteria-laden coastal seawater during low flow seasons, while autumn cholera results from cross-contamination of water resources when high flows in the rivers cause massive inundation. Coarse resolution of General Circulation Model (GCM) output (usually at 100 {\textendash} 300 km)cannot be used to evaluate variability at the local scale(10{\textendash}20 km),hence the goal of this study was to develop a framework that could be used to understand impacts of climate change on occurrence of cholera. Instead of a traditional approach of downscaling precipitation, streamflow of the two rivers was directly linked to GCM outputs, achieving reasonable accuracy (R2 = 0.89 for the Ganges and R2 = 0.91 for the Brahmaputra)using machine learning algorithms (Support Vector Regression-Particle Swarm Optimization). Copula methods were used to determine probabilistic risks of cholera under several discharge conditions. Key results, using model outputs from ECHAM5, GFDL, andHadCM3for A1B and A2 scenarios, suggest that the combined low flow of the two rivers may increase in the future, with high flows increasing for first half of this century, decreasing thereafter. Spring and autumn cholera, assuming societal conditions remain constant e.g., at the current rate, may decrease. However significant shifts were noted in the magnitude of river discharge suggesting that cholera dynamics of the delta may well demonstrate an uncertain predictable pattern of occurrence over the next century.},
	issn = {03091708},
	doi = {10.1016/j.advwatres.2016.11.018},
	url = {https://linkinghub.elsevier.com/retrieve/pii/S030917081630728X},
	author = {Nasr-Azadani, Fariborz and Khan, Rakibul and Rahimikollu, Javad and Unnikrishnan, Avinash and Akanda, Ali and Alam, Munirul and Huq, Anwar and Jutla, Antarpreet and Rita R Colwell}
}
@article {20343,
	title = {Downscaling river discharge to assess the effects of climate change on cholera outbreaks in the Bengal Delta},
	journal = {Climate Research},
	volume = {64},
	year = {2015},
	month = {Jul-08-2017},
	pages = {257 - 274},
	abstract = {Endemic cholera in the Bengal Delta region of South Asia has been associated with asymmetric and episodic variability of river discharge. Spring cholera was found to be related to intrusion of bacteria-laden coastal seawater during low flow seasons. Autumn cholera was hypothesized to result from cross-contamination of water resources when high river discharge causes massive inland inundation. The effect of climate change on diarrheal diseases has not been explored, because of the difficulties in establishing linkages between coarse-resolution global climate model outputs with localized disease outbreaks. Since rivers act as corridors for transport of cholera bacteria, the first step is to understand the discharge variability that may occur with climate change and whether it is linked to cholera. Here, we present a framework for downscaling precipitation from global climate models for river discharge in the Ganges-Brahmaputra-Meghna basin. Using a data-mining method that includes particle swarm optimization-based support vector regression, precipitation was downscaled for a statistical multiple regressive model to estimate river discharge in the basin. Key results from an ensemble of HadCM3, GFDL, and ECHAM5 models indicated 8 and 7.5\% increase in flows for the IPCC A1B and A2 scenarios, respectively. The majority of the changes are attributable to increases in flows from February through August for both scenarios, with little to no change in seasonality of high and low flows during the next century. The probability of spring and autumn cholera is likely to increase steadily in the endemic region of the Bengal Delta. },
	issn = {0936-577X},
	doi = {10.3354/cr01310},
	url = {http://www.int-res.com/abstracts/cr/v64/n3/p257-274/},
	author = {Nasr-Azadani, F and Unnikrishnan, A and Akanda, A and Islam, S and Alam, M and Huq, A and Jutla, A and Rita R Colwell}
}
@article {20339,
	title = {Predictive Time Series Analysis Linking Bengal Cholera with Terrestrial Water Storage Measured from Gravity Recovery and Climate Experiment Sensors},
	journal = {The American Journal of Tropical Medicine and Hygiene},
	volume = {93},
	year = {2015},
	month = {Sep-12-2015},
	pages = {1179 - 1186},
	abstract = {Outbreaks of diarrheal diseases, including cholera, are related to floods and droughts in regions where water and sanitation infrastructure are inadequate or insufficient. However, availability of data on water scarcity and abundance in transnational basins, are a prerequisite for developing cholera forecasting systems. With more than a decade of terrestrial water storage (TWS) data from the Gravity Recovery and Climate Experiment, conditions favorable for predicting cholera occurrence may now be determined. We explored lead{\textendash}lag relationships between TWS in the Ganges{\textendash}Brahmaputra{\textendash}Meghna basin and endemic cholera in Bangladesh. Since bimodal seasonal peaks in cholera in Bangladesh occur during spring and autumn seasons, two separate logistical models between TWS and disease time series (2002{\textendash}2010) were developed. TWS representing water availability showed an asymmetrical, strong association with cholera prevalence in the spring (τ = -0.53; P < 0.001) and autumn (τ = 0.45; P < 0.001) up to 6 months in advance. One unit (centimeter of water) decrease in water availability in the basin increased odds of above normal cholera by 24\% (confidence interval [CI] = 20{\textendash}31\%; P < 0.05) in the spring, while an increase in regional water by 1 unit, through floods, increased odds of above average cholera in the autumn by 29\% (CI = 22{\textendash}33\%; P < 0.05).},
	issn = {0002-9637},
	doi = {10.4269/ajtmh.14-0648},
	url = {http://www.ajtmh.org/content/journals/10.4269/ajtmh.14-0648},
	author = {Rita R Colwell and Unnikrishnan, Avinash and Jutla, Antarpreet and Huq, Anwar and Akanda, Ali}
}
@article {20340,
	title = {A unified initiative to harness Earth{\textquoteright}s microbiomes},
	journal = {Science},
	year = {2015},
	month = {Jun-10-2017},
	pages = {507 - 508},
	issn = {0036-8075},
	doi = {10.1126/science.aac8480},
	url = {http://www.sciencemag.org/cgi/doi/10.1126/science.aac8480},
	author = {Alivisatos, A. P. and Blaser, M. J. and Brodie, E. L. and Chun, M. and Dangl, J. L. and Donohue, T. J. and Dorrestein, P. C. and Gilbert, J. A. and Green, J. L. and Jansson, J. K. and Knight, R. and Maxon, M. E. and McFall-Ngai, M. J. and Miller, J. F. and Pollard, K. S. and Ruby, E. G. and Taha, S. A. and Rita R Colwell}
}
@article {20346,
	title = {Use of Environmental Parameters to Model Pathogenic <i>Vibrios</i> in Chesapeake Bay},
	journal = {Journal of Environmental Informatics},
	year = {2015},
	month = {Jan-01-2015},
	abstract = {Although the transportation sector is a major contributor to urban air pollution and global climate change due to its substantial energy consumptions, previous studies for evacuation practices in this sector seldom took environmental consequences into account. As an attempt in event-related evacuation planning under uncertainty, this study proposed an emission-mitigation-oriented fuzzy evacuation management (emoFEM) model. Comprehensive considerations over system efficiency, environmental protection, economic cost and resource availability were incorporated within a general modeling formulation to facilitate evacuation management in a systematic and compromise manner. Vague and ambiguous information embedded within evacuation problems could be quantified and directly communicated into the optimization process, greatly improving conventional tools for evacuation management under uncertainty. The proposed emoFEM model was then applied to a hypothetic but representative case. Useful solutions were generated, which could help identify timely, safe and cost-effective evacuation schemes without significant disturbances over normal municipal traffic and environmental quality. The advantages of emoFEM were further revealed through comparing its solutions with those from its deterministic counterpart.
},
	issn = {17262135},
	doi = {10.3808/jei.201500307},
	url = {http://www.iseis.org/jei/abstract.asp?no=201500307},
	author = {Zaitchik, B. F. and Guikema, S. D. and Haley, B. J. and Taviani, E. and Chen, A. and Brown, M.E. and Huq, A. and Rita R Colwell}
}
@article {17748,
	title = {Annotated RDF},
	journal = {ACM Trans. Comput. Logic},
	volume = {11},
	year = {2010},
	month = {2010/01//},
	pages = {10:1{\textendash}10:41 - 10:1{\textendash}10:41},
	abstract = {Real-world use of RDF requires the ability to transparently represent and explain metadata associated with RDF triples. For example, when RDF triples are extracted automatically by information extraction programs, there is a need to represent where the triples came from, what their temporal validity is, and how certain we are that the triple is correct. Today, there is no theoretically clean and practically scalable mechanism that spans these different needs - reification is the only solution propose to date, and its implementations have been ugly. In this paper, we present Annotated RDF (or aRDF for short) in which RDF triples are annotated by members of a partially ordered set (with bottom element) that can be selected in any way desired by the user. We present a formal declarative semantics (model theory) for annotated RDF and develop algorithms to check consistency of aRDF theories and to answer queries to aRDF theories. We show that annotated RDF supports users who need to think about the uncertainty, temporal aspects, and provenance of the RDF triples in an RDF database. We develop a prototype aRDF implementation and show that our algorithms work efficiently even on real world data sets containing over 10 million triples.},
	keywords = {annotated RDF, Query processing, view maintenance},
	isbn = {1529-3785},
	doi = {10.1145/1656242.1656245},
	url = {http://doi.acm.org/10.1145/1656242.1656245},
	author = {Udrea,Octavian and Recupero,Diego Reforgiato and V.S. Subrahmanian}
}
@article {12466,
	title = {PADS: A Probabilistic Activity Detection Framework for Video Data},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {32},
	year = {2010},
	month = {2010/12//},
	pages = {2246 - 2261},
	abstract = {There is now a growing need to identify various kinds of activities that occur in videos. In this paper, we first present a logical language called Probabilistic Activity Description Language (PADL) in which users can specify activities of interest. We then develop a probabilistic framework which assigns to any subvideo of a given video sequence a probability that the subvideo contains the given activity, and we finally develop two fast algorithms to detect activities within this framework. OffPad finds all minimal segments of a video that contain a given activity with a probability exceeding a given threshold. In contrast, the OnPad algorithm examines a video during playout (rather than afterwards as OffPad does) and computes the probability that a given activity is occurring (even if the activity is only partially complete). Our prototype Probabilistic Activity Detection System (PADS) implements the framework and the two algorithms, building on top of existing image processing algorithms. We have conducted detailed experiments and compared our approach to four different approaches presented in the literature. We show that-for complex activity definitions-our approach outperforms all the other approaches.},
	keywords = {Automated;Programming Languages;Video Recording;, Computer-Assisted;Models, PADL;PADS;image processing algorithms;offPad algorithm;onPad algorithm;probabilistic activity description language;probabilistic activity detection framework;video data;video sequence;image sequences;object detection;probability;video surveillance;Algorit, Statistical;Movement;Pattern Recognition},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2010.33},
	author = {Albanese, M. and Chellapa, Rama and Cuntoor, N. and Moscato, V. and Picariello, A. and V.S. Subrahmanian and Udrea,O.}
}
@inbook {12235,
	title = {Triangle Inequality and Routing Policy Violations in the Internet},
	booktitle = {Passive and Active Network MeasurementPassive and Active Network Measurement},
	series = {Lecture Notes in Computer Science},
	volume = {5448},
	year = {2009},
	month = {2009///},
	pages = {45 - 54},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Triangle inequality violations (TIVs) are the effect of packets between two nodes being routed on the longer direct path between them when a shorter detour path through an intermediary is available. TIVs are a natural, widespread and persistent consequence of Internet routing policies. By exposing opportunities to improve the delay between two nodes, TIVs can help myriad applications that seek to minimize end-to-end latency. However, sending traffic along the detour paths revealed by TIVs may influence Internet routing negatively. In this paper we study the interaction between triangle inequality violations and policy routing in the Internet. We use measured and predicted AS paths between Internet nodes to show that 25\% of the detour paths exposed by TIVs are in fact available to BGP but are simply deemed {\textquotedblleft}less efficient{\textquotedblright}. We also compare the AS paths of detours and direct paths and find that detours use AS edges that are rarely followed by default Internet paths, while avoiding others that BGP seems to prefer. Our study is important both for understanding the various interactions that occur at the routing layer as well as their effects on applications that seek to use TIVs to minimize latency.},
	keywords = {Computer, Science},
	isbn = {978-3-642-00974-7},
	url = {http://dx.doi.org/10.1007/978-3-642-00975-4_5},
	author = {Lumezanu,Cristian and Baden,Randy and Spring, Neil and Bhattacharjee, Bobby},
	editor = {Moon,Sue and Teixeira,Renata and Uhlig,Steve}
}
@article {12549,
	title = {A Constrained Probabilistic Petri Net Framework for Human Activity Detection in Video},
	journal = {Multimedia, IEEE Transactions on},
	volume = {10},
	year = {2008},
	month = {2008/10//},
	pages = {982 - 996},
	abstract = {Recognition of human activities in restricted settings such as airports, parking lots and banks is of significant interest in security and automated surveillance systems. In such settings, data is usually in the form of surveillance videos with wide variation in quality and granularity. Interpretation and identification of human activities requires an activity model that a) is rich enough to handle complex multi-agent interactions, b) is robust to uncertainty in low-level processing and c) can handle ambiguities in the unfolding of activities. We present a computational framework for human activity representation based on Petri nets. We propose an extension-Probabilistic Petri Nets (PPN)-and show how this model is well suited to address each of the above requirements in a wide variety of settings. We then focus on answering two types of questions: (i) what are the minimal sub-videos in which a given activity is identified with a probability above a certain threshold and (ii) for a given video, which activity from a given set occurred with the highest probability? We provide the PPN-MPS algorithm for the first problem, as well as two different algorithms (naive PPN-MPA and PPN-MPA) to solve the second. Our experimental results on a dataset consisting of bank surveillance videos and an unconstrained TSA tarmac surveillance dataset show that our algorithms are both fast and provide high quality results.},
	keywords = {activity, dataset;automated, detection;human, interactions;security, net;human, nets;image, Petri, probabilistic, processing;multiagent, processing;video, representation;low-level, representation;video, signal, Surveillance, surveillance;, systems;constrained, systems;surveillance, tarmac, TSA, videos;Petri},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2008.2001369},
	author = {Albanese, M. and Chellapa, Rama and Moscato, V. and Picariello, A. and V.S. Subrahmanian and Turaga,P. and Udrea,O.}
}
@article {12542,
	title = {Machine Recognition of Human Activities: A Survey},
	journal = {Circuits and Systems for Video Technology, IEEE Transactions on},
	volume = {18},
	year = {2008},
	month = {2008/11//},
	pages = {1473 - 1488},
	abstract = {The past decade has witnessed a rapid proliferation of video cameras in all walks of life and has resulted in a tremendous explosion of video content. Several applications such as content-based video annotation and retrieval, highlight extraction and video summarization require recognition of the activities occurring in the video. The analysis of human activities in videos is an area with increasingly important consequences from security and surveillance to entertainment and personal archiving. Several challenges at various levels of processing-robustness against errors in low-level processing, view and rate-invariant representations at midlevel processing and semantic representation of human activities at higher level processing-make this problem hard to solve. In this review paper, we present a comprehensive survey of efforts in the past couple of decades to address the problems of representation, recognition, and learning of human activities from video and related applications. We discuss the problem at two major levels of complexity: 1) "actions" and 2) "activities." "Actions" are characterized by simple motion patterns typically executed by a single human. "Activities" are more complex and involve coordinated actions among a small number of humans. We will discuss several approaches and classify them according to their ability to handle varying degrees of complexity as interpreted above. We begin with a discussion of approaches to model the simplest of action classes known as atomic or primitive actions that do not require sophisticated dynamical modeling. Then, methods to model actions with more complex dynamics are discussed. The discussion then leads naturally to methods for higher level representation of complex activities.},
	keywords = {activity;low-level, annotation;human, cameras;video, content-based, factors;image, processing;machine, processing;rate-invariant, recognition;image, recognition;midlevel, representation;image, representation;video, representations;semantic, retrieval;human, sequences;, summarization;content-based, video},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2008.2005594},
	author = {Turaga,P. and Chellapa, Rama and V.S. Subrahmanian and Udrea,O.}
}
@article {14291,
	title = {Rule-based static analysis of network protocol implementations},
	journal = {Information and Computation},
	volume = {206},
	year = {2008},
	month = {2008///},
	pages = {130 - 157},
	author = {Udrea,O. and Lumezanu,C. and Foster, Jeffrey S.}
}
@conference {17761,
	title = {Scaling RDF with Time},
	booktitle = {Proceedings of the 17th international conference on World Wide Web},
	series = {WWW {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {605 - 614},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {The World Wide Web Consortium{\textquoteright}s RDF standard primarily consists of (subject, property, object) triples that specify the value that a given subject has for a given property. However, it is frequently the case that even for a fixed subject and property, the value varies with time. As a consequence, efforts have been made to annotate RDF triples with "valid time" intervals. However, to date, no proposals exist for efficient indexing of such temporal RDF databases. It is clearly beneficial to store RDF data in a relational DB - however, standard relational indexes are inadequately equipped to handle RDF{\textquoteright}s graph structure. In this paper, we propose the tGRIN index structure that builds a specialized index for temporal RDF that is physically stored in an RDBMS. Past efforts to store RDF in relational stores include Jena2 from HP, Sesame from OpenRDF.org, and 3store from the University of Southampton. We show that even when these efforts are augmented with well known temporal indexes like R+ trees, SR-trees, ST-index, and MAP21, the tGRIN index exhibits superior performance. In terms of index build time, tGRIN takes two thirds or less of the time used by any other system, and it uses a comparable amount of memory and less disk space than Jena, Sesame and 3store. More importantly, tGRIN can answer queries three to six times faster for average query graph patterns and five to ten times faster for complex queries than these systems.},
	keywords = {RDF indexing, resource description framework, temporal RDF},
	isbn = {978-1-60558-085-2},
	doi = {10.1145/1367497.1367579},
	url = {http://doi.acm.org/10.1145/1367497.1367579},
	author = {Pugliese,Andrea and Udrea,Octavian and V.S. Subrahmanian}
}
@inbook {16072,
	title = {Visualizing Functional Data with an Application to eBay{\textquoteright}s Online Auctions},
	booktitle = {Handbook of Data VisualizationHandbook of Data Visualization},
	series = {Springer Handbooks of Computational Statistics},
	year = {2008},
	month = {2008///},
	pages = {873 - 898},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {Technological advances in the measurement, collection, and storage of data have led tomore andmore complex data structures. Examples of such structures include measurements of the behavior of individuals over time, digitized two- or three-dimensional images of the brain, and recordings of three- or even four-dimensional movements of objects traveling through space and time. Such data, although recorded in a discrete fashion, are usually thought of as continuous objects that are represented by functional relationships. This gave rise to functional data analysis (FDA), which was made popular by the monographs of Ramsay and Silverman (1997, 2002), where the center of interest is a set of curves, shapes, objects, or, more generally, a set of functional observations , in contrast to classical statistics where interest centers on a set of data vectors. In that sense, functional data is not only different from the data structure studied in classical statistics, but it actually generalizes it. Many of these new data structures require new statistical methods to unveil the information that they carry.},
	isbn = {978-3-540-33037-0},
	url = {http://dx.doi.org/10.1007/978-3-540-33037-0_34},
	author = {Chen,Chun-houh and H{\"a}rdle,Wolfgang and Unwin,Antony and Jank,Wolfgang and Shmueli,Galit and Plaisant, Catherine and Shneiderman, Ben}
}
@inbook {17770,
	title = {Aggregates in Generalized Temporally Indeterminate Databases},
	booktitle = {Scalable Uncertainty ManagementScalable Uncertainty Management},
	series = {Lecture Notes in Computer Science},
	volume = {4772},
	year = {2007},
	month = {2007///},
	pages = {171 - 186},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Dyreson and Snodgrass as well as Dekhtyar et. al. have provided a probabilistic model (as well as compelling example applications) for why there may be temporal indeterminacy in databases. In this paper, we first propose a formal model for aggregate computation in such databases when there is uncertainty not just in the temporal attribute, but also in the ordinary (non-temporal) attributes. We identify two types of aggregates: event correlated aggregates, and non event correlated aggregations, and provide efficient algorithms for both of them. We prove that our algorithms are correct, and we present experimental results showing that the algorithms work well in practice.},
	keywords = {Computer, Science},
	isbn = {978-3-540-75407-7},
	url = {http://dx.doi.org/10.1007/978-3-540-75410-7_13},
	author = {Udrea,Octavian and Majki{\'c},Zoran and Subrahmanian,V.},
	editor = {Prade,Henri and Subrahmanian,V.}
}
@article {18897,
	title = {CARA: A Cultural-Reasoning Architecture},
	journal = {IEEE Intelligent Systems},
	volume = {22},
	year = {2007},
	month = {2007///},
	pages = {12 - 16},
	abstract = {The Cognitive Architecture for Reasoning about Adversaries supports methods to gather data about different cultural groups and learn the intensity of those groups{\textquoteright} opinions on various topics. It also lets users build and extract models of those groups{\textquoteright} behavior and continuously refine those models through shared multiperson learning experiences. Researchers have applied the architecture to develop cultural-reasoning applications for example, a game that teaches soldiers about cultural norms in an Afghan village.},
	keywords = {cultural reasoning, opinion extraction, opponent modeling},
	isbn = {1541-1672},
	author = {V.S. Subrahmanian and Albanese,Massimiliano and Martinez,Mar?a Vanina and Nau, Dana S. and Reforgiato,Diego and Simari,Gerardo I. and Sliva,Amy and Udrea,Octavian and Wilkenfeld,Jonathan}
}
@article {14500,
	title = {Combining statistical and logical inference for ontology alignment},
	journal = {Workshop on Semantic Web for Collaborative Knowledge Acquisition at the International Joint Conference on Artificial Intelligence},
	year = {2007},
	month = {2007///},
	abstract = {In recent years, ontologies have proved a veryattractive medium for storing domain knowl-
edge in a variety of organizations; a few ex-
ample domains are medicine1 and genetics2.
The rapid evolution of representation stan-
dards has led to the creation of distinct on-
tology bases in overlapping domains, making
it paramount for large systems to reconcile on-
tological data from multiple sources. A large
body of work on ontology integration[Euzenat,
2004] has produced algorithms and heuristics
that have proven successful in alleviating the
high computation costs of the process. How-
ever, the effective use of ontology formalisms
{\textendash} such as rules and axioms {\textendash} in the integra-
tion process remains an open question. In this
paper, we present a novel ontology integration
method that takes advantage of the logical in-
ference capabilities in OWL Lite to improve the
recall of the merged ontologies. Our CPI (Clus-
tering with Partial Inference) algorithm uses
(i) graph clustering techniques to improve the
process of selecting candidate matching enti-
ties and (ii) a limited, adaptive reasoning pro-
cess to account for the effects of introducing
relationships between such entities. Our initial
experiments, performed on a set of 30 pairs of
publicly available ontologies, show that CPI of-
fers a 30\% improvement in recall and a 25\% im-
provement in answer quality compared to FCA-
merge [Stumme and Maedche, 2001].
},
	author = {Udrea,O. and Getoor, Lise}
}
@conference {17782,
	title = {Detecting stochastically scheduled activities in video},
	booktitle = {International Joint Conference on Artificial Intelligence},
	year = {2007},
	month = {2007///},
	pages = {1802 - 1807},
	abstract = {The ability to automatically detect activities invideo is of increasing importance in applications
such as bank security, airport tarmac security, bag-
gage area security and building site surveillance.
We present a stochastic activity model composed
of atomic actions which are directly observable
through image understanding primitives. We focus
on answering two types of questions: (i) what are
the minimal sub-videos in which a given action is
identified with probability above a certain thresh-
old and (ii) for a given video, can we decide which
activity from a given set most likely occurred? We
provide the MPS algorithm for the first problem,
as well as two different algorithms (naiveMPA and
MPA) to solve the second. Our experimental re-
sults on a dataset consisting of staged bank robbery
videos (described in [Vu et al., 2003]) show that
our algorithms are both fast and provide high qual-
ity results when compared to human reviewers.
},
	author = {Albanese, M. and Moscato, V. and Picariello, A. and V.S. Subrahmanian and Udrea,O.}
}
@article {16257,
	title = {Draft Genome of the Filarial Nematode Parasite Brugia Malayi},
	journal = {Science},
	volume = {317},
	year = {2007},
	month = {2007/09/21/},
	pages = {1756 - 1760},
	abstract = {Parasitic nematodes that cause elephantiasis and river blindness threaten hundreds of millions of people in the developing world. We have sequenced the \~{}90 megabase (Mb) genome of the human filarial parasite Brugia malayi and predict \~{}11,500 protein coding genes in 71 Mb of robustly assembled sequence. Comparative analysis with the free-living, model nematode Caenorhabditis elegans revealed that, despite these genes having maintained little conservation of local synteny during \~{}350 million years of evolution, they largely remain in linkage on chromosomal units. More than 100 conserved operons were identified. Analysis of the predicted proteome provides evidence for adaptations of B. malayi to niches in its human and vector hosts and insights into the molecular basis of a mutualistic relationship with its Wolbachia endosymbiont. These findings offer a foundation for rational drug design.},
	isbn = {0036-8075, 1095-9203},
	doi = {10.1126/science.1145406},
	url = {http://www.sciencemag.org/content/317/5845/1756},
	author = {Ghedin,Elodie and Wang,Shiliang and Spiro,David and Caler,Elisabet and Zhao,Qi and Crabtree,Jonathan and Allen,Jonathan E and Delcher,Arthur L. and Guiliano,David B and Miranda-Saavedra,Diego and Angiuoli,Samuel V and Creasy,Todd and Amedeo,Paolo and Haas,Brian and El-Sayed, Najib M. and Wortman,Jennifer R. and Feldblyum,Tamara and Tallon,Luke and Schatz,Michael and Shumway,Martin and Koo,Hean and Salzberg,Steven L. and Schobel,Seth and Pertea,Mihaela and Pop, Mihai and White,Owen and Barton,Geoffrey J and Carlow,Clotilde K. S and Crawford,Michael J and Daub,Jennifer and Dimmic,Matthew W and Estes,Chris F and Foster,Jeremy M and Ganatra,Mehul and Gregory,William F and Johnson,Nicholas M and Jin,Jinming and Komuniecki,Richard and Korf,Ian and Kumar,Sanjay and Laney,Sandra and Li,Ben-Wen and Li,Wen and Lindblom,Tim H and Lustigman,Sara and Ma,Dong and Maina,Claude V and Martin,David M. A and McCarter,James P and McReynolds,Larry and Mitreva,Makedonka and Nutman,Thomas B and Parkinson,John and Peregr{\'\i}n-Alvarez,Jos{\'e} M and Poole,Catherine and Ren,Qinghu and Saunders,Lori and Sluder,Ann E and Smith,Katherine and Stanke,Mario and Unnasch,Thomas R and Ware,Jenna and Wei,Aguan D and Weil,Gary and Williams,Deryck J and Zhang,Yinhua and Williams,Steven A and Fraser-Liggett,Claire and Slatko,Barton and Blaxter,Mark L and Scott,Alan L}
}
@conference {17771,
	title = {GRIN: A graph based RDF index},
	booktitle = {Proceedings of the National Conference on Artificial Intelligence},
	volume = {22},
	year = {2007},
	month = {2007///},
	pages = {1465 - 1465},
	abstract = {RDF ({\textquotedblleft}Resource Description Framework{\textquotedblright}) is now a widelyused World Wide Web Consortium standard. However,
methods to index large volumes of RDF data are still in
their infancy. In this paper, we focus on providing a very
lightweight indexing mechanism for certain kinds of RDF
queries, namely graph-based queries where there is a need to
traverse edges in the graph determined by an RDF database.
Our approach uses the idea of drawing circles around selected
{\textquotedblleft}center{\textquotedblright} vertices in the graph where the circle would encom-
pass those vertices in the graph that are within a given dis-
tance of the {\textquotedblleft}center{\textquotedblright} vertex. We come up with methods of
finding such {\textquotedblleft}center{\textquotedblright} vertices and identifying the radius of the
circles and then leverage this to build an index called GRIN.
We compare GRIN with three existing RDF indexex: Jena,
Sesame, and RDFBroker. We compared (i) the time to an-
swer graph based queries, (ii) memory needed to store the
index, and (iii) the time to build the index. GRIN outper-
forms Jena, Sesame and RDFBroker on all three measures
for graph based queries (for other types of queries, it may be
worth building one of these other indexes and using it), at the
expense of using a larger amount of memory when answering
queries.
},
	author = {Udrea,O. and Pugliese, A. and V.S. Subrahmanian}
}
@conference {14453,
	title = {Leveraging data and structure in ontology integration},
	booktitle = {Proceedings of the 2007 ACM SIGMOD international conference on Management of data},
	series = {SIGMOD {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {449 - 460},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {There is a great deal of research on ontology integration which makes use of rich logical constraints to reason about the structural and logical alignment of ontologies. There is also considerable work on matching data instances from heterogeneous schema or ontologies. However, little work exploits the fact that ontologies include both data and structure. We aim to close this gap by presenting a new algorithm (ILIADS) that tightly integrates both data matching and logical reasoning to achieve better matching of ontologies. We evaluate our algorithm on a set of 30 pairs of OWL Lite ontologies with the schema and data matchings found by human reviewers. We compare against two systems - the ontology matching tool FCA-merge [28] and the schema matching tool COMA++ [1]. ILIADS shows an average improvement of 25\% in quality over FCA-merge and a 11\% improvement in recall over COMA++.},
	keywords = {Data integration, logical inference, ontology alignment, schema mapping, statistical inference},
	isbn = {978-1-59593-686-8},
	doi = {10.1145/1247480.1247531},
	url = {http://doi.acm.org/10.1145/1247480.1247531},
	author = {Udrea,Octavian and Getoor, Lise and Miller,Ren{\'e}e J.}
}
@conference {17769,
	title = {MAGIC: A Multi-Activity Graph Index for Activity Detection},
	booktitle = {Information Reuse and Integration, 2007. IRI 2007. IEEE International Conference on},
	year = {2007},
	month = {2007/08//},
	pages = {267 - 272},
	abstract = {Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O{\textquoteright}), where a epsi A and O{\textquoteright} sube O, that minimally validate the fact that an instance of activity a occurs in O with probability p or more. The novel contribution of this paper is the notion of the multi-activity graph index (MAGIC), which can index very large numbers of observations from interleaved activities and quickly retrieve completed instances of the monitored activities. We introduce two complexity reducing restrictions of the problem (which takes exponential time) and develop algorithms for each. We experimentally evaluate our exponential algorithm as well as the restricted algorithms on both synthetic data and a real (depersonalized) travel data set consisting of 5.5 million observations. Our experiments show that MAGIC consumes reasonable amounts of memory and can retrieve completed instances of activities in just a few seconds. We also report appropriate statistical significance results validating our experimental hypotheses.},
	keywords = {complexity;graph, detection;complexity, graph, index;probability, MAGIC;activity, reducing, restrictions;exponential, theory;probability;, threshold;computational, time;multiactivity},
	doi = {10.1109/IRI.2007.4296632},
	author = {Albanese, M. and Pugliese, A. and V.S. Subrahmanian and Udrea,O.}
}
@article {14586,
	title = {MetaProm: a neural network based meta-predictor for alternative human promoter prediction},
	journal = {BMC Genomics},
	volume = {8},
	year = {2007},
	month = {2007///},
	pages = {374 - 374},
	abstract = {BACKGROUND:De novo eukaryotic promoter prediction is important for discovering novel genes and understanding gene regulation. In spite of the great advances made in the past decade, recent studies revealed that the overall performances of the current promoter prediction programs (PPPs) are still poor, and predictions made by individual PPPs do not overlap each other. Furthermore, most PPPs are trained and tested on the most-upstream promoters; their performances on alternative promoters have not been assessed.RESULTS:In this paper, we evaluate the performances of current major promoter prediction programs (i.e., PSPA, FirstEF, McPromoter, DragonGSF, DragonPF, and FProm) using 42,536 distinct human gene promoters on a genome-wide scale, and with emphasis on alternative promoters. We describe an artificial neural network (ANN) based meta-predictor program that integrates predictions from the current PPPs and the predicted promoters{\textquoteright} relation to CpG islands. Our specific analysis of recently discovered alternative promoters reveals that although only 41\% of the 3{\textquoteright} most promoters overlap a CpG island, 74\% of 5{\textquoteright} most promoters overlap a CpG island.CONCLUSION:Our assessment of six PPPs on 1.06 x 109 bps of human genome sequence reveals the specific strengths and weaknesses of individual PPPs. Our meta-predictor outperforms any individual PPP in sensitivity and specificity. Furthermore, we discovered that the 5{\textquoteright} alternative promoters are more likely to be associated with a CpG island.},
	isbn = {1471-2164},
	doi = {10.1186/1471-2164-8-374},
	url = {http://www.biomedcentral.com/1471-2164/8/374},
	author = {Wang,Junwen and Ungar,Lyle and Tseng,Hung and Hannenhalli, Sridhar}
}
@article {17784,
	title = {Annotated rdf},
	journal = {The Semantic Web: Research and Applications},
	volume = {4011},
	year = {2006},
	month = {2006///},
	pages = {487 - 501},
	abstract = {There are numerous extensions of RDF that support temporal reasoning, reasoning about pedigree, reasoning about uncertainty, and so on. In this paper, we present Annotated RDF (or aRDF for short) in which RDF triples are annotated by members of a partially ordered set (with bottom element) that can be selected in any way desired by the user. We present a formal declarative semantics (model theory) for annotated RDF and develop algorithms to check consistency of aRDF theories and to answer queries to aRDF theories. We show that annotated RDF captures versions of all the forms of reasoning mentioned above within a single unified framework. We develop a prototype aRDF implementation and show that our algorithms work very fast indeed {\textendash} in fact, in just a matter of seconds for theories with over 100,000 nodes.},
	doi = {10.1007/11762256_36},
	author = {Udrea,O. and Recupero,D. and V.S. Subrahmanian}
}
@conference {15543,
	title = {Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data},
	booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on},
	volume = {5},
	year = {2006},
	month = {2006/05//},
	pages = {V - V},
	abstract = {The future of remote sensing will see the development of spacecraft formations, and with this development will come a number of complex challenges such as maintaining precise relative position and specified attitudes. At the same time, there will be increasing needs to understand planetary system processes and build accurate prediction models. One essential technology to accomplish these goals is the integration of multiple source data. For this integration, image registration and fusion represent the first steps and need to be performed with very high accuracy. In this paper, we describe studies performed in both image registration and fusion, including a modular framework that was built to describe registration algorithms, a Web-based image registration toolbox, and the comparison of several image fusion techniques using data from the EO-1/ALI and Hyperion sensors},
	keywords = {ALI, EO-1, fusion studies, geophysical signal processing, Hyperion sensors, image registration, Internet, multiple remote sensing data, multiple source data, Remote sensing, Web-based image registration toolbox},
	doi = {10.1109/ICASSP.2006.1661494},
	author = {Le Moigne,J. and Cole-Rhodes,A. and Eastman,R. and Jain,P. and Joshua,A. and Memarsadeghi,N. and Mount, Dave and Netanyahu,N. and Morisette,J. and Uko-Ozoro,E.}
}
@inbook {17620,
	title = {Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems},
	booktitle = {Algorithms and ComputationAlgorithms and Computation},
	series = {Lecture Notes in Computer Science},
	volume = {4288},
	year = {2006},
	month = {2006///},
	pages = {628 - 637},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {A sub-area of discrepancy theory that has received much attention in computer science re-cently, is that of explicit constructions of low-discrepancy point sets for various types of rectangle
families in high dimension. This research has led to interesting applications in error-control cod-
ing, distributed protocols, Web document filtering, derandomization, and other areas. We give
a short survey of this area here.
},
	isbn = {978-3-540-49694-6},
	url = {http://dx.doi.org/10.1007/11940128_63},
	author = {Ambainis,Andris and Gasarch,William and Srinivasan, Aravind and Utis,Andrey},
	editor = {Asano,Tetsuo}
}
@article {17295,
	title = {Methods for the electronic annotation, retrieval, and use of electronic images},
	volume = {09/976,362},
	year = {2006},
	month = {2006/03/07/},
	abstract = {The present invention provides software for electronically annotating electronic images, such as drawings, photographs, video, etc., through the drag-and-drop of annotations from a pre-defined, but extendable, list. The annotations are placed at a user-selected X, Y location on the image, and stored in a searchable database. Thus, they can be searched in order to retrieve, organize, group, or display desired electronic images or collections of such images. The annotations may be text, images, sounds, etc. The invention provides a flexible, easy to learn, rapid, low error rate and satisfying interface for accomplishing such tasks.},
	url = {http://www.google.com/patents?id=iBt4AAAAEBAJ},
	author = {Shneiderman, Ben},
	editor = {University of Maryland, College Park}
}
@article {14631,
	title = {Patterns of sequence conservation in presynaptic neural genes},
	journal = {Genome Biology},
	volume = {7},
	year = {2006},
	month = {2006/11/10/},
	pages = {R105 - R105},
	abstract = {The neuronal synapse is a fundamental functional unit in the central nervous system of animals. Because synaptic function is evolutionarily conserved, we reasoned that functional sequences of genes and related genomic elements known to play important roles in neurotransmitter release would also be conserved.},
	isbn = {1465-6906},
	doi = {10.1186/gb-2006-7-11-r105},
	url = {http://genomebiology.com/2006/7/11/R105},
	author = {Hadley,Dexter and Murphy,Tara and Valladares,Otto and Hannenhalli, Sridhar and Ungar,Lyle and Kim,Junhyong and Bu{\'c}an,Maja}
}
@article {17658,
	title = {Session 8A-Combinatorial Optimization and Quantum Computing-Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems},
	journal = {Lecture Notes in Computer Science},
	volume = {4288},
	year = {2006},
	month = {2006///},
	pages = {628 - 637},
	author = {Ambainis,A. and Gasarch,W. and Srinivasan, Aravind and Utis,A.}
}
@conference {16327,
	title = {Towards Dependability in Everyday Software Using Software Telemetry},
	booktitle = {Engineering of Autonomic and Autonomous Systems, IEEE International Workshop on},
	year = {2006},
	month = {2006///},
	pages = {9 - 18},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {Application-level software dependability is difficult to ensure. Thus it?s typically used only in custom systems and is achieved using one-of-a-kind, handcrafted solutions. We are interested in understanding whether and how these techniques can be applied to more common, lower-end systems. To this end, we have adapted a condition-based maintenance (CBM) approach called the Multivariate State Estimation Technique (MSET). This approach automatically creates sophisticated statistical models that predict system failure well before failures occur, leading to simpler and more successful recoveries. We have packaged this approach in the Software Dependability Framework (SDF). The SDF consists of instrumentation and data management libraries, a CBM module, performance visualization tools, and a software architecture that supports system designers. Finally, we evaluated our framework on a simple video game application. Our results suggest that we can cheaply and reliably predict impending runtime failures and respond to them in time to improve the system?s dependability.},
	isbn = {0-7695-2544-X},
	doi = {http://doi.ieeecomputersociety.org/10.1109/EASE.2006.21},
	author = {Gross,Kenny C. and Urmanov,Aleksey and Votta,Lawrence G. and McMaster,Scott and Porter, Adam}
}
@conference {17794,
	title = {A graph theoretical foundation for integrating RDF ontologies},
	booktitle = {PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE},
	volume = {20},
	year = {2005},
	month = {2005///},
	pages = {1442 - 1442},
	abstract = {RDF ontologies are rapidly increasing in number. We studythe problem of integrating two RDF ontologies under a given
set H of Horn clauses that specify semantic relationships be-
tween terms in the ontology, as well as under a given set of
negative constraints. We formally define the notion of a {\textquotedblleft}wit-
ness{\textquotedblright} to the integrability of two RDF ontologies under such
constraints. A witness represents a way of integrating the
ontologies together. We define a {\textquotedblleft}minimal{\textquotedblright} witnesses and
provide the polynomial CROW (Computing RDF Ontology
Witness) algorithm to find a witness. We report on the per-
formance of CROW both on DAML, SchemaWeb and Onto-
Broker ontologies as well as on synthetically generated data.
The experiments show that CROW works very well on real-
life ontologies and scales to massive ontologies.
},
	author = {Udrea,O. and Deng,Y. and Ruckhaus,E. and V.S. Subrahmanian}
}
@inbook {17793,
	title = {Probabilistic Ontologies and Relational Databases},
	booktitle = {On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASEOn the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE},
	series = {Lecture Notes in Computer Science},
	volume = {3760},
	year = {2005},
	month = {2005///},
	pages = {1 - 17},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The relational algebra and calculus do not take the semantics of terms into account when answering queries. As a consequence, not all tuples that should be returned in response to a query are always returned, leading to low recall. In this paper, we propose the novel notion of a constrained probabilistic ontology (CPO). We developed the concept of a CPO-enhanced relation in which each attribute of a relation has an associated CPO. These CPOs describe relationships between terms occurring in the domain of that attribute. We show that the relational algebra can be extended to handle CPO-enhanced relations. This allows queries to yield sets of tuples, each of which has a probability of being correct.},
	keywords = {Computer, Science},
	isbn = {978-3-540-29736-9},
	url = {http://dx.doi.org/10.1007/11575771_1},
	author = {Udrea,Octavian and Yu,Deng and Hung,Edward and Subrahmanian,V.},
	editor = {Meersman,Robert and Tari,Zahir}
}
@article {18016,
	title = {Circuit architecture for reduced-synchrony on-chip interconnect},
	volume = {10/166,008},
	year = {2004},
	month = {2004/07/27/},
	abstract = {The invention relates to an interconnect, and to interconnect architecture, for communicating between processing elements and memory modules in a computer system comprising on-chip parallel computation, in order to reduce the tight synchrony that is required by important components of most present computers.},
	url = {http://www.google.com/patents?id=RRUSAAAAEBAJ},
	author = {Vishkin, Uzi and Nuzman,Joseph F.},
	editor = {University of Maryland, College Park}
}
@inbook {14598,
	title = {Combinatorial Algorithms for Design of DNA Arrays},
	booktitle = {Chip TechnologyChip Technology},
	series = {Advances in Biochemical Engineering/Biotechnology},
	volume = {77},
	year = {2002},
	month = {2002///},
	pages = {1 - 19},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Optimal design of DNA arrays requires the development of algorithms with two-fold goals: reducing the effects caused by unintended illumination ( border length minimization problem ) and reducing the complexity of masks ( mask decomposition problem ). We describe algorithms that reduce the number of rectangles in mask decomposition by 20{\textendash}30\% as compared to a standard array design under the assumption that the arrangement of oligonucleotides on the array is fixed. This algorithm produces provably optimal solution for all studied real instances of array design. We also address the difficult problem of finding an arrangement which minimizes the border length and come up with a new idea of threading that significantly reduces the border length as compared to standard designs.},
	isbn = {978-3-540-43215-9},
	url = {http://dx.doi.org/10.1007/3-540-45713-5_1},
	author = {Hannenhalli, Sridhar and Hubbell,Earl and Lipshutz,Robert and Pevzner,Pavel},
	editor = {Hoheisel,J{\"o}rg and Brazma,A. and B{\"u}ssow,K. and Cantor,C. and Christians,F. and Chui,G. and Diaz,R. and Drmanac,R. and Drmanac,S. and Eickhoff,H. and Fellenberg,K. and Hannenhalli, Sridhar and Hoheisel,J. and Hou,A. and Hubbell,E. and Jin,H. and Jin,P. and Jurinke,C. and Konthur,Z. and K{\"o}ster,H. and Kwon,S. and Lacy,S. and Lehrach,H. and Lipshutz,R. and Little,D. and Lueking,A. and McGall,G. and Moeur,B. and Nordhoff,E. and Nyarsik,L. and Pevzner,P. and Robinson,A. and Sarkans,U. and Shafto,J. and Sohail,M. and Southern,E. and Swanson,D. and Ukrainczyk,T. and van den Boom,D. and Vilo,J. and Vingron,M. and Walter,G. and Xu,C.}
}
@article {16250,
	title = {Comparative Genome Sequencing for Discovery of Novel Polymorphisms in Bacillus Anthracis},
	journal = {Science},
	volume = {296},
	year = {2002},
	month = {2002/06/14/},
	pages = {2028 - 2033},
	abstract = {Comparison of the whole-genome sequence ofBacillus anthracis isolated from a victim of a recent bioterrorist anthrax attack with a reference reveals 60 new markers that include single nucleotide polymorphisms (SNPs), inserted or deleted sequences, and tandem repeats. Genome comparison detected four high-quality SNPs between the two sequenced B. anthracischromosomes and seven differences among different preparations of the reference genome. These markers have been tested on a collection of anthrax isolates and were found to divide these samples into distinct families. These results demonstrate that genome-based analysis of microbial pathogens will provide a powerful new tool for investigation of infectious disease outbreaks.},
	isbn = {0036-8075, 1095-9203},
	doi = {10.1126/science.1071837},
	url = {http://www.sciencemag.org/content/296/5575/2028},
	author = {Read,Timothy D. and Salzberg,Steven L. and Pop, Mihai and Shumway,Martin and Umayam,Lowell and Jiang,Lingxia and Holtzapple,Erik and Busch,Joseph D and Smith,Kimothy L and Schupp,James M and Solomon,Daniel and Keim,Paul and Fraser,Claire M.}
}
@article {11913,
	title = {Rover: scalable location-aware computing},
	journal = {Computer},
	volume = {35},
	year = {2002},
	month = {2002/10//},
	pages = {46 - 53},
	abstract = {All the components necessary for realizing location-aware computing are available in the marketplace today. What has hindered the widespread deployment of location-based systems is the lack of an integration architecture that scales with user populations. The authors have completed the initial implementation of Rover, a system designed to achieve this sort of integration and to automatically tailor information and services to a mobile user{\textquoteright}s location. Their studies have validated Rover{\textquoteright}s underlying software architecture, which achieves system scalability through high-resolution, application-specific resource scheduling at the servers and network. The authors believe that this technology will greatly enhance the user experience in many places, including museums, amusement and theme parks, shopping malls, game fields, offices, and business centers. They designed the system specifically to scale to large user populations and expect its benefits to increase with them.},
	keywords = {amusement, application-specific, architecture;, automation;, business, business;, computing;, data, entertainment;, handheld, humanities;, integration, LAN;, location-aware, malls;, mobile, museums;, office, parks;, processing;, resource, Rover;, scalability;, scalable, scheduling;, shopping, software, system, theme, units;, user;, wireless},
	isbn = {0018-9162},
	doi = {10.1109/MC.2002.1039517},
	author = {Banerjee,S. and Agarwal,S. and Kamel,K. and Kochut, A. and Kommareddy,C. and Nadeem,T. and Thakkar,P. and Trinh,Bao and Youssef,A. and Youssef, M. and Larsen,R.L. and Udaya Shankar,A. and Agrawala, Ashok K.}
}
@article {16536,
	title = {Conditions enabling the emergence of inter-agent signalling in an artificial world},
	journal = {Artificial Life},
	volume = {7},
	year = {2001},
	month = {2001///},
	pages = {3 - 32},
	author = {Reggia, James A. and Schulz,R. and Wilkinson,G. S and Uriagereka,J.}
}
@book {14218,
	title = {Eyes from Eyes: Analysis of Camera Design Using Plenoptic Video Geometry},
	year = {2001},
	month = {2001///},
	publisher = {Computer Vision Laboratory, Center for Automation Research, University of Maryland},
	organization = {Computer Vision Laboratory, Center for Automation Research, University of Maryland},
	abstract = {We investigate the relationship between camera design and the problem of recovering the motion andstructure of a scene from video data. The visual information that could possibly be obtained is described
by the plenoptic function. A camera can be viewed as a device that captures a subset of this function,
that is, it measures some of the light rays in some part of the space. The information contained in the
subset determines how difficult it is to solve subsequent interpretation processes. By examining the
differential structure of the time varying plenoptic function we relate different known and new camera
models to the spatio-temporal structure of the observed scene. This allows us to define a hierarchy
of camera designs, where the order is determined by the stability and complexity of the computations
necessary to estimate structure and motion. At the low end of this hierarchy is the standard planar
pinhole camera for which the structure from motion problem is non-linear and ill-posed. At the high
end is a camera, which we call the full field of view polydioptric camera, for which the problem is linear
and stable. In between are multiple-view cameras with large fields of view which we have built, as well
as catadioptric panoramic sensors and other omni-directional cameras. We develop design suggestions
for the polydioptric camera, and based upon this new design we propose a linear algorithm for ego-
motion estimation, which in essence combines differential motion estimation with differential stereo.
},
	author = {Neumann, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J. and University of Maryland (College Park, Md.). Center for Automation Research}
}
@article {14764,
	title = {Efficient performance prediction for large-scale, data-intensive applications},
	journal = {International Journal of High Performance Computing Applications},
	volume = {14},
	year = {2000},
	month = {2000///},
	pages = {216 - 216},
	author = {Kurc, T. and Uysal, M. and Eom, H. and Hollingsworth, Jeffrey K and Saltz, J. and Sussman, Alan}
}
@article {16651,
	title = {A SIMULATION ENVIRONMENT FOR EVOLVING MULTIAGENT COMMUNICATION},
	volume = {UMIACS-TR-2000-64},
	year = {2000},
	month = {2000/09/15/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {A simulation environment has been created to support study of emergentcommunication.  Multiple agents exist in a two-dimensional world where they 
must find food and avoid predators.  While non-communicating agents may 
survive, the world is configured so that survival and fitness can be enhanced 
through the use of inter-agent communication.  The goal with this version of 
the simulator is to determine conditions under which simple communication 
(signaling) emerges and persists during an evolutionary process.
(Also cross-referenced as UMIACS-TR-2000-64)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu//handle/1903/1101},
	author = {Reggia, James A. and Schultz,Reiner and Uriagereka,Juan and Wilkinson,Jerry}
}
@conference {16455,
	title = {Web Query Optimizer},
	booktitle = {Data Engineering, International Conference on},
	year = {2000},
	month = {2000///},
	pages = {661 - 661},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {We demonstrate a Web Query Optimizer (WQO) within an architecture of mediators and wrappers, for WebSources of limited capability in a wide area environment. The WQO has several innovative features including a CBR (capability based rewriting) Tool, an enhanced randomized relational optimizer extended to a Web environment, and a WebWrapper cost model that can provide relevant metrics for accessing WebSources. The prototype has been tested against a number of WebSources.},
	doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2000.839484},
	author = {Zadorozhny,Vladimir and Bright,Laura and Raschid, Louiqa and Urhan,Tolga and Vidal,Maria Esther}
}
@conference {14747,
	title = {Transparent communication for distributed objects in Java},
	booktitle = {Proceedings of the ACM 1999 conference on Java Grande},
	series = {JAVA {\textquoteright}99},
	year = {1999},
	month = {1999///},
	pages = {160 - 170},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	isbn = {1-58113-161-5},
	doi = {10.1145/304065.304119},
	url = {http://doi.acm.org/10.1145/304065.304119},
	author = {Hicks, Michael W. and Jagannathan,Suresh and Kelsey,Richard and Moore,Jonathan T. and Ungureanu,Cristian}
}
@conference {14796,
	title = {Tuning the performance of I/O-intensive parallel applications},
	booktitle = {Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference},
	year = {1996},
	month = {1996///},
	pages = {15 - 27},
	author = {Acharya, A. and Uysal, M. and Bennett, R. and Mendelson, A. and Beynon, M. and Hollingsworth, Jeffrey K and Saltz, J. and Sussman, Alan}
}
@conference {17490,
	title = {Visual metaphor and the problem of complexity in the design of Web sites: techniques for generating, recognizing and visualizing structure},
	booktitle = {Proceedings of the the seventh ACM conference on Hypertext},
	series = {HYPERTEXT {\textquoteright}96},
	year = {1996},
	month = {1996///},
	pages = {257{\textendash} - 257{\textendash}},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	isbn = {0-89791-778-2},
	doi = {10.1145/234828.234854},
	url = {http://doi.acm.org/10.1145/234828.234854},
	author = {Joyce,Michael and Kolker,Robert and Moulthrop,Stuart and Shneiderman, Ben and Unsworth,John Merritt}
}
@inbook {14632,
	title = {Polynomial-time algorithm for computing translocation distance between genomes},
	booktitle = {Combinatorial Pattern MatchingCombinatorial Pattern Matching},
	series = {Lecture Notes in Computer Science},
	volume = {937},
	year = {1995},
	month = {1995///},
	pages = {162 - 176},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {With the advent of large-scale DNA physical mapping and sequencing, studies of genome rearrangements are becoming increasingly important in evolutionary molecular biology. From a computational perspective, study of evolution based on rearrangements leads to rearrangement distance problem, i.e., computing the minimum number of rearrangement events required to transform one genome into another. Different types of rearrangement events give rise to a spectrum of interesting combinatorial problems. The complexity of most of these problems is unknown. Multichromosomal genomes frequently evolve by a rearrangement event called translocation which exchanges genetic material between different chromosomes. In this paper we study the translocation distance problem, modeling evolution of genomes evolving by translocations. Translocation distance problem was recently studied for the first time by Kececioglu and Ravi, who gave a 2-approximation algorithm for computing translocation distance. In this paper we prove a duality theorem leading to a polynomial algorithm for computing translocation distance for the case when the orientation of the genes are known. This leads to an algorithm generating a most parsimonious (shortest) scenario, transforming one genome into another by translocations.},
	isbn = {978-3-540-60044-2},
	url = {http://dx.doi.org/10.1007/3-540-60044-2_41},
	author = {Hannenhalli, Sridhar},
	editor = {Galil,Zvi and Ukkonen,Esko}
}
@article {13413,
	title = {AAAI 1994 Spring Symposium Series Reports},
	journal = {AI Magazine},
	volume = {15},
	year = {1994},
	month = {1994/09/15/},
	pages = {22 - 22},
	isbn = {0738-4602},
	doi = {10.1609/aimag.v15i3.1101},
	url = {http://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1101},
	author = {Woods,William and Uckun,Sendar and Kohane,Isaac and Bates,Joseph and Hulthage,Ingemar and Gasser,Les and Hanks,Steve and Gini,Maria and Ram,Ashwin and desJardins, Marie and Johnson,Peter and Etzioni,Oren and Coombs,David and Whitehead,Steven}
}
@conference {17884,
	title = {Applying the CHAOS/PARTI library to irregular problems in computational chemistry and computational aerodynamics},
	booktitle = {Scalable Parallel Libraries Conference, 1993., Proceedings of the},
	year = {1993},
	month = {1993///},
	pages = {45 - 56},
	author = {Das,R. and Hwang,Y. S and Uysal, M. and Saltz, J. and Sussman, Alan}
}
