@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 {20064,
	title = {Understanding the impact of image quality on segmentation accuracy},
	journal = {SPIE Newsroom},
	year = {2013},
	month = {2013},
	author = {Li-Baboud, Ya-Shian and Cardone, Antonio and Chalfoun, Joe and Bajcsy, Peter and Elliott, John}
}
@conference {19307,
	title = {Unsupervised Classification of Structurally Similar Document Images},
	booktitle = {International Conference on Document Analysis and Recognition},
	year = {2013},
	author = {Kumar,Jayant and David Doermann}
}
@conference {13684,
	title = {Unsupervised Feature Learning Framework for No-reference Image Quality Assessment},
	booktitle = {CVPR},
	year = {2012},
	month = {2012///},
	abstract = {In this paper, we present an efficient general-purpose objective no-reference (NR) image quality assessment (IQA) framework based on unsupervised feature learning. The goal is to build a computational model to automatically predict human perceived image quality without a reference image and without knowing the distortion present in the image. Previous approaches for this problem typically rely on hand-crafted features which are carefully designed based on prior knowledge. In contrast, we use raw-image-patches extracted from a set of unlabeled images to learn a dictionary in an unsupervised manner. We use soft-assignment coding with max pooling to obtain effective image representations for quality estimation. The proposed algorithm is very computationally appealing, using raw image patches as local descriptors and using soft-assignment for encoding. Furthermore, unlike previous methods, our unsupervised feature learning strategy enables our method to adapt to different domains. CORNIA (Codebook Representation for No-Reference Image Assessment) was tested on LIVE database and shown to perform statistically better than full-reference quality measure structural similarity index (SSIM) and was shown to be comparable to state-of-the-art general purpose NR-IQA algorithms.},
	author = {Ye,Peng and Kumar,Jayant and Kang,Le and David Doermann}
}
@article {14488,
	title = {Understanding actor loyalty to event-based groups in affiliation networks},
	journal = {Social Network Analysis and Mining},
	volume = {1},
	year = {2011},
	month = {2011///},
	pages = {115 - 126},
	abstract = {In this paper, we introduce a method for analyzing the temporal dynamics of affiliation networks. We define affiliation groups which describe temporally related subsets of actors and describe an approach for exploring changing memberships in these affiliation groups over time. To model the dynamic behavior in these networks, we consider the concept of loyalty and introduce a measure that captures an actor{\textquoteright}s loyalty to an affiliation group as the degree of {\textquoteleft}commitment{\textquoteright} an actor shows to the group over time. We evaluate our measure using three real world affiliation networks: a publication network, a senate bill cosponsorship network, and a dolphin network. The results show the utility of our measure for analyzing the dynamic behavior of actors and quantifying their loyalty to different time-varying affiliation groups.},
	doi = {10.1007/s13278-010-0005-5},
	author = {Sharara,H. and Singh,L. and Getoor, Lise and Mann,J.}
}
@article {13882,
	title = {Understanding Scientific Literature Networks: An Evaluation of Action Science Explorer},
	year = {2011},
	month = {2011///},
	institution = {University of Maryland at College Park},
	abstract = {Action Science Explorer (ASE) is a tool designed to supportusers in rapidly generating readily consumable summaries of
academic literature. The authors describe ASE and report
on how early formative evaluations led to a mature system
evaluation, consisting of an in-depth empirical evaluation
with 4 domain expert participants. The user study tasks
were of two types: predefined tasks to test system perfor-
mance in common scenarios, and user-defined tasks to test
the system{\textquoteright}s usefulness for custom exploration goals. This
paper concludes by describing ASE{\textquoteright}s attribute ranking ca-
pability which is a novel contribution for exploring scientific
literature networks. It makes design recommendations to:
give the users control over which documents to explore, easy-
to-understand metrics for ranking documents, and overviews
of the document set in coordinated views along with details-
on-demand of specific papers.
},
	author = {Gove,R. and Dunne,C. and Shneiderman, Ben and Klavans,J. and Dorr, Bonnie J}
}
@article {13351,
	title = {A unified approach to ranking in probabilistic databases},
	journal = {The VLDB Journal},
	volume = {20},
	year = {2011},
	month = {2011/04//},
	pages = {249 - 275},
	abstract = {Ranking is a fundamental operation in data analysis and decision support and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to much work in understanding how to rank the tuples in a probabilistic dataset in recent years. In this article, we present a unified approach to ranking and top-k query processing in probabilistic databases by viewing it as a multi-criterion optimization problem and by deriving a set of features that capture the key properties of a probabilistic dataset that dictate the ranked result. We contend that a single, specific ranking function may not suffice for probabilistic databases, and we instead propose two parameterized ranking functions, called PRF                           {\textquestiondown}              and PRF             e, that generalize or can approximate many of the previously proposed ranking functions. We present novel generating functions-based algorithms for efficiently ranking large datasets according to these ranking functions, even if the datasets exhibit complex correlations modeled using probabilistic and/xor trees or Markov networks. We further propose that the parameters of the ranking function be learned from user preferences, and we develop an approach to learn those parameters. Finally, we present a comprehensive experimental study that illustrates the effectiveness of our parameterized ranking functions, especially PRF             e, at approximating other ranking functions and the scalability of our proposed algorithms for exact or approximate ranking.},
	keywords = {Approximation techniques, Graphical models, Learning to rank, Probabilistic databases, Ranking},
	isbn = {1066-8888},
	doi = {10.1007/s00778-011-0220-3},
	url = {http://dx.doi.org/10.1007/s00778-011-0220-3},
	author = {Li,Jian and Saha,Barna and Deshpande, Amol}
}
@article {15193,
	title = {Universally composable synchronous computation},
	year = {2011},
	month = {2011///},
	institution = {Cryptology ePrint Archive, Report 2011/310, 2011. http://eprint. iacr. org},
	abstract = {In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronousworld: i.e., they can simultaneously achieve input completeness (all honest parties{\textquoteright} inputs are included in the
computation) and guaranteed termination (honest parties do not {\textquotedblleft}hang{\textquotedblright} indefinitely). In practice truly syn-
chronous networks rarely exist, but synchrony can be emulated if channels have (known) latency and parties
have loosely synchronized clocks.
The framework of universal composability (UC) is inherently asynchronous, but several approaches for
adding synchrony to the framework have been proposed. However, we show that the existing proposals do not
provide the expected guarantees. Given this, we propose a {\textquotedblleft}clean slate{\textquotedblright} approach to defining synchrony in the
UC framework by introducing functionalities exactly meant to model, respectively, bounded-delay networks and
loosely synchronized clocks. We show that the expected guarantees of synchronous computation can be realized
given these functionalities, and that previous models can all be expressed within our new framework.
},
	author = {Katz, Jonathan and Maurer,U. and Tackmann,B. and Zikas,V.}
}
@article {17462,
	title = {Usability and Accessibility in Consumer Health Informatics: Current Trends and Future Challenges},
	journal = {American Journal of Preventive Medicine},
	volume = {40},
	year = {2011},
	month = {2011/05//},
	pages = {S187-S197 - S187-S197},
	abstract = {It is a truism that, for innovative eHealth systems to have true value and impact, they must first and foremost be usable and accessible by clinicians, consumers, and other stakeholders. In this paper, current trends and future challenges in the usability and accessibility of consumer health informatics will be described. Consumer expectations of their healthcare providers and healthcare records in this new era of consumer-directed care will be explored, and innovative visualizations, assistive technologies, and other ways that healthcare information is currently being provided and/or shared will be described. Challenges for ensuring the usability of current and future systems will also be discussed. An innovative model for conducting systematic, timely, user-centered research on consumer-facing websites at the National Cancer Institute (NCI) and the ongoing efforts at the National Institute of Standards and Technology (NIST) to promote health information technology (HIT) usability standards and evaluation criteria will also be presented.},
	isbn = {0749-3797},
	doi = {10.1016/j.amepre.2011.01.009},
	url = {http://www.sciencedirect.com/science/article/pii/S0749379711000869},
	author = {Goldberg,Larry and Lide,Bettijoyce and Lowry,Svetlana and Massett,Holly A. and O{\textquoteright}Connell,Trisha and Preece,Jennifer and Quesenbery,Whitney and Shneiderman, Ben}
}
@conference {13476,
	title = {Using Agent-Based Simulation to Determine an Optimal Lane-Changing Strategy on a Multi-Lane Highway},
	booktitle = {2011 AAAI Fall Symposium Series},
	year = {2011},
	month = {2011///},
	author = {Tuzo,J. and Seymour,J. and desJardins, Marie and others}
}
@article {14379,
	title = {Using classifier cascades for scalable e-mail classification},
	journal = {Collaboration, Electronic Messaging, Anti-Abuse and Spam Conference, ACM International Conference Proceedings Series},
	year = {2011},
	month = {2011///},
	abstract = {In many real-world scenarios, we must make judgments in the presence of computational constraints. One common computational constraint arises when the features used to make a judgment each have differing acquisition costs, but there is a fixed total budget for a set of judgments. Par- ticularly when there are a large number of classifications that must be made in a real-time, an intelligent strategy for optimizing accuracy versus computational costs is essential. E-mail classification is an area where accurate and timely results require such a trade-off. We identify two scenarios where intelligent feature acquisition can improve classifier performance. In granular classification we seek to clas- sify e-mails with increasingly specific labels structured in a hierarchy, where each level of the hierarchy requires a differ- ent trade-off between cost and accuracy. In load-sensitive classification, we classify a set of instances within an ar- bitrary total budget for acquiring features. Our method, Adaptive Classifier Cascades (ACC), designs a policy to combine a series of base classifiers with increasing compu- tational costs given a desired trade-off between cost and ac- curacy. Using this method, we learn a relationship between feature costs and label hierarchies, for granular classification and cost budgets, for load-sensitive classification. We eval- uate our method on real-world e-mail datasets with realistic estimates of feature acquisition cost, and we demonstrate su- perior results when compared to baseline classifiers that do not have a granular, cost-sensitive feature acquisition policy.},
	author = {Pujara,J. and Daum{\'e}, Hal and Getoor, Lise}
}
@article {17981,
	title = {Using simple abstraction to reinvent computing for parallelism},
	journal = {Commun. ACM},
	volume = {54},
	year = {2011},
	month = {2011/01//},
	pages = {75 - 85},
	abstract = {The ICE abstraction may take CS from serial (single-core) computing to effective parallel (many-core) computing.},
	isbn = {0001-0782},
	doi = {10.1145/1866739.1866757},
	url = {http://doi.acm.org/10.1145/1866739.1866757},
	author = {Vishkin, Uzi}
}
@article {19264,
	title = {Using the DSPCAD Integrative Command-Line Environment: User{\textquoteright}s Guide for DICE Version 1.1},
	year = {2011},
	month = {2011},
	abstract = {This document provides instructions on setting up, starting up, andbuilding DICE and its key companion packages, dicemin and dicelang. This
installation process is based on a general set of conventions, which we
refer to as the DICE organizational conventions, for software packages.
The DICE organizational conventions are specified in this report. These
conventions are applied in DICE, dicemin, and dicelang, and also to
other software packages that are developed in the Maryland DSPCAD
Research Group.
},
	keywords = {Technical Report},
	isbn = {UMIACS-TR-2011-13},
	doi = {Technical Report},
	url = {http://drum.lib.umd.edu//handle/1903/11804},
	author = {Bhattacharyya, Shuvra S. and Chung-Ching Shen and Plishker,William and Sane, Nimish and Zaki, George}
}
@article {12417,
	title = {Using Variational Inference and MapReduce to Scale Topic Modeling},
	journal = {arXiv:1107.3765},
	year = {2011},
	month = {2011/07/19/},
	abstract = {Latent Dirichlet Allocation (LDA) is a popular topic modeling technique for exploring document collections. Because of the increasing prevalence of large datasets, there is a need to improve the scalability of inference of LDA. In this paper, we propose a technique called ~\emph{MapReduce LDA} (Mr. LDA) to accommodate very large corpus collections in the MapReduce framework. In contrast to other techniques to scale inference for LDA, which use Gibbs sampling, we use variational inference. Our solution efficiently distributes computation and is relatively simple to implement. More importantly, this variational implementation, unlike highly tuned and specialized implementations, is easily extensible. We demonstrate two extensions of the model possible with this scalable framework: informed priors to guide topic discovery and modeling topics from a multilingual corpus.},
	keywords = {Computer Science - Artificial Intelligence, Computer Science - Distributed, Parallel, and Cluster Computing},
	url = {http://arxiv.org/abs/1107.3765},
	author = {Zhai,Ke and Jordan Boyd-Graber and Asadi,Nima}
}
@article {16048,
	title = {Understanding Interactive Legends: a Comparative Evaluation with Standard Widgets},
	journal = {Computer Graphics Forum},
	volume = {29},
	year = {2010},
	month = {2010/06/01/},
	pages = {1193 - 1202},
	abstract = {Interactive information visualization systems rely on widgets to allow users to interact with the data and modify the representation. We define interactive legends as a class of controls combining the visual representation of static legends and interaction mechanisms of widgets. As interactive legends start to appear in popular websites, we categorize their designs for common data types and evaluate their effectiveness compare to standard widgets. Results suggest that 1) interactive legends can lead to faster perception of the mapping between data values and visual encodings and 2) interaction time is affected differently depending on the data type. Additionally, our study indicates superiority both in terms of perception and interaction of ordinal controls over numerical ones. Numerical techniques are mostly used in today{\textquoteright}s systems. By providing solutions to allowing users to modify ranges interactively, we believe that interactive legends make it possible to increase the use of ordinal techniques for visual exploration.},
	keywords = {H.5 [Information Interfaces and Presentation]: Miscellaneous{\textemdash}},
	isbn = {1467-8659},
	doi = {10.1111/j.1467-8659.2009.01678.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8659.2009.01678.x/abstract;jsessionid=F01A4A94A1103DF771F7EEF705FCF66F.d02t03},
	author = {Riche,Nathalie Henry and Lee,Bongshin and Plaisant, Catherine}
}
@article {19724,
	title = {Unexpected abundance of coenzyme F(420)-dependent enzymes in Mycobacterium tuberculosis and other actinobacteria.},
	journal = {J Bacteriol},
	volume = {192},
	year = {2010},
	month = {2010 Nov},
	pages = {5788-98},
	abstract = {<p>Regimens targeting Mycobacterium tuberculosis, the causative agent of tuberculosis (TB), require long courses of treatment and a combination of three or more drugs. An increase in drug-resistant strains of M. tuberculosis demonstrates the need for additional TB-specific drugs. A notable feature of M. tuberculosis is coenzyme F(420), which is distributed sporadically and sparsely among prokaryotes. This distribution allows for comparative genomics-based investigations. Phylogenetic profiling (comparison of differential gene content) based on F(420) biosynthesis nominated many actinobacterial proteins as candidate F(420)-dependent enzymes. Three such families dominated the results: the luciferase-like monooxygenase (LLM), pyridoxamine 5{\textquoteright}-phosphate oxidase (PPOX), and deazaflavin-dependent nitroreductase (DDN) families. The DDN family was determined to be limited to F(420)-producing species. The LLM and PPOX families were observed in F(420)-producing species as well as species lacking F(420) but were particularly numerous in many actinobacterial species, including M. tuberculosis. Partitioning the LLM and PPOX families based on an organism{\textquoteright}s ability to make F(420) allowed the application of the SIMBAL (sites inferred by metabolic background assertion labeling) profiling method to identify F(420)-correlated subsequences. These regions were found to correspond to flavonoid cofactor binding sites. Significantly, these results showed that M. tuberculosis carries at least 28 separate F(420)-dependent enzymes, most of unknown function, and a paucity of flavin mononucleotide (FMN)-dependent proteins in these families. While prevalent in mycobacteria, markers of F(420) biosynthesis appeared to be absent from the normal human gut flora. These findings suggest that M. tuberculosis relies heavily on coenzyme F(420) for its redox reactions. This dependence and the cofactor{\textquoteright}s rarity may make F(420)-related proteins promising drug targets.</p>},
	keywords = {Actinobacteria, Amino Acid Sequence, Binding Sites, Coenzymes, Flavonoids, Gene Expression Profiling, Gene Expression Regulation, Bacterial, Genome, Bacterial, molecular biology, Molecular Sequence Data, Molecular Structure, Mycobacterium tuberculosis, Phylogeny, Protein Conformation, Riboflavin},
	issn = {1098-5530},
	doi = {10.1128/JB.00425-10},
	author = {Jeremy D Selengut and Haft, Daniel H}
}
@article {15558,
	title = {A unified approach to approximate proximity searching},
	journal = {Algorithms{\textendash}ESA 2010},
	year = {2010},
	month = {2010///},
	pages = {374 - 385},
	author = {Arya,S. and da Fonseca,G. and Mount, Dave}
}
@conference {18890,
	title = {Using a Social Orientation Model for the Evolution of Cooperative Societies},
	year = {2010},
	month = {2010///},
	pages = {431 - 438},
	abstract = {We utilize evolutionary game theory to studythe evolution of cooperative societies and the behaviors of
individual agents (i.e., players) in such societies. We present
a novel player model based upon empirical evidence from the
social and behavioral sciences stating that: (1) an individual{\textquoteright}s
behavior may often be motivated not only by self-interest but
also by the consequences for others, and (2) individuals vary
in their interpersonal social tendencies, which reflect stable
personal orientations that influence their choices. Alongside
the formal player model we provide an analysis that considers
possible interactions between different types of individuals
and identifies five general steady-state behavioral patterns. We
present evolutionary simulations that ratify previous findings
on evolution of cooperation, and provide new insights on the
evolutionary process of cooperative behavior in a society as
well as on the emergence of cooperative societies. Our main
experimental result demonstrates that in contrast to previous
common knowledge, increasing mutual reward or mutual
punishment in the Prisoner{\textquoteright}s dilemma game does not result in
the same type of cooperative society: while increasing reward
does increase the society{\textquoteright}s cooperativeness level, increasing
mutual punishment does not.
},
	url = {http://www.ariel.ac.il/sites/inon/papers/iat10Kan.pdf},
	author = {Cheng,K. L. and Zuckerman,I. and Kuter,U. and Nau, Dana S.}
}
@conference {13475,
	title = {Using a Trust Model in Decision Making for Supply Chain Management},
	booktitle = {Workshops at the Twenty-Fourth AAAI Conference on Artificial Intelligence},
	year = {2010},
	month = {2010///},
	author = {Haghpanah,Y. and desJardins, Marie and others}
}
@article {14372,
	title = {Using friendship ties and family circles for link prediction},
	journal = {Advances in Social Network Mining and Analysis},
	year = {2010},
	month = {2010///},
	pages = {97 - 113},
	abstract = {Social networks can capture a variety of relationships among the participants. Both friendship and family ties are commonly studied, but most existing work studies them in isolation. Here, we investigate how these networks can be overlaid, and propose a feature taxonomy for link prediction. We show that when there are tightly-knit family circles in a social network, we can improve the accuracy of link prediction models. This is done by making use of the family circle features based on the likely structural equivalence of family members. We investigated the predictive power of overlaying friendship and family ties on three real-world social networks. Our experiments demonstrate significantly higher prediction accuracy (between 15\% and 30\% more accurate) compared to using more traditional features such as descriptive node attributes and structural features. The experiments also show that a combination of all three types of attributes results in the best precision-recall trade-off.},
	doi = {10.1007/978-3-642-14929-0_6},
	author = {Zheleva,E. and Getoor, Lise and Golbeck,J. and Kuter,U.}
}
@article {17749,
	title = {Using Generalized Annotated Programs to Solve Social Network Optimization Problems},
	journal = {ICLP},
	year = {2010},
	month = {2010///},
	abstract = {Reasoning about social networks (labeled, directed, weighted graphs) is be-coming increasingly important and there are now models of how certain phenomena (e.g.
adoption of products/services by consumers, spread of a given disease) {\textquotedblleft}diffuse{\textquotedblright} through
the network. Some of these diffusion models can be expressed via generalized annotated
programs (GAPs). In this paper, we consider the following problem: suppose we have a
given goal to achieve (e.g. maximize the expected number of adoptees of a product or
minimize the spread of a disease) and suppose we have limited resources to use in trying
to achieve the goal (e.g. give out a few free plans, provide medication to key people in the
SN) - how should these resources be used so that we optimize a given objective function
related to the goal? We define a class of social network optimization problems (SNOPs)
that supports this type of reasoning. We formalize and study the complexity of SNOPs
and show how they can be used in conjunction with existing economic and disease diffusion
models.
},
	author = {Shakarian,P. and V.S. Subrahmanian and Sapino,M. L and Hermenegildo,M. and Schaub,T.}
}
@conference {15496,
	title = {Using methods \& measures from network analysis for gui testing},
	booktitle = {Software Testing, Verification, and Validation Workshops (ICSTW), 2010 Third International Conference on},
	year = {2010},
	month = {2010/04//},
	pages = {240 - 246},
	abstract = {Graphical user interfaces (GUIs) for today{\textquoteright}s applications are extremely large. Moreover, they provide many degrees of freedom to the end-user, thus allowing the user to perform a very large number of event sequences on the GUI. The large sizes and degrees of freedom create severe problems for GUI quality assurance, including GUI testing. In this paper, we leverage methods and measures from network analysis to analyze and study GUIs, with the goal of aiding GUI testing activities. We apply these methods and measures on the event-flow graph model of GUIs. Results of a case study show that "network centrality measures" are able to identify the most important events in the GUI as well as the most important sequences of events. These events and sequences are good candidates for test prioritization. In addition, the "betweenness clustering" method is able to partition the GUI into regions that can be tested separately.},
	keywords = {betweenness clustering method, event sequences, event-flow graph model, Graphical user interfaces, GUI quality assurance, GUI testing, network analysis, network centrality measures, program testing, Software quality},
	doi = {10.1109/ICSTW.2010.61},
	author = {Elsaka,E. and Moustafa,W. E and Nguyen,Bao and Memon, Atif M.}
}
@conference {14306,
	title = {Using symbolic evaluation to understand behavior in configurable software systems},
	booktitle = {Software Engineering, 2010 ACM/IEEE 32nd International Conference on},
	volume = {1},
	year = {2010},
	month = {2010///},
	pages = {445 - 454},
	author = {Reisner,E. and Song,C. and Ma,K.K. and Foster, Jeffrey S. and Porter, Adam}
}
@article {19299,
	title = {Utilizing Hierarchical Multiprocessing for Medical Image Registration},
	journal = {IEEE Signal Processing Magazine},
	volume = {27},
	year = {2010},
	month = {2010},
	pages = {61 - 68},
	abstract = {This work discusses an approach to utilize hierarchical multiprocessing in the context of medical image registration. By first organizing application parallelism into a domain-specific taxonomy, an algorithm is structured to target a set of multicore platforms.The approach on a cluster of graphics processing units (GPUs) requiring the use of two parallel programming environments to achieve fast execution times is demonstrated.There is negligible loss in accuracy for rigid registration when employing GPU acceleration, but it does adversely effect our nonrigid registration implementation due to our usage of a gradient descent approach.},
	keywords = {Acceleration, application parallelism, Biomedical imaging, domain-specific taxonomy, GPU acceleration, gradient descent approach, Graphics processing unit, hierarchical multiprocessing, image registration, Magnetic resonance imaging, Medical diagnostic imaging, medical image processing, medical image registration, multicore platform set, Multicore processing, PARALLEL PROCESSING, parallel programming, Robustness, Signal processing algorithms, Ultrasonic imaging},
	isbn = {1053-5888},
	author = {Plishker,W. and Dandekar,O. and Bhattacharyya, Shuvra S. and Shekhar,R.}
}
@conference {14346,
	title = {UbiGreen: investigating a mobile tool for tracking and supporting green transportation habits},
	booktitle = {Proceedings of the 27th international conference on Human factors in computing systems},
	series = {CHI {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {1043 - 1052},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {ambient displays, mobile phones, sensing, Sustainability, transportation, ubicomp},
	isbn = {978-1-60558-246-7},
	doi = {10.1145/1518701.1518861},
	url = {http://doi.acm.org/10.1145/1518701.1518861},
	author = {Jon Froehlich and Dillahunt,Tawanna and Klasnja,Predrag and Mankoff,Jennifer and Consolvo,Sunny and Harrison,Beverly and Landay,James A.}
}
@article {16292,
	title = {Ultrafast and memory-efficient alignment of short DNA sequences to the human genome},
	journal = {Genome Biology},
	volume = {10},
	year = {2009},
	month = {2009/03/04/},
	pages = {R25 - R25},
	abstract = {Bowtie is an ultrafast, memory-efficient alignment program for aligning short DNA sequence reads to large genomes. For the human genome, Burrows-Wheeler indexing allows Bowtie to align more than 25 million reads per CPU hour with a memory footprint of approximately 1.3 gigabytes. Bowtie extends previous Burrows-Wheeler techniques with a novel quality-aware backtracking algorithm that permits mismatches. Multiple processor cores can be used simultaneously to achieve even greater alignment speeds. Bowtie is open source http://bowtie.cbcb.umd.edu.},
	isbn = {1465-6906},
	doi = {10.1186/gb-2009-10-3-r25},
	url = {http://genomebiology.com/2009/10/3/R25},
	author = {Langmead,Ben and Trapnell,Cole and Pop, Mihai and Salzberg,Steven L.}
}
@article {15843,
	title = {Understanding IT Innovations Through Computational Analysis of Discourse},
	journal = {ICIS 2009 Proceedings},
	year = {2009},
	month = {2009/01/01/},
	url = {http://aisel.aisnet.org/icis2009/102},
	author = {Tsui,Chia-jung and Wang,Ping and Fleischmann,Kenneth and Oard, Douglas and Sayeed,Asad}
}
@conference {17453,
	title = {Understanding social computing participation with visual exploration tools},
	booktitle = {International Symposium on Collaborative Technologies and Systems, 2009. CTS {\textquoteright}09},
	year = {2009},
	month = {2009/05/18/22},
	pages = {xi-xii - xi-xii},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The rapid growth of socio-technical systems, social media and social networking websites has raised the importance of understanding the determinants of their success. The pressure to understand success is increased by the shift from playful discretionary applications to mission critical applications in government, business, and civic settings. These include homeland defense, energy sustainability, environmental conservation, disaster response, and community safety. Information visualization tools and statistical methods can both be helpful, but their utility grows when they are well-integrated. This talk will demonstrate novel tools for network evolution and offer a framework for thinking about motivating technology-mediated social participation.},
	keywords = {Application software, Books, Collaborative tools, Computer science, Data visualization, Educational institutions, History, International collaboration, Social network services, Sociotechnical systems},
	isbn = {978-1-4244-4584-4},
	doi = {10.1109/CTS.2009.5067426},
	author = {Shneiderman, Ben}
}
@article {12233,
	title = {Understanding the design tradeoffs for cooperative streaming multicast},
	year = {2009},
	month = {2009///},
	institution = {Technical report MPI-SWS-2009-002, Max Planck Institute for Software Systems},
	abstract = {Video streaming over the Internet is rapidly increasing in popular-ity, but the availability and quality of the content is limited by the
high bandwidth cost for server-based solutions. Cooperative end-
system multicast (CEM) has emerged as a promising paradigm for
content distribution in the Internet, because the bandwidth over-
head of disseminating content is shared among the participants of
the CEM overlay network. Several CEM systems have been pro-
posed and deployed, but the tradeoffs inherent in the different de-
signs are not well understood.
In this work, we provide a common framework in which different
CEM design choices can be empirically and systematically evalu-
ated. Our results show that all CEM protocols are inherently lim-
ited in certain aspects of their performance. We distill our observa-
tions into a novel model that explains the inherent tradeoffs of CEM
design choices and provides bounds on the practical performance
limits of any future CEM protocol. In particular, the model conjec-
tures that no CEM design can simultaneously achieve all three of
low overhead, low lag, and high streaming quality.
},
	author = {Nandi,A. and Bhattacharjee, Bobby and Druschel,P.}
}
@conference {13106,
	title = {Understanding videos, constructing plots learning a visually grounded storyline model from annotated videos},
	booktitle = {Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on},
	year = {2009},
	month = {2009/06//},
	pages = {2012 - 2019},
	abstract = {Analyzing videos of human activities involves not only recognizing actions (typically based on their appearances), but also determining the story/plot of the video. The storyline of a video describes causal relationships between actions. Beyond recognition of individual actions, discovering causal relationships helps to better understand the semantic meaning of the activities. We present an approach to learn a visually grounded storyline model of videos directly from weakly labeled data. The storyline model is represented as an AND-OR graph, a structure that can compactly encode storyline variation across videos. The edges in the AND-OR graph correspond to causal relationships which are represented in terms of spatio-temporal constraints. We formulate an Integer Programming framework for action recognition and storyline extraction using the storyline model and visual groundings learned from training data.},
	keywords = {(artificial, action, activity, analysis;integer, AND-OR, annotation;video, coding;, constraint;video, construction;semantic, extraction;graph, framework;plots, graph;encoding;human, grounded, intelligence);spatiotemporal, learning, meaning;spatio-temporal, model, phenomena;video, Programming, programming;learning, recognition;human, representation;integer, storyline, theory;image, understanding;visually},
	doi = {10.1109/CVPR.2009.5206492},
	author = {Gupta,A. and Srinivasan,P. and Shi,Jianbo and Davis, Larry S.}
}
@article {13350,
	title = {A unified approach to ranking in probabilistic databases},
	journal = {Proceedings of the VLDB Endowment},
	volume = {2},
	year = {2009},
	month = {2009/08//},
	pages = {502 - 513},
	abstract = {The dramatic growth in the number of application domains that naturally generate probabilistic, uncertain data has resulted in a need for efficiently supporting complex querying and decision-making over such data. In this paper, we present a unified approach to ranking and top-k query processing in probabilistic databases by viewing it as a multi-criteria optimization problem, and by deriving a set of features that capture the key properties of a probabilistic dataset that dictate the ranked result. We contend that a single, specific ranking function may not suffice for probabilistic databases, and we instead propose two parameterized ranking functions, called PRFω and PRFe, that generalize or can approximate many of the previously proposed ranking functions. We present novel generating functions-based algorithms for efficiently ranking large datasets according to these ranking functions, even if the datasets exhibit complex correlations modeled using probabilistic and/xor trees or Markov networks. We further propose that the parameters of the ranking function be learned from user preferences, and we develop an approach to learn those parameters. Finally, we present a comprehensive experimental study that illustrates the effectiveness of our parameterized ranking functions, especially PRFe, at approximating other ranking functions and the scalability of our proposed algorithms for exact or approximate ranking.},
	isbn = {2150-8097},
	url = {http://dl.acm.org/citation.cfm?id=1687627.1687685},
	author = {Li,Jian and Saha,Barna and Deshpande, Amol}
}
@article {17549,
	title = {A unified approach to scheduling on unrelated parallel machines},
	journal = {J. ACM},
	volume = {56},
	year = {2009},
	month = {2009/08//},
	pages = {28:1{\textendash}28:31 - 28:1{\textendash}28:31},
	abstract = {We develop a single rounding algorithm for scheduling on unrelated parallel machines; this algorithm works well with the known linear programming-, quadratic programming-, and convex programming-relaxations for scheduling to minimize completion time, makespan, and other well-studied objective functions. This algorithm leads to the following applications for the general setting of unrelated parallel machines: (i) a bicriteria algorithm for a schedule whose weighted completion-time and makespan simultaneously exhibit the current-best individual approximations for these criteria; (ii) better-than-two approximation guarantees for scheduling to minimize the Lp norm of the vector of machine-loads, for all 1 < p < $\infty$; and (iii) the first constant-factor multicriteria approximation algorithms that can handle the weighted completion-time and any given collection of integer Lp norms. Our algorithm has a natural interpretation as a melding of linear-algebraic and probabilistic approaches. Via this view, it yields a common generalization of rounding theorems due to Karp et al. [1987] and Shmoys \& Tardos [1993], and leads to improved approximation algorithms for the problem of scheduling with resource-dependent processing times introduced by Grigoriev et al. [2007].},
	keywords = {Approximation algorithms, Randomized rounding, scheduling under multiple criteria},
	isbn = {0004-5411},
	doi = {10.1145/1552285.1552289},
	url = {http://doi.acm.org/10.1145/1552285.1552289},
	author = {Kumar,V. S. Anil and Marathe,Madhav V. and Parthasarathy,Srinivasan and Srinivasan, Aravind}
}
@conference {16665,
	title = {The University of Maryland statistical machine translation system for the Fourth Workshop on Machine Translation},
	booktitle = {Proceedings of the Fourth Workshop on Statistical Machine Translation},
	year = {2009},
	month = {2009///},
	pages = {145 - 149},
	author = {Dyer,C. and Setiawan,H. and Marton,Y. and Resnik, Philip}
}
@article {17689,
	title = {An Unreliable Convergence Criterion for Arnoldi{\textquoteright}s Method},
	year = {2009},
	month = {2009///},
	institution = {Technical Report, CMSC TR-4938, University of Maryland},
	author = {Stewart, G.W.}
}
@conference {16583,
	title = {An unsupervised learning method for representing simple sentences},
	booktitle = {Neural Networks, 2009. IJCNN 2009. International Joint Conference on},
	year = {2009},
	month = {2009///},
	pages = {2133 - 2140},
	author = {Monner,D. and Reggia, James A.}
}
@conference {13060,
	title = {Unsupervised search-based structured prediction},
	booktitle = {Proceedings of the 26th Annual International Conference on Machine Learning},
	series = {ICML {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {209 - 216},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We describe an adaptation and application of a search-based structured prediction algorithm "Searn" to unsupervised learning problems. We show that it is possible to reduce unsupervised learning to supervised learning and demonstrate a high-quality un-supervised shift-reduce parsing model. We additionally show a close connection between unsupervised Searn and expectation maximization. Finally, we demonstrate the efficacy of a semi-supervised extension. The key idea that enables this is an application of the predict-self idea for unsupervised learning.},
	isbn = {978-1-60558-516-1},
	doi = {10.1145/1553374.1553401},
	url = {http://doi.acm.org/10.1145/1553374.1553401},
	author = {Daum{\'e}, Hal}
}
@article {12523,
	title = {Unsupervised view and rate invariant clustering of video sequences},
	journal = {Computer Vision and Image Understanding},
	volume = {113},
	year = {2009},
	month = {2009/03//},
	pages = {353 - 371},
	abstract = {Videos play an ever increasing role in our everyday lives with applications ranging from news, entertainment, scientific research, security and surveillance. Coupled with the fact that cameras and storage media are becoming less expensive, it has resulted in people producing more video content than ever before. This necessitates the development of efficient indexing and retrieval algorithms for video data. Most state-of-the-art techniques index videos according to the global content in the scene such as color, texture, brightness, etc. In this paper, we discuss the problem of activity-based indexing of videos. To address the problem, first we describe activities as a cascade of dynamical systems which significantly enhances the expressive power of the model while retaining many of the computational advantages of using dynamical models. Second, we also derive methods to incorporate view and rate-invariance into these models so that similar actions are clustered together irrespective of the viewpoint or the rate of execution of the activity. We also derive algorithms to learn the model parameters from a video stream and demonstrate how a single video sequence may be clustered into different clusters where each cluster represents an activity. Experimental results for five different databases show that the clusters found by the algorithm correspond to semantically meaningful activities.},
	keywords = {Affine invariance, Cascade of linear dynamical systems, Rate invariance, Summarization, Surveillance, Video clustering, View invariance},
	isbn = {1077-3142},
	doi = {10.1016/j.cviu.2008.08.009},
	url = {http://www.sciencedirect.com/science/article/pii/S1077314208001367},
	author = {Turaga,Pavan and Veeraraghavan,Ashok and Chellapa, Rama}
}
@article {18374,
	title = {An update to experimental models for validating computer technology},
	journal = {Journal of Systems and Software},
	volume = {82},
	year = {2009},
	month = {2009/03//},
	pages = {373 - 376},
	abstract = {In 1998 a survey was published on the extent to which software engineering papers validate the claims made in those papers. The survey looked at publications in 1985, 1990 and 1995. This current paper updates that survey with data from 2000 to 2005. The basic conclusion is that the situation is improving. One earlier complaint that access to data repositories was difficult is becoming less prevalent and the percentage of papers including validation is increasing.},
	keywords = {data collection, experimentation, Technology evaluation},
	isbn = {0164-1212},
	doi = {10.1016/j.jss.2008.06.040},
	url = {http://www.sciencedirect.com/science/article/pii/S0164121208001751},
	author = {Zelkowitz, Marvin V}
}
@article {12162,
	title = {The Use of Empirical Studies in the Development of High End Computing Applications},
	year = {2009},
	month = {2009/12//},
	institution = {University of Maryland, College Park},
	abstract = {This report provides a description of the research and development activities towards learning much about the development and measurement of productivity in high performance computing environments. Many objectives were accomplished including the development of a methodology for measuring productivity in the parallel programming domain. This methodology was tested over 25 times at 8 universities across the United States and can be used to aid other researchers studying similar environments. The productivity measurement methodology incorporates both development time and performance into a single productivity number. An Experiment Manager tool for collecting data on the development of parallel programs, as well as a suite of tools to aid in the capture and analysis of such data was also developed. Lastly, several large scale development environments were studied in order to better understand the environment used to build large parallel programming applications. That work also included several surveys and interviews with many professional programmers in these environments.},
	keywords = {*COMPUTER PROGRAMMING, *EMPIRICAL STUDIES, *HPC(HIGH PERFORMANCE COMPUTING), *METHODOLOGY, *PARALLEL PROCESSING, *PARALLEL PROGRAMMING, *PRODUCTIVITY, *SOFTWARE ENGINEERING, *SOFTWARE METRICS, ADMINISTRATION AND MANAGEMENT, APMS(AUTOMATED PERFORMANCE MEASUREMENT SYSTEM), COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER SYSTEMS MANAGEMENT AND STANDARDS, data acquisition, efficiency, ENVIRONMENTS, HIGH END COMPUTING, HPCBUGBASE, HUMAN FACTORS ENGINEERING \& MAN MACHINE SYSTEM, learning, measurement, MPI(MESSAGE PASSING INTERFACE), PARALLEL ORIENTATION, PE62303E, PROGRAMMERS, SE(SOFTWARE ENGINEERING), SUPERVISORS, TEST AND EVALUATION, TEST FACILITIES, EQUIPMENT AND METEORS, TIME, tools, United States, WUAFRLT810HECA},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA511351},
	author = {Basili, Victor R. and Zelowitz,Marvin V}
}
@conference {13888,
	title = {Using citations to generate surveys of scientific paradigms},
	booktitle = {Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics},
	series = {NAACL {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {584 - 592},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {The number of research publications in various disciplines is growing exponentially. Researchers and scientists are increasingly finding themselves in the position of having to quickly understand large amounts of technical material. In this paper we present the first steps in producing an automatically generated, readily consumable, technical survey. Specifically we explore the combination of citation information and summarization techniques. Even though prior work (Teufel et al., 2006) argues that citation text is unsuitable for summarization, we show that in the framework of multi-document survey creation, citation texts can play a crucial role.},
	isbn = {978-1-932432-41-1},
	url = {http://dl.acm.org/citation.cfm?id=1620754.1620839},
	author = {Mohammad,Saif and Dorr, Bonnie J and Egan,Melissa and Hassan,Ahmed and Muthukrishan,Pradeep and Qazvinian,Vahed and Radev,Dragomir and Zajic, David}
}
@article {12846,
	title = {Using formal specifications to support testing},
	journal = {ACM Computing Surveys},
	volume = {41},
	year = {2009},
	month = {2009/02/01/},
	pages = {1 - 76},
	isbn = {03600300},
	doi = {10.1145/1459352.1459354},
	url = {http://dl.acm.org/citation.cfm?id=1459352.1459354},
	author = {Hierons,Robert M. and Krause,Paul and L{\"u}ttgen,Gerald and Simons,Anthony J. H. and Vilkomir,Sergiy and Woodward,Martin R. and Zedan,Hussein and Bogdanov,Kirill and Bowen,Jonathan P. and Cleaveland, Rance and Derrick,John and Dick,Jeremy and Gheorghe,Marian and Harman,Mark and Kapoor,Kalpesh}
}
@article {17916,
	title = {Using Graphics Processors for High-Performance Computation and Visualization of Plasma Turbulence},
	journal = {Computing in Science Engineering},
	volume = {11},
	year = {2009},
	month = {2009/04//march},
	pages = {52 - 59},
	abstract = {Direct numerical simulation (DNS) of turbulence is computationally intensive and typically relies on some form of parallel processing. The authors present techniques to map DNS computations to modern graphics processing units (GPUs), which are characterized by very high memory bandwidth and hundreds of SPMD (single-program-multiple-data) processors.},
	keywords = {analysis;parallel, computation;parallel, computing;numerical, direct, engineering, numerical, PROCESSING, processing;plasma, processors;data, simulation;graphics, systems;nuclear, turbulence, turbulence;, units;high-performance, visualisation;multiprocessing, visualization;single-program-multiple-data},
	isbn = {1521-9615},
	doi = {10.1109/MCSE.2009.42},
	author = {Stantchev,G. and Juba,D. and Dorland,W. and Varshney, Amitabh}
}
@article {15504,
	title = {Using GUI Run-Time State as Feedback for Test Automation},
	year = {2009},
	month = {2009/08/18/},
	institution = {Computer Science Research Works, University of Maryland, College Park},
	abstract = {Graphical user interfaces (GUIs) are the sole mode of interactionbetween end-users and back-end code for almost all of today{\textquoteright}s software
applications.  Because of this strategic role of GUIs, their quality
has become important. During GUI testing, test cases---modeled as
sequences of user events---sample the vast input space of all possible
sequences with the goal of detecting faults; for effective testing, it
is important to sample this space carefully.  Existing techniques
either sample manually or employ manually constructed abstract
models---the abstraction and/or subsequent test-case generation
algorithms enable sampling.
This report presents an alternative approach to GUI testing -- it{\textquoteright}s
focus is on developing a fully automatic model-driven technique
to generate GUI test cases.  The technique is novel in that it uses
feedback from the execution of a {\textquoteleft}{\textquoteleft}seed test suite{\textquoteright}{\textquoteright} on a GUI.
The seed suite is generated automatically using an existing structural
event-interaction graph (EIG) model of the GUI.  During its
execution, the run-time effect of each GUI event on all other events
pinpoints new important event-semantic interaction (ESI)
relationships between them, which are used to automatically create an
ESI graph (ESIG) model and generate new test cases.  Together
with a reverse-engineering algorithm used to obtain the EIG, seed
suite, ESIG, and new test cases, the feedback-based technique yields a
fully automatic, end-to-end GUI testing process.
},
	keywords = {GUI testing, Software testing, test automation, test-case generation},
	url = {http://drum.lib.umd.edu//handle/1903/9416},
	author = {Xun Yuan and Memon, Atif M.}
}
@article {15437,
	title = {Using reverse engineering for automated usability evaluation of GUI-based applications},
	journal = {Human-Centered Software Engineering},
	year = {2009},
	month = {2009///},
	pages = {335 - 355},
	abstract = {Graphical user interfaces (GUIs) are important parts of today{\textquoteright}s software and their usability ensures the usefulness of the overall software. A popular technique to check the usability of GUIs is by performing usability evaluations either manually or automatically using tools. While manual evaluation is resource intensive, performing automatic usability evaluation usually involves the creation of a model of the GUI, a significant resource-intensive step that intimidates many practitioners and prevents the application of the automated techniques. This chapter presents {\textquotedblleft}GUI ripping,{\textquotedblright} a new process that automatically recovers models of the GUI by dynamically {\textquotedblleft}traversing{\textquotedblright} all its windows and extracting all the widgets, properties, and values. The usefulness of this process is demonstrated by recovering a structural model called a GUI forest and dynamic models called event-flow graphs and integration trees. Results of case studies show that GUI ripping is effective and requires very little human intervention.},
	doi = {10.1007/978-1-84800-907-3_16},
	author = {Memon, Atif M.}
}
@article {12885,
	title = {Using Satellite Images of Environmental Changes to Predict Infectious Disease Outbreaks},
	journal = {Emerging Infectious DiseasesEmerg Infect Dis},
	volume = {15},
	year = {2009},
	month = {2009/09//},
	pages = {1341 - 1346},
	abstract = {A strong global satellite imaging system is essential for predicting outbreaks., Recent events clearly illustrate a continued vulnerability of large populations to infectious diseases, which is related to our changing human-constructed and natural environments. A single person with multidrug-resistant tuberculosis in 2007 provided a wake-up call to the United States and global public health infrastructure, as the health professionals and the public realized that today{\textquoteright}s ease of airline travel can potentially expose hundreds of persons to an untreatable disease associated with an infectious agent. Ease of travel, population increase, population displacement, pollution, agricultural activity, changing socioeconomic structures, and international conflicts worldwide have each contributed to infectious disease events. Today, however, nothing is larger in scale, has more potential for long-term effects, and is more uncertain than the effects of climate change on infectious disease outbreaks, epidemics, and pandemics. We discuss advances in our ability to predict these events and, in particular, the critical role that satellite imaging could play in mounting an effective response.},
	isbn = {1080-6040},
	doi = {10.3201/eid/1509.081334},
	author = {Ford,Timothy E. and Rita R Colwell and Rose,Joan B. and Morse,Stephen S. and Rogers,David J. and Yates,Terry L.}
}
@article {14887,
	title = {Using Stereo Matching with General Epipolar Geometry for 2D Face Recognition across Pose},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {31},
	year = {2009},
	month = {2009/12//},
	pages = {2298 - 2304},
	abstract = {Face recognition across pose is a problem of fundamental importance in computer vision. We propose to address this problem by using stereo matching to judge the similarity of two, 2D images of faces seen from different poses. Stereo matching allows for arbitrary, physically valid, continuous correspondences. We show that the stereo matching cost provides a very robust measure of similarity of faces that is insensitive to pose variations. To enable this, we show that, for conditions common in face recognition, the epipolar geometry of face images can be computed using either four or three feature points. We also provide a straightforward adaptation of a stereo matching algorithm to compute the similarity between faces. The proposed approach has been tested on the CMU PIE data set and demonstrates superior performance compared to existing methods in the presence of pose variation. It also shows robustness to lighting variation.},
	keywords = {2D face recognition;CMU PIE data set;computer vision;continuous correspondences;general epipolar geometry;lighting variation;pose variation;stereo matching;computer vision;face recognition;geometry;image matching;pose estimation;stereo image processing;Al, Automated;, Computer-Assisted;Pattern Recognition},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2009.123},
	author = {Castillo,C. D and Jacobs, David W.}
}
@conference {12167,
	title = {Using uncertainty as a model selection and comparison criterion},
	booktitle = {Proceedings of the 5th International Conference on Predictor Models in Software Engineering},
	series = {PROMISE {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {18:1{\textendash}18:9 - 18:1{\textendash}18:9},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Over the last 25+ years, software estimation research has been searching for the best model for estimating variables of interest (e.g., cost, defects, and fault proneness). This research effort has not lead to a common agreement. One problem is that, they have been using accuracy as the basis for selection and comparison. But accuracy is not invariant; it depends on the test sample, the error measure, and the chosen error statistics (e.g., MMRE, PRED, Mean and Standard Deviation of error samples). Ideally, we would like an invariant criterion. In this paper, we show that uncertainty can be used as an invariant criterion to figure out which estimation model should be preferred over others. The majority of this work is empirically based, applying Bayesian prediction intervals to some COCOMO model variations with respect to a publicly available cost estimation data set coming from the PROMISE repository.},
	keywords = {accuracy, Bayesian prediction intervals, Calibration, cost estimation, cost model, model evaluation, model selection, prediction interval, Uncertainty},
	isbn = {978-1-60558-634-2},
	doi = {10.1145/1540438.1540464},
	url = {http://doi.acm.org/10.1145/1540438.1540464},
	author = {Sarcia{\textquoteright},Salvatore Alessandro and Basili, Victor R. and Cantone,Giovanni}
}
@article {18609,
	title = {UFO: a resilient layered routing architecture},
	journal = {ACM SIGCOMM Computer Communication Review},
	volume = {38},
	year = {2008},
	month = {2008/09//},
	pages = {59 - 62},
	abstract = {Conventional wisdom has held that routing protocols cannot achieve both scalability and high availability. Despite scaling relatively well, today{\textquoteright}s Internet routing system does not react quickly to changing network conditions (e.g., link failures or excessive congestion). Overlay networks, on the other hand, can respond quickly to changing network conditions, but their reliance on aggressive probing does not scale to large topologies. The paper presents a layered routing architecture called UFO (Underlay Fused with Overlays), which achieves the best of both worlds by having the "underlay" provide explicit notification about network conditions to help improve the efficiency and scalability of routing overlays.},
	keywords = {network monitoring, overlay networks, routing architecture},
	isbn = {0146-4833},
	doi = {10.1145/1452335.1452344},
	url = {http://doi.acm.org/10.1145/1452335.1452344},
	author = {Zhu,Yaping and Bavier,Andy and Feamster, Nick and Rangarajan,Sampath and Rexford,Jennifer}
}
@article {13127,
	title = {UMD_VDT, an Integration of Detection and Tracking Methods for Multiple Human Tracking},
	journal = {Multimodal Technologies for Perception of Humans},
	year = {2008},
	month = {2008///},
	pages = {179 - 190},
	abstract = {This paper presents a cooperative body part labeling and tracking algorithm for locating body parts in a videoimage sequence. The body part labeling procedure is used to initialize the tracking procedure and to prevent
tracking from getting lost; and the tracking procedure is used to analyze frames that cannot be handled reliably by
the labeling procedure. This results in an automatic and robust body part tracking system. Unlike previous work
that always start tracking from the first frame which may be difficult to analyze, our tracking procedure starts
with some key frames in which body parts can be located reliably. Key frames are selected based on a labeling
confidence measure which evaluates the similarity between the human model and the image features. The labeled
body parts are tracked in-between frames based on such cues as shape, color, and location interpolated between
key frames iteratively. The proposed algorithm has been applied to analyze NASA videotapes in which crew
members present challenging postures of bending, twisting, and rotating in a space station. The experimental
results demonstrate the effectiveness of the proposed algorithm.
},
	author = {Tran,S. and Lin,Z. and Harwood,D. and Davis, Larry S.}
}
@conference {13683,
	title = {Unconstrained Language Identification Using AShape Codebook},
	booktitle = {The 11th International Conference on Frontiers in Handwritting Recognition (ICFHR 2008)},
	year = {2008},
	month = {2008///},
	pages = {13 - 18},
	address = {Montreal, Canada},
	abstract = {We propose a novel approach to language identification in document images containing handwriting and machine printed text using image descriptors constructed from a codebook of shape features. We encode local text structures using scale and rotation invariant codewords, each representing a characteristic shape feature that is generic enough to appear repeatably. We learn a concise, structurally indexed shape codebook from training data by clustering similar features and partitioning the feature space by graph cuts. Our approach is segmentation free and easily extensible. We quantitatively evaluate our approach using a large real-world document image collection, which consists of more than 1,500 documents in 8 languages (Arabic, Chinese, English, Hindi, Japanese, Korean, Russian, and Thai) and contains a complex mixture of handwritten and machine printed content. Experimental results demonstrate the robustness and flexibility of our approach, and show exceptional language identification performance that exceeds the state of art.},
	author = {Zhu,Guangyu and Yu,Xiaodong and Li,Yi and David Doermann}
}
@conference {15271,
	title = {Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques},
	booktitle = {IEEE International Conference on Bioinformatics and Biomedicine, 2008. BIBM {\textquoteright}08},
	year = {2008},
	month = {2008/11/03/5},
	pages = {223 - 230},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The evolutionary histories of viral genomes have received significant recent attention due to their importance in understanding virulence and the corresponding ramifications to public health. We present a novel framework to detect reassortment events in influenza based on the comparison of two distributions of phylogenetic trees, rather than a pair of, possibly unreliable, consensus trees. We show how to detect all high-probability inconsistencies between two distributions of trees by enumerating maximal bicliques within a defined incompatibility graph. In the process, we give the first quadratic delay algorithm for enumerating maximal bicliques within general bipartite graphs. We demonstrate the utility of our approach by applying it to several sets of influenza genomes (both human- and avian-hosted) and successfully identify all known reassortment events and a few novel candidate reassortments. In addition, on simulated datasets, our approach correctly finds implanted reassortments and rarely detects reassortments where none were introduced.},
	keywords = {avian hosted influenza genome, Bioinformatics, Capacitive sensors, Delay, diseases, Event detection, general bipartite graphs, genomic reassortments, Genomics, graph theory, high probability inconsistencies, History, human hosted influenza genome, incompatibility graph, Influenza, influenza strain, maximal biclique, maximal biclique enumeration, microorganisms, phylogenetic trees, Phylogeny, Public healthcare, quadratic delay algorithm, reassortment, reassortment event detection, Tree graphs, viral genome evolutionary history, virulence},
	isbn = {978-0-7695-3452-7},
	doi = {10.1109/BIBM.2008.78},
	author = {Nagarajan,N. and Kingsford, Carl}
}
@article {18448,
	title = {Understanding the High-Performance-Computing Community: A Software Engineer{\textquoteright}s Perspective},
	journal = {Software, IEEE},
	volume = {25},
	year = {2008},
	month = {2008/08//july},
	pages = {29 - 36},
	abstract = {Computational scientists developing software for HPC systems face unique software engineering issues. Attempts to transfer SE technologies to this domain must take these issues into account.},
	keywords = {community;software, computational, engineering;, engineering;software, Science, software;high-performance-computing},
	isbn = {0740-7459},
	doi = {10.1109/MS.2008.103},
	author = {Basili, Victor R. and Carver, J. C and Cruzes, D. and Hochstein, L. M and Hollingsworth, Jeffrey K and Shull, F. and Zelkowitz, Marvin V}
}
@article {12242,
	title = {A Unified Framework for Multipath Routing for Unicast and Multicast Traffic},
	journal = {Networking, IEEE/ACM Transactions on},
	volume = {16},
	year = {2008},
	month = {2008/10//},
	pages = {1038 - 1051},
	abstract = {We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the gradient of the network cost function is not available and needs to be estimated. Multiple paths are provided between a source and a destination using application-layer overlay. We propose a novel algorithm that is based on what is known as simultaneous perturbation stochastic approximation and utilizes only noisy measurements collected and reported to the sources, using an overlay architecture. We consider three network models that reflect different sets of assumptions regarding multicast capabilities of the network. Using an analytical model we first prove the almost sure convergence of the algorithm to a corresponding optimal solution under each network model considered in this paper with decreasing step sizes. Then, we establish the weak convergence (or convergence in distribution) with a fixed step size. In addition, we investigate the benefits acquired from implementing additional multicast capabilities by studying the relative performance of our algorithm under the three network models.},
	keywords = {application-layer, approximation;unicast, balancing;multicast, channels;stochastic, communication;multipath, cost, function;optimization, network, overlay;load, perturbation, problem;simultaneous, processes;telecommunication, routing;network, routing;telecommunication, Stochastic, traffic;, traffic;multicast, traffic;multipath},
	isbn = {1063-6692},
	doi = {10.1109/TNET.2007.909686},
	author = {Guven,T. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby}
}
@article {15173,
	title = {Universally composable multi-party computation with an unreliable common reference string},
	journal = {Theory of Cryptography},
	year = {2008},
	month = {2008///},
	pages = {142 - 154},
	abstract = {Universally composable (UC) multi-party computation has been studied in two settings. When a majority of parties are honest, UC multi-party computation is possible without any assumptions. Without a majority of honest parties, UC multi-party computation is impossible in the plain model, but feasibility results have been obtained in various augmented models. The most popular such model posits a common reference string (CRS) available to parties executing the protocol.In either of the above settings, some assumption regarding the protocol execution is made: i.e., that many parties are honest in the first case, or that a legitimately-chosen string is available in the second. If this assumption is incorrect then all security is lost.
A natural question is whether it is possible to design protocols secure if either one of these assumptions holds, i.e., a protocol which is secure if either at most s players are dishonest or if up to t > s players are dishonest but the CRS is chosen in the prescribed manner. We show that such protocols exist if and only if s + t < n.
This work was done in part while the authors were visiting IPAM.
},
	doi = {10.1007/978-3-540-78524-8_9},
	author = {Goyal,V. and Katz, Jonathan}
}
@article {15890,
	title = {Unlocking the Potential of the Spoken Word},
	journal = {Science},
	volume = {321},
	year = {2008},
	month = {2008///},
	pages = {1787 - 1788},
	doi = {10.1126/science.1157353},
	url = {http://www.sciencemag.org/content/321/5897/1787.short},
	author = {Oard, Douglas}
}
@conference {15332,
	title = {Upstream and downstream in unsteadiness of STBLI using DNS data in two con gurations},
	booktitle = {46th AIAA Aerospace Sciences Meeting},
	year = {2008},
	month = {2008///},
	abstract = {Statistical analysis of the upstream and downstream flow influence on shock unsteadiness in shock and turbulent boundary layer interactions are performed using DNS data of a compression corner Wu \& Martin1 and a reflected shock case interaction. For both cases, the scaling proposed by Dussauge et al.2 for the characteristic low frequency applies. The statistical analysis for the compression corner shows that the unsteadiness of the shock is dominated by the downstream flow. The same analysis applied to the reflected shock case also indicates downstream influence. Additional studies are required to fully characterize the reflected shock case DNS data.},
	author = {Martin, M.P and Priebe,S. and Wu,M.}
}
@article {15356,
	title = {Upstream and downstream influence on the unsteadiness of STBLI using DNS data in two configurations},
	journal = {AIAA Paper 2008-0719, 46, h},
	year = {2008},
	month = {2008///},
	author = {Martin, M.P and Priebe,S. and Wu,M.}
}
@conference {18682,
	title = {On the Use of Security Metrics Based on Intrusion Prevention System Event Data: An Empirical Analysis},
	year = {2008},
	month = {2008/12//},
	pages = {49 - 58},
	abstract = {With the increasing number of attacks on the Internet, a primary concern for organizations is the protection of their network. To do so, organizations install security devices such as intrusion prevention systems to monitor network traffic. However, data that are collected by these devices are often imperfect. The contribution of this paper is to try to define some practical metrics based on imperfect data collected by an intrusion prevention system. Since attacks greatly differ, we propose to group the attacks into several attack type groups. We then define a set of metrics for each attack type group. We introduce an approach that consists in analyzing the evolution of these metrics per attack type group by focusing on outliers in order to give an insight into an organizationpsilas security. The method is assessed for an organization of about 40,000 computers. The results were encouraging: outliers could be related to security issues that, in some cases, had not been previously flagged.},
	keywords = {empirical analysis, Internet, Internet attack group, intrusion prevention system event data, network traffic monitoring, organization security metrics, security of data},
	doi = {10.1109/HASE.2008.52},
	author = {Chrun,D. and Michel Cukier and Sneeringer,G.}
}
@article {15888,
	title = {User-assisted query translation for interactive cross-language information retrieval},
	journal = {Information Processing \& Management},
	volume = {44},
	year = {2008},
	month = {2008/01//},
	pages = {181 - 211},
	abstract = {Interactive Cross-Language Information Retrieval (CLIR), a process in which searcher and system collaborate to find documents that satisfy an information need regardless of the language in which those documents are written, calls for designs in which synergies between searcher and system can be leveraged so that the strengths of one can cover weaknesses of the other. This paper describes an approach that employs user-assisted query translation to help searchers better understand the system{\^a}{\texteuro}{\texttrademark}s operation. Supporting interaction and interface designs are introduced, and results from three user studies are presented. The results indicate that experienced searchers presented with this new system evolve new search strategies that make effective use of the new capabilities, that they achieve retrieval effectiveness comparable to results obtained using fully automatic techniques, and that reported satisfaction with support for cross-language searching increased. The paper concludes with a description of a freely available interactive CLIR system that incorporates lessons learned from this research.},
	keywords = {Cross-language information retrieval, Machine translation, User studies},
	isbn = {0306-4573},
	doi = {10.1016/j.ipm.2006.12.009},
	url = {http://www.sciencedirect.com/science/article/pii/S0306457307000337},
	author = {Oard, Douglas and He,Daqing and Wang,Jianqiang}
}
@article {17475,
	title = {Users can change their web search tactics: Design guidelines for categorized overviews},
	journal = {Information Processing \& Management},
	volume = {44},
	year = {2008},
	month = {2008/03//},
	pages = {463 - 484},
	abstract = {Categorized overviews of web search results are a promising way to support user exploration, understanding, and discovery. These search interfaces combine a metadata-based overview with the list of search results to enable a rich form of interaction. A study of 24 sophisticated users carrying out complex tasks suggests how searchers may adapt their search tactics when using categorized overviews. This mixed methods study evaluated categorized overviews of web search results organized into thematic, geographic, and government categories. Participants conducted four exploratory searches during a 2-hour session to generate ideas for newspaper articles about specified topics such as {\textquotedblleft}human smuggling.{\textquotedblright} Results showed that subjects explored deeper while feeling more organized, and that the categorized overview helped subjects better assess their results, although no significant differences were detected in the quality of the article ideas. A qualitative analysis of searcher comments identified seven tactics that participants reported adopting when using categorized overviews. This paper concludes by proposing a set of guidelines for the design of exploratory search interfaces. An understanding of the impact of categorized overviews on search tactics will be useful to web search researchers, search interface designers, information architects and web developers.},
	keywords = {categorization, Categorized overviews, Categorized search results, Exploratory search, Human-computer interaction, information seeking, Search result visualization, Search user interfaces, Web search},
	isbn = {0306-4573},
	doi = {10.1016/j.ipm.2007.07.014},
	url = {http://www.sciencedirect.com/science/article/pii/S0306457307001574},
	author = {Kules,Bill and Shneiderman, Ben}
}
@article {15413,
	title = {Using a pilot study to derive a GUI model for automated testing},
	journal = {ACM Transactions on Software Engineering and Methodology (TOSEM)},
	volume = {18},
	year = {2008},
	month = {2008/11//},
	pages = {7:1{\textendash}7:35 - 7:1{\textendash}7:35},
	abstract = {Graphical user interfaces (GUIs) are one of the most commonly used parts of today{\textquoteright}s software. Despite their ubiquity, testing GUIs for functional correctness remains an understudied area. A typical GUI gives many degrees of freedom to an end-user, leading to an enormous input event interaction space that needs to be tested. GUI test designers generate and execute test cases (modeled as sequences of user events) to traverse its parts; targeting a subspace in order to maximize fault detection is a nontrivial task. In this vein, in previous work, we used informal GUI code examination and personal intuition to develop an event-interaction graph (EIG). In this article we empirically derive the EIG model via a pilot study, and the resulting EIG validates our intuition used in previous work; the empirical derivation process also allows for model evolution as our understanding of GUI faults improves. Results of the pilot study show that events interact in complex ways; a GUI{\textquoteright}s response to an event may vary depending on the context established by preceding events and their execution order. The EIG model helps testers to understand the nature of interactions between GUI events when executed in test cases and why certain events detect faults, so that they can better traverse the event space. New test adequacy criteria are defined for the EIG; new algorithms use these criteria and EIG to systematically generate test cases that are shown to be effective on four fielded open-source applications.},
	keywords = {Graphical user interfaces, model-based testing, test minimization, Test suite management},
	isbn = {1049-331X},
	doi = {10.1145/1416563.1416567},
	url = {http://doi.acm.org/10.1145/1416563.1416567},
	author = {Xie,Qing and Memon, Atif M.}
}
@article {14829,
	title = {Using specularities in comparing 3D models and 2D images},
	journal = {Computer Vision and Image Understanding},
	volume = {111},
	year = {2008},
	month = {2008/09//},
	pages = {275 - 294},
	abstract = {We aim to create systems that identify and locate objects by comparing known, 3D shapes to intensity images that they have produced. To do this we focus on verification methods that determine whether a known model in a specific pose is consistent with an image. We build on prior work that has done this successfully for Lambertian objects, to handle a much broader class of shiny objects that produce specular highlights. Our core contribution is a novel method for determining whether a known 3D shape is consistent with the 2D shape of a possible highlight found in an image. We do this using only a qualitative description of highlight formation that is consistent with most models of specular reflection, so no specific knowledge of an object{\textquoteright}s specular reflectance properties is needed. This allows us to treat non-Lambertian image effects as a positive source of information about object identity, rather than treating them as a potential source of noise. We then show how to integrate information about highlights into a system that also checks the consistency of Lambertian reflectance effects. Also, we show how to model Lambertian reflectance using a reference image, rather than albedos, which can be difficult to measure in shiny objects. We test each aspect of our approach using several different data sets. We demonstrate the potential value of our method of handling specular highlights by building a system that can locate shiny, transparent objects, such as glassware, on table tops. We demonstrate our hybrid methods on pottery, and our use of reference images with face recognition experiments.},
	keywords = {illumination, Object recognition, Specularity},
	isbn = {1077-3142},
	doi = {10.1016/j.cviu.2007.12.004},
	url = {http://www.sciencedirect.com/science/article/pii/S1077314207001713},
	author = {Osadchy,Margarita and Jacobs, David W. and Ramamoorthi,Ravi and Tucker,David}
}
@conference {14348,
	title = {Using wearable sensors and real time inference to understand human recall of routine activities},
	booktitle = {Proceedings of the 10th international conference on Ubiquitous computing},
	series = {UbiComp {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {154 - 163},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {empirical evaluation, ESM, experience sampling method, recall accuracy, self-reports, survey frequency, user study},
	isbn = {978-1-60558-136-1},
	doi = {10.1145/1409635.1409656},
	url = {http://doi.acm.org/10.1145/1409635.1409656},
	author = {Klasnja,Predrag and Harrison,Beverly L. and LeGrand,Louis and LaMarca,Anthony and Jon Froehlich and Hudson,Scott E.}
}
@article {12920,
	title = {Ultrastructure of coccoid viable but non-culturable Vibrio cholerae},
	journal = {Environmental Microbiology},
	volume = {9},
	year = {2007},
	month = {2007/02/01/},
	pages = {393 - 402},
	abstract = {Morphology of viable but non-culturable Vibrio cholerae was monitored for 2~years by scanning and transmission electron microscopy. Morphological changes included very small coccoid forms, after extended incubation at 4{\textdegree}C and room temperature, and sequential transformation from curved rods to irregular (\~{}1~μm) rods to \~{}0.8~μm coccoid cells and, ultimately, to tiny coccoid forms (0.07{\textendash}0.4~μm). Irregular rod-shaped and coccoid cells were equally distributed in microcosms during the first 30{\textendash}60~days of incubation at both temperatures, but only coccoid cells were observed after incubation for 60~days at 4{\textdegree}C. When V.~cholerae O1 and O139, maintained for 30{\textendash}60~days at both temperatures, were heated to 45{\textdegree}C for 60~s, after serial passage through 0.45~μm and 0.1~μm filters, and plating on Luria{\textendash}Bertania (LB) agar, only cells larger than 1~μm yielded colonies on LB agar. Approximately 0.1\% of heat-treated cultures were culturable. Cell division in the smallest coccoid cells was observed, yielding daughter cells of equal size, whereas other coccoid cells revealed bleb-like, cell wall evagination, followed by transfer of nuclear material. Coccoid cells of V.~cholerae O1 and O139 incubated at 4{\textdegree}C for more than 1~year remained substrate responsive and antigenic.},
	isbn = {1462-2920},
	doi = {10.1111/j.1462-2920.2006.01150.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2006.01150.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=},
	author = {Chaiyanan,Saipin and Chaiyanan,Sitthipan and Grim,Christopher and Maugel,Timothy and Huq,Anwar and Rita R Colwell}
}
@article {17773,
	title = {Uncertainty in logic programming: Some recollections},
	journal = {Association for Logic Programming Newsletter},
	volume = {20},
	year = {2007},
	month = {2007///},
	author = {V.S. Subrahmanian}
}
@article {16386,
	title = {Understanding the Semantics of the Genetic Algorithm in Dynamic Environments},
	journal = {Applications of Evolutionary Computing},
	year = {2007},
	month = {2007///},
	pages = {657 - 667},
	abstract = {Researchers examining genetic algorithms (GAs) in applied settings rarely have access to anything other than fitness values of the best individuals to observe the behavior of the GA. In particular, researchers do not know what schemata are present in the population. Even when researchers look beyond best fitness values, they concentrate on either performance related measures like average fitness and robustness, or low-level descriptions like bit-level diversity measures. To understand the behavior of the GA on dynamic problems, it would be useful to track what is occurring on the {\textquotedblleft}semantic{\textquotedblright} level of schemata. Thus in this paper we examine the evolving {\textquotedblleft}content{\textquotedblright} in terms of schemata, as the GA solves dynamic problems. This allows us to better understand the behavior of the GA in dynamic environments. We finish by summarizing this knowledge and speculate about future work to address some of the new problems that we discovered during these experiments.},
	doi = {10.1007/978-3-540-71805-5_72},
	author = {Alharbi,A. and Rand, William and Riolo,R}
}
@article {18287,
	title = {Unicity Distance of Robust Image Hashing},
	journal = {Information Forensics and Security, IEEE Transactions on},
	volume = {2},
	year = {2007},
	month = {2007/09//},
	pages = {462 - 467},
	abstract = {An image hash is a randomized compact representation of image content and finds applications in image authentication, image and video watermarking, and image similarity comparison. Usually, an image-hashing scheme is required to be robust and secure, and the security issue is particularly important in applications, such as multimedia authentication, watermarking, and fingerprinting. In this paper, we investigate the security of image hashing from the perspective of unicity distance, a concept pioneered by Shannon in one of his seminal papers. Using two recently proposed image-hashing schemes as representatives, we show that the concept of unicity distance can be adapted to evaluate the security of image hashing. Our analysis shows that the secret hashing key, or its equivalent form, can be estimated with high accuracy when the key is reused several dozen times. The estimated unicity distance determines the maximum number of key reuses in the investigated hashing schemes. A countermeasure of randomized key initialization is discussed to avoid key reuse and strengthen the security of robust image hashing.},
	keywords = {authentication;image, authentication;randomized, coding;image, compact, comparison;multimedia, content;image, data;, distance;watermarking;image, fingerprinting;image, hashing;unicity, image, initialization;robust, key, of, representation;randomized, representation;security, similarity},
	isbn = {1556-6013},
	doi = {10.1109/TIFS.2007.902260},
	author = {Mao,Yinian and M. Wu}
}
@article {15277,
	title = {A unified model explaining the offsets of overlapping and near-overlapping prokaryotic genes},
	journal = {Molecular biology and evolution},
	volume = {24},
	year = {2007},
	month = {2007///},
	pages = {2091 - 2091},
	author = {Kingsford, Carl and Delcher,A. L and Salzberg,S. L}
}
@article {15827,
	title = {Universal Duality in Conic Convex Optimization},
	journal = {Mathematical Programming A},
	volume = {109},
	year = {2007},
	month = {2007///},
	pages = {69 - 88},
	abstract = {Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both problems are infeasible, in which case the optimal values are +$\infty$ and -$\infty$. In contrast, for optimization problems over nonpolyhedral convex cones, a nonzero duality gap can exist when either the primal or the dual is feasible.For a pair of dual conic convex programs, we provide simple conditions on the {\textquoteleft}{\textquoteleft}constraint matrices{\textquoteright}{\textquoteright} and cone under which the duality gap is zero for every choice of linear objective function and constraint right-hand side. We refer to this property as {\textquoteleft}{\textquoteleft}universal duality{\textquoteright}{\textquoteright}. Our conditions possess the following properties: (i) they are necessary and sufficient, in the sense that if (and only if) they do not hold, the duality gap is nonzero for some linear objective function and constraint right-hand side; (ii) they are metrically and topologically generic; and (iii) they can be verified by solving a single conic convex program. We relate to universal duality the fact that the feasible sets of a primal convex program and its dual cannot both be bounded, unless they are both empty. Finally we illustrate our theory on a class of semidefinite programs that appear in control theory applications.
},
	author = {Schurr,Simon P. and Tits,Andr{\'e} and O{\textquoteright}Leary, Dianne P.}
}
@article {17458,
	title = {Universal Usability: A grand challenge for HCI},
	journal = {Universal usability: Designing computer interfaces for user diversity},
	year = {2007},
	month = {2007///},
	author = {Shneiderman, Ben}
}
@article {15079,
	title = {Universally composable multi-party computation using tamper-proof hardware},
	journal = {Advances in Cryptology-EUROCRYPT 2007},
	year = {2007},
	month = {2007///},
	pages = {115 - 128},
	abstract = {Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the {\textquotedblleft}plain{\textquotedblright} model, secure computation of general functionalities without an honest majority is impossible. This has prompted researchers to propose various {\textquotedblleft}setup assumptions{\textquotedblright} with which to augment the bare UC framework in order to bypass this severe negative result. Existing setup assumptions seem to inherently require some trusted party (or parties) to initialize the setup in the real world.We propose a new setup assumption {\textemdash} more along the lines of a physical assumption regarding the existence of tamper-proof hardware {\textemdash} which also suffices to circumvent the impossibility result mentioned above. We suggest this assumption as potentially leading to an approach that might alleviate the need for trusted parties, and compare our assumption to those proposed previously.
},
	doi = {10.1007/978-3-540-72540-4_7},
	author = {Katz, Jonathan}
}
@conference {15141,
	title = {Universally-composable two-party computation in two rounds},
	booktitle = {Proceedings of the 27th annual international cryptology conference on Advances in cryptology},
	series = {CRYPTO{\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {111 - 129},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Berlin, Heidelberg},
	abstract = {Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show here a universally-composable (UC) protocol (in the common reference string model) for two-party computation of any functionality, where both parties receive output, using only two rounds. (This assumes honest parties are allowed to transmit messages simultaneously in any given round; we obtain a three-round protocol when parties are required to alternate messages.) Our results match the obvious lower bounds for the round complexity of secure two-party computation under any reasonable definition of security, regardless of what setup is used. Thus, our results establish that secure two-party computation can be obtained under a commonly-used setup assumption with maximal security (i.e., security under general composition) in a minimal number of rounds. To give but one example of the power of our general result, we observe that as an almost immediate corollary we obtain a two-round UC blind signature scheme, matching a result by Fischlin at Crypto 2006 (though, in contrast to Fischlin, we use specific number-theoretic assumptions).},
	isbn = {3-540-74142-9, 978-3-540-74142-8},
	url = {http://dl.acm.org/citation.cfm?id=1777777.1777788},
	author = {Horvitz,Omer and Katz, Jonathan}
}
@conference {18611,
	title = {Usage-based dhcp lease time optimization},
	booktitle = {Proceedings of the 7th ACM SIGCOMM conference on Internet measurement},
	series = {IMC {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {71 - 76},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {The Dynamic Host Configuration Protocol (DHCP) is used to dynamically allocate address space to hosts on a local area network. Despite its widespread usage, few studies exist on DHCP usage patterns, and even less is known about the importance of setting the lease time (the time that a client retains ownership over some IP address) to an appropriate value. Lease time can greatly affect the tradeoff between address space utilization and the number of both renewal messages and client session expirations. In this paper, using a DHCP trace for 5 weekdays from the Georgia Tech campus network, we present the largest known study of DHCP utilization. We also explore how various strategies for setting lease times can dramatically reduce the number of renewals and expirations without prohibitively increasing address space utilization.},
	keywords = {dhcp, network management, OPTIMIZATION, usage},
	isbn = {978-1-59593-908-1},
	doi = {10.1145/1298306.1298315},
	url = {http://doi.acm.org/10.1145/1298306.1298315},
	author = {Khadilkar,Manas and Feamster, Nick and Sanders,Matt and Clark,Russ}
}
@article {15289,
	title = {User simulations for evaluating answers to question series},
	journal = {Information Processing \& Management},
	volume = {43},
	year = {2007},
	month = {2007/05//},
	pages = {717 - 729},
	abstract = {Recently, question series have become one focus of research in question answering. These series are comprised of individual factoid, list, and {\textquotedblleft}other{\textquotedblright} questions organized around a central topic, and represent abstractions of user{\textendash}system dialogs. Existing evaluation methodologies have yet to catch up with this richer task model, as they fail to take into account contextual dependencies and different user behaviors. This paper presents a novel simulation-based methodology for evaluating answers to question series that addresses some of these shortcomings. Using this methodology, we examine two different behavior models: a {\textquotedblleft}QA-styled{\textquotedblright} user and an {\textquotedblleft}IR-styled{\textquotedblright} user. Results suggest that an off-the-shelf document retrieval system is competitive with state-of-the-art QA systems in this task. Advantages and limitations of evaluations based on user simulations are also discussed.},
	keywords = {Evaluation, Question answering, User simulations},
	isbn = {0306-4573},
	doi = {10.1016/j.ipm.2006.06.006},
	url = {http://www.sciencedirect.com/science/article/pii/S0306457306000963},
	author = {Jimmy Lin}
}
@article {16846,
	title = {Using a distributed quadtree index in peer-to-peer networks},
	journal = {The VLDB Journal},
	volume = {16},
	year = {2007},
	month = {2007/04//},
	pages = {165 - 178},
	abstract = {Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries and retrieve complete files. However, future more data intensive applications, such as P2P auction networks, P2P job-search networks, P2P multiplayer games, will require the capability to respond to more complex queries such as range queries involving numerous data types including those that have a spatial component. In this paper, a distributed quadtree index that adapts the MX-CIF quadtree is described that enables more powerful accesses to data in P2P networks. This index has been implemented for various prototype P2P applications and results of experiments are presented. Our index is easy to use, scalable, and exhibits good load-balancing properties. Similar indices can be constructed for various multidimensional data types with both spatial and non-spatial components.},
	keywords = {Distributed data structures, peer-to-peer networks, quadtrees, spatial data structures},
	isbn = {1066-8888},
	doi = {10.1007/s00778-005-0001-y},
	url = {http://dx.doi.org/10.1007/s00778-005-0001-y},
	author = {Tanin,Egemen and Harwood,Aaron and Samet, Hanan}
}
@conference {16449,
	title = {Using annotations from controlled vocabularies to find meaningful associations},
	booktitle = {Proceedings of the 4th international conference on Data integration in the life sciences},
	year = {2007},
	month = {2007///},
	pages = {247 - 263},
	author = {Lee,W. J and Raschid, Louiqa and Srinivasan,P. and Shah,N. and Rubin,D. and Noy,N.}
}
@article {17893,
	title = {Using Content-Addressable Networks for Load Balancing in Desktop Grids},
	volume = {UMIACS-TR-2007-16},
	year = {2007},
	month = {2007/03/29/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {Desktop grids combine Peer-to-Peer and Grid computing techniques to improvethe robustness, reliability and scalability of job execution
infrastructures.
However, efficiently matching incoming jobs to available system resources
and achieving good load balance in a fully decentralized and heterogeneous
computing environment is a challenging problem.
In this paper, we extend our prior work with a new decentralized algorithm
for maintaining approximate global load information, and a job pushing
mechanism that uses the global information to push jobs towards
underutilized portions of the system.
The resulting system more effectively balances load and improves overall
system throughput.
Through a comparative analysis of experimental results across different
system configurations and job profiles, performed via simulation, we show
that our system can reliably execute Grid applications on a distributed set
of resources both with low cost and with good load balance.
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu//handle/1903/4355},
	author = {Kim,Jik-Soo and Keleher,Peter and Marsh,Michael and Bhattacharjee, Bobby and Sussman, Alan}
}
@conference {15469,
	title = {Using GUI Run-Time State as Feedback to Generate Test Cases},
	booktitle = {Software Engineering, 2007. ICSE 2007. 29th International Conference on},
	year = {2007},
	month = {2007/05//},
	pages = {396 - 405},
	abstract = {This paper presents a new automated model-driven technique to generate test cases by using feedback from the execution of a "seed test suite" on an application under test (AUT). The test cases in the seed suite are designed to be generated automatically and executed very quickly. During their execution, feedback obtained from the AUT{\textquoteright}s run-time state is used to generate new, "improved" test cases. The new test cases subsequently become part of the seed suite. This "anytime technique" continues iteratively, generating and executing additional test cases until resources are exhausted or testing goals have been met. The feedback-based technique is demonstrated for automated testing of graphical user interfaces (GUIs). An existing abstract model of the GUI is used to automatically generate the seed test suite. It is executed; during its execution, state changes in the GUI pinpoint important relationships between GUI events, which evolve the model and help to generate new test cases. Together with a reverse- engineering algorithm used to obtain the initial model and seed suite, the feedback-based technique yields a fully automatic, end-to-end GUI testing process. A feasibility study on four large fielded open-source software (OSS) applications demonstrates that this process is able to significantly improve existing techniques and help identify/report serious problems in the OSS. In response, these problems have been fixed by the developers of the OSS in subsequent versions.},
	keywords = {application under test, automated test case generation, Feedback, feedback-based technique, Graphical user interfaces, GUI run-time state, model-driven technique, open-source software, program testing, public domain software, reverse engineering, reverse-engineering algorithm, seed test suite},
	doi = {10.1109/ICSE.2007.94},
	author = {Xun Yuan and Memon, Atif M.}
}
@conference {13478,
	title = {Using multiresolution learning for transfer in image classification},
	booktitle = {Proceedings of the 22nd national conference on Artificial intelligence - Volume 2},
	series = {AAAI{\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {1852 - 1853},
	publisher = {AAAI Press},
	organization = {AAAI Press},
	abstract = {Our work explores the transfer of knowledge at multiple levels of abstraction to improve learning. By exploiting the similarities between objects at various levels of detail, multiresolution learning can facilitate transfer between image classification tasks.We extract features from images at multiple levels of resolution, then use these features to create models at different resolutions. Upon receiving a new task, the closest-matching stored model can be generalized (adapted to the appropriate resolution) and transferred to the new task.
},
	isbn = {978-1-57735-323-2},
	url = {http://dl.acm.org/citation.cfm?id=1619797.1619927},
	author = {Eaton,Eric and desJardins, Marie and Stevenson,John}
}
@conference {13889,
	title = {Using paraphrases for parameter tuning in statistical machine translation},
	booktitle = {Proceedings of the Second Workshop on Statistical Machine Translation},
	series = {StatMT {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {120 - 127},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {Most state-of-the-art statistical machine translation systems use log-linear models, which are defined in terms of hypothesis features and weights for those features. It is standard to tune the feature weights in order to maximize a translation quality metric, using held-out test sentences and their corresponding reference translations. However, obtaining reference translations is expensive. In this paper, we introduce a new full-sentence paraphrase technique, based on English-to-English decoding with an MT system, and we demonstrate that the resulting paraphrases can be used to drastically reduce the number of human reference translations needed for parameter tuning, without a significant decrease in translation quality.},
	url = {http://dl.acm.org/citation.cfm?id=1626355.1626371},
	author = {Madnani,Nitin and Ayan,Necip Fazil and Resnik, Philip and Dorr, Bonnie J}
}
@conference {16662,
	title = {Using paraphrases for parameter tuning in statistical machine translation},
	booktitle = {Proceedings of the Second Workshop on Statistical Machine Translation},
	year = {2007},
	month = {2007///},
	pages = {120 - 127},
	author = {Madnani,N. and Ayan,N.F. and Resnik, Philip and Dorr, Bonnie J}
}
@conference {14846,
	title = {Using Stereo Matching for 2-D Face Recognition Across Pose},
	booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on},
	year = {2007},
	month = {2007/06//},
	pages = {1 - 8},
	abstract = {We propose using stereo matching for 2-D face recognition across pose. We match one 2-D query image to one 2-D gallery image without performing 3-D reconstruction. Then the cost of this matching is used to evaluate the similarity of the two images. We show that this cost is robust to pose variations. To illustrate this idea we built a face recognition system on top of a dynamic programming stereo matching algorithm. The method works well even when the epipolar lines we use do not exactly fit the viewpoints. We have tested our approach on the PIE dataset. In all the experiments, our method demonstrates effective performance compared with other algorithms.},
	keywords = {2D, estimation;stereo, Face, gallery, image, image;2D, image;dynamic, matching;dynamic, matching;pose, processing;, programming;face, programming;pose, query, recognition;2D, recognition;image, variation;stereo},
	doi = {10.1109/CVPR.2007.383111},
	author = {Castillo,C. D and Jacobs, David W.}
}
@conference {18766,
	title = {Using virtual demonstrations for creating multi-media training instructions},
	year = {2007},
	month = {2007///},
	abstract = {Often generating training instructions for virtual environments is a long and tedious process. In thispaper, we discuss the development of a virtual environment (VE) instruction generating tool called
Virtual Author which is the main component of the Virtual Training Studio (VTS). VTS is a virtual
environment-based training system that provides instructors with a tool to create training instructions
and allows trainees to learn assembly operations in a personal virtual environment. The Virtual
Author tool is designed to allow an instructor to perform virtual demonstrations using CAD models
in the virtual environment in order to quickly generate VE-based training instructions for use in VTS.
This paper describes the algorithms used to carry out motion smoothening of instructor{\textquoteright}s actions,
automated text instruction generation based on part and assembly motions, and extraction of
alignment constraints from 3D CAD models to support instruction generation. We also present
examples to illustrate how the use of the Virtual Author tool leads to a significant reduction in the
training instruction generation time.
},
	url = {http://www.cadanda.com/CAD_4_1-4__11.PDF},
	author = {Schwartz,M. and Gupta,S.K. and Anand,D. K. and Brough,J. E. and Kavetsky,R.}
}
@book {12621,
	title = {Unconstrained face recognition},
	year = {2006},
	month = {2006///},
	publisher = {Springer Science \& Business},
	organization = {Springer Science \& Business},
	abstract = {Face recognition has been actively studied over the past decade and continues to be a big research challenge. Just recently, researchers have begun to investigate face recognition under unconstrained conditions. Unconstrained Face Recognition provides a comprehensive review of this biometric, especially face recognition from video, assembling a collection of novel approaches that are able to recognize human faces under various unconstrained situations. The underlying basis of these approaches is that, unlike conventional face recognition algorithms, they exploit the inherent characteristics of the unconstrained situation and thus improve the recognition performance when compared with conventional algorithms.Unconstrained Face Recognition is structured to meet the needs of a professional audience of researchers and practitioners in industry. This volume is also suitable for advanced-level students in computer science.},
	keywords = {Computer science, Computer vision, Computers / Computer Graphics, Computers / Computer Science, Computers / Computer Vision \& Pattern Recognition, Computers / General, Computers / Image Processing, Computers / Information Technology, Computers / Information Theory, Computers / Interactive \& Multimedia, Computers / Security / Cryptography, Computers / User Interfaces, Data encryption (Computer science), Data structures (Computer science), Electronic books, Human face recognition (Computer science), IMAGE PROCESSING, Image processing - Digital techniques, multimedia systems, Optical pattern recognition, Science / Life Sciences / Biology},
	isbn = {9780387264073},
	author = {Zhou,S. Kevin and Chellapa, Rama and Zhao,Wenyi}
}
@conference {18610,
	title = {Understanding the network-level behavior of spammers},
	booktitle = {Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications},
	series = {SIGCOMM {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {291 - 302},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper studies the network-level behavior of spammers, including: IP address ranges that send the most spam, common spamming modes (e.g., BGP route hijacking, bots), how persistent across time each spamming host is, and characteristics of spamming botnets. We try to answer these questions by analyzing a 17-month trace of over 10 million spam messages collected at an Internet "spam sinkhole", and by correlating this data with the results of IP-based blacklist lookups, passive TCP fingerprinting information, routing information, and botnet "command and control" traces.We find that most spam is being sent from a few regions of IP address space, and that spammers appear to be using transient "bots" that send only a few pieces of email over very short periods of time. Finally, a small, yet non-negligible, amount of spam is received from IP addresses that correspond to short-lived BGP routes, typically for hijacked prefixes. These trends suggest that developing algorithms to identify botnet membership, filtering email messages based on network-level properties (which are less variable than email content), and improving the security of the Internet routing infrastructure, may prove to be extremely effective for combating spam.},
	keywords = {BGP, botnet, network management, Security, spam},
	isbn = {1-59593-308-5},
	doi = {10.1145/1159913.1159947},
	url = {http://doi.acm.org/10.1145/1159913.1159947},
	author = {Ramachandran,Anirudh and Feamster, Nick}
}
@article {11981,
	title = {Understanding visuo-motor primitives for motion synthesis and analysis},
	journal = {Computer Animation and Virtual Worlds},
	volume = {17},
	year = {2006},
	month = {2006/07/01/},
	pages = {207 - 217},
	abstract = {The problem addressed in this paper concerns the representation of human movement in terms of atomic visuo-motor primitives considering both generation and perception of movement. We introduce the concept of kinetology, the phonology of human movement, and five principles on which such a system should be based: compactness, view-invariance, reproducibility, selectivity, and reconstructivity. We propose visuo-motor primitives and demonstrate their kinetological properties. Further evaluation is accomplished with experiments on compression and decompression. Our long-term goal is to demonstrate that action has a space characterized by a visuo-motor language. Copyright {\textcopyright} 2006 John Wiley \& Sons, Ltd.},
	keywords = {compression, motion synthesis, visuo-motor primitives},
	isbn = {1546-427X},
	doi = {10.1002/cav.124},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/cav.124/abstract},
	author = {Guerra-Filho,Gutemberg and Aloimonos, J.}
}
@conference {16869,
	title = {Using image similarity and asymmetry to detect breast cancer},
	booktitle = {Proc. of SPIE Vol},
	volume = {6144},
	year = {2006},
	month = {2006///},
	pages = {61441S{\textendash}1 - 61441S{\textendash}1},
	abstract = {Radiologists can use the differences between the left and right breasts, or asymmetry, in mammograms to helpdetect certain malignant breast cancers. An image similarity method is introduced to make use of this knowledge
base to recognize breast cancer. Image similarity is determined using a contextual and then a spatial comparison.
The mammograms are filtered to find the most contextually significant points, and then the resulting point set
is analyzed for spatial similarity. We develop the analysis through a combination of modeling and supervised
learning of model parameters. This process correctly classifies mammograms 80\% of the time and thus asymmetry
is a measure that can play an important role in significantly improving computer-aided breast cancer detection
systems.
},
	author = {Tahmoush,D. and Samet, Hanan}
}
@article {17518,
	title = {Using PlanetLab for network research},
	journal = {ACM SIGOPS Operating Systems Review},
	volume = {40},
	year = {2006},
	month = {2006/01/01/},
	pages = {17 - 17},
	isbn = {01635980},
	doi = {10.1145/1113361.1113368},
	url = {http://dl.acm.org/citation.cfm?id=1113368},
	author = {Spring, Neil and Peterson,Larry and Bavier,Andy and Pait,Vivek}
}
@article {17480,
	title = {Using rhythms of relationships to understand e-mail archives},
	journal = {Journal of the American Society for Information Science and Technology},
	volume = {57},
	year = {2006},
	month = {2006/12/01/},
	pages = {1936 - 1948},
	abstract = {Due to e-mail{\textquoteright}s ubiquitous nature, millions of users are intimate with the technology; however, most users are only familiar with managing their own e-mail, which is an inherently different task from exploring an e-mail archive. Historians and social scientists believe that e-mail archives are important artifacts for understanding the individuals and communities they represent. To understand the conversations evidenced in an archive, context is needed. In this article, we present a new way to gain this necessary context: analyzing the temporal rhythms of social relationships. We provide methods for constructing meaningful rhythms from the e-mail headers by identifying relationships and interpreting their attributes. With these visualization techniques, e-mail archive explorers can uncover insights that may have been otherwise hidden in the archive. We apply our methods to an individual{\textquoteright}s 15-year e-mail archive, which consists of about 45,000 messages and over 4,000 relationships.},
	isbn = {1532-2890},
	doi = {10.1002/asi.20387},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/asi.20387/abstract},
	author = {Perer,Adam and Shneiderman, Ben and Oard, Douglas}
}
@conference {12657,
	title = {UMD Experiments with FRGC Data},
	booktitle = {Computer Vision and Pattern Recognition - Workshops, 2005. CVPR Workshops. IEEE Computer Society Conference on},
	year = {2005},
	month = {2005/06//},
	pages = {172 - 172},
	abstract = {Although significant work has been done in the field of face recognition, the performance of state-of-the art face recognition algorithms is not good enough to be effective in operational systems. Though most algorithms work well for controlled images, they are quite susceptible to changes in illumination and pose. Face Recognition Grand Challenge (FRGC) is an effort to examine such issues to suitably guide future research in the area. This paper describes the efforts made at UMD in this direction. We present our results on several experiments suggested in FRGC. We believe that though pattern classification techniques play an extremely significant role in automatic face recognition under controlled conditions, physical modeling is required to generalize across varying situations. Accordingly, we describe a generative approach to recognize faces across varying illumination. Unlike most current methods, our method does not ignore shadows. Instead we use them to our benefit by modeling attached shadows in our formulation.},
	doi = {10.1109/CVPR.2005.586},
	author = {Aggarwal,G. and Biswas,S. and Chellapa, Rama}
}
@article {13881,
	title = {Umd/bbn at mse2005},
	journal = {Proceedings of the MSE2005 track of the Association for Computational Linguistics Workshop on Intrinsic and Extrinsic Evaluation Meatures for MT and/or Summarization, Ann Arbor, MI},
	year = {2005},
	month = {2005///},
	abstract = {We implemented an initial applicationof a sentence-trimming approach (Trim-
mer) to the problem of multi-document
summarization in the MSE2005 task.
Sentence trimming was incorporated
into a feature-based summarization sys-
tem, called Multi-Document Trimmer
(MDT), by using sentence trimming as
both a pre-processing stage and a fea-
ture for sentence ranking. We demon-
strate that we were able to port Trimmer
easily to this new problem, although the
impact of sentence trimming was min-
imal compared to other features used in
the system. The performance of our sys-
tem in the official MSE2005 task was
around the middle of the pack (16 out of
27). After some minor bug fixes and a
simple correction (dateline removal) we
obtained an improvement on a post-hoc
run on the test data.
},
	author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Schwartz,R.}
}
@article {17448,
	title = {Understanding Clusters in Multidimensional Spaces: Making Meaning by Combining Insights from Coordinated Views of Domain Knowledge (2004)},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {Cluster analysis of multidimensional data is widely used in many research areas including financial, economical, sociological, and biological analyses. Finding natural subclasses in a data set not only reveals interesting patterns but also serves as a basis for further analyses. One of the troubles with cluster analysis is that evaluating how interesting a clustering result is to researchers is subjective, application-dependent, and even difficult to measure. This problem generally gets worse as dimensionality and the number of items grows. The remedy is to enable researchers to apply domain knowledge to facilitate insight about the significance of the clustering result. This article presents a way to better understand a clustering result by combining insights from two interactively coordinated visual displays of domain knowledge. The first is a parallel coordinates view powered by a direct-manipulation search. The second is a domain knowledge view containing a well-understood and meaningful tabular or hierarchical information for the same data set. Our examples depend on hierarchical clustering of gene expression data, coordinated with a parallel coordinates view and with the gene annotation and gene ontology.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6512},
	author = {Seo,Jinwook and Shneiderman, Ben}
}
@conference {14752,
	title = {Understanding source code evolution using abstract syntax tree matching},
	booktitle = {Proceedings of the 2005 international workshop on Mining software repositories},
	series = {MSR {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {1 - 5},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Mining software repositories at the source code level can provide a greater understanding of how software evolves. We present a tool for quickly comparing the source code of different versions of a C program. The approach is based on partial abstract syntax tree matching, and can track simple changes to global variables, types and functions. These changes can characterize aspects of software evolution useful for answering higher level questions. In particular, we consider how they could be used to inform the design of a dynamic software updating system. We report results based on measurements of various versions of popular open source programs. including BIND, OpenSSH, Apache, Vsftpd and the Linux kernel.},
	keywords = {abstract syntax trees, software evolution, source code analysis},
	isbn = {1-59593-123-6},
	doi = {10.1145/1082983.1083143},
	url = {http://doi.acm.org/10.1145/1082983.1083143},
	author = {Neamtiu,Iulian and Foster, Jeffrey S. and Hicks, Michael W.}
}
@article {17456,
	title = {Universal Usability as a Stimulus to Advanced Interface Design (2001)},
	year = {2005},
	month = {2005///},
	abstract = {The desire to make computing available to broader populations has historically been a motivation for research and innovation that led to new breakthroughs in usability. Menus, graphical user interfaces, and the World-Wide Web, are examples of innovative technological solutions that have arisen out of the challenge of bringing larger and more diverse groups of users into the world of computing. Universal usability is the latest such challenge: In order to build systems that are universally usable, designers must account for technology variety, user diversity, and gaps in user knowledge. These issues are particularly challenging and important in the context of increasing the usability of the World-Wide-Web. To raise awareness, we urge web designers to provide universal usability statements, to provide users with useful information about the usability of their sites. These statements can inform users and thereby reduce frustration and confusion. Further steps toward universal usability might be achieved through research aimed at developing tools that would encourage or promote usability. We close with five proposals for future research.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6485},
	author = {Shneiderman, Ben and Hochheiser,Harry}
}
@article {15087,
	title = {Universally composable password-based key exchange},
	journal = {Advances in Cryptology{\textendash}Eurocrypt 2005},
	year = {2005},
	month = {2005///},
	pages = {557 - 557},
	abstract = {We propose and realize a definition of security for password-based key exchange within the framework of universally composable (UC) security, thus providing security guarantees under arbitrary composition with other protocols. In addition, our definition captures some aspects of the problem that were not adequately addressed by most prior notions. For instance, it does not assume any underlying probability distribution on passwords, nor does it assume independence between passwords chosen by different parties. We also formulate a definition of password-based secure channels, and show that such a definition is achievable given password-based key exchange.Our protocol realizing the new definition of password-based key exchange is in the common reference string model and relies on standard number-theoretic assumptions. The components of our protocol can be instantiated to give a relatively efficient solution which is conceivably usable in practice. We also show that it is impossible to satisfy our definition in the {\textquotedblleft}plain{\textquotedblright} model (e.g., without a common reference string).
},
	doi = {10.1007/11426639_24},
	author = {Canetti,R. and Halevi,S. and Katz, Jonathan and Lindell,Y. and MacKenzie,P.}
}
@article {17913,
	title = {Unsupervised learning applied to progressive compression of time-dependent geometry},
	journal = {Computers \& Graphics},
	volume = {29},
	year = {2005},
	month = {2005/06//},
	pages = {451 - 461},
	abstract = {We propose a new approach to progressively compress time-dependent geometry. Our approach exploits correlations in motion vectors to achieve better compression. We use unsupervised learning techniques to detect good clusters of motion vectors. For each detected cluster, we build a hierarchy of motion vectors using pairwise agglomerative clustering, and succinctly encode the hierarchy using entropy encoding. We demonstrate our approach on a client{\textendash}server system that we have built for downloading time-dependent geometry.},
	keywords = {Clustering algorithms, Distributed/network graphics, pattern recognition},
	isbn = {0097-8493},
	doi = {10.1016/j.cag.2005.03.021},
	url = {http://www.sciencedirect.com/science/article/pii/S009784930500052X},
	author = {Baby,Thomas and Kim,Youngmin and Varshney, Amitabh}
}
@conference {13685,
	title = {Unwarping Images of Curved Documents Using Global Shape Optimization},
	booktitle = {Proc. Fist International Workshop on Camera-based Document Analysis and Recognition},
	year = {2005},
	month = {2005///},
	pages = {25 - 29},
	author = {Liang,Jian and DeMenthon,Daniel and David Doermann}
}
@article {17465,
	title = {User Frustration with Technology in the Workplace (2004)},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {When hard to use computers cause users to become frustrated, it can affect workplace productivity, user mood, and interactions with other co-workers. Previous research has examined the frustration that graduate students and their families face in using computers. To learn more about the causes and effects of user frustration with computers in the workplace, we collected modified time diaries from 50 workplace users, who spent an average of 5.1 hours on the computer. In this experiment, users reported wasting on average, 42-43\% of their time on the computer due to frustrating experiences. The causes of the frustrating experiences, the time lost due to the frustrating experiences, and the effects of the frustrating experiences on the mood of the users are discussed in this paper. Implications for designers, managers, users, information technology staff, and policymakers are discussed.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6515},
	author = {Lazar,Jonathan and Jones,Adam and Bessiere,Katie and Ceaparu,Irina and Shneiderman, Ben}
}
@conference {16601,
	title = {Using aggregate motion in multi-agent teams to solve search and transport problems},
	booktitle = {Swarm Intelligence Symposium, 2005. SIS 2005. Proceedings 2005 IEEE},
	year = {2005},
	month = {2005///},
	pages = {373 - 380},
	author = {RodrIGuez,A. and Reggia, James A.}
}
@article {17476,
	title = {Using Categorical Information in Multidimensional Data Sets: Interactive Partition and Cluster Comparison},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {Multidimensional data sets often include categorical information. When most columns have categorical information, clustering the data set by similarity of categorical values can reveal interesting patterns in the data set. However, when the data set includes only a small number (one or two) of categorical columns, the categorical information is probably more useful as a way to partition the data set. For example, researchers might be interested in gene expression data for healthy vs. diseased patients or stock performance for common, preferred, or convertible shares. For these cases, we present a novel way to utilize the categorical information together with clustering algorithms. Instead of incorporating categorical information into the clustering process, we can partition the data set according to categorical information. Clustering is then performed with each subset to generate two or more clustering results, each of which is homogeneous (i.e. only includes the same categorical value for the categorical column). By comparing the partitioned clustering results, users can get meaningful insights into the data set: users can identify an interesting group of items that are differentially/similarly expressed in two different homogeneous partitions. The partition can be done in two different directions: (1) by rows if categorical information is available for each column (e.g. some columns are from disease samples and other columns are from healthy samples) or (2) by a column if a column contains categorical information (e.g. a column represents a categorical attribute such as colors or sex). We designed and implemented an interface to facilitate this interactive partition-based clustering results comparison. Coordination between clustering results displays and comparison results overview enables users to identify interesting clusters, and a simple grid display clearly reveals correspondence between two clusters.},
	keywords = {Societal Infrastructure Systems},
	url = {http://drum.lib.umd.edu/handle/1903/6568},
	author = {Seo,Jinwook and Shneiderman, Ben}
}
@conference {13687,
	title = {Using Computer Vision to Detect Web Browser Display Errors},
	booktitle = {3rd Web Document Analysis Workshop (on ICDAR 2005)},
	year = {2005},
	month = {2005/07//},
	pages = {5 - 9},
	abstract = {As the functionality and complexity of the WWW continues to grow so does the need for WWW quality assurance and testing. Although there have been numerous approaches to automated Web testing, existing techniques analyze primarily textual information, and the final judgment on correctness of layout is via human observation. The motivation of this paper is to employ computer vision techniques to detect Web display errors. To do this, we analyze images of the rendered pages rather than the HTML to discover errors. Our approach includes page segmentation, dynamic matching and outlier identification. We show that the approach successfully detects layout errors in the Opera browser on Microsoft Websites, while minimizing false alarms.},
	author = {Liu,Xu and David Doermann}
}
@conference {18878,
	title = {Using domain-configurable search control for probabilistic planning},
	volume = {20},
	year = {2005},
	month = {2005///},
	pages = {1169 - 1169},
	abstract = {We describe how to improve the performance of MDP planning algorithms by modifying them to use the search-control mechanisms of planners such as TLPlan, SHOP2, and TALplanner. In our experiments, modified versions of RTDP, LRTDP, and Value Iteration were ex- ponentially faster than the original algorithms. On the largest problems the original algorithms could solve, the modified ones were about 10,000 times faster. On another set of problems whose state spaces were more than 14,000 times larger than the original algorithms could solve, the modified algorithms took only about 1/3 second.},
	url = {http://www.aaai.org/Papers/AAAI/2005/AAAI05-185.pdf},
	author = {Kuter,U. and Nau, Dana S.}
}
@conference {14785,
	title = {Using Dynamic Tracing Sampling to Measure Long Running Programs},
	booktitle = {Proceedings of the 2005 ACM/IEEE conference on Supercomputing},
	series = {SC {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {59{\textendash} - 59{\textendash}},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	abstract = {Detailed cache simulation can be useful to both system developers and application writers to understand an application{\textquoteright}s performance. However, measuring long running programs can be extremely slow. In this paper we present a technique to use dynamic sampling of trace snippets throughout an application{\textquoteright}s execution. We demonstrate that our approach improves accuracy compared to sampling a few timesteps at the beginning of execution by judiciously choosing the frequency, as well as the points in the control flow, at which samples are collected. Our approach is validated using the SIGMA tracing and simulation framework for the IBM Power family of processors.},
	keywords = {data communications, design, experimentation, measurement, performance, tracing},
	isbn = {1-59593-061-2},
	doi = {http://dx.doi.org/10.1109/SC.2005.77},
	url = {http://dx.doi.org/10.1109/SC.2005.77},
	author = {Odom, Jeffrey and Hollingsworth, Jeffrey K and DeRose,Luiz and Ekanadham, Kattamuri and Sbaraglia, Simone}
}
@article {12431,
	title = {Using Iterative Strategies for Aligning Attributed Points in Space},
	volume = {ISR-TR-2005-2},
	year = {2005},
	month = {2005///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {Signatures based on shape features are expected to be useful for several similarity assessment applications. Such signatures can extract the relevant shape information needed for similarity assessment and ignore the shape information not needed for a particular application. <p> Since different feature-based models are created in different coordinate systems, in order to compute distance between two sets of features, one needs to include geometric transformations for aligning features. Optimal alignment is the alignment that results in the minimum distance between two sets of features. In general, features can be viewed as attributed points in space. Hence, we need to develop techniques for aligning attributed points in space. <p> This report introduces iterative strategies for optimally aligning attributed points in space. Iterative strategies presented in this report involve successively applying algorithms that perform alignment under restricted rigid body transformations (e.g., rotations only or translations only) to solve point alignment problems that require higher dimension transformations (e.g., combinations rotations and translations). Our preliminary experimental results show that the idea of using of iterative strategies to solve higher dimension attributed point alignment problems is promising and can be used to perform feature-based shape similarity assessment.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu//handle/1903/6467},
	author = {Cardone, Antonio and Gupta, Satyandra K. and Mount, Dave}
}
@conference {12166,
	title = {Using measurement to build core competencies in software},
	booktitle = {Seminar sponsored by Data and Analysis Center for Software},
	year = {2005},
	month = {2005///},
	author = {Basili, Victor R.}
}
@inbook {18726,
	title = {Using NMR Spectroscopy to Monitor Ubiquitin Chain Conformation and Interactions with Ubiquitin-Binding Domains},
	booktitle = {Ubiquitin and Protein Degradation, Part B},
	volume = {Volume 399},
	year = {2005},
	month = {2005///},
	pages = {177 - 192},
	publisher = {Academic Press},
	organization = {Academic Press},
	abstract = {Polyubiquitin (polyUb) chains function as signaling molecules that mediate a diverse set of cellular events. The outcome of polyubiquitination depends on the specific linkage between Ub moieties in the chain, and differently linked chains function as distinct intracellular signals. Although an increasing number of Ub-binding proteins that transmit the regulatory information conferred by (poly)ubiquitination have been identified, the molecular mechanisms of linkage-specific signaling and recognition still remain to be understood. Knowledge of the chain structure is expected to provide insights into the basis of diversity in polyUb signaling. Here we describe several NMR approaches aimed at determining the physiological conformation of polyUb and characterization of the chains{\textquoteright} interactions with ubiquitin-binding proteins.},
	isbn = {0076-6879},
	url = {http://www.sciencedirect.com/science/article/pii/S0076687905990125},
	author = {Varadan,Ranjani and Assfalg,Michael and Fushman, David},
	editor = {Deshaies,Raymond J.}
}
@article {16475,
	title = {Using Non-random Associations for Predicting Latency in WANs},
	journal = {Web Information Systems Engineering {\textendash} WISE 2005},
	year = {2005},
	month = {2005///},
	abstract = {In this paper, we propose a scalable performance management tool for Wide Area Applications. Our objective is to scalably identify non-random associations between pairs of individual Latency Profiles (iLPs) (i.e., latency distributions experienced by clients when connecting to a server) and exploit them in latency prediction. Our approach utilizes Relevance Networks (RNs) to manage tens of thousands of iLPs. Non-random associations between iLPs can be identified by topology-independent measures such as correlation and mutual information. We demonstrate that these non-random associations do indeed have a significant impact in improving the error of latency prediction.},
	doi = {10.1007/11581062_48},
	author = {Raschid, Louiqa and Ye,Q. and Zadorozhny,V. and Gal,A. and Murthy,H.}
}
@conference {13345,
	title = {Using probabilistic models for data management in acquisitional environments},
	booktitle = {Proc. CIDR},
	year = {2005},
	month = {2005///},
	pages = {317 - 328},
	author = {Deshpande, Amol and Guestrin,C. and Madden,S.}
}
@conference {14845,
	title = {Using the inner-distance for classification of articulated shapes},
	booktitle = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on},
	volume = {2},
	year = {2005},
	month = {2005/06//},
	pages = {719 - 726 vol. 2 - 719 - 726 vol. 2},
	abstract = {We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points within the shape silhouette. We show that the inner-distance is articulation insensitive and more effective at capturing complex shapes with part structures than Euclidean distance. To demonstrate this idea, it is used to build a new shape descriptor based on shape contexts. After that, we design a dynamic programming based method for shape matching and comparison. We have tested our approach on a variety of shape databases including an articulated shape dataset, MPEG7 CE-Shape-1, Kimia silhouettes, a Swedish leaf database and a human motion silhouette dataset. In all the experiments, our method demonstrates effective performance compared with other algorithms.},
	keywords = {articulated, CE-Shape-1, classification;, database;, databases;, dataset;, descriptor;, dynamic, human, image, inner-distance;, Kimia, landmark, leaf, matching;, MOTION, MPEG7, points;, programming;, SHAPE, silhouette, silhouette;, Swedish, visual},
	doi = {10.1109/CVPR.2005.362},
	author = {Ling,H. and Jacobs, David W.}
}
@article {18725,
	title = {Ubistatins Inhibit Proteasome-Dependent Degradation by Binding the Ubiquitin Chain},
	journal = {Science},
	volume = {306},
	year = {2004},
	month = {2004/10/01/},
	pages = {117 - 120},
	abstract = {To identify previously unknown small molecules that inhibit cell cycle machinery, we performed a chemical genetic screen in Xenopus extracts. One class of inhibitors, termed ubistatins, blocked cell cycle progression by inhibiting cyclin B proteolysis and inhibited degradation of ubiquitinated Sic1 by purified proteasomes. Ubistatins blocked the binding of ubiquitinated substrates to the proteasome by targeting the ubiquitin-ubiquitin interface of Lys48-linked chains. The same interface is recognized by ubiquitin-chain receptors of the proteasome, indicating that ubistatins act by disrupting a critical protein-protein interaction in the ubiquitin-proteasome system.},
	doi = {10.1126/science.1100946},
	url = {http://www.sciencemag.org/cgi/content/abstract/sci;306/5693/117},
	author = {Verma,Rati and Peters,Noel R. and D{\textquoteright}Onofrio,Mariapina and Tochtrop,Gregory P. and Sakamoto,Kathleen M. and Varadan,Ranjani and Zhang,Mingsheng and Coffino,Philip and Fushman, David and Deshaies,Raymond J. and King,Randall W.}
}
@conference {13210,
	title = {Uncalibrated stereo rectification for automatic 3D surveillance},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {2},
	year = {2004},
	month = {2004/10//},
	pages = {1357 - 1360 Vol.2 - 1357 - 1360 Vol.2},
	abstract = {We describe a stereo rectification method suitable for automatic 3D surveillance. We take advantage of the fact that in a typical urban scene, there is ordinarily a small number of dominant planes. Given two views of the scene, we align a dominant plane in one view with the other. Conjugate epipolar lines between the reference view and plane-aligned image become geometrically identical and can be added to the rectified image pair line by line. Selecting conjugate epipolar lines to cover the whole image is simplified since they are geometrically identical. In addition, the polarities of conjugate epipolar lines are automatically preserved by plane alignment, which simplifies stereo matching.},
	keywords = {3D, AUTOMATIC, conjugate, epipolar, image, lines;, matching;, method;, processing;, rectification, scene;, stereo, surveillance;, uncalibrated, urban},
	doi = {10.1109/ICIP.2004.1419753},
	author = {Lim,S.-N. and Mittal,A. and Davis, Larry S. and Paragios,N.}
}
@article {14271,
	title = {Uncertainty in visual processes predicts geometrical optical illusions},
	journal = {Vision Research},
	volume = {44},
	year = {2004},
	month = {2004/03//},
	pages = {727 - 749},
	abstract = {It is proposed in this paper that many geometrical optical illusions, as well as illusory patterns due to motion signals in line drawings, are due to the statistics of visual computations. The interpretation of image patterns is preceded by a step where image features such as lines, intersections of lines, or local image movement must be derived. However, there are many sources of noise or uncertainty in the formation and processing of images, and they cause problems in the estimation of these features; in particular, they cause bias. As a result, the locations of features are perceived erroneously and the appearance of the patterns is altered. The bias occurs with any visual processing of line features; under average conditions it is not large enough to be noticeable, but illusory patterns are such that the bias is highly pronounced. Thus, the broader message of this paper is that there is a general uncertainty principle which governs the workings of vision systems, and optical illusions are an artifact of this principle.},
	keywords = {Bias, Estimation processes, Motion perception, NOISE, optical illusions},
	isbn = {0042-6989},
	doi = {10.1016/j.visres.2003.09.038},
	url = {http://www.sciencedirect.com/science/article/pii/S0042698903006904},
	author = {Ferm{\"u}ller, Cornelia and Malm,Henrik}
}
@article {14376,
	title = {Understanding tuberculosis epidemiology using structured statistical models},
	journal = {Artificial Intelligence in Medicine},
	volume = {30},
	year = {2004},
	month = {2004/03//},
	pages = {233 - 256},
	abstract = {Molecular epidemiological studies can provide novel insights into the transmission of infectious diseases such as tuberculosis. Typically, risk factors for transmission are identified using traditional hypothesis-driven statistical methods such as logistic regression. However, limitations become apparent in these approaches as the scope of these studies expand to include additional epidemiological and bacterial genomic data. Here we examine the use of Bayesian models to analyze tuberculosis epidemiology. We begin by exploring the use of Bayesian networks (BNs) to identify the distribution of tuberculosis patient attributes (including demographic and clinical attributes). Using existing algorithms for constructing BNs from observational data, we learned a BN from data about tuberculosis patients collected in San Francisco from 1991 to 1999. We verified that the resulting probabilistic models did in fact capture known statistical relationships. Next, we examine the use of newly introduced methods for representing and automatically constructing probabilistic models in structured domains. We use statistical relational models (SRMs) to model distributions over relational domains. SRMs are ideally suited to richly structured epidemiological data. We use a data-driven method to construct a statistical relational model directly from data stored in a relational database. The resulting model reveals the relationships between variables in the data and describes their distribution. We applied this procedure to the data on tuberculosis patients in San Francisco from 1991 to 1999, their Mycobacterium tuberculosis strains, and data on contact investigations. The resulting statistical relational model corroborated previously reported findings and revealed several novel associations. These models illustrate the potential for this approach to reveal relationships within richly structured data that may not be apparent using conventional statistical approaches. We show that Bayesian methods, in particular statistical relational models, are an important tool for understanding infectious disease epidemiology.},
	keywords = {Bayesian networks, epidemiology, Probabilistic and statistical relational models, Tuberculosis},
	isbn = {0933-3657},
	doi = {10.1016/j.artmed.2003.11.003},
	url = {http://www.sciencedirect.com/science/article/pii/S0933365703001337},
	author = {Getoor, Lise and Rhee,Jeanne T and Koller,Daphne and Small,Peter}
}
@conference {19182,
	title = {Unifying artifacts and activities in a visual tool for distributed software development teams},
	booktitle = {26th International Conference on Software Engineering, 2004. ICSE 2004. Proceedings},
	year = {2004},
	month = {2004},
	pages = {387 - 396},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In large projects, software developers struggle with two sources of complexity - the complexity of the code itself, and the complexity of the process of producing it. Both of these concerns have been subjected to considerable research investigation, and tools and techniques have been developed to help manage them. However, these solutions have generally been developed independently, making it difficult to deal with problems that inherently span both dimensions. We describe Augur, a visualization tool that supports distributed software development processes. Augur creates visual representations of both software artifacts and software development activities, and, crucially, allows developers to explore the relationship between them. Augur is designed not for managers, but for the developers participating in the software development process. We discuss some of the early results of informal evaluation with open source software developers. Our experiences to date suggest that combining views of artifacts and activities is both meaningful and valuable to software developers.},
	keywords = {Augur, complexity management, distributed programming, distributed software development teams, open source software developers, program visualisation, Programming, public domain software, software artifacts, software engineering, software tools, visual representations, visual tool, visualization tool},
	isbn = {0-7695-2163-0},
	author = {Jon Froehlich and Dourish,P.}
}
@mastersthesis {14347,
	title = {Unifying Artifacts and Activities in a Visual Tool for Distributed Software Teams THESIS},
	year = {2004},
	month = {2004///},
	school = {UNIVERSITY OF CALIFORNIA},
	author = {Jon Froehlich}
}
@article {12792,
	title = {Unit verification: the CARA experience},
	journal = {International Journal on Software Tools for Technology Transfer (STTT)},
	volume = {5},
	year = {2004},
	month = {2004///},
	pages = {351 - 369},
	author = {Ray,A. and Cleaveland, Rance}
}
@article {17460,
	title = {Universal Usability: Pushing Human-Computer Interaction Research to Empower Every Citizen},
	journal = {Media access: social and psychological dimensions of new technology use},
	year = {2004},
	month = {2004///},
	pages = {255 - 255},
	author = {Shneiderman, Ben}
}
@conference {14817,
	title = {Unobtrusiveness and efficiency in idle cycle stealing for PC grids},
	booktitle = {Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International},
	year = {2004},
	month = {2004/04/26/30},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Summary form only given. Studies have shown that for a significant fraction of the time desktop PCs and workstations are under-utilized. To exploit these idle resources, various desktop/workstation grid systems have been developed. The ultimate goal of such systems is to maximize efficiency of resource usage while maintaining low obtrusiveness to machine owners. To this end, we created a new fine-grain cycle stealing approach and conducted a performance comparison study against the traditional coarse-grain cycle stealing. We developed a prototype of fine-grain cycle stealing, the Linger-Longer system, on a Linux cluster. The experiments on a cluster of desktop Linux PCs with benchmark applications show that, overall, fine-grain cycle stealing can improve efficiency of idle cycle usage by increasing the guest job throughput by 50\% to 70\%, while limiting obtrusiveness with no more than 3\% of host job slowdown.},
	keywords = {Biological system modeling, Computational modeling, Computer science, Computer simulation, Contracts, desktop grid system, fine-grain cycle stealing approach, grid computing, idle cycle stealing, Linger-Longer system, Linux, Linux cluster, microcomputers, PC grids, Personal communication networks, Prototypes, resource allocation, Throughput, workstation clusters, workstation grid systems, Workstations},
	isbn = {0-7695-2132-0},
	doi = {10.1109/IPDPS.2004.1302987},
	author = {Ryu, K. D and Hollingsworth, Jeffrey K}
}
@conference {14461,
	title = {Unsupervised sense disambiguation using bilingual probabilistic models},
	booktitle = {Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics},
	series = {ACL {\textquoteright}04},
	year = {2004},
	month = {2004///},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {We describe two probabilistic models for unsupervised word-sense disambiguation using parallel corpora. The first model, which we call the Sense model, builds on the work of Diab and Resnik (2002) that uses both parallel text and a sense inventory for the target language, and recasts their approach in a probabilistic framework. The second model, which we call the Concept model, is a hierarchical model that uses a concept latent variable to relate different language specific sense labels. We show that both models improve performance on the word sense disambiguation task over previous unsupervised approaches, with the Concept model showing the largest improvement. Furthermore, in learning the Concept model, as a by-product, we learn a sense inventory for the parallel language.},
	doi = {10.3115/1218955.1218992},
	url = {http://dx.doi.org/10.3115/1218955.1218992},
	author = {Bhattacharya,Indrajit and Getoor, Lise and Bengio,Yoshua}
}
@conference {13342,
	title = {Update operations on 3D simplicial decompositions of non-manifold objects},
	booktitle = {Proceedings of the ninth ACM symposium on Solid modeling and applications},
	series = {SM {\textquoteright}04},
	year = {2004},
	month = {2004///},
	pages = {169 - 180},
	publisher = {Eurographics Association},
	organization = {Eurographics Association},
	address = {Aire-la-Ville, Switzerland, Switzerland},
	abstract = {We address the problem of updating non-manifold mixed-dimensional objects, described by three-dimensional simplicial complexes embedded in 3D Euclidean space. We consider two local update operations, edge collapse and vertex split, which are the most common operations performed for simplifying a simplicial complex. We examine the effect of such operations on a 3D simplicial complex, and we describe algorithms for edge collapse and vertex split on a compact representation of a 3D simplicial complex, that we call the Non-Manifold Indexed data structure with Adjacencies (NMIA). We also discuss how to encode the information needed for performing a vertex split and an edge collapse on a 3D simplicial complex. The encoding of such information together with the algorithms for updating the NMIA data structure form the basis for defining progressive as well as multi-resolution representations for objects described by 3D simplicial complexes and for extracting variable-resolution object descriptions.},
	isbn = {3-905673-55-X},
	url = {http://dl.acm.org/citation.cfm?id=1217875.1217900},
	author = {De Floriani, Leila and Hui,Annie}
}
@article {13886,
	title = {Use of Minimal Lexical Conceptual Structures for Single-Document Summarization},
	year = {2004},
	month = {2004/06//},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This reports provides an overview of the findings and software that have evolved from the Use of Minimal Lexical Conceptual Structures for Single-Document Summarization project over the last six months. We present the major goals that have been achieved and discuss some of the open issues that we intend to address in the near future. This report also contains some details on the usage of some software that has been implemented during the project.},
	keywords = {*COMPUTATIONAL LINGUISTICS, AUTOMATIC HEADLINE GENERATION, CYBERNETICS, DOCUMENT SUMMARIZATION, Information retrieval, INFORMATION SCIENCE, linguistics, Machine translation},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458797},
	author = {Dorr, Bonnie J and Habash,Nizar Y and Monz,Christof and Schwartz,Richard}
}
@article {17469,
	title = {User interface design with speech technologies : A cognitive limitations review},
	journal = {Sprache und Datenverarbeitung},
	volume = {28},
	year = {2004},
	month = {2004///},
	pages = {101 - 109},
	keywords = {Communication homme-machine, computational linguistics, Human-computer communication, interface, Linguistique informatique, Speech processing, Traitement automatique de la parole},
	isbn = {0343-5202},
	url = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=16961708},
	author = {Shneiderman, Ben}
}
@article {16591,
	title = {Using distributed partial memories to improve self-organizing collective movements},
	journal = {Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on},
	volume = {34},
	year = {2004},
	month = {2004///},
	pages = {1697 - 1707},
	author = {Winder,R. and Reggia, James A.}
}
@conference {14789,
	title = {Using Hardware Counters to Automatically Improve Memory Performance},
	booktitle = {Proceedings of the 2004 ACM/IEEE conference on Supercomputing},
	series = {SC {\textquoteright}04},
	year = {2004},
	month = {2004///},
	pages = {46{\textendash} - 46{\textendash}},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	abstract = {In this paper, we introduce a profile-driven online page migration scheme and investigate its impact on the performance of multithreaded applications. We use lightweight, inexpensive plug-in hardware counters to profile the memory access behavior of an application, and then migrate pages to memory local to the most frequently accessing processor. Using the Dyninst runtime instrumentation combined with hardware counters, we were able to add page migration capabilities to the system without having to modify the operating system kernel, or to re-compile application programs. This approach reduced the total number of non-local memory accesses of applications by up to 90\%. Even on a system with small remote to local memory access latency rations, this resulted in up to 16\% improvement in execution time.},
	isbn = {0-7695-2153-3},
	doi = {http://dx.doi.org/10.1109/SC.2004.64},
	url = {http://dx.doi.org/10.1109/SC.2004.64},
	author = {Tikir, Mustafa M. and Hollingsworth, Jeffrey K}
}
@article {15442,
	title = {Using tasks to automate regression testing of GUIs},
	journal = {International Conference on Artificial intelligence and Applications (AIA 2004)},
	year = {2004},
	month = {2004///},
	pages = {16 - 18},
	abstract = {Graphical User Interfaces (GUIs) present unique chal-lenges for software testing. In this paper, we demonstrate
that a test suite originally used to test a GUI contains a large
number of unusable test cases for the modified GUI. We
present a novel technique to recreate unusable test cases by
associating meta-information (called a task) with each test
case. Tasks represent activities that can be performed by
using the software. The sequence of events in a test case
represents the actions needed to complete its associated
task. Even when changes to the GUI make test cases unus-
able, many tasks remain valid across successive GUI ver-
sions. We experimentally show that our technique is able
to automatically and efficiently regenerate a large number
of test cases.
},
	author = {Memon, Atif M.}
}
@conference {14452,
	title = {Using the structure of Web sites for automatic segmentation of tables},
	booktitle = {Proceedings of the 2004 ACM SIGMOD international conference on Management of data},
	series = {SIGMOD {\textquoteright}04},
	year = {2004},
	month = {2004///},
	pages = {119 - 130},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Many Web sites, especially those that dynamically generate HTML pages to display the results of a user{\textquoteright}s query, present information in the form of list or tables. Current tools that allow applications to programmatically extract this information rely heavily on user input, often in the form of labeled extracted records. The sheer size and rate of growth of the Web make any solution that relies primarily on user input is infeasible in the long term. Fortunately, many Web sites contain much explicit and implicit structure, both in layout and content, that we can exploit for the purpose of information extraction. This paper describes an approach to automatic extraction and segmentation of records from Web tables. Automatic methods do not require any user input, but rely solely on the layout and content of the Web source. Our approach relies on the common structure of many Web sites, which present information as a list or a table, with a link in each entry leading to a detail page containing additional information about that item. We describe two algorithms that use redundancies in the content of table and detail pages to aid in information extraction. The first algorithm encodes additional information provided by detail pages as constraints and finds the segmentation by solving a constraint satisfaction problem. The second algorithm uses probabilistic inference to find the record segmentation. We show how each approach can exploit the web site structure in a general, domain-independent manner, and we demonstrate the effectiveness of each algorithm on a set of twelve Web sites.},
	isbn = {1-58113-859-8},
	doi = {10.1145/1007568.1007584},
	url = {http://doi.acm.org/10.1145/1007568.1007584},
	author = {Lerman,Kristina and Getoor, Lise and Minton,Steven and Knoblock,Craig}
}
@inbook {16293,
	title = {Using the TIGR Assembler in Shotgun Sequencing Projects},
	booktitle = {Bacterial Artificial Chromosomes},
	series = {Methods in Molecular Biology},
	volume = {255},
	year = {2004},
	month = {2004///},
	pages = {279 - 294},
	publisher = {Humana Press},
	organization = {Humana Press},
	abstract = {The TIGR Assembler (TA) ( 1 ) is the sequence assembly program used in sequencing projects at The Institute for Genomic Research (TIGR). Development of the TA was based on the experience obtained in more than 20 sequencing projects completed at TIGR ( see http://www.tigr.org ). This extensive experience led to a sequence assembler that produces few misassemblies ( 2 , 3 ) and has been used successfully in whole-genome shotgun sequencing of prokaryotic and eukaryotic organisms, bacterial artificial chromosome-based sequencing of eukaryotic organisms, and expressed sequence tag assembly.},
	isbn = {978-1-59259-752-9},
	url = {http://dx.doi.org/10.1385/1-59259-752-1:279},
	author = {Pop, Mihai and Kosack,Dan},
	editor = {Zhao,Shaying and Stodolsky,Marvin}
}
@conference {15429,
	title = {Using transient/persistent errors to develop automated test oracles for event-driven software},
	booktitle = {Automated Software Engineering, 2004. Proceedings. 19th International Conference on},
	year = {2004},
	month = {2004/09//},
	pages = {186 - 195},
	abstract = {Today{\textquoteright}s software-intensive systems contain an important class of software, namely event-driven software (EDS). All EDS take events as input, change their state, and (perhaps) output an event sequence. EDS is typically implemented as a collection of event-handlers designed to respond to individual events. The nature of EDS creates new challenges for test automation. In this paper, we focus on those relevant to automated test oracles. A test oracle is a mechanism that determines whether a software executed correctly for a test case. A test case for an EDS consists of a sequence of events. The test case is executed on the EDS, one event at a time. Errors in the EDS may "appear" and later {\textquotedblright}disappear" at several points (e.g., after an event is executed) during test case execution. Because of the behavior of these transient (those that disappear) and persistent (those that don{\textquoteright}t disappear) errors, EDS require complex and expensive test oracles that compare the expected and actual output multiple times during test case execution. We leverage our previous work to study several applications and observe the occurrence of persistent/transient errors. Our studies show that in practice, a large number of errors in EDS are transient and that there are specific classes of events that lead to transient errors. We use the results of this study to develop a new test oracle that compares the expected and actual output at strategic points during test case execution. We show that the oracle is effective at detecting errors and efficient in terms of resource utilization},
	keywords = {automated test oracles, Automatic testing, event driven software, Graphical user interfaces, persistent errors, program testing, resource allocation, resource utilization, software intensive systems, test case execution, transient errors},
	doi = {10.1109/ASE.2004.1342736},
	author = {Memon, Atif M. and Xie,Qing}
}
@inbook {12294,
	title = {Using Trust in Recommender Systems: An Experimental Analysis},
	booktitle = {Trust ManagementTrust Management},
	series = {Lecture Notes in Computer Science},
	volume = {2995},
	year = {2004},
	month = {2004///},
	pages = {221 - 235},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Recommender systems (RS) have been used for suggesting items (movies, books, songs, etc.) that users might like. RSs compute a user similarity between users and use it as a weight for the users{\textquoteright} ratings. However they have many weaknesses, such as sparseness, cold start and vulnerability to attacks. We assert that these weaknesses can be alleviated using a Trust-aware system that takes into account the {\textquotedblleft}web of trust{\textquotedblright} provided by every user. Specifically, we analyze data from the popular Internet web site epinions.com . The dataset consists of 49290 users who expressed reviews (with rating) on items and explicitly specified their web of trust, i.e. users whose reviews they have consistently found to be valuable. We show that any two users have usually few items rated in common. For this reason, the classic RS technique is often ineffective and is not able to compute a user similarity weight for many of the users. Instead exploiting the webs of trust, it is possible to propagate trust and infer an additional weight for other users. We show how this quantity can be computed against a larger number of users.},
	keywords = {Computer, Science},
	isbn = {978-3-540-21312-3},
	url = {http://dx.doi.org/10.1007/978-3-540-24747-0_17},
	author = {Massa,Paolo and Bhattacharjee, Bobby},
	editor = {Jensen,Christian and Poslad,Stefan and Dimitrakos,Theo}
}
@conference {17807,
	title = {Utilizing volatile external information during planning},
	booktitle = {Proceedings of the European Conference on Artificial Intelligence (ECAI)},
	year = {2004},
	month = {2004///},
	pages = {647 - 651},
	author = {Au,T. C and Nau, Dana S. and V.S. Subrahmanian}
}
@conference {14179,
	title = {Uncertainty in 3D shape estimation},
	booktitle = {ICCV Workshop on Statistical and Computational Theories of Vision},
	year = {2003},
	month = {2003///},
	author = {Ji,H. and Ferm{\"u}ller, Cornelia}
}
@article {17449,
	title = {Understanding Computer User Frustration: Measuring and Modeling the Disruption from Poor Designs},
	journal = {Technical Reports from UMIACS},
	year = {2003},
	month = {2003/01/21/},
	abstract = {User frustration in the use of information and computing technology is apervasive and persistent problem.  When computers crash, network congestion
causes delays, and poor user interfaces trigger confusion there are dramatic
consequences for individuals, organizations, and society. These frustrations not
only cause personal dissatisfaction and loss of self-efficacy, but may disrupt
workplaces, slow learning, and reduce participation in local and national
communities. We propose a Computing Frustration Model with incident specific and
individual variables to guide research. Our study of 108 computer users shows
high levels of frustration and loss of 1/3 to 1/2 of time spent.   The
importance of the users{\textquoteright} goals and the severity of the disruption were
correlated with frustration. Those who had strong self-efficacy, indicated by a
willingness to stick to solving the problem, reported lower levels of
frustration.  Implications for users, software developers, managers, and
policymakers are discussed.
Keywords: user frustration, user interface design, training, helpdesk, computer
experience, computer anxiety
(UMIACS-TR-2002-89)
(HCIL-TR-2002-18)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/1233},
	author = {Bessiere,Katie and Ceaparu,Irina and Lazar,Jonathan and Robinson,John and Shneiderman, Ben}
}
@article {17450,
	title = {Understanding Hierarchical Clustering Results by Interactive Exploration of Dendrograms: A Case Study with Genomic Microarray Data},
	journal = {Technical Reports from UMIACS},
	year = {2003},
	month = {2003/01/21/},
	abstract = {Abstract: Hierarchical clustering is widely used to find patterns inmulti-dimensional datasets, especially for genomic microarray data.  Finding
groups of genes with similar expression patterns can lead to better
understanding of the functions of genes.  Early software tools produced only
printed results, while newer ones enabled some online exploration.  We describe
four general techniques that could be used in interactive explorations of
clustering algorithms: (1) overview of the entire dataset, coupled with a detail
view so that high-level patterns and hot spots can be easily found and examined,
(2) dynamic query controls so that users can restrict the number of clusters
they view at a time and show those clusters more clearly, (3) coordinated
displays: the overview mosaic has a bi-directional link to 2-dimensional
scattergrams, (4) cluster comparisons to allow researchers to see how different
clustering algorithms group the genes.
(UMIACS-TR-2002-50)
(HCIL-TR-2002-10)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/1203},
	author = {Seo,Jinwook and Shneiderman, Ben}
}
@conference {12299,
	title = {On the use of flow migration for handling short-term overloads},
	booktitle = {Global Telecommunications Conference, 2003. GLOBECOM {\textquoteright}03. IEEE},
	volume = {6},
	year = {2003},
	month = {2003/12//},
	pages = {3108 - 3112 vol.6 - 3108 - 3112 vol.6},
	abstract = {In this work, we investigate flow migration as a mechanism to sustain QoS to network users during short-term overloads in the context of an MPLS IP network. We experiment with three different control techniques: static long-term optimal mapping of flows to LSPs; on-line locally optimal mapping of flows to LSPs at flow set-up time; and dynamic flow migration in response to transient congestion. These techniques are applicable over different timescales, have different run-time overheads, and require different levels of monitoring and control software inside the network. We present results both from detailed simulations and a complete implementation using software IP routers. We use voice-over-IP as our test application, and show that if end-to-end quality is to be maintained during short unpredictable bursts of high load, then a fast-timescale control such as migration is required.},
	keywords = {computing;, CONGESTION, congestion;, CONTROL, control;, dynamic, end-to-end, engineering, fast-timescale, flow, Internet, IP, label, long-term, mapping;, migration;, MPLS, multiprotocol, network, network;, networks;, of, optimal, overloads;, protocol;, QoS;, QUALITY, quality;, routers;, routing;, service;, set-up, short-term, software, software;, static, switching;, Telecommunication, telephony;, time;, transient, voice-over-IP;},
	doi = {10.1109/GLOCOM.2003.1258807},
	author = {Kuo,Kuo-Tung and Phuvoravan,S. and Bhattacharjee, Bobby and Jun La,R. and Shayman,M. and Chang,Hyeong Soo}
}
@article {13686,
	title = {Use of OCR for Rapid Construction of Bilingual Lexicons},
	volume = {LAMP-TR-104,CFAR-TR-986,CS-TR-4510,UMIACS-TR-2003-78},
	year = {2003},
	month = {2003/07//},
	institution = {University of Maryland, College Park},
	abstract = {This paper describes an approach to analyzing the lexical structure of OCRed bilingual dictionaries to construct resources suited for machine translation of low-density languages, where online resources are limited. A rule-based and an HMM-based method are used for rapid construction of MT lexicons based on systematic structural clues provided in the original dictionary. We evaluate the effectiveness of our techniques, concluding that: (1) the rule-based method performs better on dictionaries with a simple structure; (2) the stochastic method performs better on dictionaries with an enriched structure; (3) regardless of the degree of dictionary richness, the rule-based method gives better results for phrasal entries than for single-word entries; and (4) Our resulting bilingual lexicons are comprehensive enough to provide reasonable MT results when compared to human-constructed lexicons.},
	author = {Karagol-Ayan,Burcu and David Doermann and Dorr, Bonnie J}
}
@article {16898,
	title = {Use of the SAND spatial browser for digital government applications},
	journal = {Commun. ACM},
	volume = {46},
	year = {2003},
	month = {2003/01//},
	pages = {61 - 64},
	abstract = {Numerous federal agencies produce official statistics made accessible to ordinary citizens for searching and data retrieval. This is frequently done via the Internet through a Web browser interface. If this data is presented in textual format, it can often be searched and retrieved by such attributes as topic, responsible agency, keywords, or press release. However, if the data is of spatial nature, for example, in the form of a map, then using text-based queries is often too cumbersome for the intended audience. We describe the use of the SAND Spatial Browser to provide more power to users of these databases by enabling them to define and explore the specific spatial region of interest graphically. The SAND Spatial Browser allows users to form either purely spatial or mixed spatial/nonspatial queries intuitively, which can present information to users that might have been missed if only a textual interface was available.},
	keywords = {GIS},
	isbn = {0001-0782},
	doi = {10.1145/602421.602453},
	url = {http://doi.acm.org/10.1145/602421.602453},
	author = {Samet, Hanan and Alborzi,Houman and Brabec,Franti{\v s}ek and Esperan{\c c}a,Claudio and Hjaltason,G{\'\i}sli R. and Morgan,Frank and Tanin,Egemen}
}
@article {12165,
	title = {User interface evaluation and empirically-based evolution of a prototype experience management tool},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {29},
	year = {2003},
	month = {2003/09//},
	pages = {838 - 850},
	abstract = {Experience management refers to the capture, structuring, analysis, synthesis, and reuse of an organization{\textquoteright}s experience in the form of documents, plans, templates, processes, data, etc. The problem of managing experience effectively is not unique to software development, but the field of software engineering has had a high-level approach to this problem for some time. The Experience Factory is an organizational infrastructure whose goal is to produce, store, and reuse experiences gained in a software development organization. This paper describes The Q-Labs Experience Management System (Q-Labs EMS), which is based on the Experience Factory concept and was developed for use in a multinational software engineering consultancy. A critical aspect of the Q-Labs EMS project is its emphasis on empirical evaluation as a major driver of its development and evolution. The initial prototype requirements were grounded in the organizational needs and vision of Q-Labs, as were the goals and evaluation criteria later used to evaluate the prototype. However, the Q-Labs EMS architecture, data model, and user interface were designed to evolve, based on evolving user needs. This paper describes this approach, including the evaluation that was conducted of the initial prototype and its implications for the further development of systems to support software experience management.},
	keywords = {data, development;, empirical, EMS;, engineering;, evaluation;, experience, experience;, Factory;, interface, interfaces;, knowledge, management, management;, model;, models;, organization, performance, prototype, Q-Labs, re-engineering;, reusability;, reuse;, software, system;, systems, tool;, user},
	isbn = {0098-5589},
	doi = {10.1109/TSE.2003.1232288},
	author = {Seaman,C.B and Mendonca,M.G. and Basili, Victor R. and Kim,Y. M}
}
@conference {17524,
	title = {User-level internet path diagnosis},
	booktitle = {ACM SIGOPS Operating Systems Review},
	volume = {37},
	year = {2003},
	month = {2003///},
	pages = {106 - 119},
	author = {Mahajan,R. and Spring, Neil and Wetherall,D. and Anderson,T.}
}
@conference {14753,
	title = {User-specified adaptive scheduling in a streaming media network},
	booktitle = {2003 IEEE Conference on Open Architectures and Network Programming},
	year = {2003},
	month = {2003/04/04/5},
	pages = {87 - 96},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In disaster and combat situations, mobile cameras and other sensors transmit real-time data, used by many operators or analysis tools. Unfortunately, in the face of limited, unreliable resources, and varying demands, not all users may be able to get the fidelity they require. This paper describes MediaNet, a distributed stream processing system designed with the above scenarios in mind. Unlike past approaches, MediaNet{\textquoteright}s users can intuitively specify how the system should adapt based on their individual needs. MediaNet uses both local and online global resource scheduling to improve user performance and network utilization, and adapts without requiring underlying support for resource reservations. Performance experiments show that our scheduling algorithm is reasonably fast, and that user performance and network utilization are both significantly improved.},
	keywords = {Adaptive scheduling, CAMERAS, Computer networks, Computer science, distributed stream processing system, Educational institutions, global resource scheduling, Intelligent networks, MediaNet, Mobile computing, network utilization, Process design, Processor scheduling, quality of service, Streaming media, streaming media network, user performance, user-specified adaptive scheduling},
	isbn = {0-7803-7764-8},
	doi = {10.1109/OPNARC.2003.1196376},
	author = {Hicks, Michael W. and Nagarajan,A. and van Renesse,R.}
}
@conference {18456,
	title = {Using computer vision to generate customized spatial audio},
	booktitle = {Multimedia and Expo, IEEE International Conference on},
	volume = {3},
	year = {2003},
	month = {2003///},
	pages = {57 - 60},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {Creating high quality virtual spatial audio over headphones requires real-time head tracking, personalized head-related transfer functions (HRTFs) and customized room response models. While there are expensive solutions to address these issues based on costly head trackers, measured personalized HRTFs and room responses, these are not suitable for widespread or easy deployment and use. We report on the development of a system that uses computer vision to produce customizable models for both the HRTF and the room response, and to achieve head-tracking. The system uses relatively inexpensive cameras and widely available personal computers. Computer-vision based anthropometric measurements of the head, torso, and the external ears are used for HRTF customization. For low-frequency HRTF customization we employ a simple head-and-torso model developed recently [V. R. Algazi et al., 2002]. For high frequency customization we employ measured pinna characteristics as an index into a database of HRTFs [D. N. Zotkin et al., 2002]. For head tracking we employ an online implementation of the POSIT algorithm [D. DeMenthon and L. Davis, 1995] along with active markers to compute head pose in real-time. The system provides an enhanced virtual listening experience at low cost.},
	isbn = {0-7803-7965-9},
	doi = {http://doi.ieeecomputersociety.org/10.1109/ICME.2003.1221247},
	author = {Mohan,A. and Duraiswami, Ramani and Zotkin,Dmitry N and DeMenthon,D. and Davis, Larry S.}
}
@conference {14858,
	title = {Using specularities for recognition},
	booktitle = {Computer Vision, 2003. Proceedings. Ninth IEEE International Conference on},
	year = {2003},
	month = {2003/10//},
	pages = {1512 -1519 vol.2 - 1512 -1519 vol.2},
	abstract = {Recognition systems have generally treated specular highlights as noise. We show how to use these highlights as a positive source of information that improves recognition of shiny objects. This also enables us to recognize very challenging shiny transparent objects, such as wine glasses. Specifically, we show how to find highlights that are consistent with a hypothesized pose of an object of known 3D shape. We do this using only a qualitative description of highlight formation that is consistent with most models of specular reflection, so no specific knowledge of an object{\textquoteright}s reflectance properties is needed. We first present a method that finds highlights produced by a dominant compact light source, whose position is roughly known. We then show how to estimate the lighting automatically for objects whose reflection is part specular and part Lambertian. We demonstrate this method for two classes of objects. First, we show that specular information alone can suffice to identify objects with no Lambertian reflectance, such as transparent wine glasses. Second, we use our complete system to recognize shiny objects, such as pottery.},
	keywords = {3D, formation;object, glass;computer, image, information;specular, light, measurement;reflection;stereo, objects;specular, objects;wine, processing;, property;pottery;recognition, recognition;object, recognition;position, reflectance, reflection;compact, reflection;transparent, shape;Lambertian, source;highlight, systems;shiny, vision;lighting;object},
	doi = {10.1109/ICCV.2003.1238669},
	author = {Osadchy,M. and Jacobs, David W. and Ramamoorthi,R.}
}
@conference {13343,
	title = {Using state modules for adaptive query processing},
	booktitle = {19th International Conference on Data Engineering, 2003. Proceedings},
	year = {2003},
	month = {2003/03/05/8},
	pages = {353 - 364},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed adaptively by an eddy routing operator [R. Avnur et al., (2000)]. Breaking the encapsulation of joins serves two purposes. First, it allows the eddy to observe multiple physical operations embedded in a join algorithm, allowing for better calibration and control of these operations. Second, the SteM on a relation serves as a shared materialization point, enabling multiple competing access methods to share results, which can be leveraged by multiple competing join algorithms. Our architecture extends prior work significantly, allowing continuously adaptive decisions for most major aspects of traditional query optimization: choice of access methods and join algorithms, ordering of operators, and choice of a query spanning tree. SteMs introduce significant routing flexibility to the eddy, enabling more opportunities for adaptation, but also introducing the possibility of incorrect query results. We present constraints on eddy routing through SteMs that ensure correctness while preserving a great deal of flexibility. We also demonstrate the benefits of our architecture via experiments in the Telegraph dataflow system. We show that even a simple routing policy allows significant flexibility in adaptation, including novel effects like automatic "hybridization " of multiple algorithms for a single join.},
	keywords = {adaptive query processing, Bandwidth, Calibration, data encapsulation, data structure, Data structures, Databases, Dictionaries, eddy routing, eddy routing operator, Encapsulation, join operator, multiple algorithm automatic hybridization, multiple competing join algorithm, query architecture, Query processing, query spanning tree, Routing, routing policy, Runtime, shared materialization point, State Module, SteMs, Telegraph dataflow system, Telegraphy, Tree data structures},
	isbn = {0-7803-7665-X},
	doi = {10.1109/ICDE.2003.1260805},
	author = {Vijayshankar Raman and Deshpande, Amol and Hellerstein,J. M}
}
@conference {16123,
	title = {Using Visualization Tools to Gain Insight Into Your Data},
	booktitle = {SPE Annual Technical Conference and Exhibition},
	year = {2003},
	month = {2003/10//},
	publisher = {Society of Petroleum Engineers},
	organization = {Society of Petroleum Engineers},
	abstract = {When the term {\textquoteleft}visualization{\textquoteright} is used in the oil and gas industry, it is usually referring to the viewing of complex geologic structures in three-dimensional space. This paper illustrates insights gained by applying interactive visual environments to petroleum industry data that has traditionally been presented in spreadsheets, line graphs, and bar charts. Two information visualization tools, Treemap and SpaceTree, will be shown applied to a variety of oilfield related data.},
	isbn = {9781555631529},
	doi = {10.2118/84439-MS},
	url = {http://www.onepetro.org/mslib/servlet/onepetropreview?id=00084439},
	author = {Plaisant, Catherine and Chintalapani,G. and Lukehart,C. and Schiro,D. and Ryan,J.}
}
@article {17451,
	title = {Understanding human reactivites and relationships: an excerpt from Leonardo{\textquoteright}s laptop},
	journal = {interactions},
	volume = {9},
	year = {2002},
	month = {2002/09//},
	pages = {40 - 53},
	abstract = {"These notes reveal the intimate tie in Leonardo{\textquoteright}s thinking between{\textellipsis} phenomena in general and the need to put such information to practical use."<BR>--- A. Richard Turner, Inventing Leonardo, 1994, p 184},
	isbn = {1072-5520},
	doi = {10.1145/566981.566982},
	url = {http://doi.acm.org/10.1145/566981.566982},
	author = {Shneiderman, Ben}
}
@inbook {15826,
	title = {Understanding Machine Performance in the Context of Human Performance for Multi-document Summarization},
	booktitle = {DUC 02 Conference ProceedingsDUC 02 Conference Proceedings},
	year = {2002},
	month = {2002///},
	publisher = {U.S. National Inst. of Standards and Technology},
	organization = {U.S. National Inst. of Standards and Technology},
	abstract = {We present a discussion of our summarization algorithm -- both single and multi-document -- along with a discussion of the evaluation experiments we have undertaken, what we have learned from them, and how we intend to utilize this information.},
	url = {http://duc.nist.gov/http://duc.nist.gov/},
	author = {Schlesinger,J.D. and Okurowski,M. E. and Conroy,J.M. and O{\textquoteright}Leary, Dianne P. and Taylor,A. and Hobbs,J. and Wilson,H. T.}
}
@conference {16671,
	title = {An unsupervised method for word sense tagging using parallel corpora},
	booktitle = {Proceedings of the 40th Annual Meeting on Association for Computational Linguistics},
	year = {2002},
	month = {2002///},
	pages = {255 - 262},
	author = {Diab,M. and Resnik, Philip}
}
@article {15892,
	title = {The use of speech retrieval systems: a study design},
	journal = {Information retrieval techniques for speech applications},
	year = {2002},
	month = {2002///},
	pages = {86 - 93},
	author = {Kim,J. and Oard, Douglas}
}
@conference {15955,
	title = {The use-mention distinction and its importance to HCI},
	booktitle = {Proceedings of the Sixth Workshop on the Semantics and Pragmatics of Dialog},
	year = {2002},
	month = {2002///},
	pages = {21 - 28},
	author = {Anderson,M. L and Okamoto,Y. and Josyula,D. and Perlis, Don}
}
@article {13392,
	title = {On using correlation-based synopses during query optimization},
	journal = {Computer Science Division (EECS), University of California Berkeley},
	year = {2002},
	month = {2002/02//},
	abstract = {In recent years, a variety of complex synopsis structures have been proposed to capturestatistical correlations present in database relations. The goal of that work has been to improve
cardinality estimation during query optimization by improving statistics on base tables. In order
to use the correlation information for multi-table estimations as well, synopses must also be
constructed on intermediate result tables during query optimization. We address that problem
here, and show how to efficiently integrate multi-dimensional histograms and other complex
synopsis structures into the search algorithm of a traditional query optimizer such as that of
System R.
A main challenge in this work is minimizing the computational expense of dynamically
computing synopses on intermediate tables during query optimization. We show that one only
needs to construct a very small subset of all possible synopses to get the full estimation bene-
fits of multi-dimensional modeling. We also show that choosing this subset unwisely can have
unacceptable performance overheads. This leads to an {\textquotedblleft}estimation planning{\textquotedblright} problem that has
been ignored to date in literature: how to choose the most efficiently-computable collection of
intermediate synopses to construct, so that all the required cardinality estimates can be com-
puted as accurately as possible from the base-table synopses?
In this paper, we identify and formalize the estimation planning problem in the context of a
System R-style optimizer extended with complex synopsis techniques such as multi-dimensional
histograms. We propose algorithms that find very good estimation plans efficiently, and discuss
properties of synopsis structures that make them amenable to efficient use in an optimizer.
},
	author = {Deshpande, Amol and Hellerstein,J.}
}
@article {16789,
	title = {Using Hilbert curve in image storing and retrieving},
	journal = {Information Systems},
	volume = {27},
	year = {2002},
	month = {2002/12//},
	pages = {523 - 536},
	abstract = {In this paper, we propose a method to accelerate the speed of subset query on uncompressed images. First, we change the method to store images: the pixels of images are stored on the disk in the Hilbert order instead of row-wise order that is used in traditional methods. After studying the properties of the Hilbert curve, we give a new algorithm which greatly reduces the number of data segments in subset query range. Although, we have to retrieve more data than necessary, because the speed of sequential readings is much faster than the speed of random access readings, it takes about 10\% less elapsed time in our algorithm than in the traditional algorithms to execute the subset queries. In some systems, the saving is as much as 90\%.},
	keywords = {Hilbert order, Row-wise order, Subset query},
	isbn = {0306-4379},
	doi = {16/S0306-4379(02)00019-4},
	url = {http://www.sciencedirect.com/science/article/pii/S0306437902000194},
	author = {Song,Zhexuan and Roussopoulos, Nick}
}
@article {12073,
	title = {Using independent auditors as intrusion detection systems},
	journal = {Information and Communications Security},
	year = {2002},
	month = {2002///},
	pages = {291 - 302},
	author = {Molina,J. and Arbaugh, William A.}
}
@conference {16484,
	title = {Using latency-recency profiles for data delivery on the web},
	booktitle = {Proceedings of the 28th international conference on Very Large Data Bases},
	year = {2002},
	month = {2002///},
	pages = {550 - 561},
	author = {Bright,L. and Raschid, Louiqa}
}
@conference {18447,
	title = {Understanding IV \&amp; V in a safety critical and complex evolutionary environment: the NASA space shuttle program},
	booktitle = {Proceedings of the 23rd International Conference on Software Engineering},
	series = {ICSE {\textquoteright}01},
	year = {2001},
	month = {2001///},
	pages = {349 - 357},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Washington, DC, USA},
	abstract = {The National Aeronautics and Space Administration is an internationally recognized leader in space science and exploration. NASA recognizes the inherent risk associated with space exploration; however, NASA makes every reasonable effort to minimize that risk. To that end for the Space Shuttle program NASA instituted a software independent verification and validation (IV\&V) process in 1988 to ensure that the Shuttle and its crew are not exposed to any unnecessary risks. Using data provided by both the Shuttle software developer and the IV\&V contractor, in this paper we describe the overall IV\&V process as used on the Space Shuttle program and provide an analysis of the use of metrics to document and control this process. Our findings reaffirm the value of IV\&V and show the impact IV\&V has on multiple releases of a large complex software system.},
	keywords = {Evolutionary software, Life and mission critical software, metrics, Process characterization, Software independent verification and validation, Software safety and reliability, Space Shuttle program},
	isbn = {0-7695-1050-7},
	url = {http://dl.acm.org/citation.cfm?id=381473.381510},
	author = {Zelkowitz, Marvin V and Rus,Ioana}
}
@article {16158,
	title = {Understanding Manufacturing Systems with a Learning Historian for User-Directed Experimentation},
	volume = {CS-TR-4243},
	year = {2001},
	month = {2001///},
	institution = {Department of Computer Science, University of Maryland, College Park},
	abstract = {This paper describes a learning historian to improve user-directed experimentation withdiscrete event simulation models of manufacturing systems. In user-directed
experimentation, an analyst conducts simulation runs to estimate system performance.
Then the analyst modifies the simulation model to evaluate other possibilities. An
important characteristic is the ad hoc nature of the experimentation, as the analyst forms
and runs new trials based on the results from previous trials. Through user-directed
experimentation designers compare alternatives and students learn the relationships
between input parameters and performance measures. Recording and reviewing previous
trials while using simulation models enhances their benefits, transforming trial-and-error
into learning. The learning historian combines a graphical user interface, a discrete event
simulation model, and dynamic data visualization. Usability studies indicate that the
learning historian is a usable and useful tool because it allows users to concentrate more
on understanding system behavior than on operating simulation software.
},
	author = {Chipman,G. and Plaisant, Catherine and Gahagan,S. and Herrmann,J.W. and Hewitt,S. and Reaves,L.}
}
@article {15103,
	title = {Unforgeable encryption and chosen ciphertext secure modes of operation},
	journal = {Fast Software Encryption},
	year = {2001},
	month = {2001///},
	pages = {25 - 36},
	abstract = {We find certain neglected issues in the study of private-key encryption schemes. For one, private-key encryption is generally held to the same standard of security as public-key encryption (i.e., indistinguishability) even though usage of the two is very different. Secondly, though the importance of secure encryption of single blocks is well known, the security of modes of encryption (used to encrypt multiple blocks) is often ignored. With this in mind, we present definitions of a new notion of security for private-key encryption called encryption unforgeability which captures an adversary{\textquoteright}s inability to generate valid ciphertexts. We show applications of this definition to authentication protocols and adaptive chosen ciphertext security.Additionally, we present and analyze a new mode of encryption, RPC (for Related Plaintext Chaining), which is unforgeable in the strongest sense of the above definition. This gives the first mode provably secure against chosen ciphertext attacks. Although RPC is slightly less efficient than, say, CBC mode (requiring about 33\% more block cipher applications and having ciphertext expansion of the same amount when using a block cipher with 128-bit blocksize), it has highly parallelizable encryption and decryption operations.
},
	doi = {10.1007/3-540-44706-7_20},
	author = {Katz, Jonathan and Yung,M.}
}
@inbook {17459,
	title = {Universal usability: a research agenda for human{\textemdash}computer interaction to empower every citizen},
	booktitle = {Frontiers of human-centred computing, online communities and virtual environmentsFrontiers of human-centred computing, online communities and virtual environments},
	year = {2001},
	month = {2001///},
	pages = {179 - 189},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {London, UK},
	isbn = {1-85233-238-7},
	author = {Shneiderman, Ben}
}
@article {17455,
	title = {Universal usability as a stimulus to advanced interface design},
	journal = {Behaviour \& Information Technology},
	volume = {20},
	year = {2001},
	month = {2001///},
	pages = {367 - 376},
	abstract = {The desire to make computing available to broader populations has historically been a motivation for research and innovation that led to new breakthroughs in usability. Menus, graphical user interfaces and the World Wide Web are examples of innovative technological solutions that have arisen out of the challenge of bringing larger and more diverse groups of users into the world of computing. Universal usability is the latest such challenge: In order to build systems that are universally usable, designers must account for technology variety, user diversity and gaps in user knowledge. These issues are particularly challenging and important in the context of increasing the usability of the World Wide Web. To raise awareness, web designers are urged to provide universal usability statements that offer users information about the usability of their sites. These statements can inform users and thereby reduce frustration and confusion. Further steps toward universal usability might be achieved through research aimed at developing tools that would encourage or promote usability. The paper closes with five proposals for future research.The desire to make computing available to broader populations has historically been a motivation for research and innovation that led to new breakthroughs in usability. Menus, graphical user interfaces and the World Wide Web are examples of innovative technological solutions that have arisen out of the challenge of bringing larger and more diverse groups of users into the world of computing. Universal usability is the latest such challenge: In order to build systems that are universally usable, designers must account for technology variety, user diversity and gaps in user knowledge. These issues are particularly challenging and important in the context of increasing the usability of the World Wide Web. To raise awareness, web designers are urged to provide universal usability statements that offer users information about the usability of their sites. These statements can inform users and thereby reduce frustration and confusion. Further steps toward universal usability might be achieved through research aimed at developing tools that would encourage or promote usability. The paper closes with five proposals for future research.
},
	isbn = {0144-929X},
	doi = {10.1080/01449290110083602},
	url = {http://www.tandfonline.com/doi/abs/10.1080/01449290110083602},
	author = {Shneiderman, Ben and Hochheiser,Harry}
}
@article {17457,
	title = {Universal usability statements: Marking the trail for all users},
	journal = {interactions},
	volume = {8},
	year = {2001},
	month = {2001/03//},
	pages = {16 - 18},
	isbn = {1072-5520},
	doi = {10.1145/361897.361913},
	url = {http://doi.acm.org/10.1145/361897.361913},
	author = {Hochheiser,Harry and Shneiderman, Ben}
}
@article {17461,
	title = {University of Maryland, USA},
	journal = {Fifth International Conference on Information Visualisation: 25-27 July 2001 London, England: Proceedings},
	year = {2001},
	month = {2001///},
	pages = {3 - 3},
	author = {Shneiderman, Ben}
}
@conference {16761,
	title = {Update propagation strategies for improving the quality of data on the web},
	booktitle = {PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES},
	year = {2001},
	month = {2001///},
	pages = {391 - 400},
	author = {Labrinidis,A. and Roussopoulos, Nick and SCIENCE,MARYLAND UNIV COLLEGE PARK DEPT OF COMPUTER}
}
@conference {15885,
	title = {User modeling for information access based on implicit feedback},
	booktitle = {3rd Symposium of ISKO-France, Information Filtering and Automatic Summarisation in networds},
	year = {2001},
	month = {2001///},
	author = {Kim,J. and Oard, Douglas and Romanik,K.}
}
@article {17478,
	title = {Using interactive visualizations of WWW log data to characterize access patterns and inform site design},
	journal = {Journal of the American Society for Information Science and Technology},
	volume = {52},
	year = {2001},
	month = {2001/01/01/},
	pages = {331 - 343},
	abstract = {HTTP server log files provide Web site operators with substantial detail regarding the visitors to their sites. Interest in interpreting this data has spawned an active market for software packages that summarize and analyze this data, providing histograms, pie graphs, and other charts summarizing usage patterns. Although useful, these summaries obscure useful information and restrict users to passive interpretation of static displays. Interactive visualizations can be used to provide users with greater abilities to interpret and explore Web log data. By combining two-dimensional displays of thousands of individual access requests, color, and size coding for additional attributes, and facilities for zooming and filtering, these visualizations provide capabilities for examining data that exceed those of traditional Web log analysis tools. We introduce a series of interactive visualizations that can be used to explore server data across various dimensions. Possible uses of these visualizations are discussed, and difficulties of data collection, presentation, and interpretation are explored.},
	isbn = {1532-2890},
	doi = {10.1002/1532-2890(2000)9999:9999<::AID-ASI1066>3.0.CO;2-Y},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/1532-2890(2000)9999:9999\%3C::AID-ASI1066\%3E3.0.CO;2-Y/abstract},
	author = {Hochheiser,Harry and Shneiderman, Ben}
}
@article {17454,
	title = {Universal usability},
	journal = {Communications of the ACM},
	volume = {43},
	year = {2000},
	month = {2000/05//},
	pages = {84 - 91},
	isbn = {0001-0782},
	doi = {10.1145/332833.332843},
	url = {http://doi.acm.org/10.1145/332833.332843},
	author = {Shneiderman, Ben}
}
@inbook {13477,
	title = {Using Feature Hierarchies in Bayesian Network Learning},
	booktitle = {Abstraction, Reformulation, and Approximation},
	series = {Lecture Notes in Computer Science},
	volume = {1864},
	year = {2000},
	month = {2000///},
	pages = {260 - 270},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {In recent years, researchers in statistics and the UAI community have developed an impressive body of theory and algorithmic machinery for learning Bayesian networks from data. Learned Bayesian networks can be used for pattern discovery, prediction, diagnosis, and density estimation tasks. Early pioneering work in this area includes [ 5 , 9 , 10 , 13 ]. The algorithm that has emerged as the current most popular approach is a simple greedy hill-climbing algorithm that searches the space of candidate structures, guided by a network scoring function (either Bayesian or Minimum Description Length (MDL)-based). The search begins with an initial candidate network (typically the empty network, which has no edges), and then considers making small local changes such as adding, deleting, or reversing an edge in the network.},
	isbn = {978-3-540-67839-7},
	url = {http://dx.doi.org/10.1007/3-540-44914-0_16},
	author = {desJardins, Marie and Getoor,Lise and Koller,Daphne},
	editor = {Choueiry,Berthe and Walsh,Toby}
}
@conference {14765,
	title = {Using hardware performance monitors to isolate memory bottlenecks},
	booktitle = {Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM)},
	year = {2000},
	month = {2000///},
	pages = {40 - 40},
	author = {Buck, B. R and Hollingsworth, Jeffrey K}
}
@conference {16796,
	title = {Using Hilbert curve in image storing and retrieving},
	booktitle = {Proceedings of the 2000 ACM workshops on Multimedia  - MULTIMEDIA {\textquoteright}00},
	year = {2000},
	month = {2000///},
	pages = {167 - 170},
	address = {Los Angeles, California, United States},
	doi = {10.1145/357744.357921},
	url = {http://dl.acm.org/citation.cfm?id=357921},
	author = {Song,Zhexuan and Roussopoulos, Nick}
}
@conference {16505,
	title = {Using quality of data metadata for source selection and ranking},
	booktitle = {Proceedings of the Third International Workshop on the Web and Databases, WebDB},
	year = {2000},
	month = {2000///},
	pages = {93 - 98},
	author = {Mihaila,G. A and Raschid, Louiqa and Vidal,M. E}
}
@article {17452,
	title = {Understanding Patterns of User Visits to Web Sites: Interactive Starfield Visualization of WWW Log Data-Short Version},
	journal = {Tech Report HCIL-99-06},
	year = {1999},
	month = {1999///},
	abstract = {HTTP server log files provide Web site operators with substantial detail regarding the visitors to their sites. Interest in interpreting this data has spawned an active market for software packages that summarize and analyze this data, providing histograms, pie graphs, and other charts summarizing usage patterns. While useful, these summaries obscure useful information and restrict users to passive interpretation of static displays.Interactive starfield visualizations can be used to provide users with greater abilities to interpret and explore web log data. By combining two-dimensional displays of thousands of individual access requests, color and size coding for additional attributes, and facilities for zooming and filtering, these visualizations provide capabilities for examining data that exceed those of traditional web log analysis tools. We introduce a series of interactive starfield visualizations, which can be used to explore server data across various dimensions. Possible uses of these visualizations are discussed, and difficulties of data collection, presentation, and interpretation are explored.
},
	author = {Hochheiser,H. and Shneiderman, Ben}
}
@conference {17473,
	title = {User interfaces for creativity support tools},
	booktitle = {Proceedings of the 3rd conference on Creativity \& cognition},
	series = {C\&C {\textquoteright}99},
	year = {1999},
	month = {1999///},
	pages = {15 - 22},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	isbn = {1-58113-078-3},
	doi = {10.1145/317561.317565},
	url = {http://doi.acm.org/10.1145/317561.317565},
	author = {Shneiderman, Ben}
}
@conference {15467,
	title = {Using a goal-driven approach to generate test cases for GUIs},
	booktitle = {Software Engineering, 1999. Proceedings of the 1999 International Conference on},
	year = {1999},
	month = {1999/05//},
	pages = {257 - 266},
	abstract = {The widespread use of GUIs for interacting with software is leading to the construction of more and more complex GUIs. With the growing complexity comes challenges in testing the correctness of a GUI and the underlying software. We present a new technique to automatically generate test cases for GUIs that exploits planning, a well developed and used technique in artificial intelligence. Given a set of operators, an initial state and a goal state, a planner produces a sequence of the operators that will change the initial state to the goal state. Our test case generation technique first analyzes a GUI and derives hierarchical planning operators from the actions in the GUI. The test designer determines the preconditions and effects of the hierarchical operators, which are then input into a planning system. With the knowledge of the GUI and the way in which the user will interact with the GUI, the test designer creates sets of initial and goal states. Given these initial and final states of the GUI, a hierarchical planner produces plans, or a set of test cases, that enable the goal state to be reached. Our technique has the additional benefit of putting verification commands into the test cases automatically. We implemented our technique by developing the GUI analyzer and extending a planner. We generated test cases for Microsoft{\textquoteright}s Word-Pad to demonstrate the viability and practicality of the approach.},
	keywords = {Artificial intelligence, automatic test case generation, goal state, goal-driven approach, Graphical user interfaces, GUIs, hierarchical planning operators, initial state, Microsoft Word-Pad, operators, planning (artificial intelligence), program testing, software, verification commands},
	author = {Memon, Atif M. and Pollack,M. E and Soffa,M. L}
}
@article {17479,
	title = {Using Interactive Visualizations of WWW Log Data to Characterize Access Patterns and Inform Site Design},
	year = {1999},
	month = {1999///},
	abstract = {HTTP server log files provide Web site operators with substantial detail regarding the visitors to their sites. Interest ininterpreting this data has spawned an active market for software packages that summarize and analyze this data, providing histograms, pie graphs, and other charts summarizing usage patterns. While useful, these summaries obscureuseful information and restrict users to passive interpretation of static displays. Interactive visualizations can be used to provide users with greater abilities to interpret and explore web log data. Bycombining two-dimensional displays of thousands of individual access requests, color and size coding for additional attributes, and facilities for zooming and filtering, these visualizations provide capabilities for examining data that exceed those of traditional web log analysis tools. <p>We introduce a series of interactive visualizations that can be used to explore server data across various dimensions. Sample visualizations of server data from two web sites are presented. Coordinated, snap-together visualizations (STVs) of log data are introduced as a means of gaining additional expressive power. Possible uses of these visualizations are discussed, and difficulties of data collection, presentation, and interpretation are explored.},
	keywords = {Information Visualization, log file analysis, World Wide Web},
	url = {http://drum.lib.umd.edu/handle/1903/6034},
	author = {Hochheiser,Harry and Shneiderman, Ben}
}
@article {14441,
	title = {Using probabilistic relational models for collaborative filtering},
	journal = {Proc. Workshop Web Usage Analysis and User Profiling (WEBKDD{\textquoteright}99)},
	year = {1999},
	month = {1999///},
	abstract = {Recent projects in collaborative filtering and information filtering address the task of inferring user prefer-ence relationships for products or information. The data on which these inferences are based typically con-
sists of pairs of people and items. The items may be information sources (such as web pages or newspaper
articles) or products (such as books, software, movies or CDs). We are interested in making recommen-
dations or predictions. Traditional approaches to the problem derive from classical algorithms in statistical
pattern recognition and machine learning. The majority of these approaches assume a {\textquotedblright}flat{\textquotedblright} data repre-
sentation for each object, and focus on a single dyadic relationship between the objects. In this paper, we
examine a richer model that allows us to reason about many different relations at the same time. We build
on the recent work on probabilistic relational models (PRMs), and describe how PRMs can be applied to the
task of collaborative filtering. PRMs allow us to represent uncertainty about the existence of relationships in
the model and allow the properties of an object to depend probabilistically both on other properties of that
object and on properties of related objects.
},
	author = {Getoor, Lise and Sahami,M.}
}
@article {17482,
	title = {Using vision to think},
	journal = {Readings in information visualization: using vision to think},
	year = {1999},
	month = {1999///},
	pages = {579 - 581},
	author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben}
}
@article {14870,
	title = {Uncertainty propagation in model-based recognition},
	journal = {International Journal of Computer Vision},
	volume = {27},
	year = {1998},
	month = {1998///},
	pages = {127 - 159},
	abstract = {Robust recognition systems require a careful understanding of the effects of error in sensed features. In model-based recognition, matches between model features and sensed image features typically are used to compute a model pose and then project the unmatched model features into the image. The error in the image features results in uncertainty in the projected model features. We first show how error propagates when poses are based on three pairs of 3D model and 2D image points. In particular, we show how to simply and efficiently compute the distributed region in the image where an unmatched model point might appear, for both Gaussian and bounded error in the detection of image points, and for both scaled-orthographic and perspective projection models. Next, we provide geometric and experimental analyses to indicate when this linear approximation will succeed and when it will fail. Then, based on the linear approximation, we show how we can utilize Linear Programming to compute bounded propagated error regions for any number of initial matches. Finally, we use these results to extend, from two-dimensional to three-dimensional objects, robust implementations of alignment, interpretation-tree search, and transformation clustering.},
	doi = {10.1023/A:1007989016491},
	author = {Alter,T. D. and Jacobs, David W.}
}
@article {16175,
	title = {Understanding Transportation Management Systems Performance with a Simulation-Based Learning Environment},
	journal = {Technical Reports of the Computer Science Department},
	year = {1998},
	month = {1998/12/05/},
	abstract = {We have developed a simulation-based learning environment to provide systemdesigners and operators with an appreciation of the impact of incidents on 
traffic delay.  We used an application framework developed at the University 
of Maryland for constructing simulation-based learning environments called 
SimPLE (Simulated Processes in a Learning Environment).  Environments 
developed with SimPLE use dynamic simulations and visualizations to represent 
realistic time-dependent behavior and are coupled with guidance material and 
other software aids that facilitate learning.  The simulation allows learners 
to close freeway lanes and divert traffic to an arterial road.  Users can see 
the effect of the detour on freeway and arterial delay.  Users can then
adjust signal timing interactively on a time space diagram and watch the 
effect of their adjustment on green band changes and on arterial delays and 
total delays.
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/500},
	author = {Plaisant, Catherine and Tarnoff,Phil and Saraf,Aditya and Rose,Anne}
}
@article {16024,
	title = {Updating Discourse Context with Active Logic},
	volume = {UMIACS-TR-96-62},
	year = {1998},
	month = {1998/10/15/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {In this paper we present our implementation of a system of active logicthat processes natural language discourses. We focus on problems that
involve presupposition and the associated well-known problems of the
projection of presupposition. We discuss Heim{\textquoteright}s largely successful theory
of presupposition and point out certain limitations. We then use these
observations to build our discourse processor based on active logic. Our
main contributions are the handling of problems that go beyond the scope
of Heim{\textquoteright}s theory , especially discourses the involve cancellation of
presupposition. Ongoing work suggests that conversational implicature and
the cancellation of implicature can also be treated by our methods. Key
words: presupposition, discourse, con text, accommodation, active logic,
implicature. 
(Also cross-referenced as UMIACS-TR-96-62)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu//handle/1903/842},
	author = {Gurney,John and Purang,Khemdut and Perlis, Don}
}
@article {16177,
	title = {User Interface Reengineering: A Diagnostic Approach},
	journal = {Technical Reports of the Computer Science Department},
	year = {1998},
	month = {1998/10/15/},
	abstract = {User interface technology has advanced rapidly in recent years.Incorporating new developments in existing systems could result in
substantial improvements in usability, thereby improving performance and
user satisfaction, while shortening training an d reducing error rates. 
Our focus is on low-effort high-payoff improvements to aspects such as
data display and entry, consistency, messages, documentation, and system
access.  This paper provides guidelines for managers and designers
responsible for use r interface reengineering, based on the experience we
gained from six projects, and compiles our observations, recommendations
and outcomes. 
(Also cross-referenced as CAR-TR-767)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/430},
	author = {Vanniamparampil,Ajit J and Shneiderman, Ben and Plaisant, Catherine and Rose,Anne}
}
@conference {17477,
	title = {Using elastic windows for World-Wide Web Browsing},
	booktitle = {CHI 98 conference summary on Human factors in computing systems},
	series = {CHI {\textquoteright}98},
	year = {1998},
	month = {1998///},
	pages = {189 - 190},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {elastic windows, User interfaces, window management, World-wide web},
	isbn = {1-58113-028-7},
	doi = {10.1145/286498.286666},
	url = {http://doi.acm.org/10.1145/286498.286666},
	author = {Kandogan,Eser and Shneiderman, Ben}
}
@conference {14468,
	title = {Utility elicitation as a classification problem},
	booktitle = {Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence},
	series = {UAI{\textquoteright}98},
	year = {1998},
	month = {1998///},
	pages = {79 - 88},
	publisher = {Morgan Kaufmann Publishers Inc.},
	organization = {Morgan Kaufmann Publishers Inc.},
	address = {San Francisco, CA, USA},
	abstract = {We investigate the application of classification techniques to utility elicitation. In a decision problem, two sets of parameters must generally be elicited: the probabilities and the utilities. While the prior and conditional probabilities in the model do not change from user to user, the utility models do. Thus it is necessary to elicit a utility model separately for each new user. Elicitation is long and tedious, particularly if the outcome space is large and not decomposable. There are two common approaches to utility function elicitation. The first is to base the determination of the user{\textquoteright}s utility function solely on elicitation of qualitative preferences. The second makes assumptions about the form and decomposability of the utility function. Here we take a different approach: we attempt to identify the new user{\textquoteright}s utility function based on classification relative to a database of previously collected utility functions. We do this by identifying clusters of utility functions that minimize an appropriate distance measure. Having identified the clusters, we develop a classification scheme that requires many fewer and simpler assessments than full utility elicitation and is more robust than utility elicitation based solely on preferences. We have tested our algorithm on a small database of utility functions in a prenatal diagnosis domain and the results are quite promising.},
	isbn = {1-55860-555-X},
	url = {http://dl.acm.org/citation.cfm?id=2074094.2074104},
	author = {Chajewska,Urszula and Getoor, Lise and Norman,Joseph and Shahar,Yuval}
}
@article {16197,
	title = {User Interface Reengineering: Low-Effort, High-Payoff Strategies},
	journal = {IEEE Software},
	volume = {14},
	year = {1997},
	month = {1997///},
	pages = {66 - 72},
	abstract = {User interface technology has advanced rapidly in recent years. Incorporating new developments in existing systems could result in substantial improvements in usability, thereby improving performance and user satisfaction, while shortening training and reducing error rates. We describe low-effort, high-payoff strategies that focus attention on improvements to data display and entry, consistency, messages, documentation, system access and additional functionality. We report on experience from six projects, describing observations, recommendations and outcomes. We close with guidance for managers and designers who are responsible for user interface reengineering.},
	author = {Plaisant, Catherine and Rose,A. and Shneiderman, Ben and Vanniamparampil,A. J}
}
@article {17472,
	title = {User Interfaces for a Complex Robotic Task: A Comparison of Tiles vs. Overlapped Windows},
	journal = {Institute for Systems Research Technical Reports},
	year = {1997},
	month = {1997///},
	abstract = {High complexity tasks, such as remote teleoperation of robotic vehicles, often require multiple windows. For these complex tasks, the windows necessary for task completion, may occupy more area than available on a single visual display unit (VDU). Since the focus of the robotic task constantly changes, modular control panels that can be opened, closed, and moved on the screen are invaluable to the operator. This study describes a specific robotic task and the need for a multi window interface that can be easily manipulated. This paper examines two multi-window management strategies: tiled (fixed size) and arbitrary overlap. Multi-window searches were performed using the two management styles and they were compared on the basis of search completion time and error rates. Results with 35 novice users showed faster completion times for the tiled management strategy than for the arbitrary overlap strategy. Over factors such as the number of windows available, the number of displayed windows workload of opening or closing windows, and effect of learning are discussed.},
	keywords = {Human computer interaction, overlapped, Systems Integration Methodology, tiled, user interface design, window management},
	url = {http://drum.lib.umd.edu/handle/1903/5874},
	author = {Lane,J. Corde and Kuester,Steven P and Shneiderman, Ben}
}
@article {14794,
	title = {Using content-derived names for configuration management},
	journal = {ACM SIGSOFT Software Engineering Notes},
	volume = {22},
	year = {1997},
	month = {1997///},
	pages = {104 - 109},
	author = {Hollingsworth, Jeffrey K and Miller, E. L}
}
@article {18733,
	title = {Using manufacturing planning to generate manufacturability feedback},
	journal = {Journal of Mechanical Design},
	volume = {119},
	year = {1997},
	month = {1997///},
	pages = {73 - 73},
	author = {Gupta,S.K.}
}
@article {13891,
	title = {Using WordNet to Posit Hierarchical Structure in Levin{\textquoteright}s Verb Classes},
	year = {1997},
	month = {1997///},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {In this paper we report on experiments using WordNet synset tags to evaluate the seman-tic properties of the verb classes cataloged by Levin 1993. This paper represents ongoing
research begun at the University of Pennsylvania (Rosenzweig et al. 1997, Palmer et
al. 1997) and the University of Maryland (Dorr and Jones 1996b, 1996d, 1996e). Using
WordNet sense tags to constrain the intersection of Levin classes, we avoid spurious class
intersections introduced by homonymy and polysemy (run a bath, run a mile). By adding
class intersections based on a single shared sense-tagged word, we minimize the impact
of the non-exhaustiveness of Levin{\textquoteright}s database (Dorr and Olsen 1996, Dorr to appear).
By examining the syntactic properties of the intersective classes, we provide a clearer
picture of the relationship between WordNet/EuroWordNet and the LCS interlingua for
machine translation and other NLP applications.
},
	author = {Olsen,M.B. and Dorr, Bonnie J and Clark,D.J.}
}
@conference {13887,
	title = {Use of Syntactic and Semantic Filters for Lexical Acquisition: Using WordNet to Increase Precision},
	booktitle = {In Proceedings of the Workshop on Predicative Forms in Natural Language and Lexical Knowledge Bases},
	year = {1996},
	month = {1996///},
	pages = {81 - 88},
	abstract = {This paper describes an approach to automatic extraction of verb meanings from machinereadable  resources for the construction of large-scale knowledge sources. We describe semantic  filters designed to reduce the number of incorrect assignments made by a purely syntactic  technique. We report on our results of disambiguating the verbs in the semantic filters by adding  WordNet sense annotations.},
	author = {Dorr, Bonnie J and Jones,Doug}
}
@conference {16204,
	title = {User controlled overviews of an image library: a case study of the visible human},
	booktitle = {Proceedings of the first ACM international conference on Digital libraries},
	series = {DL {\textquoteright}96},
	year = {1996},
	month = {1996///},
	pages = {74 - 82},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {Browsing, digital library, image database, information exploration, Information retrieval, Internet, medical image, remote access, user interface, Visualization, World-wide web},
	isbn = {0-89791-830-4},
	doi = {10.1145/226931.226946},
	url = {http://doi.acm.org/10.1145/226931.226946},
	author = {North,Chris and Shneiderman, Ben and Plaisant, Catherine}
}
@article {15529,
	title = {Using priorities to combine knowledge bases},
	journal = {International Journal of Cooperative Information Systems},
	volume = {5},
	year = {1996},
	month = {1996///},
	pages = {333 - 333},
	abstract = {Two or more companies, each with its own knowledge base, may merge. In that case one option is to merge the knowledge bases into one knowledge base. It can happen that some of the information contained in one or more knowledge bases may be in conflict with information in the other knowledge bases. There may be several such points of conflict and any information may be involved in several different such points of conflict. In that case, the integrator of the knowledge bases may prefer a certain claim to another in one conflict-point without necessarily preferring that claim in another conflict-point.Our work constructs a framework within which the consequences of a set of such preferences (expressed as priorities among sets of statements) can be computed. We give three types of semantics for priorities, two of which are shown to be equivalent to one another. The third type of semantics for priorities is shown to be more cautious than the other two. In terms of these semantics for priorities, we give a function for combining knowledge from different sources such that the combined knowledge is conflict-free and satisfies all the priorities.
},
	doi = {10.1142/S0218843096000130},
	author = {Pradhan,S. and Minker, Jack}
}
@conference {16376,
	title = {A unifying framework for iteration reordering transformations},
	booktitle = {Algorithms and Architectures for Parallel Processing, 1995. ICAPP 95. IEEE First ICA/sup 3/PP., IEEE First International Conference on},
	volume = {1},
	year = {1995},
	month = {1995///},
	pages = {153 - 162},
	author = {Kelly,W. and Pugh, William}
}
@article {14153,
	title = {Use of linear algebra kernels to build an efficient finite element solver},
	journal = {Parallel Computing},
	volume = {21},
	year = {1995},
	month = {1995/01//},
	pages = {161 - 173},
	abstract = {For scientific codes to achieve good performance on computers with hierarchical memories, it is necessary that the ratio of memory references to arithmetic operations be low. In this paper, we show that Level 3 BLAS linear algebra kernels can be used to satisfy this requirement to produce an efficient implementation of a parallel finite element solver on a shared memory parallel computer with a fast cache memory.},
	keywords = {Cache memory, finite element, hp-version, Level 3 BLAS, Parallel algorithm, shared memory multiprocessor},
	isbn = {0167-8191},
	doi = {16/0167-8191(94)00030-E},
	url = {http://www.sciencedirect.com/science/article/pii/016781919400030E},
	author = {Elman, Howard and Lee,Dennis K. -Y.}
}
@article {16697,
	title = {Using information content to evaluate semantic similarity in a taxonomy},
	journal = {Arxiv preprint cmp-lg/9511007},
	year = {1995},
	month = {1995///},
	author = {Resnik, Philip}
}
@article {15043,
	title = {Using synthetic perturbations and statistical screening to assay shared-memory programs},
	journal = {Information processing letters},
	volume = {54},
	year = {1995},
	month = {1995///},
	pages = {147 - 153},
	author = {Snelick,R. and JaJa, Joseph F. and Kacker,R. and Lyon,G.}
}
@article {17481,
	title = {Using Treemaps to Visualize the Analytic Hierarchy Process},
	journal = {Information Systems ResearchInformation Systems Research},
	volume = {6},
	year = {1995},
	month = {1995/12/01/},
	pages = {357 - 375},
	abstract = {Treemaps, a visualization method for large hierarchical data spaces, are used to augment the capabilities of the Analytic Hierarchy Process (AHP) for decision-making. Two direct manipulation tools, presented metaphorically as a {\textquotedblleft}pump{\textquotedblright} and a {\textquotedblleft}hook,{\textquotedblright} were developed and applied to the treemap to support AHP sensitivity analysis. Users can change the importance of criteria dynamically on the two-dimensional treemap and immediately see the impact on the outcome of the decision. This fluid process dramatically speeds up exploration and provides a better understanding of the relative impact of the component criteria. A usability study with six subjects using a prototype AHP application showed that treemap representation was acceptable from a visualization and data operation standpoint.},
	keywords = {AHP, analytic hierarchy process, decision support, treemap, User interfaces, Visualization},
	isbn = {1047-7047, 1526-5536},
	doi = {10.1287/isre.6.4.357},
	url = {http://isr.journal.informs.org/content/6/4/357},
	author = {Asahi,Toshiyuki and Turo,David and Shneiderman, Ben}
}
@article {14914,
	title = {Uncertainty Propagation in Model-Based Recognition.},
	year = {1994},
	month = {1994/12//},
	institution = {MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LAB},
	abstract = {Building robust recognition systems requires a careful understanding of the effects of error in sensed features. Error in these image features results in a region of uncertainty in the possible image location of each additional model feature. We present an accurate, analytic approximation for this uncertainty region when model poses are based on matching three image and model points, for both Gaussian and bounded error in the detection of image points, and for both scaled-orthographic and perspective projection models. This result applies to objects that are fully three-dimensional, where past results considered only two-dimensional objects. Further, we introduce a linear programming algorithm to compute the uncertainty region when poses are based on any number of initial matches. Finally, we use these results to extend, from two-dimensional to three-dimensional objects, robust implementations of alignment interpretation-tree search, and transformation clustering. (AN)},
	keywords = {*IMAGE PROCESSING, *PATTERN RECOGNITION, algorithms, APPROXIMATION(MATHEMATICS), CYBERNETICS, ERROR CORRECTION CODES, image registration, Linear programming, MATCHING, MATHEMATICAL MODELS, PIXELS, PROJECTIVE TECHNIQUES., regions, THREE DIMENSIONAL, TWO DIMENSIONAL, Uncertainty},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA295642},
	author = {Jacobs, David W. and Alter,T. D.}
}
@article {15828,
	title = {URV ESPRIT for tracking time-varying signals},
	journal = {Signal Processing, IEEE Transactions on},
	volume = {42},
	year = {1994},
	month = {1994/12//},
	pages = {3441 - 3448},
	abstract = {ESPRIT is an algorithm for determining the fixed directions of arrival of a set of narrowband signals at an array of sensors. Unfortunately, its computational burden makes it unsuitable for real time processing of signals with time-varying directions of arrival. The authors develop a new implementation of ESPRIT that has potential for real time processing. It is based on a rank-revealing URV decomposition, rather than the eigendecomposition or singular value decomposition used in previous ESPRIT algorithms. The authors demonstrate its performance on simulated data representing both constant and time-varying signals. They find that the URV-based ESPRIT algorithm is effective for estimating time-varying directions-of-arrival at considerable computational savings over the SVD-based algorithm},
	keywords = {arrival;narrowband, decomposition;real, directions, ESPRIT;fixed, estimation;real-time, of, processing;time-varying, signals;performance;rank-revealing, signals;tracking;direction-of-arrival, systems;time-varying, systems;tracking;, TIME, URV},
	isbn = {1053-587X},
	doi = {10.1109/78.340778},
	author = {Liu,K. J.R and O{\textquoteright}Leary, Dianne P. and Stewart, G.W. and Wu,Y.-J.J.}
}
@article {16216,
	title = {Usability Experiments for the Redesign of a Telepathology Workstation},
	volume = {CS-TR-3270},
	year = {1994},
	month = {1994///},
	institution = {Technical Report CS-TR-3270, University of Maryland},
	abstract = {Dynamic telepathology uses a remotely controlled microscope to allow a pathologist to viewsamples at a remote location. However, time delays introduced by remote operation have made use
of a commercial dynamic telepathology system difficult and frustrating. This paper describes
experiments to evaluate and redesign the user interface. We also make recommendations for
further automation to support the pathology process and increase the usefulness of the system.
},
	author = {Carr,D. and Plaisant, Catherine and Hasegawa,H.}
}
@article {17464,
	title = {User Controlled Smooth Zooming for Information Visualization},
	journal = {Institute for Systems Research Technical Reports},
	year = {1994},
	month = {1994///},
	abstract = {This paper discusses the design and implementation of user controlled smooth zooming of a starfield display. A starfield display is a two dimensional graphical visualization of a multidimensional database where every item from the database is represented as a small colored rectangle whose position is determined by its ranking along ordinal attributes of the items laid out on the axes. One way of navigating this visual information is by using a zooming tool to incrementally zoom in on the items by varying the attribute range on either axis independently - such zooming causes the rectangles to move continuously and to grow or shrink. To get a feeling of flying through the data, users should be able to track the motion of each rectangle without getting distracted by flicker or large jumps - conditions that necessitate high display refresh rates and closely spaced rectangles on successive frames. Although the use of high-speed hardware can achieve the required visual effect for small databases, the twin software bottlenecks of rapidly accessing display items and constructing a new display image fundamentally retard the refresh rate. Our work explores several methods to overcome these bottlenecks, presents a taxonomy of various zooming methods and introduces a new widget, the zoom bar, that facilitates zooming.<P>},
	keywords = {animation, dynamic queries, starfield display, Systems Integration, visualization zooming, zoom bar},
	url = {http://drum.lib.umd.edu/handle/1903/5520},
	author = {Jog,Ninog and Shneiderman, Ben}
}
@conference {18449,
	title = {Use of an environment classification model},
	booktitle = {Proceedings of the 15th international conference on Software Engineering},
	series = {ICSE {\textquoteright}93},
	year = {1993},
	month = {1993///},
	pages = {348 - 357},
	publisher = {IEEE Computer Society Press},
	organization = {IEEE Computer Society Press},
	address = {Los Alamitos, CA, USA},
	keywords = {environment frameworks, environment mappings, integrated environments, reference models},
	isbn = {0-89791-588-7},
	url = {http://dl.acm.org/citation.cfm?id=257572.257655},
	author = {Zelkowitz, Marvin V}
}
@book {13885,
	title = {Use of lexical conceptual structure for intelligent tutoring},
	year = {1993},
	month = {1993///},
	publisher = {University of Maryland},
	organization = {University of Maryland},
	abstract = {We describe the use of an LCS-based semantics for question-answeringexercises in foreign language training. We start by reviewing the LCS model and
show how this representation can be used to support a question answering lesson
as well as a limited domain discourse. An authoring tool for entering the relevant
semantic knowledge is also described.
},
	author = {Dorr, Bonnie J and Hendler,J. and Blanksteen,S. and Migdalof,B.}
}
@article {15822,
	title = {The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems},
	journal = {SIAM Journal on Scientific Computing},
	volume = {14},
	year = {1993},
	month = {1993///},
	pages = {1487 - 1503},
	abstract = {Regularization algorithms are often used to produce reasonable solutions to ill-posed problems. The L-curve is a plot{\textemdash}for all valid regularization parameters{\textemdash}of the size of the regularized solution versus the size of the corresponding residual. Two main results are established. First a unifying characterization of various regularization methods is given and it is shown that the measurement of {\textquotedblleft}size{\textquotedblright} is dependent on the particular regularization method chosen. For example, the 2-norm is appropriate for Tikhonov regularization, but a 1-norm in the coordinate system of the singular value decomposition (SVD) is relevant to truncated SVD regularization. Second, a new method is proposed for choosing the regularization parameter based on the L-curve, and it is shown how this method can be implemented efficiently. The method is compared to generalized cross validation and this new method is shown to be more robust in the presence of correlated errors.},
	keywords = {discrepancy principle, generalized cross validation, ill-posed problems, L-curve, parameter choice, regularization},
	doi = {10.1137/0914086},
	url = {http://link.aip.org/link/?SCE/14/1487/1},
	author = {Hansen,Per Christian and O{\textquoteright}Leary, Dianne P.}
}
@article {17466,
	title = {User interface consistency: an evaluation of original and revised interfaces for a videodisk library},
	journal = {Sparks of innovation in human-computer interaction},
	year = {1993},
	month = {1993///},
	pages = {259 - 259},
	author = {Chimera,R. and Shneiderman, Ben}
}
@article {16782,
	title = {Using differential technlques to efficiently support transaction time},
	journal = {The VLDB JournalVLDB Journal},
	volume = {2},
	year = {1993},
	month = {1993/01//},
	pages = {75 - 111},
	isbn = {1066-8888},
	doi = {10.1007/BF01231799},
	url = {http://dl.acm.org/citation.cfm?id=615162},
	author = {Jensen,Christian S. and Mark,Leo and Roussopoulos, Nick and Sells,Timos}
}
@article {16300,
	title = {Using measurement-driven modeling to provide empirical feedback to software developers},
	journal = {Journal of Systems and Software},
	volume = {20},
	year = {1993},
	month = {1993/03//},
	pages = {237 - 243},
	abstract = {Several authors have explored the application of classification methods to software development. These studies have concentrated on identifying modules that are difficult to develop or that have high fault density. While this information is important, it provides little help in determining appropriate corrective action. This article extends previous work by applying one classification method, classification tree analysis (CTA), to more a fine-grained problem routinely encountered by developers. In this article, we use CTA to identify software modules that have specific types of faults (e.g., logic, interface, etc.) We evaluate this approach using data collected from six actual software projects. Overall, CTA was able to correctly differentiate faulty modules from fault-free modules in 72\% of cases. Furthermore, 82\% of the faulty modules were correctly identified. We also show that CTA outperformed two simpler classification strategies.},
	isbn = {0164-1212},
	doi = {16/0164-1212(93)90067-8},
	url = {http://www.sciencedirect.com/science/article/pii/0164121293900678},
	author = {Porter, Adam}
}
@conference {18779,
	title = {Using MRSEVs to develop machining alternatives},
	year = {1993},
	month = {1993///},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.47.4870\&rep=rep1\&type=pdf},
	author = {Nau, Dana S. and Gupta,S.K. and Kramer,T. R. and Regli,W. C. and Zhang, G.}
}
@conference {15044,
	title = {Using Synthetic-Perturbation Techniques for Tuning Shared Memory Programs},
	booktitle = {Parallel Processing, 1993. ICPP 1993. International Conference on},
	volume = {2},
	year = {1993},
	month = {1993/08//},
	pages = {2 - 10},
	abstract = {The Synthetic-Perturbation Tuning (SPT) methodology is base d on compirical approach that introduces artificial delays into the MIMD program and captures the effects of such delays by using the modrn branch statistics called design of experiments.},
	doi = {10.1109/ICPP.1993.184},
	author = {Snelick,Robert and JaJa, Joseph F. and Kacker,Raghu and Lyon,Gordon}
}
@article {13876,
	title = {The use of lexical semantics in interlingual machine translation},
	journal = {Machine Translation},
	volume = {7},
	year = {1992},
	month = {1992///},
	pages = {135 - 193},
	abstract = {This paper describes the lexical-semantic basis for UNITRAN, an implemented scheme for translating Spanish, English, and German bidirectionally. Two claims made here are that the current representation handles many distinctions (or divergences ) across languages without recourse to language-specific rules and that the lexical-semantic framework provides the basis for a systematic mapping between the interlingua and the syntactic structure. The representation adopted is an extended version of lexical conceptual structure which is suitable to the task of translating between divergent structures for two reasons: (1) it provides an abstraction of language-independent properties from structural idiosyncrasies; and (2) it is compositional in nature. The lexical-semantic approach addresses the divergence problem by using a linguistically grounded mapping that has access to parameter settings in the lexicon. We will examine a number of relevant issues including the problem of defining primitives, the issue of interlinguality, the cross-linguistic coverage of the system, and the mapping between the syntactic structure and the interlingua. A detailed example of lexical-semantic composition will be presented.},
	isbn = {0922-6567},
	url = {http://dx.doi.org/10.1007/BF00402510},
	author = {Dorr, Bonnie J}
}
@conference {16373,
	title = {Uniform techniques for loop optimization},
	booktitle = {Proceedings of the 5th international conference on Supercomputing},
	year = {1991},
	month = {1991///},
	pages = {341 - 352},
	author = {Pugh, William}
}
@article {13890,
	title = {Using thematic roles for lexical-semantic composition in machine translation},
	year = {1991},
	month = {1991///},
	institution = {University of Maryland at College Park},
	address = {College Park, MD, USA},
	author = {Dorr, Bonnie J}
}
@conference {11991,
	title = {A Unified Theory Of Structure From Motion},
	booktitle = {Proceedings of DARPA Image Understanding Workshop},
	year = {1990},
	month = {1990///},
	pages = {271 - 283},
	author = {Spetsakis, M. and Aloimonos, J.}
}
@conference {12002,
	title = {Unification and integration of visual modules},
	booktitle = {Proceedings Image Understanding Workshop},
	year = {1989},
	month = {1989///},
	pages = {507 - 551},
	author = {Aloimonos, J.}
}
@article {12007,
	title = {Unifying Shading and Texture Through an Active Observer},
	journal = {Proceedings of the Royal Society of London. B. Biological Sciences},
	volume = {238},
	year = {1989},
	month = {1989/10/23/},
	pages = {25 - 37},
	abstract = {Shading (variations of image intensity) provides an important cue for understanding the shape of three-dimensional surfaces from monocular views. On the other hand. texture (distribution of discontinuities on the surface) is a strong cue for recovering surface orientation by using monocular images. But given the image of an object or scene, what technique should we use to recover the shape of what is imaged? Resolution of shape from shading requires knowledge of the reflectance of the imaged surface and, usually, the fact that it is smooth (i.e. it shows no discontinuities). Determination of shape from texture requires knowledge of the distribution of surface markings (i.e. discontinuities). One might expect that one method would work when the other does not. I present a theory on how an active observer can determine shape from the image of an object or scene regardless of whether the image is shaded, textured. or both, and without any knowledge of reflectance maps or the distribution of surface markings. The approach is successful because the active observer is able to manipulate the constraints behind the perceptual phenomenon at hand and thus derive a simple solution. Several experimental results are presented with real and synthetic images.},
	doi = {10.1098/rspb.1989.0064},
	url = {http://rspb.royalsocietypublishing.org/content/238/1290/25.abstract},
	author = {Aloimonos, J.}
}
@article {17425,
	title = {The user interface in a hypertext, multiwindow program browser},
	journal = {Interacting with computers},
	volume = {1},
	year = {1989},
	month = {1989///},
	pages = {301 - 337},
	author = {Seabrook,R.H.C. and Shneiderman, Ben}
}
@book {17474,
	title = {User-Friendly Computer Interfaces},
	year = {1989},
	month = {1989///},
	publisher = {Chantico Pub. Co.},
	organization = {Chantico Pub. Co.},
	address = {Carrollton, Texas},
	isbn = {1557110956},
	author = {Shneiderman, Ben}
}
@article {15970,
	title = {Uniform accountability for multiple modes of reasoning},
	journal = {International Journal of Approximate Reasoning},
	volume = {2},
	year = {1988},
	month = {1988/07//},
	pages = {233 - 246},
	abstract = {This article discusses various issues surrounding the general debate on knowledge representation methods and argues in favor of the idea that while many methods are necessary, there also must be a kind of unified nature to the enterprise if it is to serve the needs of intelligence. Specific points include the misleading distinction between probabilistic and logical reasoning regarding the notion of truth and also some matters of nonmonotonicity. An effort is made to sample the broad range of approaches in the literature, with an eye toward such a unification.},
	keywords = {Artificial intelligence, commonsense reasoning, probabilistic logic, probability theory, uncertainty representation},
	isbn = {0888-613X},
	doi = {16/0888-613X(88)90119-3},
	url = {http://www.sciencedirect.com/science/article/pii/0888613X88901193},
	author = {Kanal,Laveen and Perlis, Don}
}
@article {15615,
	title = {A united approach to finding enclosing and enclosed triangles},
	journal = {Proceedings of 26th Allerton Conference on Communication, Control and Computing},
	year = {1988},
	month = {1988///},
	author = {Mount, Dave and Chandran,S.}
}
@article {13883,
	title = {UNITRAN: A PRINCIPLE-BASED PARSER FOR MACHINE TRANSLATION},
	journal = {The MIT parsing volume, 1987-88},
	year = {1988},
	month = {1988///},
	pages = {128 - 128},
	author = {Dorr, Bonnie J}
}
@book {17471,
	title = {User interface strategies {\textquoteright}88 (videotape)},
	year = {1988},
	month = {1988///},
	publisher = {University of Maryland at College Park},
	organization = {University of Maryland at College Park},
	address = {College Park, MD, USA},
	author = {Shneiderman, Ben and Malone,Thomas and Norman,Donald and Foley,James}
}
@conference {11962,
	title = {Using flow field divergence for obstacle avoidance in visual navigation},
	booktitle = {Science Applications International Corp, Proceedings: Image Understanding Workshop,},
	volume = {2},
	year = {1988},
	month = {1988///},
	author = {Nelson, R. and Aloimonos, J.}
}
@article {13884,
	title = {UNITRAN: an interlingual approach to machine translation},
	journal = {Proceedings of the Sixth Conference of the American Association of Artificial Intelligence},
	year = {1987},
	month = {1987///},
	pages = {534 - 539},
	abstract = {Machine translation has been a particularly difficult problem in the area of Natural Language Processing for over two decades. Early approaches to translation failed in part because interaction effects of complex phenomena made translation appear to be unmanageable. Later approaches to the problem have succeeded but are based on many language-specific rules. To capture all natural language phenomena, rule-based systems require an overwhelming number of rules; thus, such translation systems either have limited coverage, or poor performance due to formidable grammar size. This paper presents an implementation of an "interlingual" approach to natural language translation. The UNITRAN system relies on principle-based descriptions of grammar rather than rule-oriented descriptions. The model is based on linguistically motivated principles and their associated parameters of variation. Because a few principles cover all languages, the unmanageable grammar size of alternative approaches is no longer a problem.},
	author = {Dorr, Bonnie J}
}
@conference {17467,
	title = {User interface design and evaluation for an electronic encyclopedia},
	booktitle = {Proc. of the 2nd International Conference on Human-Computer Interaction},
	year = {1987},
	month = {1987///},
	abstract = {The Interactive Encyclopedia System (TIES) has been under development since Fall 1983. It enables users to easily traverse a database of articles by merely pointing at highlighted words in context. This embedded menus approach to hypertext and its user interface design are described with three exploratory studies of TIES use. Plans for future development and studies are offered.},
	author = {Shneiderman, Ben}
}
@conference {17468,
	title = {User interface design for the Hyperties electronic encyclopedia (panel session)},
	booktitle = {Proceedings of the ACM conference on Hypertext},
	series = {HYPERTEXT {\textquoteright}87},
	year = {1987},
	month = {1987///},
	pages = {189 - 194},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	isbn = {0-89791-340-X},
	doi = {10.1145/317426.317441},
	url = {http://doi.acm.org/10.1145/317426.317441},
	author = {Shneiderman, Ben}
}
@article {16808,
	title = {Using 2-way Semijoins in Distributed Query Processing.},
	volume = {ISR-TR-1987-35},
	year = {1987},
	month = {1987///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {In distributed query processing, the semijoin has been used as an effective operator in reducing relations referenced in the query to reduce the total amount of data transmission. In this paper, we propose a new relational algebra operator, 2-way semijoin, which is an extended version of the semijoin, for more cost- effective distributed query processing. The 2-way semijoin is compared to the semijoin in terms of the reduction power and the propagation of reduction effects. We show that the 2-way semijoin has more reduction power than the semijoin and that the propagation of reduction effects by the 2-way semijoin is further than by the semijoin.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu//handle/1903/4544},
	author = {Kang,Hyunmo and Roussopoulos, Nick}
}
@conference {16509,
	title = {Using abductive inferencing to derive complex error classifications for discrete sequential processes},
	booktitle = {Proceedings of the 19th annual symposium on Simulation},
	year = {1986},
	month = {1986///},
	pages = {207 - 225},
	author = {Ahuja,S. B and Reggia, James A.}
}
@article {19006,
	title = {The U1 small nuclear RNA-protein complex selectively binds a 5' splice site in vitro},
	journal = {Cell},
	volume = {33},
	year = {1983},
	month = {1983/06//},
	pages = {509 - 518},
	abstract = {The ability of purified U1 small nuclear RNA-protein complexes (U1 snRNPs) to bind in vitro to two RNAs transcribed from recombinant DNA clones by bacteriophage T7 RNA polymerase has been studied. A transcript which contains sequences corresponding to the small intron and flanking exons of the major mouse beta-globin gene is bound in marked preference to an RNA devoid of splice site sequences. The site of U1 snRNP binding to the globin RNA has been defined by T1 ribonuclease digestion of the RNA-U1 snRNP complex. A 15-17-nucleotide region, including the 5{\textquoteright} splice site, remains undigested and complexed with the snRNP such that it can be co-precipitated by antibodies directed against the U1 snRNP. Partial proteinase K digestion of the U1 snRNP abolishes interaction with the globin RNA, indicating that the snRNP proteins contribute significantly to RNA binding. No RNA cleavage, splicing, or recognition of the 3{\textquoteright} splice site by U1 snRNPs has been detected. Our results are discussed in terms of the probable role of U1 snRNPs in the messenger RNA splicing of eucaryotic cell nuclei.},
	isbn = {00928674},
	doi = {10.1016/0092-8674(83)90432-4},
	url = {http://ukpmc.ac.uk/abstract/MED/6190573},
	author = {Mount, Stephen M. and Pettersson,Ingvar and Hinterberger,Monique and Karmas,Aavo and Steitz,Joan A.}
}
@conference {18450,
	title = {Use of cluster analysis to evaluate software engineering methodologies},
	booktitle = {Proceedings of the 5th international conference on Software engineering},
	series = {ICSE {\textquoteright}81},
	year = {1981},
	month = {1981///},
	pages = {117 - 123},
	publisher = {IEEE Press},
	organization = {IEEE Press},
	address = {Piscataway, NJ, USA},
	abstract = {The development of quantitative measures to evaluate software development techniques is necessary if we are going to develop appropriate methodologies for software production. Data is collected by the Software Engineering Laboratory at NASA Goddard Space Flight Center on developing medium scale projects of up to ten man years effort. In this study, cluster analysis was used on this collected data and several measures are proposed. These measurements are objective, quantifiable, are the results of the methodology, and most important, seem relevant.},
	isbn = {0-89791-146-6},
	url = {http://dl.acm.org/citation.cfm?id=800078.802523},
	author = {Chen,Eric and Zelkowitz, Marvin V}
}
@conference {17463,
	title = {Use of peer ratings in evaluating computer program quality},
	booktitle = {Proceedings of the fifteenth annual SIGCPR conference},
	series = {SIGCPR {\textquoteright}77},
	year = {1977},
	month = {1977///},
	pages = {218 - 226},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Peer review techniques can be useful tools for supplementing programmer education, improving cooperation and communication within programming teams, and providing programmer self-evaluation. This paper will explore the benefits of peer review for practicing professional programmers and describe a framework for administration of an annual or semi-annual peer review process.},
	doi = {10.1145/800100.803247},
	url = {http://doi.acm.org/10.1145/800100.803247},
	author = {Anderson,Nancy and Shneiderman, Ben}
}
@article {15981,
	title = {Utility Functions, Public Goods, and Income Redistribution},
	journal = {Public Finance Review},
	volume = {5},
	year = {1977},
	month = {1977/01/01/},
	pages = {9 - 22},
	abstract = {The results of fiscal incidence studies depend upon the underlying utility functions pertinent to the distribution of public good benefits among income classes. Generally, the use of such functions is not explicitly recognized. By taking, in the first instance, an extended approach to utility based on an original Aaron-McGuire formulation and, in the second instance, a new approach, it is concluded that the income-equalizing tendencies of fiscal activities may be overstated when more conventional analysis is employed.},
	doi = {10.1177/109114217700500102},
	url = {http://pfr.sagepub.com/content/5/1/9.abstract},
	author = {Mann,Arthur J. and Perlis, Don}
}
@conference {16776,
	title = {Using semantic networks for data base management},
	booktitle = {Proceedings of the 1st International Conference on Very Large Data Bases},
	year = {1975},
	month = {1975///},
	pages = {144 - 172},
	author = {Roussopoulos, Nick and Mylopoulos,J.}
}
