@article {19690,
	title = {Topic Models for Translation Domain Adaptation},
	journal = {mimno.infosci.cornell.edu},
	year = {Submitted},
	abstract = {Abstract Topic models have been successfully applied in domain adaptation for translation models. However, previous works applied topic models only on source side and ignored the relations between source and target languages in machine translation. This paper ...},
	url = {http://mimno.infosci.cornell.edu/nips2013ws/nips2013tm_submission_19.pdf},
	author = {Hu, Y and Zhai, K and Edelman, V and Jordan Boyd-Graber}
}
@article {20449,
	title = {Quantum Capacitance-Limited MoS2 Biosensors Enable Remote Label-Free Enzyme Measurements},
	journal = {Nanoscale},
	year = {2019},
	month = {Jan-01-2019},
	issn = {2040-3364},
	doi = {10.1039/C9NR03171E},
	url = {http://pubs.rsc.org/en/Content/ArticleLanding/2019/NR/C9NR03171Ehttp://pubs.rsc.org/en/content/articlepdf/2019/NR/C9NR03171E},
	author = {Le, Son T and Guros, Nicholas B and Bruce, Robert C and Cardone, Antonio and Amin, Niranjana D and Zhang, Siyuan and Klauda, Jeffery and Pant, Harish C and Richter, Curt A and Balijepalli, Arvind}
}
@article {20310,
	title = {Comparative genomic analysis and characterization of incompatibility group FIB plasmid encoded virulence factors of <i>Salmonella enterica</i> isolated from food sources},
	journal = {BMC Genomics},
	year = {2017},
	month = {Jan-12-2017},
	abstract = {BACKGROUND:
The degree to which the chromosomal mediated iron acquisition system contributes to virulence of many bacterial pathogens is well defined. However, the functional roles of plasmid encoded iron acquisition systems, specifically Sit and aerobactin, have yet to be determined for Salmonella spp. In a recent study, Salmonella enterica strains isolated from different food sources were sequenced on the Illumina MiSeq platform and found to harbor the incompatibility group (Inc) FIB plasmid. In this study, we examined sequence diversity and the contribution of factors encoded on the IncFIB plasmid to the virulence of S. enterica.

RESULTS:
Whole genome sequences of seven S. enterica isolates were compared to genomes of serovars of S. enterica isolated from food, animal, and human sources. SeqSero analysis predicted that six strains were serovar Typhimurium and one was Heidelberg. Among the S. Typhimurium strains, single nucleotide polymorphism (SNP)-based phylogenetic analyses revealed that five of the isolates clustered as a single monophyletic S. Typhimurium subclade, while one of the other strains branched with S. Typhimurium from a bovine source. DNA sequence based phylogenetic diversity analyses showed that the IncFIB plasmid-encoded Sit and aerobactin iron acquisition systems are conserved among bacterial species including S. enterica. The IncFIB plasmid was transferred to an IncFIB plasmid deficient strain of S. enterica by conjugation. The transconjugant SE819::IncFIB persisted in human intestinal epithelial (Caco-2) cells at a higher rate than the recipient SE819. Genes of the Sit and aerobactin operons in the IncFIB plasmid were differentially expressed in iron-rich and iron-depleted growth media.

CONCLUSIONS:
Minimal sequence diversity was detected in the Sit and aerobactin operons in the IncFIB plasmids present among different bacterial species, including foodborne Salmonella strains. IncFIB plasmid encoded factors play a role during infection under low-iron conditions in host cells.},
	doi = {10.1186/s12864-017-3954-5},
	url = {https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-017-3954-5},
	author = {Khajanchi, Bijay K. and Hasan, Nur A. and Choi, Seon Young and Han, Jing and Zhao, Shaohua and Rita R Colwell and Cerniglia, Carl E. and Foley, Steven L.}
}
@article {20313,
	title = {Genomic Methods and Microbiological Technologies for Profiling Novel and Extreme Environments for the Extreme Microbiome Project (XMP)},
	journal = {Journal of Biomolecular Techniques : JBT},
	volume = {28},
	year = {2017},
	month = {Jan-04-2017},
	pages = {31 - 39},
	abstract = {The Extreme Microbiome Project (XMP) is a project launched by the Association of Biomolecular Resource Facilities Metagenomics Research Group (ABRF MGRG) that focuses on whole genome shotgun sequencing of extreme and unique environments using a wide variety of biomolecular techniques. The goals are multifaceted, including development and refinement of new techniques for the following: 1) the detection and characterization of novel microbes, 2) the evaluation of nucleic acid techniques for extremophilic samples, and 3) the identification and implementation of the appropriate bioinformatics pipelines. Here, we highlight the different ongoing projects that we have been working on, as well as details on the various methods we use to characterize the microbiome and metagenome of these complex samples. In particular, we present data of a novel multienzyme extraction protocol that we developed, called Polyzyme or MetaPolyZyme. Presently, the XMP is characterizing sample sites around the world with the intent of discovering new species, genes, and gene clusters. Once a project site is complete, the resulting data will be publically available. Sites include Lake Hillier in Western Australia, the {\textquotedblleft}Door to Hell{\textquotedblright} crater in Turkmenistan, deep ocean brine lakes of the Gulf of Mexico, deep ocean sediments from Greenland, permafrost tunnels in Alaska, ancient microbial biofilms from Antarctica, Blue Lagoon Iceland, Ethiopian toxic hot springs, and the acidic hypersaline ponds in Western Australia.},
	issn = {1524-0215},
	doi = {10.7171/jbt.17-2801-004},
	url = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5345951/},
	author = {Tighe, Scott and Afshinnekoo, Ebrahim and Rock, Tara M. and McGrath, Ken and Alexander, Noah and McIntyre, Alexa and Ahsanuddin, Sofia and Bezdan, Daniela and Green, Stefan J. and Joye, Samantha and Stewart Johnson, Sarah and Baldwin, Don A. and Bivens, Nathan and Ajami, Nadim and Carmical, Joseph R. and Herriott, Ian Charold and Rita R Colwell and Donia, Mohamed and Foox, Jonathan and Greenfield, Nick and Hunter, Tim and Hoffman, Jessica and Hyman, Joshua and Jorgensen, Ellen and Krawczyk, Diana and Lee, Jodie and Levy, Shawn and Garcia-Reyero, {\`a}lia and Settles, Matthew and Thomas, Kelley and {\'o}mez, Felipe and Schriml, Lynn and Kyrpides, Nikos and Zaikova, Elena and Penterman, Jon and Mason, Christopher E.}
}
@article {20321,
	title = {Modeling Sustainability: Population, Inequality, Consumption, and Bidirectional Coupling of the Earth and Human Systems},
	journal = {National Science Review},
	year = {2016},
	month = {Nov-12-2016},
	pages = {nww081},
	abstract = {Over the last two centuries, the impact of the Human System has grown dramatically, becoming strongly dominant within the Earth System in many different ways. Consumption, inequality, and population have increased extremely fast, especially since about 1950, threatening to overwhelm the many critical functions and ecosystems of the Earth System. Changes in the Earth System, in turn, have important feedback effects on the Human System, with costly and potentially serious consequences. However, current models do not incorporate these critical feedbacks. We argue that in order to understand the dynamics of either system, Earth System Models must be coupled with Human System Models through bidirectional couplings representing the positive, negative, and delayed feedbacks that exist in the real systems. In particular, key Human System variables, such as demographics, inequality, economic growth, and migration, are not coupled with the Earth System but are instead driven by exogenous estimates, such as United Nations population projections. This makes current models likely to miss important feedbacks in the real Earth{\textendash}Human system, especially those that may result in unexpected or counterintuitive outcomes, and thus requiring different policy interventions from current models. The importance and imminence of sustainability challenges, the dominant role of the Human System in the Earth System, and the essential roles the Earth System plays for the Human System, all call for collaboration of natural scientists, social scientists, and engineers in multidisciplinary research and modeling to develop coupled Earth{\textendash}Human system models for devising effective science-based policies and measures to benefit current and future generations.},
	issn = {2095-5138},
	doi = {10.1093/nsr/nww081},
	url = {https://academic.oup.com/nsr/article-lookup/doi/10.1093/nsr/nww081},
	author = {Motesharrei, Safa and Rivas, Jorge and Kalnay, Eugenia and Asrar, Ghassem R. and Busalacchi, Antonio J. and Cahalan, Robert F. and Cane, Mark A. and Rita R Colwell and Feng, Kuishuang and Franklin, Rachel S. and Hubacek, Klaus and Miralles-Wilhelm, Fernando and Miyoshi, Takemasa and Ruth, Matthias and Sagdeev, Roald and Shirmohammadi, Adel and Shukla, Jagadish and Srebric, Jelena and Yakovenko, Victor M. and Zeng, Ning}
}
@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}
}
@conference {19159,
	title = {Online Latent Dirichlet Allocation with Infinite Vocabulary},
	booktitle = {International Conference on Machine Learning},
	year = {2013},
	type = {Conference Paper},
	abstract = {Topic models based on latent Dirichlet allocation (LDA) assume a predefined vocabulary. This is reasonable in batch settings but not reasonable for streaming and online settings. To address this lacuna, we extend LDA by drawing topics from a Dirichlet process whose base distribution is a distribution over all strings rather than from a finite Dirichlet. We develop inference using online variational inference and{\textemdash}to only consider a finite number of words for each topic{\textemdash}propose heuristics to dynamically order, expand, and contract the set of words we consider in our vocabulary. We show our model can successfully incorporate new words and that it performs better than topic models with finite vocabularies in evaluations of topic quality and classification
performance.},
	author = {Zhai,Ke and Jordan Boyd-Graber}
}
@article {19688,
	title = {Spoiler Alert: Machine Learning Approaches to Detect Social Media Posts with Revelatory Information},
	year = {2013},
	month = {2013/00/01},
	abstract = {ABSTRACT Spoilers{\textemdash}critical plot information about works of fiction that {\textquotedblleft}spoil{\textquotedblright} a viewer{\textquoteright}s enjoyment{\textemdash}have prompted elaborate conventions on social media to allow readers to insulate themselves from spoilers. However, these solutions depend on the ...},
	url = {http://www.umiacs.umd.edu/~jbg/docs/2013_spoiler.pdf},
	author = {Jordan Boyd-Graber and Glasgow, K and Zajac, J S}
}
@article {19130,
	title = {AGORA: Assembly Guided by Optical Restriction Alignment},
	journal = {BMC bioinformatics},
	volume = {13},
	year = {2012},
	month = {2012},
	abstract = {Genome assembly is difficult due to repeated sequences within the genome, which create ambiguities and cause the final assembly to be broken up into many separate sequences (contigs). Long range linking information, such as mate-pairs or mapping data, is necessary to help assembly software resolve repeats, thereby leading to a more complete reconstruction of genomes. Prior work has used optical maps for validating assemblies and scaffolding contigs, after an initial assembly has been produced. However, optical maps have not previously been used within the genome assembly process. Here, we use optical map information within the popular de Bruijn graph assembly paradigm to eliminate paths in the de Bruijn graph which are not consistent with the optical map and help determine the correct reconstruction of the genome.We developed a new algorithm called AGORA: Assembly Guided by Optical Restriction Alignment. AGORA is the first algorithm to use optical map information directly within the de Bruijn graph framework to help produce an accurate assembly of a genome that is consistent with the optical map information provided. Our simulations on bacterial genomes show that AGORA is effective at producing assemblies closely matching the reference sequences.
Additionally, we show that noise in the optical map can have a strong impact on the final assembly quality for some complex genomes, and we also measure how various characteristics of the starting de Bruijn graph may impact the quality of the final assembly. Lastly, we show that a proper choice of restriction enzyme for the optical map may substantially improve the quality of the final assembly.
Our work shows that optical maps can be used effectively to assemble genomes within the de Bruijn graph assembly framework. Our experiments also provide insights into the characteristics of the mapping data that most affect the performance of our algorithm, indicating the potential benefit of more accurate optical mapping technologies, such as nano-coding.
},
	author = {Lin, H.C. and Goldstein, S. and Mendelowitz, L. and Zhou, S. and Wetzel, J. and Schwartz, D.C. and Pop, Mihai}
}
@article {12980,
	title = {BEAGLE: An Application Programming Interface and High-Performance Computing Library for Statistical Phylogenetics},
	journal = {Systematic BiologySyst Biol},
	volume = {61},
	year = {2012},
	month = {2012/01/01/},
	pages = {170 - 173},
	abstract = {Phylogenetic inference is fundamental to our understanding of most aspects of the origin and evolution of life, and in recent years, there has been a concentration of interest in statistical approaches such as Bayesian inference and maximum likelihood estimation. Yet, for large data sets and realistic or interesting models of evolution, these approaches remain computationally demanding. High-throughput sequencing can yield data for thousands of taxa, but scaling to such problems using serial computing often necessitates the use of nonstatistical or approximate approaches. The recent emergence of graphics processing units (GPUs) provides an opportunity to leverage their excellent floating-point computational performance to accelerate statistical phylogenetic inference. A specialized library for phylogenetic calculation would allow existing software packages to make more effective use of available computer hardware, including GPUs. Adoption of a common library would also make it easier for other emerging computing architectures, such as field programmable gate arrays, to be used in the future. We present BEAGLE, an application programming interface (API) and library for high-performance statistical phylogenetic inference. The API provides a uniform interface for performing phylogenetic likelihood calculations on a variety of compute hardware platforms. The library includes a set of efficient implementations and can currently exploit hardware including GPUs using NVIDIA CUDA, central processing units (CPUs) with Streaming SIMD Extensions and related processor supplementary instruction sets, and multicore CPUs via OpenMP. To demonstrate the advantages of a common API, we have incorporated the library into several popular phylogenetic software packages. The BEAGLE library is free open source software licensed under the Lesser GPL and available from http://beagle-lib.googlecode.com. An example client program is available as public domain software.},
	keywords = {Bayesian phylogenetics, gpu, maximum likelihood, parallel computing},
	isbn = {1063-5157, 1076-836X},
	doi = {10.1093/sysbio/syr100},
	url = {http://sysbio.oxfordjournals.org/content/61/1/170},
	author = {Ayres,Daniel L and Darling,Aaron and Zwickl,Derrick J and Beerli,Peter and Holder,Mark T and Lewis,Paul O and Huelsenbeck,John P and Ronquist,Fredrik and Swofford,David L and Cummings, Michael P. and Rambaut,Andrew and Suchard,Marc A}
}
@article {16266,
	title = {GAGE: A Critical Evaluation of Genome Assemblies and Assembly Algorithms},
	journal = {Genome Research},
	volume = {22},
	year = {2012},
	month = {2012},
	pages = {557 - 567},
	abstract = {New sequencing technology has dramatically altered the landscape of whole-genome sequencing, allowing scientists to initiate numerous projects to decode the genomes of previously unsequenced organisms. The lowest-cost technology can generate deep coverage of most species, including mammals, in just a few days. The sequence data generated by one of these projects consist of millions or billions of short DNA sequences (reads) that range from 50 to 150 nt in length. These sequences must then be assembled de novo before most genome analyses can begin. Unfortunately, genome assembly remains a very difficult problem, made more difficult by shorter reads and unreliable long-range linking information. In this study, we evaluated several of the leading de novo assembly algorithms on four different short-read data sets, all generated by Illumina sequencers. Our results describe the relative performance of the different assemblers as well as other significant differences in assembly difficulty that appear to be inherent in the genomes themselves. Three overarching conclusions are apparent: first, that data quality, rather than the assembler itself, has a dramatic effect on the quality of an assembled genome; second, that the degree of contiguity of an assembly varies enormously among different assemblers and different genomes; and third, that the correctness of an assembly also varies widely and is not well correlated with statistics on contiguity. To enable others to replicate our results, all of our data and methods are freely available, as are all assemblers used in this study.},
	doi = {10.1101/gr.131383.111},
	url = {http://genome.cshlp.org/content/22/3/557},
	author = {Salzberg,Steven L. and Phillippy,Adam M and Zimin,Aleksey and Puiu,Daniela and Magoc,Tanja and Koren,Sergey and Treangen,Todd J and Schatz,Michael C and Delcher,Arthur L. and Roberts,Michael and Mar{\c c}ais,Guillaume and Pop, Mihai and Yorke,James A.}
}
@article {19660,
	title = {Global secretome analysis identifies novel mediators of bone metastasis},
	journal = {Cell Research},
	volume = {22},
	year = {2012},
	month = {2012/09//},
	pages = {1339 - 1355},
	abstract = {Bone is the one of the most common sites of distant metastasis of solid tumors. Secreted proteins are known to influence pathological interactions between metastatic cancer cells and the bone stroma. To comprehensively profile secreted proteins associated with bone metastasis, we used quantitative and non-quantitative mass spectrometry to globally analyze the secretomes of nine cell lines of varying bone metastatic ability from multiple species and cancer types. By comparing the secretomes of parental cells and their bone metastatic derivatives, we identified the secreted proteins that were uniquely associated with bone metastasis in these cell lines. We then incorporated bioinformatic analyses of large clinical metastasis datasets to obtain a list of candidate novel bone metastasis proteins of several functional classes that were strongly associated with both clinical and experimental bone metastasis. Functional validation of selected proteins indicated that in vivo bone metastasis can be promoted by high expression of (1) the salivary cystatins CST1, CST2, and CST4; (2) the plasminogen activators PLAT and PLAU; or (3) the collagen functionality proteins PLOD2 and COL6A1. Overall, our study has uncovered several new secreted mediators of bone metastasis and therefore demonstrated that secretome analysis is a powerful method for identification of novel biomarkers and candidate therapeutic targets.},
	keywords = {bone, cancer, metastasis, proteomics, secretome},
	isbn = {1001-0602},
	url = {http://www.nature.com/cr/journal/v22/n9/abs/cr201289a.html},
	author = {Blanco, Mario Andres and LeRoy, Gary and Zia Khan and Ale{\v c}kovi{\'c}, Ma{\v s}a and Zee, Barry M. and Garcia, Benjamin A. and Kang, Yibin}
}
@article {19315,
	title = {A Hybrid System for Error Detection in Electronic Dictionaries},
	number = {CASL-1308-2},
	year = {2012},
	abstract = {A progress report on CASL{\textquoteright}s research on error detection in electronic dictionaries, including a hybrid system, application and evaluation on a second dictionary and a graphical user interface. },
	author = {Zajic, David and David Doermann and Bloodgood,Michael and Rodrigues,Paul and Ye,Peng and Zotkina,Elena}
}
@conference {12423,
	title = {Modeling Images using Transformed Indian Buffet Processes},
	booktitle = {International Conference of Machine Learning},
	year = {2012},
	month = {2012///},
	abstract = {Latent feature models are attractive for image modeling, since images generally contain mul- tiple objects. However, many latent feature models ignore that objects can appear at dif- ferent locations or require pre-segmentation of images. While the transformed Indian buffet process (tIBP) provides a method for modeling transformation-invariant features in unsegmented binary images, its current form is inappropriate for real images because of its computational cost and modeling assumptions. We combine the tIBP with likelihoods appropriate for real images and develop an efficient inference, using the cross- correlation between images and features, that is theoretically and empirically faster than existing inference techniques. Our method discovers rea- sonable components and achieve effective image reconstruction in natural images.},
	author = {Zhai,Ke and Hu,Yuening and Williamson,Sinead and Jordan Boyd-Graber}
}
@conference {12418,
	title = {Mr. LDA: A Flexible Large Scale Topic Modeling Package using Variational Inference in MapReduce},
	booktitle = {Proceedings of ACM International Conference on World Wide Web, 2012},
	year = {2012},
	month = {2012///},
	abstract = {Latent Dirichlet Allocation (LDA) is a popular topic modeling tech- nique for exploring document collections. Because of the increasing prevalence of large datasets, there is a need to improve the scal- ability of inference for LDA. In this paper, we introduce a novel and flexible large scale topic modeling package in MapReduce (Mr. LDA). As opposed to other techniques which use Gibbs sampling, our proposed framework uses variational inference, which easily fits into a distributed environment. More importantly, this variational implementation, unlike highly tuned and specialized implementa- tions based on Gibbs sampling, is easily extensible. We demonstrate two extensions of the models possible with this scalable framework: informed priors to guide topic discovery and extracting topics from a multilingual corpus. We compare the scalability of Mr. LDA against Mahout, an existing large scale topic modeling package. Mr. LDA out-performs Mahout both in execution speed and held-out likelihood.},
	author = {Zhai,Ke and Jordan Boyd-Graber and Asadi,Nima and Alkhouja,Mohamad}
}
@article {14492,
	title = {Privacy in Social Networks},
	journal = {Synthesis Lectures on Data Mining and Knowledge Discovery},
	volume = {3},
	year = {2012},
	month = {2012///},
	pages = {1 - 85},
	author = {Zheleva,E. and Terzi,E. and Getoor, Lise}
}
@conference {19318,
	title = {A Random Forest System Combination Approach for Error Detection in Digital Dictionaries},
	booktitle = {Innovative hybrid approaches to the processing of textual data, EACL 2012 Workshop},
	year = {2012},
	month = {04/2012},
	pages = {78-86},
	abstract = {When digitizing a print bilingual dictionary, whether via optical character recognition or manual entry, it is inevitable that errors are introduced into the electronic version that is created. We investigate automating the process of detecting errors in an XML representation of a digitized print dictionary using a hybrid approach that combines rule-based, feature-based, and language model-based methods. We investigate combining methods and show that using random forests is a promising approach. We find that in isolation, unsupervised methods rival the performance of supervised methods. Random forests typically require training data so we investigate how we can apply random forests to combine individual base methods that are themselves unsupervised without requiring large amounts of training data. Experiments reveal empirically that a relatively small amount of data is sufficient and can potentially be further reduced through specific selection criteria. },
	author = {Bloodgood,Michael and Ye,Peng and Rodrigues,Paul and Zajic, David and David Doermann}
}
@article {18712,
	title = {Rpn1 and Rpn2 coordinate ubiquitin processing factors at the proteasome},
	journal = {Journal of Biological ChemistryJ. Biol. Chem.},
	year = {2012},
	month = {2012/02/08/},
	abstract = {Substrates tagged with (poly)ubiquitin for degradation can be targeted directly to the 26S proteasome where they are proteolysed. Independently, ubiquitin-conjugates may also be delivered by bivalent shuttles. The majority of shuttles attach to the proteasome through a ubiquitin-like domain (UBL) while anchoring cargo at a C-terminal polyubiquitin-binding domain(s). We found that two shuttles of this class, Rad23 and Dsk2, dock at two different receptors embedded within a single subunit of the 19S proteasome regulatory particle (RP), Rpn1. Their association/dissociation constants and affinities for Rpn1 are similar. In contrast, another UBL-containing protein, the deubiquitinase Ubp6, is also anchored by Rpn1, yet dissociates slower, thus behaving as a sometimes proteasome subunit distinct from transiently-associated shuttles. Two neighboring subunits, Rpn10 and Rpn13, show a marked preference for polyubiquitin over UBLs. Rpn10 attaches to the central solenoid portion of Rpn1 although this association is stabilized by the presence of a third subunit, Rpn2. Rpn13 binds directly to the C-terminal portion of Rpn2. These intrinsic polyubiquitin receptors may compete with substrate shuttles for their polyubiquitin-conjugates, thereby aiding release of the emptied shuttles. By binding multiple ubiquitin-processing factors simultaneously, Rpn1 is uniquely suited to coordinate substrate recruitment, deubiquitination, and movement towards the catalytic core. The broad range of affinities for ubiquitin, ubiquitin-like, and non-ubiquitin signals by adjacent yet non-overlapping sites all within the Base illustrates a hub of activity that coordinates the intricate relay of substrates within the proteasome, and consequently influences substrate residency time and commitment to degradation.},
	keywords = {deubiquitination, Proteasome, solenoid, Surface plasmon resonance (SPR), ubiquitin, Ubiquitin-dependent protease},
	isbn = {0021-9258, 1083-351X},
	doi = {10.1074/jbc.M111.316323},
	url = {http://www.jbc.org/content/early/2012/02/08/jbc.M111.316323},
	author = {Rosenzweig,Rina and Bronner,Vered and Zhang,Daoning and Fushman, David and Glickman,Michael H.}
}
@article {18716,
	title = {Structural and biochemical studies of the open state of Lys48-linked diubiquitin},
	journal = {Biochimica et Biophysica Acta (BBA) - Molecular Cell Research},
	year = {2012},
	month = {2012///},
	abstract = {Ubiquitin (Ub) is a small protein highly conserved among eukaryotes and involved in practically all aspects of eukaryotic cell biology. Polymeric chains assembled from covalently-linked Ub monomers function as molecular signals in the regulation of a host of cellular processes. Our previous studies have shown that the predominant state of Lys48-linked di- and tetra-Ub chains at near-physiological conditions is a closed conformation, in which the Ub{\textendash}Ub interface is formed by the hydrophobic surface residues of the adjacent Ub units. Because these very residues are involved in (poly)Ub interactions with the majority of Ub-binding proteins, their sequestration at the Ub{\textendash}Ub interface renders the closed conformation of polyUb binding incompetent. Thus the existence of open conformation(s) and the interdomain motions opening and closing the Ub{\textendash}Ub interface is critical for the recognition of Lys48-linked polyUb by its receptors. Knowledge of the conformational properties of a polyUb signal is essential for our understanding of its specific recognition by various Ub-receptors. Despite their functional importance, open states of Lys48-linked chains are poorly characterized. Here we report a crystal structure of the open state of Lys48-linked di-Ub. Moreover, using NMR, we examined interactions of the open state of this chain (at pH4.5) with a Lys48-linkage-selective receptor, the UBA2 domain of a shuttle protein hHR23a. Our results show that di-Ub binds UBA2 in the same mode and with comparable affinity as the closed state. Our data suggest a mechanism for polyUb signal recognition, whereby Ub-binding proteins select specific conformations out of the available ensemble of polyUb chain conformations. This article is part of a Special Issue entitled: Ubiquitin Drug Discovery and Diagnostics.},
	keywords = {Lys48-linked diubiquitin, Lysine-48 linkage selectivity, polyubiquitin, ubiquitin, Ubiquitin-associated domain},
	isbn = {0167-4889},
	doi = {10.1016/j.bbamcr.2012.04.003},
	url = {http://www.sciencedirect.com/science/article/pii/S0167488912000948},
	author = {Lai,Ming-Yih and Zhang,Daoning and LaRonde-LeBlanc,Nicole and Fushman, David}
}
@conference {15059,
	title = {Submodular Dictionary Learning for Sparse Coding},
	booktitle = {IEEE conference on Computer Vision and Pattern Recognition},
	year = {2012},
	month = {2012///},
	abstract = {A greedy-based approach to learn a compact and dis-criminative dictionary for sparse representation is pre-
sented. We propose an objective function consisting of two
components: entropy rate of a random walk on a graph
and a discriminative term. Dictionary learning is achieved
by finding a graph topology which maximizes the objec-
tive function. By exploiting the monotonicity and submod-
ularity properties of the objective function and the matroid
constraint, we present a highly efficient greedy-based op-
timization algorithm. It is more than an order of magni-
tude faster than several recently proposed dictionary learn-
ing approaches. Moreover, the greedy algorithm gives a
near-optimal solution with a (1/2)-approximation bound.
Our approach yields dictionaries having the property that
feature points from the same class have very similar sparse
codes. Experimental results demonstrate that our approach
outperforms several recently proposed dictionary learning
techniques for face, action and object category recognition.
},
	author = {Zhuolin Jiang and Zhang, G. and Davis, Larry S.}
}
@article {18452,
	title = {What have we learned about software engineering?},
	journal = {Communications of the ACM},
	volume = {55},
	year = {2012},
	month = {2012/02//},
	pages = {38 - 39},
	abstract = {Upon closer examination, everything old appears to be new again in the realm of software engineering.},
	isbn = {0001-0782},
	doi = {10.1145/2076450.2076463},
	url = {http://doi.acm.org/10.1145/2076450.2076463},
	author = {Zelkowitz, Marvin V}
}
@article {15142,
	title = {Adaptively secure broadcast, revisited},
	journal = {Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing},
	year = {2011},
	month = {2011///},
	abstract = {We consider the classical problem of synchronous broadcast with dishonest majority, whena public-key infrastructure and digital signatures are available. In a surprising result, Hirt and
Zikas (Eurocrypt 2010) recently observed that all existing protocols for this task are insecure
against an adaptive adversary who can choose which parties to corrupt as the protocol progresses.
Moreover, they prove an impossibility result for adaptively secure broadcast in their setting.
We argue that the communication model adopted by Hirt and Zikas is unrealistically pes-
simistic. We revisit the problem of adaptively secure broadcast in a more natural synchronous
model (with rushing), and show that broadcast is possible in this setting for an arbitrary num-
ber of corruptions. Our positive result holds under a strong, simulation-based definition in the
universal-composability framework.
We also study the impact of adaptive attacks on protocols for secure multi-party computation
where broadcast is used as a sub-routine.
},
	author = {Garay,J. A and Katz, Jonathan and Kumaresan,R. and Zhou,H.S.}
}
@article {19279,
	title = {Analysis of SystemC actor networks for efficient synthesis},
	journal = {ACM Trans. Embed. Comput. Syst.},
	volume = {10},
	year = {2011},
	month = {2011},
	pages = {18:1 - 18:34},
	abstract = {Applications in the signal processing domain are often modeled by dataflow graphs. Due to heterogeneous complexity requirements, these graphs contain both dynamic and static dataflow actors. In previous work, we presented a generalized clustering approach for these heterogeneous dataflow graphs in the presence of unbounded buffers. This clustering approach allows the application of static scheduling methodologies for static parts of an application during embedded software generation for multiprocessor systems. It systematically exploits the predictability and efficiency of the static dataflow model to obtain latency and throughput improvements. In this article, we present a generalization of this clustering technique to dataflow graphs with bounded buffers, therefore enabling synthesis for embedded systems without dynamic memory allocation. Furthermore, a case study is given to demonstrate the performance benefits of the approach.},
	keywords = {actor-oriented design, clustering, Dataflow analysis, scheduling},
	isbn = {1539-9087},
	url = {http://doi.acm.org/10.1145/1880050.1880054},
	author = {Falk, Joachim and Zebelein, Christian and Keinert, Joachim and Haubelt, Christian and Teich, Juergen and Bhattacharyya, Shuvra S.}
}
@conference {19269,
	title = {Applying graphics processor acceleration in a software defined radio prototyping environment},
	booktitle = {2011 22nd IEEE International Symposium on Rapid System Prototyping (RSP)},
	year = {2011},
	month = {2011},
	pages = {67 - 73},
	abstract = {With higher bandwidth requirements and more complex protocols, software defined radio (SDR) has ever growing computational demands. SDR applications have different levels of parallelism that can be exploited on multicore platforms, but design and programming difficulties have inhibited the adoption of specialized multicore platforms like graphics processors (GPUs). In this work we propose a new design flow that augments a popular existing SDR development environment (GNU Radio), with a dataflow foundation and a stand-alone GPU accelerated library. The approach gives an SDR developer the ability to prototype a GPU accelerated application and explore its design space fast and effectively. We demonstrate this design flow on a standard SDR benchmark and show that deciding how to utilize a GPU can be non-trivial for even relatively simple applications.},
	keywords = {Acceleration, coprocessors, dataflow foundation, GNU radio, Graphics processing unit, graphics processor acceleration, Kernel, Libraries, multicore platforms, Multicore processing, PARALLEL PROCESSING, Pipelines, Protocols, software defined radio prototyping environment, software radio, stand-alone GPU accelerated library},
	author = {Plishker,W. and Zaki, G.F. and Bhattacharyya, Shuvra S. and Clancy, C. and Kuykendall, J.}
}
@conference {13067,
	title = {Birdlets: Subordinate categorization using volumetric primitives and pose-normalized appearance},
	booktitle = {Computer Vision (ICCV), 2011 IEEE International Conference on},
	year = {2011},
	month = {2011/11//},
	pages = {161 - 168},
	abstract = {Subordinate-level categorization typically rests on establishing salient distinctions between part-level characteristics of objects, in contrast to basic-level categorization, where the presence or absence of parts is determinative. We develop an approach for subordinate categorization in vision, focusing on an avian domain due to the fine-grained structure of the category taxonomy for this domain. We explore a pose-normalized appearance model based on a volumetric poselet scheme. The variation in shape and appearance properties of these parts across a taxonomy provides the cues needed for subordinate categorization. Training pose detectors requires a relatively large amount of training data per category when done from scratch; using a subordinate-level approach, we exploit a pose classifier trained at the basic-level, and extract part appearance and shape information to build subordinate-level models. Our model associates the underlying image pattern parameters used for detection with corresponding volumetric part location, scale and orientation parameters. These parameters implicitly define a mapping from the image pixels into a pose-normalized appearance space, removing view and pose dependencies, facilitating fine-grained categorization from relatively few training examples.},
	keywords = {appearance, Birdlets;category, categorization;subordinate-level, detection;pose, detectors;pose-normalized, distinctions;shape, estimation;, extraction;pose, extraction;subordinate-level, information, model;salient, models;volumetric, pixels;part, poselet, primitives;computer, resolution;information, retrieval;object, scheme;volumetric, taxonomy;computer, vision;image},
	doi = {10.1109/ICCV.2011.6126238},
	author = {Farrell,R. and Oza,O. and Zhang,Ning and Morariu,V.I. and Darrell,T. and Davis, Larry S.}
}
@conference {12435,
	title = {Blurring-invariant Riemannian metrics for comparing signals and images},
	booktitle = {2011 IEEE International Conference on Computer Vision (ICCV)},
	year = {2011},
	month = {2011/11/06/13},
	pages = {1770 - 1775},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We propose a novel Riemannian framework for comparing signals and images in a manner that is invariant to their levels of blur. This framework uses a log-Fourier representation of signals/images in which the set of all possible Gaussian blurs of a signal, i.e. its orbits under semigroup action of Gaussian blur functions, is a straight line. Using a set of Riemannian metrics under which the group actions are by isometries, the orbits are compared via distances between orbits. We demonstrate this framework using a number of experimental results involving 1D signals and 2D images.},
	keywords = {blurring-invariant Riemannian metrics, Estimation, Fourier transforms, Gaussian blur function, Gaussian processes, image representation, log-Fourier representation, measurement, Orbits, Polynomials, signal representation, Space vehicles, vectors},
	isbn = {978-1-4577-1101-5},
	doi = {10.1109/ICCV.2011.6126442},
	author = {Zhengwu Zhang and Klassen, E. and Srivastava, A. and Turaga,P. and Chellapa, Rama}
}
@conference {18551,
	title = {Boosting the scalability of botnet detection using adaptive traffic sampling},
	booktitle = {Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security},
	series = {ASIACCS {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {124 - 134},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Botnets pose a serious threat to the health of the Internet. Most current network-based botnet detection systems require deep packet inspection (DPI) to detect bots. Because DPI is a computational costly process, such detection systems cannot handle large volumes of traffic typical of large enterprise and ISP networks. In this paper we propose a system that aims to efficiently and effectively identify a small number of suspicious hosts that are likely bots. Their traffic can then be forwarded to DPI-based botnet detection systems for fine-grained inspection and accurate botnet detection. By using a novel adaptive packet sampling algorithm and a scalable spatial-temporal flow correlation approach, our system is able to substantially reduce the volume of network traffic that goes through DPI, thereby boosting the scalability of existing botnet detection systems. We implemented a proof-of-concept version of our system, and evaluated it using real-world legitimate and botnet-related network traces. Our experimental results are very promising and suggest that our approach can enable the deployment of botnet-detection systems in large, high-speed networks.},
	keywords = {adaptive sampling, botnet, intrusion detection, NETWORK SECURITY},
	isbn = {978-1-4503-0564-8},
	doi = {10.1145/1966913.1966930},
	url = {http://doi.acm.org/10.1145/1966913.1966930},
	author = {Zhang,Junjie and Luo,Xiapu and Perdisci,Roberto and Gu,Guofei and Lee,Wenke and Feamster, Nick}
}
@article {12984,
	title = {Can Deliberately Incomplete Gene Sample Augmentation Improve a Phylogeny Estimate for the Advanced Moths and Butterflies (Hexapoda: Lepidoptera)?},
	journal = {Systematic BiologySyst Biol},
	volume = {60},
	year = {2011},
	month = {2011/12/01/},
	pages = {782 - 796},
	abstract = {This paper addresses the question of whether one can economically improve the robustness of a molecular phylogeny estimate by increasing gene sampling in only a subset of taxa, without having the analysis invalidated by artifacts arising from large blocks of missing data. Our case study stems from an ongoing effort to resolve poorly understood deeper relationships in the large clade Ditrysia ( > 150,000 species) of the insect order Lepidoptera (butterflies and moths). Seeking to remedy the overall weak support for deeper divergences in an initial study based on five nuclear genes (6.6 kb) in 123 exemplars, we nearly tripled the total gene sample (to 26 genes, 18.4 kb) but only in a third (41) of the taxa. The resulting partially augmented data matrix (45\% intentionally missing data) consistently increased bootstrap support for groupings previously identified in the five-gene (nearly) complete matrix, while introducing no contradictory groupings of the kind that missing data have been predicted to produce. Our results add to growing evidence that data sets differing substantially in gene and taxon sampling can often be safely and profitably combined. The strongest overall support for nodes above the family level came from including all nucleotide changes, while partitioning sites into sets undergoing mostly nonsynonymous versus mostly synonymous change. In contrast, support for the deepest node for which any persuasive molecular evidence has yet emerged (78{\textendash}85\% bootstrap) was weak or nonexistent unless synonymous change was entirely excluded, a result plausibly attributed to compositional heterogeneity. This node (Gelechioidea + Apoditrysia), tentatively proposed by previous authors on the basis of four morphological synapomorphies, is the first major subset of ditrysian superfamilies to receive strong statistical support in any phylogenetic study. A {\textquotedblleft}more-genes-only{\textquotedblright} data set (41 taxa{\texttimes}26 genes) also gave strong signal for a second deep grouping (Macrolepidoptera) that was obscured, but not strongly contradicted, in more taxon-rich analyses.},
	keywords = {Ditrysia, gene sampling, Hexapoda, Lepidoptera, missing data, molecular phylogenetics, nuclear genes, taxon sampling},
	isbn = {1063-5157, 1076-836X},
	doi = {10.1093/sysbio/syr079},
	url = {http://sysbio.oxfordjournals.org/content/60/6/782},
	author = {Cho,Soowon and Zwick,Andreas and Regier,Jerome C and Mitter,Charles and Cummings, Michael P. and Yao,Jianxiu and Du,Zaile and Zhao,Hong and Kawahara,Akito Y and Weller,Susan and Davis,Donald R and Baixeras,Joaquin and Brown,John W and Parr,Cynthia}
}
@conference {12105,
	title = {A case study of measuring process risk for early insights into software safety},
	booktitle = {Software Engineering (ICSE), 2011 33rd International Conference on},
	year = {2011},
	month = {2011/05//},
	pages = {623 - 632},
	abstract = {In this case study, we examine software safety risk in three flight hardware systems in NASA{\textquoteright}s Constellation spaceflight program. We applied our Technical and Process Risk Measurement (TPRM) methodology to the Constellation hazard analysis process to quantify the technical and process risks involving software safety in the early design phase of these projects. We analyzed 154 hazard reports and collected metrics to measure the prevalence of software in hazards and the specificity of descriptions of software causes of hazardous conditions. We found that 49-70\% of 154 hazardous conditions could be caused by software or software was involved in the prevention of the hazardous condition. We also found that 12-17\% of the 2013 hazard causes involved software, and that 23-29\% of all causes had a software control. The application of the TRPM methodology identified process risks in the application of the hazard analysis process itself that may lead to software safety risk.},
	keywords = {analysis;software, and, computing;risk, constellation, control;software, Hardware, maintenance;, measurement;aerospace, measurement;software, NASA, process, program;TPRM;flight, risk, safety;technical, spaceflight, systems;process},
	doi = {10.1145/1985793.1985881},
	author = {Layman,L. and Basili, Victor R. and Zelkowitz, Marvin V and Fisher,K.L.}
}
@article {13738,
	title = {Citation Handling for Improved Summarization of Scientific Documents},
	year = {2011},
	month = {2011/07/25/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {In this paper we present the first steps toward improving summarizationof scientific documents through citation analysis and parsing. Prior
work (Mohammad et al., 2009) argues that citation texts (sentences that
cite other papers) play a crucial role in automatic summarization of a
topical area, but did not take into account the noise introduced by the
citations themselves. We demonstrate that it is possible to improve
summarization output through careful handling of these citations. We
base our experiments on the application of an improved trimming approach
to summarization of citation texts extracted from Question-Answering and
Dependency-Parsing documents. We demonstrate that confidence scores from
the Stanford NLP Parser (Klein and Manning, 2003) are significantly
improved, and that Trimmer (Zajic et al., 2007), a sentence-compression
tool, is able to generate higher-quality candidates. Our summarization
output is currently used as part of a larger system, Action Science
Explorer (ASE) (Gove, 2011).
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/11822},
	author = {Whidby,Michael and Zajic, David and Dorr, Bonnie J}
}
@conference {13531,
	title = {Correcting Errors in Digital Lexicographic Resources Using a Dictionary Manipulation Language},
	booktitle = {Electronic lexicography in the 21st century: new applications for new users (eLEX2011)},
	year = {2011},
	month = {2011///},
	pages = {297 - 301},
	abstract = {We describe a paradigm for combining manual and automatic error correction of noisy structured lexicographic data. Modifications to the structure and underlying text of the lexicographic data are expressed in a simple, interpreted programming language. Dictionary Manipulation Language (DML) commands identify nodes by unique identifiers, and manipulations are performed using simple commands such as create, move, set text, etc. Corrected lexicons are produced by applying sequences of DML commands to the source version of the lexicon. DML commands can be written manually to repair one-off errors or generated automatically to correct recurring problems. We discuss advantages of the paradigm for the task of editing digital bilingual dictionaries.},
	author = {Zajic, David and Maxwell,Michael and David Doermann and Rodrigues,Paul and Bloodgood,Michael}
}
@article {15280,
	title = {A cost-aggregating integer linear program for motif finding},
	journal = {Journal of Discrete Algorithms},
	volume = {9},
	year = {2011},
	month = {2011/12//},
	pages = {326 - 334},
	abstract = {In the motif finding problem one seeks a set of mutually similar substrings within a collection of biological sequences. This is an important and widely-studied problem, as such shared motifs in DNA often correspond to regulatory elements. We study a combinatorial framework where the goal is to find substrings of a given length such that the sum of their pairwise distances is minimized. We describe a novel integer linear program for the problem, which uses the fact that distances between substrings come from a limited set of possibilities allowing for aggregate consideration of sequence position pairs with the same distances. We show how to tighten its linear programming relaxation by adding an exponential set of constraints and give an efficient separation algorithm that can find violated constraints, thereby showing that the tightened linear program can still be solved in polynomial time. We apply our approach to find optimal solutions for the motif finding problem and show that it is effective in practice in uncovering known transcription factor binding sites.},
	keywords = {Computational Biology, Integer linear programming, Sequence motif finding},
	isbn = {1570-8667},
	doi = {10.1016/j.jda.2011.04.001},
	url = {http://www.sciencedirect.com/science/article/pii/S157086671100044X},
	author = {Kingsford, Carl and Zaslavsky,Elena and Singh,Mona}
}
@conference {13535,
	title = {Detecting Structural Irregularity in Electronic Dictionaries Using Language Modeling},
	booktitle = {Electronic lexicography in the 21st century: new applications for new users (eLEX2011)},
	year = {2011},
	month = {2011///},
	pages = {227 - 232},
	abstract = {Dictionaries are often developed using Extensible Markup Language (XML)-based standards. Very often, these standards allow many high-level repeating elements to represent lexical entries, and utilize descendants of these repeating elements to represent the structure within each lexical entry, in the form of an XML tree. In many cases, dictionaries are published that have errors and inconsistencies that would be too expensive to find manually. This paper discusses a method for dictionary writers to audit structural regularity across entries in a dictionary, quickly, by using statistical language modelling. The approach learns the patterns of XML nodes that could occur within an XML tree, and then calculates the probability of each XML tree in the dictionary against these patterns to look for entries that diverge from the norm.},
	author = {Rodrigues,Paul and Zajic, David and Bloodgood,Michael and Ye,Peng and David Doermann}
}
@article {19267,
	title = {The DSPCAD Integrative Command Line Environment: Introduction to DICE Version 1.1},
	year = {2011},
	month = {2011},
	abstract = {DICE (the DSPCAD Integrative Command Line Environment) is a package of utilities that facilitates efficient management of software projects. Key areas of emphasis in DICE are cross-platform operation, support for projects that integrate heterogeneous programming languages, and support for applying and integrating different kinds of design and testing methodologies. The package is being developed at the University of Maryland to facilitate the research and teaching of methods for implementation, testing, evolution, and revision of engineering software. The package is also being developed as a foundation for developing experimental research software for techniques and tools in the area of computer-aided design (CAD) of digital signal processing (DSP) systems. The package is intended for cross-platform operation, and is currently being developed and used actively on the Linux, Mac OS, Solaris, and Windows (equipped with Cygwin) platforms. This report provides an introduction to DICE, and provides background on some of the key features in DICE Version 1.1. This report also gives a brief introduction to dicelang, which is a plug-in package for DICE that provides additional utilities, libraries, and tools for managing software projects in specific programming languages.},
	keywords = {*SOFTWARE ENGINEERING, COMPUTER PROGRAMMING, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER PROGRAMS, DICE(COMPUTER PROGRAM), programming languages, Project management},
	author = {Bhattacharyya, Shuvra S. and Plishker,William and Chung-Ching Shen and Sane, Nimish and Zaki, George}
}
@inbook {12460,
	title = {Face Tracking and Recognition in Video},
	booktitle = {Handbook of Face RecognitionHandbook of Face Recognition},
	year = {2011},
	month = {2011///},
	pages = {323 - 351},
	publisher = {Springer London},
	organization = {Springer London},
	abstract = {In this chapter, we describe the utility of videos in enhancing performance of image-based recognition tasks. We discuss a joint tracking-recognition framework that allows for using the motion information in a video to better localize and identify the person in the video using still galleries. We discuss how to jointly capture facial appearance and dynamics to obtain a parametric representation for video-to-video recognition. We discuss recognition in multi-camera networks where the probe and gallery both consist of multi-camera videos. Concluding remarks and directions for future research are provided.},
	isbn = {978-0-85729-932-1},
	url = {http://dx.doi.org/10.1007/978-0-85729-932-1_13},
	author = {Chellapa, Rama and Du,Ming and Turaga,Pavan and Zhou,Shaohua Kevin},
	editor = {Li,Stan Z. and Jain,Anil K.}
}
@conference {12444,
	title = {Face tracking in low resolution videos under illumination variations},
	booktitle = {2011 18th IEEE International Conference on Image Processing (ICIP)},
	year = {2011},
	month = {2011/09/11/14},
	pages = {781 - 784},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In practical face tracking applications, the face region is often small and affected by illumination variations. We address this problem by using a new feature, namely the Gradient-Logarithmic Field (GLF) feature, in the particle filter framework. The GLF feature is robust under illumination variations and the GLF-based tracker does not assume any model for the face being tracked and is effective in low-resolution video. Experimental results show that the proposed GFL-based tracker works well under significant illumination changes and outperforms some of the state-of-the-art algorithms.},
	keywords = {Adaptation models, Computational modeling, Face, face recognition, face tracking, GLF-based tracker, gradient methods, gradient-logarithmic field feature, illumination variations, lighting, low resolution videos, low-resolution, particle filter, particle filter framework, particle filtering (numerical methods), Robustness, tracking, video signal processing, Videos, Visual face tracking},
	isbn = {978-1-4577-1304-0},
	doi = {10.1109/ICIP.2011.6116672},
	author = {Zou, W.W.W. and Chellapa, Rama and Yuen, P.C.}
}
@conference {17184,
	title = {HCI for peace: from idealism to concrete steps},
	booktitle = {PART 2 {\textemdash}{\textemdash}{\textemdash}{\textendash} Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems},
	series = {CHI EA {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {613 - 616},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This panel will contribute diverse perspectives on the use of computer technology to promote peace and prevent armed conflict. These perspectives include: the use of social media to promote democracy and citizen participation, the role of computers in helping people communicate across division lines in zones of conflict, how persuasive technology can promote peace, and how interaction design can play a role in post-conflict reconciliation.},
	keywords = {cyprus, peace, persuasive technology, post-conflict reconciliation, social media, value sensitive design, war},
	doi = {10.1145/1979482.1979493},
	url = {http://doi.acm.org/10.1145/1979482.1979493},
	author = {Hourcade,Juan Pablo and Bullock-Rest,Natasha E. and Friedman,Batya and Nelson,Mark and Shneiderman, Ben and Zaphiris,Panayiotis}
}
@article {13004,
	title = {Increased gene sampling yields robust support for higher-level clades within Bombycoidea (Lepidoptera)},
	journal = {Systematic Entomology},
	volume = {36},
	year = {2011},
	month = {2011/01/01/},
	pages = {31 - 43},
	abstract = {This study has as its primary aim the robust resolution of higher-level relationships within the lepidopteran superfamily Bombycoidea. Our study builds on an earlier analysis of five genes (\~{}6.6 kbp) sequenced for 50 taxa from Bombycoidea and its sister group Lasiocampidae, plus representatives of other macrolepidoteran superfamilies. The earlier study failed to yield strong support for the monophyly of and basal splits within Bombycoidea, among others. Therefore, in an effort to increase support specifically for higher-level nodes, we generated 11.7 kbp of additional data from 20 genes for 24 of 50 bombycoid and lasiocampid taxa. The data from the genes are all derived from protein-coding nuclear genes previously used to resolve other lepidopteran relationships. With these additional data, all but a few higher-level nodes are strongly supported. Given our decision to minimize project costs by augmenting genes for only 24 of the 50 taxa, we explored whether the resulting pattern of missing data in the combined-gene matrix introduced a nonphylogenetic bias, a possibility reported by others. This was achieved by comparing node support values (i.e. nonparametric bootstrap values) based on likelihood and parsimony analyses of three datasets that differ in their number of taxa and level of missing data: 50 taxa/5 genes (dataset A), 50 taxa/25 genes (dataset B) and 24 taxa/25 genes (dataset C). Whereas datasets B and C provided similar results for common nodes, both frequently yielded higher node support relative to dataset A, arguing that: (i) more data yield increased node support and (ii) partial gene augmentation does not introduce an obvious nonphylogenetic bias. A comparison of single-gene bootstrap analyses identified four nodes for which one or two of the 25 genes provided modest to strong support for a grouping not recovered by the combined-gene result. As a summary proposal, two of these four groupings (one each within Bombycoidea and Lasiocampidae) were deemed sufficiently problematic to regard them as unresolved trichotomies. Since the alternative groupings were always highly localized on the tree, we did not judge a combined-gene analysis to present a problem outside those regions. Based on our robustly resolved results, we have revised the classification of Bombycoidea: the family Bombycidae is restricted to its nominate subfamily, and its tribe Epiini is elevated to subfamily rank (Epiinae stat.rev.), whereas the bombycid subfamily Phiditiinae is reinstated as a separate family (Phiditiidae stat.rev.). The bombycid subfamilies Oberthueriinae Kuznetzov \& Stekolnikov, 1985, syn.nov. and Prismostictinae Forbes, 1955, syn.nov., and the family Mirinidae Kozlov, 1985, syn.nov. are established as subjective junior synonyms of Endromidae Boisduval, 1828. The family Anthelidae (Lasiocampoidea) is reincluded in the superfamily Bombycoidea.},
	isbn = {1365-3113},
	doi = {10.1111/j.1365-3113.2010.00543.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1365-3113.2010.00543.x/abstract;jsessionid=B5B1F8BF73034A4C41427FB1FBD7383F.d02t04},
	author = {Zwick,Andreas and Regier,Jerome C and Mitter,Charles and Cummings, Michael P.}
}
@article {18579,
	title = {Instrumenting home networks},
	journal = {SIGCOMM Comput. Commun. Rev.},
	volume = {41},
	year = {2011},
	month = {2011///},
	pages = {84 - 89},
	abstract = {In managing and troubleshooting home networks, one of the challenges is in knowing what is actually happening. Availability of a record of events that occurred on the home network before trouble appeared would go a long way toward addressing that challenge. In this position/work-in-progress paper, we consider requirements for a general-purpose logging facility for home networks. Such a facility, if properly designed, would potentially have other uses. We describe several such uses and discuss requirements to be considered in the design of a logging platform that would be widely supported and accepted. We also report on our initial deployment of such a facility.},
	keywords = {home network management, home network troubleshooting},
	isbn = {0146-4833},
	doi = {10.1145/1925861.1925875},
	url = {http://doi.acm.org/10.1145/1925861.1925875},
	author = {Calvert,Kenneth L. and Edwards,W. Keith and Feamster, Nick and Grinter,Rebecca E. and Deng,Ye and Zhou,Xuzi}
}
@conference {13947,
	title = {Kernel partial least squares for speaker recognition},
	booktitle = {Twelfth Annual Conference of the International Speech Communication Association},
	year = {2011},
	month = {2011///},
	abstract = {I-vectors are a concise representation of speaker characteristics. Recent advances in speaker recognition have utilized their ability to capture speaker and channel variability to develop efficient recognition engines. Inter-speaker relationships in the i-vector space are non-linear. Accomplishing effective speaker recognition requires a good modeling of these non-linearities and can be cast as a machine learning problem. In this paper, we propose a kernel partial least squares (kernel PLS, or KPLS) framework for modeling speakers in the i-vectors space. The resulting recognition system is tested across several conditions of the NIST SRE 2010 extended core data set and compared against state-of-the-art systems: Joint Factor Analysis (JFA), Probabilistic Linear Discriminant Analysis (PLDA), and Cosine Distance Scoring (CDS) classifiers. Improvements are shown.},
	author = {Srinivasan,B.V. and Garcia-Romero,D. and Zotkin,Dmitry N and Duraiswami, Ramani}
}
@conference {18922,
	title = {The Life Game: Cognitive Strategies for Repeated Stochastic Games},
	year = {2011},
	month = {2011/10//},
	pages = {95 - 102},
	abstract = {Standard models in bio-evolutionary game theory involve repetitions of a single stage game (e.g., the Prisoner{\textquoteright}s Dilemma or the Stag Hunt); but it is clear that repeatedly playing the same stage game is not an accurate model of most individuals{\textquoteright} lives. Rather, individuals{\textquoteright} interactions with others correspond to many different kinds of stage games. In this work, we concentrate on discovering behavioral strategies that are successful for the life game, in which the stage game is chosen stochastically at each iteration. We present a cognitive agent model based on Social Value Orientation (SVO) theory. We provide extensive evaluations of our model{\textquoteright}s performance, both against standard agents from the game theory literature and against a large set of life-game agents written by students in two different countries. Our empirical results suggest that for life-game strategies to be successful in environments with such agents, it is important (i) to be unforgiving with respect to trust behavior and (ii) to use adaptive, fine-grained opponent models of the other agents.},
	keywords = {adaptive model, behavioral strategy, bioevolutionary game theory, cognitive agent model, fine-grained opponent model, game theory, iteration, iterative methods, life game, prisoner{\textquoteright}s dilemma, repeated stochastic games, social value orientation theory, stag hunt, stage game, Stochastic processes, trust behavior},
	doi = {10.1109/PASSAT/SocialCom.2011.62},
	author = {Cheng,Kan-Leung and Zuckerman,I. and Nau, Dana S. and Golbeck,J.}
}
@article {13945,
	title = {Linear versus Mel Frequency Cepstral Coefficients for Speaker Recognition},
	journal = {IEEE Automatic Speech Recognition and Understanding Workshop},
	year = {2011},
	month = {2011///},
	abstract = {Mel-frequency cepstral coefficients (MFCC) havebeen dominantly used in speaker recognition as well as in speech
recognition. However, based on theories in speech production,
some speaker characteristics associated with the structure of the
vocal tract, particularly the vocal tract length, are reflected more
in the high frequency range of speech. This insight suggests that
a linear scale in frequency may provide some advantages in
speaker recognition over the mel scale. Based on two state-of-the-
art speaker recognition back-end systems (one Joint Factor
Analysis system and one Probabilistic Linear Discriminant
Analysis system), this study compares the performances between
MFCC and LFCC (Linear frequency cepstral coefficients) in the
NIST SRE (Speaker Recognition Evaluation) 2010 extended-core
task. Our results in SRE10 show that, while they are
complementary to each other, LFCC consistently outperforms
MFCC, mainly due to its better performance in the female trials.
This can be explained by the relatively shorter vocal tract in
females and the resulting higher formant frequencies in speech.
LFCC benefits more in female speech by better capturing the
spectral characteristics in the high frequency region. In addition,
our results show some advantage of LFCC over MFCC in
reverberant speech. LFCC is as robust as MFCC in the babble
noise, but not in the white noise. It is concluded that LFCC
should be more widely used, at least for the female trials, by the
mainstream of the speaker recognition community.
},
	author = {Zhou,X. and Garcia-Romero,D. and Duraiswami, Ramani and Espy-Wilson,C. and Shamma,S.}
}
@article {16039,
	title = {Medication Reconciliation: Work Domain Ontology, Prototype Development, and a Predictive Model},
	journal = {AMIA Annual Symposium ProceedingsAMIA Annu Symp Proc},
	volume = {2011},
	year = {2011},
	month = {2011///},
	pages = {878 - 887},
	abstract = {Medication errors can result from administration inaccuracies at any point of care and are a major cause for concern. To develop a successful Medication Reconciliation (MR) tool, we believe it necessary to build a Work Domain Ontology (WDO) for the MR process. A WDO defines the explicit, abstract, implementation-independent description of the task by separating the task from work context, application technology, and cognitive architecture. We developed a prototype based upon the WDO and designed to adhere to standard principles of interface design. The prototype was compared to Legacy Health System{\textquoteright}s and Pre-Admission Medication List Builder MR tools via a Keystroke-Level Model analysis for three MR tasks. The analysis found the prototype requires the fewest mental operations, completes tasks in the fewest steps, and completes tasks in the least amount of time. Accordingly, we believe that developing a MR tool, based upon the WDO and user interface guidelines, improves user efficiency and reduces cognitive load.},
	isbn = {1942-597X},
	author = {Markowitz,Eliz and Bernstam,Elmer V. and Herskovic,Jorge and Zhang,Jiajie and Shneiderman, Ben and Plaisant, Catherine and Johnson,Todd R.}
}
@article {13944,
	title = {Method and System for Dereverberation of Signals Propagating in ...},
	volume = {13/047,311},
	year = {2011},
	month = {2011/03//},
	abstract = {The dereverberation of signals in reverberating environments is carried out via acquiring the representation (image) of spatial distribution of the signals in space of interest and automatic identification of reflections of the source signal in the reverberative space. The technique relies on identification of prominent features at the image, as well as corresponding directions of propagation of signals manifested by the prominent features at the image, and computation of similarity metric between signals corresponding to the prominent features in the image. The time delays between the correlated signals (i.e., source signal and related reflections) are found and the signals are added coherently. Multiple beamformers operate on the source signal and corresponding reflections, enabling one to improve the signal-to-noise ratio in multi-path environments.},
	url = {http://www.google.com/patents?id=gBHuAQAAEBAJ},
	author = {O{\textquoteright}donovan,Adam and Duraiswami, Ramani and Zotkin,Dmitry N},
	editor = {University of Maryland}
}
@article {13946,
	title = {Partial least squares based speaker recognition system},
	journal = {Snowbird Learning Workshop},
	year = {2011},
	month = {2011///},
	author = {Srinivasan,B.V. and Zotkin,Dmitry N and Duraiswami, Ramani}
}
@conference {13943,
	title = {A partial least squares framework for speaker recognition},
	booktitle = {Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on},
	year = {2011},
	month = {2011/05//},
	pages = {5276 - 5279},
	abstract = {Modern approaches to speaker recognition (verification) operate in a space of "supervectors" created via concatenation of the mean vectors of a Gaussian mixture model (GMM) adapted from a universal background model (UBM). In this space, a number of approaches to model inter-class separability and nuisance attribute variability have been proposed. We develop a method for modeling the variability associated with each class (speaker) by using partial-least-squares - a latent variable modeling technique, which isolates the most informative subspace for each speaker. The method is tested on NIST SRE 2008 data and provides promising results. The method is shown to be noise-robust and to be able to efficiently learn the subspace corresponding to a speaker on training data consisting of multiple utterances.},
	keywords = {approximations;speaker, attribute, background, GMM;Gaussian, least, mixture, model;Gaussian, model;NIST, modeling, processes;least, recognition;, recognition;speaker, separability;latent, squares, squares;partial-least-squares;speaker, SRE;interclass, technique;multiple, utterances;nuisance, variability;partial, variable, verification;universal},
	doi = {10.1109/ICASSP.2011.5947548},
	author = {Srinivasan,B.V. and Zotkin,Dmitry N and Duraiswami, Ramani}
}
@article {14490,
	title = {Privacy in social networks: A survey},
	journal = {Social Network Data Analytics},
	year = {2011},
	month = {2011///},
	pages = {277 - 306},
	abstract = {In this chapter, we survey the literature on privacy in social networks. We focus both on online social networks and online affiliation networks. We formally define the possible privacy breaches and describe the privacy attacks that have been studied. We present definitions of privacy in the context of anonymization together with existing anonymization techniques.},
	doi = {10.1007/978-1-4419-8462-3_10},
	author = {Zheleva,E. and Getoor, Lise}
}
@conference {17338,
	title = {Re-engineering health care with information technology: the role of computer-human interaction},
	booktitle = {PART 2 {\textemdash}{\textemdash}{\textemdash}{\textendash} Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems},
	series = {CHI EA {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {451 - 454},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {There is critical, nation-wide need to improve health care and its cost. Health information technology has great promise that is yet to be realized. In this panel four noted experts will discuss key issues that should drive health IT, and the challenges for the CHI community to play a leading role.},
	keywords = {clinical workflow, electronic medical records, health information technology visualization, healthcare informatics, participatory design, usability standards \&$\#$38; evaluation},
	doi = {10.1145/1979482.1979490},
	url = {http://doi.acm.org/10.1145/1979482.1979490},
	author = {Butler,Keith and Payne,Thomas and Shneiderman, Ben and Brennan,Patricia and Zhang,Jiajie}
}
@article {14639,
	title = {Regulation of Lung Endoderm Progenitor Cell Behavior by miR302/367},
	journal = {DevelopmentDevelopment},
	volume = {138},
	year = {2011},
	month = {2011/04/01/},
	pages = {1235 - 1245},
	abstract = {The temporal and spatial control of organ-specific endoderm progenitor development is poorly understood. miRNAs affect cell function by regulating programmatic changes in protein expression levels. We show that the miR302/367 cluster is a target of the transcription factor Gata6 in mouse lung endoderm and regulates multiple aspects of early lung endoderm progenitor development. miR302/367 is expressed at early stages of lung development, but its levels decline rapidly as development proceeds. Gain- and loss-of-function studies show that altering miR302/367 expression disrupts the balance of lung endoderm progenitor proliferation and differentiation, as well as apical-basal polarity. Increased miR302/367 expression results in the formation of an undifferentiated multi-layered lung endoderm, whereas loss of miR302/367 activity results in decreased proliferation and enhanced lung endoderm differentiation. miR302/367 coordinates the balance between proliferation and differentiation, in part, through direct regulation of Rbl2 and Cdkn1a, whereas apical-basal polarity is controlled by regulation of Tiam1 and Lis1. Thus, miR302/367 directs lung endoderm development by coordinating multiple aspects of progenitor cell behavior, including proliferation, differentiation and apical-basal polarity.},
	keywords = {Lung, MicroRNA, mouse, Progenitor},
	isbn = {0950-1991, 1477-9129},
	doi = {10.1242/dev.061762},
	url = {http://dev.biologists.org/content/138/7/1235},
	author = {Tian,Ying and Zhang,Yuzhen and Hurd,Laura and Hannenhalli, Sridhar and Liu,Feiyan and Lu,Min Min and Morrisey,Edward E.}
}
@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 {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}
}
@conference {12445,
	title = {Variable remapping of images from very different sources},
	booktitle = {2011 18th IEEE International Conference on Image Processing (ICIP)},
	year = {2011},
	month = {2011/09/11/14},
	pages = {1501 - 1504},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a system which registers image sequences acquired by very different sources, so that multiple views could be transformed to the same coordinates system. This enables the functionality of automatic object identification and confirmation across views and platforms. The capability of the system comes from three ingredients: 1) image context enlargement through temporal integration; 2) robust motion estimation using the G-RANSAC framework with a relaxed correspondence criteria; 3) constrained motion estimation within the G-RANSAC framework. The proposed system has worked successfully on thousands of frames from multiple collections with significant variations in scale and resolution.},
	keywords = {automatic object identification, Buildings, CAMERAS, Conferences, constrained motion estimation, coordinates system, Estimation, G-RANSAC framework, image context enlargement, Image Enhancement, image registration, image sequence registration, Image sequences, Motion estimation, Robustness, temporal integration, variable image remapping},
	isbn = {978-1-4577-1304-0},
	doi = {10.1109/ICIP.2011.6115729},
	author = {Wei Zhang and Yanlin Guo and Meth, R. and Sokoloff, H. and Pope, A. and Strat, T. and Chellapa, Rama}
}
@conference {19259,
	title = {Vectorization and mapping of software defined radio applications on heterogeneous multi-processor platforms},
	booktitle = {2011 IEEE Workshop on Signal Processing Systems (SiPS)},
	year = {2011},
	month = {2011},
	pages = {31 - 36},
	abstract = {A variety of multiprocessor architectures have proliferated even for off-the-shelf computing platforms. To improve performance and productivity for common heterogeneous systems, we have developed a workflow to generate efficient solutions. By starting with a formal description of an application and the mapping problem we are able to generate a range of designs that efficiently trade-of latency and throughput. In this approach, efficient utilization of SIMD cores is achieved by applying extensive block processing in conjunction with efficient mapping and scheduling. We demonstrate our approach through an integration into the GNU Radio environment for software defined radio system design.},
	keywords = {Benchmark testing, block processing, Design methodology, formal description, GNU radio environment, Graphic Processor Unit, Graphics processing unit, heterogeneous multiprocessor platform, mapping problem, Multicore processing, Multiprocessing systems, multiprocessor architecture, multiprocessor scheduling, operating systems (computers), PARALLEL PROCESSING, Processor scheduling, Schedules, SIMD core, Software Defined Radio, software defined radio system design, software radio, telecommunication computing, Throughput, vectorization, workflow},
	author = {Zaki, G.F. and Plishker,W. and Bhattacharyya, Shuvra S. and Clancy, C. and Kuykendall, J.}
}
@article {15262,
	title = {Achieving anonymity via clustering},
	journal = {ACM Trans. Algorithms},
	volume = {6},
	year = {2010},
	month = {2010/07//},
	pages = {49:1{\textendash}49:19 - 49:1{\textendash}49:19},
	abstract = {Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of deidentifying records is to remove identifying fields such as social security number, name, etc. However, recent research has shown that a large fraction of the U.S. population can be identified using nonkey attributes (called quasi-identifiers) such as date of birth, gender, and zip code. The k-anonymity model protects privacy via requiring that nonkey attributes that leak information are suppressed or generalized so that, for every record in the modified table, there are at least k-1 other records having exactly the same values for quasi-identifiers. We propose a new method for anonymizing data records, where quasi-identifiers of data records are first clustered and then cluster centers are published. To ensure privacy of the data records, we impose the constraint that each cluster must contain no fewer than a prespecified number of data records. This technique is more general since we have a much larger choice for cluster centers than k-anonymity. In many cases, it lets us release a lot more information without compromising privacy. We also provide constant factor approximation algorithms to come up with such a clustering. This is the first set of algorithms for the anonymization problem where the performance is independent of the anonymity parameter k. We further observe that a few outlier points can significantly increase the cost of anonymization. Hence, we extend our algorithms to allow an ε fraction of points to remain unclustered, that is, deleted from the anonymized publication. Thus, by not releasing a small fraction of the database records, we can ensure that the data published for analysis has less distortion and hence is more useful. Our approximation algorithms for new clustering objectives are of independent interest and could be applicable in other clustering scenarios as well.},
	keywords = {anonymity, Approximation algorithms, clustering, privacy},
	isbn = {1549-6325},
	doi = {10.1145/1798596.1798602},
	url = {http://doi.acm.org/10.1145/1798596.1798602},
	author = {Aggarwal,Gagan and Panigrahy,Rina and Feder,Tom{\'a}s and Thomas,Dilys and Kenthapadi,Krishnaram and Khuller, Samir and Zhu,An}
}
@inbook {15424,
	title = {Advances in Automated Model-Based System Testing of Software Applications with a GUI Front-End},
	booktitle = {Advances in ComputersAdvances in Computers},
	volume = {Volume 80},
	year = {2010},
	month = {2010///},
	pages = {121 - 162},
	publisher = {Elsevier},
	organization = {Elsevier},
	abstract = {Despite the ubiquity of software applications that employ a graphical-user interface (GUI) front-end, functional system testing of these applications has remained, until recently, an understudied research area. During {\textquotedblleft}GUI testing,{\textquotedblright} test cases, modeled as sequences of user input events, are created and executed on the software by exercising the GUI{\textquoteright}s widgets. Because each possible sequence of user events may potentially be a test case and today{\textquoteright}s GUIs offer enormous flexibility to end-users, in principle, GUI testing requires a prohibitively large number of test cases. Any practical test-case generation technique must sample the vast GUI input space. Existing techniques are largely manual, and hence extremely resource intensive. Several new automated model-based techniques have been developed in the past decade. All these techniques develop, either manually or automatically, a model of the GUI and employ it to generate test cases. This chapter presents the first detailed taxonomy of these techniques. A small GUI application is used as a running example to demonstrate each technique and illustrate its relative strengths and weaknesses.},
	isbn = {0065-2458},
	url = {http://www.sciencedirect.com/science/article/pii/S0065245810800038},
	author = {Memon, Atif M. and Nguyen,Bao N.},
	editor = {Zelkowitz, Marvin V}
}
@inbook {12498,
	title = {Advances in Video-Based Human Activity Analysis: Challenges and Approaches},
	booktitle = {Advances in ComputersAdvances in Computers},
	volume = {Volume 80},
	year = {2010},
	month = {2010///},
	pages = {237 - 290},
	publisher = {Elsevier},
	organization = {Elsevier},
	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. Analysis of human activities in video is important for several important applications. Interpretation and identification of human activities requires approaches that address the following questions (a) what are the appropriate atomic primitives for human activities, (b) how to combine primitives to produce complex activities, (c) what are the required invariances for inference algorithms, and (d) how to build computational models for each of these. In this chapter, we provide a broad overview and discussion of these issues. We shall review state-of-the-art computer vision algorithms that address these issues and then provide a unified perspective from which specific algorithms can be derived. We will then present supporting experimental results.},
	isbn = {0065-2458},
	url = {http://www.sciencedirect.com/science/article/pii/S0065245810800075},
	author = {Turaga,Pavan and Chellapa, Rama and Veeraraghavan,Ashok},
	editor = {Zelkowitz, Marvin V}
}
@article {12474,
	title = {Applications of a Simple Characterization of Human Gait in Surveillance},
	journal = {Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on},
	volume = {40},
	year = {2010},
	month = {2010/08//},
	pages = {1009 - 1020},
	abstract = {Applications of a simple spatiotemporal characterization of human gait in the surveillance domain are presented. The approach is based on decomposing a video sequence into x-t slices, which generate periodic patterns referred to as double helical signatures (DHSs). The features of DHS are given as follows: 1) they naturally encode the appearance and kinematics of human motion and reveal geometric symmetries and 2) they are effective and efficient for recovering gait parameters and detecting simple events. We present an iterative local curve embedding algorithm to extract the DHS from video sequences. Two applications are then considered. First, the DHS is used for simultaneous segmentation and labeling of body parts in cluttered scenes. Experimental results showed that the algorithm is robust to size, viewing angles, camera motion, and severe occlusion. Then, the DHS is used to classify load-carrying conditions. By examining various symmetries in DHS, activities such as carrying, holding, and walking with objects that are attached to legs are detected. Our approach possesses several advantages: a compact representation that can be computed in real time is used; furthermore, it does not depend on silhouettes or landmark tracking, which are sensitive to errors in background subtraction stage.},
	keywords = {algorithms, Artificial intelligence, Automated;Photography;Reproducibility of Results;Sensitivity and Specificity;Video Recording;, Biometry, Computer-Assisted;Pattern Recognition, double helical signatures, Gait, gait analysis, human gait, human motion kinematics, HUMANS, Image Enhancement, Image Interpretation, Image motion analysis, iterative local curve embedding algorithm, Object detection, simple spatiotemporal characterization, video sequence, Video surveillance},
	isbn = {1083-4419},
	doi = {10.1109/TSMCB.2010.2044173},
	author = {Yang Ran and Qinfen Zheng and Chellapa, Rama and Strat, T.M.}
}
@conference {12122,
	title = {Are developers complying with the process: an XP study},
	booktitle = {Proceedings of the 2010 ACM-IEEE International Symposium on Empirical Software Engineering and Measurement},
	series = {ESEM {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {14:1{\textendash}14:10 - 14:1{\textendash}14:10},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Adapting new software processes and practices in organizational and academic environments requires training the developers and validating the applicability of the newly introduced activities. Investigating process conformance during training and understanding if programmers are able and willing to follow the specific steps are crucial to evaluating whether the process improves various software product quality factors. In this paper we present a process model independent approach to detect process non-conformance. Our approach is based on non-intrusively collected data captured by a version control system and provides the project manager with timely updates. Further, we provide evidence of the applicability of our approach by investigating process conformance in a five day training class on eXtreme Programming (XP) practices at the Leibniz Universit{\"a}t Hannover. Our results show that the approach enabled researchers to formulate minimal intrusive methods to check for conformance and that for the majority of the investigated XP practices violations could be detected.},
	keywords = {process conformance, process improvement, XP programming},
	isbn = {978-1-4503-0039-1},
	doi = {10.1145/1852786.1852805},
	url = {http://doi.acm.org/10.1145/1852786.1852805},
	author = {Zazworka, Nico and Stapel,Kai and Knauss,Eric and Shull, Forrest and Basili, Victor R. and Schneider,Kurt}
}
@article {13962,
	title = {Audio visual scene analysis using spherical arrays and cameras.},
	journal = {The Journal of the Acoustical Society of America},
	volume = {127},
	year = {2010},
	month = {2010///},
	pages = {1979 - 1979},
	abstract = {While audition and vision are used together by living beings to make sense of the world, the observation of the world using machines in applications such as surveillance and robotics has proceeded largely separately. We describe the use of spherical microphone arrays as {\textquotedblleft}audio cameras{\textquotedblright} and spherical array of video cameras as a tool to perform multi-modal scene analysis that attempts to answer questions such as {\textquotedblleft}Who?,{\textquotedblright}, {\textquotedblleft}What?,{\textquotedblright} {\textquotedblleft}Where?,{\textquotedblright} and {\textquotedblleft}Why?.{\textquotedblright} Signal processing algorithms to identify the number of people and their identities and to isolate and dereverberate their speech using multi-modal processing will be described. The use of graphics processor based signal processing allows for real-time implementation of these algorithms. [Work supported by ONR.]},
	doi = {10.1121/1.3385079},
	url = {http://link.aip.org/link/?JAS/127/1979/3},
	author = {O{\textquoteright}donovan,Adam and Duraiswami, Ramani and Zotkin,Dmitry N and Gumerov, Nail A.}
}
@conference {13953,
	title = {Automatic matched filter recovery via the audio camera},
	booktitle = {Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on},
	year = {2010},
	month = {2010/03//},
	pages = {2826 - 2829},
	abstract = {The sound reaching the acoustic sensor in a realistic environment contains not only the part arriving directly from the sound source but also a number of environmental reflections. The effect of those on the sound is equivalent to a convolution with the room impulse response and can be undone via deconvolution - a technique known as matched filter processing. However, the filter is usually pre-computed in advance using known room geometry and source/receiver positions, and any deviations from those cause the performance to degrade significantly. In this work, an algorithm is proposed to compute the matched filter automatically using an audio camera - a microphone array based system that provides real-time audio images (essentially plots of steered response power in various directions) of environment. Acoustic sources, as well as their significant reflections, are revealed as peaks in the audio image. The reflections are associated with sound source(s) using an acoustic similarity metric, and an approximate matched filter is computed to align the reflections in time with the direct arrival. Preliminary experimental evaluation of the method is performed. It is shown that in case of two sources the reflections are identified correctly, the time delays recovered agree well with those computed from geometric constraints, and that the output SNR improves when the reflections are added coherently to the signal obtained by beamforming directly at the source.},
	keywords = {acoustic, array;real-time, arrays;transient, audio, camera;automatic, constraints;microphone, filter, filters;microphone, images;room, impulse, Matched, positions;acoustic, processing;cameras;matched, radiators;array, recovery;beamforming;geometric, response;, response;sound, sensor;acoustic, signal, source;source/receiver, sources;audio},
	doi = {10.1109/ICASSP.2010.5496187},
	author = {O{\textquoteright}Donovan,A.E. and Duraiswami, Ramani and Zotkin,Dmitry N}
}
@article {13963,
	title = {Computation of the head-related transfer function via the fast multipole accelerated boundary element method and its spherical harmonic representation},
	journal = {The Journal of the Acoustical Society of America},
	volume = {127},
	year = {2010},
	month = {2010///},
	pages = {370 - 386},
	abstract = {The head-related transfer function (HRTF) is computed using the fast multipole accelerated boundary element method. For efficiency, the HRTF is computed using the reciprocity principle by placing a source at the ear and computing its field. Analysis is presented to modify the boundary value problem accordingly. To compute the HRTF corresponding to different ranges via a single computation, a compact and accurate representation of the HRTF, termed the spherical spectrum, is developed. Computations are reduced to a two stage process, the computation of the spherical spectrum and a subsequent evaluation of the HRTF. This representation allows easy interpolation and range extrapolation of HRTFs. HRTF computations are performed for the range of audible frequencies up to 20 kHz for several models including a sphere, human head models [the Neumann KU-100 ({\textquotedblleft}Fritz{\textquotedblright}) and the Knowles KEMAR ({\textquotedblleft}Kemar{\textquotedblright}) manikins], and head-and-torso model (the Kemar manikin). Comparisons between the different cases are provided. Comparisons with the computational data of other authors and available experimental data are conducted and show satisfactory agreement for the frequencies for which reliable experimental data are available. Results show that, given a good mesh, it is feasible to compute the HRTF over the full audible range on a regular personal computer.},
	keywords = {auditory evoked potentials, bioacoustics, boundary-elements methods, Ear, Harmonic analysis},
	doi = {10.1121/1.3257598},
	url = {http://link.aip.org/link/?JAS/127/370/1},
	author = {Gumerov, Nail A. and O{\textquoteright}Donovan,Adam E. and Duraiswami, Ramani and Zotkin,Dmitry N}
}
@article {15261,
	title = {Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs},
	journal = {Research in Computational Molecular Biology},
	year = {2010},
	month = {2010///},
	pages = {456 - 472},
	abstract = {In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of the densest subgraph problem by adding an additional distance restriction (defined by a separate metric) to the nodes of the subgraph. We show that while this generalization makes the problem NP-hard for arbitrary metrics, when the metric comes from the distance metric of a tree, or an interval graph, the problem can be solved optimally in polynomial time. We also show that the densest subgraph problem with a specified subset of vertices that have to be included in the solution can be solved optimally in polynomial time. In addition, we consider other extensions when not just one solution needs to be found, but we wish to list all subgraphs of almost maximum density as well. We apply this method to a dataset of genes and their annotations obtained from The Arabidopsis Information Resource (TAIR). A user evaluation confirms that the patterns found in the distance restricted densest subgraph for a dataset of photomorphogenesis genes are indeed validated in the literature; a control dataset validates that these are not random patterns. Interestingly, the complex annotation patterns potentially lead to new and as yet unknown hypotheses. We perform experiments to determine the properties of the dense subgraphs, as we vary parameters, including the number of genes and the distance.},
	doi = {10.1007/978-3-642-12683-3_30},
	author = {Saha,B. and Hoch,A. and Khuller, Samir and Raschid, Louiqa and Zhang,X. N}
}
@conference {19281,
	title = {Design and implementation of real-time signal processing applications on heterogeneous multiprocessor arrays},
	booktitle = {2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)},
	year = {2010},
	month = {2010},
	pages = {2121 - 2125},
	abstract = {Processing structures based on arrays of computational elements form an important class of architectures, which includes field programmable gate arrays (FPGAs), systolic arrays, and various forms of multicore processors. A wide variety of design methods and tools have been targeted to regular processing arrays involving homogeneous processing elements. In this paper, we introduce the concept of field programmable X arrays (FPXAs) as an abstract model for design and implementation of heterogeneous multiprocessor arrays for signal processing systems. FPXAs are abstract structures that can be targeted for implementation on application-specific integrated circuits, FPGAs, or other kinds of reconfigurable processors. FPXAs can also be mapped onto multicore processors for flexible emulation. We discuss the use of dataflow models as an integrated application representation and intermediate representation for efficient specification and mapping of signal processing systems on FPXAs. We demonstrate our proposed models and techniques with a case study involving the embedding of an application-specific FPXA system on an off-the-shelf FPGA device.},
	keywords = {application specific integrated circuits, application-specific integrated circuits, computational elements, Computer architecture, decoding, Field programmable gate arrays, field programmable X arrays, FPGA, FPXA, Integrated circuit modeling, Logic Design, microprocessor chips, multicore processors, multiprocessor arrays, real-time signal processing, reconfigurable architectures, reconfigurable processors, Routing, Signal processing, Signal processing systems, systolic arrays, Viterbi algorithm},
	author = {Wu, Hsiang-Huang and Chung-Ching Shen and Bhattacharyya, Shuvra S. and Compton, K. and Schulte, M. and Wolf, M. and Zhang, Tong}
}
@conference {18902,
	title = {Emergence of cooperative societies in evolutionary games},
	series = {GECCO {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {1793 - 1800},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We utilize evolutionary game theory to study the evolution of cooperative societies and the behaviors of individual agents (i.e., players) in it. 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 the 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. We present series of 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 demonstrate that in contrast to previous common knowledge, increasing the value of mutual Reward or increasing mutual Punishment in the Prisoner{\textquoteright}s dilemma game do not result in the same type of cooperative society: while increasing R does result in a more cooperative society, increasing P does not.},
	keywords = {evolutionary game theory, social orientations},
	isbn = {978-1-4503-0073-5},
	doi = {10.1145/1830761.1830805},
	url = {http://doi.acm.org/10.1145/1830761.1830805},
	author = {Cheng,Kan-Leung and Zuckerman,Inon and Kuter,Ugur and Nau, Dana S.}
}
@inbook {12995,
	title = {Evolutionary framework for Lepidoptera model systems},
	booktitle = {Genetics and Molecular Biology of LepidopteraGenetics and Molecular Biology of Lepidoptera},
	year = {2010},
	month = {2010///},
	pages = {1 - 24},
	publisher = {Taylor \& Francis},
	organization = {Taylor \& Francis},
	address = {Boca Raton},
	abstract = {{\textquotedblleft}Model systems{\textquotedblright} are specific organisms upon which detailed studies have been conducted examining a fundamental biological question. If the studies are robust, their results can be extrapolated among an array of organisms that possess features in common with the subject organism. The true power of model systems lies in the ability to extrapolate these details across larger groups of organisms. In order to generalize these results, comparative studies are essential and require that model systems be placed into their evolutionary or phylogenetic context. This chapter examines model systems in the insect order Lepidoptera from the perspective of several different superfamilies. Historically, many species of Lepidoptera have been essential in the development of invaluable model systems in the fields of development biology, genetics, molecular biology, physiology, co-evolution, population dynamics, and ecology.},
	author = {Roe,A. and Weller,S. and Baixeras,J. and Brown,J. W and Cummings, Michael P. and Davis,DR and Horak,M and Kawahara,A. Y and Mitter,C and Parr,C.S. and Regier,J. C and Rubinoff,D and Simonsen,TJ and Wahlberg,N and Zwick,A.},
	editor = {Goldsmith,M and Marec,F}
}
@article {13961,
	title = {Fast Computation of Kernel Estimators},
	journal = {Journal of Computational and Graphical Statistics},
	volume = {19},
	year = {2010},
	month = {2010///},
	pages = {205 - 220},
	abstract = {The computational complexity of evaluating the kernel density estimate (or its derivatives) at m evaluation points given n sample points scales quadratically as O(nm)?making it prohibitively expensive for large datasets. While approximate methods like binning could speed up the computation, they lack a precise control over the accuracy of the approximation. There is no straightforward way of choosing the binning parameters a priori in order to achieve a desired approximation error. We propose a novel computationally efficient ε-exact approximation algorithm for the univariate Gaussian kernel-based density derivative estimation that reduces the computational complexity from O(nm) to linear O(n+m). The user can specify a desired accuracy ε. The algorithm guarantees that the actual error between the approximation and the original kernel estimate will always be less than ε. We also apply our proposed fast algorithm to speed up automatic bandwidth selection procedures. We compare our method to the best available binning methods in terms of the speed and the accuracy. Our experimental results show that the proposed method is almost twice as fast as the best binning methods and is around five orders of magnitude more accurate. The software for the proposed method is available online.},
	isbn = {1061-8600},
	doi = {10.1198/jcgs.2010.09046},
	url = {http://www.tandfonline.com/doi/abs/10.1198/jcgs.2010.09046},
	author = {Raykar,Vikas C. and Duraiswami, Ramani and Zhao,Linda H.}
}
@conference {13559,
	title = {GEDI - AGroundtruthing Environment for Document Images},
	booktitle = {Ninth IAPRInternational Workshop on Document Analysis Systems (DAS 2010)},
	year = {2010},
	month = {2010///},
	abstract = {In this paper, we describe a freely available highly configurable document image annotation tool called GEDI {\textendash} Groundtruthing Environment for Document Images. Its basic structure involves two types of files, an Image file, and a corresponding .xml file in GEDI format. When users begin ground truthing an image, they can configure the interface to allow the creation of different types of zones, each of which may have a custom set of {\textquotedblleft}attributes{\textquotedblright}. The output is compatible with the UMDDocLib architecture [2] and has been used in numerous funded and unfunded programs to create datasets in multiple languages. GEDI has been developed and released to the community as a comprehensive tool that we hope will ease the burden of document annotation and encourage additional sharing of data.},
	author = {David Doermann and Zotkina,Elena and Huiping Li}
}
@article {14426,
	title = {Higher-order graphical models for classification in social and affiliation networks},
	journal = {NIPS 2010 Workshop on Networks Across Disciplines: Theory and Applications, Whistler BC, Canada},
	year = {2010},
	month = {2010///},
	abstract = {In this work we explore the application of higher-order Markov Random Fields(MRF) to classification in social and affiliation networks. We consider both friend-
ship links and group membership for inferring hidden attributes in a collective
inference framework. We explore different ways of using the social groups as ei-
ther node features or to construct the graphical model structure. The bottleneck in
applying higher-order MRFs to a domain with many overlapping large cliques is
the complexity of inference which is exponential in the size of the largest clique.
To circumvent the slow inference problem, we borrow recent advancements in
the computer vision community to achieve fast approximate inference results. We
provide preliminary results using a dataset from facebook which suggest that our
higher-order MRF models are capturing the structural dependencies in the net-
works and they yield higher accuracy than linear classifiers.
},
	author = {Zheleva,E. and Getoor, Lise and Sarawagi,S.}
}
@article {14622,
	title = {Hopx and Hdac2 Interact to Modulate Gata4 Acetylation and Embryonic Cardiac Myocyte Proliferation},
	journal = {Developmental Cell},
	volume = {19},
	year = {2010},
	month = {2010/09/14/},
	pages = {450 - 459},
	abstract = {SummaryRegulation of chromatin structure via histone modification has recently received intense attention. Here,~we demonstrate that the chromatin-modifying enzyme histone deacetylase 2 (Hdac2) functions with a small homeodomain factor, Hopx, to mediate deacetylation of Gata4, which is expressed by cardiac progenitor cells and plays critical roles in the regulation of cardiogenesis. In the absence of Hopx and Hdac2 in mouse embryos, Gata4 hyperacetylation is associated with a marked increase in~cardiac myocyte proliferation, upregulation of Gata4 target genes, and perinatal lethality. Hdac2 physically interacts with Gata4, and this interaction is stabilized by Hopx. The ability of Gata4 to transactivate cell cycle genes is impaired by Hopx/Hdac2-mediated deacetylation, and this effect is abrogated by loss of Hdac2-Gata4 interaction. These results suggest that Gata4 is a nonhistone target of Hdac2-mediated deacetylation and that Hdac2, Hopx, and Gata4 coordinately regulate cardiac myocyte proliferation during embryonic development.
},
	isbn = {1534-5807},
	doi = {10.1016/j.devcel.2010.08.012},
	url = {http://www.sciencedirect.com/science/article/pii/S1534580710003874},
	author = {Trivedi,Chinmay M. and Zhu,Wenting and Wang,Qiaohong and Jia,Cheng and Kee,Hae Jin and Li,Li and Hannenhalli, Sridhar and Epstein,Jonathan A.}
}
@article {13957,
	title = {Insights into head-related transfer function: Spatial dimensionality and continuous representation},
	journal = {The Journal of the Acoustical Society of America},
	volume = {127},
	year = {2010},
	month = {2010///},
	pages = {2347 - 2357},
	abstract = {This paper studies head-related transfer function (HRTF) sampling and synthesis in a three-dimensional auditory scene based on a general modal decomposition of the HRTF in all frequency-range-angle domains. The main finding is that the HRTF decomposition with the derived spatial basis function modes can be well approximated by a finite number, which is defined as the spatial dimensionality of the HRTF. The dimensionality determines the minimum number of parameters to represent the HRTF corresponding to all directions and also the required spatial resolution in HRTF measurement. The general model is further developed to a continuous HRTF representation, in which the normalized spatial modes can achieve HRTF near-field and far-field representations in one formulation. The remaining HRTF spectral components are compactly represented using a Fourier spherical Bessel series, where the aim is to generate the HRTF with much higher spectral resolution in fewer parameters from typical measurements, which usually have limited spectral resolution constrained by sampling conditions. A low-computation algorithm is developed to obtain the model coefficients from the existing measurements. The HRTF synthesis using the proposed model is validated by three sets of data: (i) synthetic HRTFs from the spherical head model, (ii) the MIT KEMAR (Knowles Electronics Mannequin for Acoustics Research) data, and (iii) 45-subject CIPIC HRTF measurements.},
	keywords = {acoustic signal processing, Bessel functions, Fourier series, hearing, Transfer functions},
	doi = {10.1121/1.3336399},
	url = {http://link.aip.org/link/?JAS/127/2347/1},
	author = {Zhang,Wen and Abhayapala,Thushara D. and Kennedy,Rodney A. and Duraiswami, Ramani}
}
@conference {13952,
	title = {Kernelized R{\'e}nyi distance for speaker recognition},
	booktitle = {Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on},
	year = {2010},
	month = {2010/03//},
	pages = {4506 - 4509},
	abstract = {Speaker recognition systems classify a test signal as a speaker or an imposter by evaluating a matching score between input and reference signals. We propose a new information theoretic approach for computation of the matching score using the Re $\#$x0301;nyi entropy. The proposed entropic distance, the Kernelized Re $\#$x0301;nyi distance (KRD), is formulated in a non-parametric way and the resulting measure is efficiently evaluated in a parallelized fashion on a graphical processor. The distance is then adapted as a scoring function and its performance compared with other popular scoring approaches in a speaker identification and speaker verification framework.},
	keywords = {$\#$x0301;nyi, approach;input, distance;reference, entropy;graphical, equipment;entropy;speaker, graphic, identification;speaker, processor;information, Re, recognition;, recognition;speaker, signals;kernelized, signals;speaker, theoretic, verification;computer},
	doi = {10.1109/ICASSP.2010.5495587},
	author = {Vasan Srinivasan,B. and Duraiswami, Ramani and Zotkin,Dmitry N}
}
@article {13954,
	title = {Loudspeaker and Microphone Array Signal Processing-Plane-Wave Decomposition of Acoustical Scenes Via Spherical and Cylindrical Microphone Arrays},
	journal = {IEEE transactions on audio, speech, and language processing},
	volume = {20},
	year = {2010},
	month = {2010///},
	pages = {2 - 2},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.}
}
@article {16049,
	title = {Non-visual exploration of geographic maps: Does sonification help?},
	journal = {Disability \& Rehabilitation: Assistive Technology},
	volume = {5},
	year = {2010},
	month = {2010/05//},
	pages = {164 - 174},
	abstract = {Purpose.  This study aims at evaluating the effectiveness of sonification as a mean to provide access to geo-referenced information to users with visual impairments.Method.  Thiry-five participants (10 congenitally blind, 10 with acquired blindness and 15 blindfolded sighted) completed four tasks of progressive difficulty. During each task, participants first explored a sonified map by using either a tablet or a keyboard to move across regions and listened to sounds giving information about the current location. Then the participants were asked to identify, among four tactile maps, the one that crossmodally corresponds to the sonifed map they just explored. Finally, participants answered a self-report questionnaire of understanding and satisfaction.
Results.  Participants achieved high accuracy in all of the four tactile map discrimination tasks. No significant performance difference was found neither between subjects that used keyboard or tablet, nor between the three groups of blind and sighted participants. Differences between groups and interfaces were found in the usage strategies. High levels of satisfaction and understanding of the tools and tasks emerged from users{\textquoteright} reports.
},
	isbn = {1748-3107, 1748-3115},
	doi = {10.3109/17483100903100277},
	url = {http://informahealthcare.com/doi/abs/10.3109/17483100903100277},
	author = {Delogu,Franco and Palmiero,Massimiliano and Federici,Stefano and Plaisant, Catherine and Zhao,Haixia and Belardinelli,Olivetti}
}
@conference {12151,
	title = {Obtaining valid safety data for software safety measurement and process improvement},
	booktitle = {Proceedings of the 2010 ACM-IEEE International Symposium on Empirical Software Engineering and Measurement},
	series = {ESEM {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {46:1{\textendash}46:4 - 46:1{\textendash}46:4},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We report on a preliminary case study to examine software safety risk in the early design phase of the NASA Constellation spaceflight program. Our goal is to provide NASA quality assurance managers with information regarding the ongoing state of software safety across the program. We examined 154 hazard reports created during the preliminary design phase of three major flight hardware systems within the Constellation program. Our purpose was two-fold: 1) to quantify the relative importance of software with respect to system safety; and 2) to identify potential risks due to incorrect application of the safety process, deficiencies in the safety process, or the lack of a defined process. One early outcome of this work was to show that there are structural deficiencies in collecting valid safety data that make software safety different from hardware safety. In our conclusions we present some of these deficiencies.},
	keywords = {case study, NASA, risk analysis, safety metrics},
	isbn = {978-1-4503-0039-1},
	doi = {10.1145/1852786.1852846},
	url = {http://doi.acm.org/10.1145/1852786.1852846},
	author = {Basili, Victor R. and Zelkowitz, Marvin V and Layman,Lucas and Dangle,Kathleen and Diep,Madeline}
}
@article {18457,
	title = {Plane-Wave Decomposition of Acoustical Scenes Via Spherical and Cylindrical Microphone Arrays},
	journal = {IEEE Transactions on Audio, Speech, and Language Processing},
	volume = {18},
	year = {2010},
	month = {2010/01//},
	pages = {2 - 16},
	abstract = {Spherical and cylindrical microphone arrays offer a number of attractive properties such as direction-independent acoustic behavior and ability to reconstruct the sound field in the vicinity of the array. Beamforming and scene analysis for such arrays is typically done using sound field representation in terms of orthogonal basis functions (spherical/cylindrical harmonics). In this paper, an alternative sound field representation in terms of plane waves is described, and a method for estimating it directly from measurements at microphones is proposed. It is shown that representing a field as a collection of plane waves arriving from various directions simplifies source localization, beamforming, and spatial audio playback. A comparison of the new method with the well-known spherical harmonics based beamforming algorithm is done, and it is shown that both algorithms can be expressed in the same framework but with weights computed differently. It is also shown that the proposed method can be extended to cylindrical arrays. A number of features important for the design and operation of spherical microphone arrays in real applications are revealed. Results indicate that it is possible to reconstruct the sound scene up to order p with p2 microphones spherical array.},
	keywords = {Acoustic fields, acoustic position measurement, acoustic signal processing, acoustic waves, acoustical scene analysis, array signal processing, circular arrays, cylindrical microphone arrays, direction-independent acoustic behavior, microphone arrays, orthogonal basis functions, plane-wave decomposition, Position measurement, signal reconstruction, sound field reconstruction, sound field representation, source localization, spatial audio playback, spherical harmonics based beamforming algorithm, spherical microphone arrays},
	isbn = {1558-7916},
	doi = {10.1109/TASL.2009.2022000},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.}
}
@article {16391,
	title = {The problem with zoning: nonlinear effects of interactions between location preferences and externalities on land use and utility},
	journal = {Environment and Planning B: Planning and Design},
	volume = {37},
	year = {2010},
	month = {2010///},
	pages = {408 - 428},
	author = {Zellner,M.L. and Riolo,R.L. and Rand, William and Brown,D.G. and Page,S.E. and Fernandez,L.E.}
}
@article {12475,
	title = {Robust Height Estimation of Moving Objects From Uncalibrated Videos},
	journal = {IEEE Transactions on Image Processing},
	volume = {19},
	year = {2010},
	month = {2010/08//},
	pages = {2221 - 2232},
	abstract = {This paper presents an approach for video metrology. From videos acquired by an uncalibrated stationary camera, we first recover the vanishing line and the vertical point of the scene based upon tracking moving objects that primarily lie on a ground plane. Using geometric properties of moving objects, a probabilistic model is constructed for simultaneously grouping trajectories and estimating vanishing points. Then we apply a single view mensuration algorithm to each of the frames to obtain height measurements. We finally fuse the multiframe measurements using the least median of squares (LMedS) as a robust cost function and the Robbins-Monro stochastic approximation (RMSA) technique. This method enables less human supervision, more flexibility and improved robustness. From the uncertainty analysis, we conclude that the method with auto-calibration is robust in practice. Results are shown based upon realistic tracking data from a variety of scenes.},
	keywords = {algorithms, Biometry, Calibration, EM algorithm, geometric properties, Geometry, Image Enhancement, Image Interpretation, Computer-Assisted, Imaging, Three-Dimensional, least median of squares, least squares approximations, MOTION, motion information, multiframe measurements, Pattern Recognition, Automated, Reproducibility of results, Robbins-Monro stochastic approximation, robust height estimation, Sensitivity and Specificity, Signal Processing, Computer-Assisted, stochastic approximation, Subtraction Technique, tracking data, uncalibrated stationary camera, uncalibrated videos, uncertainty analysis, vanishing point, video metrology, Video Recording, video signal processing},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2010.2046368},
	author = {Jie Shao and Zhou,S. K and Chellapa, Rama}
}
@article {13956,
	title = {Signal Processing for Audio HCI},
	journal = {Handbook of Signal Processing Systems},
	year = {2010},
	month = {2010///},
	pages = {243 - 265},
	abstract = {This chapter reviews recent advances in computer audio processing from the viewpoint of improving the human-computer interface. Microphone arrays are described as basic tools for untethered audio acquisition, and principles for the synthesis of realistic virtual audio are outlined. The influence of room acoustics on audio acquisition and production is also considered. The chapter finishes with a review of several relevant signal processing systems, including a fast head-related transfer function (HRTF) measurement system and a complete system for capture, visualization, and reproduction of auditory scenes.},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani}
}
@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.}
}
@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.}
}
@inbook {15431,
	title = {Advances in Web Testing},
	booktitle = {Computer Performance IssuesComputer Performance Issues},
	volume = {Volume 75},
	year = {2009},
	month = {2009///},
	pages = {281 - 306},
	publisher = {Elsevier},
	organization = {Elsevier},
	abstract = {AbstractDemand for high-quality Web applications continues to escalate as reliance on Web-based software increases and Web systems become increasingly complex. Given the importance of quality and its impact on the user experience, a significant research effort has been invested in developing tools and methodologies that facilitate effective quality assurance for Web applications. Testing, in particular, provides a critical inroad toward meeting the quality demand by enabling developers to discover failures and anomalies in applications before they are released. In this survey, we discuss advances in Web testing and begin by exploring the peculiarities of Web applications that makes evaluating their correctness a challenge and the direct translation of conventional software engineering principles impractical in some cases. We then provide an overview of research contributions in three critical aspects of Web testing: deriving adequate Web application models, defining appropriate Web testing strategies, and conducting Web portability analysis. In short, models are used to capture Web application components, their attributes, and interconnections; testing strategies use the models to generate test cases; and portability analysis enables Web developers to ensure that their applications remain correct as they are launched in highly diverse configurations.
},
	isbn = {0065-2458},
	url = {http://www.sciencedirect.com/science/article/pii/S006524580800805X},
	author = {Eaton,Cyntrica and Memon, Atif M.},
	editor = {Zelkowitz, Marvin V}
}
@article {12522,
	title = {Appearance Modeling Using a Geometric Transform},
	journal = {Image Processing, IEEE Transactions on},
	volume = {18},
	year = {2009},
	month = {2009/04//},
	pages = {889 - 902},
	abstract = {A general transform, called the geometric transform (GeT), that models the appearance inside a closed contour is proposed. The proposed GeT is a functional of an image intensity function and a region indicator function derived from a closed contour. It can be designed to combine the shape and appearance information at different resolutions and to generate models invariant to deformation, articulation, or occlusion. By choosing appropriate functionals and region indicator functions, the GeT unifies Radon transform, trace transform, and a class of image warpings. By varying the region indicator and the types of features used for appearance modeling, five novel types of GeTs are introduced and applied to fingerprinting the appearance inside a contour. They include the GeTs based on a level set, shape matching, feature curves, and the GeT invariant to occlusion, and a multiresolution GeT (MRGeT). Applications of GeT to pedestrian identity recognition, human body part segmentation, and image synthesis are illustrated. The proposed approach produces promising results when applied to fingerprinting the appearance of a human and body parts despite the presence of nonrigid deformations and articulated motion.},
	keywords = {body, contour;feature, curve;fingerprinting;geometric, function;image, function;shape, geometry;image, identity, indicator, INTENSITY, matching;trace, method;pedestrian, modeling;closed, part, Radon, recognition;region, resolution;image, segmentation;, segmentation;image, set, synthesis;image, transform;appearance, transform;human, transform;Radon, transforms;computational, warping;level},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2008.2011381},
	author = {Li,Jian and Zhou,S. K and Chellapa, Rama}
}
@article {15053,
	title = {Classic triangular mesh subdivision algorithm},
	journal = {Jisuanji Gongcheng/ Computer Engineering},
	volume = {35},
	year = {2009},
	month = {2009///},
	pages = {7 - 10},
	abstract = {This paper makes a concise introduction to seven classic algorithms of triangular mesh subdivision, and makes a classification and comparison between them according to their continuity, own advantage and application status. In order to improve the visualization of triangular mesh subdivision, interactive display control is implemented by using MFC and OpenGL while state machine model based on functional class is used as the software operating pattern. On the basis of this, the prototype implementation of Loop algorithm is performed. The improved method of solving existing problematic issues from prototype implementation is presented.},
	author = {Zhuolin Jiang and Li,S.F. and Jia,X.P. and Zhu,H.L.}
}
@conference {14445,
	title = {Co-evolution of social and affiliation networks},
	booktitle = {Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining},
	series = {KDD {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {1007 - 1016},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {In our work, we address the problem of modeling social network generation which explains both link and group formation. Recent studies on social network evolution propose generative models which capture the statistical properties of real-world networks related only to node-to-node link formation. We propose a novel model which captures the co-evolution of social and affiliation networks. We provide surprising insights into group formation based on observations in several real-world networks, showing that users often join groups for reasons other than their friends. Our experiments show that the model is able to capture both the newly observed and previously studied network properties. This work is the first to propose a generative model which captures the statistical properties of these complex networks. The proposed model facilitates controlled experiments which study the effect of actors{\textquoteright} behavior on the evolution of affiliation networks, and it allows the generation of realistic synthetic datasets.},
	keywords = {affiliation network, Evolution, graph generator, groups, social network},
	isbn = {978-1-60558-495-9},
	doi = {10.1145/1557019.1557128},
	url = {http://doi.acm.org/10.1145/1557019.1557128},
	author = {Zheleva,Elena and Sharara,Hossam and Getoor, Lise}
}
@article {13968,
	title = {Computation of the head-related transfer function via the boundary element method and representation via the spherical harmonic spectrum},
	journal = {Technical Reports from UMIACS UMIACS-TR-2009-06},
	year = {2009},
	month = {2009/05/15/},
	abstract = {The head-related transfer function (HRTF) is computed using the fast multipole accelerated boundary element method. For efficiency, the HRTF is computed using the reciprocity principle, by placing a source at the ear and computing its field. Analysis is presented to modify the boundary value problem accordingly. To compute the HRTF corresponding to different ranges via a single computation, a compact and accurate representation of the HRTF, termed the spherical spectrum, is developed. Computations are reduced to a two stage process, the computation of the spherical spectrum and a subsequent evaluation of the HRTF. This representation allows easy interpolation and range extrapolation of HRTFs.HRTF computations are performed for the range of audible frequencies up to 20 kHz for several models including a sphere, human head models (for the {\textquotedblleft}Fritz{\textquotedblright} and {\textquotedblleft}Kemar{\textquotedblright}), and head and torso model (the Kemar manikin). Comparisons between the different cases and analysis of limiting cases is provided. Comparisons with the computational data of other authors and available experimental data are conducted and show satisfactory agreement for the frequencies for which reliable experimental data is available. Our results show that, given a good mesh it is feasible to compute the HRTF over the full audible range on a regular personal computer.
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/9085},
	author = {Gumerov, Nail A. and O{\textquoteright}donovan,Adam and Duraiswami, Ramani and Zotkin,Dmitry N}
}
@article {18195,
	title = {Design of data warehouse in teaching state based on OLAP and data mining},
	journal = {Proceedings of SPIE},
	volume = {7344},
	year = {2009},
	month = {2009///},
	pages = {73440M - 73440M},
	abstract = {The data warehouse and the data mining technology is one of information technology research hot topics. Atpresent the data warehouse and the data mining technology in aspects and so on commercial, financial industry as well
as enterprise{\textquoteright}s production, market marketing obtained the widespread application, but is relatively less in educational
fields{\textquoteright} application. Over the years, the teaching and management have been accumulating large amounts of data in
colleges and universities, while the data can not be effectively used, in the light of social needs of the university
development and the current status of data management, the establishment of data warehouse in university state, the
better use of existing data, and on the basis dealing with a higher level of disposal --data mining are particularly
important. In this paper, starting from the decision-making needs design data warehouse structure of university teaching
state, and then through the design structure and data extraction, loading, conversion create a data warehouse model,
finally make use of association rule mining algorithm for data mining, to get effective results applied in practice. Based
on the data analysis and mining, get a lot of valuable information, which can be used to guide teaching management,
thereby improving the quality of teaching and promoting teaching devotion in universities and enhancing teaching
infrastructure. At the same time it can provide detailed, multi-dimensional information for universities assessment and
higher education research.
},
	author = {Zhou,L. and Wu,M. and Li,S.}
}
@article {12532,
	title = {Detecting humans carrying objects},
	journal = {SPIE Newsroom},
	year = {2009},
	month = {2009///},
	abstract = {Decomposing an image sequence into slices that generate twisted patterns sufficiently characterizes human gait and a particular class of activities.},
	isbn = {18182259},
	doi = {10.1117/2.1200902.1511},
	url = {https://spie.org/x33692.xml?ArticleID=x33692},
	author = {Yang Ran and Qinfen Zheng and Chellapa, Rama}
}
@article {12890,
	title = {Diversity and Seasonality of Bioluminescent Vibrio Cholerae Populations in Chesapeake Bay},
	journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.},
	volume = {75},
	year = {2009},
	month = {2009/01/01/},
	pages = {135 - 146},
	abstract = {Association of luminescence with phenotypic and genotypic traits and with environmental parameters was determined for 278 strains of Vibrio cholerae isolated from the Chesapeake Bay during 1998 to 2000. Three clusters of luminescent strains (A, B, and C) and two nonluminescent clusters (X and Y) were identified among 180 clonal types. V. cholerae O1 strains isolated during pandemics and endemic cholera in the Ganges Delta were related to cluster Y. Heat-stable enterotoxin (encoded by stn) and the membrane protein associated with bile resistance (encoded by ompU) were found to be linked to luminescence in strains of cluster A. Succession from nonluminescent to luminescent populations of V. cholerae occurred during spring to midsummer. Occurrence of cluster A strains in water with neutral pH was contrasted with that of cluster Y strains in water with a pH of >8. Cluster A was found to be associated with a specific calanoid population cooccurring with cyclopoids. Cluster B was related to cluster Y, with its maximal prevalence at pH 8. Occurrence of cluster B strains was more frequent with warmer water temperatures and negatively correlated with maturity of the copepod community. It is concluded that each cluster of luminescent V. cholerae strains occupies a distinct ecological niche. Since the dynamics of these niche-specific subpopulations are associated with zooplankton community composition, the ecology of luminescent V. cholerae is concluded to be related to its interaction with copepods and related crustacean species.},
	isbn = {0099-2240, 1098-5336},
	doi = {10.1128/AEM.02894-07},
	url = {http://aem.asm.org/content/75/1/135},
	author = {Zo,Young-Gun and Chokesajjawatee,Nipa and Grim,Christopher and Arakawa,Eiji and Watanabe,Haruo and Rita R Colwell}
}
@article {15382,
	title = {Electromagnetic Analysis of Plasmon-Resonance Based All-Optical Magnetic Recording},
	journal = {Magnetics, IEEE Transactions on},
	volume = {45},
	year = {2009},
	month = {2009/03//},
	pages = {1634 - 1637},
	abstract = {The electromagnetic analysis of plasmon-resonance-based all-optical magnetic recording is performed. This analysis is based on the treatment of plasmon resonances as an eigenvalue problem for specific boundary integral equations. The plasmon modes which can be excited in circular nanoholes and cylindrical nanoshells by circularly polarized light are theoretically and numerically studied. Dramatic enhancement of circularly polarized light intensity on the nanoscale through the excitation of specific plasmon modes in uniaxial nanostructures is demonstrated.},
	keywords = {Ag;boundary, all-optical, analysis;magnetization, and, based, effects;nanoparticles;silver;surface, eigenfunctions;magnetic, equations;circular, equations;eigenvalues, integral, intensity;cylindrical, light, magnetic, modes;plasmon-resonance, nanoholes;circularly, nanoshells;eigenvalue, nanostructures;boundary, plasmon, polarized, problem;electromagnetic, recording;magnetisation, recording;silver;uniaxial, resonance;, reversal;magneto-optical, reversals;nanoparticle;plasmon},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2009.2012762},
	author = {Mayergoyz, Issak D and Zhang,Zhenyu and McAvoy,P. and Bowen,D. and Krafft,C.}
}
@article {16404,
	title = {The emergence of zoning policy games in exurban jurisdictions: Informing collective action theory},
	journal = {Land Use Policy},
	volume = {26},
	year = {2009},
	month = {2009/04//},
	pages = {356 - 367},
	abstract = {Theoretical urban policy literature predicts the likelihood of free riding in the management of common goods such as forested open space; such outcome is often characterized as a Prisoner{\textquoteright}s Dilemma game. Numerous cases exist in which neighboring jurisdictions cooperate to maintain public goods, challenging the expected results, yet theoretical explanations of these cases have not been fully developed. In this paper, we use an agent-based model to explore how underlying micro-behaviors affect the payoffs obtained by two neighboring municipalities in a hypothetical exurban area. Payoffs are measured in terms of regional forested space and of local tax revenue at the end of the agent-based simulations; the municipalities affect these payoffs through their choice of residential zoning policies and the spillover effect between the neighboring jurisdictions. Zoning restrictions influence the conversion of farmland into residential subdivisions of different types, and consequently the location of heterogeneous residential households in the region. Developers and residents respond to the changing landscape characteristics, thus establishing a feedback between early and future land-use patterns. The structure of the simulated payoffs is analyzed using standard game theory. Our analysis shows that a variety of games, in addition to Prisoner{\textquoteright}s Dilemma, can emerge between the neighboring jurisdictions. Other games encourage coordination or subsidization, offering some explanations for the unexpected observations. The game realized in any given context depends on the initial characteristics of the landscape, the value given to the objectives each township seeks to maximize, and the income distribution of the population.},
	keywords = {Agent-based modeling, game theory, Land-use policy, Local government cooperation, Scale interaction},
	isbn = {0264-8377},
	doi = {10.1016/j.landusepol.2008.04.004},
	url = {http://www.sciencedirect.com/science/article/pii/S0264837708000604},
	author = {Zellner,Moira L. and Page,Scott E. and Rand, William and Brown,Daniel G. and Robinson,Derek T. and Nassauer,Joan and Low,Bobbi}
}
@inbook {12526,
	title = {Face Recognition from Video},
	booktitle = {The Essential Guide to Video Processing (Second Edition)The Essential Guide to Video Processing (Second Edition)},
	year = {2009},
	month = {2009///},
	pages = {653 - 688},
	publisher = {Academic Press},
	organization = {Academic Press},
	address = {Boston},
	isbn = {978-0-12-374456-2},
	url = {http://www.sciencedirect.com/science/article/pii/B9780123744562000232},
	author = {Zhou,Shaohua Kevin and Chellapa, Rama and Aggarwal,Gaurav},
	editor = {Al Bovik}
}
@article {13780,
	title = {Generating surveys of scientific paradigms},
	journal = {Proceedings of HLT-NAACL},
	year = {2009},
	month = {2009///},
	abstract = {The number of research publications in var-ious disciplines is growing exponentially.
Researchers and scientists are increasingly
finding themselves in the position of having
to quickly understand large amounts of tech-
nical material. In this paper we present the
first steps in producing an automatically gen-
erated, readily consumable, technical survey.
Specifically we explore the combination of
citation information and summarization tech-
niques. Even though prior work (Teufel et
al., 2006) argues that citation text is unsuitable
for summarization, we show that in the frame-
work of multi-document survey creation, cita-
tion texts can play a crucial role.
},
	author = {Mohammad,S. and Dorr, Bonnie J and Egan,M. and Hassan,A. and Muthukrishan,P. and Qazvinian,V. and Radev,D. and Zajic, David}
}
@article {13973,
	title = {Imaging room acoustics with the audio camera.},
	journal = {The Journal of the Acoustical Society of America},
	volume = {125},
	year = {2009},
	month = {2009///},
	pages = {2544 - 2544},
	abstract = {Using a spherical microphone array and real time signal processing using a graphical processing unit (GPU), an audio camera has been developed. This device provides images of the intensity of the sound field arriving at a point from a specified direction to the spherical array. Real-time performance is achieved via use of GPUs. The intensity can be displayed integrated over the whole frequency band of the array, or in false color, with different frequency bands mapped to different color bands. The resulting audio camera may be combined with video cameras to achieve multimodal scene capture and analysis. A theory of registration of audio camera images with video camera images is developed, and joint analysis of audio and video images performed. An interesting application of the audio camera is the imaging of concert hall acoustics. The individual reflections that constitute the impulse response measured at a particular seat may be imaged, and their spatial origin determined. Other applications of the audio camera to people tracking, noise suppression, and camera pointing are also presented. [Work partially supported by NVIDIA and the VA.]},
	url = {http://link.aip.org/link/?JAS/125/2544/2},
	author = {O{\textquoteright}donovan,Adam and Duraiswami, Ramani and Gumerov, Nail A. and Zotkin,Dmitry N}
}
@conference {15863,
	title = {Improving search effectiveness in the legal e-discovery process using relevance feedback},
	booktitle = {Proceedings of the global E-Discovery/E-Disclosure workshop on electronically stored information in discovery at the 12th international conference on artificial intelligence and law (ICAIL09 DESI Workshop). DESI Press, Barcelona},
	year = {2009},
	month = {2009///},
	author = {Zhao,F.C. and Oard, Douglas and Baron,J.R.}
}
@article {13579,
	title = {Language Identification for Handwritten Document Images Using AShape Codebook},
	journal = {Pattern Recognition},
	volume = {42},
	year = {2009},
	month = {2009/12//},
	pages = {3184 - 3191},
	abstract = {Language identification for handwritten document images is an open document analysis problem. In this paper, we propose a novel approach to language identification for documents containing mixture of handwritten 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 segmentation-free shape feature that is generic enough to be detected repeatably. We learn a concise, structurally indexed shape codebook from training by clustering and partitioning similar feature types through graph cuts. Our approach is easily extensible and does not require skew correction, scale normalization, or segmentation. We quantitatively evaluate our approach using a large real-world document image collection, which is composed of 1,512 documents in eight languages (Arabic, Chinese, English, Hindi, Japanese, Korean, Russian, and Thai) and contains a complex mixture of handwritten and machine printed content. Experiments demonstrate the robustness and flexibility of our approach, and show exceptional language identification performance that exceeds the state of the art.},
	author = {Zhu,Guangyu and Yu,Xiaodong and Li,Yi and David Doermann}
}
@conference {12519,
	title = {Learning multi-modal densities on Discriminative Temporal Interaction Manifold for group activity recognition},
	booktitle = {Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on},
	year = {2009},
	month = {2009/06//},
	pages = {2450 - 2457},
	abstract = {While video-based activity analysis and recognition has received much attention, existing body of work mostly deals with single object/person case. Coordinated multi-object activities, or group activities, present in a variety of applications such as surveillance, sports, and biological monitoring records, etc., are the main focus of this paper. Unlike earlier attempts which model the complex spatial temporal constraints among multiple objects with a parametric Bayesian network, we propose a Discriminative Temporal Interaction Manifold (DTIM) framework as a data-driven strategy to characterize the group motion pattern without employing specific domain knowledge. In particular, we establish probability densities on the DTIM, whose element, the discriminative temporal interaction matrix, compactly describes the coordination and interaction among multiple objects in a group activity. For each class of group activity we learn a multi-modal density function on the DTIM. A Maximum a Posteriori (MAP) classifier on the manifold is then designed for recognizing new activities. Experiments on football play recognition demonstrate the effectiveness of the approach.},
	keywords = {a, activities;parametric, activity, analysis;belief, analysis;pattern, Bayesian, classification;image, classifier;multimodal, complex, constraints;data-driven, density, equipment;video, function;multiobject, interaction, manifold;discriminative, matrix;football, MOTION, network;video-based, networks;image, play, posteriori, processing;, recognition, recognition;group, recognition;maximum, signal, spatial, strategy;discriminative, temporal},
	doi = {10.1109/CVPR.2009.5206676},
	author = {Ruonan Li and Chellapa, Rama and Zhou,S. K}
}
@conference {13588,
	title = {Logo Matching for Document Image Retrieval},
	booktitle = {International Conference on Document Analysis and Recognition (ICDAR 2009)},
	year = {2009},
	month = {2009///},
	pages = {606 - 610},
	abstract = {Graphics detection and recognition are fundamental research problems in document image analysis and retrieval. As one of the most pervasive graphical elements in business and government documents, logos may enable immediate identification of organizational entities and serve extensively as a declaration of a document{\textquoteright}s source and ownership. In this work, we developed an automatic logo-based document image retrieval system that handles: 1) Logo detection and segmentation by boosting a cascade of classifiers across multiple image scales; and 2) Logo matching using translation, scale, and rotation invariant shape descriptors and matching algorithms. Our approach is segmentation free and layout independent and we address logo retrieval in an unconstrained setting of 2-D feature point matching. Finally, we quantitatively evaluate the effectiveness of our approach using large collections of real-world complex document images.},
	author = {Zhu,Guangyu and David Doermann}
}
@conference {13970,
	title = {Modal expansion of HRTFs: Continuous representation in frequency-range-angle},
	booktitle = {Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on},
	year = {2009},
	month = {2009/04//},
	pages = {285 - 288},
	abstract = {This paper proposes a continuous HRTF representation in both 3D spatial and frequency domains. The method is based on the acoustic reciprocity principle and a modal expansion of the wave equation solution to represent the HRTF variations with different variables in separate basis functions. The derived spatial basis modes can achieve HRTF near-field and far-field representation in one formulation. The HRTF frequency components are expanded using Fourier Spherical Bessel series for compact representation. The proposed model can be used to reconstruct HRTFs at any arbitrary position in space and at any frequency point from a finite number of measurements. Analytical simulated and measured HRTFs from a KEMAR are used to validate the model.},
	keywords = {analysis;signal, bessel, domains;frequency-range-angle;head, expansion;modal, Fourier, function;modal, functions;, reconstruction;signal, related, representation;transfer, series;HRTF;frequency, spherical, transfer},
	doi = {10.1109/ICASSP.2009.4959576},
	author = {Zhang,Wen and Abhayapala,T.D. and Kennedy,R.A. and Duraiswami, Ramani}
}
@article {15390,
	title = {Modeling and Testing of Ethernet Transformers},
	journal = {Magnetics, IEEE Transactions on},
	volume = {45},
	year = {2009},
	month = {2009/10//},
	pages = {4793 - 4796},
	abstract = {In this paper, novel techniques for the testing and identification of lumped parameters of equivalent circuits for Ethernet transformers are presented. It is demonstrated experimentally and theoretically that resonance phenomena may occur in the loop formed by leakage inductances and cross-winding capacitance. This resonance may corrupt the pass band of the transformers transfer characteristic for differential-mode signals.},
	keywords = {area, capacitance;differential-mode, characteristic;local, Ethernet, identification;lumped, inductances;lumped, networks;transformers;, PARAMETERS, phenomena;transformers, signals;leakage, testing;resonance, transfer, transformers;cross-winding},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2009.2023918},
	author = {Bowen,D. and Mayergoyz, Issak D and Zhang,Zhenyu and McAvoy,P. and Krafft,C. and Kroop,D.}
}
@conference {13969,
	title = {Plane-wave decomposition of a sound scene using a cylindrical microphone array},
	booktitle = {Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on},
	year = {2009},
	month = {2009/04//},
	pages = {85 - 88},
	abstract = {The analysis for microphone arrays formed by mounting microphones on a sound-hard spherical or cylindrical baffle is typically performed using a decomposition of the sound field in terms of orthogonal basis functions. An alternative representation in terms of plane waves and a method for obtaining the coefficients of such a representation directly from measurements was proposed recently for the case of a spherical array. It was shown that representing the field as a collection of plane waves arriving from various directions simplifies both source localization and beamforming. In this paper, these results are extended to the case of the cylindrical array. Similarly to the spherical array case, localization and beamforming based on plane-wave decomposition perform as well as the traditional orthogonal function based methods while being numerically more stable. Both simulated and experimental results are presented.},
	keywords = {array;plane, arrays;, baffle;cylindrical, beamforming;cylindrical, decomposition;sound-hard, localization;array, microphone, plane-wave, processing;microphone, scene, signal, spherical;source, waves;sound},
	doi = {10.1109/ICASSP.2009.4959526},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani}
}
@conference {18467,
	title = {Regularized HRTF fitting using spherical harmonics},
	booktitle = {IEEE Workshop on Applications of Signal Processing to Audio and Acoustics, 2009. WASPAA {\textquoteright}09},
	year = {2009},
	month = {2009/10//},
	pages = {257 - 260},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {By the Helmholtz reciprocity principle, the head-related transfer function (HRTF) is equivalent to an acoustic field created by a transmitter placed at the ear location. Therefore, it can be represented as a spherical harmonics spectrum - a weighted sum of spherical harmonics. Such representations are useful in theoretical and computational analysis. Many different (often severely undersampled) grids are used for HRTF measurement, making the spectral reconstruction difficult. In this paper, two methods of obtaining the spectrum are presented and analyzed both on synthetic (ground-truth data available) and real HRTF measurements.},
	keywords = {Acoustic applications, acoustic field, Acoustic fields, acoustic intensity measurement, Acoustic measurements, acoustic signal processing, Acoustic testing, acoustic waves, array signal processing, audio acoustics, circular arrays, computational analysis, Ear, ear location, head-related transfer function, Helmholtz reciprocity principle, HRTF, HRTF fitting, Loudspeakers, Microphones, Position measurement, signal reconstruction, spatial audio, spectral reconstruction, spherical harmonics, Transfer functions},
	isbn = {978-1-4244-3678-1},
	doi = {10.1109/ASPAA.2009.5346521},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.}
}
@article {12884,
	title = {RNA Colony Blot Hybridization Method for Enumeration of Culturable Vibrio Cholerae and Vibrio Mimicus Bacteria},
	journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.},
	volume = {75},
	year = {2009},
	month = {2009/09/01/},
	pages = {5439 - 5444},
	abstract = {A species-specific RNA colony blot hybridization protocol was developed for enumeration of culturable Vibrio cholerae and Vibrio mimicus bacteria in environmental water samples. Bacterial colonies on selective or nonselective plates were lysed by sodium dodecyl sulfate, and the lysates were immobilized on nylon membranes. A fluorescently labeled oligonucleotide probe targeting a phylogenetic signature sequence of 16S rRNA of V. cholerae and V. mimicus was hybridized to rRNA molecules immobilized on the nylon colony lift blots. The protocol produced strong positive signals for all colonies of the 15 diverse V. cholerae-V. mimicus strains tested, indicating 100\% sensitivity of the probe for the targeted species. For visible colonies of 10 nontarget species, the specificity of the probe was calculated to be 90\% because of a weak positive signal produced by Grimontia (Vibrio) hollisae, a marine bacterium. When both the sensitivity and specificity of the assay were evaluated using lake water samples amended with a bioluminescent V. cholerae strain, no false-negative or false-positive results were found, indicating 100\% sensitivity and specificity for culturable bacterial populations in freshwater samples when G. hollisae was not present. When the protocol was applied to laboratory microcosms containing V. cholerae attached to live copepods, copepods were found to carry approximately 10,000 to 50,000 CFU of V. cholerae per copepod. The protocol was also used to analyze pond water samples collected in an area of cholera endemicity in Bangladesh over a 9-month period. Water samples collected from six ponds demonstrated a peak in abundance of total culturable V. cholerae bacteria 1 to 2 months prior to observed increases in pathogenic V. cholerae and in clinical cases recorded by the area health clinic. The method provides a highly specific and sensitive tool for monitoring the dynamics of V. cholerae in the environment. The RNA blot hybridization protocol can also be applied to detection of other gram-negative bacteria for taxon-specific enumeration.},
	isbn = {0099-2240, 1098-5336},
	doi = {10.1128/AEM.02007-08},
	url = {http://aem.asm.org/content/75/17/5439},
	author = {Grim,Christopher J. and Zo,Young-Gun and Hasan,Nur A. and Ali,Afsar and Chowdhury,Wasimul B. and Islam,Atiqul and Rashid,Mohammed H. and Alam,Munirul and Morris,J. Glenn and Huq,Anwar and Rita R Colwell}
}
@article {13645,
	title = {Signature Detection and Matching for Document Image Retrieval},
	journal = {IEEETransactions on Pattern Analysis and Machine Intelligence},
	volume = {31},
	year = {2009},
	month = {2009/11//},
	pages = {2015 - 2031},
	abstract = {As one of the most pervasive methods of individual identification and document authentication, signatures present convincing evidence and provide an important form of indexing for effective document image processing and retrieval in a broad range of applications. However, detection and segmentation of free-form objects such as signatures from clustered background is currently an open document analysis problem. In this paper, we focus on two fundamental problems in signature-based document image retrieval. First, we propose a novel multi-scale approach to jointly detecting and segmenting signatures from document images. Rather than focusing on local features that typically have large variations, our approach captures the structural saliency using a signature production model and computes the dynamic curvature of 2-D contour fragments over multiple scales. This detection framework is general and computationally tractable. Second, we treat the problem of signature retrieval in the unconstrained setting of translation, scale, and rotation invariant non-rigid shape matching. We propose two novel measures of shape dissimilarity based on anisotropic scaling and registration residual error, and present a supervised learning framework for combining complementary shape information from different dissimilarity metrics using LDA. We quantitatively study state-of-the-art shape representations, shape matching algorithms, measures of dissimilarity, and the use of multiple instances as query in document image retrieval. We further demonstrate our matching techniques in off-line signature verification. Extensive experiments using large real world collections of English and Arabic machine printed and handwritten documents demonstrate the excellent performance of our approaches.},
	author = {Zhu,Guangyu and Yefeng Zheng and David Doermann and Jaeger,Stefan}
}
@article {18721,
	title = {Structure of the S5a:K48-Linked Diubiquitin Complex and Its Interactions with Rpn13},
	journal = {Molecular Cell},
	volume = {35},
	year = {2009},
	month = {2009/08/14/},
	pages = {280 - 290},
	abstract = {SummaryDegradation by the proteasome typically requires substrate ubiquitination. Two ubiquitin receptors exist in the proteasome, S5a/Rpn10 and Rpn13. Whereas Rpn13 has only one ubiquitin-binding surface, S5a binds ubiquitin with two independent ubiquitin-interacting motifs (UIMs). Here, we use nuclear magnetic resonance (NMR) and analytical ultracentrifugation to define at atomic level resolution how S5a binds K48-linked diubiquitin, in which K48 of~one ubiquitin subunit (the {\textquotedblleft}proximal{\textquotedblright} one) is covalently bonded to G76 of the other (the {\textquotedblleft}distal{\textquotedblright} subunit). We demonstrate that S5a{\textquoteright}s UIMs bind the two subunits simultaneously with a preference for UIM2 binding to the proximal subunit while UIM1 binds to the distal one. In addition, NMR experiments reveal that Rpn13 and S5a bind K48-linked diubiquitin simultaneously with subunit specificity, and a model structure of S5a and Rpn13 bound to K48-linked polyubiquitin is provided. Altogether, our data demonstrate that S5a is highly adaptive and cooperative toward binding ubiquitin chains.
},
	keywords = {Proteins},
	isbn = {1097-2765},
	doi = {10.1016/j.molcel.2009.06.010},
	url = {http://www.sciencedirect.com/science/article/pii/S1097276509004018},
	author = {Zhang,Naixia and Wang,Qinghua and Ehlinger,Aaron and Randles,Leah and Lary,Jeffrey W. and Kang,Yang and Haririnia,Aydin and Storaska,Andrew J. and Cole,James L. and Fushman, David and Walters,Kylie J.}
}
@article {19726,
	title = {Three genomes from the phylum Acidobacteria provide insight into the lifestyles of these microorganisms in soils.},
	journal = {Appl Environ Microbiol},
	volume = {75},
	year = {2009},
	month = {2009 Apr},
	pages = {2046-56},
	abstract = {<p>The complete genomes of three strains from the phylum Acidobacteria were compared. Phylogenetic analysis placed them as a unique phylum. They share genomic traits with members of the Proteobacteria, the Cyanobacteria, and the Fungi. The three strains appear to be versatile heterotrophs. Genomic and culture traits indicate the use of carbon sources that span simple sugars to more complex substrates such as hemicellulose, cellulose, and chitin. The genomes encode low-specificity major facilitator superfamily transporters and high-affinity ABC transporters for sugars, suggesting that they are best suited to low-nutrient conditions. They appear capable of nitrate and nitrite reduction but not N(2) fixation or denitrification. The genomes contained numerous genes that encode siderophore receptors, but no evidence of siderophore production was found, suggesting that they may obtain iron via interaction with other microorganisms. The presence of cellulose synthesis genes and a large class of novel high-molecular-weight excreted proteins suggests potential traits for desiccation resistance, biofilm formation, and/or contribution to soil structure. Polyketide synthase and macrolide glycosylation genes suggest the production of novel antimicrobial compounds. Genes that encode a variety of novel proteins were also identified. The abundance of acidobacteria in soils worldwide and the breadth of potential carbon use by the sequenced strains suggest significant and previously unrecognized contributions to the terrestrial carbon cycle. Combining our genomic evidence with available culture traits, we postulate that cells of these isolates are long-lived, divide slowly, exhibit slow metabolic rates under low-nutrient conditions, and are well equipped to tolerate fluctuations in soil hydration.</p>},
	keywords = {Anti-Bacterial Agents, bacteria, Biological Transport, Carbohydrate Metabolism, Cyanobacteria, DNA, Bacterial, Fungi, Genome, Bacterial, Macrolides, Molecular Sequence Data, Nitrogen, Phylogeny, Proteobacteria, Sequence Analysis, DNA, sequence homology, Soil Microbiology},
	issn = {1098-5336},
	doi = {10.1128/AEM.02294-08},
	author = {Ward, Naomi L and Challacombe, Jean F and Janssen, Peter H and Henrissat, Bernard and Coutinho, Pedro M and Wu, Martin and Xie, Gary and Haft, Daniel H and Sait, Michelle and Badger, Jonathan and Barabote, Ravi D and Bradley, Brent and Brettin, Thomas S and Brinkac, Lauren M and Bruce, David and Creasy, Todd and Daugherty, Sean C and Davidsen, Tanja M and DeBoy, Robert T and Detter, J Chris and Dodson, Robert J and Durkin, A Scott and Ganapathy, Anuradha and Gwinn-Giglio, Michelle and Han, Cliff S and Khouri, Hoda and Kiss, Hajnalka and Kothari, Sagar P and Madupu, Ramana and Nelson, Karen E and Nelson, William C and Paulsen, Ian and Penn, Kevin and Ren, Qinghu and Rosovitz, M J and Jeremy D Selengut and Shrivastava, Susmita and Sullivan, Steven A and Tapia, Roxanne and Thompson, L Sue and Watkins, Kisha L and Yang, Qi and Yu, Chunhui and Zafar, Nikhat and Zhou, Liwei and Kuske, Cheryl R}
}
@conference {14448,
	title = {To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles},
	booktitle = {Proceedings of the 18th international conference on World wide web},
	series = {WWW {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {531 - 540},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {In order to address privacy concerns, many social media websites allow users to hide their personal profiles from the public. In this work, we show how an adversary can exploit an online social network with a mixture of public and private user profiles to predict the private attributes of users. We map this problem to a relational classification problem and we propose practical models that use friendship and group membership information (which is often not hidden) to infer sensitive attributes. The key novel idea is that in addition to friendship links, groups can be carriers of significant information. We show that on several well-known social media sites, we can easily and accurately recover the information of private-profile users. To the best of our knowledge, this is the first work that uses link-based and group-based classification to study privacy implications in social networks with mixed public and private user profiles.},
	keywords = {attribute inference, groups, privacy, social networks},
	isbn = {978-1-60558-487-4},
	doi = {10.1145/1526709.1526781},
	url = {http://doi.acm.org/10.1145/1526709.1526781},
	author = {Zheleva,Elena and Getoor, Lise}
}
@article {18724,
	title = {Together, Rpn10 and Dsk2 Can Serve as a Polyubiquitin Chain-Length Sensor},
	journal = {Molecular Cell},
	volume = {36},
	year = {2009},
	month = {2009/12/24/},
	pages = {1018 - 1033},
	abstract = {SummaryAs a signal for substrate targeting, polyubiquitin meets various layers of receptors upstream to the 26S proteasome. We obtained structural information on two receptors, Rpn10 and Dsk2, alone and in complex with (poly)ubiquitin or with each other. A~hierarchy of affinities emerges with Dsk2 binding monoubiquitin tighter than Rpn10 does, whereas Rpn10 prefers the ubiquitin-like domain of Dsk2 to monoubiquitin, with increasing affinities for longer polyubiquitin chains. We demonstrated the formation of ternary complexes of both receptors simultaneously with (poly)ubiquitin and found that, depending on the ubiquitin chain length, the orientation of the resulting complex is entirely different, providing for alternate signals. Dynamic rearrangement provides a chain-length sensor, possibly explaining how accessibility of Dsk2 to the proteasome is limited unless it carries a properly tagged cargo. We propose a mechanism for a malleable ubiquitin signal that depends both on chain length and combination of receptors to produce tetraubiquitin as an efficient signal threshold.
},
	keywords = {Proteins, signaling},
	isbn = {1097-2765},
	doi = {10.1016/j.molcel.2009.11.012},
	url = {http://www.sciencedirect.com/science/article/pii/S1097276509008260},
	author = {Zhang,Daoning and Chen,Tony and Ziv,Inbal and Rosenzweig,Rina and Matiuhin,Yulia and Bronner,Vered and Glickman,Michael H. and Fushman, David}
}
@conference {12163,
	title = {Tool supported detection and judgment of nonconformance in process execution},
	booktitle = {Empirical Software Engineering and Measurement, 2009. ESEM 2009. 3rd International Symposium on},
	year = {2009},
	month = {2009/10//},
	pages = {312 - 323},
	abstract = {In the past decades the software engineering community has proposed a large collection of software development life cycles, models, and processes. The goal of a major set of these processes is to assure that the product is finished within time and budget, and that a predefined set of functional and nonfunctional requirements (e.g. quality goals) are satisfied at delivery time. Based upon the assumption that there is a real relationship between the process applied and the characteristics of the product developed from that process, we developed a tool supported approach that uses process nonconformance detection to identify potential risks in achieving the required process characteristics. In this paper we present the approach and a feasibility study that demonstrates its use on a large-scale software development project in the aerospace domain. We demonstrate that our approach, in addition to meeting the criteria above, can be applied to a real system of reasonable size; can represent a useful and adequate set of rules of relevance in such an environment; and can detect relevant examples of process nonconformance that provide useful insight to the project manager.},
	keywords = {aerospace, community;tool, cycle;software, detection;software, development, domain;large-scale, engineering, execution;process, life, management;software, nonconformance, project;nonfunctional, requirement;process, software, supported, tools;},
	doi = {10.1109/ESEM.2009.5315983},
	author = {Zazworka, N. and Basili, Victor R. and Shull, F.}
}
@article {13026,
	title = {Toward reconstructing the evolution of advanced moths and butterflies (Lepidoptera: Ditrysia): an initial molecular study},
	journal = {BMC Evol Biol},
	volume = {9},
	year = {2009},
	month = {2009///},
	pages = {280 - 280},
	abstract = {BACKGROUND: In the mega-diverse insect order Lepidoptera (butterflies and moths; 165,000 described species), deeper relationships are little understood within the clade Ditrysia, to which 98\% of the species belong. To begin addressing this problem, we tested the ability of five protein-coding nuclear genes (6.7 kb total), and character subsets therein, to resolve relationships among 123 species representing 27 (of 33) superfamilies and 55 (of 100) families of Ditrysia under maximum likelihood analysis. RESULTS: Our trees show broad concordance with previous morphological hypotheses of ditrysian phylogeny, although most relationships among superfamilies are weakly supported. There are also notable surprises, such as a consistently closer relationship of Pyraloidea than of butterflies to most Macrolepidoptera. Monophyly is significantly rejected by one or more character sets for the putative clades Macrolepidoptera as currently defined (P < 0.05) and Macrolepidoptera excluding Noctuoidea and Bombycoidea sensu lato (P < or = 0.005), and nearly so for the superfamily Drepanoidea as currently defined (P < 0.08). Superfamilies are typically recovered or nearly so, but usually without strong support. Relationships within superfamilies and families, however, are often robustly resolved. We provide some of the first strong molecular evidence on deeper splits within Pyraloidea, Tortricoidea, Geometroidea, Noctuoidea and others.Separate analyses of mostly synonymous versus non-synonymous character sets revealed notable differences (though not strong conflict), including a marked influence of compositional heterogeneity on apparent signal in the third codon position (nt3). As available model partitioning methods cannot correct for this variation, we assessed overall phylogeny resolution through separate examination of trees from each character set. Exploration of "tree space" with GARLI, using grid computing, showed that hundreds of searches are typically needed to find the best-feasible phylogeny estimate for these data. CONCLUSION: Our results (a) corroborate the broad outlines of the current working phylogenetic hypothesis for Ditrysia, (b) demonstrate that some prominent features of that hypothesis, including the position of the butterflies, need revision, and (c) resolve the majority of family and subfamily relationships within superfamilies as thus far sampled. Much further gene and taxon sampling will be needed, however, to strongly resolve individual deeper nodes.},
	doi = {10.1186/1471-2148-9-280},
	author = {Regier,J. C and Zwick,A. and Cummings, Michael P. and Kawahara,A. Y and Cho,S. and Weller,S. and Roe,A. and Baixeras,J. and Brown,J. W and Parr,C. and Davis,DR and Epstein,M and Hallwachs,W and Hausmann,A and Janzen,DH and Kitching,IJ and Solis,MA and Yen,S-H and Bazinet,A. L and Mitter,C}
}
@article {19008,
	title = {Two Alternatively Spliced Isoforms of the Arabidopsis SR45 Protein Have Distinct Roles during Normal Plant Development},
	journal = {Plant PhysiologyPlant Physiol.},
	volume = {150},
	year = {2009},
	month = {2009/07/01/},
	pages = {1450 - 1458},
	abstract = {The serine-arginine-rich (SR) proteins constitute a conserved family of pre-mRNA splicing factors. In Arabidopsis (Arabidopsis thaliana), they are encoded by 19 genes, most of which are themselves alternatively spliced. In the case of SR45, the use of alternative 3' splice sites 21 nucleotides apart generates two alternatively spliced isoforms. Isoform 1 (SR45.1) has an insertion relative to isoform 2 (SR45.2) that replaces a single arginine with eight amino acids (TSPQRKTG). The biological implications of SR45 alternative splicing have been unclear. A previously described loss-of-function mutant affecting both isoforms, sr45-1, shows several developmental defects, including defects in petal development and root growth. We found that the SR45 promoter is highly active in regions with actively growing and dividing cells. We also tested the ability of each SR45 isoform to complement the sr45-1 mutant by overexpression of isoform-specific green fluorescent protein (GFP) fusion proteins. As expected, transgenic plants overexpressing either isoform displayed both nuclear speckles and GFP fluorescence throughout the nucleoplasm. We found that SR45.1-GFP complements the flower petal phenotype, but not the root growth phenotype. Conversely, SR45.2-GFP complements root growth but not floral morphology. Mutation of a predicted phosphorylation site within the alternatively spliced segment, SR45.1-S219A-GFP, does not affect complementation. However, a double mutation affecting both serine-219 and the adjacent threonine-218 (SR45.1-T218A + S219A-GFP) behaves like isoform 2, complementing the root but not the floral phenotype. In conclusion, our study provides evidence that the two alternatively spliced isoforms of SR45 have distinct biological functions.},
	isbn = {0032-0889, 1532-2548},
	doi = {10.1104/pp.109.138180},
	url = {http://www.plantphysiol.org/content/150/3/1450},
	author = {Zhang,Xiao-Ning and Mount, Stephen M.}
}
@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 {13107,
	title = {Visual Tracking by Continuous Density Propagation in Sequential Bayesian Filtering Framework},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {31},
	year = {2009},
	month = {2009/05//},
	pages = {919 - 930},
	abstract = {Particle filtering is frequently used for visual tracking problems since it provides a general framework for estimating and propagating probability density functions for nonlinear and non-Gaussian dynamic systems. However, this algorithm is based on a Monte Carlo approach and the cost of sampling and measurement is a problematic issue, especially for high-dimensional problems. We describe an alternative to the classical particle filter in which the underlying density function has an analytic representation for better approximation and effective propagation. The techniques of density interpolation and density approximation are introduced to represent the likelihood and the posterior densities with Gaussian mixtures, where all relevant parameters are automatically determined. The proposed analytic approach is shown to perform more efficiently in sampling in high-dimensional space. We apply the algorithm to real-time tracking problems and demonstrate its performance on real video sequences as well as synthetic examples.},
	keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Computer-Assisted;Pattern Recognition, Computer-Assisted;Subtraction Technique;, Monte Carlo approach;continuous density propagation;density approximation;density interpolation;nonGaussian dynamic systems;nonlinear dynamic systems;particle filtering;probability density functions;sequential Bayesian filtering framework;video sequences;},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2008.134},
	author = {Han,Bohyung and Zhu,Ying and Comaniciu, D. and Davis, Larry S.}
}
@article {18694,
	title = {Affinity Makes the Difference: Nonselective Interaction of the UBA Domain of Ubiquilin-1 with Monomeric Ubiquitin and Polyubiquitin Chains},
	journal = {Journal of Molecular Biology},
	volume = {377},
	year = {2008},
	month = {2008/03/14/},
	pages = {162 - 180},
	abstract = {Ubiquilin/PLIC proteins belong to the family of UBL{\textendash}UBA proteins implicated in the regulation of the ubiquitin-dependent proteasomal degradation of cellular proteins. A human presenilin-interacting protein, ubiquilin-1, has been suggested as potential therapeutic target for treating Huntington{\textquoteright}s disease. Ubiquilin{\textquoteright}s interactions with mono- and polyubiquitins are mediated by its UBA domain, which is one of the tightest ubiquitin binders among known ubiquitin-binding domains. Here we report the three-dimensional structure of the UBA domain of ubiquilin-1 (UQ1-UBA) free in solution and in complex with ubiquitin. UQ1-UBA forms a compact three-helix bundle structurally similar to other known UBAs, and binds to the hydrophobic patch on ubiquitin with a Kd of 20~μM. To gain structural insights into UQ1-UBA{\textquoteright}s interactions with polyubiquitin chains, we have mapped the binding interface between UQ1-UBA and Lys48- and Lys63-linked di-ubiquitins and characterized the strength of UQ1-UBA binding to these chains. Our NMR data show that UQ1-UBA interacts with the individual ubiquitin units in both chains in a mode similar to its interaction with mono-ubiquitin, although with an improved binding affinity for the chains. Our results indicate that, in contrast to UBA2 of hHR23A that has strong binding preference for Lys48-linked chains, UQ1-UBA shows little or no binding selectivity toward a particular chain linkage or between the two ubiquitin moieties in the same chain. The structural data obtained in this study provide insights into the possible structural reasons for the diversity of polyubiquitin chain recognition by UBA domains.},
	keywords = {polyubiquitin, protein{\textendash}protein interaction, UBA domain, ubiquilin, ubiquitin},
	isbn = {0022-2836},
	doi = {10.1016/j.jmb.2007.12.029},
	url = {http://www.sciencedirect.com/science/article/pii/S0022283607016452},
	author = {Zhang,Daoning and Raasi,Shahri and Fushman, David}
}
@conference {18546,
	title = {Answering what-if deployment and configuration questions with wise},
	booktitle = {Proceedings of the ACM SIGCOMM 2008 conference on Data communication},
	series = {SIGCOMM {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {99 - 110},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Designers of content distribution networks often need to determine how changes to infrastructure deployment and configuration affect service response times when they deploy a new data center, change ISP peering, or change the mapping of clients to servers. Today, the designers use coarse, back-of-the-envelope calculations, or costly field deployments; they need better ways to evaluate the effects of such hypothetical "what-if" questions before the actual deployments. This paper presents What-If Scenario Evaluator (WISE), a tool that predicts the effects of possible configuration and deployment changes in content distribution networks. WISE makes three contributions: (1) an algorithm that uses traces from existing deployments to learn causality among factors that affect service response-time distributions; (2) an algorithm that uses the learned causal structure to estimate a dataset that is representative of the hypothetical scenario that a designer may wish to evaluate, and uses these datasets to predict future response-time distributions; (3) a scenario specification language that allows a network designer to easily express hypothetical deployment scenarios without being cognizant of the dependencies between variables that affect service response times. Our evaluation, both in a controlled setting and in a real-world field deployment at a large, global CDN, shows that WISE can quickly and accurately predict service response-time distributions for many practical What-If scenarios.},
	keywords = {content distribution networks, performance modeling, what-if scenario evaluation},
	isbn = {978-1-60558-175-0},
	doi = {10.1145/1402958.1402971},
	url = {http://doi.acm.org/10.1145/1402958.1402971},
	author = {Tariq,Mukarram and Zeitoun,Amgad and Valancius,Vytautas and Feamster, Nick and Ammar,Mostafa}
}
@article {12906,
	title = {Covariability of Vibrio Cholerae Microdiversity and Environmental Parameters},
	journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.},
	volume = {74},
	year = {2008},
	month = {2008/05/01/},
	pages = {2915 - 2920},
	abstract = {Fine-scale diversity of natural bacterial assemblages has been attributed to neutral radiation because correspondence between bacterial phylogenetic signals in the natural environment and environmental parameters had not been detected. Evidence that such correspondence occurs is provided for Vibrio cholerae, establishing a critical role for environmental parameters in bacterial diversity.},
	isbn = {0099-2240, 1098-5336},
	doi = {10.1128/AEM.02139-07},
	url = {http://aem.asm.org/content/74/9/2915},
	author = {Zo,Young-Gun and Chokesajjawatee,Nipa and Arakawa,Eiji and Watanabe,Haruo and Huq,Anwar and Rita R Colwell}
}
@article {16687,
	title = {Cross-language parser adaptation between related languages},
	journal = {NLP for Less Privileged Languages},
	year = {2008},
	month = {2008///},
	pages = {35 - 35},
	author = {Zeman,D. and Resnik, Philip}
}
@article {16065,
	title = {Data Sonification for Users with Visual Impairment: A Case Study with Georeferenced Data},
	journal = {ACM Trans. Comput.-Hum. Interact.},
	volume = {15},
	year = {2008},
	month = {2008/05//},
	pages = {4:1{\textendash}4:28 - 4:1{\textendash}4:28},
	abstract = {We describe the development and evaluation of a tool, iSonic, to assist users with visual impairment in exploring georeferenced data using coordinated maps and tables, augmented with nontextual sounds and speech output. Our in-depth case studies with 7 blind users during 42 hours of data collection, showed that iSonic enabled them to find facts and discover trends in georeferenced data, even in unfamiliar geographical contexts, without special devices. Our design was guided by an Action-by-Design-Component (ADC) framework, which was also applied to scatterplots to demonstrate its generalizability. Video and download is available at www.cs.umd.edu/hcil/iSonic/.},
	keywords = {auditory user interfaces, information seeking, Interactive sonification, universal usability, users with visual impairment},
	isbn = {1073-0516},
	doi = {10.1145/1352782.1352786},
	url = {http://doi.acm.org/10.1145/1352782.1352786},
	author = {Zhao,Haixia and Plaisant, Catherine and Shneiderman, Ben and Lazar,Jonathan}
}
@article {12901,
	title = {Determination of Clonality and Relatedness of Vibrio Cholerae Isolates by Genomic Fingerprinting, Using Long-Range Repetitive Element Sequence-Based PCR},
	journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.},
	volume = {74},
	year = {2008},
	month = {2008/09/01/},
	pages = {5392 - 5401},
	abstract = {A high-throughput method which is applicable for rapid screening, identification, and delineation of isolates of Vibrio cholerae, sensitive to genome variation, and capable of providing phylogenetic inferences enhances environmental monitoring of this bacterium. We have developed and optimized a method for genomic fingerprinting of V. cholerae based on long-range PCR. The method uses a primer set directed to enterobacterial repetitive intergenic consensus sequences, a high-fidelity DNA polymerase, and analysis via conventional agarose gel electrophoresis. Long (\~{}10 kb), highly reproducible amplicons were generated from V. cholerae isolates, including those from different geographical locations and historical strains isolated during the period 1931-2000. The amplicons yielded reduced variability in their densitometric band patterns to <=10\% and clonal distinction at <90\% similarity. Rapid band-matching analysis was accomplished for fingerprints with >=90\% similarity, discriminating O serotypes and biotypes (classical versus El Tor) as well as pathogenic and nonpathogenic strains. Compared to genome similarity measured by DNA-DNA hybridization, the results showed good correlation (r = 0.7; P < 0.001), with five times less measurement error and without bias. The method permits both phylogenetic inference and clonal differentiation of individual V. cholerae strains, enables robust, high-throughput analysis, and does not require specialized equipment to perform. With access to a curated public database furnished with appropriate analytical software applications, the method should prove useful in large-scale multilaboratory surveys, especially those designed to detect specific pathogens in the natural environment.},
	isbn = {0099-2240, 1098-5336},
	doi = {10.1128/AEM.00151-08},
	url = {http://aem.asm.org/content/74/17/5392},
	author = {Chokesajjawatee,Nipa and Zo,Young-Gun and Rita R Colwell}
}
@inbook {12117,
	title = {An Environment for Conducting Families of Software Engineering Experiments},
	booktitle = {Software Development},
	volume = {Volume 74},
	year = {2008},
	month = {2008///},
	pages = {175 - 200},
	publisher = {Elsevier},
	organization = {Elsevier},
	abstract = {The classroom is a valuable resource for conducting software engineering experiments. However, coordinating a family of experiments in classroom environments presents a number of challenges to researchers. Understanding how to run such experiments, developing procedures to collect accurate data, and collecting data that is consistent across multiple studies are major problems. This paper describes an environment, the Experiment Manager that simplifies the process of collecting, managing, and sanitizing data from classroom experiments, while minimizing disruption to natural subject behavior. We have successfully used this environment to study the impact of parallel programming languages in the high-performance computing domain on programmer productivity at multiple universities across the United States.},
	isbn = {0065-2458},
	url = {http://www.sciencedirect.com/science/article/pii/S0065245808006050},
	author = {Hochstein, Lorin and Nakamura,Taiga and Shull, Forrest and Zazworka, Nico and Basili, Victor R. and Zelkowitz, Marvin V},
	editor = {Zelkowitz, Marvin V}
}
@inbook {12996,
	title = {Expanding the reach of Grid computing: combining Globus- and BOINC-based systems},
	booktitle = {Grids for Bioinformatics and Computational BiologyGrids for Bioinformatics and Computational Biology},
	series = {Wiley Book Series on Bioinformatics: Computational Techniques and Engineering},
	year = {2008},
	month = {2008///},
	pages = {71 - 85},
	publisher = {Wiley-Interscience},
	organization = {Wiley-Interscience},
	address = {Hoboken},
	author = {Myers,D. S and Bazinet,A. L and Cummings, Michael P.},
	editor = {Talbi,E-G and Zomaya,AY}
}
@article {15866,
	title = {Extending sense-making models with ideas from cognition and learning theories},
	journal = {Proceedings of the American Society for Information Science and Technology},
	volume = {45},
	year = {2008},
	month = {2008///},
	pages = {23 - 23},
	author = {Zhang,P. and Soergel,D. and Klavans,J. L and Oard, Douglas}
}
@article {16396,
	title = {Exurbia from the bottom-up: Confronting empirical challenges to characterizing a complex system},
	journal = {Geoforum},
	volume = {39},
	year = {2008},
	month = {2008/03//},
	pages = {805 - 818},
	abstract = {We describe empirical results from a multi-disciplinary project that support modeling complex processes of land-use and land-cover change in exurban parts of Southeastern Michigan. Based on two different conceptual models, one describing the evolution of urban form as a consequence of residential preferences and the other describing land-cover changes in an exurban township as a consequence of residential preferences, local policies, and a diversity of development types, we describe a variety of empirical data collected to support the mechanisms that we encoded in computational agent-based models. We used multiple methods, including social surveys, remote sensing, and statistical analysis of spatial data, to collect data that could be used to validate the structure of our models, calibrate their specific parameters, and evaluate their output. The data were used to investigate this system in the context of several themes from complexity science, including have (a) macro-level patterns; (b) autonomous decision making entities (i.e., agents); (c) heterogeneity among those entities; (d) social and spatial interactions that operate across multiple scales and (e) nonlinear feedback mechanisms. The results point to the importance of collecting data on agents and their interactions when producing agent-based models, the general validity of our conceptual models, and some changes that we needed to make to these models following data analysis. The calibrated models have been and are being used to evaluate landscape dynamics and the effects of various policy interventions on urban land-cover patterns.},
	keywords = {Ecological effects, Land-cover change, Land-use change, spatial modeling, Urban sprawl},
	isbn = {0016-7185},
	doi = {10.1016/j.geoforum.2007.02.010},
	url = {http://www.sciencedirect.com/science/article/pii/S0016718507000371},
	author = {Brown,Daniel G. and Robinson,Derek T. and An,Li and Nassauer,Joan I. and Zellner,Moira and Rand, William and Riolo,Rick and Page,Scott E. and Low,Bobbi and Wang,Zhifang}
}
@book {13565,
	title = {Handwritten Document Image Processing},
	year = {2008},
	month = {2008///},
	publisher = {VDMVerlang Dr. Muller},
	organization = {VDMVerlang Dr. Muller},
	author = {Yefeng Zheng and David Doermann and Huiping Li}
}
@article {14970,
	title = {High Performance Computing Algorithms for Land Cover},
	year = {2008},
	month = {2008///},
	institution = {CiteSeerX},
	abstract = {Global and regional land cover studies require the ability to apply complex models on selected subsets of large amounts of multi-sensor and multi-temporal data sets that have been derived from raw instrument measurements using widely accepted pre-processing algorithms. The computational and storage requirements of most such studies far exceed what is possible on a single workstation environment. We have been pursuing a new approach that couples scalable and open distributed heterogeneous hardware with the development of high performance software for processing, indexing, and organizing remotely sensed data. Hierarchical data management tools are used to ingest raw data, create metadata, and organize the archived data so as to automatically achieve computational load balancing among the available nodes and minimize I/O overheads. We illustrate our approach with four specific examples. The first is the development of the first fast operational scheme for the atmospheric correction of Landsat TM scenes, while the second example focuses on image segmentation using a novel hierarchical connected components algorithm. Retrieval of global BRDF (Bidirectional Reflectance Distribution Function) in the red and near infrared wavelengths using four years (1983 to 1986) of Pathfinder AVHRR Land (PAL) data set is the focus of our third example. The fourth example is the development of a hierarchical data organization scheme that allows on-demand processing and retrieval of regional and global AVHRR data sets. Our results show that substantial improvements in computational times can be achieved by using the high performance computing technology.},
	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.4213},
	author = {Dynamics Using Remote and Satya Kalluri and Bader,David A. and John Townshend and JaJa, Joseph F. and Zengyan Zhang and Fallah-adl,Hassan}
}
@article {14514,
	title = {How friendship links and group memberships affect the privacy of individuals in social networks},
	volume = {UMIACS-TR-2008-16},
	year = {2008},
	month = {2008/07/01/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {In order to address privacy concerns, many social media websites allow users to hide their personal profiles from the public. In this work, we show how an adversary can exploit a social network with a mixture of public and private user profiles to predict the private attributes of users. We map this problem to a relational classification problem and we propose a simple yet powerful model that uses group features and group memberships of users to perform multi-value classification. We compare its efficacy against several other classification approaches. Our results show that even in the case when there is an option for making profile attributes private, if links and group affiliations are known, users{\textquoteright} privacy in social networks may be compromised. On a dataset from a well-known social-media website, we could easily recover the sensitive attributes for half of the private-profile users with a high accuracy when as much as half of the profiles are private. To the best of our knowledge, this is the first work that uses link-based and group-based classification to study privacy implications in social networks. We conclude with a discussion of our findings and the broader applicability of our proposed model.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/8691},
	author = {Zheleva,Elena and Getoor, Lise}
}
@conference {18477,
	title = {Imaging concert hall acoustics using visual and audio cameras},
	booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2008. ICASSP 2008},
	year = {2008},
	month = {2008///},
	pages = {5284 - 5287},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Using a developed real time audio camera, that uses the output of a spherical microphone array beamformer steered in all directions to create central projection to create acoustic intensity images, we present a technique to measure the acoustics of rooms and halls. A panoramic mosaiced visual image of the space is also create. Since both the visual and the audio camera images are central projection, registration of the acquired audio and video images can be performed using standard computer vision techniques. We describe the technique, and apply it to the examine the relation between acoustical features and architectural details of the Dekelbaum concert hall at the Clarice Smith Performing Arts Center in College Park, MD.},
	keywords = {Acoustic imaging, acoustic intensity images, acoustic measurement, Acoustic measurements, Acoustic scattering, acoustic signal processing, acoustical camera, acoustical scene analysis, acquired audio registration, audio cameras, audio signal processing, CAMERAS, central projection, Computer vision, Educational institutions, HUMANS, image registration, Image segmentation, imaging concert hall acoustics, Layout, microphone arrays, panoramic mosaiced visual image, Raman scattering, reverberation, room acoustics, spherical microphone array beamformer, spherical microphone arrays, video image registration, visual cameras},
	isbn = {978-1-4244-1483-3},
	doi = {10.1109/ICASSP.2008.4518852},
	author = {O{\textquoteright}Donovan,A. and Duraiswami, Ramani and Zotkin,Dmitry N}
}
@conference {15064,
	title = {An improved mean shift tracking method based on nonparametric clustering and adaptive bandwidth},
	booktitle = {Machine Learning and Cybernetics, 2008 International Conference on},
	volume = {5},
	year = {2008},
	month = {2008/07//},
	pages = {2779 - 2784},
	abstract = {An improved mean shift method for object tracking based on nonparametric clustering and adaptive bandwidth is presented in this paper. Based on partitioning the color space of a tracked object by using a modified nonparametric clustering, an appearance model of the tracked object is built. It captures both the color information and spatial layout of the tracked object. The similarity measure between the target model and the target candidate is derived from the Bhattacharyya coefficient. The kernel bandwidth parameters are automatically selected by maximizing the lower bound of a log-likelihood function, which is derived from a kernel density estimate using the bandwidth matrix and the modified weight function. The experimental results show that the method can converge in an average of 2.6 iterations per frame.},
	keywords = {adaptive bandwidth, appearance model, bandwidth matrix, Bhattacharyya coefficient, color information, color space partitioning, image colour analysis, iterative procedure, kernel bandwidth parameter, kernel density estimate, log-likelihood function, mean shift tracking method, modified weight function, nonparametric clustering, Object detection, object representation, object tracking, pattern clustering, similarity measure, spatial layout, target candidate, target model, tracking},
	doi = {10.1109/ICMLC.2008.4620880},
	author = {Zhuolin Jiang and Li,Shao-Fa and Jia,Xi-Ping and Zhu,Hong-Li}
}
@article {16068,
	title = {Interactive auditory data exploration: A framework and evaluation with geo-referenced data sonification},
	journal = {ACM Transactions on Computer-Human Interaction},
	year = {2008},
	month = {2008///},
	abstract = {We describe an Action-by-Design-Component (ADC) framework to guide auditory interface designers for exploratory data analysis. The framework characterizes data interaction in the auditory mode as a set of Auditory Information Seeking Actions (AISAs). Contrasting AISAs with actions in visualizations, the framework also discusses design considerations for a set of Design Components to support AISAs. Applying the framework to geo-referenced data, we systematically explored and evaluated its design space. A data exploration tool, iSonic, was built for blind users. In depth case studies with 7 blind users, with over 42 hours of data collection, showed that iSonic enabled them to find facts and discover trends of geo-referenced data, even in unfamiliar geographical contexts, without special devices. The results also showed that blind users dramatically benefited from the rich set of task-oriented actions (AISAs) and the use of multiple highly coordinated data views provided by the ADC framework. Some widely used techniques in visualization, with appropriate adaptation, also work in the auditory mode. The application of the framework to scatterplots shows that the framework can be generalized and lead to the design of a unified auditory workspace for general exploratory data analysis. Readers can view a supplementary video demonstration of iSonic by visiting www.cs.umd.edu/hcil/iSonic/},
	author = {Zhao,H. and Plaisant, Catherine and Shneiderman, Ben and Lazar,J.}
}
@conference {13581,
	title = {Learning Visual Shape Lexicon for Document Image Content Recognition},
	booktitle = {The 10th European Conference on Computer Vision (ECCV 2008)},
	year = {2008},
	month = {2008///},
	pages = {745 - 758},
	address = {Marseille, France},
	abstract = {Developing effective content recognition methods for diverse imagery continues to challenge computer vision researchers. We present a new approach for document image content categorization using a lexicon of shape features. Each lexical word corresponds to a scale and rotation invariant shape feature that is generic enough to be detected repeatably and segmentation free. We learn a concise, structurally indexed shape lexicon from training by clustering and partitioning feature types through graph cuts. We demonstrate our approach on two challenging document image content recognition problems: 1) The classification of 4,500 Web images crawled from Google Image Search into three content categories {\textemdash} pure image, image with text, and document image, and 2) Language identification of 8 languages (Arabic, Chinese, English, Hindi, Japanese, Korean, Russian, and Thai) on a 1,512 complex document image database composed of mixed machine printed text and handwriting. Our approach is capable to handle high intra-class variability and shows results that exceed other state-of-the-art approaches, allowing it to be used as a content recognizer in image indexing and retrieval systems.},
	author = {Zhu,Guangyu and Yu,Xiaodong and Li,Yi and David Doermann}
}
@article {13833,
	title = {Multiple alternative sentence compressions and word-pair antonymy for automatic text summarization and recognizing textual entailment},
	journal = {Proceedings of the Text Analysis Conference (TAC-2008), Gaithersburg, MD},
	year = {2008},
	month = {2008///},
	abstract = {The University of Maryland participatedin three tasks organized by the Text Anal-
ysis Conference 2008 (TAC 2008): (1)
the update task of text summarization;
(2) the opinion task of text summariza-
tion; and (3) recognizing textual entail-
ment (RTE). At the heart of our summa-
rization system is Trimmer, which gener-
ates multiple alternative compressed ver-
sions of the source sentences that act as
candidate sentences for inclusion in the
summary. For the first time, we investi-
gated the use of automatically generated
antonym pairs for both text summariza-
tion and recognizing textual entailment.
We used an antonymy feature in both the
opinion summarization task and for rec-
ognizing textual entailment. More coher-
ent summaries resulted when using the
antonymy feature as compared to when
not using it. However, performance on
ROUGE dropped. The RTE system per-
formed almost equally well when using
antonyms from WordNet and when using
automatically generated antonyms.
},
	author = {Mohammad,S. and Dorr, Bonnie J and Egan,M. and Jimmy Lin and Zajic, David}
}
@conference {14450,
	title = {Preserving the privacy of sensitive relationships in graph data},
	booktitle = {Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD},
	series = {PinKDD{\textquoteright}07},
	year = {2008},
	month = {2008///},
	pages = {153 - 171},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Berlin, Heidelberg},
	abstract = {In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships from anonymized graph data as link reidentification. We propose five different privacy preservation strategies, which vary in terms of the amount of data removed (and hence their utility) and the amount of privacy preserved. We assume the adversary has an accurate predictive model for links, and we show experimentally the success of different link re-identification strategies under varying structural characteristics of the data.},
	keywords = {anonymization, graph data, identification, link mining, noisy-or, privacy, social network analysis},
	isbn = {3-540-78477-2, 978-3-540-78477-7},
	url = {http://dl.acm.org/citation.cfm?id=1793474.1793485},
	author = {Zheleva,Elena and Getoor, Lise}
}
@article {13016,
	title = {Resolving arthropod phylogeny: exploring phylogenetic signal within 41 kb of protein-coding nuclear gene sequence},
	journal = {Syst Biol},
	volume = {57},
	year = {2008},
	month = {2008/12//},
	pages = {920 - 938},
	abstract = {This study attempts to resolve relationships among and within the four basal arthropod lineages (Pancrustacea, Myriapoda, Euchelicerata, Pycnogonida) and to assess the widespread expectation that remaining phylogenetic problems will yield to increasing amounts of sequence data. Sixty-eight regions of 62 protein-coding nuclear genes (approximately 41 kilobases (kb)/taxon) were sequenced for 12 taxonomically diverse arthropod taxa and a tardigrade outgroup. Parsimony, likelihood, and Bayesian analyses of total nucleotide data generally strongly supported the monophyly of each of the basal lineages represented by more than one species. Other relationships within the Arthropoda were also supported, with support levels depending on method of analysis and inclusion/exclusion of synonymous changes. Removing third codon positions, where the assumption of base compositional homogeneity was rejected, altered the results. Removing the final class of synonymous mutations{\textendash}first codon positions encoding leucine and arginine, which were also compositionally heterogeneous{\textendash}yielded a data set that was consistent with a hypothesis of base compositional homogeneity. Furthermore, under such a data-exclusion regime, all 68 gene regions individually were consistent with base compositional homogeneity. Restricting likelihood analyses to nonsynonymous change recovered trees with strong support for the basal lineages but not for other groups that were variably supported with more inclusive data sets. In a further effort to increase phylogenetic signal, three types of data exploration were undertaken. (1) Individual genes were ranked by their average rate of nonsynonymous change, and three rate categories were assigned{\textendash}fast, intermediate, and slow. Then, bootstrap analysis of each gene was performed separately to see which taxonomic groups received strong support. Five taxonomic groups were strongly supported independently by two or more genes, and these genes mostly belonged to the slow or intermediate categories, whereas groups supported only by a single gene region tended to be from genes of the fast category, arguing that fast genes provide a less consistent signal. (2) A sensitivity analysis was performed in which increasing numbers of genes were excluded, beginning with the fastest. The number of strongly supported nodes increased up to a point and then decreased slightly. Recovery of Hexapoda required removal of fast genes. Support for Mandibulata (Pancrustacea + Myriapoda) also increased, at times to "strong" levels, with removal of the fastest genes. (3) Concordance selection was evaluated by clustering genes according to their ability to recover Pancrustacea, Euchelicerata, or Myriapoda and analyzing the three clusters separately. All clusters of genes recovered the three concordance clades but were at times inconsistent in the relationships recovered among and within these clades, a result that indicates that the a priori concordance criteria may bias phylogenetic signal in unexpected ways. In a further attempt to increase support of taxonomic relationships, sequence data from 49 additional taxa for three slow genes (i.e., EF-1 alpha, EF-2, and Pol II) were combined with the various 13-taxon data sets. The 62-taxon analyses supported the results of the 13-taxon analyses and provided increased support for additional pancrustacean clades found in an earlier analysis including only EF-1 alpha, EF-2, and Pol II.},
	doi = {10.1080/10635150802570791},
	author = {Regier,J. C and Shultz,J. W and Ganley,A. R.D and Hussey,A. and Shi,D. and Ball,B. and Zwick,A. and Stajich,J. E and Cummings, Michael P. and Martin,J. W and Cunningham,CW}
}
@article {16443,
	title = {SCALABLE CATALOG INFRASTRUCTURE FOR MANAGING ACCESS COSTS AND SOURCE SELECTION IN WIDE AREA NETWORKS},
	journal = {International Journal of Cooperative Information Systems},
	volume = {17},
	year = {2008},
	month = {2008///},
	pages = {77 - 109},
	author = {Zadorozhny,V. and Raschid, Louiqa and Gal,A.}
}
@article {13640,
	title = {Script-Independent Text Line Segmentation in Freestyle Handwritten Documents},
	journal = {IEEETransactions on Pattern Analysis and Machine Intelligence},
	year = {2008},
	month = {2008/08//},
	pages = {1313 - 1329},
	abstract = {Text line segmentation in freestyle handwritten documents remains an open document analysis problem. Curvilinear text lines and small gaps between neighboring text lines present a challenge to algorithms developed for machine printed or hand-printed documents. In this paper, we propose a novel approach based on density estimation and a state-of-the-art image segmentation technique, the level set method. From an input document image, we estimate a probability map, where each element represents the probability of the underlying pixel belonging to a text line. The level set method is then exploited to determine the boundary of neighboring text lines by evolving an initial estimate. Unlike connected component based methods ( [1] and [2] for example), the proposed algorithm does not use any script-specific knowledge. Extensive quantitative experiments on freestyle handwritten documents with diverse scripts, such as Arabic, Chinese, Korean, and Hindi in the University of Maryland Multilingual database, demonstrate that our algorithm consistently outperforms previous methods [1]{\textendash}[3]. Further experiments show the proposed algorithm is robust to scale change, rotation, and noise.},
	author = {Yi,L. and Zheng,Y. and David Doermann and Jaeger,S.}
}
@article {13120,
	title = {Sequential Kernel Density Approximation and Its Application to Real-Time Visual Tracking},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {30},
	year = {2008},
	month = {2008/07//},
	pages = {1186 - 1197},
	abstract = {Visual features are commonly modeled with probability density functions in computer vision problems, but current methods such as a mixture of Gaussians and kernel density estimation suffer from either the lack of flexibility by fixing or limiting the number of Gaussian components in the mixture or large memory requirement by maintaining a nonparametric representation of the density. These problems are aggravated in real-time computer vision applications since density functions are required to be updated as new data becomes available. We present a novel kernel density approximation technique based on the mean-shift mode finding algorithm and describe an efficient method to sequentially propagate the density modes over time. Although the proposed density representation is memory efficient, which is typical for mixture densities, it inherits the flexibility of nonparametric methods by allowing the number of components to be variable. The accuracy and compactness of the sequential kernel density approximation technique is illustrated by both simulations and experiments. Sequential kernel density approximation is applied to online target appearance modeling for visual tracking, and its performance is demonstrated on a variety of videos.},
	keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Statistical Distributions;Subtraction Technique;, Computer-Assisted;Models, Gaussian estimation;kernel density estimation;mean-shift mode finding algorithm;online target appearance modeling;probability density function;real-time computer vision application;real-time visual tracking;sequential kernel density approximation;visual f, Statistical;Motion;Pattern Recognition},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2007.70771},
	author = {Han,Bohyung and Comaniciu, D. and Zhu,Ying and Davis, Larry S.}
}
@conference {13646,
	title = {Signature-based Document Image Retrieval},
	booktitle = {The 10th European Conference on Computer Vision (ECCV 2008)},
	year = {2008},
	month = {2008///},
	pages = {752 - 765},
	address = {Marseille, France},
	abstract = {As the most pervasive method of individual identification and document authentication, signatures present convincing evidence and provide an important form of indexing for effective document image processing and retrieval in a broad range of applications. In this work, we developed a fully automatic signature-based document image retrieval system that handles: 1) Automatic detection and segmentation of signatures from document images and 2) Translation, scale, and rotation invariant signature matching for document image retrieval. We treat signature retrieval in the unconstrained setting of non-rigid shape matching and retrieval, and quantitatively study shape representations, shape matching algorithms, measures of dissimilarity, and the use of multiple query instances in document image retrieval. Extensive experiments using large real world collections of English and Arabic machine printed and handwritten documents demonstrate the excellent performance of our system. To the best of our knowledge, this is the first automatic retrieval system for general document images by using signatures as queries, without manual annotation of the image collection.},
	author = {Zhu,Guangyu and Yefeng Zheng and David Doermann}
}
@article {12911,
	title = {A simple binomial test for estimating sequencing errors in public repository 16S rRNA sequences},
	journal = {Journal of Microbiological Methods},
	volume = {72},
	year = {2008},
	month = {2008/02//},
	pages = {166 - 179},
	abstract = {Sequences in public databases may contain a number of sequencing errors. A double binomial model describing the distribution of indel-excluded similarity coefficients (S) among repeatedly sequenced 16S rRNA was previously developed and it produced a confidence interval of S useful for testing sequence identity among sequences of 400-bp length. We characterized patterns in sequencing errors found in nearly complete 16S rRNA sequences of Vibrionaceae as highly variable in reported sequence length and containing a small number of indels. To accommodate these characteristics, a simple binomial model for distribution of the similarity coefficient (H) that included indels was derived from the double binomial model for S. The model showed good fit to empirical data. By using either a pre-determined or bootstrapping estimated standard probability of base matching, we were able to use the exact binomial test to determine the relative level of sequencing error for a given pair of duplicated sequences. A limitation of the method is the requirement that duplicated sequences for the same template sequence be paired, but this can be overcome by using only conserved regions of 16S rRNA sequences and pairing a given sequence with its highest scoring BLAST search hit from the nr database of GenBank.},
	keywords = {16S rRNA, Binomial model, Sequence similarity coefficient, Sequencing error, SSU rRNA},
	isbn = {0167-7012},
	doi = {10.1016/j.mimet.2007.11.013},
	url = {http://www.sciencedirect.com/science/article/pii/S0167701207003910},
	author = {Zo,Young-Gun and Rita R Colwell}
}
@article {15292,
	title = {Single-document and multi-document summarization techniques for email threads using sentence compression},
	journal = {Information Processing \& Management},
	volume = {44},
	year = {2008},
	month = {2008/07//},
	pages = {1600 - 1610},
	abstract = {We present two approaches to email thread summarization: collective message summarization (CMS) applies a multi-document summarization approach, while individual message summarization (IMS) treats the problem as a sequence of single-document summarization tasks. Both approaches are implemented in our general framework driven by sentence compression. Instead of a purely extractive approach, we employ linguistic and statistical methods to generate multiple compressions, and then select from those candidates to produce a final summary. We demonstrate these ideas on the Enron email collection {\^a}{\texteuro}{\textquotedblleft} a very challenging corpus because of the highly technical language. Experimental results point to two findings: that CMS represents a better approach to email thread summarization, and that current sentence compression techniques do not improve summarization performance in this genre.},
	keywords = {Email summarization, Enron, Informal media, Sentence compression, Trimming},
	isbn = {0306-4573},
	doi = {10.1016/j.ipm.2007.09.007},
	url = {http://www.sciencedirect.com/science/article/pii/S0306457307001768},
	author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin}
}
@conference {18483,
	title = {Sound field decomposition using spherical microphone arrays},
	booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2008. ICASSP 2008},
	year = {2008},
	month = {2008///},
	pages = {277 - 280},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Spherical microphone arrays offer a number of attractive properties such as direction-independent acoustic behavior and ability to reconstruct the sound field in the vicinity of the array. Such ability is necessary in applications such as ambisonics and recreating auditory environment over headphones. We compare the performance of two scene reconstruction algorithms - one based on least-squares fitting the observed potentials and another based on computing the far-field signature function directly from the microphone measurements. A number of features important for the design and operation of spherical microphone arrays in real applications are revealed. Results indicate that it is possible to reconstruct the sound scene up to order p with p2 microphones.},
	keywords = {Acoustic applications, Acoustic arrays, Acoustic fields, acoustic position measurement, Acoustic propagation, acoustic signal processing, acoustic waves, array signal processing, Equations, far-field signature function, Layout, least-squares fitting, microphone arrays, scene reconstruction algorithms, Signal processing algorithms, sound field decomposition, spherical microphone arrays, Surface acoustic waves},
	isbn = {978-1-4244-1483-3},
	doi = {10.1109/ICASSP.2008.4517600},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.}
}
@article {13986,
	title = {Spherical microphone array based immersive audio scene rendering},
	journal = {Proc. ICAD},
	year = {2008},
	month = {2008///},
	abstract = {In many applications such as entertainment, education, mil-itary training, remote telepresence, surveillance, etc. it is
necessary to capture an acoustic field and present it to listen-
ers with a goal of creating the same acoustic perception for
them as if they were actually present at the scene. Currently,
there is much interest in the use of spherical microphone ar-
rays for acoustic scene capture and reproduction. We de-
scribe a 32-microphone spherical array based system im-
plemented for spatial audio capture and reproduction. Our
array embeds hardware that is traditionally external, such as
preamplifiers, filters, digital-to-analog converters, and USB
adaptor, resulting in a portable lightweight solution and re-
quiring no hardware on the PC side whatsoever other than a
high-speed USB port. We provide capability analysis of the
array and describe software suite developed for the applica-
tion.
},
	author = {O{\textquoteright}donovan,A.M. and Zotkin,Dmitry N and Duraiswami, Ramani}
}
@article {18484,
	title = {A spherical microphone array based system for immersive audio scene rendering},
	volume = {UMIACS-TR-2008-09},
	year = {2008},
	month = {2008/03/25/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {For many applications it is necessary to capture an acoustic field and present it for human listeners, creating the same acoustic perception for them as if they were actually present in the scene. Possible applications of this technique include entertainment, education, military training, remote telepresence, surveillance, and others. Recently, there is much interest on the use of spherical microphone arrays in acoustic scene capture and reproduction application. We describe a 32-microphone spherical array based system implemented for spatial audio capture and reproduction. The array embeds hardware that is traditionally external, such as preamplifiers, filters, digital-to-analog converters, and USB interface adapter, resulting in a portable lightweight solution and requiring no hardware on PC side whatsoever other than a high-speed USB port. We provide capability analysis of the array and describe software suite developed for the application.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu//handle/1903/7556},
	author = {O{\textquoteright}donovan,Adam and Zotkin,Dmitry N and Duraiswami, Ramani}
}
@conference {15062,
	title = {A topic-based Document Correlation Model},
	booktitle = {Machine Learning and Cybernetics, 2008 International Conference on},
	volume = {5},
	year = {2008},
	month = {2008/07//},
	pages = {2487 - 2491},
	abstract = {Document correlation analysis is now a focus of study in text mining. This paper proposed a Document Correlation Model to capture the correlation between documents from topic level. The model represents the document correlation as the Optimal Matching of a bipartite graph, of which each partition is a document, each node is a topic, and each edge is the similarity between two topics. The topics of each document are retrieved by the Latent Dirichlet Allocation model and Gibbs sampling. Experiments on correlated document search show that the Document Correlation Model outperforms the Vector Space Model on two aspects: 1) it has higher average retrieval precision; 2) it needs less space to store a documentpsilas information.},
	keywords = {bipartite graph optimal matching, data mining, document correlation analysis, document retrieval, Gibbs sampling, Information retrieval, latent Dirichlet allocation model, text analysis, text mining, topic-based document correlation model},
	doi = {10.1109/ICMLC.2008.4620826},
	author = {Jia,Xi-Ping and Peng,Hong and Zheng,Qi-Lun and Zhuolin Jiang and Li,Zhao}
}
@article {14367,
	title = {Trusting spam reporters: A reporter-based reputation system for email filtering},
	journal = {ACM Transactions on Information Systems (TOIS)},
	volume = {27},
	year = {2008},
	month = {2008/12//},
	pages = {3:1{\textendash}3:27 - 3:1{\textendash}3:27},
	abstract = {Spam is a growing problem; it interferes with valid email and burdens both email users and service providers. In this work, we propose a reactive spam-filtering system based on reporter reputation for use in conjunction with existing spam-filtering techniques. The system has a trust-maintenance component for users, based on their spam-reporting behavior. The challenge that we consider is that of maintaining a reliable system, not vulnerable to malicious users, that will provide early spam-campaign detection to reduce the costs incurred by users and systems. We report on the utility of a reputation system for spam filtering that makes use of the feedback of trustworthy users. We evaluate our proposed framework, using actual complaint feedback from a large population of users, and validate its spam-filtering performance on a collection of real email traffic over several weeks. To test the broader implication of the system, we create a model of the behavior of malicious reporters, and we simulate the system under various assumptions using a synthetic dataset.},
	keywords = {reputation systems, Spam filtering, trust},
	isbn = {1046-8188},
	doi = {10.1145/1416950.1416953},
	url = {http://doi.acm.org/10.1145/1416950.1416953},
	author = {Zheleva,Elena and Kolcz,Aleksander and Getoor, Lise}
}
@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}
}
@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}
}
@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 {15831,
	title = {Why Do Hubs in the Yeast Protein Interaction Network Tend To Be Essential: Reexamining the Connection between the Network Topology and Essentiality},
	journal = {PLoS Comput BiolPLoS Comput Biol},
	volume = {4},
	year = {2008},
	month = {2008///},
	pages = {e1000140 - e1000140},
	abstract = {Analysis of protein interaction networks in the budding yeast Saccharomyces cerevisiae has revealed that a small number of proteins, the so-called hubs, interact with a disproportionately large number of other proteins. Furthermore, many hub proteins have been shown to be essential for survival of the cell{\textemdash}that is, in optimal conditions, yeast cannot grow and multiply without them. This relation between essentiality and the number of neighbors in the protein{\textendash}protein interaction network has been termed the centrality-lethality rule. However, why are such hubs essential? Jeong and colleagues [1] suggested that overrepresentation of essential proteins among high-degree nodes can be attributed to the central role that hubs play in mediating interactions among numerous, less connected proteins. Another view, proposed by He and Zhang, suggested that that the majority of proteins are essential due to their involvement in one or more essential protein{\textendash}protein interactions that are distributed uniformly at random along the network edges [2]. We find that none of the above reasons determines essentiality. Instead, the majority of hubs are essential due to their involvement in Essential Complex Biological Modules, a group of densely connected proteins with shared biological function that are enriched in essential proteins. This study sheds new light on the topological complexity of protein interaction networks.},
	doi = {10.1371/journal.pcbi.1000140},
	url = {http://dx.doi.org/10.1371/journal.pcbi.1000140},
	author = {Zotenko,Elena and Mestre,Julian and O{\textquoteright}Leary, Dianne P. and Przytycka,Teresa M.}
}
@article {14894,
	title = {Appearance Characterization of Linear Lambertian Objects, Generalized Photometric Stereo, and Illumination-Invariant Face Recognition},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {29},
	year = {2007},
	month = {2007/02//},
	pages = {230 - 245},
	abstract = {Traditional photometric stereo algorithms employ a Lambertian reflectance model with a varying albedo field and involve the appearance of only one object. In this paper, we generalize photometric stereo algorithms to handle all appearances of all objects in a class, in particular the human face class, by making use of the linear Lambertian property. A linear Lambertian object is one which is linearly spanned by a set of basis objects and has a Lambertian surface. The linear property leads to a rank constraint and, consequently, a factorization of an observation matrix that consists of exemplar images of different objects (e.g., faces of different subjects) under different, unknown illuminations. Integrability and symmetry constraints are used to fully recover the subspace bases using a novel linearized algorithm that takes the varying albedo field into account. The effectiveness of the linear Lambertian property is further investigated by using it for the problem of illumination-invariant face recognition using just one image. Attached shadows are incorporated in the model by a careful treatment of the inherent nonlinearity in Lambert{\textquoteright}s law. This enables us to extend our algorithm to perform face recognition in the presence of multiple illumination sources. Experimental results using standard data sets are presented},
	keywords = {albedo field;appearance characterization;generalized photometric stereo algorithms;illumination-invariant face recognition;linear Lambertian objects;observation matrix factorization;face recognition;matrix decomposition;Algorithms;Artificial Intelligence;, Automated;Photogrammetry;Reproducibility of Results;Sensitivity and Specificity;, Computer-Assisted;Information Storage and Retrieval;Lighting;Linear Models;Pattern Recognition},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2007.25},
	author = {Zhou,S. K and Aggarwal,G. and Chellapa, Rama and Jacobs, David W.}
}
@conference {13506,
	title = {Automatic Document Logo Detection},
	booktitle = {The 9th International Conference on Document Analysis and Recognition (ICDAR 2007)},
	year = {2007},
	month = {2007///},
	pages = {864 - 868},
	address = {Curitiba, Brazil},
	abstract = {Automatic logo detection and recognition continues to be of great interest to the document retrieval community as it enables effective identification of the source of a document. In this paper, we propose a new approach to logo detection and extraction in document images that robustly classifiesand precisely localizes logos using a boosting strategy across multiple image scales. At a coarse scale, a trained Fisher classifier performs initial classification using features from document context and connected components. Each logo candidate region is further classified at successively finer scales by a cascade of simple classifiers, which allows false alarms to be discarded and the detected region to be refined. Our approach is segmentation free and layout independent. We define a meaningful evaluation metric to measure the quality of logo detection using labeled groundtruth. We demonstrate the effectiveness of our approach using a large collection of real-world documents.},
	author = {Zhu,Guangyu and David Doermann}
}
@article {14103,
	title = {Cofactor-independent phosphoglycerate mutase is an essential gene in procyclic form Trypanosoma brucei},
	journal = {Parasitology research},
	volume = {100},
	year = {2007},
	month = {2007///},
	pages = {887 - 892},
	author = {Djikeng,A. and Raverdy,S. and Foster, Jeffrey S. and Bartholomeu,D. and Zhang,Y. and El-Sayed, Najib M. and Carlow,C.}
}
@article {14600,
	title = {COMPUTATIONAL BIOLOGY},
	journal = {Nucleic acids research},
	volume = {35},
	year = {2007},
	month = {2007///},
	pages = {3163 - 3163},
	author = {Leparc,GG and Mitra,RD and Vardhanabhuti,S. and Wang,J. and Hannenhalli, Sridhar and Smit,S. and Widmann,J. and Knight,R. and Wu,S. and Zhang,Y. and others}
}
@conference {15308,
	title = {Deconstructing nuggets: the stability and reliability of complex question answering evaluation},
	booktitle = {Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval},
	series = {SIGIR {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {327 - 334},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {A methodology based on "information nuggets" has recently emerged as the de facto standard by which answers to complex questions are evaluated. After several implementations in the TREC question answering tracks, the community has gained a better understanding of its many characteristics. This paper focuses on one particular aspect of the evaluation: the human assignment of nuggets to answer strings, which serves as the basis of the F-score computation. As a byproduct of the TREC 2006 ciQA task, identical answer strings were independently evaluated twice, which allowed us to assess the consistency of human judgments. Based on these results, we explored simulations of assessor behavior that provide a method to quantify scoring variations. Understanding these variations in turn lets researchers be more confident in their comparisons of systems.},
	keywords = {complex information needs, human judgments, trec},
	isbn = {978-1-59593-597-7},
	doi = {10.1145/1277741.1277799},
	url = {http://doi.acm.org/10.1145/1277741.1277799},
	author = {Jimmy Lin and Zhang,Pengyi}
}
@conference {16079,
	title = {Discovering interesting usage patterns in text collections: integrating text mining with visualization},
	booktitle = {Proceedings of the sixteenth ACM conference on Conference on information and knowledge management},
	series = {CIKM {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {213 - 222},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper addresses the problem of making text mining results more comprehensible to humanities scholars, journalists, intelligence analysts, and other researchers, in order to support the analysis of text collections. Our system, FeatureLens1, visualizes a text collection at several levels of granularity and enables users to explore interesting text patterns. The current implementation focuses on frequent itemsets of n-grams, as they capture the repetition of exact or similar expressions in the collection. Users can find meaningful co-occurrences of text patterns by visualizing them within and across documents in the collection. This also permits users to identify the temporal evolution of usage such as increasing, decreasing or sudden appearance of text patterns. The interface could be used to explore other text features as well. Initial studies suggest that FeatureLens helped a literary scholar and 8 users generate new hypotheses and interesting insights using 2 text collections.},
	keywords = {digital humanities, frequent closed itemsets, n-grams, text mining, user interface},
	isbn = {978-1-59593-803-9},
	doi = {10.1145/1321440.1321473},
	url = {http://doi.acm.org/10.1145/1321440.1321473},
	author = {Don,Anthony and Zheleva,Elena and Gregory,Machon and Tarkan,Sureyya and Auvil,Loretta and Clement,Tanya and Shneiderman, Ben and Plaisant, Catherine}
}
@article {16257,
	title = {Draft Genome of the Filarial Nematode Parasite Brugia Malayi},
	journal = {Science},
	volume = {317},
	year = {2007},
	month = {2007/09/21/},
	pages = {1756 - 1760},
	abstract = {Parasitic nematodes that cause elephantiasis and river blindness threaten hundreds of millions of people in the developing world. We have sequenced the \~{}90 megabase (Mb) genome of the human filarial parasite Brugia malayi and predict \~{}11,500 protein coding genes in 71 Mb of robustly assembled sequence. Comparative analysis with the free-living, model nematode Caenorhabditis elegans revealed that, despite these genes having maintained little conservation of local synteny during \~{}350 million years of evolution, they largely remain in linkage on chromosomal units. More than 100 conserved operons were identified. Analysis of the predicted proteome provides evidence for adaptations of B. malayi to niches in its human and vector hosts and insights into the molecular basis of a mutualistic relationship with its Wolbachia endosymbiont. These findings offer a foundation for rational drug design.},
	isbn = {0036-8075, 1095-9203},
	doi = {10.1126/science.1145406},
	url = {http://www.sciencemag.org/content/317/5845/1756},
	author = {Ghedin,Elodie and Wang,Shiliang and Spiro,David and Caler,Elisabet and Zhao,Qi and Crabtree,Jonathan and Allen,Jonathan E and Delcher,Arthur L. and Guiliano,David B and Miranda-Saavedra,Diego and Angiuoli,Samuel V and Creasy,Todd and Amedeo,Paolo and Haas,Brian and El-Sayed, Najib M. and Wortman,Jennifer R. and Feldblyum,Tamara and Tallon,Luke and Schatz,Michael and Shumway,Martin and Koo,Hean and Salzberg,Steven L. and Schobel,Seth and Pertea,Mihaela and Pop, Mihai and White,Owen and Barton,Geoffrey J and Carlow,Clotilde K. S and Crawford,Michael J and Daub,Jennifer and Dimmic,Matthew W and Estes,Chris F and Foster,Jeremy M and Ganatra,Mehul and Gregory,William F and Johnson,Nicholas M and Jin,Jinming and Komuniecki,Richard and Korf,Ian and Kumar,Sanjay and Laney,Sandra and Li,Ben-Wen and Li,Wen and Lindblom,Tim H and Lustigman,Sara and Ma,Dong and Maina,Claude V and Martin,David M. A and McCarter,James P and McReynolds,Larry and Mitreva,Makedonka and Nutman,Thomas B and Parkinson,John and Peregr{\'\i}n-Alvarez,Jos{\'e} M and Poole,Catherine and Ren,Qinghu and Saunders,Lori and Sluder,Ann E and Smith,Katherine and Stanke,Mario and Unnasch,Thomas R and Ware,Jenna and Wei,Aguan D and Weil,Gary and Williams,Deryck J and Zhang,Yinhua and Williams,Steven A and Fraser-Liggett,Claire and Slatko,Barton and Blaxter,Mark L and Scott,Alan L}
}
@conference {14516,
	title = {Efficient Conversion of X.Y Surround Sound Content to Binaural Head-Tracked Form for HRTF-Enabled Playback},
	booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007},
	volume = {1},
	year = {2007},
	month = {2007/04//},
	pages = {I-21-I-24 - I-21-I-24},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Binaural presentation of X.Y sound is usually performed using virtual audio principles - that is, by attempting to virtually reproduce the setup of the X+Y loudspeakers in the reference room configuration. The computational cost of such playback is linear in the number of channels in the X.Y setup. We present a novel scheme that computes, offline, a spatio-temporal representation of the sound field in the listening area and store it as a multipole expansion. During head-tracked playback, the binaural signal is obtained by evaluating the multipole expansion at the ear position corresponding to the current user pose, resulting in a fixed playback cost. The representation is further extended to incorporate individualized HRTFs at no additional cost. Simulation results are presented.},
	keywords = {Acoustic fields, Acoustic scattering, acoustic signal processing, audio acoustics, Audio systems, binaural head-tracked, binaural presentation, Computational efficiency, Costs, Ear, head-related transfer function, Headphones, HRTF-enabled playback, Loudspeakers, Music, reverberation, sound field, spatio-temporal representation, surround sound, surround sound content, Transfer functions, virtual audio principles},
	isbn = {1-4244-0727-3},
	doi = {10.1109/ICASSP.2007.366606},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.}
}
@article {12130,
	title = {Empirical studies to build a science of computer science},
	journal = {Communications of the ACM},
	volume = {50},
	year = {2007},
	month = {2007/11//},
	pages = {33 - 37},
	abstract = {We learn to develop software by building, testing, and evolving models.},
	isbn = {0001-0782},
	doi = {10.1145/1297797.1297819},
	url = {http://doi.acm.org/10.1145/1297797.1297819},
	author = {Basili, Victor R. and Zelkowitz, Marvin V}
}
@article {12118,
	title = {An Environment of Conducting Families of Software Engineering Experiments},
	year = {2007},
	month = {2007/05//},
	institution = {University of Maryland, College Park},
	abstract = {The classroom is a valuable resource for conducting software engineering experiments. However, coordinating a family of experiments in classroom environments presents a number of challenges to researchers. This paper describes an environment that simplifies the process of collecting, managing and sanitizing data from classroom experiments, while minimizing disruption to natural subject behavior. We have successfully used this environment to study the impact of parallel programming languages on programmer productivity at multiple universities across the United States.},
	keywords = {collecting data, managing data, parallel programming languages, sanitizing data, software engineering experiments, universities},
	url = {http://drum.lib.umd.edu/handle/1903/7545},
	author = {Hochstein, Lorin and Nakamura,Taiga and Shull, Forrest and Zazworka, Nico and Voelp,Martin and Zelkowitz, Marvin V and Basili, Victor R.}
}
@article {16261,
	title = {Evolution of genes and genomes on the Drosophila phylogeny},
	journal = {Nature},
	volume = {450},
	year = {2007},
	month = {2007/11/08/},
	pages = {203 - 218},
	abstract = {Comparative analysis of multiple genomes in a phylogenetic framework dramatically improves the precision and sensitivity of evolutionary inference, producing more robust results than single-genome analyses can provide. The genomes of 12 Drosophila species, ten of which are presented here for the first time (sechellia, simulans, yakuba, erecta, ananassae, persimilis, willistoni, mojavensis, virilis and grimshawi), illustrate how rates and patterns of sequence divergence across taxa can illuminate evolutionary processes on a genomic scale. These genome sequences augment the formidable genetic tools that have made Drosophila melanogaster a pre-eminent model for animal genetics, and will further catalyse fundamental research on mechanisms of development, cell biology, genetics, disease, neurobiology, behaviour, physiology and evolution. Despite remarkable similarities among these Drosophila species, we identified many putatively non-neutral changes in protein-coding genes, non-coding RNA genes, and cis-regulatory regions. These may prove to underlie differences in the ecology and behaviour of these diverse species.},
	isbn = {0028-0836},
	doi = {10.1038/nature06341},
	url = {http://www.nature.com/nature/journal/v450/n7167/full/nature06341.html},
	author = {Clark,Andrew G. and Eisen,Michael B. and Smith,Douglas R. and Bergman,Casey M. and Oliver,Brian and Markow,Therese A. and Kaufman,Thomas C. and Kellis,Manolis and Gelbart,William and Iyer,Venky N. and Pollard,Daniel A. and Sackton,Timothy B. and Larracuente,Amanda M. and Singh,Nadia D. and Abad,Jose P. and Abt,Dawn N. and Adryan,Boris and Aguade,Montserrat and Akashi,Hiroshi and Anderson,Wyatt W. and Aquadro,Charles F. and Ardell,David H. and Arguello,Roman and Artieri,Carlo G. and Barbash,Daniel A. and Barker,Daniel and Barsanti,Paolo and Batterham,Phil and Batzoglou,Serafim and Begun,Dave and Bhutkar,Arjun and Blanco,Enrico and Bosak,Stephanie A. and Bradley,Robert K. and Brand,Adrianne D. and Brent,Michael R. and Brooks,Angela N. and Brown,Randall H. and Butlin,Roger K. and Caggese,Corrado and Calvi,Brian R. and Carvalho,A. Bernardo de and Caspi,Anat and Castrezana,Sergio and Celniker,Susan E. and Chang,Jean L. and Chapple,Charles and Chatterji,Sourav and Chinwalla,Asif and Civetta,Alberto and Clifton,Sandra W. and Comeron,Josep M. and Costello,James C. and Coyne,Jerry A. and Daub,Jennifer and David,Robert G. and Delcher,Arthur L. and Delehaunty,Kim and Do,Chuong B. and Ebling,Heather and Edwards,Kevin and Eickbush,Thomas and Evans,Jay D. and Filipski,Alan and Findei|[szlig]|,Sven and Freyhult,Eva and Fulton,Lucinda and Fulton,Robert and Garcia,Ana C. L. and Gardiner,Anastasia and Garfield,David A. and Garvin,Barry E. and Gibson,Greg and Gilbert,Don and Gnerre,Sante and Godfrey,Jennifer and Good,Robert and Gotea,Valer and Gravely,Brenton and Greenberg,Anthony J. and Griffiths-Jones,Sam and Gross,Samuel and Guigo,Roderic and Gustafson,Erik A. and Haerty,Wilfried and Hahn,Matthew W. and Halligan,Daniel L. and Halpern,Aaron L. and Halter,Gillian M. and Han,Mira V. and Heger,Andreas and Hillier,LaDeana and Hinrichs,Angie S. and Holmes,Ian and Hoskins,Roger A. and Hubisz,Melissa J. and Hultmark,Dan and Huntley,Melanie A. and Jaffe,David B. and Jagadeeshan,Santosh and Jeck,William R. and Johnson,Justin and Jones,Corbin D. and Jordan,William C. and Karpen,Gary H. and Kataoka,Eiko and Keightley,Peter D. and Kheradpour,Pouya and Kirkness,Ewen F. and Koerich,Leonardo B. and Kristiansen,Karsten and Kudrna,Dave and Kulathinal,Rob J. and Kumar,Sudhir and Kwok,Roberta and Lander,Eric and Langley,Charles H. and Lapoint,Richard and Lazzaro,Brian P. and Lee,So-Jeong and Levesque,Lisa and Li,Ruiqiang and Lin,Chiao-Feng and Lin,Michael F. and Lindblad-Toh,Kerstin and Llopart,Ana and Long,Manyuan and Low,Lloyd and Lozovsky,Elena and Lu,Jian and Luo,Meizhong and Machado,Carlos A. and Makalowski,Wojciech and Marzo,Mar and Matsuda,Muneo and Matzkin,Luciano and McAllister,Bryant and McBride,Carolyn S. and McKernan,Brendan and McKernan,Kevin and Mendez-Lago,Maria and Minx,Patrick and Mollenhauer,Michael U. and Montooth,Kristi and Mount, Stephen M. and Mu,Xu and Myers,Eugene and Negre,Barbara and Newfeld,Stuart and Nielsen,Rasmus and Noor,Mohamed A. F. and O{\textquoteright}Grady,Patrick and Pachter,Lior and Papaceit,Montserrat and Parisi,Matthew J. and Parisi,Michael and Parts,Leopold and Pedersen,Jakob S. and Pesole,Graziano and Phillippy,Adam M and Ponting,Chris P. and Pop, Mihai and Porcelli,Damiano and Powell,Jeffrey R. and Prohaska,Sonja and Pruitt,Kim and Puig,Marta and Quesneville,Hadi and Ram,Kristipati Ravi and Rand,David and Rasmussen,Matthew D. and Reed,Laura K. and Reenan,Robert and Reily,Amy and Remington,Karin A. and Rieger,Tania T. and Ritchie,Michael G. and Robin,Charles and Rogers,Yu-Hui and Rohde,Claudia and Rozas,Julio and Rubenfield,Marc J. and Ruiz,Alfredo and Russo,Susan and Salzberg,Steven L. and Sanchez-Gracia,Alejandro and Saranga,David J. and Sato,Hajime and Schaeffer,Stephen W. and Schatz,Michael C and Schlenke,Todd and Schwartz,Russell and Segarra,Carmen and Singh,Rama S. and Sirot,Laura and Sirota,Marina and Sisneros,Nicholas B. and Smith,Chris D. and Smith,Temple F. and Spieth,John and Stage,Deborah E. and Stark,Alexander and Stephan,Wolfgang and Strausberg,Robert L. and Strempel,Sebastian and Sturgill,David and Sutton,Granger and Sutton,Granger G. and Tao,Wei and Teichmann,Sarah and Tobari,Yoshiko N. and Tomimura,Yoshihiko and Tsolas,Jason M. and Valente,Vera L. S. and Venter,Eli and Venter,J. Craig and Vicario,Saverio and Vieira,Filipe G. and Vilella,Albert J. and Villasante,Alfredo and Walenz,Brian and Wang,Jun and Wasserman,Marvin and Watts,Thomas and Wilson,Derek and Wilson,Richard K. and Wing,Rod A. and Wolfner,Mariana F. and Wong,Alex and Wong,Gane Ka-Shu and Wu,Chung-I and Wu,Gabriel and Yamamoto,Daisuke and Yang,Hsiao-Pei and Yang,Shiaw-Pyng and Yorke,James A. and Yoshida,Kiyohito and Zdobnov,Evgeny and Zhang,Peili and Zhang,Yu and Zimin,Aleksey V. and Baldwin,Jennifer and Abdouelleil,Amr and Abdulkadir,Jamal and Abebe,Adal and Abera,Brikti and Abreu,Justin and Acer,St Christophe and Aftuck,Lynne and Alexander,Allen and An,Peter and Anderson,Erica and Anderson,Scott and Arachi,Harindra and Azer,Marc and Bachantsang,Pasang and Barry,Andrew and Bayul,Tashi and Berlin,Aaron and Bessette,Daniel and Bloom,Toby and Blye,Jason and Boguslavskiy,Leonid and Bonnet,Claude and Boukhgalter,Boris and Bourzgui,Imane and Brown,Adam and Cahill,Patrick and Channer,Sheridon and Cheshatsang,Yama and Chuda,Lisa and Citroen,Mieke and Collymore,Alville and Cooke,Patrick and Costello,Maura and D{\textquoteright}Aco,Katie and Daza,Riza and Haan,Georgius De and DeGray,Stuart and DeMaso,Christina and Dhargay,Norbu and Dooley,Kimberly and Dooley,Erin and Doricent,Missole and Dorje,Passang and Dorjee,Kunsang and Dupes,Alan and Elong,Richard and Falk,Jill and Farina,Abderrahim and Faro,Susan and Ferguson,Diallo and Fisher,Sheila and Foley,Chelsea D. and Franke,Alicia and Friedrich,Dennis and Gadbois,Loryn and Gearin,Gary and Gearin,Christina R. and Giannoukos,Georgia and Goode,Tina and Graham,Joseph and Grandbois,Edward and Grewal,Sharleen and Gyaltsen,Kunsang and Hafez,Nabil and Hagos,Birhane and Hall,Jennifer and Henson,Charlotte and Hollinger,Andrew and Honan,Tracey and Huard,Monika D. and Hughes,Leanne and Hurhula,Brian and Husby,M Erii and Kamat,Asha and Kanga,Ben and Kashin,Seva and Khazanovich,Dmitry and Kisner,Peter and Lance,Krista and Lara,Marcia and Lee,William and Lennon,Niall and Letendre,Frances and LeVine,Rosie and Lipovsky,Alex and Liu,Xiaohong and Liu,Jinlei and Liu,Shangtao and Lokyitsang,Tashi and Lokyitsang,Yeshi and Lubonja,Rakela and Lui,Annie and MacDonald,Pen and Magnisalis,Vasilia and Maru,Kebede and Matthews,Charles and McCusker,William and McDonough,Susan and Mehta,Teena and Meldrim,James and Meneus,Louis and Mihai,Oana and Mihalev,Atanas and Mihova,Tanya and Mittelman,Rachel and Mlenga,Valentine and Montmayeur,Anna and Mulrain,Leonidas and Navidi,Adam and Naylor,Jerome and Negash,Tamrat and Nguyen,Thu and Nguyen,Nga and Nicol,Robert and Norbu,Choe and Norbu,Nyima and Novod,Nathaniel and O{\textquoteright}Neill,Barry and Osman,Sahal and Markiewicz,Eva and Oyono,Otero L. and Patti,Christopher and Phunkhang,Pema and Pierre,Fritz and Priest,Margaret and Raghuraman,Sujaa and Rege,Filip and Reyes,Rebecca and Rise,Cecil and Rogov,Peter and Ross,Keenan and Ryan,Elizabeth and Settipalli,Sampath and Shea,Terry and Sherpa,Ngawang and Shi,Lu and Shih,Diana and Sparrow,Todd and Spaulding,Jessica and Stalker,John and Stange-Thomann,Nicole and Stavropoulos,Sharon and Stone,Catherine and Strader,Christopher and Tesfaye,Senait and Thomson,Talene and Thoulutsang,Yama and Thoulutsang,Dawa and Topham,Kerri and Topping,Ira and Tsamla,Tsamla and Vassiliev,Helen and Vo,Andy and Wangchuk,Tsering and Wangdi,Tsering and Weiand,Michael and Wilkinson,Jane and Wilson,Adam and Yadav,Shailendra and Young,Geneva and Yu,Qing and Zembek,Lisa and Zhong,Danni and Zimmer,Andrew and Zwirko,Zac and Jaffe,David B. and Alvarez,Pablo and Brockman,Will and Butler,Jonathan and Chin,CheeWhye and Gnerre,Sante and Grabherr,Manfred and Kleber,Michael and Mauceli,Evan and MacCallum,Iain}
}
@article {12134,
	title = {Experimenting with software testbeds for evaluating new technologies},
	journal = {Empirical Software Engineering},
	volume = {12},
	year = {2007},
	month = {2007///},
	pages = {417 - 444},
	abstract = {The evolution of a new technology depends upon a good theoretical basis for developing the technology, as well as upon its experimental validation. In order to provide for this experimentation, we have investigated the creation of a software testbed and the feasibility of using the same testbed for experimenting with a broad set of technologies. The testbed is a set of programs, data, and supporting documentation that allows researchers to test their new technology on a standard software platform. An important component of this testbed is the Unified Model of Dependability (UMD), which was used to elicit dependability requirements for the testbed software. With a collection of seeded faults and known issues of the target system, we are able to determine if a new technology is adept at uncovering defects or providing other aids proposed by its developers. In this paper, we present the Tactical Separation Assisted Flight Environment (TSAFE) testbed environment for which we modeled and evaluated dependability requirements and defined faults to be seeded for experimentation. We describe two completed experiments that we conducted on the testbed. The first experiment studies a technology that identifies architectural violations and evaluates its ability to detect the violations. The second experiment studies model checking as part of design for verification. We conclude by describing ongoing experimental work studying testing, using the same testbed. Our conclusion is that even though these three experiments are very different in terms of the studied technology, using and re-using the same testbed is beneficial and cost effective.},
	doi = {10.1007/s10664-006-9034-0},
	author = {Lindvall,M. and Rus,I. and Donzelli,P. and Memon, Atif M. and Zelkowitz, Marvin V and Betin-Can,A. and Bultan,T. and Ackermann,C. and Anders,B. and Asgari, S. and Basili, Victor R.}
}
@article {12599,
	title = {Face and Gesture Recognition-Appearance Characterization of Linear Lambertian Objects, Generalized Photometric Stereo, and Illumination-Invariant Face Recognition},
	journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
	volume = {29},
	year = {2007},
	month = {2007///},
	pages = {230 - 245},
	author = {Zhou,S. K and Aggarwal,G. and Chellapa, Rama and Jacobs, David W.}
}
@article {13996,
	title = {Fast Evaluation of the Room Transfer Function Using Multipole Expansion},
	journal = {Audio, Speech, and Language Processing, IEEE Transactions on},
	volume = {15},
	year = {2007},
	month = {2007/02//},
	pages = {565 - 576},
	abstract = {Reverberation in rooms is often simulated with the image method due to Allen and Berkley (1979). This method has an asymptotic complexity that is cubic in terms of the simulated reverberation length. When employed in the frequency domain, it is relatively computationally expensive if there are many receivers in the room or if the source or receiver positions are changing with time. The computational complexity of the image method is due to the repeated summation of the fields generated by a large number of image sources. In this paper, a fast method to perform such summations is presented. The method is based on multipole expansion of the monopole source potential. For offline computation of the room transfer function for N image sources and M receiver points, use of the Allen-Berkley algorithm requires O(NM) operations, whereas use of the proposed method requires only O(N+M) operations, resulting in significantly faster computation of reverberant sound fields. The proposed method also has a considerable speed advantage in situations where the room transfer function must be rapidly updated online in response to source/receiver location changes. Simulation results are presented, and algorithm accuracy, speed, and implementation details are discussed. For problems that require frequency-domain computations, the algorithm is found to generate sound fields identical to the ones obtained with the frequency-domain version of the Allen-Berkley algorithm at a fraction of computational cost},
	keywords = {acoustics;computational, algorithm;frequency-domain, Alien-Berkley, analysis;reverberation;, complexity;frequency-domain, computations;image, expansion;receivers;reverberant, field;architectural, fields;reverberation;room, function;acoustic, method;image, potential;multipole, sound, source, sources;monopole, transfer},
	isbn = {1558-7916},
	doi = {10.1109/TASL.2006.876753},
	author = {Duraiswami, Ramani and Zotkin,Dmitry N and Gumerov, Nail A.}
}
@conference {18458,
	title = {Fast Multipole Accelerated Boundary Elements for Numerical Computation of the Head Related Transfer Function},
	booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007},
	volume = {1},
	year = {2007},
	month = {2007/04//},
	pages = {I-165-I-168 - I-165-I-168},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The numerical computation of head related transfer functions has been attempted by a number of researchers. However, the cost of the computations has meant that usually only low frequencies can be computed and further the computations take inordinately long times. Because of this, comparisons of the computations with measurements are also difficult. We present a fast multipole based iterative preconditioned Krylov solution of a boundary element formulation of the problem and use a new formulation that enables the reciprocity technique to be accurately employed. This allows the calculation to proceed for higher frequencies and larger discretizations. Preliminary results of the computations and of comparisons with measured HRTFs are presented.},
	keywords = {Acceleration, Acoustic measurements, Acoustic scattering, audio signal processing, boundary element formulation, Boundary element method, Boundary element methods, boundary-elements methods, Costs, Ear, Fast Multipole Method, Frequency, Head related transfer function, HUMANS, Irrigation, iterative methods, multipole accelerated boundary elements, multipole based iterative preconditioned Krylov solution, numerical computation, Reciprocity, Transfer functions},
	isbn = {1-4244-0727-3},
	doi = {10.1109/ICASSP.2007.366642},
	author = {Gumerov, Nail A. and Duraiswami, Ramani and Zotkin,Dmitry N}
}
@article {14581,
	title = {GATA and Nkx factors synergistically regulate tissue-specific gene expression and development in vivo},
	journal = {Development},
	volume = {134},
	year = {2007},
	month = {2007/01/01/},
	pages = {189 - 198},
	abstract = {In vitro studies have suggested that members of the GATA and Nkx transcription factor families physically interact, and synergistically activate pulmonary epithelial- and cardiac-gene promoters. However, the relevance of this synergy has not been demonstrated in vivo. We show that Gata6-Titf1 (Gata6-Nkx2.1) double heterozygous (G6-Nkx DH) embryos and mice have severe defects in pulmonary epithelial differentiation and distal airway development, as well as reduced phospholipid production. The defects in G6-Nkx DH embryos and mice are similar to those observed in human neonates with respiratory distress syndromes, including bronchopulmonary dysplasia, and differential gene expression analysis reveals essential developmental pathways requiring synergistic regulation by both Gata6 and Titf1 (Nkx2.1). These studies indicate that Gata6 and Nkx2.1 act in a synergistic manner to direct pulmonary epithelial differentiation and development in vivo, providing direct evidence that interactions between these two transcription factor families are crucial for the development of the tissues in which they are co-expressed.},
	doi = {10.1242/dev.02720},
	url = {http://dev.biologists.org/content/134/1/189.abstract},
	author = {Zhang,Yuzhen and Rath,Nibedita and Hannenhalli, Sridhar and Wang,Zhishan and Cappola,Thomas and Kimura,Shioko and Atochina-Vasserman,Elena and Lu,Min Min and Beers,Michael F. and Morrisey,Edward E.}
}
@article {15279,
	title = {Genome Analysis Linking Recent European and African Influenza (H5N1) Viruses},
	journal = {Emerging Infectious DiseasesEmerg Infect Dis},
	volume = {13},
	year = {2007},
	month = {2007/05//},
	pages = {713 - 718},
	abstract = {Although linked, these viruses are distinct from earlier outbreak strains., To better understand the ecology and epidemiology of the highly pathogenic avian influenza virus in its transcontinental spread, we sequenced and analyzed the complete genomes of 36 recent influenza A (H5N1) viruses collected from birds in Europe, northern Africa, and southeastern Asia. These sequences, among the first complete genomes of influenza (H5N1) viruses outside Asia, clearly depict the lineages now infecting wild and domestic birds in Europe and Africa and show the relationships among these isolates and other strains affecting both birds and humans. The isolates fall into 3 distinct lineages, 1 of which contains all known non-Asian isolates. This new Euro-African lineage, which was the cause of several recent (2006) fatal human infections in Egypt and Iraq, has been introduced at least 3 times into the European-African region and has split into 3 distinct, independently evolving sublineages. One isolate provides evidence that 2 of these sublineages have recently reassorted.},
	isbn = {1080-6040},
	doi = {10.3201/eid1305.070013},
	author = {Salzberg,Steven L. and Kingsford, Carl and Cattoli,Giovanni and Spiro,David J. and Janies,Daniel A. and Aly,Mona Mehrez and Brown,Ian H. and Couacy-Hymann,Emmanuel and De Mia,Gian Mario and Dung,Do Huu and Guercio,Annalisa and Joannis,Tony and Ali,Ali Safar Maken and Osmani,Azizullah and Padalino,Iolanda and Saad,Magdi D. and Savi{\'c},Vladimir and Sengamalay,Naomi A. and Yingst,Samuel and Zaborsky,Jennifer and Zorman-Rojs,Olga and Ghedin,Elodie and Capua,Ilaria}
}
@conference {19637,
	title = {Geometry and Charge State of Mixed-Ligand Au13 Nanoclusters},
	booktitle = {X-RAY ABSORPTION FINE STRUCTURE - XAFS13: 13th International Conference},
	volume = {882},
	year = {2007},
	month = {2007/02/02/},
	pages = {749 - 751},
	publisher = {AIP Publishing},
	organization = {AIP Publishing},
	abstract = {The integration of synthetic, experimental and theoretical tools into a self-consistent data analysis methodology allowed us to develop unique new levels of detail in nanoparticle characterization. We describe our methods using an example of Au 13 monolayer-protected clusters (MPCs), synthesized by ligand exchange methods. The combination of atom counting methods of scanning transmission electron microscopy and Au L3-edge EXAFS allowed us to characterize these clusters as icosahedral, with surface strain reduced from 5\% (as in ideal, regular icosahedra) to 3\%, due to the interaction with ligands. Charge transfer from Au to the thiol and phosphine ligands was evidenced by S and P K-edge XANES. A comparison of total energies of bare clusters of different geometries was performed by equivalent crystal theory calculations.},
	keywords = {Atom surface interactions, Charge transfer, Data analysis, Extended X-ray absorption fine structure spectroscopy, Gold, nanoparticles, Scanning transmission electron microscopy, Surface strains, Total energy calculations, X-ray absorption near edge structure},
	url = {http://scitation.aip.org/content/aip/proceeding/aipcp/10.1063/1.2644652},
	author = {Frenkel, A. I. and Menard, L. D. and Northrup, P. and Rodriguez, J. A. and Zypman, F. and Dana Dachman-Soled and Gao, S.-P. and Xu, H. and Yang, J. C. and Nuzzo, R. G.}
}
@article {13831,
	title = {Multi-candidate reduction: Sentence compression as a tool for document summarization tasks},
	journal = {Information Processing \& Management},
	volume = {43},
	year = {2007},
	month = {2007/11//},
	pages = {1549 - 1570},
	abstract = {This article examines the application of two single-document sentence compression techniques to the problem of multi-document summarization{\textemdash}a {\textquotedblleft}parse-and-trim{\textquotedblright} approach and a statistical noisy-channel approach. We introduce the multi-candidate reduction (MCR) framework for multi-document summarization, in which many compressed candidates are generated for each source sentence. These candidates are then selected for inclusion in the final summary based on a combination of static and dynamic features. Evaluations demonstrate that sentence compression is a valuable component of a larger multi-document summarization framework.},
	keywords = {Headline generation, Hidden Markov model, Parse-and-trim, Summarization},
	isbn = {0306-4573},
	doi = {10.1016/j.ipm.2007.01.016},
	url = {http://www.sciencedirect.com/science/article/pii/S0306457307000295},
	author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Schwartz,Richard}
}
@conference {13145,
	title = {Multimodal Tracking for Smart Videoconferencing and Video Surveillance},
	booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on},
	year = {2007},
	month = {2007/06//},
	pages = {1 - 2},
	abstract = {Many applications require the ability to track the 3-D motion of the subjects. We build a particle filter based framework for multimodal tracking using multiple cameras and multiple microphone arrays. In order to calibrate the resulting system, we propose a method to determine the locations of all microphones using at least five loudspeakers and under assumption that for each loudspeaker there exists a microphone very close to it. We derive the maximum likelihood (ML) estimator, which reduces to the solution of the non-linear least squares problem. We verify the correctness and robustness of the multimodal tracker and of the self-calibration algorithm both with Monte-Carlo simulations and on real data from three experimental setups.},
	keywords = {(numerical, 3D, algorithm;smart, analysis;least, approximations;particle, arrays;nonlinear, cameras;multiple, Carlo, estimator;multimodal, filter;self-calibration, Filtering, least, likelihood, methods);teleconferencing;video, methods;image, microphone, MOTION, motion;Monte-Carlo, problem;particle, processing;video, signal, simulations;maximum, squares, surveillance;, surveillance;Monte, tracking;multiple, videoconferencing;video},
	doi = {10.1109/CVPR.2007.383525},
	author = {Zotkin,Dmitry N and Raykar,V.C. and Duraiswami, Ramani and Davis, Larry S.}
}
@article {13834,
	title = {Multiple alternative sentence compressions for automatic text summarization},
	journal = {Proceedings of DUC},
	year = {2007},
	month = {2007///},
	abstract = {We perform multi-document summariza-tion by generating compressed versions
of source sentences as summary candi-
dates and using weighted features of these
candidates to construct summaries. We
combine a parse-and-trim approach with
a novel technique for producing multiple
alternative compressions for source sen-
tences. In addition, we use a novel method
for tuning the feature weights that maxi-
mizes the change in the ROUGE-2 score
(∆ROUGE) between the already existing
summary state and the new state that re-
sults from the addition of the candidate
under consideration. We also describe ex-
periments using a new paraphrase-based
feature for redundancy checking. Finally,
we present the results of our DUC2007
submissions and some ideas for future
work.
},
	author = {Madnani,N. and Zajic, David and Dorr, Bonnie J and Ayan,N.F. and Jimmy Lin}
}
@inbook {13606,
	title = {Multi-scale Structural Saliency for Signature Detection},
	booktitle = {IEEEConference on Computer Vision and Pattern Recognition (CVPR 2007)IEEEConference on Computer Vision and Pattern Recognition (CVPR 2007)},
	year = {2007},
	month = {2007///},
	pages = {1 - 8},
	publisher = {Minneapolis, MN},
	organization = {Minneapolis, MN},
	abstract = {Detecting and segmenting free-form objects from cluttered backgrounds is a challenging problem in computer vision. Signature detection in document images is one classic example and as of yet no reasonable solutions have been presented. In this paper, we propose a novel multi-scale approach to jointly detecting and segmenting signatures from documents with diverse layouts and complex backgrounds. Rather than focusing on local features that typically have large variations, our approach aims to capture the structural saliency of a signature by searching over multiple scales. This detection framework is general and computationally tractable. We present a saliency measure based on a signature production model that effectively quantifies the dynamic curvature of 2-D contour fragments. Our evaluation using large real world collections of handwritten and machine printed documents demonstrates the effectiveness of this joint detection and segmentation approach.},
	author = {Zhu,Guangyu and Yefeng Zheng and David Doermann and Jaeger,Stefan}
}
@article {15392,
	title = {Numerical Analysis of Nanoparticle-Structured Plasmon Waveguides of Light},
	journal = {Magnetics, IEEE Transactions on},
	volume = {43},
	year = {2007},
	month = {2007/04//},
	pages = {1685 - 1688},
	abstract = {A novel numerical approach to the analysis of nanoparticle-structured plasmon waveguides of light is presented. The extinct cross-sections and resonance (propagation) frequencies are computed for various geometries of these waveguides and compared with available experimental data. The computational results for resonance frequencies corresponding to different light polarizations are reported as well},
	keywords = {analysis;optical, analysis;resonant, cross-sections;light, Frequency, frequency;light, nanoparticle-structured, plasmon, polarisation;light, polarization;numerical, propagation;numerical, waveguides;light, waveguides;plasmonics;plasmons;},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2006.892270},
	author = {Mayergoyz, Issak D and Zhang,Zhenyu}
}
@article {15394,
	title = {Numerical Analysis of Plasmon Resonances in Metallic Nanoshells},
	journal = {Magnetics, IEEE Transactions on},
	volume = {43},
	year = {2007},
	month = {2007/04//},
	pages = {1689 - 1692},
	abstract = {A novel boundary integral equation-based technique for the direct computations of resonance frequencies for plasmon resonances in metallic nanoshells is presented. In this technique, the calculation of resonance frequencies is reduced to a generalized eigenvalue problem. Numerical results that demonstrate fairly good agreement with theoretical results and available experimental data are reported},
	keywords = {analysis;plasmon, and, boundary, eigenfunctions;nanostructured, equation-based, equations;eigenvalues, frequency;boundary, integral, materials;nanotechnology;plasmons;, nanoshells;numerical, problems;metallic, resonance;resonant, techniques;eigenvalue},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2006.892271},
	author = {Mayergoyz, Issak D and Zhang,Zhenyu}
}
@article {13993,
	title = {Numerical Analysis of Plasmon Resonances in Nanoparticles Based on Fast Multipole Method},
	journal = {Magnetics, IEEE Transactions on},
	volume = {43},
	year = {2007},
	month = {2007/04//},
	pages = {1465 - 1468},
	abstract = {A novel technique for the numerical analysis of plasmon resonances by using the fast multipole method (FMM) is presented. This approach is based on the solution of the eigenvalue problem for boundary integral equations, which can be naturally implemented by using the FMM. Numerical examples that highlight the efficiency of the fast multipole implementation are reported},
	keywords = {analysis;boundary, and, boundary, eigenfunctions;nanoparticles;plasmons;, equations;eigenvalue, equations;eigenvalues, integral, method;nanoparticle, multipole, plasmon, problems;fast, resonance;numerical},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2007.891413},
	author = {Zhang,Zhenyu and Mayergoyz, Issak D and Gumerov, Nail A. and Duraiswami, Ramani}
}
@article {12352,
	title = {Parameterized Looped Schedules for Compact Representation of Execution Sequences in DSP Hardware and Software Implementation},
	journal = {IEEE Transactions on Signal Processing},
	volume = {55},
	year = {2007},
	month = {2007/06//},
	pages = {3126 - 3138},
	abstract = {In this paper, we present a technique for compact representation of execution sequences in terms of efficient looping constructs. Here, by a looping construct, we mean a compact way of specifying a finite repetition of a set of execution primitives. Such compaction, which can be viewed as a form of hierarchical run-length encoding (RLE), has application in many very large scale integration (VLSI) signal processing contexts, including efficient control generation for Kahn processes on field-programmable gate arrays (FPGAs), and software synthesis for static dataflow models of computation. In this paper, we significantly generalize previous models for loop-based code compaction of digital signal processing (DSP) programs to yield a configurable code compression methodology that exhibits a broad range of achievable tradeoffs. Specifically, we formally develop and apply to DSP hardware and software synthesis a parameterizable loop scheduling approach with compact format, dynamic reconfigurability, and low-overhead decompression},
	keywords = {Application software, array signal processing, code compression methodology, compact representation, Compaction, data compression, Design automation, Digital signal processing, digital signal processing chips, DSP, DSP hardware, embedded systems, Encoding, Field programmable gate arrays, field-programmable gate arrays (FPGAs), FPGA, Hardware, hierarchical runlength encoding, high-level synthesis, Kahn process, loop-based code compaction, looping construct, parameterized loop schedules, program compilers, reconfigurable design, runlength codes, scheduling, Signal generators, Signal processing, Signal synthesis, software engineering, software implementation, static dataflow models, Very large scale integration, VLSI},
	isbn = {1053-587X},
	doi = {10.1109/TSP.2007.893964},
	author = {Ming-Yung Ko and Zissulescu,C. and Puthenpurayil,S. and Bhattacharyya, Shuvra S. and Kienhuis,B. and Deprettere,E. F}
}
@article {13150,
	title = {Pedestrian detection via periodic motion analysis},
	journal = {International Journal of Computer Vision},
	volume = {71},
	year = {2007},
	month = {2007///},
	pages = {143 - 160},
	abstract = {We describe algorithms for detecting pedestrians in videos acquired by infrared (and color) sensors. Two approaches are proposed based on gait. The first employs computationally efficient periodicity measurements. Unlike other methods, it estimates a periodic motion frequency using two cascading hypothesis testing steps to filter out non-cyclic pixels so that it works well for both radial and lateral walking directions. The extraction of the period is efficient and robust with respect to sensor noise and cluttered background. In order to integrate shape and motion, we convert the cyclic pattern into a binary sequence by Maximal Principal Gait Angle (MPGA) fitting in the second method. It does not require alignment and continuously estimates the period using a Phase-locked Loop. Both methods are evaluated by experimental results that measure performance as a function of size, movement direction, frame rate and sequence length.},
	author = {Ran, Y. and Weiss, I. and Zheng,Q. and Davis, Larry S.}
}
@conference {14803,
	title = {Performance Measurement of Novice HPC Programmers Code},
	booktitle = {Proceedings of the 3rd International Workshop on Software Engineering for High Performance Computing Applications},
	series = {SE-HPC {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {3{\textendash} - 3{\textendash}},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	abstract = {Performance is one of the key factors of improving productivity in High Performance Computing (HPC). In this paper we discuss current studies in the field of performance measurement of codes captured in classroom experiments for the High Productivity Computing Project (HPCS). We give two examples of measurements introducing two new hypotheses: spending more effort doesn{\textquoteright}t always result in improvement of performance for novices; the use of higher level MPI functions promises better performance for novices. We also present a tool - the Automated Performance Measurement System (APMS). APMS helps to partially automate the measurement of the performance of a set of parallel programs with several inputs. The design and implementation of the tool is flexible enough to allow other researchers to conduct similar studies.},
	keywords = {measurement, performance, performance measures, product metrics, program analysis},
	isbn = {0-7695-2969-0},
	doi = {http://dx.doi.org/10.1109/SE-HPC.2007.4},
	url = {http://dx.doi.org/10.1109/SE-HPC.2007.4},
	author = {Alameh, Rola and Zazworka, Nico and Hollingsworth, Jeffrey K}
}
@article {12577,
	title = {Pose-Encoded Spherical Harmonics for Face Recognition and Synthesis Using a Single Image},
	journal = {EURASIP Journal on Advances in Signal Processing},
	volume = {2008},
	year = {2007},
	month = {2007/09/25/},
	pages = {748483 - 748483},
	abstract = {Face recognition under varying pose is a challenging problem, especially when illumination variations are also present. In this paper, we propose to address one of the most challenging scenarios in face recognition. That is, to identify a subject from a test image that is acquired under different pose and illumination condition from only one training sample (also known as a gallery image) of this subject in the database. For example, the test image could be semifrontal and illuminated by multiple lighting sources while the corresponding training image is frontal under a single lighting source. Under the assumption of Lambertian reflectance, the spherical harmonics representation has proved to be effective in modeling illumination variations for a fixed pose. In this paper, we extend the spherical harmonics representation to encode pose information. More specifically, we utilize the fact that 2D harmonic basis images at different poses are related by close-form linear transformations, and give a more convenient transformation matrix to be directly used for basis images. An immediate application is that we can easily synthesize a different view of a subject under arbitrary lighting conditions by changing the coefficients of the spherical harmonics representation. A more important result is an efficient face recognition method, based on the orthonormality of the linear transformations, for solving the above-mentioned challenging scenario. Thus, we directly project a nonfrontal view test image onto the space of frontal view harmonic basis images. The impact of some empirical factors due to the projection is embedded in a sparse warping matrix; for most cases, we show that the recognition performance does not deteriorate after warping the test image to the frontal view. Very good recognition results are obtained using this method for both synthetic and challenging real images.},
	isbn = {1687-6180},
	doi = {10.1155/2008/748483},
	url = {http://asp.eurasipjournals.com/content/2008/1/748483},
	author = {Yue,Zhanfeng and Zhao,Wenyi and Chellapa, Rama}
}
@inbook {18418,
	title = {Protocols in the use of empirical software engineering artifacts},
	booktitle = {Empirical Software EngineeringEmpirical Software Engineering},
	volume = {12},
	year = {2007},
	month = {2007///},
	pages = {107 - 119},
	publisher = {Springer},
	organization = {Springer},
	abstract = {If empirical software engineering is to grow as a valid scientific endeavor, the ability to acquire, use, share, and compare data collected from a variety of sources must be encouraged. This is necessary to validate the formal models being developed within computer science. However, within the empirical software engineering community this has not been easily accomplished. This paper analyses experiences from a number of projects, and defines the issues, which include the following: (1) How should data, testbeds, and artifacts be shared? (2) What limits should be placed on who can use them and how? How does one limit potential misuse? (3) What is the appropriate way to credit the organization and individual that spent the effort collecting the data, developing the testbed, and building the artifact? (4) Once shared, who owns the evolved asset? As a solution to these issues, the paper proposes a framework for an empirical software engineering artifact agreement. Such an agreement is intended to address the needs for both creator and user of such artifacts and should foster a market in making available and using such artifacts. If this framework for sharing software engineering artifacts is commonly accepted, it should encourage artifact owners to make the artifacts accessible to others (gaining credit is more likely and misuse is less likely). It may be easier for other researchers to request artifacts since there will be a well-defined protocol for how to deal with relevant matters.},
	author = {Basili, Victor R. and Zelkowitz, Marvin V and Sj{\o}berg,D. I.K and Johnson,P. and Cowling,A. J}
}
@conference {12574,
	title = {Robust Visual Tracking Using the Time-Reversibility Constraint},
	booktitle = {Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on},
	year = {2007},
	month = {2007/10//},
	pages = {1 - 8},
	abstract = {Visual tracking is a very important front-end to many vision applications. We present a new framework for robust visual tracking in this paper. Instead of just looking forward in the time domain, we incorporate both forward and backward processing of video frames using a novel time-reversibility constraint. This leads to a new minimization criterion that combines the forward and backward similarity functions and the distances of the state vectors between the forward and backward states of the tracker. The new framework reduces the possibility of the tracker getting stuck in local minima and significantly improves the tracking robustness and accuracy. Our approach is general enough to be incorporated into most of the current tracking algorithms. We illustrate the improvements due to the proposed approach for the popular KLT tracker and a search based tracker. The experimental results show that the improved KLT tracker significantly outperforms the original KLT tracker. The time-reversibility constraint used for tracking can be incorporated to improve the performance of optical flow, mean shift tracking and other algorithms.},
	keywords = {backward, constraint;video, criterion;state, forward, frame, KLT, processing;, processing;video, processing;visual, signal, tracker;minimization, tracking;minimisation;video, vectors;time-reversibility},
	doi = {10.1109/ICCV.2007.4408956},
	author = {Wu,Hao and Chellapa, Rama and Sankaranarayanan,A. C and Zhou,S. K}
}
@article {12255,
	title = {SAAR: A shared control plane for overlay multicast},
	journal = {Proceedings of 4th USENIX Symposium on Networked Systems Design \& Implementation},
	year = {2007},
	month = {2007///},
	pages = {57 - 72},
	abstract = {Many cooperative overlay multicast systems of diverse designs have been implemented and deployed. In this paper, we explore a new architecture for overlay multicast: we factor out the control plane into a separate overlay that provides a single primitive: a configurable anycast for peer selection. This separation of control and data overlays has several advantages. Data overlays can be optimized for efficient content delivery, while the control overlay can be optimized for flexible and efficient peer selection. Several data channels can share a control plane for fast switching among content channels, which is particularly important for IPTV. And, the control overlay can be reused in multicast systems with different data plane organizations.We designed and evaluated a decentralized control overlay for endsystem multicast. The overlay proactively aggregates system state and implements a powerful anycast primitive for peer selection. We demonstrate that SAAR{\textquoteright}s efficiency in locating peers reduces channel switching time, improves the quality of content delivery, and reduces overhead, even under dynamic conditions and at scale. An experimental evaluation demonstrates that the system can efficiently support single-tree, multi-tree and block-based multicast systems.
},
	author = {Nandi,A. and Ganjam,A. and Druschel,P. and Ng,T. S.E and Stoica,I. and Zhang,H. and Bhattacharjee, Bobby}
}
@conference {14544,
	title = {Scheduling to minimize gaps and power consumption},
	booktitle = {Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures},
	year = {2007},
	month = {2007///},
	pages = {46 - 54},
	author = {Demaine,E. D and Ghodsi,M. and Hajiaghayi, Mohammad T. and Sayedi-Roshkhar,A. S and Zadimoghaddam,M.}
}
@article {15812,
	title = {Structural Footprinting in Protein Structure Comparison: The Impact of Structural Fragments},
	journal = {BMC Structural Biology},
	volume = {7},
	year = {2007},
	month = {2007///},
	abstract = {Abstract Background One approach for speeding-up protein structure comparison is the projection approach, where a protein structure is mapped to a high-dimensional vector and structural similarity is approximated by distance between the corresponding vectors. Structural footprinting methods are projection methods that employ the same general technique to produce the mapping: first select a representative set of structural fragments as models and then map a protein structure to a vector in which each dimension corresponds to a particular model and "counts" the number of times the model appears in the structure. The main difference between any two structural footprinting methods is in the set of models they use; in fact a large number of methods can be generated by varying the type of structural fragments used and the amount of detail in their representation. How do these choices affect the ability of the method to detect various types of structural similarity? Results To answer this question we benchmarked three structural footprinting methods that vary significantly in their selection of models against the CATH database. In the first set of experiments we compared the methods{\textquoteright} ability to detect structural similarity characteristic of evolutionarily related structures, i.e., structures within the same CATH superfamily. In the second set of experiments we tested the methods{\textquoteright} agreement with the boundaries imposed by classification groups at the Class, Architecture, and Fold levels of the CATH hierarchy. Conclusion In both experiments we found that the method which uses secondary structure information has the best performance on average, but no one method performs consistently the best across all groups at a given classification level. We also found that combining the methods{\textquoteright} outputs significantly improves the performance. Moreover, our new techniques to measure and visualize the methods{\textquoteright} agreement with the CATH hierarchy, including the threshholded affinity graph, are useful beyond this work. In particular, they can be used to expose a similar composition of different classification groups in terms of structural fragments used by the method and thus provide an alternative demonstration of the continuous nature of the protein structure universe.},
	url = {DOI:10.1186/1472-6807-7-53DOI:10.1186/1472-6807-7-53},
	author = {Zotenko,Elena and Dogan,Rezarta Islamaj and Wilbur,W. John and O{\textquoteright}Leary, Dianne P. and Przytycka,Teresa M.}
}
@conference {15906,
	title = {Task-based interaction with an integrated multilingual, multimedia information system: a formative evaluation},
	booktitle = {Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries},
	series = {JCDL {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {117 - 126},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper describes a formative evaluation of an integrated multilingual, multimedia information system, a series of user studies designed to guide system development. The system includes automatic speech recognition for English, Chinese, and Arabic, automatic translation from Chinese and Arabic into English, and query-based and profile-based search options. The study design emphasizes repeated evaluation with the same (increasingly experienced) participants, exploration of alternative task designs, rich qualitative and quantitative data collection, and rapid analysis to provide the timely feedback needed to support iterative and responsive development. Results indicate that users presented with materials in a language that they do not know can generate remarkably useful work products, but that integration of transcription, translation, search and profile management poses challenges that would be less evident were each technology to be evaluated in isolation.},
	keywords = {Cross-language information retrieval, multimedia, User studies},
	isbn = {978-1-59593-644-8},
	doi = {10.1145/1255175.1255199},
	url = {http://doi.acm.org/10.1145/1255175.1255199},
	author = {Zhang,Pengyi and Plettenberg,Lynne and Klavans,Judith L. and Oard, Douglas and Soergel,Dagobert}
}
@conference {12395,
	title = {A topic model for word sense disambiguation},
	booktitle = {Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL)},
	year = {2007},
	month = {2007///},
	pages = {1024 - 1033},
	author = {Jordan Boyd-Graber and Blei,D. and Zhu,X.}
}
@article {13180,
	title = {3D structure recovery and unwarping of surfaces applicable to planes},
	journal = {International journal of computer vision},
	volume = {66},
	year = {2006},
	month = {2006///},
	pages = {261 - 281},
	abstract = {The deformation of applicable surfaces such as sheets of paper satisfies the differential geometric constraints of isometry (lengths and areas are conserved) and vanishing Gaussian curvature. We show that these constraints lead to a closed set of equations that allow recovery of the full geometric structure from a single image of the surface and knowledge of its undeformed shape. We show that these partial differential equations can be reduced to the Hopf equation that arises in non-linear wave propagation, and deformations of the paper can be interpreted in terms of the characteristics of this equation. A new exact integration of these equations is developed that relates the 3-D structure of the applicable surface to an image. The solution is tested by comparison with particular exact solutions. We present results for both the forward and the inverse 3D structure recovery problem.},
	author = {Gumerov, Nail A. and Zandifar,A. and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {15244,
	title = {Achieving anonymity via clustering},
	booktitle = {Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems},
	series = {PODS {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {153 - 162},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of de-identifying records is to remove identifying fields such as social security number, name etc. However, recent research has shown that a large fraction of the US population can be identified using non-key attributes (called quasi-identifiers) such as date of birth, gender, and zip code [15]. Sweeney [16] proposed the k-anonymity model for privacy where non-key attributes that leak information are suppressed or generalized so that, for every record in the modified table, there are at least k-1 other records having exactly the same values for quasi-identifiers. We propose a new method for anonymizing data records, where quasi-identifiers of data records are first clustered and then cluster centers are published. To ensure privacy of the data records, we impose the constraint that each cluster must contain no fewer than a pre-specified number of data records. This technique is more general since we have a much larger choice for cluster centers than k-Anonymity. In many cases, it lets us release a lot more information without compromising privacy. We also provide constant-factor approximation algorithms to come up with such a clustering. This is the first set of algorithms for the anonymization problem where the performance is independent of the anonymity parameter k. We further observe that a few outlier points can significantly increase the cost of anonymization. Hence, we extend our algorithms to allow an ε fraction of points to remain unclustered, i.e., deleted from the anonymized publication. Thus, by not releasing a small fraction of the database records, we can ensure that the data published for analysis has less distortion and hence is more useful. Our approximation algorithms for new clustering objectives are of independent interest and could be applicable in other clustering scenarios as well.},
	keywords = {anonymity, Approximation algorithms, clustering, privacy},
	isbn = {1-59593-318-2},
	doi = {10.1145/1142351.1142374},
	url = {http://doi.acm.org/10.1145/1142351.1142374},
	author = {Aggarwal,Gagan and Feder,Tom{\'a}s and Kenthapadi,Krishnaram and Khuller, Samir and Panigrahy,Rina and Thomas,Dilys and Zhu,An}
}
@book {18365,
	title = {Advances in Computers: Computational Biology and Bioinformatics},
	year = {2006},
	month = {2006/11/22/},
	publisher = {Academic Press},
	organization = {Academic Press},
	abstract = {The field of bioinformatics and computational biology arose due to the need to apply techniques from computer science, statistics, informatics, and applied mathematics to solve biological problems. Scientists have been trying to study biology at a molecular level using techniques derived from biochemistry, biophysics, and genetics. Progress has greatly accelerated with the discovery of fast and inexpensive automated DNA sequencing techniques. As the genomes of more and more organisms are sequenced and assembled, scientists are discovering many useful facts by tracing the evolution of organisms by measuring changes in their DNA, rather than through physical characteristics alone. This has led to rapid growth in the related fields of phylogenetics, the study of evolutionary relatedness among various groups of organisms, and comparative genomics, the study of the correspondence between genes and other genomic features in different organisms. Comparing the genomes of organisms has allowed researchers to better understand the features and functions of DNA in individual organisms, as well as provide insights into how organisms evolve over time. The first four chapters of this book focus on algorithms for comparing the genomes of different organisms. Possible concrete applications include identifying the basis for genetic diseases and tracking the development and spread of different forms of Avian flu. As researchers begin to better understand the function of DNA, attention has begun shifting towards the actual proteins produced by DNA. The final two chapters explore proteomic techniques for analyzing proteins directly to identify their presence and understand their physical structure.- Written by active PhD researchers in computational biology and bioinformatics},
	keywords = {Bioinformatics, Computational Biology, Computers / Bioinformatics, Computers / Computer Science, Computers / Data Processing, Computers / Information Theory, Computers / Interactive \& Multimedia, Computers / Programming / General, Computers / Reference, Computers / Software Development \& Engineering / General, Mathematics / Applied, Science / Life Sciences / Biology},
	isbn = {9780120121687},
	author = {Zelkowitz, Marvin V and Tseng,Chau-Wen}
}
@conference {13496,
	title = {ANew Algorithm for Detecting Text Line in Handwritten Documents},
	booktitle = {10th International Workshop on Frontiers in Handwriting Recognition},
	year = {2006},
	month = {2006///},
	pages = {35 - 40},
	address = {La Baule, France},
	abstract = {Curvilinear text line detection and segmentation in handwritten documents is a significant challenge for handwriting recognition. Given no prior knowledge of script, we model text line detection as an image segmentation problem by enhancing text line structure using a Gaussian window, and adopting the level set method to evolve text line boundaries. Experiments show that the proposed method achieves high accuracy for detecting text lines in both handwritten and machine printed documents with many scripts.},
	author = {Li,Yi and Yefeng Zheng and David Doermann and Jaeger,Stefan}
}
@conference {13723,
	title = {Annotation compatibility working group report},
	booktitle = {Proceedings of the Workshop on Frontiers in Linguistically Annotated Corpora 2006},
	series = {LAC {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {38 - 53},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {This report explores the question of compatibility between annotation projects including translating annotation formalisms to each other or to common forms. Compatibility issues are crucial for systems that use the results of multiple annotation projects. We hope that this report will begin a concerted effort in the field to track the compatibility of annotation schemes for part of speech tagging, time annotation, treebanking, role labeling and other phenomena.},
	isbn = {1-932432-78-7},
	url = {http://dl.acm.org/citation.cfm?id=1641991.1641997},
	author = {Meyers,A. and Fang,A. C. and Ferro,L. and K{\"u}bler,S. and Jia-Lin,T. and Palmer,M. and Poesio,M. and Dolbey,A. and Schuler,K. K. and Loper,E. and Zinsmeister,H. and Penn,G. and Xue,N. and Hinrichs,E. and Wiebe,J. and Pustejovsky,J. and Farwell,D. and Hajicova,E. and Dorr, Bonnie J and Hovy,E. and Onyshkevych,B. A. and Levin,L.}
}
@conference {13502,
	title = {ARobust Stamp Detection Framework on Degraded Documents},
	booktitle = {International Conference on Document Recognition and Retrieval XIII},
	year = {2006},
	month = {2006///},
	pages = {1 - 9},
	publisher = {San Jose, CA},
	organization = {San Jose, CA},
	abstract = {In this paper, we present a novel stamp detection framework based on parameter estimation of connected edge features. Using robust basic shape detectors, the approach is effective for stamps with analytically shaped contours. For elliptic/circular stamps, it efficiently makes use of the orientation information from pairs of edge points to determine its center position and area without computing all the five parameters of ellipse. When linking connected edges, we introduce an effective template-based junction removal technique to specifically address the problem that stamps often spatially overlap with background contents. These give our approach significant advantage in terms of computation complexity over traditional Hough transform methods. Experimental results on real degraded documents demonstrated the robustness of this retrieval approach on large document database, which consists of both printed text and handwritten notes. This enables us to reliably retrieve documents from a specific source by detecting its official stamps with analytically-shape contours when only limited samples are available.},
	author = {Zhu,Guangyu and Jaeger,Stefan and David Doermann}
}
@article {14015,
	title = {Capture and rendering of spatial sound over headphones},
	journal = {The Journal of the Acoustical Society of America},
	volume = {120},
	year = {2006},
	month = {2006///},
	pages = {3094 - 3094},
	abstract = {A theory for capturing an audio scene and then rendering it remotely over headphones is developed. The method relies on capture of a sound field up to a certain order in terms of spherical wave functions. Then, the captured sound field is convolved with the head-related transfer function and rendered to provide presence in the auditory scene. The sound-field representation is then transmitted to a remote location for immediate rendering or stored for later use. A system that implements the capture using a spherical array is developed and tested. Head-related transfer functions are measured using the system described in [D.N. Zotkin et al., J. Acoustic. Soc. Am. (to appear)]. The sound renderer, coupled with the head tracker, reconstructs the acoustic field using individualized head-related transfer functions to preserve the perceptual spatial structure of the audio scene. [Work partially supported by VA.]},
	url = {http://link.aip.org/link/?JAS/120/3094/4},
	author = {Duraiswami, Ramani and Zotkin,Dmitry N and O{\textquoteright}donovan,Adam}
}
@article {18358,
	title = {A case study in rapid prototyping},
	journal = {Software: Practice and Experience},
	volume = {10},
	year = {2006},
	month = {2006/10/27/},
	pages = {1037 - 1042},
	abstract = {A case study in rapid prototyping of a new language processor is described. A quick version of the system was developed in SNOBOL4, revised in SNOBOL4, and then rewritten in Pascal. This led to an operational system very early in the development cycle where operational characteristics of the system could be tested easily. The goals of this experiment as well as some of the results are described.},
	keywords = {design, FFP, Prototypes},
	isbn = {1097-024X},
	doi = {10.1002/spe.4380101209},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.4380101209/abstract},
	author = {Zelkowitz, Marvin V}
}
@article {18173,
	title = {Classification-based spatial error concealment for visual communications},
	journal = {EURASIP J. Appl. Signal Process.},
	volume = {2006},
	year = {2006},
	month = {2006/01//},
	pages = {257 - 257},
	abstract = {In an error-prone transmission environment, error concealment is an effective technique to reconstruct the damaged visual content. Due to large variations of image characteristics, different concealment approaches are necessary to accommodate the different nature of the lost image content. In this paper, we address this issue and propose using classification to integrate the state-of-the-art error concealment techniques. The proposed approach takes advantage of multiple concealment algorithms and adaptively selects the suitable algorithm for each damaged image area. With growing awareness that the design of sender and receiver systems should be jointly considered for efficient and reliable multimedia communications, we proposed a set of classification-based block concealment schemes, including receiver-side classification, sender-side attachment, and sender-side embedding. Our experimental results provide extensive performance comparisons and demonstrate that the proposed classification-based error concealment approaches outperform the conventional approaches.},
	isbn = {1110-8657},
	doi = {10.1155/ASP/2006/13438},
	url = {http://dx.doi.org/10.1155/ASP/2006/13438},
	author = {Chen,Meng and Yefeng Zheng and M. Wu}
}
@conference {15266,
	title = {A compact mathematical programming formulation for DNA motif finding},
	booktitle = {Combinatorial Pattern Matching},
	year = {2006},
	month = {2006///},
	pages = {233 - 245},
	author = {Kingsford, Carl and Zaslavsky,E. and Singh,M.}
}
@conference {13536,
	title = {Detecting Text Line in Handwritten Documents},
	booktitle = {ICPR{\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {1030 - 1033},
	address = {Hong Kong, China},
	abstract = {Although detecting text lines in machine printed documents is typically considered as a solved problem, it is still a challenge to segment handwritten text lines in the general sense given no prior knowledge of scrip. This paper models text line detection as an image segmentation problem by enhancing text line structure using a Gaussian window, and adopting the level set method to evolve text line boundaries. Experiments show that the method, which is script independent, achieves high accuracy for detecting text lines in both handwritten and machine printed documents.},
	author = {Li,Yi and Yefeng Zheng and David Doermann}
}
@conference {13540,
	title = {DOCLIB: a Software Library for Document Processing},
	booktitle = {International Conference on Document Recognition and Retrieval XIII},
	year = {2006},
	month = {2006///},
	pages = {1 - 9},
	publisher = {San Jose, CA},
	organization = {San Jose, CA},
	abstract = {Most researchers would agree that research in the field of document processing can benefit tremendously from a common software library through which institutions are able to develop and share research-related software and applications across academic, business, and government domains. However, despite several attempts in the past, the research community still lacks a widely-accepted standard software library for document processing. This paper describes a new library called DOCLIB, which tries to overcome the drawbacks of earlier approaches. Many of DOCLIB{\textquoteright}s features are unique either in themselves or in their combination with others, e.g. the factory concept for support of different image types, the juxtaposition of image data and metadata, or the add-on mechanism. We cherish the hope that DOCLIB serves the needs of researchers better than previous approaches and will readily be accepted by a larger group of scientists.},
	author = {Jaeger,Stefan and Zhu,Guangyu and David Doermann and Chen,Kevin and Sampat,Summit}
}
@article {14395,
	title = {Entity and relationship labeling in affiliation networks},
	journal = {ICML Workshop on Statistical Network Analysis},
	year = {2006},
	month = {2006///},
	abstract = {Many domains are best characterized as anaffiliation network describing a set of actors
and a set of events interlinked together in
a variety of relationships. Relational clas-
sification in these domains requires the col-
lective classification of both entities (actors
and events) and relationships. We investigate
the use of relational Markov networks (RMN)
for relational classification in affiliation net-
works. In this paper, we introduce a novel
dataset, Profile in Terror (PIT) knowledge
base, that provides a rich source of various af-
filiation networks. We study two tasks, entity
labeling and relationship labeling. We high-
light several important issues concerning the
effectiveness of relational classification. Our
results show that the PIT dataset has a rich
source of relational structure and therefore
it is a useful dataset for statisical relational
network learning community.
},
	author = {Zhao,B. and Sen,P. and Getoor, Lise}
}
@article {14479,
	title = {Event classification and relationship labeling in affiliation networks},
	journal = {Proceedings of the Workshop on Statistical Network Analysis (SNA) at the 23rd International Conference on Machine Learning (ICML)},
	year = {2006},
	month = {2006///},
	abstract = {Many domains are best described as an affiliation network in which there are entities such as actors, events and organizations linked together in a variety of relationships. Relational classification in these domains requires the collective classification of both entities and relationships. In this paper, we investigate the use of relational Markov networks (RMN) for relational classification in affiliation networks. We study two tasks, event classification and relationship labeling, and discuss general issues in constructing an appropriate RMN from an affiliation network. We evaluate our methods on a novel dataset describing terrorist affiliation networks which includes data about actors (terrorists), events (terrorist attacks) and organizations (terrorist organizations). Our results highlight several important issues concerning the effectiveness of relational classification and our experiments show that the relational structure significantly helps relationship labeling.},
	author = {Zhao,B. and Sen,P. and Getoor, Lise}
}
@article {12135,
	title = {Experiments to understand HPC time to development},
	journal = {CTWatch Quarterly},
	year = {2006},
	month = {2006///},
	abstract = {In order to understand how high performance computing (HPC) programs are developed, a series of experiments, using students in graduate level HPC classes, have been conducted at many universities in the US. In this paper we discuss the general process of conducting those experiments, give some of the early results of those experiments, and describe a web-based process we are developing that will allow us to run additional experiments at other universities and laboratories that will be easier to conduct and generate results that more accurately reflect the process of building HPC programs.},
	keywords = {hackystat, HPC, publications-journals},
	url = {http://csdl.ics.hawaii.edu/techreports/06-08/06-08.pdf},
	author = {Hochstein, Lorin and Nakamura,Taiga and Basili, Victor R. and Asgari, Sima and Zelkowitz, Marvin V and Hollingsworth, Jeffrey K and Shull, Forrest and Carver,Jeffrey and Voelp,Martin and Zazworka, Nico and Johnson,Philip}
}
@book {12641,
	title = {Face Processing: Advanced Modeling and Methods},
	year = {2006},
	month = {2006///},
	publisher = {Academic Press/Elsevier},
	organization = {Academic Press/Elsevier},
	author = {Chellapa, Rama and Zhao, W.}
}
@article {14009,
	title = {Fast head-related transfer function measurement via reciprocity},
	journal = {The Journal of the Acoustical Society of America},
	volume = {120},
	year = {2006},
	month = {2006///},
	pages = {2202 - 2215},
	abstract = {An efficient method for head-related transfer function (HRTF) measurement is presented. By applying the acoustical principle of reciprocity, one can swap the speaker and the microphone positions in the traditional (direct) HRTF measurement setup, that is, insert a microspeaker into the subject{\textquoteright}s ear and position several microphones around the subject, enabling simultaneous HRTF acquisition at all microphone positions. The setup used for reciprocal HRTF measurement is described, and the obtained HRTFs are compared with the analytical solution for a sound-hard sphere and with KEMAR manikin HRTF obtained by the direct method. The reciprocally measured sphere HRTF agrees well with the analytical solution. The reciprocally measured and the directly measured KEMAR HRTFs are not exactly identical but agree well in spectrum shape and feature positions. To evaluate if the observed differences are significant, an auditory localization model based on work byJ. C. Middlebrooks [J. Acoust. Soc. Am. 92, 2607{\textendash}2624 (1992)
] was used to predict where a virtual sound source synthesized with the reciprocally measured HRTF would be localized if the directly measured HRTF were used for the localization. It was found that the predicted localization direction generally lies close to the measurement direction, indicating that the HRTFs obtained via the two methods are in good agreement.
},
	keywords = {hearing, Microphones, Transfer functions},
	doi = {10.1121/1.2207578},
	url = {http://link.aip.org/link/?JAS/120/2202/1},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Grassi,Elena and Gumerov, Nail A.}
}
@conference {12626,
	title = {Finding Gait in Space and Time},
	booktitle = {Pattern Recognition, 2006. ICPR 2006. 18th International Conference on},
	volume = {4},
	year = {2006},
	month = {2006///},
	pages = {586 - 589},
	abstract = {We describe an approach to characterize the signatures generated by walking humans in spatio-temporal domain. To describe the computational model for this periodic pattern, we take the mathematical theory of geometry group theory, which is widely used in crystallographic structure research. Both empirical and theoretical analyses prove that spatio-temporal helical patterns generated by legs belong to the Frieze Groups because they can be characterized by a repetitive motif along the direction of walking. The theory is applied to an automatic detection-and-tracking system capable of counting heads and handling occlusion by recognizing such patterns. Experimental results for videos acquired from both static and moving ground sensors are presented. Our algorithm demonstrates robustness to non-rigid human deformation as well as background clutter},
	keywords = {analysis;, analysis;geometry, analysis;group, characterization;occlusion, counting;mathematical, detection-and-tracking, domain;spatiotemporal, Frieze, group, groups;automatic, handling;pattern, helical, humans;computer, MOTION, pattern;spatiotemporal, patterns;walking, recognition;periodic, signature, system;computer, theory;head, theory;image, theory;motion, vision;gait},
	doi = {10.1109/ICPR.2006.562},
	author = {Yang Ran and Chellapa, Rama and Qinfen Zheng}
}
@conference {18480,
	title = {Frequency Independent Flexible Spherical Beamforming Via Rbf Fitting},
	booktitle = {2006 IEEE International Conference on Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings},
	volume = {5},
	year = {2006},
	month = {2006/05//},
	pages = {V-V - V-V},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We describe a new method for sound analysis using a spherical microphone array without the use of quadrature over the sphere. Quadrature based solutions are very sensitive to the placement of microphones on the sphere, needing measurements to be made at exactly the quadrature positions. We propose to use fitting with band-limited radial basis functions (RBFs) rather than quadrature. Our approach results in frequency independent beamformer weights for flexibly placed microphone locations. Results are demonstrated using both synthetic and real spherical array data},
	keywords = {acoustic signal processing, array signal processing, band-limited radial basis functions, Computer science, Educational institutions, Eigenvalues and eigenfunctions, Equations, Frequency, frequency independent beamformer weights, frequency independent flexible spherical beamforming, microphone arrays, Nails, Position measurement, RBF fitting, Robustness, sound analysis, spherical array data, spherical microphone array},
	isbn = {1-4244-0469-X},
	doi = {10.1109/ICASSP.2006.1661208},
	author = {Yerukhimovich,A. and Duraiswami, Ramani and Gumerov, Nail A. and Zotkin,Dmitry N}
}
@article {12613,
	title = {From sample similarity to ensemble similarity: probabilistic distance measures in reproducing kernel Hilbert space},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {28},
	year = {2006},
	month = {2006/06//},
	pages = {917 - 929},
	abstract = {This paper addresses the problem of characterizing ensemble similarity from sample similarity in a principled manner. Using a reproducing kernel as a characterization of sample similarity, we suggest a probabilistic distance measure in the reproducing kernel Hilbert space (RKHS) as the ensemble similarity. Assuming normality in the RKHS, we derive analytic expressions for probabilistic distance measures that are commonly used in many applications, such as Chernoff distance (or the Bhattacharyya distance as its special case), Kullback-Leibler divergence, etc. Since the reproducing kernel implicitly embeds a nonlinear mapping, our approach presents a new way to study these distances whose feasibility and efficiency is demonstrated using experiments with synthetic and real examples. Further, we extend the ensemble similarity to the reproducing kernel for ensemble and study the ensemble similarity for more general data representations.},
	keywords = {Automated;Sample Size;Signal Processing, Bhattacharyya distance;Chernoff distance;Gram matrix;Kullback-Leibler divergence;data representations;ensemble similarity characterization;nonlinear mapping;probabilistic distance measures;reproducing kernel Hilbert space;sample similarity characterizatio, Computer-Assisted;, Statistical;Pattern Recognition},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2006.120},
	author = {Zhou,S. K and Chellapa, Rama}
}
@article {14012,
	title = {Head-related transfer functions via the fast multipole accelerated boundary element method},
	journal = {The Journal of the Acoustical Society of America},
	volume = {120},
	year = {2006},
	month = {2006///},
	pages = {3342 - 3343},
	abstract = {Computation of head-related transfer functions (HRTF) via geometrical meshes and numerical methods has been suggested by a number of authors. An issue facing this approach is the large computational time needed for high frequencies, where the discretization must include hundreds of thousands of elements. Conventional computational methods are unable to achieve such computations without excessive time or memory. We use a newly developed fast multipole accelerated boundary element method (FMM/BEM) that scales linearly both in time and memory. The method is applied to the mesh of the widely used KEMAR manikin and its HRTF computed up to 20 kHz. The results are compared with available experimental measurements.},
	url = {http://link.aip.org/link/?JAS/120/3342/6},
	author = {Gumerov, Nail A. and Duraiswami, Ramani and Zotkin,Dmitry N}
}
@conference {12620,
	title = {Integrated Motion Detection and Tracking for Visual Surveillance},
	booktitle = {Computer Vision Systems, 2006 ICVS {\textquoteright}06. IEEE International Conference on},
	year = {2006},
	month = {2006/01//},
	pages = {28 - 28},
	abstract = {Visual surveillance systems have gained a lot of interest in the last few years. In this paper, we present a visual surveillance system that is based on the integration of motion detection and visual tracking to achieve better performance. Motion detection is achieved using an algorithm that combines temporal variance with background modeling methods. The tracking algorithm combines motion and appearance information into an appearance model and uses a particle filter framework for tracking the object in subsequent frames. The systems was tested on a large ground-truthed data set containing hundreds of color and FLIR image sequences. A performance evaluation for the system was performed and the average evaluation results are reported in this paper.},
	doi = {10.1109/ICVS.2006.35},
	author = {Abdelkader, M.F. and Chellapa, Rama and Qinfen Zheng and Chan, A.L.}
}
@inbook {12637,
	title = {Integrating Video Information over Time. Example: Face Recognition from Video},
	booktitle = {Cognitive Vision SystemsCognitive Vision Systems},
	series = {Lecture Notes in Computer Science},
	volume = {3948},
	year = {2006},
	month = {2006///},
	pages = {127 - 144},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The ability to integrate information over time in order to come to a conclusion is a strength of cognitive systems. It allows the system, e.g., to 1 verify insecure observations: This is the case when data is noisy or of low-quality, or if conditions in general are non-optimal. 2 exploit general knowledge about spatio-temporal relations: This allows the system to exploit the specific dynamics of an object as an additional feature for, e.g., recognition, interpretation and prediction of actions of other agents. 3 In general, using dynamics allows the system to recursively generate and verify hypotheses for object and scene interpretation and to generate warnings when {\textquoteleft}implausible{\textquoteright} hypotheses occur or to circumvent them altogether. We have studied the effectiveness of temporal integration for recognition purposes by using the face recognition as an example study case. Face recognition is a prominent problem and has been studied more extensively than almost any other recognition problem. An observation is that face recognition works well in ideal conditions. If those conditions, however, are not met, then all present algorithms break down disgracefully. This problem appears to be general to all vision techniques that intend to extract visual information out of low-SNR image data. It is exactly a strength of cognitive systems that they are able to cope with non-ideal situations. In this chapter we will deal with this problem.},
	isbn = {978-3-540-33971-7},
	url = {http://dx.doi.org/10.1007/11414353_9},
	author = {Kr{\"u}ger,Volker and Zhou,Shaohua and Chellapa, Rama},
	editor = {Christensen,Henrik and Nagel,Hans-Hellmut}
}
@article {16091,
	title = {Interactive sonification for blind people exploration of geo-referenced data: comparison between a keyboard-exploration and a haptic-exploration interfaces},
	journal = {Cognitive Processing},
	volume = {7},
	year = {2006},
	month = {2006///},
	pages = {178 - 179},
	isbn = {1612-4782},
	url = {http://dx.doi.org/10.1007/s10339-006-0137-8},
	author = {Delogu,Franco and Belardinelli,Marta and Palmiero,Massimiliano and Pasqualotto,Emanuele and Zhao,Haixia and Plaisant, Catherine and Federici,Stefano}
}
@conference {14706,
	title = {Managing policy updates in security-typed languages},
	booktitle = {19th IEEE Computer Security Foundations Workshop, 2006},
	year = {2006},
	month = {2006///},
	pages = {13 pp.-216 - 13 pp.-216},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper presents Rx, a new security-typed programming language with features intended to make the management of information-flow policies more practical. Security labels in Rx, in contrast to prior approaches, are defined in terms of owned roles, as found in the RT role-based trust-management framework. Role-based security policies allow flexible delegation, and our language Rx provides constructs through which programs can robustly update policies and react to policy updates dynamically. Our dynamic semantics use statically verified transactions to eliminate illegal information flows across updates, which we call transitive flows. Because policy updates can be observed through dynamic queries, policy updates can potentially reveal sensitive information. As such, Rx considers policy statements themselves to be potentially confidential information and subject to information-flow metapolicies},
	keywords = {Access control, Computer languages, Data security, Database systems, dynamic queries, dynamic semantics, Educational institutions, high level languages, Information security, information-flow policy management, Lattices, Network servers, Operating systems, policy update management, Robustness, role-based security policies, RT role-based trust-management framework, Rx security-typed programming language, security of data, statically verified transactions, transitive flows},
	isbn = {0-7695-2615-2},
	doi = {10.1109/CSFW.2006.17},
	author = {Swamy,N. and Hicks, Michael W. and Tse,S. and Zdancewic,S.}
}
@article {12602,
	title = {Method and System for Object Surveillance and Real Time Activity Recognition},
	volume = {12/086,118},
	year = {2006},
	month = {2006/12/05/},
	abstract = {Method and system for objects surveillance and real-time activity recognition is based on analysis of spatio-temporal images of individuals under surveillance where a spatio-temporal volume occupied by each individual is decomposed by crossing the same at specific heights to form 2-dimensional slices, each containing representation of trajectory of the motion of corresponding portions of the individual body. The symmetry of the trajectories (Gait DNA) is analyzed and classified to generate data indicative of a type of activity of the individual based on the symmetry or asymmetry of the Gait DNA in each 2-dimensional slice. An effective occlusion handling ability is implemented which permits to restore the occluded silhouette of an individual.},
	url = {http://www.google.com/patents?id=IArMAAAAEBAJ},
	author = {Yang Ran and Chellapa, Rama and Qinfen Zheng}
}
@article {17309,
	title = {Nuclear Envelope Dystrophies Show a Transcriptional Fingerprint Suggesting Disruption of Rb{\textendash}MyoD Pathways in Muscle Regeneration},
	journal = {BrainBrain},
	volume = {129},
	year = {2006},
	month = {2006/04/01/},
	pages = {996 - 1013},
	abstract = {Mutations of lamin A/C (LMNA) cause a wide range of human disorders, including progeria, lipodystrophy, neuropathies and autosomal dominant Emery{\textendash}Dreifuss muscular dystrophy (EDMD). EDMD is also caused by X-linked recessive loss-of-function mutations of emerin, another component of the inner nuclear lamina that directly interacts with LMNA. One model for disease pathogenesis of LMNA and emerin mutations is cell-specific perturbations of the mRNA transcriptome in terminally differentiated cells. To test this model, we studied 125 human muscle biopsies from 13 diagnostic groups (125 U133A, 125 U133B microarrays), including EDMD patients with LMNA and emerin mutations. A Visual and Statistical Data Analyzer (VISDA) algorithm was used to statistically model cluster hierarchy, resulting in a tree of phenotypic classifications. Validations of the diagnostic tree included permutations of U133A and U133B arrays, and use of two probe set algorithms (MAS5.0 and MBEI). This showed that the two nuclear envelope defects (EDMD LMNA, EDMD emerin) were highly related disorders and were also related to fascioscapulohumeral muscular dystrophy (FSHD). FSHD has recently been hypothesized to involve abnormal interactions of chromatin with the nuclear envelope. To identify disease-specific transcripts for EDMD, we applied a leave-one-out (LOO) cross-validation approach using LMNA patient muscle as a test data set, with reverse transcription{\textendash}polymerase chain reaction (RT{\textendash}PCR) validations in both LMNA and emerin patient muscle. A high proportion of top-ranked and validated transcripts were components of the same transcriptional regulatory pathway involving Rb1 and MyoD during muscle regeneration (CRI-1, CREBBP, Nap1L1, ECREBBP/p300), where each was specifically upregulated in EDMD. Using a muscle regeneration time series (27 time points) we develop a transcriptional model for downstream consequences of LMNA and emerin mutations. We propose that key interactions between the nuclear envelope and Rb and MyoD fail in EDMD at the point of myoblast exit from the cell cycle, leading to poorly coordinated phosphorylation and acetylation steps. Our data is consistent with mutations of nuclear lamina components leading to destabilization of the transcriptome in differentiated cells.},
	keywords = {EDMD = Emery{\textendash}Dreifuss muscular dystrophy, emerin, Emery-Dreifuss muscular dystrophy, FSHD = fascioscapulohumeral muscular dystrophy, IDG = individual discriminatory genes, JDG = jointly discriminatory genes, lamin A/C, LGMD = limb-girdle muscular dystrophy, LOO = leave-one-out, RT{\textendash}PCR = reverse transcription{\textendash}polymerase chain reaction; VISDA = Visual and Statistical Data Analyzer, Skeletal muscle, wFC = weighted Fisher criterion},
	isbn = {0006-8950, 1460-2156},
	doi = {10.1093/brain/awl023},
	url = {http://brain.oxfordjournals.org/content/129/4/996},
	author = {Bakay,Marina and Wang,Zuyi and Melcon,Gisela and Schiltz,Louis and Xuan,Jianhua and Zhao,Po and Sartorelli,Vittorio and Seo,Jinwook and Pegoraro,Elena and Angelini,Corrado and Shneiderman, Ben and Escolar,Diana and Chen,Yi-Wen and Winokur,Sara T and Pachman,Lauren M and Fan,Chenguang and Mandler,Raul and Nevo,Yoram and Gordon,Erynn and Zhu,Yitan and Dong,Yibin and Wang,Yue and Hoffman,Eric P}
}
@conference {14010,
	title = {Numerical Analysis of Plasmon Resonances Based on Fast Multipole Method},
	booktitle = {Electromagnetic Field Computation, 2006 12th Biennial IEEE Conference on},
	year = {2006},
	month = {2006///},
	pages = {459 - 459},
	abstract = {A novel technique for the numerical analysis of plasmon resonances by using fast multipole method (FMM) is presented. This approach is based on the solution of eigenvalue problem for boundary integral equations, which can be naturally implemented by using the fast multipole method. Numerical examples that highlight the efficiency of the fast multipole implementation are reported},
	keywords = {analysis;plasmon, and, boundary, eigenfunctions;plasmons;, equations;eigenvalue, equations;eigenvalues, integral, method;numerical, multipole, problem;fast, resonances;boundary},
	doi = {10.1109/CEFC-06.2006.1633249},
	author = {Zhang,Zhenyu and Mayergoyz, Issak D and Gumerov, Nail A. and Duraiswami, Ramani}
}
@article {15395,
	title = {Numerical analysis of plasmon resonances in nanoparticles},
	journal = {Magnetics, IEEE Transactions on},
	volume = {42},
	year = {2006},
	month = {2006/04//},
	pages = {759 - 762},
	abstract = {Plasmon (electrostatic) resonances in nanoparticles are treated as an eigenvalue problem for a specific boundary integral equation. This leads to direct calculation of resonance values of permittivity and resonance frequency. The numerical technique is illustrated by examples of calculation of resonance frequencies for three-dimensional nanoparticles},
	keywords = {3D, analysis;plasmon, and, boundary, eigenfunctions;electrostatics;nanoparticles;permittivity;surface, equation;boundary, equations;eigenvalues, integral, nanoparticles;eigenvalue, plasmon, problem;numerical, resonance;, resonances;specific},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2006.870976},
	author = {Mayergoyz, Issak D and Zhang,Zhenyu}
}
@article {12150,
	title = {Observations about software development for high end computing},
	journal = {CTWatch Quarterly},
	volume = {2},
	year = {2006},
	month = {2006///},
	pages = {33 - 38},
	abstract = {In this paper, we have summarized our findings from a series of case studies conducted with ten ASC and MP Codes as a series of observations. Due to different environments in which each code is developed, some of the observations are consistent across code teams while others vary across code teams. Overall, we found high consistency among the ASC Codes and the MP Codes. Due to the different environments and foci of these projects, this result is both surprising and positive. In addition, despite the fact that a large majority of the developers on these teams have little or no formal training in software engineering, they have been able to make use of some basic software engineering principles. Further education and motivation could increase the use of these principles and further increase the quality of scientific and engineering software that has already demonstrated its value.Based on the positive results thus far, we have plans to conduct additional case studies to gather more data in support of or in contradiction to the observations presented in this paper. In future case studies, we will strive to investigate codes from additional domains, thereby allowing broader, more inclusive conclusions to be drawn.
},
	author = {Carver, J. C and Hochstein, L. M and Kendall,R. P and Nakamura, T. and Zelkowitz, Marvin V and Basili, Victor R. and Post,D. E}
}
@article {18408,
	title = {Optimization of structured programs},
	journal = {Software: Practice and Experience},
	volume = {4},
	year = {2006},
	month = {2006/10/27/},
	pages = {51 - 57},
	abstract = {The class of programs which do not contain goto statements has a structure which lends itself to optimization by an optimizer that is fast, efficient and relatively easy to program. The design of such an optimizer is described, along with some of the results obtained using this optimizer{\textemdash}one such result being that very little code optimization is achieved. The conjecture is made that this is true because gotoless programming languages lend themselves to more compact and concise object code at the source language level.},
	keywords = {compiler, Nested control structures, Optimizer, structured programming},
	isbn = {1097-024X},
	doi = {10.1002/spe.4380040106},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.4380040106/abstract},
	author = {Zelkowitz, Marvin V and Bail,William G}
}
@article {18411,
	title = {PIT: A macro-implemented implementation language},
	journal = {Software: Practice and Experience},
	volume = {2},
	year = {2006},
	month = {2006/10/27/},
	pages = {337 - 346},
	abstract = {An implementation technique called PIT, for pseudo instructional technique, is described which utilizes the macro capabilities of most macro assemblers. A low level machine architecture is described via a set of macros that include some {\textquoteleft}high level{\textquoteright} features. Since the macros manipulate computer words, and refer to actual registers, their implementation in a system is relatively efficient, but since they do not reflect any one particular hardware design, they can be implemented by almost any macro assembler. Tests are built into the macros so that a PIT program will run without change on any machine that has defined these macrosThis technique should provide an alternative to using higher level languages as implementation languages if the object code produced by those compilers is deemed too slow (or too large) for the application that is being programmed.
},
	keywords = {compilers, Implementation languages, Macros},
	isbn = {1097-024X},
	doi = {10.1002/spe.4380020405},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.4380020405/abstract},
	author = {Zelkowitz, Marvin V}
}
@article {17645,
	title = {Provable algorithms for parallel generalized sweep scheduling},
	journal = {Journal of Parallel and Distributed Computing},
	volume = {66},
	year = {2006},
	month = {2006///},
	pages = {807 - 821},
	author = {Anil Kumar,V. S and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind and Zust,S.}
}
@article {13636,
	title = {Robust Point Matching for Nonrigid Shapes By Preserving Local Neighborhood Structures},
	journal = {IEEETransactions on Pattern Analysis and Machine Intelligence},
	volume = {28},
	year = {2006},
	month = {2006/04//},
	pages = {643 - 649},
	abstract = {In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, however, the local relationship among neighboring points is stronger and more stable than the global one. In this paper, we introduce the notion of a neighborhood structure for the general point matching problem. We formulate point matching as an optimization problem to preserve local neighborhood structures during matching. Our approach has a simple graph matching interpretation, where each point is a node in the graph, and two nodes are connected by an edge if they are neighbors. The optimal match between two graphs is the one that maximizes the number of matched edges. Existing techniques are leveraged to search for an optimal solution with the shape context distance used to initialize the graph matching, followed by relaxation labeling updates for refinement. Extensive experiments show the robustness of our approach under deformation, noise in point locations, outliers, occlusion, and rotation. It outperforms the shape context and TPS-RPM algorithms on most scenarios.},
	author = {Yefeng Zheng and David Doermann}
}
@article {13639,
	title = {Script-Independent Text Line Segmentation in Freestyle Handwritten Documents},
	volume = {LAMP-TR-136, CS-TR-4836, UMIACS-TR-2006-51, CFAR-TR-1017},
	year = {2006},
	month = {2006/11//},
	institution = {University of Maryland, College Park},
	abstract = {Text line segmentation in freestyle handwritten documents remains an open document analysis problem. Curvilinear text lines and small gaps between neighboring text lines present a challenge to algorithms developed for machine printed or hand-printed documents. In this paper, we propose a novel approach based on density estimation and a state-of-the-art image segmentation technique, the level set method. From an input document image, we estimate a probability map, where each element represents the probability that the underlying pixel belongs to a text line. The level set method is then exploited to determine the boundary of neighboring text lines by evolving an initial estimate. Unlike most connected component based methods [1, 2], the proposed algorithm does not use any script-specific knowledge. Extensive quantitative experiments on freestyle handwritten documents with diverse scripts, such as Arabic, Chinese, Korean, and Hindi, demonstrate that our algorithm consistently outperforms previous methods [3, 1, 2]. Further experiments show the proposed algorithm is robust to scale change, rotation, and noise.},
	author = {Li,Yi and Yefeng Zheng and David Doermann and Jaeger,Stefan}
}
@article {15805,
	title = {Secondary Structure Spatial Conformation Footprint: A Novel Method for Fast Protein Structure Comparison and Classification},
	journal = {BMC Structural Biology},
	volume = {6},
	year = {2006},
	month = {2006///},
	abstract = {Recently a new class of methods for fast protein structure comparison has emerged. We call the methods in this class projection methods as they rely on a mapping of protein structure into a high-dimensional vector space. Once the mapping is done, the structure comparison is reduced to distance computation between corresponding vectors. As structural similarity is approximated by distance between projections, the success of any projection method depends on how well its mapping function is able to capture the salient features of protein structure. There is no agreement on what constitutes a good projection technique and the three currently known projection methods utilize very different approaches to the mapping construction, both in terms of what structural elements are included and how this information is integrated to produce a vector representation. Results In this paper we propose a novel projection method that uses secondary structure information to produce the mapping. First, a diverse set of spatial arrangements of triplets of secondary structure elements, a set of structural models, is automatically selected. Then, each protein structure is mapped into a high-dimensional vector of "counts" or footprint, where each count corresponds to the number of times a given structural model is observed in the structure, weighted by the precision with which the model is reproduced. We perform the first comprehensive evaluation of our method together with all other currently known projection methods. Conclusion The results of our evaluation suggest that the type of structural information used by a projection method affects the ability of the method to detect structural similarity. In particular, our method that uses the spatial conformations of triplets of secondary structure elements outperforms other methods in most of the tests.},
	url = {DOI:10.1186/1472-6807-6-12DOI:10.1186/1472-6807-6-12},
	author = {Zotenko,Elena and O{\textquoteright}Leary, Dianne P. and Przytycka,Teresa M.}
}
@article {13857,
	title = {Sentence compression as a component of a multi-document summarization system},
	journal = {Proceedings of the 2006 Document Understanding Workshop, New York},
	year = {2006},
	month = {2006///},
	abstract = {We applied a single-document sentence-trimming approach (Trimmer) to the
problem of multi-document summariza-
tion. Trimmer was designed with the in-
tention of compressing a lead sentence
into a space consisting of tens of char-
acters. In our Multi-Document Trimmer
(MDT), we use Trimmer to generate
multiple trimmed candidates for each
sentence. Sentence selection is used
to determine which trimmed candidates
provide the best combination of topic
coverage and brevity. We demonstrate
that we were able to port Trimmer easily
to this new problem. We also show that
MDT generally ranked higher for recall
than for precision, suggesting that MDT
is currently more successful at finding
relevant content than it is at weeding out
irrelevant content. Finally, we present
an error analysis that shows that, while
sentence compressions is making space
for additional sentences, more work is
needed in the area of generating and se-
lecting the right candidates.
},
	author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Schwartz,R.}
}
@inbook {15806,
	title = {Sentence Trimming and Selection: Mixing and Matching},
	booktitle = {DUC 06 Conference Proceedings},
	year = {2006},
	month = {2006///},
	publisher = {U.S. National Inst. of Standards and Technology},
	organization = {U.S. National Inst. of Standards and Technology},
	abstract = {We describe how components from two distinct multi-document summarization systems were combined. Twenty four possible combinations of components were considered. We observed some contrasts between conservative and aggressive sentence compression (i.e., trimming) in the context of multi-document summarization.
},
	url = {http://duc.nist.gov/},
	author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and O{\textquoteright}Leary, Dianne P. and Conroy,John M. and Schlesinger,Judith D.}
}
@article {14016,
	title = {Spherical and hemispherical microphone arrays for capture and analysis of sound fields},
	journal = {The Journal of the Acoustical Society of America},
	volume = {120},
	year = {2006},
	month = {2006///},
	pages = {3225 - 3225},
	abstract = {The capture of the spatial structure of a sound field and analysis is important in many fields including creating virtual environments, source localization and detection, noise suppression, and beamforming. Spherical microphone arrays are a promising development to help achieve such capture and analysis, and have been studied by several groups. We develop a practical spherical microphone array and demonstrate its utility in applications for sound capture, room measurement and for beamforming and tracking. To accommodate equipment failure and manufacturing imprecision we extend their theory to handle arbitrary microphone placement. To handle speech capture and surveillance we describe the development of a new sensor, the hemispherical microphone array. For each array the practical performance follows that predicted by theory. Future applications and improvements are also discussed. [Work supported by NSF.]},
	url = {http://link.aip.org/link/?JAS/120/3225/3},
	author = {Duraiswami, Ramani and Zhiyun Li and Zotkin,Dmitry N and Grassi,Elena}
}
@article {17663,
	title = {System and method for locating a closest server in response to a client ...},
	volume = {09/726,192},
	year = {2006},
	month = {2006/03/28/},
	abstract = {A scalable system and method for locating a closest server in response to a client request via an interactive distribution network, such as the Internet, are provided. A closest content server is defined as having the least round trip time for responding to a client request. The system including a plurality of content servers; and a local server in communication with a plurality of clients, the local server acting as a proxy for communicating client requests from clients to a redirection server. Client network distance and load information is periodically collected at each content server in the network from clients communicating with each of the respective content servers. The redirection server periodically aggregates the network distance and load information from each content server to create client clusters from both current and previously aggregated network distance and load information. Each client cluster represents a division or partition of the total IP address space. Each...},
	url = {http://www.google.com/patents?id=cE54AAAAEBAJ},
	author = {Andrews,Matthew and Hofmann,Markus and Shepherd,Bruce and Srinivasan, Aravind and Winkler,Peter and Zane,Francis},
	editor = {Lucent Technologies Inc.}
}
@conference {14442,
	title = {Is there a grand challenge or X-prize for data mining?},
	booktitle = {Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining},
	series = {KDD {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {954 - 956},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This panel will discuss possible exciting and motivating Grand Challenge problems for Data Mining, focusing on bioinformatics, multimedia mining, link mining, text mining, and web mining.},
	keywords = {Bioinformatics, data mining, grand challenge, image mining, link mining, multimedia mining, text mining, video mining, web mining, X-prize},
	isbn = {1-59593-339-5},
	doi = {10.1145/1150402.1150535},
	url = {http://doi.acm.org/10.1145/1150402.1150535},
	author = {Piatetsky-Shapiro,Gregory and Grossman,Robert and Djeraba,Chabane and Feldman,Ronen and Getoor, Lise and Zaki,Mohammed}
}
@article {14085,
	title = {Trypanosoma cruzi mitochondrial maxicircles display species- and strain-specific variation and a conserved element in the non-coding region},
	journal = {BMC Genomics},
	volume = {7},
	year = {2006},
	month = {2006///},
	pages = {60 - 60},
	abstract = {BACKGROUND:The mitochondrial DNA of kinetoplastid flagellates is distinctive in the eukaryotic world due to its massive size, complex form and large sequence content. Comprised of catenated maxicircles that contain rRNA and protein-coding genes and thousands of heterogeneous minicircles encoding small guide RNAs, the kinetoplast network has evolved along with an extreme form of mRNA processing in the form of uridine insertion and deletion RNA editing. Many maxicircle-encoded mRNAs cannot be translated without this post-transcriptional sequence modification.RESULTS:We present the complete sequence and annotation of the Trypanosoma cruzi maxicircles for the CL Brener and Esmeraldo strains. Gene order is syntenic with Trypanosoma brucei and Leishmania tarentolae maxicircles. The non-coding components have strain-specific repetitive regions and a variable region that is unique for each strain with the exception of a conserved sequence element that may serve as an origin of replication, but shows no sequence identity with L. tarentolae or T. brucei. Alternative assemblies of the variable region demonstrate intra-strain heterogeneity of the maxicircle population. The extent of mRNA editing required for particular genes approximates that seen in T. brucei. Extensively edited genes were more divergent among the genera than non-edited and rRNA genes. Esmeraldo contains a unique 236-bp deletion that removes the 5{\textquoteright}-ends of ND4 and CR4 and the intergenic region. Esmeraldo shows additional insertions and deletions outside of areas edited in other species in ND5, MURF1, and MURF2, while CL Brener has a distinct insertion in MURF2.CONCLUSION:The CL Brener and Esmeraldo maxicircles represent two of three previously defined maxicircle clades and promise utility as taxonomic markers. Restoration of the disrupted reading frames might be accomplished by strain-specific RNA editing. Elements in the non-coding region may be important for replication, transcription, and anchoring of the maxicircle within the kinetoplast network.},
	isbn = {1471-2164},
	doi = {10.1186/1471-2164-7-60},
	url = {http://www.biomedcentral.com/1471-2164/7/60},
	author = {Westenberger,Scott and Cerqueira,Gustavo and El-Sayed, Najib M. and Zingales,Bianca and Campbell,David and Sturm,Nancy}
}
@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}
}
@article {14363,
	title = {What are the grand challenges for data mining? - KDD-2006 panel report},
	journal = {ACM SIGKDD Explorations Newsletter},
	volume = {8},
	year = {2006},
	month = {2006///},
	pages = {70 - 77},
	abstract = {We discuss what makes exciting and motivating Grand Challenge problems for Data Mining, and propose criteria for a good Grand Challenge. We then consider possible GC problems from multimedia mining, link mining, large- scale modeling, text mining, and proteomics. This report is the result of a panel held at KDD-2006 conference.},
	author = {Piatetsky-Shapiro,G. and Djeraba,C. and Getoor, Lise and Grossman,R. and Feldman,R. and Zaki,M.}
}
@article {18168,
	title = {Anti-collusion forensics of multimedia fingerprinting using orthogonal modulation},
	journal = {Image Processing, IEEE Transactions on},
	volume = {14},
	year = {2005},
	month = {2005/06//},
	pages = {804 - 821},
	abstract = {Digital fingerprinting is a method for protecting digital data in which fingerprints that are embedded in multimedia are capable of identifying unauthorized use of digital content. A powerful attack that can be employed to reduce this tracing capability is collusion, where several users combine their copies of the same content to attenuate/remove the original fingerprints. In this paper, we study the collusion resistance of a fingerprinting system employing Gaussian distributed fingerprints and orthogonal modulation. We introduce the maximum detector and the thresholding detector for colluder identification. We then analyze the collusion resistance of a system to the averaging collusion attack for the performance criteria represented by the probability of a false negative and the probability of a false positive. Lower and upper bounds for the maximum number of colluders K<sub>max</sub> are derived. We then show that the detectors are robust to different collusion attacks. We further study different sets of performance criteria, and our results indicate that attacks based on a few dozen independent copies can confound such a fingerprinting system. We also propose a likelihood-based approach to estimate the number of colluders. Finally, we demonstrate the performance for detecting colluders through experiments using real images.},
	keywords = {Automated;Product Labeling;Signal Processing, Computer-Assisted;, Computer-Assisted;Multimedia;Patents as Topic;Pattern Recognition, Gaussian distribution;anticollusion forensic;colluder identification;collusion resistance;digital fingerprinting;false probability;likelihood-based approach;multimedia fingerprinting;orthogonal modulation;spread spectrum embedding;Gaussian distribution;fi},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2005.847284},
	author = {Wang,Z.J. and M. Wu and Zhao,H.V. and Trappe,W. and Liu,K. J.R}
}
@article {13498,
	title = {AParallel-Line Detection Algorithm Based on HMMDecoding},
	journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
	volume = {27},
	year = {2005},
	month = {2005/05//},
	pages = {777 - 792},
	abstract = {The detection of groups of parallel lines is important in applications such as form processing and text (handwriting) extraction from rule lined paper. These tasks can be very challenging in degraded documents where the lines are severely broken. In this paper we propose a novel model-based method which incorporates high level context to detect these lines. After preprocessing (such as skew correction and text filtering), we use trained Hidden Markov Models (HMM) to locate the optimal positions of all lines simultaneously on the horizontal or vertical projection profiles, based on the Viterbi decoding. The algorithm is trainable so it can be easily adapted to different application scenarios. The experiments conducted on known form processing and rule line detection show our method is robust, and achieves better results than other widely used line detection methods.},
	author = {Yefeng Zheng and Huiping Li and David Doermann}
}
@conference {12649,
	title = {Appearance modeling under geometric context},
	booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/10//},
	pages = {1252 -1259 Vol. 2 - 1252 -1259 Vol. 2},
	abstract = {We propose a unified framework based on a general definition of geometric transform (GeT) for modeling appearance. GeT represents the appearance by applying designed functionals over certain geometric sets. We show that image warping, Radon transform, trace transform, etc. are special cases of our definition. Moreover, three different types of GeTs are designed to handle deformation, articulation and occlusion and applied to fingerprinting the appearance inside a contour. They include the contour-driven GeT, the feature curve based GeT and selecting functionals to model the appearance inside the convex hull of the contour. A multi-resolution representation that combines both shape and appearance information is also proposed. We apply our approach to image synthesis and object recognition. The proposed approach produces promising results when applied to fingerprinting the appearance of human and body parts despite the challenges due to articulated motion and deformations},
	keywords = {based, curve, geometry;image, GeT;convex, GeT;fingerprinting;geometric, hull;feature, information;trace, modeling;contour-driven, Radon, recognition;, recognition;shape, representation;object, synthesis;image, transform;appearance, transform;image, transform;Radon, transforms;computational, warping;multi-resolution},
	doi = {10.1109/ICCV.2005.38},
	author = {Li,Jian and Zhou,S. K and Chellapa, Rama}
}
@conference {17789,
	title = {Approximation results for probabilistic survivability},
	booktitle = {Multi-Agent Security and Survivability, 2005 IEEE 2nd Symposium on},
	year = {2005},
	month = {2005/08//},
	pages = {1 - 10},
	abstract = {As multiagent systems (MASs) are increasingly used in industrial applications, the need to make them more robust and resilient against disruption increases dramatically. The author has developed a probabilistic model (assuming complete ignorance of dependencies between node failures) of survivability based on deploying each agent in a MAS on one or more nodes. Finding a deployment that maximizes survivability is highly intractable for two reasons: firstly, computing the survivability of any deployment is intractable, and secondly, going through an exponential number of deployments to find the best one adds another layer of intractability. In this paper, we study what happens when node failures are independent. We show that computing survivability in this environment is still intractable. We propose various heuristics to compute the survivability of a given deployment. We have implemented and tested all these heuristics. We report on the advantages and disadvantages of different heuristics in different environmental settings.},
	keywords = {application;, computing;, failure;, fault, heuristic, heuristics, industrial, model;, multi-agent, multiagent, node, probabilistic, probability;, programming;, survivability;, system;, systems;, testing;, tolerant},
	doi = {10.1109/MASSUR.2005.1507042},
	author = {Zhang,Y. and Manister,E. and Kraus,S. and V.S. Subrahmanian}
}
@article {12661,
	title = {Bayesian algorithms for simultaneous structure from motion estimation of multiple independently moving objects},
	journal = {Image Processing, IEEE Transactions on},
	volume = {14},
	year = {2005},
	month = {2005/01//},
	pages = {94 - 109},
	abstract = {The problem of simultaneous structure from motion estimation for multiple independently moving objects from a monocular image sequence is addressed. Two Bayesian algorithms are presented for solving this problem using the sequential importance sampling (SIS) technique. The empirical posterior distribution of object motion and feature separation parameters is approximated by weighted samples. The first algorithm addresses the problem when only two moving objects are present. A singular value decomposition (SVD)-based sample clustering algorithm is shown to be capable of separating samples related to different objects. A pair of SIS procedures is used to track the posterior distribution of the motion parameters. In the second algorithm, a balancing step is added into the SIS procedure to preserve samples of low weights so that all objects have enough samples to propagate empirical motion distributions. By using the proposed algorithms, the relative motions of all the moving objects with respect to the camera can be simultaneously estimated. Both algorithms have been tested on synthetic and real- image sequences. Improved results have been achieved.},
	keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Bayesian algorithm;clustering algorithm;empirical posterior distribution;feature separation parameter;monocular image sequence;motion estimation;multiple independently moving object;object motion;real-image sequence;sequential importance sampling techniqu, Biological;Models, Computer-Assisted;Imaging, Computer-Assisted;Pattern Recognition, Computer-Assisted;Subtraction Technique;Video Recording;Walking;, Statistical;Movement;Numerical Analysis, Three-Dimensional;Information Storage and Retrieval;Models},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2004.837551},
	author = {Qian,Gang and Chellapa, Rama and Qinfen Zheng}
}
@inbook {12669,
	title = {Beyond one still image: Face recognition from multiple still images or a video sequence},
	booktitle = {Face ProcessingFace Processing},
	year = {2005},
	month = {2005///},
	pages = {547 - 575},
	publisher = {Academic Press},
	organization = {Academic Press},
	address = {Burlington},
	abstract = {While face recognition (FR) from a single still image has been extensively studied over a decade, FR based on a group of still images (also referred to as multiple still images) or a video sequence is an emerging topic. This is mainly evidenced by the growing increase in the literature. For instance, a research initiative called Face Recognition Grand Challenge [1] has been organized. One specific challenge directly addresses the use of multiple still images to improve the recognition accuracy significantly [3]. Recently a workshop jointly held with CVPR 2004 was devoted to face processing in video [2]. It is predictable that, with the ubiquity of video sequences, face recognition based on video sequences will become more and more popular.},
	isbn = {978-0-12-088452-0},
	url = {http://www.sciencedirect.com/science/article/pii/B9780120884520500182},
	editor = {Zhao,Wenyi and Chellapa, Rama}
}
@article {16696,
	title = {The Bible and multilingual optical character recognition},
	journal = {Communications of the ACM},
	volume = {48},
	year = {2005},
	month = {2005///},
	pages = {124 - 130},
	author = {Kanungo,T. and Resnik, Philip and Mao,S. and Kim,D.W. and Zheng,Q.}
}
@conference {13200,
	title = {Closely coupled object detection and segmentation},
	booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on},
	volume = {1},
	year = {2005},
	month = {2005///},
	pages = {454 - 461},
	abstract = {We propose a closely coupled object detection and segmentation algorithm for enhancing both processes in a cooperative and iterative manner. Figure-ground segmentation reduces the effect of background clutter on template matching; the matched template provides shape constraints on segmentation. More precisely, we estimate the probability of each pixel belonging to the foreground by a weighted sum of the estimates based on shape and color alone. The weight on the shape-based estimate is related to the probability that a familiar object is present and is updated dynamically so that we enforce shape constraints only where the object is present. Experiments on detecting people in images of cluttered scenes demonstrate that the proposed algorithm improves both segmentation and detection. More accurate object boundaries are extracted; higher object detection rates and lower false alarm rates are achieved than performing the two processes separately or sequentially.},
	author = {Zhao, L. and Davis, Larry S.}
}
@article {18175,
	title = {Collusion resistance analysis of multimedia fingerprinting systems},
	journal = {IEEE Tran. on Image Processing},
	year = {2005},
	month = {2005///},
	author = {Wang,Z.J. and Wu,M. and Zhao,H.V. and Trappe,W. and Liu,K. J.R}
}
@article {17018,
	title = {Colour-coded pixel-based highly interactive Web mapping for georeferenced data exploration},
	journal = {International Journal of Geographical Information Science},
	volume = {19},
	year = {2005},
	month = {2005///},
	pages = {413 - 428},
	abstract = {This paper describes a pixel?based technique that enables highly interactive Web choropleth maps for georeferenced data publishing and visual exploration. Instead of delivering geographic knowledge to the client in polygon?based vector formats, we encode geographic object IDs and shape information into highly compact pixel images (decoding maps). This allows the combination of raster and vector characteristics while avoiding the problems in the currently existing pixel?based (raster?image?based) or vector?based techniques. Differing from traditional pixel?based techniques that are static and allow very little user interaction, our pixel?based technique allows varieties of sub?second (less than 1?s) interface controls such as dynamic query, dynamic classification, geographic object data identification, user?setting adjusting, as well as turning on/off layers, panning and zooming, with no or minimum server support. Compared with Web GIS techniques that use vector geographic data, our technique avoids transferring over the network large vector geographic data. It also avoids the non?trivial client?side computation to interpret the vector data and render the maps. Our technique features a short initial download time, near?constant performance scalability for larger numbers of geographic objects, and download?map?segment?only?when?necessary which potentially reduces the overall data transfer over the network. As a result, it accommodates general public users with slow modem network connections and low?end machines, as well as users with fast T?1 connections and fast machines. The client?side (browser) is implemented as lightweight Java applets. YMap, an easy?to?use, user?task?oriented highly interactive mapping tool for visual georeferenced data exploration is implemented using this technique. The performance comparison of YMap to some other vector?based Web GIS demonstrates the feasibility and benefits of this technique.This paper describes a pixel?based technique that enables highly interactive Web choropleth maps for georeferenced data publishing and visual exploration. Instead of delivering geographic knowledge to the client in polygon?based vector formats, we encode geographic object IDs and shape information into highly compact pixel images (decoding maps). This allows the combination of raster and vector characteristics while avoiding the problems in the currently existing pixel?based (raster?image?based) or vector?based techniques. Differing from traditional pixel?based techniques that are static and allow very little user interaction, our pixel?based technique allows varieties of sub?second (less than 1?s) interface controls such as dynamic query, dynamic classification, geographic object data identification, user?setting adjusting, as well as turning on/off layers, panning and zooming, with no or minimum server support. Compared with Web GIS techniques that use vector geographic data, our technique avoids transferring over the network large vector geographic data. It also avoids the non?trivial client?side computation to interpret the vector data and render the maps. Our technique features a short initial download time, near?constant performance scalability for larger numbers of geographic objects, and download?map?segment?only?when?necessary which potentially reduces the overall data transfer over the network. As a result, it accommodates general public users with slow modem network connections and low?end machines, as well as users with fast T?1 connections and fast machines. The client?side (browser) is implemented as lightweight Java applets. YMap, an easy?to?use, user?task?oriented highly interactive mapping tool for visual georeferenced data exploration is implemented using this technique. The performance comparison of YMap to some other vector?based Web GIS demonstrates the feasibility and benefits of this technique.
},
	isbn = {1365-8816},
	doi = {10.1080/1365881051233125120},
	url = {http://www.tandfonline.com/doi/abs/10.1080/1365881051233125120},
	author = {Zhao,Haixia and Shneiderman, Ben}
}
@conference {14777,
	title = {Combining self-reported and automatic data to improve programming effort measurement},
	booktitle = {Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering},
	series = {ESEC/FSE-13},
	year = {2005},
	month = {2005///},
	pages = {356 - 365},
	publisher = {ACM},
	organization = {ACM},
	address = {Lisbon, Portugal},
	abstract = {Measuring effort accurately and consistently across subjects in a programming experiment can be a surprisingly difficult task. In particular, measures based on self-reported data may differ significantly from measures based on data which is recorded automatically from a subject{\textquoteright}s computing environment. Since self-reports can be unreliable, and not all activities can be captured automatically, a complete measure of programming effort should incorporate both classes of data. In this paper, we show how self-reported and automatic effort can be combined to perform validation and to measure total programming effort.},
	keywords = {effort, experimentation, human factors, manual approaches, measurement, process metrics, verification},
	isbn = {1-59593-014-0},
	doi = {10.1145/1081706.1081762},
	author = {Hochstein, Lorin and Basili, Victor R. and Zelkowitz, Marvin V and Hollingsworth, Jeffrey K and Carver, Jeff}
}
@inbook {17795,
	title = {Distributed Algorithms for Dynamic Survivability of Multiagent Systems},
	booktitle = {Computational Logic in Multi-Agent SystemsComputational Logic in Multi-Agent Systems},
	series = {Lecture Notes in Computer Science},
	volume = {3259},
	year = {2005},
	month = {2005///},
	pages = {139 - 144},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Though multiagent systems (MASs) are being increasingly used, few methods exist to ensure survivability of MASs. All existing methods suffer from two flaws. First, a centralized survivability algorithm (CSA) ensures survivability of the MAS {\textendash} unfortunately, if the node on which the CSA exists goes down, the survivability of the MAS is questionable. Second, no mechanism exists to change how the MAS is deployed when external factors trigger a re-evaluation of the survivability of the MAS. In this paper, we present three algorithms to address these two important problems. Our algorithms can be built on top of any CSA. Our algorithms are completely distributed and can handle external triggers to compute a new deployment. We report on experiments assessing the efficiency of these algorithms.},
	keywords = {Computer, Science},
	isbn = {978-3-540-24010-5},
	url = {http://dx.doi.org/10.1007/978-3-540-30200-1_1},
	author = {Subrahmanian,V. and Kraus,Sarit and Zhang,Yingqian},
	editor = {Dix,J{\"u}rgen and Leite,Jo{\~a}o}
}
@conference {13539,
	title = {DOCLIB: A document processing research tool},
	booktitle = {Symposium on Document Image Understanding Technology},
	year = {2005},
	month = {2005///},
	pages = {159 - 163},
	abstract = {Often, valuable document processing intellectual capital is lost due to staff transitions or project restructuring prior to technology transfer. Furthermore, hardware and software integrity, dependencies, and compatibility are critical components that often impede technology migration. While many open source tools attempt to mitigate these issues, they do not always address specific design needs and tailored-process that Government organizations must adhere to. This paper addresses the need for a common document processing research vehicle through which institutions can develop and share research-related software and applications across academic, business, and Government domains.},
	author = {Chen,Kevin and Jaeger,Stefan and Zhu,Guangyu and David Doermann}
}
@article {17107,
	title = {Dynamic Query Chloropleth Maps for Information Seeking and Decision Making (2003)},
	year = {2005},
	month = {2005///},
	abstract = {Information retrieval and visualization can be combined in dynamic query systems that allow users unparalleled access to information for decision making. In this paper, we report on the development and evaluation of a dynamic query system (YMap) that displays information on a chloropleth map using double thumb sliders to select ranges of query variables. The YMap prototype is a Java-Applet that supports panning and zooming. Several usability studies were conducted on early prototypes that resulted in the current version. Applications of YMap for decision making tasks are discussed.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6505},
	author = {Norman,Kent L and Zhao,Haixia and Shneiderman, Ben and Golub,Evan}
}
@article {14687,
	title = {Dynamic updating of information-flow policies},
	journal = {Proceedings of the International Workshop on Foundations of Computer Security (FCS)},
	year = {2005},
	month = {2005///},
	author = {Hicks, Michael W. and Tse,S. and Hicks,B. and Zdancewic,S.}
}
@conference {12852,
	title = {Efficient temporal-logic query checking for presburger systems},
	booktitle = {Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering},
	series = {ASE {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {24 - 33},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper develops a framework for solving temporal-logic query-checking problems for a class of infinite-state system models that compute with integer-valued variables (so-called Presburger systems, in which Presburger formulas are used to define system behavior). The temporal-logic query checking problem may be formulated as follows: given a model and a temporal logic formula with placeholders, compute a set of assignments of formulas to placeholders such that the resulting temporal formula is satisfied by the given model. Temporal-logic query checking has proved useful as a means for requirements and design understanding; existing work, however, has focused only on propositional temporal logic and finite-state systems.Our method is based on a symbolic model-checking technique that relies on proof search. The paper first introduces this model-checking approach and then shows how it can be adapted to solving the temporal queries in which formulas may contain integer variables. We also present experimental results showing the computational efficacy of our approach.},
	keywords = {Formal Methods, Model checking, on-the-fly symbolic model checking, Presburger systems, query checking},
	isbn = {1-58113-993-4},
	doi = {10.1145/1101908.1101915},
	url = {http://doi.acm.org/10.1145/1101908.1101915},
	author = {Zhang,Dezhuang and Cleaveland, Rance}
}
@article {15441,
	title = {An evolutionary testbed for software technology evaluation},
	journal = {Innovations in Systems and Software Engineering},
	volume = {1},
	year = {2005},
	month = {2005///},
	pages = {3 - 11},
	abstract = {Empirical evidence and technology evaluation are needed to close the gap between the state of the art and the state of the practice in software engineering. However, there are difficulties associated with evaluating technologies based on empirical evidence: insufficient specification of context variables, cost of experimentation, and risks associated with trying out new technologies. In this paper, we propose the idea of an evolutionary testbed for addressing these problems. We demonstrate the utility of the testbed in empirical studies involving two different research technologies applied to the testbed, as well as the results of these studies. The work is part of NASArsquos High Dependability Computing Project (HDCP), in which we are evaluating a wide range of new technologies for improving the dependability of NASA mission-critical systems.},
	doi = {10.1007/s11334-005-0007-z},
	author = {Lindvall,M. and Rus,I. and Shull, F. and Zelkowitz, Marvin V and Donzelli,P. and Memon, Atif M. and Basili, Victor R. and Costa,P. and Tvedt,R. and Hochstein, L.}
}
@article {12820,
	title = {Fast generic model-checking for data-based systems},
	journal = {Formal Techniques for Networked and Distributed Systems-FORTE 2005},
	year = {2005},
	month = {2005///},
	pages = {83 - 97},
	author = {Zhang,D. and Cleaveland, Rance}
}
@conference {12815,
	title = {Fast on-the-fly parametric real-time model checking},
	booktitle = {Real-Time Systems Symposium, 2005. RTSS 2005. 26th IEEE International},
	year = {2005},
	month = {2005///},
	pages = {10{\textendash}pp - 10{\textendash}pp},
	author = {Zhang,D. and Cleaveland, Rance}
}
@article {18216,
	title = {Forensic analysis of nonlinear collusion attacks for multimedia fingerprinting},
	journal = {Image Processing, IEEE Transactions on},
	volume = {14},
	year = {2005},
	month = {2005/05//},
	pages = {646 - 661},
	abstract = {Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Unique identification information is embedded into each distributed copy of multimedia signal and serves as a digital fingerprint. Collusion attack is a cost-effective attack against digital fingerprinting, where colluders combine several copies with the same content but different fingerprints to remove or attenuate the original fingerprints. In this paper, we investigate the average collusion attack and several basic nonlinear collusions on independent Gaussian fingerprints, and study their effectiveness and the impact on the perceptual quality. With unbounded Gaussian fingerprints, perceivable distortion may exist in the fingerprinted copies as well as the copies after the collusion attacks. In order to remove this perceptual distortion, we introduce bounded Gaussian-like fingerprints and study their performance under collusion attacks. We also study several commonly used detection statistics and analyze their performance under collusion attacks. We further propose a preprocessing technique of the extracted fingerprints specifically for collusion scenarios to improve the detection performance.},
	keywords = {Automated;Product Labeling;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, bounded Gaussian-like fingerprint;detection statistics;digital fingerprinting;forensic analysis;independent Gaussian fingerprint;multimedia content;multimedia fingerprinting;nonlinear collusion attack;perceptual distortion;perceptual quality;preprocessing, Computer-Assisted;, Computer-Assisted;Models, Statistical;Nonlinear Dynamics;Patents as Topic;Pattern Recognition},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2005.846035},
	author = {Zhao,H.V. and M. Wu and Wang,Z.J. and Liu,K. J.R}
}
@conference {18394,
	title = {Generating testable hypotheses from tacit knowledge for high productivity computing},
	booktitle = {Proceedings of the second international workshop on Software engineering for high performance computing system applications},
	series = {SE-HPCS {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {17 - 21},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {In this research, we are developing our understanding of how the high performance computing community develops effective parallel implementations of programs by collecting the folklore within the community. We use this folklore as the basis for a series of experiments, which we expect, will validate or negate these assumptions.},
	keywords = {folklore elicitation, high productivity development time experimental studies, hypothesis generation, tacit knowledge solicitation, testable hypotheses},
	isbn = {1-59593-117-1},
	doi = {10.1145/1145319.1145325},
	url = {http://doi.acm.org/10.1145/1145319.1145325},
	author = {Asgari, Sima and Hochstein, Lorin and Basili, Victor R. and Zelkowitz, Marvin V and Hollingsworth, Jeffrey K and Carver, Jeff and Shull, Forrest}
}
@conference {13563,
	title = {Handwriting matching and its application to handwriting synthesis},
	booktitle = {Document Analysis and Recognition, 2005. Proceedings. Eighth International Conference on},
	year = {2005},
	month = {2005/09/01/aug},
	pages = {861 - 865 Vol. 2 - 861 - 865 Vol. 2},
	abstract = {Since it is extremely expensive to collect a large volume of handwriting samples, synthesized data are often used to enlarge the training set. We argue that, in order to generate good handwriting samples, a synthesis algorithm should learn the shape deformation characteristics of handwriting from real samples. In this paper, we present a point matching algorithm to learn the deformation, and apply it to handwriting synthesis. Preliminary experiments show the advantages of our approach.},
	keywords = {(artificial, deformation, deformation;, handwriting, image, intelligence);, learning, learning;, matching;, point, recognition;, sampling;, SHAPE, synthesis;},
	doi = {10.1109/ICDAR.2005.122},
	author = {Yefeng Zheng and David Doermann}
}
@article {13784,
	title = {Headline Generation for Written and Broadcast News},
	year = {2005},
	month = {2005/03//},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This technical report is an overview of work done on Headline Generation for written and broadcast news. The report covers HMM Hedge, a statistical approach based on the noisy channel model, Hedge Trimmer, a parse-and-trim approach using linguistically motivated trimming rules, and Topiary, a combination of Trimmer and Unsupervised Topic Discovery. Automatic evaluation of summaries using ROUGE and BLEU is described and used to evaluate the Headline Generation systems.},
	keywords = {*INFORMATION RETRIEVAL, *RADIO BROADCASTING, AUTOMATIC, AUTOMATIC SUMMARIZATION, HEDGE TRIMMER, INFORMATION SCIENCE, RADIO COMMUNICATIONS, STATISTICAL PROCESSES, TEST AND EVALUATION, WORDS(LANGUAGE)},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA454198},
	author = {Zajic, David and Dorr, Bonnie J and Schwartz,Richard}
}
@article {14031,
	title = {High Order Spatial Audio Capture and Binaural Head-Tracked Playback over Headphones with HRTF Cues},
	journal = {Proceedings 119th convention of AES},
	year = {2005},
	month = {2005///},
	abstract = {A theory and a system for capturing an audio scene and then rendering it remotely are developed andpresented. The sound capture is performed with a spherical microphone array. The sound field at the location
of the array is deduced from the captured sound and is represented using either spherical wave-functions or
plane-wave expansions. The sound field representation is then transmitted to a remote location for immediate
rendering or stored for later use. The sound renderer, coupled with the head tracker, reconstructs the acoustic
field using individualized head-related transfer functions to preserve the perceptual spatial structure of the
audio scene. Rigorous error bounds and Nyquist-like sampling criterion for the representation of the sound
field are presented and verified.
},
	author = {Duraiswami, Ramani and Zotkin,Dmitry N and Li,Z. and Grassi,E. and Gumerov, Nail A. and Davis, Larry S.}
}
@conference {14021,
	title = {High Order Spatial Audio Capture and Its Binaural Head-Tracked Playback Over Headphones with HRTF Cues},
	booktitle = {Audio Engineering Society Convention 119},
	year = {2005},
	month = {2005/10//},
	url = {http://www.aes.org/e-lib/browse.cfm?elib=13369},
	author = {Zotkin,Dmitry N}
}
@conference {13199,
	title = {High Order Spatial Audio Capture and Its Binaural Head-Tracked Playback Over Headphones with HRTF Cues},
	booktitle = {Audio Engineering Society Convention 119},
	year = {2005},
	month = {2005///},
	url = {http://www.aes.org/e-lib/browse.cfm?elib=13369},
	author = {Zotkin,Dmitry N and Davis, Larry S. and Duraiswami, Ramani and Grassi,Elena and Gumerov, Nail A. and Zhiyun,Li}
}
@conference {18482,
	title = {High Order Spatial Audio Capture and Its Binaural Head-Tracked Playback Over Headphones with HRTF Cues},
	booktitle = {Audio Engineering Society Convention 119},
	year = {2005},
	month = {2005///},
	abstract = {A theory and a system for capturing an audio scene and then rendering it remotely are developed and presented. The sound capture is performed with a spherical microphone array. The sound field at the location, and in a region of space in the neighborhood, of the array is deduced from the captured sound and represented using either spherical wave-functions or plane-wave expansions. The representation is then transmitted to a remote location for immediate rendering or stored for later reproduction. The sound renderer, coupled with the head tracker, reconstructs the acoustic field using individualized head-related transfer functions to preserve the perceptual spatial structure of the audio scene. Rigorous error bounds and a Nyquist-like sampling criterion for the representation of the sound field are presented and verified.},
	author = {Davis, Larry S. and Duraiswami, Ramani and Grassi,E. and Gumerov, Nail A. and Li,Z. and Zotkin,Dmitry N}
}
@conference {16099,
	title = {"I hear the pattern": interactive sonification of geographical data patterns},
	booktitle = {CHI {\textquoteright}05 extended abstracts on Human factors in computing systems},
	series = {CHI EA {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {1905 - 1908},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Interactive sonification (non-speech sound) is a novel strategy to present the geographical distribution patterns of statistical data to vision impaired users. We discuss the design space with dimensions of interaction actions, data representation forms, input devices, navigation structures, and sound feedback encoding. Two interfaces were designed, one using a keyboard and another using a smooth surface touch tablet. A study with three blind users shows that they are able to perceive patterns of 5-category values on both familiar and unknown maps, and learn new map geography, in both interfaces.},
	keywords = {auditory user interfaces, information seeking, sonification, universal usability, vision impairment},
	isbn = {1-59593-002-7},
	doi = {10.1145/1056808.1057052},
	url = {http://doi.acm.org/10.1145/1056808.1057052},
	author = {Zhao,Haixia and Plaisant, Catherine and Shneiderman, Ben}
}
@article {12660,
	title = {Image-based face recognition under illumination and pose variations},
	journal = {Journal of the Optical Society of America AJ. Opt. Soc. Am. A},
	volume = {22},
	year = {2005},
	month = {2005/02/01/},
	pages = {217 - 229},
	abstract = {We present an image-based method for face recognition across different illuminations and poses, where the term image-based means that no explicit prior three-dimensional models are needed. As face recognition under illumination and pose variations involves three factors, namely, identity, illumination, and pose, generalizations in all these three factors are desired. We present a recognition approach that is able to generalize in the identity and illumination dimensions and handle a given set of poses. Specifically, the proposed approach derives an identity signature that is illumination- and pose-invariant, where the identity is tackled by means of subspace encoding, the illumination is characterized with a Lambertian reflectance model, and the given set of poses is treated as a whole. Experimental results using the Pose, Illumination, and Expression (PIE) database demonstrate the effectiveness of the proposed approach.},
	keywords = {illumination, pattern recognition},
	doi = {10.1364/JOSAA.22.000217},
	url = {http://josaa.osa.org/abstract.cfm?URI=josaa-22-2-217},
	author = {Zhou,Shaohua Kevin and Chellapa, Rama}
}
@article {17221,
	title = {Image-Based Highly Interactive Web Mapping for Geo-Referenced Data Publishing (2002)},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {This paper describes an image-based technique that enables highly interactive Web choropleth maps for geo-referenced data publishing and visual exploration. Geographic knowledge is encoded into raster images and delivered to the client, instead of in vector formats. Differing from traditional raster-imagebased approaches that are static and allow very little user interaction, it allows varieties of sub-second fine-grained interface controls such as dynamic query, dynamic classification, geographic object data identification, user setting adjusting, as well as turning on/off layers, panning and zooming, with no or minimum server support. Compared to Web GIS approaches that are based on vector geographic data, this technique has the features of short initial download time, near-constant performance scalability for larger numbers of geographic objects, and download-map-segment-only-when-necessary which potentially reduces the overall data transfer over the network. As a result, it accommodates general public users with slow modem network connections and low-end machines, as well as users with fast T-1 connections and fast machines. The client-side (browser) is implemented as light-weight Java applets. YMap, an easy-to-use, user-task-oriented highly interactive mapping tool prototype for visual georeferenced data exploration is implemented using this technique.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6498},
	author = {Zhao,Haixia and Shneiderman, Ben}
}
@article {17223,
	title = {Improving Accessibility and Usability of Geo-referenced Statistical Data (2003)},
	year = {2005},
	month = {2005///},
	abstract = {Several technology breakthroughs are needed to achieve the goals of universal accessibility and usability. These goals are especially challenging in the case of geo-referenced statistical data that many U.S. government agencies supply. We present technical and user-interface design challenges in accommodating users with low-end technology (slow network connection and low-end machine) and users who are blind or vision-impaired. Our solutions are presented and future work is discussed.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6502},
	author = {Zhao,Haixia and Plaisant, Catherine and Shneiderman, Ben}
}
@conference {18774,
	title = {Information and Knowledge Modeling for Computer Supported Micro Electro-Mechanical Systems Design and Development},
	year = {2005},
	month = {2005///},
	abstract = {In this paper, we present a preliminary research effort towardsan effective computer support environment for the design and
development of micro-electro-mechanical systems (MEMS).
We first identify the characteristics of MEMS product design
and development processes and examine the state-of-the-art of
MEMS Computer-aided Design (CAD) and simulation systems.
We then propose a function-(environment-effect)-behavior-
(principle-state)-form (FEEBPSF) framework based on the
NIST core product model and its extensions for modeling
MEMS products, and apply the OESM (open embedded system
model) developed to model information and knowledge for
embedded MEMS design and development. Moreover, in order
to tackle the knowledge-intensive tasks of design and
development for MEMS products, we develop a general and
flexible knowledge repository, called KR-MEMS, based on the
FEEBPSF framework and the Unified Modeling Language
(UML)/ Extensible Markup Language (XML) model, and
integrate KR-MEMS into a web-based MEMS design support
system. Throughout the paper, a micro fluidic dispensing device
(a biomedical device for drug-delivery) is used as an example to
illustrate the concepts, models, and knowledge bases necessary
to support the MEMS product design and development.
},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.160.7822\&rep=rep1\&type=pdf},
	author = {Zha,X. F. and Sriram,R.D. and Gupta,S.K.}
}
@article {17247,
	title = {Interactive Color Mosaic and Dendogram Displays for Signal/Noise Optimization in Microarray Data Analysis (2003)},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {Data analysis and visualization is strongly influenced by noise and noise filters. There are multiple sources of oisein microarray data analysis, but signal/noise ratios are rarely optimized, or even considered. Here, we report a noise analysis of a novel 13 million oligonucleotide dataset - 25 human U133A (~500,000 features) profiles of patient muscle biposies. We use our recently described interactive visualization tool, the Hierarchical Clustering Explorer (HCE) to systemically address the effect of different noise filters on resolution of arrays into orrectbiological groups (unsupervised clustering into three patient groups of known diagnosis). We varied probe set interpretation methods (MAS 5.0, RMA), resent callfilters, and clustering linkage methods, and investigated the results in HCE. HCE interactive features enabled us to quickly see the impact of these three variables. Dendrogram displays showed the clustering results systematically, and color mosaic displays provided a visual support for the results. We show that each of these three variables has a strong effect on unsupervised clustering. For this dataset, the strength of the biological variable was maximized, and noise minimized, using MAS 5.0, 10\% present call filter, and Average Group Linkage. We propose a general method of using interactive tools to identify the optimal signal/noise balance or the optimal combination of these three variables to maximize the effect of the desired biological variable on data interpretation.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6506},
	author = {Seo,Jinwook and Bakay,Marina and Zhao,Po and Chen,Yi-Wen and Clarkson,Priscilla and Shneiderman, Ben and Hoffman,Eric P}
}
@article {17258,
	title = {Interactive sonification of choropleth maps},
	journal = {IEEE Multimedia},
	volume = {12},
	year = {2005},
	month = {2005/06//April},
	pages = {26 - 35},
	abstract = {Auditory information is an important channel for the visually impaired. Effective sonification (the use of non-speech audio to convey information) promotes equal working opportunities for people with vision impairments by helping them explore data collections for problem solving and decision making. Interactive sonification systems can make georeferenced data accessible to people with vision impairments. The authors compare methods for using sound to encode georeferenced data patterns and for navigating maps.},
	keywords = {audio signal processing, audio user interfaces, Auditory (non-speech) feedback, auditory information, cartography, choropleth maps, data collections, decision making, Evaluation, Feedback, georeferenced data, Guidelines, handicapped aids, Hardware, HUMANS, information resources, interaction style, Interactive sonification, interactive systems, Navigation, nonspeech audio, problem solving, Problem-solving, sound, universal usability, US Government, User interfaces, vision impairments, World Wide Web},
	isbn = {1070-986X},
	doi = {10.1109/MMUL.2005.28},
	author = {Zhao,Haixia and Smith,B. K and Norman,K. and Plaisant, Catherine and Shneiderman, Ben}
}
@article {16095,
	title = {InterSon: Interactive Sonification for Geo-referenced Data Exploration for the Vision Impaired},
	journal = {Tech Report HCIL-2005-13},
	year = {2005},
	month = {2005/05//},
	abstract = {InterSon is an interactive sonification tool that allows vision im-paired users to explore complex geo-referenced statistical data for fact finding, problem solving and decision making. Examples include maps of population density, crime rates or housing prices. The integrated use of sounds and speech allows users to hear the overall distribution of values on maps and to explore the map to get more details. Users can use the standard computer keyboard, or take advantage of special devices such as a touchpad when they are available. Synchronized auditory and visual displays allow the use of residual vision and facilitate collaboration with sighted colleagues.},
	author = {Zhao,H. and Plaisant, Catherine}
}
@conference {16098,
	title = {iSonic: interactive sonification for non-visual data exploration},
	booktitle = {Proceedings of the 7th international ACM SIGACCESS conference on Computers and accessibility},
	series = {Assets {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {194 - 195},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {iSonic is an interactive sonification tool for vision impaired users to explore geo-referenced statistical data, such as population or crime rates by geographical regions. Users use a keyboard or a smooth surface touchpad to interact with coordinated map and table views of the data. The integrated use of musical sounds and speech allows users to grasp the overall data trends and to explore the data to get more details. Scenarios of use are described.},
	keywords = {auditory user interfaces, information seeking, sonification, universal usability, vision impairment},
	isbn = {1-59593-159-7},
	doi = {10.1145/1090785.1090826},
	url = {http://doi.acm.org/10.1145/1090785.1090826},
	author = {Zhao,Haixia and Plaisant, Catherine and Shneiderman, Ben}
}
@conference {13198,
	title = {Kernel-based Bayesian filtering for object tracking},
	booktitle = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on},
	volume = {1},
	year = {2005},
	month = {2005/06//},
	pages = {227 - 234 vol. 1 - 227 - 234 vol. 1},
	abstract = {Particle filtering provides a general framework for propagating probability density functions in nonlinear and non-Gaussian systems. However, the algorithm is based on a Monte Carlo approach and sampling is a problematic issue, especially for high dimensional problems. This paper presents a new kernel-based Bayesian filtering framework, which adopts an analytic approach to better approximate and propagate density functions. In this framework, the techniques of density interpolation and density approximation are introduced to represent the likelihood and the posterior densities by Gaussian mixtures, where all parameters such as the number of mixands, their weight, mean, and covariance are automatically determined. The proposed analytic approach is shown to perform sampling more efficiently in high dimensional space. We apply our algorithm to real-time tracking problems, and demonstrate its performance on real video sequences as well as synthetic examples.},
	keywords = {approach;, approximation;, Bayes, Bayesian, Carlo, density, detection;, filtering;, functions;, Gaussian, interpolation;, kernel-based, methods;, mixtures;, Monte, nonGaussian, nonlinear, object, particle, probability, probability;, processes;, recognition;, sampling, sampling;, sequences;, system;, tracking;, video},
	doi = {10.1109/CVPR.2005.199},
	author = {Han,Bohyung and Zhu,Ying and Comaniciu, D. and Davis, Larry S.}
}
@article {17282,
	title = {Listening to Maps: User Evaluation of Interactive Sonifications of Geo-Referenced Data (2004)},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {In this paper, we summarize the Auditory Information Seeking Principle (AISP) (gist, navigate, filter, and details-ondemand). To improve blind access to geo-referenced statistical data, we developed several interactive sonifications, adhering to the above AISP. Two user studies are presented. In the first user study with nine sighted subjects, a preliminary map design is compared with an enhanced table design. The study shows subjects can recognize geographic data distribution patterns on a real map with 51 geographic regions, in both designs. The map-based design was strongly preferred. The study also shows evidence that AISP conforms to people information seeking strategies. Based on the observations from the first user study, a second user study was conducted with forty-eight sighted subjects comparing four map designs. The effects of using sound to encode vertical geographic positions and two map navigation methods were compared. The result is presented and future work is discussed.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6518},
	author = {Zhao,Haixia and Smith,Benjamin K and Norman,Kent L and Plaisant, Catherine and Shneiderman, Ben}
}
@article {16096,
	title = {Listening to Maps: User Evaluation of Interactive Sonifications of Geo-Referenced Data},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {In this paper, we summarize the Auditory Information Seeking Principle (AISP) (gist, navigate, filter, and details-ondemand). To improve blind access to geo-referenced statistical data, we developed several interactive sonifications, adhering to the above AISP. Two user studies are presented. In the first user study with nine sighted subjects, a preliminary map design is compared with an enhanced table design. The study shows subjects can recognize geographic data distribution patterns on a real map with 51 geographic regions, in both designs. The map-based design was strongly preferred. The study also shows evidence that AISP conforms to people information seeking strategies. Based on the observations from the first user study, a second user study was conducted with forty-eight sighted subjects comparing four map designs. The effects of using sound to encode vertical geographic positions and two map navigation methods were compared. The result is presented and future work is discussed.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6518},
	author = {Zhao,Haixia and Smith,Benjamin K and Norman,Kent L and Plaisant, Catherine and Shneiderman, Ben}
}
@conference {18402,
	title = {Measuring productivity on high performance computers},
	booktitle = {11th IEEE International Symposium on Software Metric},
	year = {2005},
	month = {2005///},
	abstract = {In the high performance computing domain, the speed ofexecution of a program has typically been the primary
performance metric. But productivity is also of concern to
high performance computing developers. In this paper we
will discuss the problems of defining and measuring
productivity for these machines and we develop a model of
productivity that includes both a performance component
and a component that measures the development time of
the program. We ran several experiments using students in
high performance courses at several universities, and we
report on those results with respect to our model of
productivity.
},
	author = {Zelkowitz, Marvin V and Basili, Victor R. and Asgari, S. and Hochstein, L. and Hollingsworth, Jeffrey K and Nakamura, T.}
}
@conference {12659,
	title = {A method for converting a smiling face to a neutral face with applications to face recognition},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/03//},
	pages = {ii/977 - ii/980 Vol. 2 - ii/977 - ii/980 Vol. 2},
	abstract = {The human face displays a variety of expressions, like smile, sorrow, surprise, etc. All these expressions constitute nonrigid motions of various features of the face. These expressions lead to a significant change in the appearance of a facial image which leads to a drop in the recognition accuracy of a face-recognition system trained with neutral faces. There are other factors like pose and illumination which also lead to performance drops. Researchers have proposed methods to tackle the effects of pose and illumination; however, there has been little work on how to tackle expressions. We attempt to address the issue of expression invariant face-recognition. We present preprocessing steps for converting a smiling face to a neutral face. We expect that this would in turn make the vector in the feature space to be closer to the correct vector in the gallery, in an appearance-based face recognition. This conjecture is supported by our recognition results which demonstrate that the accuracy goes up if we include the expression-normalization block.},
	keywords = {appearance-based, Expression, Face, face;, feature, invariant, motion;, neutral, nonrigid, normalization;, recognition;, smiling},
	doi = {10.1109/ICASSP.2005.1415570},
	author = {Ramachandran, M. and Zhou,S. K and Jhalani, D. and Chellapa, Rama}
}
@article {13707,
	title = {A methodology for extrinsic evaluation of text summarization: Does ROUGE correlate},
	journal = {Proceedings of the ACL Workshop on Intrinsic and Extrinsic Evaluation Measures for Machine Translation and/or Summarization},
	year = {2005},
	month = {2005///},
	pages = {1 - 8},
	abstract = {This paper demonstrates the usefulness of sum-maries in an extrinsic task of relevance judgment
based on a new method for measuring agree-
ment, Relevance-Prediction, which compares sub-
jects{\textquoteright} judgments on summaries with their own judg-
ments on full text documents. We demonstrate that,
because this measure is more reliable than previ-
ous gold-standard measures, we are able to make
stronger statistical statements about the benefits of
summarization. We found positive correlations be-
tween ROUGE scores and two different summary
types, where only weak or negative correlations
were found using other agreement measures. How-
ever, we show that ROUGE may be sensitive to the
choice of summarization style. We discuss the im-
portance of these results and the implications for fu-
ture summarization evaluations.
},
	author = {Dorr, Bonnie J and Monz,C. and President,S. and Schwartz,R. and Zajic, David}
}
@inbook {12670,
	title = {Moving Object Detection and Compression in IR Sequences},
	booktitle = {Computer Vision Beyond the Visible SpectrumComputer Vision Beyond the Visible Spectrum},
	series = {Advances in Pattern Recognition},
	year = {2005},
	month = {2005///},
	pages = {141 - 165},
	publisher = {Springer London},
	organization = {Springer London},
	abstract = {We consider the problem of remote surveillance using infrared (IR) sensors. The aim is to use IR image sequences to detect moving objects (humans or vehicles), and to transmit a few {\textquotedblleft}best-view images{\textquotedblright} of every new object that is detected. Since the available bandwidth is usually low, if the object chip is big, it needs to be compressed before being transmitted. Due to low computational power of computing devices attached to the sensor, the algorithms should be computationally simple. We present two approaches for object detection {\textemdash} one which specifically solves the more difficult long-range object detection problem, and the other for objects at short range. For objects at short range, we also present techniques for selecting a single best-view object chip and computationally simple techniques for compressing it to very low bit rates due to the channel bandwidth constraint. A fast image chip compression scheme implemented in the wavelet domain by combining a non-iterative zerotree coding method with 2D-DPCM for both low-and high-frequency subbands is presented. Comparisons with some existing schemes are also included. The object detection and compression algorithms have been implemented in C/C++ and their performance has been evaluated using the Hitachi{\textquoteright}s SH4 platform with software simulation.},
	isbn = {978-1-84628-065-8},
	url = {http://dx.doi.org/10.1007/1-84628-065-6_5},
	author = {Vaswani,Namrata and Agrawal,Amit and Qinfen Zheng and Chellapa, Rama},
	editor = {Bhanu,Bir and Pavlidis,Ioannis}
}
@article {14027,
	title = {Neuromimetic sound representation for percept detection and manipulation},
	journal = {EURASIP Journal on Applied Signal Processing},
	volume = {9},
	year = {2005},
	month = {2005///},
	pages = {1350 - 1350},
	abstract = {The acoustic wave received at the ears is processed by the human auditory system to separate different sounds along the intensity,pitch, and timbre dimensions. Conventional Fourier-based signal processing, while endowed with fast algorithms, is unable to
easily represent a signal along these attributes. In this paper, we discuss the creation of maximally separable sounds in auditory
user interfaces and use a recently proposed cortical sound representation, which performs a biomimetic decomposition of an
acoustic signal, to represent and manipulate sound for this purpose. We briefly overview algorithms for obtaining, manipulating,
and inverting a cortical representation of a sound and describe algorithms for manipulating signal pitch and timbre separately.
The algorithms are also used to create sound of an instrument between a {\textquotedblleft}guitar{\textquotedblright} and a {\textquotedblleft}trumpet.{\textquotedblright} Excellent sound quality can
be achieved if processing time is not a concern, and intelligible signals can be reconstructed in reasonable processing time (about
ten seconds of computational time for a one-second signal sampled at 8 kHz). Work on bringing the algorithms into the real-time
processing domain is ongoing.
},
	author = {Zotkin,Dmitry N and Chi,T. and Shamma,S.A. and Duraiswami, Ramani}
}
@article {16399,
	title = {Path dependence and the validation of agent-based spatial models of land use},
	journal = {International Journal of Geographical Information Science},
	volume = {19},
	year = {2005},
	month = {2005///},
	pages = {153 - 174},
	author = {Corresponding,D.G.B. and Page,S and Riolo,R and Zellner,M and Rand, William}
}
@article {16398,
	title = {Path dependence and the validation of agent-based spatial models of land use},
	journal = {International Journal of Geographical Information Science},
	volume = {19},
	year = {2005},
	month = {2005///},
	pages = {153 - 174},
	abstract = {In this paper, we identify two distinct notions of accuracy of land?use models and highlight a tension between them. A model can have predictive accuracy: its predicted land?use pattern can be highly correlated with the actual land?use pattern. A model can also have process accuracy: the process by which locations or land?use patterns are determined can be consistent with real world processes. To balance these two potentially conflicting motivations, we introduce the concept of the invariant region, i.e., the area where land?use type is almost certain, and thus path independent; and the variant region, i.e., the area where land use depends on a particular series of events, and is thus path dependent. We demonstrate our methods using an agent?based land?use model and using multi?temporal land?use data collected for Washtenaw County, Michigan, USA. The results indicate that, using the methods we describe, researchers can improve their ability to communicate how well their model performs, the situations or instances in which it does not perform well, and the cases in which it is relatively unlikely to predict well because of either path dependence or stochastic uncertainty.},
	isbn = {1365-8816},
	doi = {10.1080/13658810410001713399},
	url = {http://www.tandfonline.com/doi/abs/10.1080/13658810410001713399},
	author = {Brown,Daniel G. and Page,Scott and Riolo,Rick and Zellner,Moira and Rand, William}
}
@conference {11908,
	title = {Pedestrian classification from moving platforms using cyclic motion pattern},
	booktitle = {IEEE International Conference on Image Processing, 2005. ICIP 2005},
	volume = {2},
	year = {2005},
	month = {2005/09//},
	pages = {II- 854-7 - II- 854-7},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper describes an efficient pedestrian detection system for videos acquired from moving platforms. Given a detected and tracked object as a sequence of images within a bounding box, we describe the periodic signature of its motion pattern using a twin-pendulum model. Then a principle gait angle is extracted in every frame providing gait phase information. By estimating the periodicity from the phase data using a digital phase locked loop (dPLL), we quantify the cyclic pattern of the object, which helps us to continuously classify it as a pedestrian. Past approaches have used shape detectors applied to a single image or classifiers based on human body pixel oscillations, but ours is the first to integrate a global cyclic motion model and periodicity analysis. Novel contributions of this paper include: i) development of a compact shape representation of cyclic motion as a signature for a pedestrian, ii) estimation of gait period via a feedback loop module, and iii) implementation of a fast online pedestrian classification system which operates on videos acquired from moving platforms.},
	keywords = {compact shape representation, cyclic motion pattern, data mining, Detectors, digital phase locked loop, digital phase locked loops, feedback loop module, gait analysis, gait phase information, human body pixel oscillations, HUMANS, image classification, Image motion analysis, image representation, image sequence, Image sequences, Motion detection, Object detection, pedestrian classification, pedestrian detection system, Phase estimation, Phase locked loops, principle gait angle, SHAPE, tracking, Videos},
	isbn = {0-7803-9134-9},
	doi = {10.1109/ICIP.2005.1530190},
	author = {Yang Ran and Qinfen Zheng and Weiss, I. and Davis, Larry S. and Abd-Almageed, Wael and Liang Zhao}
}
@conference {13192,
	title = {Pedestrian classification from moving platforms using cyclic motion pattern},
	booktitle = {Image Processing, 2005. ICIP 2005. IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/09//},
	pages = {II - 854-7 - II - 854-7},
	abstract = {This paper describes an efficient pedestrian detection system for videos acquired from moving platforms. Given a detected and tracked object as a sequence of images within a bounding box, we describe the periodic signature of its motion pattern using a twin-pendulum model. Then a principle gait angle is extracted in every frame providing gait phase information. By estimating the periodicity from the phase data using a digital phase locked loop (dPLL), we quantify the cyclic pattern of the object, which helps us to continuously classify it as a pedestrian. Past approaches have used shape detectors applied to a single image or classifiers based on human body pixel oscillations, but ours is the first to integrate a global cyclic motion model and periodicity analysis. Novel contributions of this paper include: i) development of a compact shape representation of cyclic motion as a signature for a pedestrian, ii) estimation of gait period via a feedback loop module, and iii) implementation of a fast online pedestrian classification system which operates on videos acquired from moving platforms.},
	keywords = {analysis;, angle;, body, classification;, compact, cyclic, DETECTION, detection;, digital, Feedback, Gait, human, image, information;, locked, loop, loop;, loops;, module;, MOTION, object, oscillations;, pattern;, pedestrian, phase, Pixel, principle, representation;, sequence;, sequences;, SHAPE, system;},
	doi = {10.1109/ICIP.2005.1530190},
	author = {Yang Ran and Qinfen Zheng and Weiss, I. and Davis, Larry S. and Abd-Almageed, Wael and Liang Zhao}
}
@conference {14522,
	title = {Plane-wave decomposition analysis for spherical microphone arrays},
	booktitle = {IEEE Workshop on Applications of Signal Processing to Audio and Acoustics, 2005},
	year = {2005},
	month = {2005/10//},
	pages = {150 - 153},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Spherical microphone arrays have attracted attention for analyzing the sound field in a region and beamforming. The analysis of the recorded sound has been performed in terms of spherical wave-functions, and recently the use of plane-wave expansions has been suggested. We show that the plane-wave basis is intimately related to the spherical wave-functions. Reproduction in terms of both representations satisfies certain band-limit criteria. We provide an error bound that shows that to reproduce the spatial characteristics of a sound of a certain frequency we need to be able to accurately represent sounds of up to a particular order, which establishes a Nyquist-like criterion. The order of the sound field in turn is related to the number of microphones in the array necessary to achieve accurate quadrature on the sphere. These results are illustrated with simulations.},
	keywords = {Acoustic propagation, Acoustic scattering, acoustic signal processing, acoustic waves, array signal processing, band-limit criteria, beamforming, Educational institutions, Fourier transforms, Frequency, Laboratories, microphone arrays, Nails, Nyquist criterion, Nyquist-like criterion, Partial differential equations, plane-wave decomposition analysis, sound field analysis, spherical microphone arrays, spherical wave-functions},
	isbn = {0-7803-9154-3},
	doi = {10.1109/ASPAA.2005.1540191},
	author = {Duraiswami, Ramani and Zhiyun Li and Zotkin,Dmitry N and Grassi,E. and Gumerov, Nail A.}
}
@inbook {12666,
	title = {Pose-Encoded Spherical Harmonics for Robust Face Recognition Using a Single Image},
	booktitle = {Analysis and Modelling of Faces and GesturesAnalysis and Modelling of Faces and Gestures},
	series = {Lecture Notes in Computer Science},
	volume = {3723},
	year = {2005},
	month = {2005///},
	pages = {229 - 243},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Face recognition under varying pose is a challenging problem, especially when illumination variations are also present. Under Lambertian model, spherical harmonics representation has proved to be effective in modelling illumination variations for a given pose. In this paper, we extend the spherical harmonics representation to encode pose information. More specifically, we show that 2D harmonic basis images at different poses are related by close-form linear combinations. This enables an analytic method for generating new basis images at a different pose which are typically required to handle illumination variations at that particular pose. Furthermore, the orthonormality of the linear combinations is utilized to propose an efficient method for robust face recognition where only one set of front-view basis images per subject is stored. In the method, we directly project a rotated testing image onto the space of front-view basis images after establishing the image correspondence. Very good recognition results have been demonstrated using this method.},
	isbn = {978-3-540-29229-6},
	url = {http://dx.doi.org/10.1007/11564386_18},
	author = {Yue,Zhanfeng and Zhao,Wenyi and Chellapa, Rama},
	editor = {Zhao,Wenyi and Gong,Shaogang and Tang,Xiaoou}
}
@article {18462,
	title = {Processing of reverberant speech for time-delay estimation},
	journal = {IEEE Transactions on Speech and Audio Processing},
	volume = {13},
	year = {2005},
	month = {2005/11//},
	pages = {1110 - 1118},
	abstract = {In this paper, we present a method of extracting the time-delay between speech signals collected at two microphone locations. Time-delay estimation from microphone outputs is the first step for many sound localization algorithms, and also for enhancement of speech. For time-delay estimation, speech signals are normally processed using short-time spectral information (either magnitude or phase or both). The spectral features are affected by degradations in speech caused by noise and reverberation. Features corresponding to the excitation source of the speech production mechanism are robust to such degradations. We show that these source features can be extracted reliably from the speech signal. The time-delay estimate can be obtained using the features extracted even from short segments (50-100 ms) of speech from a pair of microphones. The proposed method for time-delay estimation is found to perform better than the generalized cross-correlation (GCC) approach. A method for enhancement of speech is also proposed using the knowledge of the time-delay and the information of the excitation source.},
	keywords = {Acoustic noise, acoustic signal processing, array signal processing, data mining, Degradation, delay estimation, Feature extraction, Hilbert envelope, localization algorithm, microphone arrays, microphone location, Microphones, Phase estimation, reverberation, short-time spectral information, Signal processing, source features, source information excitation, speech enhancement, Speech processing, speech production mechanism, speech signal, time-delay, time-delay estimation},
	isbn = {1063-6676},
	doi = {10.1109/TSA.2005.853005},
	author = {Yegnanarayana,B. and Prasanna,S. R.M and Duraiswami, Ramani and Zotkin,Dmitry N}
}
@conference {17890,
	title = {Query planning for the grid: adapting to dynamic resource availability},
	booktitle = {Cluster Computing and the Grid, IEEE International Symposium on},
	volume = {2},
	year = {2005},
	month = {2005///},
	pages = {751 - 758},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {The availability of massive datasets, comprising sensor measurements or the results of scientific simulations, has had a significant impact on the methodology of scientific reasoning. Scientists require storage, bandwidth and computational capacity to query and analyze these datasets, to understand physical phenomena or to test hypotheses. This paper addresses the challenge of identifying and selecting resources to develop an evaluation plan for large scale data analysis queries when data processing capabilities and datasets are dispersed across nodes in one or more computing and storage clusters. We show that generating an optimal plan is hard and we propose heuristic techniques to find a good choice of resources. We also consider heuristics to cope with dynamic resource availability; in this situation we have stale information about reusable cached results (datasets) and the load on various nodes.},
	isbn = {0-7803-9074-1},
	doi = {http://doi.ieeecomputersociety.org/10.1109/CCGRID.2005.1558638},
	author = {Zhang,K. and Andrade,H. and Raschid, Louiqa and Sussman, Alan}
}
@article {12663,
	title = {Recognition of Humans and Their Activities Using Video},
	journal = {Synthesis Lectures on Image, Video, and Multimedia Processing},
	volume = {1},
	year = {2005},
	month = {2005/01//},
	pages = {1 - 173},
	abstract = {The recognition of humans and their activities from video sequences is currently a very active area of research because of its applications in video surveillance, design of realistic entertainment systems, multimedia communications, and medical diagnosis. In this lecture, we discuss the use of face and gait signatures for human identification and recognition of human activities from video sequences. We survey existing work and describe some of the more well-known methods in these areas. We also describe our own research and outline future possibilities.In the area of face recognition, we start with the traditional methods for image-based analysis and then describe some of the more recent developments related to the use of video sequences, 3D models, and techniques for representing variations of illumination. We note that the main challenge facing researchers in this area is the development of recognition strategies that are robust to changes due to pose, illumination, disguise, and aging. Gait recognition is a more recent area of research in video understanding, although it has been studied for a long time in psychophysics and kinesiology. The goal for video scientists working in this area is to automatically extract the parameters for representation of human gait. We describe some of the techniques that have been developed for this purpose, most of which are appearance based. We also highlight the challenges involved in dealing with changes in viewpoint and propose methods based on image synthesis, visual hull, and 3D models.
In the domain of human activity recognition, we present an extensive survey of various methods that have been developed in different disciplines like artificial intelligence, image processing, pattern recognition, and computer vision. We then outline our method for modeling complex activities using 2D and 3D deformable shape theory. The wide application of automatic human identification and activity recognition methods will require the fusion of different modalities like face and gait, dealing with the problems of pose and illumination variations, and accurate computation of 3D models. The last chapter of this lecture deals with these areas of future research.
},
	isbn = {1559-8136, 1559-8144},
	doi = {10.2200/S00002ED1V01Y200508IVM001},
	url = {http://www.morganclaypool.com/doi/abs/10.2200/S00002ED1V01Y200508IVM001},
	author = {Chellapa, Rama and Roy-Chowdhury,Amit K. and Zhou,S. Kevin}
}
@article {13203,
	title = {Reliable Segmentation of Pedestrians in Moving Scenes},
	journal = {The 2005 International Conference on Acoustics, Speech, and Signal Processing (ICASSP2005)},
	year = {2005},
	month = {2005///},
	abstract = {This paper describes a periodic motion based pedestriansegmentation algorithm for videos acquired from moving
platforms. Given a sequence of bounding boxes
containing the detected and tracked walking human, the
goal is to analyze the low dimension structure by
considering every object sample as a point in the high
dimensional manifold space and use the learned structure
for segmentation. In this work, unlike the traditional top-
down dimension reduction (manifold learning) methods
such as Isomap and locally linear embedding (LLE) [9],
we introduce a novel bottom-up learning approach. We
represent the human stride as a cascade of models with
increasing parameter numbers. These parameters
describe the dynamics of pedestrians from coarse to fine.
By applying the learned manifold structure, we can
predict the location of body parts, especially legs, with
high accuracy at every frame. The segmentation in
consecutive images is done by EM clustering. With the
accuracy for prediction using twin-pendulum model, EM
is more likely to converge to global maximums.
Experimental results for real videos are presented. The
algorithm has demonstrated a reliable performance for
videos acquired from moving platforms.
},
	author = {Ran, Y. and Zheng,Q. and Weiss, I. and Davis, Larry S.}
}
@conference {13637,
	title = {Robust Point Matching for Two-Dimensional Nonrigid Shapes},
	booktitle = {Proceedings in the ICASSP{\textquoteright}04 IEEEInternational Conference on Computer Vision},
	year = {2005},
	month = {2005/10//},
	pages = {1561 - 1566},
	address = {Beijing, China},
	abstract = {Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical constraints. Furthermore, the rough structure of a shape should be preserved under deformation, otherwise even people cannot match shapes reliably. Therefore, though the absolute distance between two points may change significantly, the neighborhood of a point is well preserved in general. Based on this observation, we formulate point matching as a graph matching problem. Each point is a node in the graph, and two nodes are connected by an edge if their Euclidean distance is less than a threshold. The optimal match between two graphs is the one that maximizes the number of matched edges. The shape context distance is used to initialize the graph matching, followed by relaxation labeling for refinement. Nonrigid deformation is overcome by bringing one shape closer to the other in each iteration using deformation parameters estimated from the current point correspondence. Experiments demonstrate the effectiveness of our approach: it outperforms the shape context and TPS-RPM algorithms under nonrigid deformation and noise on a public data set.},
	author = {Yefeng Zheng and David Doermann}
}
@conference {13190,
	title = {Segmentation and appearance model building from an image sequence},
	booktitle = {Image Processing, 2005. ICIP 2005. IEEE International Conference on},
	volume = {1},
	year = {2005},
	month = {2005/09//},
	pages = {I - 321-4 - I - 321-4},
	abstract = {In this paper we explore the problem of accurately segmenting a person from a video given only approximate location of that person. Unlike previous work which assumes that the appearance model is known in advance, we developed an iterative expectation-sampling (ES) algorithm for solving segmentation and appearance modeling simultaneously The appearance model is encoded with a kernel-based PDF defined in a joint color/path-length space. This appearance model remains unchanged during a short time period, although the object can articulate. Thus, we can perform the ES iteration not only for a single frame but also for an image sequence. The algorithm is iterative, but simple, efficient and gives visually good results.},
	keywords = {algorithm;, color-path-length, expectation-sampling, image, iterative, joint, kernel-based, methods;, PDF;, person, segmentation;, sequence;, sequences;, space;},
	doi = {10.1109/ICIP.2005.1529752},
	author = {Liang Zhao and Davis, Larry S.}
}
@article {13713,
	title = {A sentence-trimming approach to multi-document summarization},
	journal = {Proceedings of DUC2005},
	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 and
DUC2005 tasks. Sentence trimming
was incorporated into a feature-based
summarization system, called Multi-
Document Trimmer (MDT), by us-
ing sentence trimming as both a pre-
processing stage and a feature for sen-
tence ranking. We demonstrate that we
were able to port Trimmer easily to this
new problem. Although the direct im-
pact of sentence trimming was minimal
compared to other features used in the
system, the interaction of the other fea-
tures resulted in trimmed sentences ac-
counting for nearly half of the selected
summary sentences.
},
	author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Monz,C. and Schwartz,R.}
}
@article {17841,
	title = {A simulation and data analysis system for large-scale, data-driven oil reservoir simulation studies},
	journal = {Concurrency and Computation: Practice and Experience},
	volume = {17},
	year = {2005},
	month = {2005///},
	pages = {1441 - 1467},
	author = {Kurc, T. and Catalyurek,U. and Zhang,X. and Saltz, J. and Martino,R. and Wheeler,M. and Peszy{\'n}ska,M. and Sussman, Alan and Hansen,C. and Sen,M. and others}
}
@article {18431,
	title = {Software process improvement in small organizations: a case study},
	journal = {Software, IEEE},
	volume = {22},
	year = {2005},
	month = {2005/12//nov},
	pages = {68 - 75},
	abstract = {The Capability Maturity Model for software has become a major force in software development process improvement. We looked at the role of process improvement in the context of a small organization. Although the Capability Maturity Model integration is replacing the CMM, we focused on the older CMM. We had to look at more than which CMM key process areas apply to small businesses. Our overall goal was to institute good software development practices, we used the language of the CMM to gain the management{\textquoteright}s cooperation. Applying these practices is essential to managing growth, yet undertaking this effort without prior experience could impede a small company{\textquoteright}s innovative nature. This case study{\textquoteright}s purpose was to investigate the success factors of a software process improvement effort for a small software development organization.},
	keywords = {area;, aspects;, capability, CMM, development, improvement;, key, management;, Maturity, model;, organisational, organization;, process, small, software},
	isbn = {0740-7459},
	doi = {10.1109/MS.2005.162},
	author = {Dangle,K.C. and Larsen,P. and Shaw,M. and Zelkowitz, Marvin V}
}
@conference {14531,
	title = {System for capturing of highorder spatial audio using spherical microphone array and binaural head-tracked playback over headphones with head related transfer function cues},
	booktitle = {Proc. 119th convention AES},
	year = {2005},
	month = {2005///},
	author = {Duraiswami, Ramani and Zotkin,Dmitry N and Li,Z. and Grassi,E. and Gumerov, Nail A. and Davis, Larry S.}
}
@article {12671,
	title = {Tracking Algorithm Using Background-Foreground Motion Models and Multiple Cues},
	journal = {ICASSP apos},
	year = {2005},
	month = {2005///},
	pages = {233 - 236},
	abstract = {We present a stochastic tracking algorithm for surveillance videoswhere targets are dim and of low resolution. Our tracker is mainly
based on the particle filter algorithm. Two important novel fea-
tures of the tracker include: A motion model consisting of both
background and foreground motion parameters is built. Multiple
cues are adaptively integrated in a system observation model when
estimating the likelihood functions. Based on these features, the
accuracy and robustness of the tracker has been improved, which
is very important for surveillance problems. We present the results
of applying the proposed algorithm to many videos.
},
	author = {Shao, J. and Zhou,S. K and Chellapa, Rama}
}
@conference {12652,
	title = {Tracking objects in video using motion and appearance models},
	booktitle = {Image Processing, 2005. ICIP 2005. IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/09//},
	pages = {II - 394-7 - II - 394-7},
	abstract = {This paper proposes a visual tracking algorithm that combines motion and appearance in a statistical framework. It is assumed that image observations are generated simultaneously from a background model and a target appearance model. This is different from conventional appearance-based tracking, that does not use motion information. The proposed algorithm attempts to maximize the likelihood ratio of the tracked region, derived from appearance and background models. Incorporation of motion in appearance based tracking provides robust tracking, even when the target violates the appearance model. We show that the proposed algorithm performs well in tracking targets efficiently over long time intervals.},
	keywords = {algorithm;, analysis;, appearance, background, estimation;, image, likelihood, maximum, model;, models;, MOTION, object, processing;, signal, target, tracking, tracking;, video, visual},
	doi = {10.1109/ICIP.2005.1530075},
	author = {Sankaranarayanan,A. C and Chellapa, Rama and Qinfen Zheng}
}
@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 {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.}
}
@article {13201,
	title = {A video-based framework for the analysis of presentations/posters},
	journal = {International Journal on Document Analysis and Recognition},
	volume = {7},
	year = {2005},
	month = {2005///},
	pages = {178 - 187},
	abstract = {Detection and recognition of textual information in an image or video sequence is important for many applications. The increased resolution and capabilities of digital cameras and faster mobile processing allow for the development of interesting systems. We present an application based on the capture of information presented at a slide-show presentation or at a poster session. We describe the development of a system to process the textual and graphical information in such presentations. The application integrates video and image processing, document layout understanding, optical character recognition (OCR), and pattern recognition. The digital imaging device captures slides/poster images, and the computing module preprocesses and annotates the content. Various problems related to metric rectification, key-frame extraction, text detection, enhancement, and system integration are addressed. The results are promising for applications such as a mobile text reader for the visually impaired. By using powerful text-processing algorithms, we can extend this framework to other applications, e.g., document and conference archiving, camera-based semantics extraction, and ontology creation.},
	author = {Zandifar,A. and Duraiswami, Ramani and Davis, Larry S.}
}
@article {18460,
	title = {Accelerated speech source localization via a hierarchical search of steered response power},
	journal = {IEEE Transactions on Speech and Audio Processing},
	volume = {12},
	year = {2004},
	month = {2004/09//},
	pages = {499 - 508},
	abstract = {Accurate and fast localization of multiple speech sound sources is a problem that is of significant interest in applications such as conferencing systems. Recently, approaches that are based on search for local peaks of the steered response power are becoming popular, despite their known computational expense. Based on the observation that the wavelengths of the sound from a speech source are comparable to the dimensions of the space being searched and that the source is broadband, we have developed an efficient search algorithm. Significant speedups are achieved by using coarse-to-fine strategies in both space and frequency. We present applications of the search algorithm to speed up simple delay-and-sum beamforming and steered response power phase-transform weighted (SRP-PHAT) source localization algorithms. A systematic series of comparisons with previous algorithms are made that show that the technique is much faster, robust, and accurate. The performance of the algorithm can be further improved by using constraints from computer vision.},
	keywords = {accelerated speech source localization, Acceleration, array signal processing, conferencing system, Delay, delay-and-sum beamforming, direction-of-arrival estimation, Frequency, hierarchical search algorithm, Inverse problems, multimedia applications, Multimedia communication, multiple speech sound source, Position measurement, Robustness, search problems, Sensor arrays, Signal processing algorithms, speech, speech enhancement, Speech processing, steered response power, steered response power phase-transform weighted source localization algorithm, transducer arrays, User interfaces},
	isbn = {1063-6676},
	doi = {10.1109/TSA.2004.832990},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani}
}
@conference {12086,
	title = {Achieving packet-level quality of service through scheduling in multirate WLANs},
	booktitle = {Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th},
	volume = {4},
	year = {2004},
	month = {2004/09/26/29},
	pages = {2730- 2734 Vol. 4 - 2730- 2734 Vol. 4},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Wireless packet scheduling has been a popular paradigm to achieve packet-level QoS in terms of fairness and throughput in the presence of channel errors. However, the current design does not anticipate the multi-rate capability offered by the IEEE 802.11a/b/g physical layer, thus suffering significant performance degradation in 802.11 WLANs. In this paper, we propose multirate wireless fair scheduling (WMFS). In MWFS, each flow is granted a temporal fair share of the channel, in contrast to the throughput fair share adopted by existing algorithms. Therefore, each flow receives services in proportion to its perceived transmission rate, and high-rate flows are able to opportunistically exploit their good channel conditions and receive more services. MWFS also renovates the compensation model in order to allow for error-prone flows to catch up, thus ensuring fairness for all flows over error-prone channels. We demonstrate the effectiveness of MWFS through both simulations and analysis. Especially, WMFS achieves system throughput 159\% of state-of-the-art scheduling algorithms in simulated scenarios.},
	keywords = {Analytical models, channel conditions, channel errors, channel temporal fair share, compensation, Computer science, Delay, error-prone flow compensation, IEEE 802.11a/b/g physical layer, multirate wireless fair scheduling, multirate WLAN, packet radio networks, packet-level quality of service, Physical layer, Processor scheduling, QoS, quality of service, radio access networks, Scheduling algorithm, Throughput, throughput fairness, USA Councils, Wireless LAN, wireless packet scheduling, WMFS},
	isbn = {0-7803-8521-7},
	doi = {10.1109/VETECF.2004.1400554},
	author = {Yuan Yuan and Daqing Gu and Arbaugh, William A. and Jinyun Zhang}
}
@inbook {15666,
	title = {Analyzing the number of samples required for an approximate Monte-Carlo LMS line estimator},
	booktitle = {Theory and Applications of Recent Robust MethodsTheory and Applications of Recent Robust Methods},
	year = {2004},
	month = {2004///},
	pages = {207 - 219},
	publisher = {Birkh{\"a}user},
	organization = {Birkh{\"a}user},
	isbn = {3764370602, 9783764370602},
	author = {Mount, Dave and Netanyahu,N. S and Zuck,E.}
}
@article {12710,
	title = {Appearance tracking using adaptive models in a particle filter},
	journal = {Proc. of 6th Asian Conference on Computer Vision (ACCV)},
	year = {2004},
	month = {2004///},
	abstract = {The particle filter is a popular tool for visual tracking. Usually, the appearance model is eitherfixed or rapidly changing and the motion model is simply a random walk with fixed noise vari-
ance. Also, the number of particles used is typically fixed. All these factors make the visual
tracker unstable. To stabilize the tracker, we propose the following measures: an observation
model arising from an adaptive noise variance, and adaptive number of particles. The adaptive-
velocity is computed via a first-order linear predictor using the previous particle configuration.
Tracking under occlusion is accomplished using robust statistics. Experimental results on track-
ing visual objects in long video sequences such as vehicles, tank, and human faces demonstrate
the effectiveness and robustness of our algorithm.
},
	author = {Zhou, S. and Chellapa, Rama and Moghaddam, B.}
}
@conference {12703,
	title = {Appearance-based tracking and recognition using the 3D trilinear tensor},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/05//},
	pages = {iii - 613-16 vol.3 - iii - 613-16 vol.3},
	abstract = {The paper presents an appearance-based adaptive algorithm for simultaneous tracking and recognition by generalizing the transformation model to 3D perspective transformation. A trilinear tensor operator is used to represent the 3D geometrical structure. The tensor is estimated by predicting the corresponding points using the existing affine-transformation based algorithm. The estimated tensor is used to synthesize novel views to update the appearance templates. Some experimental results using airborne video are presented.},
	keywords = {3D, adaptive, affine-transformation, airborne, algorithm;, appearance, appearance-based, based, estimation;, geometrical, image, mathematical, novel, object, operator;, operators;, perspective, prediction;, processing;, recognition;, representation;, signal, structure, synthesis;, template, tensor, tensor;, tensors;, tracking;, transformation;, trilinear, updating;, video, video-based, video;, view},
	doi = {10.1109/ICASSP.2004.1326619},
	author = {Jie Shao and Zhou,S. K and Chellapa, Rama}
}
@article {13730,
	title = {Bbn/umd at duc-2004: Topiary},
	journal = {Proceedings of the HLT-NAACL 2004 Document Understanding Workshop, Boston},
	year = {2004},
	month = {2004///},
	pages = {112 - 119},
	abstract = {This paper reports our results at DUC-2004 and describes our approach, im-
plemented in a system called Topiary.
We will show that the combination of
linguistically motivated sentence com-
pression with statistically selected topic
terms performs better than either alone,
according to some automatic summary
evaluation measures.
},
	author = {Zajic, David and Dorr, Bonnie J and Schwartz,R.}
}
@conference {14774,
	title = {Challenges in Measuring HPCS Learner Productivity in an Age of Ubiquitous Computing: The HPCS Program},
	booktitle = {In Proceedings of ICSE Workshop on High Productivity Computing. May 2004},
	year = {2004},
	month = {2004///},
	author = {Asgari, S. and Basili, Victor R. and Carver, J. and Hochstein, L. and Hollingsworth, Jeffrey K and Zelkowitz, Marvin V}
}
@article {14597,
	title = {CHARACTERIZATION OF Ath17, A QUANTITATIVE TRAIT LOCUS FOR ATHEROSCLEROSIS SUSCEPTIBILITY BETWEEN C57BL/6J AND 129S1/SvImJ; SINGLE-NUCLEOTIDE POLYMORPHISMS HAVE IMPORTANT IMPLICATIONS ON IDENTIFYING ATHEROSCLEROSIS MODIFIER GENES},
	journal = {Cardiovascular Pathology},
	volume = {13},
	year = {2004},
	month = {2004/06//May},
	pages = {5 - 6},
	abstract = {Although identifying quantitative trait loci (QTL) for atherosclerosis susceptibility in experimental murine models has helped us better understand the pathophysiology of atherosclerosis, identifying the genes underlying these QTL has been a slow and difficult process. We are currently in the process of identifying the gene that underlies Ath17, an atherosclerosis-susceptibility QTL we discovered in a (C57BL/6J{\texttimes}129S1/SvImJ)F2 intercross. Ath17 maps to a 6 cM interval region on chromosome 10 (D10Mit31, LOD score 6.6) and contains 46 annotated and 133 predicted genes. We searched the Celera Discovery System database for single nucleotide polymorphisms (SNPs) between C57BL/6J (B6) and 129S1/SvImJ in the Ath17 region and found defined blocks of high and low diversity and one polymorphic region of over 4 Mb surrounded by nonpolymorphic regions. Four of the genes, including the annotated Desrt, in the polymorphic region contained mis-sense mutations. The Desrt coding region contained four mis-sense mutations: B6 lysine to 129 glutamic acid at aa382, B6 asparagine to 129 serine at aa388, B6 threonine to 129 alanine at aa836, and B6 glycine to 129 serine at aa964. In addition, intron 5 of Desrt contained a SNP which co-localized with a putative transcription factor binding site. Desrt is a DNA binding protein, widely expressed in adult tissues, and likely plays a role in cell proliferation, differentiation, and development, making Dsert a strong candidate gene for Ath17. The murine SNP database dramatically reduced the percentage of the murine genome we had to search to find viable candidate genes for Ath17.},
	isbn = {1054-8807},
	doi = {10.1016/j.carpath.2004.03.010},
	url = {http://www.sciencedirect.com/science/article/pii/S1054880704000377},
	author = {Ishimori,Naoki and Walsh,Kenneth and Zheng,Xiangqun and Lu,Fu and Hannenhalli, Sridhar and Nusskern,Deborah and Mural,Richard and Paigen,Beverly}
}
@article {14852,
	title = {Characterization of human faces under illumination variations using rank, integrability, and symmetry constraints},
	journal = {Computer Vision-ECCV 2004},
	year = {2004},
	month = {2004///},
	pages = {588 - 601},
	abstract = {Photometric stereo algorithms use a Lambertian reflectance model with a varying albedo field and involve the appearances of only one object. This paper extends photometric stereo algorithms to handle all the appearances of all the objects in a class, in particular the class of human faces. Similarity among all facial appearances motivates a rank constraint on the albedos and surface normals in the class. This leads to a factorization of an observation matrix that consists of exemplar images of different objects under different illuminations, which is beyond what can be analyzed using bilinear analysis. Bilinear analysis requires exemplar images of different objects under same illuminations. To fully recover the class-specific albedos and surface normals, integrability and face symmetry constraints are employed. The proposed linear algorithm takes into account the effects of the varying albedo field by approximating the integrability terms using only the surface normals. As an application, face recognition under illumination variation is presented. The rank constraint enables an algorithm to separate the illumination source from the observed appearance and keep the illuminant-invariant information that is appropriate for recognition. Good recognition results have been obtained using the PIE dataset.},
	doi = {10.1007/978-3-540-24670-1_45},
	author = {Zhou, S. and Chellapa, Rama and Jacobs, David W.}
}
@article {18381,
	title = {Defect evolution in a product line environment},
	journal = {Journal of Systems and Software},
	volume = {70},
	year = {2004},
	month = {2004/02//},
	pages = {143 - 154},
	abstract = {One mechanism used for monitoring the development of the Space Shuttle flight control software, in order to minimize any risks to the missions, is the independent verification and validation (IV\&amp;V) process. Using data provided by both the Shuttle software developer and the IV\&amp;V contractor, in this paper we describe the overall IV\&amp;V process as used on the Space Shuttle program and provide an analysis of the use of metrics to document and control this process over multiple releases of this software. Our findings reaffirm the value of IV\&amp;V, show the impact of IV\&amp;V on multiple releases of a large complex software system, and indicate that some of the traditional measures of defect detection and repair are not applicable in a multiple-release environment such as this one.},
	keywords = {Evolutionary software, Life and mission critical software, metrics, Process characterization, Product line development, Software independent verification and validation, Software safety and reliability, Space Shuttle program},
	isbn = {0164-1212},
	doi = {10.1016/S0164-1212(03)00013-X},
	url = {http://www.sciencedirect.com/science/article/pii/S016412120300013X},
	author = {Zelkowitz, Marvin V and Rus,Ioana}
}
@conference {13218,
	title = {An Efficient and Robust Human Classification Algorithm using Finite Frequencies Probing},
	booktitle = {Computer Vision and Pattern Recognition Workshop, 2004. CVPRW {\textquoteright}04. Conference on},
	year = {2004},
	month = {2004/06//},
	pages = {132 - 132},
	abstract = {This paper describes a periodicity motion detection based object classification algorithm for infrared videos. Given a detected and tracked object, the goal is to analyze the periodic signature of its motion pattern. We propose an efficient and robust solution, which is related to the frequency estimation in speech recognition. Periodic reference functions are correlated with the video signal. Experimental results for both infrared and visible videos acquired by ground-based as well as airborne moving sensors are presented.},
	doi = {10.1109/CVPR.2004.25},
	author = {Yang Ran and Weiss, I. and Qinfen Zheng and Davis, Larry S.}
}
@conference {12131,
	title = {Empirical-based estimation of the effect on software dependability of a technique for architecture conformance verification},
	booktitle = {Proceedings of the ICSE 2004 Workshop on Architecting Dependable Systems, Edinburgh, UK},
	year = {2004},
	month = {2004///},
	abstract = {The High Dependability Computing Program (HDCP)project is a NASA initiative for increasing dependability
of software-based systems. It researches achieving high
dependability by introducing new technologies. We focus
on the evaluation of the effectiveness of technologies with
respect to dependability. We employ empirical evaluation
methods along with evaluation testbeds. In this paper,
our technology evaluation approach is described. A
testbed representative of air traffic control applications is
used. An experiment to evaluate a technology to for
identification of architectural violations is presented.
},
	author = {Asgari, S. and Basili, Victor R. and Costa,P. and Donzelli,P. and Hochstein, L. and Lindvall,M. and Rus,I. and Shull, F. and Tvedt,R. and Zelkowitz, Marvin V}
}
@article {13771,
	title = {Extrinsic Evaluation of Automatic Metrics for Summarization},
	year = {2004},
	month = {2004/07/20/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This paper describes extrinsic-task evaluation of summarization. We show that it is possible to save time using summaries for relevance assessment without adversely impacting the degree of accuracy that would be possible with full documents. In addition, we demonstrate that the extrinsic task we have selected exhibits a high degree of interannotator agreement, i.e., consistent relevance decisions across subjects. We also conducted a composite experiment that better reflects the actual document selection process and found that using a surrogate improves the processing speed over reading the entire document. Finally, we have found a small yet statistically significant correlation between some of the intrinsic measures and a user{\textquoteright}s performance in an extrinsic task. The overall conclusion we can draw at this point is that ROUGE-1 does correlate with precision and to a somewhat lesser degree with accuracy, but that it remains to be investigated how stable these correlations are and how differences in ROUGE-1 translate into significant differences in human performance in an extrinsic task.},
	keywords = {*ABSTRACTS, *ACCURACY, *DATA SUMMARIZATION, *DOCUMENT SUMMARIES, *DOCUMENTS, *READING MACHINES, *SOFTWARE METRICS, *STATISTICAL ANALYSIS, ABSTRACT SELECTION, ANNOTATIONS, Automation, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER SYSTEMS, CORRELATION TECHNIQUES, DATA PROCESSING, DOCUMENT SUMMARIES, EXTRINSIC TASKS, Information retrieval, INFORMATION SCIENCE, PERFORMANCE(HUMAN), PRECISION, RELEVANCY, ROUGE-1 COMPUTER PROGRAM, STATISTICS AND PROBABILITY, TEST AND EVALUATION},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA448065},
	author = {Dorr, Bonnie J and Monz,Christof and Oard, Douglas and President,Stacy and Zajic, David and Schwartz,Richard}
}
@article {14876,
	title = {Generalized photometric stereo and its application to face recognition},
	journal = {International Journal of Computer Vision},
	year = {2004},
	month = {2004///},
	abstract = {Most photometric stereo algorithms employ a Lambertian reflectance model witha varying albedo field and involve the appearances of only one object. The recovered albedos
and surface normals are object-specific and appearances not belonging to the object cannot
be easily handled. We generalize photometric stereo algorithms to handle all appearances
of all objects in a class, in particular the human face class, by assuming that albedos and
surface normals of all objects in the class be rank-constrained, i.e. lie in a subspace. Rank
constraints lead us to a factorization of an observation matrix that consists of exemplar images
of different objects under different illuminations. To fully recover the subspace bases or class-
specific albedos and surface normals, we employ integrability and face symmetry constraints
and propose a linearized algorithm. This algorithm takes into account the effects of the varying
albedo field by approximating the integrability terms using only the surface normals. We then
apply our generalized photometric stereo algorithm for recognizing faces under illumination
variations. As far as recognition is concerned, we can utilize a bootstrap set which is just a
collection of 2D image observations to avoid an explicit requirement that 3D information be
available. We obtain good recognition results using the PIE database.
},
	author = {Zhou, S. and Chellapa, Rama and Jacobs, David W.}
}
@article {13783,
	title = {Headline evaluation experiment results},
	year = {2004},
	month = {2004///},
	institution = {University of Maryland, College Park, MD. UMIACS-TR-2004-18},
	abstract = {This technical report describes an experiment intending to show that different summarizationtechniques have an effect on human performance of an extrinsic task. The task is document
selection in the context of information retrieval. We conclude that the task was too difficult and
ambiguous for subjects to perform at the level required in order to make statistically significant
claims about the relationship between summarization techniques and human performance. An
alternate interpretation of the experimental results is described and plans for future experiments are
discussed.
},
	author = {Zajic, David and Dorr, Bonnie J and Schwartz,R. and President,S.}
}
@conference {12100,
	title = {High-performance MAC for high-capacity wireless LANs},
	booktitle = {13th International Conference on Computer Communications and Networks, 2004. ICCCN 2004. Proceedings},
	year = {2004},
	month = {2004/10/11/13},
	pages = {167 - 172},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The next-generation wireless technologies, e.g., 802.11n and 802.15.3a, offer a physical-layer speed at least an-order-of-magnitude higher than the current standards. However, direct application of current MACs leads to high protocol overhead and significant throughput degradation. In this paper, we propose ADCA, a high-performance MAC that works with high-capacity physical layer. ADCA exploits two ideas of adaptive batch transmission and opportunistic selection of high-rate hosts to simultaneously reduce the overhead and improve the aggregate throughput. It opportunistically favors high-rate hosts by providing higher access probability and more access time, while ensuring each low-rate host certain minimum amount of channel access time. Simulations show that the ADCA design increases the throughput by 112\% and reduces the average delay by 55\% compared with the legacy DCF. It delivers more than 100 Mbps MAC-layer throughput as compared with 35 Mbps offered by the legacy MAC},
	keywords = {35 Mbit/s, access protocols, Aggregates, Bandwidth, batch transmission, Computer science, Educational institutions, high-capacity wireless LAN, high-performance MAC, Laboratories, Local area networks, Media Access Protocol, opportunistic selection, Physical layer, probability, Throughput, Wireless LAN},
	isbn = {0-7803-8814-3},
	doi = {10.1109/ICCCN.2004.1401615},
	author = {Yuan Yuan and Daqing Gu and Arbaugh, William A. and Jinyun Zhang}
}
@inbook {13787,
	title = {iCLEF 2003 at Maryland: Translation Selection and Document Selection},
	booktitle = {Comparative Evaluation of Multilingual Information Access SystemsComparative Evaluation of Multilingual Information Access Systems},
	series = {Lecture Notes in Computer Science},
	volume = {3237},
	year = {2004},
	month = {2004///},
	pages = {231 - 265},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Maryland performed two sets of experiments for the 2003 Cross-Language Evaluation Forum{\textquoteright}s interactive track, one focused on interactive selection of appropriate translations for query terms, the second focused on interactive selection of relevant documents. Translation selection was supported using possible synonyms discovered through back translation and two techniques for generating KeyWord In Context (KWIC) examples of usage. The results indicate that searchers typically achieved a similar search effectiveness using fewer query iterations when interactive translation selection was available. For document selection, a complete extract of the first 40 words of each news story was compared to a compressed extract generated using an automated parse-and-trim approach that approximates one way in which people can produce headlines. The results indicate that compressed {\textquotedblleft}headlines{\textquotedblright} result in faster assessment, but with a 20\% relative reduction in the F α = 0.8 search effectiveness measure.},
	isbn = {978-3-540-24017-4},
	url = {http://dx.doi.org/10.1007/978-3-540-30222-3_42},
	author = {Dorr, Bonnie J and He,Daqing and Luo,Jun and Oard, Douglas and Schwartz,Richard and Wang,Jianqiang and Zajic, David},
	editor = {Peters,Carol and Gonzalo,Julio and Braschler,Martin and Kluck,Michael}
}
@article {15875,
	title = {iCLEF 2003 at Maryland: Translation selection and document selection},
	journal = {Comparative Evaluation of Multilingual Information Access Systems},
	year = {2004},
	month = {2004///},
	pages = {231 - 265},
	author = {Dorr, Bonnie J and He,D. and Luo,J. and Oard, Douglas and Schwartz,R. and Wang,J. and Zajic, David}
}
@conference {12701,
	title = {Illuminating light field: image-based face recognition across illuminations and poses},
	booktitle = {Automatic Face and Gesture Recognition, 2004. Proceedings. Sixth IEEE International Conference on},
	year = {2004},
	month = {2004/05//},
	pages = {229 - 234},
	abstract = {We present an image-based method for face recognition across different illuminations and different poses, where the term {\textquoteright}image-based{\textquoteright} means that only 2D images are used and no explicit 3D models are needed. As face recognition across illuminations and poses involves three factors, namely identity, illumination, and pose, generalizations from known identities to novel identities, from known illuminations to novel illuminations, and from known poses to unknown poses are desired. Our approach, called the illuminating light field, derives an identity signature that is invariant to illuminations and poses, where a subspace encoding is assumed for the identity, a Lambertain reflectance model for the illumination, and a light field model for the poses. Experimental results using the PIE database demonstrate the effectiveness of the proposed approach.},
	keywords = {Face, field;, illuminating, image-based, Lambertain, light, lighting;, model;, multidimensional, poses;, processing;, recognition;, reflectance, reflectivity;, signal},
	doi = {10.1109/AFGR.2004.1301536},
	author = {Zhou,Shaohua and Chellapa, Rama}
}
@article {14880,
	title = {Illumination, Reflectance, and Reflection-Characterization of Human Faces under Illumination Variations Using Rank, Integrability, and Symmetry Constraints},
	journal = {Lecture Notes in Computer Science},
	volume = {3021},
	year = {2004},
	month = {2004///},
	pages = {588 - 601},
	author = {Zhou,S. K and Chellapa, Rama and Jacobs, David W.}
}
@article {13229,
	title = {Incremental density approximation and kernel-based bayesian filtering for object tracking},
	journal = {IEEE Computer Society Conference on Computer Vision and Pattern Recognition},
	volume = {1},
	year = {2004},
	month = {2004///},
	abstract = {Statistical density estimation techniques are used in manycomputer vision applications such as object tracking, back-
ground subtraction, motion estimation and segmentation.
The particle filter (Condensation) algorithm provides a gen-
eral framework for estimating the probability density func-
tions (pdf) of general non-linear and non-Gaussian systems.
However, since this algorithm is based on a Monte Carlo ap-
proach, where the density is represented by a set of random
samples, the number of samples is problematic, especially
for high dimensional problems. In this paper, we propose
an alternative to the classical particle filter in which the un-
derlying pdf is represented with a semi-parametric method
based on a mode finding algorithm using mean-shift. A mode
propagation technique is designed for this new representa-
tion for tracking applications. A quasi-random sampling
method [14] in the measurement stage is used to improve
performance, and sequential density approximation for the
measurements distribution is performed for efficient compu-
tation. We apply our algorithm to a high dimensional color-
based tracking problem, and demonstrate its performance by
showing competitive results with other trackers.
},
	author = {Han,B. and Comaniciu, D. and Zhu,Y. and Davis, Larry S.}
}
@article {14087,
	title = {The ingi and RIME non-LTR retrotransposons are not randomly distributed in the genome of Trypanosoma brucei},
	journal = {Molecular biology and evolution},
	volume = {21},
	year = {2004},
	month = {2004///},
	pages = {520 - 520},
	author = {Bringaud,F. and Biteau,N. and Zuiderwijk,E. and Berriman,M. and El-Sayed, Najib M. and Ghedin,E. and Melville,S. E. and Hall,N. and Baltz,T.}
}
@article {14047,
	title = {INTERPOLATION AND RANGE EXTRAPOLATION OF HEAD RELATED TRANSFER FUNCTIONS},
	journal = {IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS SPEECH AND SIGNAL PROCESSING},
	volume = {4},
	year = {2004},
	month = {2004///},
	author = {Duraiswami, Ramani and Zotkin,Dmitry N and Gumerov, Nail A.}
}
@conference {12700,
	title = {Intra-personal kernel space for face recognition},
	booktitle = {Automatic Face and Gesture Recognition, 2004. Proceedings. Sixth IEEE International Conference on},
	year = {2004},
	month = {2004/05//},
	pages = {235 - 240},
	abstract = {Intra-personal space modeling proposed by Moghaddam et al. has been successfully applied in face recognition. In their work the regular principal subspaces are derived from the intra-personal spacce using a principal componen analysis and embedded in a probabilistic formulation. In this paper, we derive the principal subspace from the intro-personal kernel space by developing a probabilistic analysis for kernel principal components for face recognition. We test this algorithm on a subset of the FERET database with illumination and facial expression variations. The recognition performance demonstrates its advantage over other traditional subspace approaches.},
	keywords = {analysis;, component, Expression, Face, facial, illumination, intra-personal, Kernel, lighting;, principal, probabilistic, probability;, recognition;, space;, variation;},
	doi = {10.1109/AFGR.2004.1301537},
	author = {Zhou,Shaohua and Chellapa, Rama and Moghaddam, B.}
}
@conference {13216,
	title = {Iterative figure-ground discrimination},
	booktitle = {Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on},
	volume = {1},
	year = {2004},
	month = {2004/08//},
	pages = {67 - 70 Vol.1 - 67 - 70 Vol.1},
	abstract = {Figure-ground discrimination is an important problem in computer vision. Previous work usually assumes that the color distribution of the figure can be described by a low dimensional parametric model such as a mixture of Gaussians. However, such approach has difficulty selecting the number of mixture components and is sensitive to the initialization of the model parameters. In this paper, we employ non-parametric kernel estimation for color distributions of both the figure and background. We derive an iterative sampling-expectation (SE) algorithm for estimating the color, distribution and segmentation. There are several advantages of kernel-density estimation. First, it enables automatic selection of weights of different cues based on the bandwidth calculation from the image itself. Second, it does not require model parameter initialization and estimation. The experimental results on images of cluttered scenes demonstrate the effectiveness of the proposed algorithm.},
	keywords = {algorithm;, analysis;, Bandwidth, calculation;, Color, colour, Computer, density, dimensional, discrimination;, distribution;, distributions;, Estimation, estimation;, expectation, figure, Gaussian, ground, image, initialization;, iterative, Kernel, low, methods;, mixture;, model, model;, nonparametric, parameter, parametric, processes;, sampling, sampling;, segmentation, segmentation;, statistics;, theory;, vision;},
	doi = {10.1109/ICPR.2004.1334006},
	author = {Zhao, L. and Davis, Larry S.}
}
@article {12707,
	title = {Kullback-Leibler distance between two Gaussian densities in reproducing kernel Hilbert space},
	journal = {IEEE Intl. Symp. Information Theory},
	year = {2004},
	month = {2004///},
	author = {Zhou,S. K and Chellapa, Rama}
}
@article {13592,
	title = {Machine printed text and handwriting identification in noisy document images},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {26},
	year = {2004},
	month = {2004/03//},
	pages = {337 - 353},
	abstract = {In this paper, we address the problem of the identification of text in noisy document images. We are especially focused on segmenting and identifying between handwriting and machine printed text because: 1) Handwriting in a document often indicates corrections, additions, or other supplemental information that should be treated differently from the main content and 2) the segmentation and recognition techniques requested for machine printed and handwritten text are significantly different. A novel aspect of our approach is that we treat noise as a separate class and model noise based on selected features. Trained Fisher classifiers are used to identify machine printed text and handwriting from noise and we further exploit context to refine the classification. A Markov Random Field-based (MRF) approach is used to model the geometrical structure of the printed text, handwriting, and noise to rectify misclassifications. Experimental results show that our approach is robust and can significantly improve page segmentation in noisy document collections.},
	keywords = {Automated;Reading;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Computer-Assisted;Information Storage and Retrieval;Models, Computer-Assisted;Pattern Recognition, Computer-Assisted;Stochastic Processes;Subtraction Technique;User-Computer Interface;Writing;, Markov random field;fisher classifiers;handwriting identification;machine printed text;noisy document images;page segmentation;recognition techniques;text identification;Markov processes;document image processing;feature extraction;handwriting recognition, Statistical;Numerical Analysis},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2004.1262324},
	author = {Yefeng Zheng and Huiping Li and David Doermann}
}
@conference {13209,
	title = {Multi-level fast multipole method for thin plate spline evaluation},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/10//},
	pages = {1683 - 1686 Vol. 3 - 1683 - 1686 Vol. 3},
	abstract = {Image registration is an important problem in image processing and computer vision. Much recent work in image registration is on matching non-rigid deformations. Thin plate splines are an effective image registration method when the deformation between two images can be modeled as the bending of a thin metal plate on point constraints such that the topology is preserved (non-rigid deformation). However, because evaluating the computed TPS model at all the image pixels is computationally expensive, we need to speed it up. We introduce the use of multi-level fast muitipole method (MLFMM) for this purpose. Our contribution lies in the presentation of a clear and concise MLFMM framework for TPS, which will be useful for future application developments. The achieved speedup using MLFMM is an improvement from O(N<sup>2</sup>) to O(N log N). We show that the fast evaluation outperforms the brute force method while maintaining acceptable error bound.},
	keywords = {(mathematics);, Computer, deformation;, evaluation;, fast, image, MATCHING, matching;, metal, method;, multilevel, multipole, nonrigid, pixel;, plate, plate;, processing;, registration;, resolution;, spline, splines, thin, vision;},
	doi = {10.1109/ICIP.2004.1421395},
	author = {Zandifar,A. and Lim,S. and Duraiswami, Ramani and Gumerov, Nail A. and Davis, Larry S.}
}
@conference {12692,
	title = {Multiple-exemplar discriminant analysis for face recognition},
	booktitle = {Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on},
	volume = {4},
	year = {2004},
	month = {2004/08//},
	pages = {191 - 194 Vol.4 - 191 - 194 Vol.4},
	abstract = {Face recognition is characteristically different from regular pattern recognition and, therefore, requires a different discriminant analysis other than linear discriminant analysis(LDA). LDA is a single-exemplar method in the sense that each class during classification is represented by a single exemplar, i.e., the sample mean of the class. We present a multiple-exemplar discriminant analysis (MEDA) where each class is represented using several exemplars or even the whole available sample set. The proposed approach produces improved classification results when tested on a subset of FERET database where LDA is ineffective.},
	keywords = {analysis;, database;, databases;, discriminant, Face, FERET, multiple-exemplar, recognition;, visual},
	doi = {10.1109/ICPR.2004.1333736},
	author = {Zhou,S. K and Chellapa, Rama}
}
@article {12709,
	title = {Probabilistic analysis of kernel principal components},
	journal = {NIPS},
	year = {2004},
	month = {2004///},
	abstract = {This paper presents a probabilistic analysis of kernel principal compo-nents by unifying the theory of probabilistic principal component analy-
sis and kernel principal component analysis. It is shown that, while the
kernel component enhances the nonlinear modeling power, the proba-
bilistic structure offers (i) a mixture model for nonlinear data structure
containing nonlinear sub-structures, and (ii) an effective classification
scheme. It turns out that the original loading matrix is replaced by a
newly defined empirical loading matrix. The expectation/maximization
algorithm for learning parameters of interest is also presented.
},
	author = {Zhou, S. and Chellapa, Rama and Moghaddam, B.}
}
@conference {12695,
	title = {Probabilistic identity characterization for face recognition},
	booktitle = {Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on},
	volume = {2},
	year = {2004},
	month = {2004/07/02/june},
	pages = {II-805 - II-812 Vol.2 - II-805 - II-812 Vol.2},
	abstract = {We present a general framework for characterizing the object identity in a single image or a group of images with each image containing a transformed version of the object, with applications to face recognition. In terms of the transformation, the group is made of either many still images or frames of a video sequence. The object identity is either discrete- or continuous-valued. This probabilistic framework integrates all the evidence of the set and handles the localization problem, illumination and pose variations through subspace identity encoding. Issues and challenges arising in this framework are addressed and efficient computational schemes are presented. Good face recognition results using the PIE database are reported.},
	keywords = {characterization;, database, database;, encoding;, Face, identity, identity;, image, localization, management, object, PIE, probabilistic, problem;, recognition;, sequence;, sequences;, subspace, systems;, video},
	doi = {10.1109/CVPR.2004.1315247},
	author = {Zhou,S. K and Chellapa, Rama}
}
@article {13215,
	title = {Rendering localized spatial audio in a virtual auditory space},
	journal = {Multimedia, IEEE Transactions on},
	volume = {6},
	year = {2004},
	month = {2004/08//},
	pages = {553 - 564},
	abstract = {High-quality virtual audio scene rendering is required for emerging virtual and augmented reality applications, perceptual user interfaces, and sonification of data. We describe algorithms for creation of virtual auditory spaces by rendering cues that arise from anatomical scattering, environmental scattering, and dynamical effects. We use a novel way of personalizing the head related transfer functions (HRTFs) from a database, based on anatomical measurements. Details of algorithms for HRTF interpolation, room impulse response creation, HRTF selection from a database, and audio scene presentation are presented. Our system runs in real time on an office PC without specialized DSP hardware.},
	keywords = {(computer, 3-D, audio, audio;, auditory, augmented, data, environments;, functions;, graphics);, Head, interfaces;, perceptual, processing;, reality, reality;, related, rendering, rendering;, scene, signal, sonification;, spaces;, spatial, transfer, user, virtual},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2004.827516},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S.}
}
@article {18459,
	title = {Rendering localized spatial audio in a virtual auditory space},
	journal = {IEEE Transactions on Multimedia},
	volume = {6},
	year = {2004},
	month = {2004/08//},
	pages = {553 - 564},
	abstract = {High-quality virtual audio scene rendering is required for emerging virtual and augmented reality applications, perceptual user interfaces, and sonification of data. We describe algorithms for creation of virtual auditory spaces by rendering cues that arise from anatomical scattering, environmental scattering, and dynamical effects. We use a novel way of personalizing the head related transfer functions (HRTFs) from a database, based on anatomical measurements. Details of algorithms for HRTF interpolation, room impulse response creation, HRTF selection from a database, and audio scene presentation are presented. Our system runs in real time on an office PC without specialized DSP hardware.},
	keywords = {-D audio processing, 3-D audio processing, Audio databases, audio signal processing, audio user interfaces, augmented reality, data sonification, Digital signal processing, head related transfer functions, head-related transfer function, Interpolation, Layout, perceptual user interfaces, Real time systems, Rendering (computer graphics), Scattering, spatial audio, Transfer functions, User interfaces, virtual audio scene rendering, virtual auditory spaces, virtual environments, Virtual reality, virtual reality environments},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2004.827516},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {12686,
	title = {Robust Bayesian cameras motion estimation using random sampling},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {2},
	year = {2004},
	month = {2004/10//},
	pages = {1361 - 1364 Vol.2 - 1361 - 1364 Vol.2},
	abstract = {In this paper, we propose an algorithm for robust 3D motion estimation of wide baseline cameras from noisy feature correspondences. The posterior probability density function of the camera motion parameters is represented by weighted samples. The algorithm employs a hierarchy coarse-to-fine strategy. First, a coarse prior distribution of camera motion parameters is estimated using the random sample consensus scheme (RANSAC). Based on this estimate, a refined posterior distribution of camera motion parameters can then be obtained through importance sampling. Experimental results using both synthetic and real image sequences indicate the efficacy of the proposed algorithm.},
	keywords = {3D, baseline, Bayesian, CAMERAS, cameras;, coarse-to-fine, consensus, density, estimation;, feature, function;, hierarchy, image, images;, importance, matching;, MOTION, posterior, probability, probability;, processing;, random, RANSAC;, real, realistic, sample, sampling;, scheme;, sequences;, stereo, strategy;, synthetic, wide},
	doi = {10.1109/ICIP.2004.1419754},
	author = {Qian, G. and Chellapa, Rama and Qinfen Zheng}
}
@article {13635,
	title = {Robust Point Matching for Non-Rigid Shapes: ARelaxation Labeling Based Approach},
	volume = {LAMP-TR-117,CAR-TR-1005,CS-TR-4633,UMIACS-TR-2004-75},
	year = {2004},
	month = {2004///},
	institution = {University of Maryland, College Park},
	abstract = {Shape matching or image registration, which is often formulated as a point matching problem, is frequently encountered in image analysis, computer vision, and pattern recognition. Although the problem of registering rigid shapes was widely studied, non-rigid shape matching has recently received more and more attention. For non-rigid shapes, most neighboring points cannot move independently under deformation due to physical constraints. Therefore, though the absolute distance between two points may change significantly, the neighborhood of a point is well preserved in general. Based on this observation, we formulate point matching as a graph matching problem. Each point is a node in the graph, and two nodes are connected by an edge if their Euclidean distance is less than a threshold. The optimal match between two graphs is the one that maximizes the number of matched edges. The shape context distance is used to initialize the graph matching, and relaxation labeling (after enforcing one-to-one matching) is used to refine the matching results. Non-rigid deformation is overcome by bringing one shape closer to the other in each iteration using deformation parameters estimated from the current point correspondence. Experiments on real and synthesized data demonstrate the effectiveness of our approach: it outperforms shape context and TPS-RPM algorithms under non-rigid deformation and noise on a public data set.},
	author = {Yefeng Zheng and David Doermann}
}
@conference {12702,
	title = {Robust two-camera tracking using homography},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/05//},
	pages = {iii - 1-4 vol.3 - iii - 1-4 vol.3},
	abstract = {The paper introduces a two view tracking method which uses the homography relation between the two views to handle occlusions. An adaptive appearance-based model is incorporated in a particle filter to realize robust visual tracking. Occlusion is detected using robust statistics. When there is occlusion in one view, the homography from this view to other views is estimated from previous tracking results and used to infer the correct transformation for the occluded view. Experimental results show the robustness of the two view tracker.},
	keywords = {Carlo, filter;, filters;, frame, framework;, homography;, image, method;, methods;, Monte, nonlinear, occlusions;, optical, particle, processing;, robust, sequences;, sequential, signal, statistics;, tracking, tracking;, two, two-camera, video, view, visual},
	doi = {10.1109/ICASSP.2004.1326466},
	author = {Yue,Zhanfeng and Zhou,S. K and Chellapa, Rama}
}
@article {17657,
	title = {SESSION 2: STREAMING},
	journal = {Proceedings of the 14th International Workshop on Network and Operating Systems Support for Digital Audio and Video: NOSSDAV 2003: June 16-18, 2004, Cork, Ireland},
	year = {2004},
	month = {2004///},
	pages = {3 - 3},
	author = {Banerjee,S. and Lee,S. and Braud,R. and Bhattacharjee, Bobby and Srinivasan, Aravind and Chu,Y. and Zhang,H. and Sinha,R. and Papadopoulos,C. and Boustead,P. and others}
}
@conference {12684,
	title = {Simultaneous background and foreground modeling for tracking in surveillance video},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {2},
	year = {2004},
	month = {2004/10//},
	pages = {1053 - 1056 Vol.2 - 1053 - 1056 Vol.2},
	abstract = {We present a stochastic tracking algorithm for surveillance video where targets are dim and at low resolution. The algorithm builds motion models for both background and foreground by integrating motion and intensity information. Some other merits of the algorithm include adaptive selection of feature points for scene description and defining proper cost functions for displacement estimation. The experimental results show tracking robustness and precision in a challenging video sequences.},
	keywords = {algorithm;, analysis;, background-foreground, displacement, estimation;, image, information;, INTENSITY, modeling;, MOTION, processes;, processing;, resolution;, sequences;, signal, Stochastic, Surveillance, surveillance;, tracking, tracking;, video},
	doi = {10.1109/ICIP.2004.1419483},
	author = {Shao, J. and Zhou,S. K and Chellapa, Rama}
}
@article {16117,
	title = {Sonification of geo-referenced data for auditory information seeking: Design principle and pilot study},
	journal = {Proceedings of ICAD},
	year = {2004},
	month = {2004///},
	abstract = {We present an Auditory Information Seeking Principle (AISP)(gist, navigate, filter, and details-on-demand) modeled after the
visual information seeking mantra [1]. We propose that data
sonification designs should conform to this principle. We also
present some design challenges imposed by human auditory
perception characteristics. To improve blind access to geo-
referenced statistical data, we developed two preliminary
sonifications adhering to the above AISP, an enhanced table and
a spatial choropleth map. Our pilot study shows people can
recognize geographic data distribution patterns on a real map
with 51 geographic regions, in both designs. The study also
shows evidence that AISP conforms to people{\textquoteright}s information
seeking strategies. Future work is discussed, including the
improvement of the choropleth map design.
},
	author = {Zhao,H. and Plaisant, Catherine and Shneiderman, Ben and Duraiswami, Ramani}
}
@article {13231,
	title = {Structure of applicable surfaces from single views},
	journal = {Computer Vision-ECCV 2004},
	year = {2004},
	month = {2004///},
	pages = {482 - 496},
	abstract = {The deformation of applicable surfaces such as sheets of paper satisfies the differential geometric constraints of isometry (lengths and areas are conserved) and vanishing Gaussian curvature. We show that these constraints lead to a closed set of equations that allow recovery of the full geometric structure from a single image of the surface and knowledge of its undeformed shape. We show that these partial differential equations can be reduced to the Hopf equation that arises in non-linear wave propagation, and deformations of the paper can be interpreted in terms of the characteristics of this equation. A new exact integration of these equations is developed that relates the 3-D structure of the applicable surface to an image. The solution is tested by comparison with particular exact solutions. We present results for both the forward and the inverse 3D structure recovery problem.},
	author = {Gumerov, Nail A. and Zandifar,A. and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {14761,
	title = {Studying code development for high performance computing: the HPCS program},
	booktitle = {First International Workshop On Software Engineering for High Performance Computing System Applications},
	year = {2004},
	month = {2004///},
	pages = {32 - 32},
	author = {Carver, J. and Asgari, S. and Basili, Victor R. and Hochstein, L. and Hollingsworth, Jeffrey K and Shull, F. and Zelkowitz, Marvin V}
}
@article {18437,
	title = {Susceptibility matrix: a new aid to software auditing},
	journal = {Security Privacy, IEEE},
	volume = {2},
	year = {2004},
	month = {2004/04//mar},
	pages = {16 - 21},
	abstract = {Testing for security is lengthy, complex, and costly, so focusing test efforts in areas that have the greatest number of security vulnerabilities is essential. This article describes a taxonomy-based approach that gives an insight into the distribution of vulnerabilities in a system.},
	keywords = {approach;, auditing;, data;, matrix;, of, program, Security, software, susceptibility, taxonomy-based, testing;, vulnerabilities;},
	isbn = {1540-7993},
	doi = {10.1109/MSECP.2004.1281240},
	author = {Jiwnani,K. and Zelkowitz, Marvin V}
}
@conference {12354,
	title = {Systematic Integration of Parameterized Local Search Techniques in Evolutionary Algorithms},
	booktitle = {Genetic and Evolutionary Computation{\textendash}GECCO 2004},
	year = {2004},
	month = {2004///},
	pages = {383 - 384},
	author = {Bambha,N. K and Bhattacharyya, Shuvra S. and Teich,J. and Zitzler,E.}
}
@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.}
}
@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 {12705,
	title = {Vehicle detection and tracking using acoustic and video sensors},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/05//},
	pages = {iii - 793-6 vol.3 - iii - 793-6 vol.3},
	abstract = {Multimodal sensing has attracted much attention in solving a wide range of problems, including target detection, tracking, classification, activity understanding, speech recognition, etc. In surveillance applications, different types of sensors, such as video and acoustic sensors, provide distinct observations of ongoing activities. We present a fusion framework using both video and acoustic sensors for vehicle detection and tracking. In the detection phase, a rough estimate of target direction-of-arrival (DOA) is first obtained using acoustic data through beam-forming techniques. This initial DOA estimate designates the approximate target location in video. Given the initial target position, the DOA is refined by moving target detection using the video data. Markov chain Monte Carlo techniques are then used for joint audio-visual tracking. A novel fusion approach has been proposed for tracking, based on different characteristics of audio and visual trackers. Experimental results using both synthetic and real data are presented. Improved tracking performance has been observed by fusing the empirical posterior probability density functions obtained using both types of sensors.},
	keywords = {acoustic, applications;, audio, audio-visual, beam-forming, Carlo, chain, density, detection;, direction-of-arrival, DOA, empirical, estimation;, framework;, functions;, fusion, fusion;, joint, Markov, methods;, Monte, moving, multimodal, object, optical, posterior, probability, probability;, processes;, processing;, sensing;, sensor, sensors;, signal, Surveillance, surveillance;, systems;, target, techniques;, tracking;, vehicle, video},
	doi = {10.1109/ICASSP.2004.1326664},
	author = {Chellapa, Rama and Qian,Gang and Qinfen Zheng}
}
@article {12680,
	title = {Video-Based Automatic Target Recognition},
	year = {2004},
	month = {2004/12//},
	institution = {MARYLAND UNIV COLLEGE PARK CENTER FOR AUTOMATION RESEARCH},
	abstract = {We present an approach for vehicle classification in IR video sequences by integrating detection, tracking and recognition. The method has two steps. First, the moving target is automatically detected using a detection algorithm. Next, we perform simultaneous tracking and recognition using an appearance-model based particle filter. The tracking result is evaluated at each frame. Low confidence in tracking performance initiates a new cycle of detection, tracking and classification. We demonstrate the robustness of the proposed method using outdoor IR video sequences.},
	keywords = {*SEQUENCES(MATHEMATICS), *TARGET RECOGNITION, *VEHICLES, *VIDEO RECORDING, algorithms, AUTOMATIC TRACKING., COMPONENT REPORTS, MOVING TARGETS, SURFACE TRANSPORTATION AND EQUIPMENT, SYMPOSIA, TARGET CLASSIFICATION, TARGET DIRECTION, RANGE AND POSITION FINDING, tracking, VIDEO SIGNALS},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA431617},
	author = {Zhou,S. K and Chellapa, Rama and Mei,Xue and Wu,Hao and Qinfen Zheng}
}
@article {12682,
	title = {Visual tracking and recognition using appearance-adaptive models in particle filters},
	journal = {IEEE Transactions on Image Processing},
	volume = {13},
	year = {2004},
	month = {2004/11//},
	pages = {1491 - 1506},
	abstract = {We present an approach that incorporates appearance-adaptive models in a particle filter to realize robust visual tracking and recognition algorithms. Tracking needs modeling interframe motion and appearance changes, whereas recognition needs modeling appearance changes between frames and gallery images. In conventional tracking algorithms, the appearance model is either fixed or rapidly changing, and the motion model is simply a random walk with fixed noise variance. Also, the number of particles is typically fixed. All these factors make the visual tracker unstable. To stabilize the tracker, we propose the following modifications: an observation model arising from an adaptive appearance model, an adaptive velocity motion model with adaptive noise variance, and an adaptive number of particles. The adaptive-velocity model is derived using a first-order linear predictor based on the appearance difference between the incoming observation and the previous particle configuration. Occlusion analysis is implemented using robust statistics. Experimental results on tracking visual objects in long outdoor and indoor video sequences demonstrate the effectiveness and robustness of our tracking algorithm. We then perform simultaneous tracking and recognition by embedding them in a particle filter. For recognition purposes, we model the appearance changes between frames and gallery images by constructing the intra- and extrapersonal spaces. Accurate recognition is achieved when confronted by pose and view variations.},
	keywords = {adaptive filters, adaptive noise variance, algorithms, appearance-adaptive model, Artificial intelligence, Cluster Analysis, Computer Graphics, Computer simulation, Feedback, Filtering, first-order linear predictor, hidden feature removal, HUMANS, Image Enhancement, Image Interpretation, Computer-Assisted, image recognition, Information Storage and Retrieval, Kinematics, Laboratories, Male, Models, Biological, Models, Statistical, MOTION, Movement, Noise robustness, Numerical Analysis, Computer-Assisted, occlusion analysis, Particle filters, Particle tracking, Pattern Recognition, Automated, Predictive models, Reproducibility of results, robust statistics, Sensitivity and Specificity, Signal Processing, Computer-Assisted, State estimation, statistical analysis, Subtraction Technique, tracking, Training data, visual recognition, visual tracking},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2004.836152},
	author = {Zhou,Shaohua Kevin and Chellapa, Rama and Moghaddam, B.}
}
@article {16497,
	title = {Wide area performance monitoring using aggregate latency profiles},
	journal = {Web Engineering},
	year = {2004},
	month = {2004///},
	pages = {771 - 775},
	author = {Zadorozhny,V. and Gal,A. and Raschid, Louiqa and Ye,Q.}
}
@conference {12723,
	title = {Adaptive visual tracking and recognition using particle filters},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {2},
	year = {2003},
	month = {2003/07//},
	pages = {II - 349-52 vol.2 - II - 349-52 vol.2},
	abstract = {This paper presents an improved method for simultaneous tracking and recognition of human faces from video, where a time series model is used to resolve the uncertainties in tracking and recognition. The improvements mainly arise from three aspects: (i) modeling the inter-frame appearance changes within the video sequence using an adaptive appearance model and an adaptive-velocity motion model; (ii) modeling the appearance changes between the video frames and gallery images by constructing intra- and extra-personal spaces; and (iii) utilization of the fact that the gallery images are in frontal views. By embedding them in a particle filter, we are able to achieve a stabilized tracker and an accurate recognizer when confronted by pose and illumination variations.},
	keywords = {adaptive, adaptive-velocity, appearance, extra-personal, Filtering, filters;, image, intra-personal, model;, MOTION, particle, processing;, recognition;, sequence;, sequences;, series, signal, spaces;, theory;, TIME, tracking;, video, visual},
	doi = {10.1109/ICME.2003.1221625},
	author = {Zhou,Shaohua and Chellapa, Rama and Moghaddam, B.}
}
@conference {13493,
	title = {AModel-based Line Detection Algorithm in Documents},
	booktitle = {ICDAR},
	year = {2003},
	month = {2003///},
	pages = {44 - 48},
	author = {Zheng,Y. and Li,H. and David Doermann}
}
@article {13497,
	title = {AParallel Line Detection Algorithm Based on HMMDecoding},
	volume = {LAMP-TR-109,CAR-TR-994,CS-TR-4545,UMIACS-TR-2003-1113},
	year = {2003},
	month = {2003/12//},
	institution = {University of Maryland, College Park},
	abstract = {The detection of groups of parallel lines is important in applications such as form processing and text (handwriting) extraciton in rule lined paper. These tasks can be very challenging in degraded documents where the lines are severely broken. In this paper we propose a novel model-based method which incorporates high level context to detect these lines. After preprocessing and skew correction, we use trained Hidden Markov Models (HMM) to locate the optimal positions of all lines simultaneously, based on the Viterbi decoding. The algorithm is trainable, therefore, it can easily be adapted to different application scenarios. The experiments conducted on known form processing and rule line detection show our method is robust, and achieved better results than other widely used line detection methods, such as the Hough transform, projection or vectorization-based methods.},
	author = {Yefeng Zheng and Huiping Li and David Doermann}
}
@article {13250,
	title = {AUDIO-P2. 1: PITCH AND TIMBRE MANIPULATIONS USING CORTICAL REPRESENTATION OF SOUND},
	journal = {IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS SPEECH AND SIGNAL PROCESSING},
	volume = {5},
	year = {2003},
	month = {2003///},
	author = {Zotkin,Dmitry N and Shamma,S.A. and Ru,P. and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {18172,
	title = {Classification-based spatial error concealment for images},
	booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on},
	volume = {2},
	year = {2003},
	month = {2003/09//},
	pages = {II - 675-8 vol.3 - II - 675-8 vol.3},
	abstract = {This paper presents a new, classification-based spatial error concealment algorithm for images. The proposed scheme takes advantage of two state-of-the-art concealment schemes and adaptively selects a better suitable concealment scheme for each corrupted block. Using a support vector machine (SVM) classifier, our proposed approach outperforms the prior art in terms of the concealment quality and has moderate computational complexity.},
	keywords = {algorithm;, classification-based, classification;, classifier;, complexity;, computational, concealment, error, image, Machine;, machines;, moderate, scheme;, spatial, state-of-the-art, Support, SVM, vector},
	doi = {10.1109/ICIP.2003.1246770},
	author = {Chen,M. and Wu,M. and Zheng,Y.}
}
@article {14110,
	title = {Complete stagnation of},
	journal = {Linear Algebra and its Applications},
	volume = {367},
	year = {2003},
	month = {2003/07/01/},
	pages = {165 - 183},
	abstract = {We study problems for which the iterative method for solving linear systems of equations makes no progress in its initial iterations. Our tool for analysis is a nonlinear system of equations, the stagnation system, that characterizes this behavior. We focus on complete stagnation, for which there is no progress until the last iteration. We give necessary and sufficient conditions for complete stagnation of systems involving unitary matrices, and show that if a normal matrix completely stagnates then so does an entire family of nonnormal matrices with the same eigenvalues. Finally, we show that there are real matrices for which complete stagnation occurs for certain complex right-hand sides but not for real ones.},
	keywords = {Convergence, GMRES, iterative methods, Stagnation},
	isbn = {0024-3795},
	doi = {16/S0024-3795(02)00612-2},
	url = {http://www.sciencedirect.com/science/article/pii/S0024379502006122},
	author = {Zavorin, Ilya and O{\textquoteright}Leary, Dianne P. and Elman, Howard}
}
@article {15730,
	title = {Complete stagnation of GMRES},
	journal = {Linear Algebra and its Applications},
	volume = {367},
	year = {2003},
	month = {2003/07/01/},
	pages = {165 - 183},
	abstract = {We study problems for which the iterative method gmres for solving linear systems of equations makes no progress in its initial iterations. Our tool for analysis is a nonlinear system of equations, the stagnation system, that characterizes this behavior. We focus on complete stagnation, for which there is no progress until the last iteration. We give necessary and sufficient conditions for complete stagnation of systems involving unitary matrices, and show that if a normal matrix completely stagnates then so does an entire family of nonnormal matrices with the same eigenvalues. Finally, we show that there are real matrices for which complete stagnation occurs for certain complex right-hand sides but not for real ones.},
	keywords = {Convergence, GMRES, iterative methods, Stagnation},
	isbn = {0024-3795},
	doi = {10.1016/S0024-3795(02)00612-2},
	url = {http://www.sciencedirect.com/science/article/pii/S0024379502006122},
	author = {Zavorin, Ilya and O{\textquoteright}Leary,Dianne P. and Elman, Howard}
}
@article {13752,
	title = {Cross-language headline generation for Hindi},
	journal = {ACM Transactions on Asian Language Information Processing (TALIP)},
	volume = {2},
	year = {2003},
	month = {2003/09//},
	pages = {270 - 289},
	abstract = {This paper presents new approaches to headline generation for English newspaper texts, with an eye toward the production of document surrogates for document selection in cross-language information retrieval. This task is difficult because the user must make decisions about relevance based on (often poor) translations of retrieved documents. To facilitate the decision-making process we need translations that can be assessed rapidly and accurately; our approach is to provide an English headline for the non-English document. We describe two approaches to headline generation and their application to the recent DARPA TIDES-2003 Surprise Language Exercise for Hindi. For comparison, we also implemented an alternative method for surrogate generation: a system that produces topic lists for (Hindi) articles. We present the results of a series of experiments comparing each of these approaches. We demonstrate in both automatic and human evaluations that our linguistically motivated approach outperforms two other surrogate-generation methods: a statistical system and a topic discovery system.},
	isbn = {1530-0226},
	doi = {10.1145/979872.979878},
	url = {http://doi.acm.org/10.1145/979872.979878},
	author = {Dorr, Bonnie J and Zajic, David and Schwartz,Richard}
}
@article {17813,
	title = {A Deductive Database Approach to AI Planning},
	journal = {Journal of Intelligent Information Systems},
	volume = {20},
	year = {2003},
	month = {2003///},
	pages = {215 - 253},
	abstract = {In this paper, we show that the classical A.I. planning problem can be modelled using simple database constructs with logic-based semantics. The approach is similar to that used to model updates and nondeterminism in active database rules. We begin by showing that planning problems can be automatically converted to Datalog1S programs with nondeterministic choice constructs, for which we provide a formal semantics using the concept of stable models. The resulting programs are characterized by a syntactic structure (XY-stratification) that makes them amenable to efficient implementation using compilation and fixpoint computation techniques developed for deductive database systems. We first develop the approach for sequential plans, and then we illustrate its flexibility and expressiveness by formalizing a model for parallel plans, where several actions can be executed simultaneously. The characterization of parallel plans as partially ordered plans allows us to develop (parallel) versions of partially ordered plans that can often be executed faster than the original partially ordered plans.},
	doi = {10.1023/A:1022808724136},
	author = {Brogi,A. and V.S. Subrahmanian and Zaniolo,C.}
}
@article {17108,
	title = {Dynamic query choropleth maps for information seeking and decision making},
	journal = {Proc. Human-Computer Interaction International},
	year = {2003},
	month = {2003///},
	abstract = {Information retrieval and visualization can be combined in dynamic query systems that allow users unparalleled access to information for decision making. In this paper, we report on the development and evaluation of a dynamic query system (YMap) that displays information on a chloropleth map using double thumb sliders to select ranges of query variables. The YMap prototype is a Java-Applet that supports panning and zooming. Several usability studies were conducted on early prototypes that resulted in the current version. Applications of YMap for decision making tasks are discussed.},
	author = {Norman,K. and Zhao,H. and Shneiderman, Ben and Golub,E.}
}
@article {18393,
	title = {Experimental validation of new software technology},
	journal = {SERIES ON SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING},
	volume = {12},
	year = {2003},
	month = {2003///},
	pages = {229 - 263},
	abstract = {When to apply a new technology in an organization is acritical decision for every software development
organization. Earlier work defines a set of methods that the
research community uses when a new technology is
developed. This chapter presents a discussion of the set of
methods that industrial organizations use before adopting a
new technology. First there is a brief definition of the
earlier research methods and then a definition of the set of
industrial methods. A comparison of the two sets leads into
the perspectives of these methods of experts in the research
and industrial community via surveys made to those
communities.
},
	author = {Zelkowitz, Marvin V and Wallace,D. R and Binkley,D. W}
}
@article {12717,
	title = {Face recognition: A literature survey},
	journal = {ACM Comput. Surv.},
	volume = {35},
	year = {2003},
	month = {2003/12//},
	pages = {399 - 458},
	abstract = {As one of the most successful applications of image analysis and understanding, face recognition has recently received significant attention, especially during the past several years. At least two reasons account for this trend: the first is the wide range of commercial and law enforcement applications, and the second is the availability of feasible technologies after 30 years of research. Even though current machine recognition systems have reached a certain level of maturity, their success is limited by the conditions imposed by many real applications. For example, recognition of face images acquired in an outdoor environment with changes in illumination and/or pose remains a largely unsolved problem. In other words, current systems are still far away from the capability of the human perception system.This paper provides an up-to-date critical survey of still- and video-based face recognition research. There are two underlying motivations for us to write this survey paper: the first is to provide an up-to-date review of the existing literature, and the second is to offer some insights into the studies of machine recognition of faces. To provide a comprehensive survey, we not only categorize existing recognition techniques but also present detailed descriptions of representative methods within each category. In addition, relevant topics such as psychophysical studies, system evaluation, and issues of illumination and pose variation are covered.},
	keywords = {face recognition, person identification},
	isbn = {0360-0300},
	doi = {10.1145/954339.954342},
	url = {http://doi.acm.org/10.1145/954339.954342},
	author = {Zhao, W. and Chellapa, Rama and Phillips,P.J. and Rosenfeld, A.}
}
@conference {13562,
	title = {Groundtruth Image Generation from Electronic Text (Demonstration)},
	booktitle = {Symposium on Document Image Understanding Technology},
	year = {2003},
	month = {2003/04//},
	pages = {309 - 312},
	author = {David Doermann and Zi,G.}
}
@article {13234,
	title = {Guest editors{\textquoteright} Introduction to the special section on energy minimization methods in computer vision and pattern recognition},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {25},
	year = {2003},
	month = {2003/11//},
	pages = {1361 - 1363},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2003.1240110},
	author = {Figueiredo,M.A.T. and Hancock,E.R. and Pelillo,M. and Zerubia, J.}
}
@conference {13785,
	title = {Hedge Trimmer: a parse-and-trim approach to headline generation},
	booktitle = {Proceedings of the HLT-NAACL 03 on Text summarization workshop - Volume 5},
	series = {HLT-NAACL-DUC {\textquoteright}03},
	year = {2003},
	month = {2003///},
	pages = {1 - 8},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {This paper presents Hedge Trimmer, a HEaDline GEneration system that creates a headline for a newspaper story using linguistically-motivated heuristics to guide the choice of a potential headline. We present feasibility tests used to establish the validity of an approach that constructs a headline by selecting words in order from a story. In addition, we describe experimental results that demonstrate the effectiveness of our linguistically-motivated approach over a HMM-based model, using both human evaluation and automatic metrics for comparing the two approaches.},
	doi = {10.3115/1119467.1119468},
	url = {http://dx.doi.org/10.3115/1119467.1119468},
	author = {Dorr, Bonnie J and Zajic, David and Schwartz,Richard}
}
@conference {13236,
	title = {HRTF personalization using anthropometric measurements},
	booktitle = {Applications of Signal Processing to Audio and Acoustics, 2003 IEEE Workshop on.},
	year = {2003},
	month = {2003/10//},
	pages = {157 - 160},
	abstract = {Individualized head related transfer functions (HRTFs) are needed for accurate rendering of spatial audio, which is important in many applications. Since these are relatively tedious to acquire, they may not be acceptable for some applications. A number of studies have sought to perform simple customization of the HRTF. We propose and test a strategy for HRTF personalization, based on matching certain anthropometric ear parameters with the HRTF database, and the incorporation of a low-frequency "head-and-torso" model. We present preliminary tests aimed at evaluation of this customization. Results show that the approach improves both the accuracy of the localization and subjective perception of the virtual auditory scene.},
	keywords = {acoustic, anthropometric, audio, audio;, auditory, Ear, functions;, Head, head-and-torso, HRTF, individualized, localization;, measurements;, model;, models;, parameters;, perception;, personalization;, physiological, processing;, related, scattering;, scene;, signal, sound, spatial, subjective, transfer, virtual, wave},
	doi = {10.1109/ASPAA.2003.1285855},
	author = {Zotkin,Dmitry N and Hwang,J. and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {13243,
	title = {Human body pose estimation using silhouette shape analysis},
	booktitle = {Proceedings. IEEE Conference on Advanced Video and Signal Based Surveillance, 2003.},
	year = {2003},
	month = {2003/07//},
	pages = {263 - 270},
	abstract = {We describe a system for human body pose estimation from multiple views that is fast and completely automatic. The algorithm works in the presence of multiple people by decoupling the problems of pose estimation of different people. The pose is estimated based on a likelihood function that integrates information from multiple views and thus obtains a globally optimal solution. Other characteristics that make our method more general than previous work include: (1) no manual initialization; (2) no specification of the dimensions of the 3D structure; (3) no reliance on some learned poses or patterns of activity; (4) insensitivity to edges and clutter in the background and within the foreground. The algorithm has applications in surveillance and promising results have been obtained.},
	keywords = {3D, analysis;, body, classification;, clutter;, detection;, estimation;, extraction;, feature, function;, human, image, likelihood, multiple, object, parameter, parameters;, Pixel, pose, probability;, segmentation;, segmentations;, SHAPE, silhouette, structure;, surveillance;, views;},
	doi = {10.1109/AVSS.2003.1217930},
	author = {Mittal,A. and Liang Zhao and Davis, Larry S.}
}
@article {17220,
	title = {Image-based highly interactive Web mapping for geo-referenced data publishing},
	journal = {Technical Reports from UMIACS},
	year = {2003},
	month = {2003/01/21/},
	abstract = {This paper describes an image-based technique that enables highly interactiveWeb choropleth maps for geo-referenced data publishing and visual exploration.
Geographic knowledge is encoded into raster images and delivered to the client,
instead of in vector formats. Differing from traditional raster-image-based
approaches that are static and allow very little user interaction, it allows
varieties of sub-second fine-grained interface controls such as dynamic query,
dynamic classification, geographic object data identification, user setting
adjusting, as well as turning on/off layers, panning and zooming, with no or
minimum server support. Compared to Web GIS approaches that are based on vector
geographic data, this technique has the features of short initial download time,
near-constant performance scalability for larger numbers of geographic objects,
and download-map-segment-only-when-necessary which potentially reduces the
overall data transfer over the network. As a result, it accommodates general   
public users with slow modem network connections and low-end machines, as well
as users with fast T-1 connections and fast machines. The client-side (browser)
is implemented as light-weight Java applets. YMap, an easy-to-use,
user-task-oriented highly interactive mapping tool prototype for visual
geo-referenced data exploration is implemented using this technique.
(UMIACS-TR-2003-02)
(HCIL-TR-2002-26)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/1248},
	author = {Zhao,Haixia and Shneiderman, Ben}
}
@article {18907,
	title = {IMPACTing SHOP: Putting an AI Planner Into a Multi-Agent Environment},
	journal = {Annals of Mathematics and Artificial Intelligence},
	volume = {37},
	year = {2003},
	month = {2003///},
	pages = {381 - 407},
	abstract = {In this paper we describe a formalism for integrating the SHOP HTN planning system with the IMPACT multi-agent environment. We define the A-SHOP algorithm, an agentized adaptation of the SHOP planning algorithm that takes advantage of IMPACT{\textquoteright}s capabilities for interacting with external agents, performing mixed symbolic/numeric computations, and making queries to distributed, heterogeneous information sources (such as arbitrary legacy and/or specialized data structures or external databases). We show that A-SHOP is both sound and complete if certain conditions are met.},
	keywords = {Computer science},
	isbn = {1012-2443},
	doi = {10.1023/A:1021560510377},
	url = {http://www.springerlink.com/content/g4r0mn835846p65w/abstract/},
	author = {Dix,J{\"u}rgen and Mu{\~n}oz-Avila,H{\'e}ctor and Nau, Dana S. and Zhang,Lingling}
}
@article {16124,
	title = {Improving Accessibility and Usability of Geo-referenced Statistical Data},
	year = {2003},
	month = {2003/06/04/},
	abstract = {Several technology breakthroughs are needed to achieve the goals ofuniversal accessibility and usability. These goals are especially
challenging in the case of geo-referenced statistical data that many U.S.
government agencies supply. We present technical and user-interface design
challenges in accommodating users with low-end technology (slow network
connection and low-end machine) and users who are blind or
vision-impaired. Our solutions are presented and future work is discussed.
(UMIACS-TR-2003-37)
(HCIL-2003-11)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/1277},
	author = {Zhao,Haixia and Plaisant, Catherine and Shneiderman, Ben}
}
@article {17229,
	title = {In vivo filtering of in vitro expression data reveals MyoD targets},
	journal = {Comptes Rendus Biologies},
	volume = {326},
	year = {2003},
	month = {2003/10//},
	pages = {1049 - 1065},
	abstract = {A published set of downstream targets of MyoD defined in a well-controlled in vitro experiment was filtered for relevance to muscle regeneration using a 27-time-point in vivo murine regeneration series. Using interactive hierarchical and Bayes soft clustering, only a minority of the targets defined in vitro can be confirmed in vivo (\~{}50\% of induced transcripts, and none of repressed transcripts). This approach provided strong support that 18 targets including of MyoD are biologically relevant during myoblast differentiation. To cite this article: P.~Zhao et al., C.~R. Biologies 326 (2003).},
	keywords = {clustering, expression profiling, Microarray, micror{\'e}seaux, muscle regeneration, MyoD, profil d{\textquoteright}expression, r{\'e}g{\'e}n{\'e}ration musculaire, regroupement},
	isbn = {1631-0691},
	doi = {10.1016/j.crvi.2003.09.035},
	url = {http://www.sciencedirect.com/science/article/pii/S1631069103002324},
	author = {Zhao,Po and Seo,Jinwook and Wang,Zuyi and Wang,Yue and Shneiderman, Ben and Hoffman,Eric P}
}
@conference {12782,
	title = {The integrated CWB-NC/PIOAtool for functional verification and performance analysis of concurrent systems},
	booktitle = {Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems},
	year = {2003},
	month = {2003///},
	pages = {431 - 436},
	author = {Zhang,D. and Cleaveland, Rance and Stark,E. W}
}
@article {16418,
	title = {The interaction between zoning regulations and residential preferences as a driver of urban form},
	journal = {Proceedings of the 2003 UTEP Distinguished Faculty and Student Symposium},
	year = {2003},
	month = {2003///},
	author = {Zellner,M.L. and Riolo,R and Rand, William and Page,S.E. and Brown,D.G. and Fernandez,L.E.}
}
@conference {17248,
	title = {Interactive color mosaic and dendrogram displays for signal/noise optimization in microarray data analysis},
	booktitle = {Multimedia and Expo, 2003. ICME{\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {3},
	year = {2003},
	month = {2003///},
	pages = {III{\textendash}461 - III{\textendash}461},
	abstract = {Data analysis and visualization is strongly influenced by noise and noise filters. There are multiple sources of oisein microarray data analysis, but signal/noise ratios are rarely optimized, or even considered. Here, we report a noise analysis of a novel 13 million oligonucleotide dataset - 25 human U133A (~500,000 features) profiles of patient muscle biposies. We use our recently described interactive visualization tool, the Hierarchical Clustering Explorer (HCE) to systemically address the effect of different noise filters on resolution of arrays into orrectbiological groups (unsupervised clustering into three patient groups of known diagnosis). We varied probe set interpretation methods (MAS 5.0, RMA), resent callfilters, and clustering linkage methods, and investigated the results in HCE. HCE interactive features enabled us to quickly see the impact of these three variables. Dendrogram displays showed the clustering results systematically, and color mosaic displays provided a visual support for the results. We show that each of these three variables has a strong effect on unsupervised clustering. For this dataset, the strength of the biological variable was maximized, and noise minimized, using MAS 5.0, 10\% present call filter, and Average Group Linkage. We propose a general method of using interactive tools to identify the optimal signal/noise balance or the optimal combination of these three variables to maximize the effect of the desired biological variable on data interpretation.},
	author = {Seo,J. and Bakay,M. and Zhao,P. and Chen,Y.W. and Clarkson,P. and Shneiderman, Ben and Hoffman,E.P.}
}
@conference {16473,
	title = {Latency Profiles: Performance Monitoring for Wide Area Applications},
	booktitle = {Internet Applications, IEEE Workshop on},
	year = {2003},
	month = {2003///},
	pages = {74 - 74},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {Recent technological advances have enabled the deployment of wide area applications against Internet accessible sources. A performance challenge to applications in such a setting is the unpredictable end-to-end latency of accessing these sources. We use passive information gathering mechanisms to learn end-to-end latency distributions and construct Latency Profiles (LPs). We hypothesize that a group of clients, within an autonomous system (AS), that are accessing a content server, in another AS, may be represented by (one or more) LPs. Related networking research on IDMaps, points of congestion, and BGP routes support such hypothesis. We develop aggregate LPs to provide coverage of groups (clusters) of client-server pairs. Using data gathered from a (limited) experiment we demonstrate the feasibility of constructing LPs.},
	doi = {http://doi.ieeecomputersociety.org/10.1109/WIAPP.2003.1210290},
	author = {Raschid, Louiqa and Wen,Hui-Fang and Gal,Avigdor and Zadorozhny,Vladimir}
}
@article {13593,
	title = {Machine Printed Text and Handwriting Identification in Noisy Document Images},
	volume = {LAMP-TR-107,CFAR-TR-992,CS-TR-4531,UMIACS-TR-2003-99},
	year = {2003},
	month = {2003/09//},
	institution = {University of Maryland, College Park},
	abstract = {In this paper we address the problem of the identification of text in noisy document images. We are especially focused on segmenting and identifying between handwriting and machine printed text because: 1) handwriting in a document often indicates corrections, additions, or other supplemental information that should be treated differently from the main content, and 2) the segmentation and recognition techniques requested for machine printed and handwritten text are significantly different. A novel aspect of our approach is that we treat noise as a separate class and model noise based on selected features. Trained Fisher classifiers are used to identify machine printed text and handwriting from noise, and we further exploit context to refine the classification. AMarkov Random Field (MRF) based approach is used to model the geometrical structure of the printed text, handwriting, and noise to rectify misclassifications. Experimental results show that our approach is robust and can significantly improve page segmentation in noisy document collections.},
	author = {Yefeng Zheng and Huiping Li and David Doermann}
}
@conference {18258,
	title = {Nonlinear collusion attacks on independent fingerprints for multimedia},
	booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on},
	volume = {5},
	year = {2003},
	month = {2003/04//},
	pages = {V - 664-7 vol.5 - V - 664-7 vol.5},
	abstract = {Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Collusion attack is a cost effective attack against digital fingerprinting where several copies with the same content but different fingerprints are combined to remove the original fingerprints. In this paper, we investigate average and nonlinear collusion attacks of independent Gaussian fingerprints and study both their effectiveness and the perceptual quality. We also propose the bounded Gaussian fingerprints to improve the perceptual quality of the fingerprinted copies. We further discuss the tradeoff between the robustness against collusion attacks and the perceptual quality of a fingerprinting system.},
	keywords = {attacks;, average, bounded, collusion, computing;, content, copies;, digital, distribution;, fingerprinted, fingerprinting;, fingerprints;, Gaussian, independent, multimedia, nonlinear, perceptual, quality;, robustness;, watermarking;},
	doi = {10.1109/ICASSP.2003.1200058},
	author = {Zhao,Hong and M. Wu and Wang,Z.J. and Liu,K. J.R}
}
@conference {18261,
	title = {Performance of detection statistics under collusion attacks on independent multimedia fingerprints},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {1},
	year = {2003},
	month = {2003/07//},
	pages = {I - 205-8 vol.1 - I - 205-8 vol.1},
	abstract = {Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Collusion attack is a cost effective attack against digital fingerprinting where several copies with the same content but different fingerprints are combined to remove the original fingerprints. In this paper, we consider average attack and several nonlinear collusion attacks on independent Gaussian based fingerprints, and study the detection performance of several commonly used detection statistics in the literature under collusion attacks. Observing that these detection statistics are not specifically designed for collusion scenarios and do not take into account the characteristics of the newly generated fingerprints under collusion attacks, we propose pre-processing techniques to improve the detection performance of the detection statistics under collusion attacks.},
	keywords = {analysis;, attacks;, based, collusion, content;, DETECTION, digital, fingerprint, fingerprinting;, fingerprints;, Gaussian, identification;, independent, multimedia, performance;, preprocessing, processes;, redistribution;, security;, statistical, statistics;, systems;, techniques;, Telecommunication, unauthorized},
	doi = {10.1109/ICME.2003.1220890},
	author = {Zhao,Hong and M. Wu and Wang,Z.J. and Liu,K. J.R}
}
@article {12945,
	title = {Persistence of adhesive properties in Vibrio cholerae after long-term exposure to sea water},
	journal = {Environmental Microbiology},
	volume = {5},
	year = {2003},
	month = {2003/10/01/},
	pages = {850 - 858},
	abstract = {The effect of exposure to artificial sea water (ASW) on the ability of classical Vibrio cholerae O1 cells to interact with chitin-containing substrates and human intestinal cells was studied. Incubation of vibrios in ASW at 5{\textdegree}C and 18{\textdegree}C resulted in two kinds of cell responses: the viable but non-culturable (VBNC) state (i.e.~<0.1 colony forming unit ml-1) at 5{\textdegree}C, and starvation (i.e. maintenance of culturability of the population) at 18{\textdegree}C. The latter remained rod shaped and, after 40~days{\textquoteright} incubation, presented a 47{\textendash}58\% reduction in the number of cells attached to chitin, a 48{\textendash}53\% reduction in the number of bacteria adhering to copepods, and a 48{\textendash}54\% reduction in the number of bacteria adhering to human cultured intestinal cells, compared to control cells not suspended in ASW. Bacteria suspended in ASW at 5{\textdegree}C became coccoid and, after 40~days, showed 34{\textendash}42\% fewer cells attached to chitin, 52{\textendash}55\% fewer adhering to copep-ods, and 45{\textendash}48\% fewer cells adhering to intestinal cell monolayers, compared to controls. Sarkosyl-insoluble membrane proteins that bind chitin particles were isolated and analysed by SDS-PAGE. After 40~days incubation in ASW at both 5{\textdegree}C and 18{\textdegree}C vibrios expressed chitin-binding ligands similar to bacteria harvested in the stationary growth phase. It is concluded that as vibrios do not lose adhesive properties after long-term exposure to ASW, it is important to include methods for VBNC bacteria when testing environmental and clinical samples for purposes of public health safety.},
	isbn = {1462-2920},
	doi = {10.1046/j.1462-2920.2003.00498.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1046/j.1462-2920.2003.00498.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=},
	author = {Pruzzo,Carla and Tarsi,Renato and Del Mar Lle{\`o},Maria and Signoretto,Caterina and Zampini,Massimiliano and Pane,Luigi and Rita R Colwell and Canepari,Pietro}
}
@conference {18469,
	title = {Pitch and timbre manipulations using cortical representation of sound},
	booktitle = {Multimedia and Expo, IEEE International Conference on},
	volume = {3},
	year = {2003},
	month = {2003///},
	pages = {381 - 384},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {The sound receiver at the ears is processed by humans using signal processing that separate the signal along intensity, pitch and timbre dimensions. Conventional Fourier-based signal processing, while endowed with fast algorithms, is unable to easily represent signal along these attributes. In this paper we use a cortical representation to represent the manipulate sound. We briefly overview algorithms for obtaining, manipulating and inverting cortical representation of sound and describe algorithms for manipulating signal pitch and timbre separately. The algorithms are first used to create sound of an instrument between a guitar and a trumpet. Applications to creating maximally separable sounds in auditory user interfaces are discussed.},
	isbn = {0-7803-7965-9},
	doi = {http://doi.ieeecomputersociety.org/10.1109/ICME.2003.1221328},
	author = {Zotkin,Dmitry N and Shamma,S.A. and Ru,P. and Duraiswami, Ramani and Davis, Larry S.}
}
@article {12722,
	title = {Probabilistic recognition of human faces from video},
	journal = {Computer Vision and Image Understanding},
	volume = {91},
	year = {2003},
	month = {2003/07//},
	pages = {214 - 245},
	abstract = {Recognition of human faces using a gallery of still or video images and a probe set of videos is systematically investigated using a probabilistic framework. In still-to-video recognition, where the gallery consists of still images, a time series state space model is proposed to fuse temporal information in a probe video, which simultaneously characterizes the kinematics and identity using a motion vector and an identity variable, respectively. The joint posterior distribution of the motion vector and the identity variable is estimated at each time instant and then propagated to the next time instant. Marginalization over the motion vector yields a robust estimate of the posterior distribution of the identity variable. A computationally efficient sequential importance sampling (SIS) algorithm is developed to estimate the posterior distribution. Empirical results demonstrate that, due to the propagation of the identity variable over time, a degeneracy in posterior probability of the identity variable is achieved to give improved recognition. The gallery is generalized to videos in order to realize video-to-video recognition. An exemplar-based learning strategy is adopted to automatically select video representatives from the gallery, serving as mixture centers in an updated likelihood measure. The SIS algorithm is applied to approximate the posterior distribution of the motion vector, the identity variable, and the exemplar index, whose marginal distribution of the identity variable produces the recognition result. The model formulation is very general and it allows a variety of image representations and transformations. Experimental results using images/videos collected at UMD, NIST/USF, and CMU with pose/illumination variations illustrate the effectiveness of this approach for both still-to-video and video-to-video scenarios with appropriate model choices.},
	keywords = {Exemplar-based learning, face recognition, sequential importance sampling, Still-to-video, Time series state space model, Video-to-video},
	isbn = {1077-3142},
	doi = {10.1016/S1077-3142(03)00080-8},
	url = {http://www.sciencedirect.com/science/article/pii/S1077314203000808},
	author = {Zhou,Shaohua and Krueger,Volker and Chellapa, Rama}
}
@conference {12718,
	title = {Rank constrained recognition under unknown illuminations},
	booktitle = {Analysis and Modeling of Faces and Gestures, 2003. AMFG 2003. IEEE International Workshop on},
	year = {2003},
	month = {2003/10//},
	pages = {11 - 18},
	abstract = {Recognition under illumination variations is a challenging problem. The key is to successfully separate the illumination source from the observed appearance. Once separated, what remains is invariant to illuminant and appropriate for recognition. Most current efforts employ a Lambertian reflectance model with varying albedo field ignoring both attached and cast shadows, but restrict themselves by using object-specific samples, which undesirably deprives them of recognizing new objects not in the training samples. Using rank constraints on the albedo and the surface normal, we accomplish illumination separation in a more general setting, e.g., with class-specific samples via a factorization approach. In addition, we handle shadows (both attached and cast ones) by treating them as missing values, and resolve the ambiguities in the factorization method by enforcing integrability. As far as recognition is concerned, a bootstrap set which is just a collection of two-dimensional image observations can be utilized to avoid the explicit requirement that three-dimensional information be available. Our approaches produce good recognition results as shown in our experiments using the PIE database.},
	keywords = {albedo, approach;, constrained, database;, databases;, decomposition;, factorization, field;, illumination, image;, information;, Lambertian, lighting;, model;, object, object-specific, PIE, rank, recognition;, reflectance, samples;, singular, three-dimensional, two-dimensional, value, variations;, visual},
	doi = {10.1109/AMFG.2003.1240818},
	author = {Zhou, S. and Chellapa, Rama}
}
@conference {18266,
	title = {Resistance of orthogonal Gaussian fingerprints to collusion attacks},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {1},
	year = {2003},
	month = {2003/07//},
	pages = {I - 617-20 vol.1 - I - 617-20 vol.1},
	abstract = {Digital fingerprinting is a means to offer protection to digital data by which fingerprints embedded in the multimedia are capable of identifying unauthorized use of digital content. A powerful attack that can be employed to reduce this tracing capability is collusion. In this paper, we study the collusion resistance of a fingerprinting system employing Gaussian distributed fingerprints and orthogonal modulation. We propose a likelihood-based approach to estimate the number of colluders, and introduce the thresholding detector for colluder identification. We first analyze the collusion resistance of a system to the average attack by considering the probability of a false negative and the probability of a false positive when identifying colluders. Lower and upper bounds for the maximum number of colluders K<sub>max</sub> are derived. We then show that the detectors are robust to different attacks. We further study different sets of performance criteria.},
	keywords = {approach;, attacks;, capability;, collusion, data, data;, digital, distributed, embedded, fingerprinting;, fingerprints;, Gaussian, likelihood-based, modulation;, multimedia, of, orthogonal, probability;, processes;, protection;, Security, systems;, tracing},
	doi = {10.1109/ICME.2003.1220993},
	author = {Wang,Z.J. and M. Wu and Zhao,Hong and Liu,K. J.R and Trappe,W.}
}
@conference {12732,
	title = {Simultaneous tracking and recognition of human faces from video},
	booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on},
	volume = {3},
	year = {2003},
	month = {2003/04//},
	pages = {III - 225-8 vol.3 - III - 225-8 vol.3},
	abstract = {The paper investigates the interaction between tracking and recognition of human faces from video under a framework proposed earlier (Shaohua Zhou et al., Proc. 5th Int. Conf. on Face and Gesture Recog., 2002; Shaohua Zhou and Chellappa, R., Proc. European Conf. on Computer Vision, 2002), where a time series model is used to resolve the uncertainties in both tracking and recognition. However, our earlier efforts employed only a simple likelihood measurement in the form of a Laplacian density to deal with appearance changes between frames and between the observation and gallery images, yielding poor accuracies in both tracking and recognition when confronted by pose and illumination variations. The interaction between tracking and recognition was not well understood. We address the interdependence between tracking and recognition using a series of experiments and quantify the interacting nature of tracking and recognition.},
	keywords = {appearance, changes;, density;, Face, human, illumination, Laplacian, model;, optical, pose, processing;, recognition;, series, series;, signal, TIME, tracking;, variations;, video, video;},
	doi = {10.1109/ICASSP.2003.1199148},
	author = {Zhou,Shaohua and Chellapa, Rama}
}
@book {14916,
	title = {Special section on perceptual organization in computer vision},
	year = {2003},
	month = {2003///},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	author = {Jacobs, David W. and Lindenbaum,M. and August,J. and Zucker,SW and Ben-Shahar,O. and Zucker,SW and Tuytelaars,T. and Turina,A. and Van Gool,L. and Mahamud,S.}
}
@article {16410,
	title = {Statistical validation of spatial patterns in agent-based models},
	journal = {Proceedings of Agent Based Simulation},
	volume = {4},
	year = {2003},
	month = {2003///},
	abstract = {We present and evaluate an agent-based model(ABM) of land use change at the rural-urban fringe.
This paper is part of a project that links the ABM
to surveys of residential preferences and historical
patterns of development. Validation is an important
issue for such models and we discuss the use of
distributional phenomena as a method of validation.
We then highlight the ability of our ABM to gen-
erate two phenomena evident in empirical analysis
of urban development patterns: a power law rela-
tionship between frequency and cluster size and a
negative exponential relationship between density
and distance from city center. We discuss these
results in the light of validation of ABMs.
},
	author = {Rand, William and Brown,D.G. and Page,S.E. and Riolo,R and Fernandez,L.E. and Zellner,M}
}
@conference {13666,
	title = {Text Identification in Noisy Document Images Using Markov Random Field},
	booktitle = {ICDAR},
	year = {2003},
	month = {2003///},
	pages = {599 - 603},
	author = {Zheng,Y. and Li,H. and David Doermann}
}
@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 {12724,
	title = {View synthesis of articulating humans using visual hull},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {1},
	year = {2003},
	month = {2003/07//},
	pages = {I - 489-92 vol.1 - I - 489-92 vol.1},
	abstract = {In this paper, we present a method, which combines image-based visual hull and human body part segmentation for overcoming the inability of the visual hull method to reconstruct concave regions. The virtual silhouette image corresponding to the given viewing direction is first produced with image-based visual hull. Human body part localization technique is used to segment the input images and the rendered virtual silhouette image into convex body parts. The body parts in the virtual view are generated separately from the corresponding body parts in the input views and then assembled together. The previously rendered silhouette image is used to locate the corresponding body parts in input views and avoid the unconnected or squeezed regions in the assembled final view. Experiments show that this method can improve the reconstruction of concave regions for human postures and texture mapping.},
	keywords = {analysis;, body, convex, gesture, hull;, human, image, image-based, image;, mapping;, MOTION, part, parts;, postures;, recognition;, reconstruction;, segmentation;, silhouette, synthesis;, TEXTURE, texture;, view, virtual, visual},
	doi = {10.1109/ICME.2003.1220961},
	author = {Yue,Zhanfeng and Liang Zhao and Chellapa, Rama}
}
@article {13727,
	title = {Automatic headline generation for newspaper stories},
	journal = {Proceedings of the ACL-2002 Workshop on Text Summarization},
	year = {2002},
	month = {2002///},
	abstract = {In this paper we propose a novelapplication of Hidden Markov Models to
automatic generation of informative headlines
for English texts. We propose four decoding
parameters to make the headlines appear more
like Headlinese, the language of informative
newspaper headlines. We also allow for
morphological variation in words between
headline and story English. Informal and formal
evaluations indicate that our approach produces
informative headlines, mimicking a Headlinese
style generated by humans.
},
	author = {Zajic, David and Dorr, Bonnie J and Schwartz,R.}
}
@article {12759,
	title = {A Bayesian Approach to Simultaneous Motion Estimation of Multiple Independently Moving Objects},
	journal = {INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION},
	volume = {16},
	year = {2002},
	month = {2002///},
	pages = {309 - 314},
	abstract = {In this paper, the problem of simultaneous motion estima-tion of multiple independently moving objects is addressed.
A novel Bayesian approach is designed for solving this prob-
lem using the sequential importance sampling (SIS) method.
In the proposed algorithm, a balancing step is added into the
SIS procedure to preserve samples of low weights so that all
objects have enough samples to propagate empirical motion
distributions. By using the proposed algorithm, the relative
motions of all moving objects with respect to camera can be
simultaneously estimated . This algorithm has been tested
on both synthetic and real image sequences. Improved re-
sults have been achieved.
},
	author = {Qian, G. and Chellapa, Rama and Zheng,Q.}
}
@conference {12753,
	title = {Bayesian methods for face recognition from video},
	booktitle = {Acoustics, Speech, and Signal Processing (ICASSP), 2002 IEEE International Conference on},
	volume = {4},
	year = {2002},
	month = {2002/05//},
	pages = {IV-4068 -IV-4071 - IV-4068 -IV-4071},
	abstract = {Face recognition (FR) from video necessitates simultaneously solving two asks, recognition and tracking. To accommodate the video, a time series state space model is introduced in a Bayesian approach. Given this model, the goal reduces to estimating the posterior distribution of the state vector given the observations up to the present. The Sequential Importance Sampling (SIS) technique is invoked to generate a numerical solution to this model. However, the ultimate goal is to estimate the posterior distribution of the identity of humans for recognition purposes. Presented here are two methods to approximate the above distribution under different experimental scenarios.},
	doi = {10.1109/ICASSP.2002.5745551},
	author = {Chellapa, Rama and Zhou,Shaohua and Li,Baoxin}
}
@conference {12758,
	title = {Bayesian structure from motion using inertial information},
	booktitle = {Image Processing. 2002. Proceedings. 2002 International Conference on},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {III-425 - III-428 vol.3 - III-425 - III-428 vol.3},
	abstract = {A novel approach to Bayesian structure from motion (SfM) using inertial information and sequential importance sampling (SIS) is presented. The inertial information is obtained from camera-mounted inertial sensors and is used in the Bayesian SfM approach as prior knowledge of the camera motion in the sampling algorithm. Experimental results using both synthetic and real images show that, when inertial information is used, more accurate results can be obtained or the same estimation accuracy can be obtained at a lower cost.},
	keywords = {3D, analysis;, Bayes, Bayesian, camera, estimation;, image, images;, importance, inertial, information;, methods;, MOTION, motion;, parameter, processing;, real, reconstruction;, sampling;, scene, sensors;, sequence;, sequences;, sequential, signal, structure-from-motion;, synthetic, systems;, video},
	doi = {10.1109/ICIP.2002.1038996},
	author = {Qian,Gang and Chellapa, Rama and Qinfen Zheng}
}
@conference {17575,
	title = {Clustering and server selection using passive monitoring},
	booktitle = {IEEE INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {1717- 1725 vol.3 - 1717- 1725 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We consider the problem of client assignment in a distributed system of content servers. We present a system called Webmapper for clustering IP addresses and assigning each cluster to an optimal content server. The system is passive in that the only information it uses comes from monitoring the TCP connections between the clients and the servers. It is also flexible in that it makes no a priori assumptions about network topology and server placement and it can react quickly to changing network conditions. We present experimental results to evaluate the performance of Webmapper.},
	keywords = {client assignment, client-server systems, clustering, content servers, Delay, distributed system, Educational institutions, Internet, IP addresses, Monitoring, network conditions, Network servers, Network topology, optimal content server, passive monitoring, server selection, Space technology, TCPIP, Transport protocols, Web pages, Web server, Webmapper},
	isbn = {0-7803-7476-2},
	doi = {10.1109/INFCOM.2002.1019425},
	author = {Andrews,M. and Shepherd,B. and Srinivasan, Aravind and Winkler,P. and Zane,F.}
}
@article {16411,
	title = {The complex interaction of agents and environments: An example in urban sprawl},
	journal = {Proceedings of Agent Based Simulation},
	year = {2002},
	month = {2002///},
	pages = {149 - 161},
	abstract = {We present and evaluate a foundational agent-based model of land use change at therural-urban fringe within the context of a larger project that will link to surveys of
the environmental and community preferences of residents with historical data on
patterns of development. In this paper, we focus on the dynamics arising from a
model of residential location resulting from preferences for services, density, and
aesthetics focusing on the relationship between micro level preferences and policy
relevant macro phenomena such as scattered development, largest city size, and the
number of residential clusters. We consider two representations of agents{\textquoteright} utility
functions {\textendash} one additively separable and one multiplicative {\textendash} to see if functional form
has any impact on the dynamics of the system, and find that they produce similar
results. Our analysis includes both representative agent runs, in which all agents have
identical preferences, as well as runs in which the agents have diverse preferences. We
find that diversity can increase sprawl through feedbacks associated with the spatial
locations of services and agents. In addition, we examine cases in which the agents{\textquoteright}
location decisions affect the aesthetic quality of neighboring sites and find that these
feedbacks further exacerbate the sprawl effect.
},
	author = {Rand, William and Zellner,M and Page,S.E. and Riolo,R and Brown,D.G. and Fernandez,L.E.}
}
@conference {18471,
	title = {Creation of virtual auditory spaces},
	booktitle = {2002 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},
	volume = {2},
	year = {2002},
	month = {2002/05//},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {High-quality virtual audio scene rendering is a must for emerging virtual/augmented reality applications and for perceptual user interfaces. We describe algorithms for creation of virtual auditory spaces using measured and non-individualized HRTFs and head tracking. Details of algorithms for HRTF interpolation, room impulse response creation, and audio scene presentation are presented. Tests show that individuals externalize well, and find our interface natural. The system runs in real time with latency of less than 30 ms on an office PC without specialized DSP.},
	keywords = {accuracy, Estimation, Finite impulse response filter, Heating, Program processors, Rendering (computer graphics), System-on-a-chip},
	isbn = {0-7803-7402-9},
	doi = {10.1109/ICASSP.2002.5745052},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {18474,
	title = {Customizable auditory displays},
	booktitle = {Proceedings of the International Conference on Auditory Display},
	year = {2002},
	month = {2002///},
	pages = {167 - 176},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S.}
}
@article {13759,
	title = {Domain-Specific Term-List Expansion Using Existing Linguistic Resources},
	year = {2002},
	month = {2002/08//},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This report describes a series of experiments involving expansion of a domain-specific human-generated "seed list" using available linguistic resources. The resources used for the expansion are intended to be general purpose: two large-scale Chinese-English dictionaries and a Chinese lexical knowledge base (HowNet). The methodology involves three steps: (1) hand extraction of head words from each entry in the human-generated seed list; (2) automatic comparison of these head words against entries in the linguistic resources-where an entry matches if the head word matches the entry exactly or is included in its the semantic definition; and (3) collection of any resulting matching entries into a larger term list. The terms extracted by this process were verified manually to confirm whether they were relevant to the topic of a specific domain. An important contribution of this work is the finding that the use of a bilingual term list for the expansion proces does not provide a significant improvement over the use of a simpler, more easily produced, monoligual term list.},
	keywords = {*LEXICOGRAPHY, *LINGUISTICS, AUTOMATIC, CHINA, COMPARISON, EXTRACTION, HANDS, knowledge based systems, linguistics, resources, WORDS(LANGUAGE)},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA525800},
	author = {Dorr, Bonnie J and Zhao,Tiejun}
}
@conference {18384,
	title = {Empirical evaluation of techniques and methods used for achieving and assessing software high dependability},
	booktitle = {Proc. DSN Workshop on Dependability Benchmarking},
	year = {2002},
	month = {2002///},
	author = {Rus,I. and Basili, Victor R. and Zelkowitz, Marvin V and Boehm,B.}
}
@article {18385,
	title = {Empirical findings in agile methods},
	journal = {Extreme Programming and Agile Methods{\textemdash}XP/Agile Universe 2002},
	year = {2002},
	month = {2002///},
	pages = {81 - 92},
	abstract = {In recent years, the use of, interest in, and controversy about Agile methodologies have realized dramatic growth. Anecdotal evidence is rising regarding the effectiveness of agile methodologies in certain environments and for specified projects. However, collection and analysis of empirical evidence of this effectiveness and classification of appropriate environments for Agile projects has not been conducted. Researchers from four institutions organized an eWorkshop to synchronously and virtually discuss and gather experiences and knowledge from eighteen Agile experts spread across the globe. These experts characterized Agile Methods and communicated experiences using these methods on small to very large teams. They discussed the importance of staffing Agile teams with highly skilled developers. They shared common success factors and identified warning signs of problems in Agile projects. These and other findings and heuristics gathered through this valuable exchange can be useful to researchers and to practitioners as they establish an experience base for better decision making.},
	doi = {10.1007/3-540-45672-4_19},
	author = {Lindvall,M. and Basili, Victor R. and Boehm,B. and Costa,P. and Dangle,K. and Shull, F. and Tesoriero,R. and Williams,L. and Zelkowitz, Marvin V}
}
@article {17146,
	title = {Expandable indexes vs. sequential menus for searching hierarchies on the World Wide Web},
	journal = {Behaviour \& Information Technology},
	volume = {21},
	year = {2002},
	month = {2002///},
	pages = {201 - 207},
	abstract = {An experiment is reported that compared expandable indexes providing full menu context with sequential menus providing only partial context. Menu depth was varied using hierarchies of two, three and four levels deep in an asymmetric structure of 457 root level items. Menus were presented on the World Wide Web within a browser. Participants searched for specific targets. Results suggest that reducing the depth of hierarchies improves performance in terms of speed and search efficiency. Surprisingly, expandable indexes resulted in poorer performance with deeper hierarchies than did sequential menus.An experiment is reported that compared expandable indexes providing full menu context with sequential menus providing only partial context. Menu depth was varied using hierarchies of two, three and four levels deep in an asymmetric structure of 457 root level items. Menus were presented on the World Wide Web within a browser. Participants searched for specific targets. Results suggest that reducing the depth of hierarchies improves performance in terms of speed and search efficiency. Surprisingly, expandable indexes resulted in poorer performance with deeper hierarchies than did sequential menus.
},
	isbn = {0144-929X},
	doi = {10.1080/0144929021000009045},
	url = {http://www.tandfonline.com/doi/abs/10.1080/0144929021000009045},
	author = {Zaphiris,Panayiotis and Shneiderman, Ben and Norman,Kent L}
}
@conference {12749,
	title = {Face recognition from video: a CONDENSATION approach},
	booktitle = {Automatic Face and Gesture Recognition, 2002. Proceedings. Fifth IEEE International Conference on},
	year = {2002},
	month = {2002/05//},
	pages = {221 - 226},
	abstract = {The aim of this work is to investigate how to exploit the temporal information in a video sequence for the task of face recognition. Following the approach in (Li and Chellappa, 2000), we propose a probabilistic model parameterized by a tracking state vector and a recognizing identity variable, simultaneously characterizing the kinematics and identity of humans. We then invoke a CONDENSATION (Isard and Blake, 1996) approach to provide a numerical solution to the model. Once the joint posterior distribution of the state vector and the identity variable is estimated, we marginalize it over the state vector to yield a robust estimate of the posterior distribution of the identity variable. Due to the propagation of identity and dynamics, a degeneracy in the posterior distribution of the identity variable is achieved to give improved recognition. This evolving behavior is characterized using changes in entropy. The effectiveness of this approach is illustrated using experimental results on low-resolution video data.},
	keywords = {algorithm;experimental, approach;Sequential, CONDENSATION, data;probabilistic, distribution;kinematics;low-resolution, importance, information;tracking, model;state, posterior, recognition;image, recognition;joint, resolution;image, results;face, sampling, sampling;probability;, sequence;face, sequences;importance, state, vector;temporal, vector;video, video},
	doi = {10.1109/AFGR.2002.1004158},
	author = {Zhou,Shaohua and Krueger, V. and Chellapa, Rama}
}
@article {12962,
	title = {Genomic profiles of clinical and environmental isolates of Vibrio cholerae O1 in cholera-endemic areas of Bangladesh},
	journal = {Proceedings of the National Academy of Sciences},
	volume = {99},
	year = {2002},
	month = {2002///},
	pages = {12409 - 12409},
	abstract = {Diversity, relatedness, and ecological interactions of toxigenic Vibrio cholerae O1 populations in two distinctive habitats, the human intestine and the aquatic environment, were analyzed. Twenty environmental isolates and 42 clinical isolates were selected for study by matching serotype, geographic location of isolation in Bangladesh, and season of isolation. Genetic profiling was done by enterobacterial repetitive intergenic consensus sequence{\textendash}PCR, optimized for profiling by using the fully sequenced V. cholerae El Tor N16961 genome. Five significant clonal clusters of haplotypes were found from 57 electrophoretic types. Isolates from different areas or habitats intermingled in two of the five significant clusters. Frequencies of haplotypes differed significantly only between the environmental populations (exact test; P < 0.05). Analysis of molecular variance yielded a population genetic structure reflecting the differentiating effects of geographic area, habitat, and sampling time. Although a parameter confounding the latter differences explained 9\% of the total molecular variance in the entire population (P < 0.01), the net effect of habitat and time could not be separated because of the small number of environmental isolates included in the study. Five subpopulations from a single area were determined, and from these we were able to estimate a relative differentiating effect of habitat, which was small compared with the effect of temporal change. In conclusion, the resulting population structure supports the hypothesis that spatial and temporal fluctuations in the composition of toxigenic V. cholerae populations in the aquatic environment can cause shifts in the dynamics of the disease.},
	isbn = {0027-8424, 1091-6490},
	doi = {10.1073/pnas.192426499},
	url = {http://www.pnas.org/content/99/19/12409},
	author = {Zo,Y. G. and Rivera,I. N. G. and E. Russek-Cohen and Islam,M. S. and Siddique,A. K. and Yunus,M. and Sack,R. B. and Huq,A. and Rita R Colwell}
}
@inbook {12757,
	title = {Image-based face recognition: Issues and methods},
	booktitle = {Image recognition and classification: algorithms, systems, and applicationsImage recognition and classification: algorithms, systems, and applications},
	year = {2002},
	month = {2002///},
	pages = {375 - 402},
	publisher = {CRC Press},
	organization = {CRC Press},
	isbn = {9780824707835},
	author = {Zhao, W.Y. and Chellapa, Rama}
}
@article {18395,
	title = {Impediments to software engineering technology transfer},
	journal = {Journal of Systems and Software. Forthcoming},
	year = {2002},
	month = {2002///},
	author = {Zelkowitz, Marvin V and Wallace,D. R and Binkley,D. W}
}
@article {12963,
	title = {In vitro adhesion to human cells by viable but nonculturable Enterococcus faecalis},
	journal = {Current microbiology},
	volume = {45},
	year = {2002},
	month = {2002///},
	pages = {105 - 110},
	abstract = {The ability of viable but nonculturable (VBNC) Enterococcus faecalis to adhere to Caco-2 and Girardi heart cultured cells and to urinary tract epithelial cells (ECs) was studied. Enterococci were harvested during the vegetative growth phase (early exponential and stationary), in the VBNC state, and after recovery of the ability to divide. VBNC bacteria maintained their adherence capability but the efficiency of attachment was reduced by about 50 to 70\%, depending on the target cell employed. The decrease was transient, since enterococci that regained their culturability showed adherence values similar to those observed for actively growing cells. Analysis of the invasive properties of E. faecalis revealed that the VBNC state caused a decrease in the number of bacteria that entered the cultured HEK cells as a result of the reduction in the number of adhering bacteria. These results highlight the importance of studies of the VBNC phenomenon, with respect to both microbial survival in the environment and the impact on human health.},
	doi = {10.1007/s00284-001-0089-2},
	author = {Pruzzo,C. and Tarsi,R. and Lle{\`o},M. M. and Signoretto,C. and Zampini,M. and Rita R Colwell and Canepari,P.}
}
@article {17230,
	title = {In Web we trust: establishing strategic trust among online customers},
	journal = {E-Service: new directions in theory and practice},
	year = {2002},
	month = {2002///},
	pages = {90 - 107},
	abstract = {Electronic commerce (e-commerce) provides an important chance for established large companies to gain more customers as well as for new small companies to have a good start and rapid growth. However, establishing trust between customers and companies through web interface, a key component of successful e-service, is not as easy as through human-buyer-human-seller interaction. In the past few years, a number of experiments have been conducted in order to determine the factors that influence customers{\textquoteright} trust in online businesses. The goal of our experiment was to establish which features that appear on commercial websites are trust-inducing. Our study focused on three independent variables: customer service (limited and extensive), testimonial (self and external) and security features representation (graphics and text). We designed the homepages of eight web sites with all combinations of treatments of the three independent variables. Each of the 52 subjects reviewed all the eight homepages and gave them a relative rank of trustworthiness. After the experiment subjects answered additional e-trust related questions. The experiment results and the survey support the belief that specific customer service commitments, third party testimonials and graphic security representations are important in establishing strategic trust among on-line customers.},
	author = {Ceaparu,I. and Demner,D. and Hung,E. and Zhao,H. and Shneiderman, Ben}
}
@article {18485,
	title = {Joint audio-visual tracking using particle filters},
	journal = {EURASIP J. Appl. Signal Process.},
	volume = {2002},
	year = {2002},
	month = {2002/01//},
	pages = {1154 - 1164},
	abstract = {It is often advantageous to track objects in a scene using multimodal information when such information is available. We use audio as a complementary modality to video data, which, in comparison to vision, can provide faster localization over a wider field of view. We present a particle-filter based tracking framework for performing multimodal sensor fusion for tracking people in a videoconferencing environment using multiple cameras and multiple microphone arrays. One advantage of our proposed tracker is its ability to seamlessly handle temporary absence of some measurements (e.g., camera occlusion or silence). Another advantage is the possibility of self-calibration of the joint system to compensate for imprecision in the knowledge of array or camera parameters by treating them as containing an unknown statistical component that can be determined using the particle filter framework during tracking. We implement the algorithm in the context of a videoconferencing and meeting recording system. The system also performs high-level semantic analysis of the scene by keeping participant tracks, recognizing turn-taking events and recording an annotated transcript of the meeting. Experimental results are presented. Our system operates in real time and is shown to be robust and reliable.},
	keywords = {audio-visual tracking, Monte-Carlo algorithms, sensor fusion},
	isbn = {1110-8657},
	doi = {10.1155/S1110865702206058},
	url = {http://dx.doi.org/10.1155/S1110865702206058},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {12143,
	title = {Lessons learned from 25 years of process improvement: the rise and fall of the NASA software engineering laboratory},
	booktitle = {Proceedings of the 24th International Conference on Software Engineering},
	series = {ICSE {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {69 - 79},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {For 25 years the NASA/GSFC Software Engineering Laboratory (SEL) has been a major resource in software process improvement activities. But due to a changing climate at NASA, agency reorganization, and budget cuts, the SEL has lost much of its impact. In this paper we describe the history of the SEL and give some lessons learned on what we did right, what we did wrong, and what others can learn from our experiences. We briefly describe the research that was conducted by the SEL, describe how we evolved our understanding of software process improvement, and provide a set of lessons learned and hypotheses that should enable future groups to learn from and improve on our quarter century of experiences.},
	isbn = {1-58113-472-X},
	doi = {10.1145/581339.581351},
	url = {http://doi.acm.org/10.1145/581339.581351},
	author = {Basili, Victor R. and McGarry,Frank E. and Pajerski,Rose and Zelkowitz, Marvin V}
}
@conference {18400,
	title = {Maintaining software with a security perspective},
	booktitle = {Software Maintenance, 2002. Proceedings. International Conference on},
	year = {2002},
	month = {2002///},
	pages = {194 - 203},
	abstract = {Testing for software security is a lengthy, complex and costly process. Currently, security testing is done using penetration analysis and formal verification of security kernels. These methods are not complete and are difficult to use. Hence it is essential to focus testing effort in areas that have a greater number of security vulnerabilities to develop secure software as well as meet budget and time constraints. We propose a testing strategy based on a classification of vulnerabilities to develop secure and stable systems. This taxonomy will enable a system testing and maintenance group to understand the distribution of security vulnerabilities and prioritize their testing effort according to the impact the vulnerabilities have on the system. This is based on Landwehr{\textquoteright}s (1994) classification scheme for security flaws and we evaluated it using a database of 1360 operating system vulnerabilities. This analysis indicates vulnerabilities tend to be focused in relatively few areas and associated with a small number of software engineering issues.},
	keywords = {(computers);, budget, classification, classification;, constraints;, data;, engineering;, flaw, maintenance;, of, operating, program, scheme;, Security, software, stable, system, systems, systems;, testing;, TIME, vulnerabilities;, vulnerability},
	doi = {10.1109/ICSM.2002.1167766},
	author = {Jiwnani,K. and Zelkowitz, Marvin V}
}
@article {18259,
	title = {Nonlinear collusion attacks on independent multimedia fingerprints},
	journal = {submitted to IEEE Trans. on Image Proc},
	year = {2002},
	month = {2002///},
	author = {Zhao,H. and Wu,M. and Wang,Z.J. and Liu,K. J.R}
}
@conference {18917,
	title = {Planning in a multi-agent environment: theory and practice},
	series = {AAMAS {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {944 - 945},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We give the theoretical foundations and empirical evaluation of a planning agent, shop, performing HTN planning in a multi-agent environment. shop is based on A-SHOP, an agentized version of the original SHOP HTN planning algorithm, and is integrated in the IMPACT multi-agent environment. We ran several experiments involving accessing various distributed, heterogeneous information sources, based on simplified versions of noncombatant evacuation operations, NEO{\textquoteright}s. As a result, we noticed that in such realistic settings the time spent on communication (including network time) is orders of magnitude higher than the actual inference process. This has important consequences for optimizations of such planners. Our main results are: (1) using NEO{\textquoteright}s as new, more realistic benchmarks for planners acting in an agent environment, and (2) a memoization mechanism implemented on top of shop, which improves the overall performance in a significant way.},
	keywords = {agent architectures, agent selection and planning, formalisms and logics},
	isbn = {1-58113-480-0},
	doi = {10.1145/544862.544960},
	url = {http://doi.acm.org/10.1145/544862.544960},
	author = {Dix,J{\"u}rgen and Mu{\~n}oz-Avila,H{\'e}ctor and Nau, Dana S. and Zhang,Lingling}
}
@inbook {12755,
	title = {Probabilistic Human Recognition from Video},
	booktitle = {Computer Vision {\textemdash} ECCV 2002Computer Vision {\textemdash} ECCV 2002},
	series = {Lecture Notes in Computer Science},
	volume = {2352},
	year = {2002},
	month = {2002///},
	pages = {173 - 183},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {This paper presents a method for incorporating temporal information in a video sequence for the task of human recognition. A time series state space model, parameterized by a tracking state vector and a recognizing identity variable , is proposed to simultaneously characterize the kinematics and identity. Two sequential importance sampling (SIS) methods, a brute-force version and an efficient version, are developed to provide numerical solutions to the model. The joint distribution of both state vector and identity variable is estimated at each time instant and then propagated to the next time instant. Marginalization over the state vector yields a robust estimate of the posterior distribution of the identity variable. Due to the propagation of identity and kinematics, a degeneracy in posterior probability of the identity variable is achieved to give improved recognition. This evolving behavior is characterized using changes in entropy . The effectiveness of this approach is illustrated using experimental results on low resolution face data and upper body data.},
	isbn = {978-3-540-43746-8},
	url = {http://dx.doi.org/10.1007/3-540-47977-5_45},
	author = {Zhou,Shaohua and Chellapa, Rama},
	editor = {Heyden,Anders and Sparr,Gunnar and Nielsen,Mads and Johansen,Peter}
}
@conference {12766,
	title = {Probabilistic recognition of human faces from video},
	booktitle = {Image Processing. 2002. Proceedings. 2002 International Conference on},
	volume = {1},
	year = {2002},
	month = {2002///},
	pages = {I-41 - I-44 vol.1 - I-41 - I-44 vol.1},
	abstract = {Most present face recognition approaches recognize faces based on still images. We present a novel approach to recognize faces in video. In that scenario, the face gallery may consist of still images or may be derived from a videos. For evidence integration we use classical Bayesian propagation over time and compute the posterior distribution using sequential importance sampling. The probabilistic approach allows us to handle uncertainties in a systematic manner. Experimental results using videos collected by NIST/USF and CMU illustrate the effectiveness of this approach in both still-to-video and video-to-video scenarios with appropriate model choices.},
	keywords = {Bayes, Bayesian, CMU;, distribution;, Face, faces;, gallery;, handling;, human, image, images;, importance, likelihood;, methods;, NIST/USF;, observation, posterior, probabilistic, probability;, processing;, propagation;, recognition;, sampling;, sequential, signal, still, Still-to-video, Uncertainty, video, Video-to-video},
	doi = {10.1109/ICIP.2002.1037954},
	author = {Chellapa, Rama and Kruger, V. and Zhou,Shaohua}
}
@conference {12756,
	title = {A robust algorithm for probabilistic human recognition from video},
	booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on},
	volume = {1},
	year = {2002},
	month = {2002///},
	pages = {226 - 229 vol.1 - 226 - 229 vol.1},
	abstract = {Human recognition from video requires solving the two tasks, recognition and tracking, simultaneously. This leads to a parameterized time series state space model, representing both motion and identity of the human. Sequential Monte Carlo (SMC) algorithms, like Condensation, can be developed to offer numerical solutions to this model. However in outdoor environments, the solution is more likely to diverge from the foreground, causing failures in both recognition and tracking. In this paper we propose an approach for tackling this problem by incorporating the constraint of temporal continuity in the observations. Experimental results demonstrate improvements over its Condensation counterpart.},
	keywords = {algorithm;, algorithms;, Carlo, continuity;, human, image, methods;, model;, Monte, parameterized, probabilistic, recognition;, robust, sequential, series, series;, space, state, state-space, temporal, TIME},
	doi = {10.1109/ICPR.2002.1044661},
	author = {Zhou,Shaohua and Chellapa, Rama}
}
@article {18425,
	title = {Security Testing using a Susceptibility Matrix},
	journal = {International Symposioum on Software Reliability Engineering},
	volume = {13},
	year = {2002},
	month = {2002///},
	abstract = {Software testing is a cost effective method to detect faults insoftware. Similarly, Security testing is intended to assess
the trustworthiness of the security mechanisms and is often
regarded as a special case of system testing. The emphasis
of Security testing is not to establish the functional correctness
of the software but to establish some degree of confidence in
the security mechanisms. It is the single most common
technique for gaining assurance that a system operates within
the constraints of a given set of policies and mechanisms.
Presently, there is no systematic approach to security testing.
Our goal has been to devise a classification scheme to increase
testing effort in high-risk areas and help the software
community to get feedback to improve continuously.
},
	author = {Jiwnani,K. and Zelkowitz, Marvin V}
}
@conference {13641,
	title = {Segmentation and Identification of Handwriting in Noisy Documents},
	booktitle = {IAPRConference on Document Analysis System},
	year = {2002},
	month = {2002///},
	pages = {95 - 105},
	abstract = {In this paper we present an approach to the problem of segmenting and identifying handwritten annotations in noisy document images. In many types of documents such as correspondence, it is not uncommon for handwritten annotations to be added as part of a note, correction, clarification, or instruction, or a signature to appear as an authentication mark. It is important to be able to segment and identify such handwriting so we can 1) locate, interpret and re-trieve them efficiently in large document databases, and 2) use different algo-rithms for printed/handwritten text recognition and signature verification. Our approach consists of two processes: 1) a segmentation process, which divides the text into regions at an appropriate level (character, word, or zone), and 2) a classification process which identifies the segmented regions as handwritten. To determine the approximate region size where classification can be reliably per-formed, we conducted experiments at the character, word and zone level. We found that the reliable results can be achieved at the word level with a classifi-cation accuracy of 97.3\%. The identified handwritten text is further grouped into zones and verified to reduce false alarms. Experiments show our approach is promising and robust.},
	author = {Zheng,Y. and Li,H. and David Doermann}
}
@inbook {18923,
	title = {Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment},
	booktitle = {Logics in Artificial Intelligence},
	series = {Lecture Notes in Computer Science},
	volume = {2424},
	year = {2002},
	month = {2002///},
	pages = {173 - 185},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We give the theoretical foundations and empirical evaluation of a planning agent, ashop, performing HTN planning in a multi-agent environment. ashop is based on ASHOP , an agentised version of the original SHOP HTN planning algorithm, and is integrated in the IMPACT multi-agent environment. We ran several experiments involving accessing various distributed, heterogeneous information sources, based on simplified versions of noncombatant evacuation operations, NEO{\textquoteright}s. As a result, we noticed that in such realistic settings the time spent on communication (including network time) is orders of magnitude higher than the actual inference process. This has important consequences for optimisations of such planners. Our main results are: (1) using NEO{\textquoteright}s as new, more realistic benchmarks for planners acting in an agent environment, and (2) a memoization mechanism implemented on top of shop, which improves the overall performance considerably.},
	keywords = {Computer science},
	isbn = {978-3-540-44190-8},
	url = {http://www.springerlink.com/content/10lxp56u3e9k0bdd/abstract/},
	author = {Dix,J{\"u}rgen and Munoz-Avila,Hector and Nau, Dana S. and Zhang,Lingling},
	editor = {Flesca,Sergio and Greco,Sergio and Ianni,Giovambattista and Leone,Nicola}
}
@article {12764,
	title = {View-Based Recognition of Military Vehicles in Ladar Imagery Using CAD Model Matching},
	journal = {OPTICAL ENGINEERING-NEW YORK-MARCEL DEKKER INCORPORATED-},
	volume = {78},
	year = {2002},
	month = {2002///},
	pages = {151 - 188},
	author = {Der, S.Z. and Zheng,Q. and Redman, B. and Chellapa, Rama and Mahmoud, H.}
}
@conference {18470,
	title = {Virtual audio system customization using visual matching of ear parameters},
	booktitle = {16th International Conference on Pattern Recognition, 2002. Proceedings},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {1003- 1006 vol.3 - 1003- 1006 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Applications in the creation of virtual auditory spaces (VAS) and sonification require individualized head related transfer functions (HRTFs) for perceptual fidelity. HRTFs exhibit significant variation from person to person due to differences between their pinnae, and their body sizes. We propose and preliminarily implement a simple HRTF customization based on the use of a published database of HRTFs (Algazi et al., 2001) that also contains geometrical measurements of subject pinnae. We measure some of these features via simple image processing, and select the HRTF that has features most closely corresponding to the individual{\textquoteright}s features. This selection procedure is implemented along with the virtual auditory system described in (Zotkin et al., 2002), and listener tests conducted comparing the customized HRTF and a fixed HRTF. Despite the simplicity of the method, tests reveal average improvement in localization accuracy of about 25 percent, though performance improvement varies with source location and individuals.},
	keywords = {acoustic signal processing, Audio systems, Auditory system, Computer vision, database, Ear, ear parameter matching, geometrical measurements, Head, head related transfer functions, HRTF customization, Image databases, IMAGE PROCESSING, medical image processing, performance improvement, Position measurement, sonification, Spatial databases, System testing, Transfer functions, virtual audio system customization, virtual auditory spaces, virtual auditory system, visual matching},
	isbn = {0-7695-1695-X},
	doi = {10.1109/ICPR.2002.1048207},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S. and Mohan,A. and Raykar,V.}
}
@conference {18453,
	title = {What we have learned about fighting defects},
	booktitle = {Software Metrics, 2002. Proceedings. Eighth IEEE Symposium on},
	year = {2002},
	month = {2002///},
	pages = {249 - 258},
	abstract = {The Center for Empirically Based Software Engineering helps improve software development by providing guidelines for selecting development techniques, recommending areas for further research, and supporting software engineering education. A central activity toward achieving this goal has been the running of "e- Workshops" that capture expert knowledge with a minimum of overhead effort to formulate heuristics on a particular topic. The resulting heuristics are a useful summary of the current state of knowledge in an area based on expert opinion. This paper discusses the results to date of a series of e-Workshops on software defect reduction. The original discussion items are presented along with an encapsulated summary of the expert discussion. The reformulated heuristics can be useful both to researchers (for pointing out gaps in the current state of the knowledge requiring further investigation) and to practitioners (for benchmarking or setting expectations about development practices).},
	keywords = {based, Center, Computer, defect, development;, education;, electronic, Empiric, engineering, engineering;, eWorkshops;, for, heuristics;, reduction;, Science, software, workshops;},
	doi = {10.1109/METRIC.2002.1011343},
	author = {Shull, F. and Basili, Victor R. and Boehm,B. and Brown,A. W and Costa,P. and Lindvall,M. and Port,D. and Rus,I. and Tesoriero,R. and Zelkowitz, Marvin V}
}
@conference {18466,
	title = {Active speech source localization by a dual coarse-to-fine search},
	booktitle = {2001 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP {\textquoteright}01)},
	volume = {5},
	year = {2001},
	month = {2001///},
	pages = {3309-3312 vol.5 - 3309-3312 vol.5},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Accurate and fast localization of multiple speech sound sources is a significant problem in videoconferencing systems. Based on the observation that the wavelengths of the sound from a speech source are comparable to the dimensions of the space being searched, and that the source is broadband, we develop an efficient search strategy that finds the source(s) in a given space. The search is made efficient by using coarse-to-fine strategies in both space and frequency. The algorithm is shown to be robust compared to typical delay-based estimators and fast enough for real-time implementation. Its performance can be further improved by using constraints from computer vision},
	keywords = {active speech source localization, array signal processing, Computer interfaces, Delay effects, delay estimation, delay-based estimators, dual coarse-to-fine search, Frequency, Inverse problems, Laboratories, multiple speech sound sources, Position measurement, real-time implementation, Sensor arrays, Signal processing algorithms, space, speech, Speech processing, Teleconferencing, videoconferencing systems},
	isbn = {0-7803-7041-4},
	doi = {10.1109/ICASSP.2001.940366},
	author = {Duraiswami, Ramani and Zotkin,Dmitry N and Davis, Larry S.}
}
@conference {18318,
	title = {Attentive toys},
	booktitle = {International Conference on Multimedia and Expo},
	volume = {22},
	year = {2001},
	month = {2001///},
	pages = {25 - 25},
	author = {Haritaoglu,I. and Cozzi,A. and Koons,D. and Flickner,M. and Zotkin,Dmitry N and Yacoob,Yaser}
}
@article {12123,
	title = {Building an Experience Base for Software Engineering: A report on the first CeBASE eWorkshop},
	journal = {Product Focused Software Process Improvement},
	year = {2001},
	month = {2001///},
	pages = {110 - 125},
	abstract = {New information is obtained by research and disseminated by papers in conferences and journals. The synthesis of knowledge depends upon social discourse among the experts in a given domain to discuss the impact of this new information. Meetings among such experts are, however, expensive and time consuming. In this paper we discuss the organization of CeBASE, a center whose goal is the collection and dissemination of empirically-based software engineering knowledge, and the concept of the online workshop or eWorkshop as a way to use the Internet to minimize the needs of face-to-face meetings. We discuss the design of our eWorkshop and give the results of one eWorkshop that discussed the impact of defect reduction strategies.We want to thank Barry Boehm, Scott Henninger, Rayford Vaughn, Winsor Brown, Dan Port and Michael Frey as well as all participants for their contribution to the success of the eWorkshop. We also want to thank students at USC and UMD for their contribution in testing the system and Jennifer Dix for proof reading this paper.
},
	doi = {10.1007/3-540-44813-6_13},
	author = {Basili, Victor R. and Tesoriero,R. and Costa,P. and Lindvall,M. and Rus,I. and Shull, F. and Zelkowitz, Marvin V}
}
@conference {18461,
	title = {Efficient evaluation of reverberant sound fields},
	booktitle = {Applications of Signal Processing to Audio and Acoustics, 2001 IEEE Workshop on the},
	year = {2001},
	month = {2001///},
	pages = {203 - 206},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {An image method due to Allen and Berkley (1979) is often used to simulate the effect of reverberation in rooms. This method is relatively expensive computationally. We present a fast method for conducting such simulations using multipole expansions. For M real and image sources and N evaluation points, while the image method requires O(MN) operations, our method achieves the calculations in O(M + N) operations, resulting in a substantial speedup. Applications of our technique are also expected in simulation of virtual audio},
	keywords = {AB algorithm, acoustic signal processing, architectural acoustics, audio signal processing, Computational modeling, Computer interfaces, Computer simulation, Educational institutions, image method, image sources, Impedance, Laboratories, microphone arrays, multipole expansions, Nails, performance evaluation, reverberant sound fields, reverberation, room reverberation, simulation, Simulations, speedup, virtual audio},
	isbn = {0-7803-7126-7},
	doi = {10.1109/ASPAA.2001.969578},
	author = {Duraiswami, Ramani and Gumerov, Nail A. and Zotkin,Dmitry N and Davis, Larry S.}
}
@conference {12120,
	title = {An experience management system for a software engineering research organization},
	booktitle = {Software Engineering Workshop, 2001. Proceedings. 26th Annual NASA Goddard},
	year = {2001},
	month = {2001///},
	pages = {29 - 35},
	abstract = {Most businesses rely on the fact that their employees possess relevant knowledge and that they can apply it to the task at hand. The problem is that this knowledge is not owned by the organization. It is owned and controlled by its employees. Maintaining an appropriate level of knowledge in the organization is a very important issue. It is, however, not an easy task for most organizations, and it is particularly problematic for software organizations, which are human- and knowledge-intensive. Knowledge management is a relatively new area that has attempted to address these problems. This paper introduces an approach called the "knowledge dust-to-pearls" approach. This approach addresses some of the issues with knowledge management by providing low-barrier mechanisms to "jump start" the experience base. This approach allows the experience base to become more useful more quickly than traditional approaches. This paper describes the approach and gives an example of its use at the Fraunhofer Center for Experimental Software Engineering, Maryland, USA},
	keywords = {and, approach;knowledge, base;experience, Center, control;knowledge, data, development, dust-to-pearls, engineering, Engineering;business, engineering;software, experimental, for, Fraunhofer, houses;, knowledge;employee, knowledge;experience, level, maintenance;knowledge, management, management;knowledge, management;software, mechanisms;software, organization;software, organizational, organizations;administrative, organizations;knowledge, organizations;low-barrier, ownership;knowledge-intensive, processing;personnel;research, research, software, system;human-intensive},
	doi = {10.1109/SEW.2001.992652},
	author = {Basili, Victor R. and Costa,P. and Lindvall,M. and Mendonca,M. and Seaman,C. and Tesoriero,R. and Zelkowitz, Marvin V}
}
@inbook {14217,
	title = {Eyes from Eyes},
	booktitle = {3D Structure from Images {\textemdash} SMILE 20003D Structure from Images {\textemdash} SMILE 2000},
	series = {Lecture Notes in Computer Science},
	volume = {2018},
	year = {2001},
	month = {2001///},
	pages = {204 - 217},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We describe a family of new imaging systems, called Argus eyes, that consist of common video cameras arranged in some network. The system we built consists of six cameras arranged so that they sample different parts of the visual sphere. This system has the capability of very accurately estimating its own 3D motion and consequently estimating shape models from the individual videos. The reason is that inherent ambiguities of confusion between translation and rotation disappear in this case. We provide an algorithm and several experiments using real outdoor or indoor images demonstrating the superiority of the new sensor with regard to 3D motion estimation.},
	isbn = {978-3-540-41845-0},
	url = {http://dx.doi.org/10.1007/3-540-45296-6_14},
	author = {Baker,Patrick and Pless,Robert and Ferm{\"u}ller, Cornelia and Aloimonos, J.},
	editor = {Pollefeys,Marc and Van Gool,Luc and Zisserman,Andrew and Fitzgibbon,Andrew}
}
@conference {12359,
	title = {Hybrid global/local search strategies for dynamic voltage scaling in embedded multiprocessors},
	booktitle = {Hardware/Software Codesign, 2001. CODES 2001. Proceedings of the Ninth International Symposium on},
	year = {2001},
	month = {2001///},
	pages = {243 - 248},
	author = {Bambha,N. K and Bhattacharyya, Shuvra S. and Teich,J. and Zitzler,E.}
}
@conference {18468,
	title = {Multimodal 3-D tracking and event detection via the particle filter},
	booktitle = {IEEE Workshop on Detection and Recognition of Events in Video, 2001. Proceedings},
	year = {2001},
	month = {2001///},
	pages = {20 - 27},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Determining the occurrence of an event is fundamental to developing systems that can observe and react to them. Often, this determination is based on collecting video and/or audio data and determining the state or location of a tracked object. We use Bayesian inference and the particle filter for tracking moving objects, using both video data obtained from multiple cameras and audio data obtained using arrays of microphones. The algorithms developed are applied to determining events arising in two fields of application. In the first, the behavior of a flying echo locating bat as it approaches a moving prey is studied, and the events of search, approach and capture are detected. In a second application we describe detection of turn-taking in a conversation between possibly moving participants recorded using a smart video conferencing setup},
	keywords = {algorithms, APPROACH, audio data collection, audio signal processing, Bayesian inference, Bayesian methods, belief networks, CAMERAS, capture, conversation, echo, Educational institutions, Event detection, event occurrence, filtering theory, flying echo locating bat behaviour, Image motion analysis, inference mechanisms, Laboratories, microphone arrays, moving object tracking, moving participants, moving prey, multimodal 3D tracking, multiple cameras, Object detection, particle filter, Particle filters, Particle tracking, Robustness, search, smart video conferencing setup, target tracking, Teleconferencing, tracking filters, turn-taking detection, video data collection, video signal processing},
	isbn = {0-7695-1293-3},
	doi = {10.1109/EVENT.2001.938862},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {18465,
	title = {Multimodal localization of a flying bat},
	booktitle = {Acoustics, Speech, and Signal Processing, IEEE International Conference on},
	volume = {5},
	year = {2001},
	month = {2001///},
	pages = {3057 - 3060},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {We present a new multimodal system that combines stereoscopic and audio-based source localization to track the position of a flying bat. Also presented are novel algorithms for audio source localization. The bat was allowed to fly in an anechoic room and monitored by two high-speed video cameras. The vocalizations of the bat were simultaneously recorded from six microphones. The data was then processed offline to localize the source and reconstruct the trajectory of the bat. We compare the performance of the localization algorithm with the position data obtained from stereoscopic pictures of the bat. The results confirm that the stereoscopic analysis and the audio localization are in good agreement. This system opens up new possibilities for performing multimodal research, and developing more tightly integrated algorithms.},
	isbn = {0-7803-7041-4},
	doi = {http://doi.ieeecomputersociety.org/10.1109/ICASSP.2001.940303},
	author = {Ghose,K. and Zotkin,Dmitry N and Duraiswami, Ramani and Moss,C.F.}
}
@conference {18481,
	title = {Multimodal tracking for smart videoconferencing},
	booktitle = {Second International Conference on Multimedia and Expo, Tokyo, Japan},
	year = {2001},
	month = {2001///},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Nanda,H. and Davis, Larry S.}
}
@article {18417,
	title = {Programming languages: designing and implementation},
	journal = {BeOing: Electronic Industry Press},
	volume = {6},
	year = {2001},
	month = {2001///},
	pages = {46 - 65},
	author = {Zelkowitz, Marvin V}
}
@article {15296,
	title = {The role of a natural language conversational interface in online sales: A case study},
	journal = {International Journal of Speech Technology},
	volume = {4},
	year = {2001},
	month = {2001///},
	pages = {285 - 295},
	abstract = {This paper describes the evaluation of a natural language dialog-based navigation system (HappyAssistant) that helps users access e-commerce sites to find relevant information about products and services. The prototype system leverages technologies in natural language processing and human-computer interaction to create a faster and more intuitive way of interacting with websites, especially for less experienced users. The result of a comparative study shows that users prefer the natural language-enabled navigation two to one over the menu driven navigation. In addition, the study confirmed the efficiency of using natural language dialog in terms of the number of clicks and the amount of time required to obtain the relevant information. In the case study, as compared to the menu driven system, the average number of clicks used in the natural language system was reduced by 63.2\% and the average time was reduced by 33.3\%.},
	doi = {10.1023/A:1011316909641},
	author = {Chai,J. and Jimmy Lin and Zadrozny,W. and Ye,Y. and Stys-Budzikowska,M. and Horvath,V. and Kambhatla,N. and Wolf,C.}
}
@conference {18442,
	title = {The role of independent verification and validation in maintaining a safety critical evolutionary software in a complex environment: the NASA Space Shuttle program},
	booktitle = {Software Maintenance, 2001. Proceedings. IEEE International Conference on},
	year = {2001},
	month = {2001///},
	pages = {118 - 126},
	abstract = {The National Aeronautics and Space Administration (NASA) Space Shuttle program is a multi-billion dollar activity scheduled to span over 40 years. Maintaining such software with requirements for high reliability and mission safety taxes current development methods. The authors present how independent verification and validation (IV amp;V) activities are used to support these requirements. They also show how the IV amp;V activities for this program differ from those of more traditional software developments},
	keywords = {activities;NASA, Administration;complex, Aeronautics, amp;V, and, computing;program, critical, developments;aerospace, environment;development, evolutionary, IV, maintenance;software, maintenance;traditional, methods;high, program;National, prototyping;space, reliability;independent, safety;safety, Shuttle, software, software;software, space, validation;mission, vehicles;, verification, verification;safety-critical},
	doi = {10.1109/ICSM.2001.972722},
	author = {Zelkowitz, Marvin V and Rus,L.}
}
@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}
}
@conference {16488,
	title = {Validating an access cost model for wide area applications},
	booktitle = {Cooperative Information Systems},
	year = {2001},
	month = {2001///},
	pages = {371 - 385},
	author = {Zadorozhny,V. and Raschid, Louiqa and Zhan,T. and Bright,L.}
}
@article {18475,
	title = {Active source location and beamforming},
	journal = {The Journal of the Acoustical Society of America},
	volume = {107},
	year = {2000},
	month = {2000///},
	pages = {2790 - 2790},
	isbn = {00014966},
	doi = {10.1121/1.428978},
	url = {http://asadl.org/jasa/resource/1/jasman/v107/i5/p2790_s4},
	author = {Duraiswami, Ramani and Zotkin,Dmitry N and Borovikov,Eugene A. and Davis, Larry S.}
}
@inbook {14197,
	title = {Analyzing Action Representations},
	booktitle = {Algebraic Frames for the Perception-Action CycleAlgebraic Frames for the Perception-Action Cycle},
	series = {Lecture Notes in Computer Science},
	volume = {1888},
	year = {2000},
	month = {2000///},
	pages = {1 - 21},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We argue that actions represent the basic seed of intelligence underlying perception of the environment, and the representations encoding actions should be the starting point upon which further studies of cognition are built. In this paper we make a first effort in characterizing these action representations. In particular, from the study of simple actions related to 3D rigid motion interpretation, we deduce a number of principles for the possible computations responsible for the interpretation of space-time geometry. Using these principles, we then discuss possible avenues on how to proceed in analyzing the representations of more complex human actions.},
	isbn = {978-3-540-41013-3},
	url = {http://dx.doi.org/10.1007/10722492_1},
	author = {Aloimonos, J. and Ferm{\"u}ller, Cornelia},
	editor = {Sommer,Gerald and Zeevi,Yehoshua}
}
@conference {18479,
	title = {Attacking the bottlenecks of backfilling schedulers},
	booktitle = {Cluster Computing},
	year = {2000},
	month = {2000///},
	author = {Zotkin,Dmitry N and Keleher,P. J and Perkovic,D.}
}
@conference {18463,
	title = {An audio-video front-end for multimedia applications},
	booktitle = {2000 IEEE International Conference on Systems, Man, and Cybernetics},
	volume = {2},
	year = {2000},
	month = {2000///},
	pages = {786-791 vol.2 - 786-791 vol.2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Applications such as video gaming, virtual reality, multimodal user interfaces and videoconferencing, require systems that can locate and track persons in a room through a combination of visual and audio cues, enhance the sound that they produce, and perform identification. We describe the development of a particular multimodal sensor fusion system that is portable, runs in real time and achieves these objectives. The system employs novel algorithms for acoustical source location, video-based person tracking and overall system control, which are also described},
	keywords = {Acoustic noise, acoustical source location, Application software, audio cues, audio-video front-end, CAMERAS, Computer vision, Microphones, multimedia applications, multimedia systems, multimodal sensor fusion system, multimodal user interfaces, Position measurement, REAL TIME, Real time systems, real-time systems, sensor fusion, sound, Speech recognition, User interfaces, video cameras, video gaming, video-based person tracking, Videoconference, videoconferencing, Virtual reality, visual cues, Working environment noise},
	isbn = {0-7803-6583-6},
	doi = {10.1109/ICSMC.2000.885945},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S. and Haritaoglu,I.}
}
@conference {15287,
	title = {Comparative Evaluation of a Natural Language Dialog Based System and a Menu-Driven System for Information Access: A Case Study},
	booktitle = {In Proceedings of the International Conference on Multimedia Information Retrieval (RIAO 2000)},
	year = {2000},
	month = {2000///},
	abstract = {This paper describes the evaluation of a natural language dialog based navigation system (HappyAssistant) thathelps users access e-commerce sites to find relevant information about products and services. The prototype system
leverages technologies in natural language processing and human computer interaction to create a faster and more
intuitive way of interacting with websites, especially for the less experienced users. The result of a comparative
study shows that users prefer the natural language enabled navigation two to one over the menu driven navigation.
In addition, the study confirmed the efficiency of using natural language dialog in terms of the number of clicks and
the amount of time required to obtain the relevant information. In the case study, comparing to the menu driven
system, the average number of clicks used in the natural language system was reduced by 63.2\% and the average
time was reduced by 33.3\%.
},
	author = {Chai,J. and Jimmy Lin and Zadrozny,W. and Ye,Y. and Budzikowska,M. and Horvath,V. and Kambhatla,N. and Wolf,C.}
}
@article {18440,
	title = {The experimental validation and packaging of software technologies},
	journal = {ACM SIGSOFT Software Engineering Notes},
	volume = {25},
	year = {2000},
	month = {2000/01//},
	pages = {82 - 83},
	isbn = {0163-5948},
	doi = {10.1145/340855.341021},
	url = {http://doi.acm.org/10.1145/340855.341021},
	author = {Shull, Forrest and Basili, Victor R. and Zelkowitz, Marvin V}
}
@article {14971,
	title = {High performance computing algorithms for land cover dynamics using remote sensing data},
	journal = {International Journal of Remote Sensing},
	volume = {21},
	year = {2000},
	month = {2000///},
	pages = {1513 - 1536},
	abstract = {Global and regional land cover studies need to apply complex models on selected subsets of large volumes of multi-sensor and multi-temporal data sets that have been derived from raw instrument measurements using widely accepted pre-processing algorithms. The computational and storage requirements of most of these studies far exceed what is possible on a single workstation environment. We have been pursuing a new approach that couples scalable and open distributed heterogeneous hardware with the development of high performance software for processing, indexing and organizing remotely sensed data. Hierarchical data management tools are used to ingest raw data, create metadata and organize the archived data so as to automatically achieve computational load balancing among the available nodes and minimize input/output overheads. We illustrate our approach with four specific examples. The first is the development of the first fast operational scheme for the atmospheric correction of Landsat Thematic Mapper scenes, while the second example focuses on image segmentation using a novel hierarchical connected components algorithm. Retrieval of the global Bidirectional Reflectance Distribution Function in the red and near-infrared wavelengths using four years (1983 to 1986) of Pathfinder Advanced Very High Resolution Radiometer (AVHRR) Land data is the focus of our third example. The fourth example is the development of a hierarchical data organization scheme that allows on-demand processing and retrieval of regional and global AVHRR data sets. Our results show that substantial reductions in computational times can be achieved by the high performance computing technology.},
	isbn = {0143-1161},
	doi = {10.1080/014311600210290},
	url = {http://www.tandfonline.com/doi/abs/10.1080/014311600210290},
	author = {Kalluri, SNV and JaJa, Joseph F. and Bader, D.A. and Zhang,Z. and Townshend,J.R.G. and Fallah-Adl,H.}
}
@article {14980,
	title = {Kronos: A software system for the processing and retrieval of large-scale AVHRR data sets},
	journal = {PE \& RS- Photogrammetric Engineering and Remote Sensing},
	volume = {66},
	year = {2000},
	month = {2000///},
	pages = {1073 - 1082},
	abstract = {Raw remotely sensed satellite data have to be processed andmapped into a standard projection in order to produce a multi-
temporal data set which can then be used for regional or global
Earth science studies. However, traditional methods of
processing remotely sensed satellite data have inherent
limitations because they are based on a fixed processing chain.
Different users may need the data in different forms with
possibly different processing steps; hence, additional
transformations may have to be applied to the processed data,
resulting in potentially significant errors. In this paper, we
describe a software system, Kronos, for the generation of
custom-tailored products from the Advanced Very High
Resolution Radiometer (AVHRR) sensor. It allows the generation
of a rich set of products that can be easily specified through
a simple interface by scientists wishing to carry out Earth
system modeling or analysis. Kronos is based on a flexible
methodology and consists of four major components: ingest
and preprocessing, indexing and storage, a search and
processing engine, and a Java interface. After geo-location and
calibration, every pixel is indexed and stored using a
combination of data structures. Following the users{\textquoteright} queries,
data are selectively retrieved and secondary processing such
as atmospheric correction, compositing, and projection are
performed as specified. The processing is divided into two
stages, the first of which involves the geo-location and
calibration of the remotely sensed data and, hence, results in
no loss of information. The second stage involves the retrieval
of the appropriate data subsets and the application of the
secondary processing specified by the user. This scheme allows
the indexing and the storage of data from different sensors
without any loss of information and, therefore, allows
assimilation of data from multiple sensors. User specified
processing can be applied later as needed.
},
	author = {Zhang,Z. and JaJa, Joseph F. and Bader, D.A. and Kalluri, SNV and Song,H. and El Saleous,N. and Vermote,E. and Townshend,J.R.G.}
}
@article {16494,
	title = {Learning response time for websources using query feedback and application in query optimization},
	journal = {The VLDB Journal{\textemdash}The International Journal on Very Large Data Bases},
	volume = {9},
	year = {2000},
	month = {2000///},
	pages = {18 - 37},
	author = {Gruser,J. R and Raschid, Louiqa and Zadorozhny,V. and Zhan,T.}
}
@article {17617,
	title = {Low discrepancy sets yield approximate min-wise independent permutation families},
	journal = {Information Processing Letters},
	volume = {73},
	year = {2000},
	month = {2000/01/31/},
	pages = {29 - 32},
	abstract = {Motivated by a problem of filtering near-duplicate Web documents, Broder, Charikar, Frieze and Mitzenmacher defined the following notion of ϵ-approximate min-wise independent permutation families. A multiset F of permutations of {0,1,{\textellipsis},n-1} is such a family if for all K⫅{0,1,{\textellipsis},n-1} and any x∈K, a permutation π chosen uniformly at random from F satisfies |Pr[min{π(K)}=π(x)]-1|K||<=ϵ|K|. We show connections of such families with low discrepancy sets for geometric rectangles, and give explicit constructions of such families F of size nO(logn) for ϵ=1/nΘ(1), improving upon the previously best-known bound of Indyk. We also present polynomial-size constructions when the min-wise condition is required only for |K|<=2O(log2/3n), with ϵ>=2-O(log2/3n).},
	keywords = {combinatorial problems, Document filtering, explicit constructions, Information retrieval, Min-wise independent permutations, Pseudorandom permutations},
	isbn = {0020-0190},
	doi = {10.1016/S0020-0190(99)00163-5},
	url = {http://www.sciencedirect.com/science/article/pii/S0020019099001635},
	author = {Saks,Michael and Srinivasan, Aravind and Zhou,Shiyu and Zuckerman,David}
}
@article {12371,
	title = {Multidimensional exploration of software implementations for DSP algorithms},
	journal = {The Journal of VLSI Signal Processing},
	volume = {24},
	year = {2000},
	month = {2000///},
	pages = {83 - 98},
	author = {Zitzler,E. and Teich,J. and Bhattacharyya, Shuvra S.}
}
@inbook {14801,
	title = {Resource-aware meta-computing},
	booktitle = {Emphasizing Distributed SystemsEmphasizing Distributed Systems},
	volume = {Volume 53},
	year = {2000},
	month = {2000///},
	pages = {109 - 169},
	publisher = {Elsevier},
	organization = {Elsevier},
	abstract = {Meta-computing, is an increasingly popular and useful method of obtaining resources to solve large computational problems. However, meta-computer environments pose a number of unique challenges, many of which have yet to be addressed effectively. Among these are dynamicism in both applications and environments, and heterogeneity at several different levels. This chapter discusses current approaches to these problems, and uses them in the Active Harmony system as a running example. Harmony supports an interface that allows applications to export tuning alternatives to the higher-level system. By exposing different parameters that can be changed at runtime, applications can be automatically adapted to changes in their execution environment caused by other programs, the addition or deletion of nodes, or changes in the availability of resources like communication links. Applications expose not only options, but also expected resource utilization with each option and the effect that the option will have on the application{\textquoteright}s performance. We discuss how this flexibility can be used to tune the overall performance of a collection of applications in a system.},
	isbn = {0065-2458},
	url = {http://www.sciencedirect.com/science/article/pii/S0065245800800054},
	author = {Hollingsworth, Jeffrey K and Keleher, Peter J. and Ryu, Kyung D.},
	editor = {Marvin V. Zelkowits}
}
@conference {18464,
	title = {Smart videoconferencing},
	booktitle = {2000 IEEE International Conference on Multimedia and Expo, 2000. ICME 2000},
	volume = {3},
	year = {2000},
	month = {2000///},
	pages = {1597-1600 vol.3 - 1597-1600 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The combination of acoustical and video processing to achieve a smart audio and video feed from a set of N microphones and M cameras is a task that might conventionally be accomplished by camera persons and control room staff. However, in the context of videoconferencing, this process needs to be performed by control software. We discuss the use of a multi-camera multi-microphone set-up for unattended videoconferencing, and present details of a prototype implementation being developed},
	keywords = {acoustical processing, Automatic control, CAMERAS, computerised control, control software, Control systems, Intelligent sensors, Layout, Microphones, multi-camera multi-microphone set-up, multimedia systems, Protocols, prototype implementation, Prototypes, sensor fusion, smart videoconferencing, Switches, Teleconferencing, unattended videoconferencing, video processing},
	isbn = {0-7803-6536-4},
	doi = {10.1109/ICME.2000.871075},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Philomin,V. and Davis, Larry S.}
}
@conference {16455,
	title = {Web Query Optimizer},
	booktitle = {Data Engineering, International Conference on},
	year = {2000},
	month = {2000///},
	pages = {661 - 661},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {We demonstrate a Web Query Optimizer (WQO) within an architecture of mediators and wrappers, for WebSources of limited capability in a wide area environment. The WQO has several innovative features including a CBR (capability based rewriting) Tool, an enhanced randomized relational optimizer extended to a Web environment, and a WebWrapper cost model that can provide relevant metrics for accessing WebSources. The prototype has been tested against a number of WebSources.},
	doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2000.839484},
	author = {Zadorozhny,Vladimir and Bright,Laura and Raschid, Louiqa and Urhan,Tolga and Vidal,Maria Esther}
}
@article {18478,
	title = {Exact solutions for the problem of source location from measured time differences of arrival},
	journal = {The Journal of the Acoustical Society of America},
	volume = {106},
	year = {1999},
	month = {1999///},
	pages = {2277 - 2277},
	author = {Duraiswami, Ramani and Zotkin,Dmitry N and Davis, Larry S.}
}
@conference {14927,
	title = {A hierarchical data archiving and processing system to generate custom tailored products from AVHRR data},
	booktitle = {Geoscience and Remote Sensing Symposium, 1999. IGARSS {\textquoteright}99 Proceedings. IEEE 1999 International},
	volume = {5},
	year = {1999},
	month = {1999///},
	pages = {2374 -2376 vol.5 - 2374 -2376 vol.5},
	abstract = {A novel indexing scheme is described to catalogue satellite data on a pixel basis. The objective of this research is to develop an efficient methodology to archive, retrieve and process satellite data, so that data products can be generated to meet the specific needs of individual scientists. When requesting data, users can specify the spatial and temporal resolution, geographic projection, choice of atmospheric correction, and the data selection methodology. The data processing is done in two stages. Satellite data is calibrated, navigated and quality flags are appended in the initial processing. This processed data is then indexed and stored. Secondary processing such as atmospheric correction and projection are done after a user requests the data to create custom made products. By dividing the processing in to two stages saves time, since the basic processing tasks such as navigation and calibration which are common to all requests are not repeated when different users request satellite data. The indexing scheme described can be extended to allow fusion of data sets from different sensors},
	keywords = {archiving;image, AVHRR;GIS;PACS;custom, data, image;land, image;remote, mapping;, mapping;PACS;geophysical, measurement, PROCESSING, processing;geophysical, product;data, remote, scheme;infrared, sensing;optical, sensing;terrain, signal, surface;multispectral, system;indexing, tailored, technique;hierarchical, techniques;remote},
	doi = {10.1109/IGARSS.1999.771514},
	author = {Kalluri, SNV and Zhang,Z. and JaJa, Joseph F. and Bader, D.A. and Song,H. and El Saleous,N. and Vermote,E. and Townshend,J.R.G.}
}
@article {18409,
	title = {OSMA Software Program: Domain Analysis Guidebook},
	journal = {Technical Reports from UMIACS, UMIACS-TR-99-16},
	year = {1999},
	month = {1999/03/31/},
	abstract = {Domain analysis is the process of identifying and organizing knowledge abouta class of problems. This guidebook presents a method of performing
experience domain analysis in software development organizations. The
purpose of the guidebook is to facilitate the reader in characterizing two
given development environments, applying domain analysis to model each, and
then applying an evaluation process, based upon the Goal/Metric/Paradigm, to
transfer a given development technology from one of the environments to the
other. This guidebook describes this process and gives an example of its use
within NASA.
Also cross-referenced as UMIACS-TR-99-16
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/1000},
	author = {Basili, Victor R. and Seaman,Carolyn and Tesoriero,Roseanne and Zelkowitz, Marvin V}
}
@article {17322,
	title = {Perspective-based Usability Inspection: An Empirical Validation of Efficacy},
	journal = {Empirical Software Engineering},
	volume = {4},
	year = {1999},
	month = {1999///},
	pages = {43 - 69},
	abstract = {Inspection is a fundamental means of achieving software usability. Past research showed that the current usability inspection techniques were rather ineffective. We developed perspective-based usability inspection, which divides the large variety of usability issues along different perspectives and focuses each inspection session on one perspective. We conducted a controlled experiment to study its effectiveness, using a post-test only control group experimental design, with 24 professionals as subjects. The control group used heuristic evaluation, which is the most popular technique for usability inspection. The experimental design and the results are presented, which show that inspectors applying perspective-based inspection not only found more usability problems related to their assigned perspectives, but also found more overall problems. Perspective-based inspection was shown to be more effective for the aggregated results of multiple inspectors, finding about 30\% more usability problems for 3 inspectors. A management implication of this study is that assigning inspectors more specific responsibilities leads to higher performance. Internal and external threats to validity are discussed to help better interpret the results and to guide future empirical studies.},
	isbn = {1382-3256},
	url = {http://dx.doi.org/10.1023/A:1009803214692},
	author = {Zhang,Zhijun and Basili, Victor R. and Shneiderman, Ben}
}
@article {18455,
	title = {A real-time audio{\textendash}video front-end for multimedia applications},
	journal = {The Journal of the Acoustical Society of America},
	volume = {106},
	year = {1999},
	month = {1999///},
	pages = {2271 - 2271},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Hariatoglu,I. and Davis, Larry S. and Otsuka,T.}
}
@inbook {13716,
	title = {A Survey of Current Paradigms in Machine Translation},
	booktitle = {Advances in Computers},
	volume = {Volume 49},
	year = {1999},
	month = {1999///},
	pages = {1 - 68},
	publisher = {Elsevier},
	organization = {Elsevier},
	abstract = {This paper is a survey of the current machine translation research in the US, Europe and Japan. A short history of machine translation is presented first, followed by an overview of the current research work. Representative examples of a wide range of different approaches adopted by machine translation researchers are presented. These are described in detail along with a discussion of the practicalities of scaling up these approaches for operational environments. In support of this discussion, issues in, and techniques for, evaluating machine translation systems are addressed.},
	isbn = {0065-2458},
	url = {http://www.sciencedirect.com/science/article/pii/S006524580860282X},
	author = {Dorr, Bonnie J and Jordan,Pamela W. and Benoit,John W.},
	editor = {Zelkowitz, Marvin V}
}
@conference {18379,
	title = {Culture conflicts in software engineering technology transfer},
	booktitle = {NASA Goddard Software Engineering Workshop},
	year = {1998},
	month = {1998///},
	pages = {52 - 52},
	abstract = {Although the need to transition new technology to improve the process of developing quality software products is well understood, the computer software industry has done a poor job of carrying out that need. All too often new software technology is touted as the next "silver bullet" to be adopted, only to fail and disappear within a very short period. New technologies are often adopted without any convincing evidence that they will be effective, yet other technologies are ignored despite the published data that they will be useful. It is cClearly there is a clash between those developing new technologies and those responsible for developing quality products. In this paper we discuss a study conducted among a large group of computer software professionals in order to understand what techniques can be used to support the introduction of new technologies, and to understand the biases and opinions of those charged with researching, developing or implementing those new technologies. This study indicates which evaluation techniques are viewed as most successful under various conditions. We show that the research and industrial communities do indeed have different perspectives, which leads to a clash between the goals of the technology developers researchers and the needs of the technology users.},
	author = {Zelkowitz, Marvin V and Wallace,D. R and Binkley,D.}
}
@article {16964,
	title = {An Empirical Study of Perspective-Based Usability Inspection},
	journal = {Proceedings of the Human Factors and Ergonomics Society Annual MeetingProceedings of the Human Factors and Ergonomics Society Annual Meeting},
	volume = {42},
	year = {1998},
	month = {1998/10/01/},
	pages = {1346 - 1350},
	abstract = {Inspection is a fundamental means of achieving software usability. Past research showed that during usability inspection the success rate (percentage of problems detected) of each individual inspector was rather low. We developed perspective-based usability inspection, which divides the large variety of usability issues along different perspectives and focuses each inspection session on one perspective. We conducted a controlled experiment to study its effectiveness, using a post-test only control group experimental design, with 24 professionals as subjects. The control group used heuristic evaluation, which is the most popular technique for usability inspection. The experimental results are that 1) for usability problems covered by each perspective, the inspectors using that perspective had higher success rate than others; 2) for all usability problems, perspective inspectors had higher average success rate than heuristic inspectors; 3) for all usability problems, the union of three perspective inspectors (with one from each perspective) had higher average success rate than the union of three heuristic inspectors.},
	isbn = {1071-1813,},
	doi = {10.1177/154193129804201904},
	url = {http://pro.sagepub.com/content/42/19/1346},
	author = {Zhang,Zhijun and Basili, Victor R. and Shneiderman, Ben}
}
@article {18391,
	title = {Experimental models for validating technology},
	journal = {Computer},
	volume = {31},
	year = {1998},
	month = {1998/05//},
	pages = {23 - 31},
	abstract = {Experimentation helps determine the effectiveness of proposed theories and methods. However, computer science has not developed a concise taxonomy of methods for demonstrating the validity of new techniques. Experimentation is a crucial part of attribute evaluation and can help determine whether methods used in accordance with some theory during product development will result in software being as effective as necessary. By looking at multiple examples of technology validation, the authors develop a taxonomy for software engineering experimentation that describes twelve different experimental approaches},
	keywords = {attribute, development;software, engineering, engineering;, evaluation;computer, experimentation;technology, models;product, science;experimental, validation;product},
	isbn = {0018-9162},
	doi = {10.1109/2.675630},
	author = {Zelkowitz, Marvin V and Wallace,D. R}
}
@article {17595,
	title = {Explicit OR-dispersers with polylogarithmic degree},
	journal = {Journal of the ACM (JACM)},
	volume = {45},
	year = {1998},
	month = {1998/01//},
	pages = {123 - 154},
	abstract = {An (N, M, T)-OR-disperser is a bipartite multigraph G=(V, W, E) with |V| = N, and |W| = M, having the following expansion property: any subset of V having at least T vertices has a neighbor set of size at least M/2. For any pair of constants \&xgr;, \&lgr;, 1 >= \&xgr; > \&lgr; >= 0, any sufficiently large N, and for any T >= 2(logN) M <= 2(log N)\&lgr;, we give an explicit elementary construction of an (N, M,    T)-OR-disperser such that the out-degree of any vertex in V is at most polylogarithmic in N. Using this with known applications of OR-dispersers yields several results. First, our construction implies that the complexity class Strong-RP defined by Sipser, equals RP. Second, for any fixed \&eegr; > 0, we give the first polynomial-time simulation of RP algorithms using the output of any {\textquotedblleft}\&eegr;-minimally random{\textquotedblright} source. For any integral R > 0, such a source accepts a single request for an R-bit string and generates the string according to a distribution that assigns probability at most 2-R\&eegr; to any string. It is minimally random in the sense that  any weaker source is insufficient to do a black-box polynomial-time simulation of RP algorithms.},
	keywords = {derandomization, expander graphs, explicit constructions, hardness of approximation, hashing lemmas, imperfect sources of randomness, measures of information, pseudo-random generators, randomized computation, time-space tradeoffs},
	isbn = {0004-5411},
	doi = {10.1145/273865.273915},
	url = {http://doi.acm.org/10.1145/273865.273915},
	author = {Saks,Michael and Srinivasan, Aravind and Zhou,Shiyu}
}
@article {14988,
	title = {Models and high-performance algorithms for global BRDF retrieval},
	journal = {Computational Science Engineering, IEEE},
	volume = {5},
	year = {1998},
	month = {1998/12//oct},
	pages = {16 - 29},
	abstract = {The authors describe three models for retrieving information related to the scattering of light on the Earth{\textquoteright}s surface. Using these models, they{\textquoteright}ve developed algorithms for the IBM SP2 that efficiently retrieve this information},
	keywords = {algorithms;, BRDF, Earth, geomorphology;, geophysical, global, high-performance, IBM, information, light, machines;, models;, Parallel, processing;, reflectivity;, retrieval, retrieval;, scattering;, signal, SP2;, surface;},
	isbn = {1070-9924},
	doi = {10.1109/99.735892},
	author = {Zengyan Zhang and Kalluri, SNV and JaJa, Joseph F. and Liang,Shunlin and Townshend,J.R.G.}
}
@conference {18454,
	title = {Pictorial query trees for query specification in image databases},
	booktitle = {Fourteenth International Conference on Pattern Recognition, 1998. Proceedings},
	volume = {1},
	year = {1998},
	month = {1998/08//},
	pages = {919-921 vol.1 - 919-921 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A technique that enables specifying complex queries in image databases using pictorial query trees is presented. The leaves of a pictorial query tree correspond to individual pictorial queries that specify which objects should appear in the target images as well as how many occurrences of each object are required. In addition, the minimum required certainty of matching between query-image objects and database-image objects, as well as spatial constraints that specify bounds on the distance between objects and the relative direction between them are also specified. Internal nodes in the query tree represent logical operations (AND, OR, XOR) and their negations on the set of pictorial queries (or subtrees) represented by its children. The syntax of query trees is described. Algorithms for processing individual pictorial queries and for parsing and computing the overall result of a pictorial query tree are outlined},
	keywords = {Automation, complex queries, Computer science, content-based retrieval, Database systems, database-image objects, Educational institutions, Electrical capacitance tomography, grammars, Image databases, Image matching, parsing, pictorial query trees, Postal services, query specification, query-image objects, spatial constraints, syntax, visual databases},
	isbn = {0-8186-8512-3},
	doi = {10.1109/ICPR.1998.711383},
	author = {Soffer,A. and Samet, Hanan and Zotkin,Dmitry N}
}
@article {18714,
	title = {Solution structure and dynamics of the bioactive retroviral M domain from rous sarcoma virus},
	journal = {Journal of Molecular Biology},
	volume = {279},
	year = {1998},
	month = {1998/06/19/},
	pages = {921 - 928},
	abstract = {A biologically active construct of the retroviral M domain from the avian Rous sarcoma virus is defined and its solution structure described. This M domain is fully active in budding and infectivity without myristylation. In spite of a sequence homology level that suggests no relationship among M domains and the family of matrix proteins in mammalian retroviruses, the conserved structural elements of a central core allow an M domain sequence motif to be described for all retroviruses. The surface of the M domain has a highly clustered positive patch comprised of sequentially distant residues. An analysis of the backbone dynamics, incorporating rotational anisotropy, is used to estimate the thermodynamics of proposed domain oligomerization.},
	keywords = {heteronuclear NMR spectroscopy, protein dynamics, RSV matrix protein, sequence homology, three-dimensional structure},
	isbn = {0022-2836},
	doi = {10.1006/jmbi.1998.1788},
	url = {http://www.sciencedirect.com/science/article/pii/S0022283698917880},
	author = {McDonnell,James M and Fushman, David and Cahill,Sean M. and Zhou,Wenjun and Wolven,Amy and Wilson,Carol B and Nelle,Timothy D and Resh,Marilyn D and Wills,John and Cowburn,David}
}
@article {18723,
	title = {The Solution Structure and Dynamics of the Pleckstrin Homology Domain of G Protein-coupled Receptor Kinase 2 (β-Adrenergic Receptor Kinase 1) A BINDING PARTNER OF Gβγ SUBUNITS},
	journal = {Journal of Biological ChemistryJ. Biol. Chem.},
	volume = {273},
	year = {1998},
	month = {1998/01/30/},
	pages = {2835 - 2843},
	abstract = {The solution structure of an extended pleckstrin homology (PH) domain from the β-adrenergic receptor kinase is obtained by high resolution NMR. The structure establishes that the β-adrenergic receptor kinase extended PH domain has the same fold and topology as other PH domains, and there are several unique features, most notably an extended C-terminal α-helix that behaves as a molten helix, and a surface charge polarity that is extensively modified by positive residues in the extended α-helix and the C terminus. These observations complement biochemical evidence that the C-terminal portion of this PH domain participates in protein-protein interactions with Gβγ subunits. This suggests that the C-terminal segment of the PH domain may function to mediate protein-protein interactions with the targets of PH domains.},
	isbn = {0021-9258, 1083-351X},
	doi = {10.1074/jbc.273.5.2835},
	url = {http://www.jbc.org/content/273/5/2835},
	author = {Fushman, David and Najmabadi-Haske,Taraneh and Cahill,Sean and Zheng,Jie and LeVine,Harry and Cowburn,David}
}
@article {18451,
	title = {Validating the Benefit of New Software Technology},
	journal = {Software Quality Practitioner},
	volume = {1},
	year = {1998},
	month = {1998///},
	abstract = {The software engineering research community has developed methodsfor showing that new development technologies are effective and the
corporate world investigates various techniques before applying them on
new developments. Unfortunately, these two communities do not often
work together to make technology transfer a smooth process. In this
paper, methods for validating research claims in the software
development domain are described and methods used by industry to
investigate new technologies are given. Guidelines that allow research
papers to address the needs for industrial investigations are proposed
that should greatly improve the transfer of new technology to industry.
},
	author = {Zelkowitz, Marvin V and Wallace,D.}
}
@article {18377,
	title = {Comments on "Towards a framework for software measurement validation"},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {23},
	year = {1997},
	month = {1997/03//},
	pages = {187 - 189},
	abstract = {A view of software measurement that disagrees with the model presented by Kitchenham, Pfleeger, and Fenton (1995), is given. Whereas Kitchenham et al. argue that properties used to define measures should not constrain the scale type of measures, the authors contend that that is an inappropriate restriction. In addition, a misinterpretation of Weyuker{\textquoteright}s (1988) properties is noted.},
	keywords = {measurement, metrics;, software, testing;program, validation;program, verification;software},
	isbn = {0098-5589},
	doi = {10.1109/32.585506},
	author = {Morasca,S. and Briand,L.C. and Basili, Victor R. and Weyuker,E.J. and Zelkowitz, Marvin V and Kitchenham,B. and Lawrence Pfleeger,S. and Fenton,N.}
}
@article {18382,
	title = {Editorial: Evaluation and assessment in software engineering},
	journal = {Information and Software Technology},
	volume = {39},
	year = {1997},
	month = {1997///},
	author = {Kitchenham,B. and Brereton,P. and Budgen,D. and Linkman,S. and Almstrum,V. L and Pfleeger,S. L and Zelkowitz, Marvin V and Wallace,D.}
}
@article {18392,
	title = {Experimental validation in software engineering},
	journal = {Information and Software Technology},
	volume = {39},
	year = {1997},
	month = {1997///},
	pages = {735 - 743},
	abstract = {Although experimentation is an accepted approach toward scientific validation in most scientific disciplines, it only recently has gained acceptance within the software development community. In this paper we discuss a 12-model classification scheme for performing experimentation within the software development domain. We evaluate over 600 published papers in the computer science literature and over one hundred papers from other scientific disciplines in order to determine: (1) how well the computer science community is succeeding at validating its theories, and (2) how computer science compares to other scientific disciplines.},
	keywords = {data collection, Evaluation, experimentation, measurement},
	isbn = {0950-5849},
	doi = {10.1016/S0950-5849(97)00025-6},
	url = {http://www.sciencedirect.com/science/article/pii/S0950584997000256},
	author = {Zelkowitz, Marvin V and Wallace,Dolores}
}
@conference {13573,
	title = {Image Indexing with Minimum Adaptive Spatial Segmentation},
	booktitle = {Proceedings of VISUAL 1997},
	year = {1997},
	month = {1997///},
	author = {Zhong,S. and David Doermann and Rosenfeld, A.}
}
@conference {14813,
	title = {MDL: a language and compiler for dynamic program instrumentation},
	booktitle = {, 1997 International Conference on Parallel Architectures and Compilation Techniques., 1997. Proceedings},
	year = {1997},
	month = {1997/11/10/14},
	pages = {201 - 212},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We use a form of dynamic code generation, called dynamic instrumentation, to collect data about the execution of an application program. Dynamic instrumentation allows us to instrument running programs to collect performance and other types of information. The instrumentation code is generated incrementally and can be inserted and removed at any time. Our instrumentation currently runs on the SPARC, PA-RISC, Power 2, Alpha, and x86 architectures. Specification of what data to collect are written in a specialized language called the Metric Description Language, that is part of the Paradyn Parallel Performance Tools. This language allows platform independent descriptions of how to collect performance data. It also provides a concise way to specify, how to constrain performance data to particular resources such as modules, procedures, nodes, files, or message channels (or combinations of these resources). We also describe the details of how we weave instrumentation into a running program},
	keywords = {Alpha architecture, application program, application program interfaces, Application software, compiler generators, Computer science, dynamic code generation, Dynamic compiler, dynamic program instrumentation, Educational institutions, files, instrumentation code, Instruments, MDL, measurement, message channels, Message passing, Metric Description Language, modules, nodes, Operating systems, optimising compilers, PA-RISC, Paradyn Parallel Performance Tools, Parallel architectures, parallel programming, performance data, platform independent descriptions, Power 2 architecture, Power generation, procedures, program debugging, Program processors, running programs, Runtime, software metrics, SPARC, Specification languages, x86 architecture},
	isbn = {0-8186-8090-3},
	doi = {10.1109/PACT.1997.644016},
	author = {Hollingsworth, Jeffrey K and Niam, O. and Miller, B. P and Zhichen Xu and Goncalves,M. J.R and Ling Zheng}
}
@article {18438,
	title = {The empirical investigation of Perspective-Based Reading},
	journal = {Empirical Software Engineering},
	volume = {1},
	year = {1996},
	month = {1996///},
	pages = {133 - 164},
	abstract = {We consider reading techniques a fundamental means of achieving high quality software. Due to the lack of research in this area, we are experimenting with the application and comparison of various reading techniques. This paper deals with our experiences with a family of reading techniques known as Perspective-Based Reading (PBR), and its application to requirements documents. The goal of PBR is to provide operational scenarios where members of a review team read a document from a particular perspective, e.g., tester, developer, user. Our assumption is that the combination of different perspectives provides better coverage of the document, i.e., uncovers a wider range of defects, than the same number of readers using their usual technique.},
	keywords = {Computer, Science},
	isbn = {1382-3256},
	url = {http://dx.doi.org/10.1007/BF00368702},
	author = {Basili, Victor R. and Green,Scott and Laitenberger,Oliver and Lanubile,Filippo and Shull, Forrest and S{\o}rumg{\r a}rd,Sivert and Zelkowitz, Marvin V}
}
@article {18390,
	title = {Experimental models for software diagnosis},
	journal = {NIST IR},
	volume = {5889},
	year = {1996},
	month = {1996///},
	abstract = {Experimentation and data collection are becoming accepted practices within the software en-gineering community to determine the e ectiveness of various software development practices.
However, there is wide disagreement as to exactly what the term \experimentation" means in
this domain. It is important that we understand this concept and identify how we can best
collect data needed to validate software methods that are e ective. This understanding will
provide a basis for improved technical exchange of information between scientists and engineers
within the software community.
},
	author = {Zelkowitz, Marvin V and Wallace,D.}
}
@article {18703,
	title = {Identification of the Binding Site for Acidic Phospholipids on the PH Domain of Dynamin: Implications for Stimulation of GTPase Activity},
	journal = {Journal of Molecular Biology},
	volume = {255},
	year = {1996},
	month = {1996/01/12/},
	pages = {14 - 21},
	abstract = {It has recently been suggested that pleckstrin homology (PH) domains bind specifically to phospholipids, with phosphatidylinositol-4,5-bisphosphate (PtdIns(4,5)P2) being most strongly bound. This observation suggests that PH domains may be responsible for membrane association of proteins in which they occur. Further, this membrane association may be regulated by enzymes that modify lipid head groups to which PH domains may bind. We have studied the binding of phospholipids to the PH domain of human dynamin, a 100 kDa GTPase that is involved in the initial stages of endocytosis. We describe a rapid method for screening PH domain/ligand interactions that gives precise binding constants. We confirm that PtdIns(4,5)P2can bind to dynamin PH domain, although not in an aggregated state. Using NMR spectroscopy, we have mapped a specific site on the surface of dynamin PH domain of which binding of gIns(1,4,5)P3(the head-group skeleton of PtdIns(4,5)P2) occurs. The relative affinity of acidic phospholipids for dynamin PH domain correlates with their ability to activate the GTPase of dynamin. We propose, therefore, that the interaction of these phospholipids with dynamin is likely to occurviathe PH domain. Given the fact that PH domains are often found in pro- teins associated with GTPase activity, or in guanine nucleotide exchange factors, we suggest that one role of PH domains may be to couple phosphatidylinositol signalling to GTP hydrolysis.},
	keywords = {Fluorescence, ligand binding, NMR, PH domain, phospholipid},
	isbn = {0022-2836},
	doi = {10.1006/jmbi.1996.0002},
	url = {http://www.sciencedirect.com/science/article/pii/S0022283696900029},
	author = {Zheng,Jie and Cahill,Sean M. and Lemmon,Mark A. and Fushman, David and Schlessinger,Joseph and Cowburn,David}
}
@article {18404,
	title = {Modeling software engineering environment capabilities},
	journal = {Journal of Systems and Software},
	volume = {35},
	year = {1996},
	month = {1996/10//},
	pages = {3 - 14},
	abstract = {There is considerable interest today in designing open systems that permit tools to be moved freely among various environments on different hardware platforms. To develop such systems, terms such as open systems, features for open systems such as interoperability, and integration must all be precisely defined. We present a model that is an extension of a servicebased reference model for development environments that can be used to formally define these and other related concepts.},
	isbn = {0164-1212},
	doi = {10.1016/0164-1212(95)00082-8},
	url = {http://www.sciencedirect.com/science/article/pii/0164121295000828},
	author = {Zelkowitz, Marvin V}
}
@article {18430,
	title = {Software engineering technology infusion within NASA},
	journal = {Engineering Management, IEEE Transactions on},
	volume = {43},
	year = {1996},
	month = {1996/08//},
	pages = {250 - 261},
	abstract = {Abstract technology transfer is of crucial concern to both government and industry today. In this paper, several software engineering technologies used within NASA are studied, and the mechanisms, schedules, and efforts at transferring these technologies are investigated. The goals of this study are: (1) to understand the difference between technology transfer (the adoption of a new method by large segments of an industry) as an industrywide phenomenon and the adoption of a new technology by an individual organization (called technology infusion); and (2) to see if software engineering technology transfer differs from other engineering disciplines. While there is great interest today in developing technology transfer models for industry, it is the technology infusion process that actually causes changes in the current state of the practice},
	keywords = {and, computing;aerospace, development, development;aerospace, disciplines;government;industry;software, engineering, industry;research, infusion;technology, management;software, management;technology, MODELS, NASA;engineering, technologies;technology, transfer, transfer;},
	isbn = {0018-9391},
	doi = {10.1109/17.511836},
	author = {Zelkowitz, Marvin V}
}
@article {18368,
	title = {Algebra and models (and reality)},
	journal = {SIGSOFT Softw. Eng. Notes},
	volume = {20},
	year = {1995},
	month = {1995/04//},
	pages = {55 - 57},
	isbn = {0163-5948},
	doi = {10.1145/224155.224159},
	url = {http://doi.acm.org/10.1145/224155.224159},
	author = {Zelkowitz, Marvin V}
}
@article {14119,
	title = {Algebraic Analysis of the Hierarchical Basis Preconditioner},
	journal = {SIAM Journal on Matrix Analysis and ApplicationsSIAM. J. Matrix Anal. \& Appl.},
	volume = {16},
	year = {1995},
	month = {1995///},
	pages = {192 - 192},
	isbn = {08954798},
	doi = {10.1137/S0895479892236933},
	url = {http://epubs.siam.org/sima/resource/1/sjmael/v16/i1/p192_s1},
	author = {Elman, Howard and Zhang, Xuejun}
}
@article {18378,
	title = {Complexity measure evaluation and selection},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {21},
	year = {1995},
	month = {1995/08//},
	pages = {641 - 650},
	abstract = {A formal model of program complexity developed earlier by the authors is used to derive evaluation criteria for program complexity measures. This is then used to determine which measures are appropriate within a particular application domain. A set of rules for determining feasible measures for a particular application domain are given, and an evaluation model for choosing among alternative feasible measures is presented. This model is used to select measures from the classification trees produced by the empirically guided software development environment of R.W. Selby and A.A. Porter, and early experiments show it to be an effective process},
	keywords = {alternative, complexity, criteria;evaluation, development, domain;classification, environment;evaluation, evaluation;empirically, evaluation;software, feasible, guided, measure, measures;application, measures;program, measures;software, metrics;software, model;feasible, performance, quality;software, selection;, software, trees;complexity},
	isbn = {0098-5589},
	doi = {10.1109/32.403788},
	author = {Tian,J. and Zelkowitz, Marvin V}
}
@article {18426,
	title = {SEL{\textquoteright}s software process improvement program},
	journal = {Software, IEEE},
	volume = {12},
	year = {1995},
	month = {1995/11//},
	pages = {83 - 87},
	abstract = {We select candidates for process change on the basis of quantified Software Engineering Laboratory (SEL) experiences and clearly defined goals for the software. After we select the changes, we provide training and formulate experiment plans. We then apply the new process to one or more production projects and take detailed measurements. We assess process success by comparing these measures with the continually evolving baseline. Based upon the results of the analysis, we adopt, discard, or revise the process},
	keywords = {baseline;detailed, engineering, engineering;, evolving, improvement, Laboratory;continually, measurements;experiment, plans;production, process, program;software, projects;training;software, SEL, software},
	isbn = {0740-7459},
	doi = {10.1109/52.469763},
	author = {Basili, Victor R. and Zelkowitz, Marvin V and McGarry,F. and Page,J. and Waligora,S. and Pajerski,R.}
}
@article {18435,
	title = {Striving for correctness},
	journal = {Computers \& Security},
	volume = {14},
	year = {1995},
	month = {1995///},
	pages = {719 - 738},
	abstract = {In developing information technology, you want assurance that systems are secure and reliable, but you cannot have assurance or security without correctness. We discuss methods used to achieve correctness, focusing on weaknesses and approaches that management might take to increase belief in correctness. Formal methods, simulation, testing, and process modeling are addressed in detail. Structured programming, life-cycle modeling like the spiral model, use of CASE tools, use of formal methods, object-oriented design, reuse of existing code are also mentioned. Reliance on these methods involves some element of belief since no validated metrics on the effectiveness of these methods exist. Suggestions for using these methods as the basis for managerial decisions conclude the paper.},
	keywords = {Assurance, belief, correctness, Formal Methods, MATHEMATICAL MODELS, metrics, Process models, Risk management, Security testing, Silver bullets, simulation, Trustworthiness},
	isbn = {0167-4048},
	doi = {10.1016/0167-4048(95)00022-4},
	url = {http://www.sciencedirect.com/science/article/pii/0167404895000224},
	author = {Abrams,Marshall D. and Zelkowitz, Marvin V}
}
@article {18367,
	title = {Algebra and models (and reality)},
	journal = {SIGSOFT Softw. Eng. Notes},
	volume = {19},
	year = {1994},
	month = {1994/10//},
	pages = {79 - 81},
	isbn = {0163-5948},
	doi = {10.1145/190679.190688},
	url = {http://doi.acm.org/10.1145/190679.190688},
	author = {Zelkowitz, Marvin V}
}
@article {18821,
	title = {Building MRSEV models for CAM applications},
	journal = {Advances in Engineering Software},
	volume = {20},
	year = {1994},
	month = {1994///},
	pages = {121 - 139},
	abstract = {In integrating CAD and CAM applications, one major problem is how to interpret CAD information in a manner that makes sense for CAM. The goal is to develop a general approach that can be used with a variety of CAD and CAM applications for the manufacture of machined parts.In particular, a methodology is presented for taking a CAD model, extracting alternative interpretations of the model as collections of MRSEVs (material removal shape element volumes, a STEP-based library of machining features), and evaluating these interpretations to determine which one is optimal. The evaluation criteria may be defined by the user, in order to select the best interpretation for the particular application at hand.
},
	keywords = {CAD/CAM integration, design critiquing, feature recognition},
	isbn = {0965-9978},
	doi = {10.1016/0965-9978(94)90054-X},
	url = {http://www.sciencedirect.com/science/article/pii/096599789490054X},
	author = {Gupta, Satyandra K. and Kramer,Thomas R. and Nau, Dana S. and Regli,William C. and Zhang,Guangming}
}
@conference {17577,
	title = {Computing with very weak random sources},
	booktitle = {, 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings},
	year = {1994},
	month = {1994/11/20/22},
	pages = {264 - 275},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {For any fixed ε>0, we show how to simulate RP algorithms in time nO(log n) using the output of a δ-source with min-entropy R(ε). Such a weak random source is asked once for R(ε) bits; it outputs an R-bit string such that any string has probability at most 2-R(ε). If ε>1-1/(k+1), our BPP simulations take time nO(log(k n)) (log(k) is the logarithm iterated k times). We also give a polynomial-time BPP simulation using Chor-Goldreich sources of min-entropy RΩ(1), which is optimal. We present applications to time-space tradeoffs, expander constructions, and the hardness of approximation. Also of interest is our randomness-efficient Leftover Hash Lemma, found independently by Goldreich and Wigderson},
	keywords = {Application software, BPP simulations, Chor-Goldreich sources, computational complexity, Computational modeling, Computer science, Computer simulation, cryptography, distributed algorithms, expander constructions, hardness, MATHEMATICS, min-entropy, Physics computing, Polynomials, probability, R-bit string, randomness-efficient Leftover Hash Lemma, RP algorithms simulation, Testing, time-space tradeoffs, very weak random sources},
	isbn = {0-8186-6580-7},
	doi = {10.1109/SFCS.1994.365688},
	author = {Srinivasan, Aravind and Zuckerman,D.}
}
@conference {18746,
	title = {Design for manufacture in multi-enterprise partnerships: current status and future directions},
	year = {1994},
	month = {1994///},
	pages = {117 - 125},
	abstract = {To pursue market and technology opportunities effectively, US commercial and defense industries will be relying increasingly on multi-enterprise partnerships. Horizontal partnering combines the strengths of multiple firms in product design, manufacture, after sales support and customer service, in order to launch superior products in the global market. To support effective partnering, new approaches will be needed for integrating the activities of design, planning, and production. It is important to address both the fundamental modeling of design, process planning, and production planning in ways that account for the capabilities of potential manufacturing partners, and the development of optimization procedures to address the underlying decision problems. This paper elaborates on these issues and discusses approaches for addressing them.},
	url = {http://www.csa.com/partners/viewrecord.php?requester=gs\&collection=TRD\&recid=0160471CI},
	author = {Nau, Dana S. and Ball,M. O and Gupta,S.K. and Minis,I. E. and Zhang, G.}
}
@article {18401,
	title = {Measuring prime program complexity},
	journal = {Information Sciences},
	volume = {77},
	year = {1994},
	month = {1994/03//},
	pages = {325 - 350},
	abstract = {This paper uses the prime program decomposition of a program as the basis for a measure that closely correlates with our intuitive notion of program complexity. This measure is based upon the information theory ideas of randomness and entropy such that results about structured programming, data abstractions, and other programming paradigms can be stated in quantitative terms, and empirical means can be used to validate the assumptions used to develop the model. As a graph-based model, it can be applied to several graphical examples as extensions not otherwise available to source-code based models. This paper introduces the measure, derives several properties for it, and gives some simple examples to demonstrate that the measure is a plausible approximation of our notions concerning structured programming.},
	isbn = {0020-0255},
	doi = {10.1016/0020-0255(94)90007-8},
	url = {http://www.sciencedirect.com/science/article/pii/0020025594900078},
	author = {Zelkowitz, Marvin V and Tian,Jianhui}
}
@book {18433,
	title = {Software Specification: A Comparison of Formal Methods},
	year = {1994},
	month = {1994///},
	publisher = {Intellect Books},
	organization = {Intellect Books},
	keywords = {Computer software, Computer software/ Specifications, Computers / General, Computers / Programming / General, Formal methods (Computer science), software engineering, specifications},
	isbn = {9781567500332},
	author = {Gannon,John D. and Purtilo,James and Zelkowitz, Marvin V}
}
@inbook {13879,
	title = {Transforming queries from a relational schema to an object schema: A prototype based on F-logic},
	booktitle = {Methodologies for Intelligent SystemsMethodologies for Intelligent Systems},
	series = {Lecture Notes in Computer Science},
	volume = {869},
	year = {1994},
	month = {1994///},
	pages = {154 - 163},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	isbn = {978-3-540-58495-7},
	url = {http://dx.doi.org/10.1007/3-540-58495-1_16},
	author = {Chang,Yahui and Raschid, Louiqa and Dorr, Bonnie J},
	editor = {Ras,Zbigniew and Zemankova,Maria}
}
@article {18822,
	title = {Concurrent evaluation of machinability during product design},
	journal = {Computer},
	volume = {26},
	year = {1993},
	month = {1993/01//},
	pages = {61 - 63},
	abstract = {An approach to evaluating the machinability of a part during the design stage, which performs systematic generation and evaluation of machining alternatives, is discussed. The results of the analysis provide feedback to the designer about problems that might arise with the machining and information to the manufacturing engineer about which machining processes and process parameters are most desirable.<<ETX>>},
	keywords = {concurrent engineering, concurrent evaluation, machinability, machining, manufacturing engineer, product design},
	isbn = {0018-9162},
	doi = {10.1109/2.179158},
	author = {Gupta,S.K. and Nau, Dana S. and Zhang, G.}
}
@article {18743,
	title = {Development of machining alternatives, based on MRSEVs},
	journal = {Computers in Engineering},
	year = {1993},
	month = {1993///},
	pages = {47 - 47},
	abstract = {One missing link between CAD and CAM is the lack ofa systematic methodology for generating and evaluating al-
ternative ways to manufacture a proposed design. To ad-
dress this problem, we are developing a systematic approach
for generating and evaluating alternative ways to manufac-
ture machined parts, in order to provide information to the
designer about the manufacturability of the proposed de-
sign, and information to the process engineer about how
best to machine the part. This paper describes our overall
approach, and how MRSEVs (Material Removal Shape El-
ement Volumes, a STEP library of machining features) can
be used to support it.
},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.37.6348\&rep=rep1\&type=pdf},
	author = {Nau, Dana S. and Gupta,S.K. and Kramer,T. R. and Regli,W. C. and Zhang, G.}
}
@article {18830,
	title = {Estimation of Achievable Tolerances},
	volume = {ISR; TR 1993-44},
	year = {1993},
	month = {1993///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {This report presents a new and systematic approach to assist decision-making in selecting machining operation plans. We present a methodology to estimate achievable tolerances of operations plan. Given an operation plan, we use variety of empirical and mathematical models to evaluate process capabilities of various machining operations and compute achievable tolerances using tolerance charting techniques.},
	keywords = {Automation, computer aided manufacturing, Manufacturing, Manufacturing Systems},
	url = {http://drum.lib.umd.edu//handle/1903/5389},
	author = {Gupta, Satyandra K. and Nau, Dana S. and Zhang,G. M.}
}
@article {18744,
	title = {Evaluating product machinability for concurrent engineering},
	journal = {Concurrent Engineering: Contemporary Issues and Modern Design Tools},
	year = {1993},
	month = {1993///},
	pages = {264 - 279},
	url = {http://books.google.com/books?hl=en\&lr=\&id=S5rjzPSsM5EC\&oi=fnd\&pg=PA264\&dq=Satyandra+Gupta\&ots=Ldu80IZ66F\&sig=xZN6yo6NsLi2y3CZskweXchossg},
	author = {Nau, Dana S. and Zhang, G. and Gupta,S.K. and Karinthi,R. R.}
}
@article {18854,
	title = {Interpreting Product Designs for Manufacturability Evaluation},
	volume = {ISR; TR 1993-45},
	year = {1993},
	month = {1993///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {The ability to quickly introduce new quality products is a decisive factor in capturing market share. Because of pressing demands to reduce lead time, analyzing the manufacturability of the proposed design has become an important step in the design stage. In this paper we present an approach for evaluating the manufacturability of machined parts.<P>Evaluating manufacturability involves finding a way to manufacture the proposed design, and estimating the associated production cost and quality. However, there often can be several different ways to manufacture a proposed design - so to evaluate the manufacturability of the proposed design, we need to consider different ways to manufacture it, and determine which one best meets the manufacturing objectives.<P>In this paper we describe a methodology for systematically generating and evaluating alternative operation plans. As a first step, we identify all machining operations which can potentially be used to create the given design. Using these operations, we generate different operation plans for machining the part. Each time we generate a new operation plan, we assign it a manufacturability rating. The manufacturability rating for the design is the rating of the best operation plan.<P>We anticipate that by providing feedback about possible problems with the design, this work will be useful in providing a way to speed up the evaluation of new product designs in order to decide how or whether to manufacture them.},
	keywords = {Automation, computer aided manufacturing, manufacturability, Manufacturing Systems},
	url = {http://drum.lib.umd.edu//handle/1903/5390},
	author = {Gupta, Satyandra K. and Nau, Dana S. and Zhang,G. M.}
}
@article {18424,
	title = {Role of verification in the software specification process},
	journal = {Advances in computers},
	volume = {36},
	year = {1993},
	month = {1993///},
	pages = {43 - 109},
	author = {Zelkowitz, Marvin V}
}
@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}
}
@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.}
}
@article {18369,
	title = {An application of decision theory for the evaluation of software prototypes},
	journal = {Journal of Systems and Software},
	volume = {19},
	year = {1992},
	month = {1992///},
	pages = {27 - 39},
	author = {C{\'a}rdenas,S. R and Tian,J. and Zelkowitz, Marvin V}
}
@article {18360,
	title = {A formal program complexity model and its application},
	journal = {Journal of Systems and Software},
	volume = {17},
	year = {1992},
	month = {1992/03//},
	pages = {253 - 266},
	abstract = {This article takes an axiomatic approach to defining program complexity using complexity rankings and measures. A complexity ranking is an abstract, qualitative comparison between programs that is approximated by a complexity measure on each program. A set of axioms are stated and a classification scheme is presented with properties of each class. This is extended a series of properties developed by Weyuker. The formal model has many applications, including evaluating and classifying existing complexity measures and serving as criteria for complexity measure selection.},
	isbn = {0164-1212},
	doi = {10.1016/0164-1212(92)90114-Y},
	url = {http://www.sciencedirect.com/science/article/pii/016412129290114Y},
	author = {Tian,Jianhui and Zelkowitz, Marvin V}
}
@article {18836,
	title = {General of Machining Alternatives for Machinability Evaluation},
	volume = {ISR; TR 1992-106},
	year = {1992},
	month = {1992///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {This paper presents a new methodology for evaluating the machinability of a machined part during the design stage of the product development cycle, so that problems related to machining can be recognized and corrected while the product is being designed. Our basic approach is to perform a systematic evaluation of machining alternatives throughout each step in the design stage. This involves three basic steps: (1) generate alternative interpretations of the design as different collections of machinable features, (2) generate the various possible sequences of machining operations capable of producing each interpretation, and (3) evaluate each operation sequence, to determine the relevant information on achievable quality and associated costs. The information provided by this analysis can be used not only to give feedback to the designer about problems that might arise with the machining, but also to provide information to the manufacturing engineer about alternative ways in which the part might be machined.},
	keywords = {Automation, computer aided manufacturing, manufacturability, Manufacturing Systems},
	url = {http://hdl.handle.net/1903/5287},
	author = {Gupta, Satyandra K. and Nau, Dana S. and Zhang,G. M.}
}
@article {18840,
	title = {Generation and Evaluation of Alternative Operation},
	volume = {ISR; TR 1992-20},
	year = {1992},
	month = {1992///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {This paper presents a new and systematic approach to assist decision-making in selecting machining operation sequences. The approach is to produce alternative interpretations of design as different collections of machinable features, use these interpretations to generate alternative machining operation sequences, and evaluate the cost and achievable machining accuracy of each operations sequence. Given the operation sequences and their evaluations, it is then possible to calculate the performance measures of interest, and use these performance measures to select, from among the various alternatives, one or more of them that can best balance the need for a quality product against the need for efficient machining.},
	keywords = {Automation, computer aided manufacturing, computer integrated manufacturing, Feature extraction, flexible manufacturing, Manufacturing, Manufacturing Systems, Solid modeling},
	url = {http://drum.lib.umd.edu//handle/1903/5203},
	author = {Nau, Dana S. and Zhang,G. M. and Gupta, Satyandra K.}
}
@article {18842,
	title = {Generation of Machining Alternatives for Machinability Evaluation},
	volume = {ISR; TR 1992-106},
	year = {1992},
	month = {1992///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {This paper presents a new methodology for evaluating the machinability of a machined part during the design stage of the product development cycle, so that problems related to machining can be recognized and corrected while the product is being designed. Our basic approach is to perform a systematic evaluation of machining alternatives throughout each step in the design stage. This involves three basic steps: (1) generate alternative interpretations of the design as different collections of machinable features, (2) generate the various possible sequences of machining operations capable of producing each interpretation, and (3) evaluate each operation sequence, to determine the relevant information on achievable quality and associated costs. The information provided by this analysis can be used not only to give feedback to the designer about problems that might arise with the machining, but also to provide information to the manufacturing engineer about alternative ways in which the part might be machined.},
	keywords = {Automation, computer aided manufacturing, manufacturability, Manufacturing Systems},
	url = {http://drum.lib.umd.edu//handle/1903/5287},
	author = {Gupta, Satyandra K. and Nau, Dana S. and Zhang,G. M.}
}
@conference {18373,
	title = {An improved classification tree analysis of high cost modules based upon an axiomatic definition of complexity},
	booktitle = {Software Reliability Engineering, 1992. Proceedings., Third International Symposium on},
	year = {1992},
	month = {1992/10//},
	pages = {164 - 172},
	abstract = {Identification of high cost modules has been viewed as one mechanism to improve overall system reliability, since such modules tend to produce more than their fair share of problems. A decision tree model has previously been used to identify such modules. In this paper, a previously developed axiomatic model of program complexity is merged with the previously developed decision tree process for an improvement in the ability to identify such modules. This improvement has been tested using data from the NASA Software Engineering Laboratory},
	keywords = {(mathematics);, analysis;, axiomatic, classification, classification;, complexity;, computational, cost, decision, definition;, high, metrics;, model;, modules;, overall, program, reliability;, software, subroutines;, system, tree, TREES},
	doi = {10.1109/ISSRE.1992.285848},
	author = {Tian,Jianhui and Porter, Adam and Zelkowitz, Marvin V}
}
@conference {18406,
	title = {On the nature of bias and defects in the software specification process},
	booktitle = {Computer Software and Applications Conference, 1992. COMPSAC {\textquoteright}92. Proceedings., Sixteenth Annual International},
	year = {1992},
	month = {1992/09//},
	pages = {17 - 24},
	abstract = {Implementation bias in a specification is an arbitrary constraint in the solution space. The authors describe the problem of bias and then present a model of the specification and design processes describing individual subprocesses in terms of precision/detail programs, and a model of bias in multi-attribute software specifications. While studying how bias is introduced into a specification it was realized that software defects and bias are dual problems of a single phenomenon. This has been used to explain the large proportion of faults found during the coding phase at the Software Engineering Laboratory at NASA Goddard Space Flight Center},
	keywords = {Center;NASA;Software, defects;software, engineering, Flight, Goddard, Laboratory;bias;coding, phase;design, processes;multiattribute, reliability;, reliability;formal, software, space, specification;software},
	doi = {10.1109/CMPSAC.1992.217609},
	author = {Straub,P. and Zelkowitz, Marvin V}
}
@article {14111,
	title = {Parallel sparse Cholesky factorization on a shared memory multiprocessor},
	journal = {Parallel Computing},
	volume = {18},
	year = {1992},
	month = {1992/09//},
	pages = {1009 - 1022},
	abstract = {Parallel implementations of Cholesky factorization for sparse symmetric positive definite matrices are considered on a shared memory multiprocessor computer. Two column-oriented schemes, known as the column-Cholesky algorithm and the fan-in algorithm, along with enhancements of each, are implemented and discussed. High parallel efficiency of the column-Cholesky algorithm and its enhancement is demonstrated for test problems. A detailed investigation of the performance of the fan-in algorithm and its enhancement, the compute-ahead fan-in algorithm, is made to study the effects of overhead associated with the fan-in based schemes.},
	keywords = {linear algebra, Parallel algorithms, shared memory multiprocessor, sparse Cholesky factorization},
	isbn = {0167-8191},
	doi = {16/0167-8191(92)90014-X},
	url = {http://www.sciencedirect.com/science/article/pii/016781919290014X},
	author = {Zhang, G. and Elman, Howard}
}
@article {18434,
	title = {Standards-are software engineering process standards really necessary?},
	journal = {Computer},
	volume = {25},
	year = {1992},
	month = {1992/11//},
	pages = {82 - 84},
	abstract = {The need for software engineering process standards-as opposed to product standards-is discussed from two different viewpoints. M.V. Zelkowitz states that process standards are generally written as policy statements on how to conduct certain processes. As such, they give the framework of the underlying model, but not enough guidance to specify details. They are fuzzy and hard to implement, and they make conformance testing extremely difficult. F.J. Buckley responds to several significant issues raised in Zelkowitz{\textquoteright}s arguments},
	keywords = {conformance, engineering, engineering;standards;, process, standards;software, statements;product, testing;policy},
	isbn = {0018-9162},
	doi = {10.1109/2.166422},
	author = {Zelkowitz, Marvin V and Buckley,F.J.}
}
@article {12776,
	title = {Testing preorders for probabilistic processes},
	journal = {Automata, Languages and Programming},
	year = {1992},
	month = {1992///},
	pages = {708 - 719},
	author = {Cleaveland, Rance and Smolka,S. and Zwarico,A.}
}
@article {17137,
	title = {ESP{\textquoteright}91 Panel on The Best of ESP},
	journal = {Empirical studies of programmers: fourth workshop},
	year = {1991},
	month = {1991///},
	pages = {1 - 1},
	author = {Zweben,S. and Curtis,B. and Shneiderman, Ben}
}
@article {18362,
	title = {A management tool for evaluation of software design},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {17},
	year = {1991},
	month = {1991/09//},
	pages = {961 - 971},
	abstract = {A model for evaluating software designs based on extending the functional model of program verification with concepts from economic decision theory has been proposed. The authors describe the method, and discuss a prototype implementation of a tool, called Selector, which implements this technique. It is suggested that a system like Selector can be used in two ways: as a decision support system for management to be used in the process of making choices among various alternatives; and as a prototyping investigative system for proposing and answering a series of {\textquoteleft}what if{\textquoteright} scenarios. The proposed model depends on a risk analysis, of each potential solution and aspects of decision theory to modify the evaluation strategy. The model depends on equilibrium probabilities for generating answers},
	keywords = {analysis;software, decision, designs;decision, investigative, model;management, probabilities;evaluation, prototyping;software, Selector;decision, strategy;functional, Support, system;economic, system;risk, systems;program, theory;equilibrium, tool;program, tools;, verification;prototyping, verification;software},
	isbn = {0098-5589},
	doi = {10.1109/32.92916},
	author = {Cardenas-Garcia,S. and Zelkowitz, Marvin V}
}
@article {18441,
	title = {The role for executable specifications in system maintenance},
	journal = {Information Sciences},
	volume = {57{\textendash}58},
	year = {1991},
	month = {1991/09//},
	pages = {347 - 359},
	abstract = {As software becomes increasingly complex, two attributes of the system life cycle are taking on more important roles. We need the ability to formally specify the functionality of the systems we build in order to minimize costly development problems and, with long life times, we need the ability to enhance existing systems with new features in order to prolong their usefulness. This enhancement process also needs a mechanism for formally defining any new functionality on data objects placed upon the system. This paper describes the AS* research project which is addressing this issue. AS* is a language-independent specification language embedded within an existing programming language for the purpose of providing extensions to existing systems. This paper discusses the designs of AS*, the structure of the prototype implementation and describes some early experiences using the system.},
	isbn = {0020-0255},
	doi = {10.1016/0020-0255(91)90086-A},
	url = {http://www.sciencedirect.com/science/article/pii/002002559190086A},
	author = {Zelkowitz, Marvin V and Cardenas,Sergio}
}
@conference {12836,
	title = {A theory of testing for real-time},
	booktitle = {, Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, 1991. LICS {\textquoteright}91},
	year = {1991},
	month = {1991/07/15/18},
	pages = {110 - 119},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A framework for generating testing preorders that relate processes on the basis of their timing behavior as well as their degree of relative nondeterminism is developed. The basic concepts of transition systems and testing are reviewed, and timed testing, which takes account of the delay exhibited by a process as it attempts to pass a test, is introduced. The framework is then applied to two different scenarios. In the first, relations are constructed that relate processes on the basis of all timing considerations. In the second, relations are constructed that relate processes on the basis of their relative speeds. In both cases, alternative denotational characterizations of the resulting preorders are presented, and examples are given to illustrate the utility of the approach},
	keywords = {Algebra, Character generation, Computer science, Delay, formal logic, Licenses, nondeterminism, Process control, Protocols, Real time systems, real-time, System testing, testing preorders, testing theory, timed testing, Timing, timing behavior, transition systems},
	isbn = {0-8186-2230-X},
	doi = {10.1109/LICS.1991.151635},
	author = {Cleaveland, Rance and Zwarico,A. E}
}
@conference {18388,
	title = {Evaluation criteria for functional specifications},
	booktitle = {Proceedings of the 12th international conference on Software engineering},
	series = {ICSE {\textquoteright}90},
	year = {1990},
	month = {1990///},
	pages = {26 - 33},
	publisher = {IEEE Computer Society Press},
	organization = {IEEE Computer Society Press},
	address = {Los Alamitos, CA, USA},
	isbn = {0-89791-349-3},
	url = {http://dl.acm.org/citation.cfm?id=100296.100299},
	author = {Cardenas,S. and Zelkowitz, Marvin V}
}
@article {18361,
	title = {A functional correctness model of program verification},
	journal = {Computer},
	volume = {23},
	year = {1990},
	month = {1990/11//},
	pages = {30 - 39},
	abstract = {A model whose verification conditions depend only on elementary symbolic execution of a trace table is presented. The method is applied to rather simple programs. However, even in large complex implementations, the techniques can be applied informally to determine the functionality of complex interactions. The technique is easy to learn (it is used in a freshman computer science course) and lends itself to automation.<<ETX>>},
	keywords = {correctness, elementary, execution;functional, model;program, symbolic, table;program, verification;, verification;trace},
	isbn = {0018-9162},
	doi = {10.1109/2.60878},
	author = {Zelkowitz, Marvin V}
}
@article {18389,
	title = {Experiences building a syntax-directed editor},
	journal = {Software Engineering Journal},
	volume = {4},
	year = {1989},
	month = {1989/11//},
	pages = {294 - 294},
	abstract = {The paper presents a set of techniques for building robust software using the development of a microprocessor SUPPORT programming environment as an example. It discusses some of the attributes built into the system to best handle the concerns of portability, functionality, and effectiveness that had to be dealt with for the system to be reliable on a small machine, and it describes some of the choices made to obtain the best use of available hardware},
	keywords = {applications;, editing;, editor;, engineering;, environment;, environments;, microcomputer, microprocessor;, portability;, Programming, robust, software, software;, Support, syntax-directed, text},
	isbn = {0268-6961},
	author = {Zelkowitz, Marvin V and Kowalchack,B. and Itkin,D. and Herman,L.}
}
@book {18419,
	title = {Requirements For a Software Engineering Environment: Proceedings of the University of Maryland Workshop, May 5-8, 1986},
	year = {1989},
	month = {1989///},
	publisher = {Intellect Books},
	organization = {Intellect Books},
	keywords = {Computers / General, software engineering, Software engineering/ Congresses},
	isbn = {9780893914479},
	author = {Zelkowitz, Marvin V}
}
@inbook {18363,
	title = {A support tool for teaching computer programming},
	booktitle = {Issues in software engineering educationIssues in software engineering education},
	year = {1989},
	month = {1989///},
	pages = {139 - 167},
	publisher = {Springer-Verlag New York, Inc.},
	organization = {Springer-Verlag New York, Inc.},
	address = {New York, NY, USA},
	isbn = {0-387-96840-7},
	url = {http://dl.acm.org/citation.cfm?id=73064.73074},
	author = {Zelkowitz, Marvin V and Kowalchack,B. and Itkin,D. and Herman,L.},
	editor = {Fairley,Richard and Freeman,Peter}
}
@article {18415,
	title = {Program complexity using Hierarchical Abstract Computers},
	journal = {Computer Languages},
	volume = {13},
	year = {1988},
	month = {1988///},
	pages = {109 - 123},
	abstract = {A model of program complexity is introduced which combines structural control flow measures with data flow measures. This complexity measure is based upon the prime program decomposition of a program written for a Hierarchical Abstract Computer. It is shown that this measure is consistent with the ideas of information hiding and data abstraction. Because this measure is sensitive to the linear form of a program, it can be used to measure different concrete representations of the same algorithm, as in a structured and an unstructured version of the same program. Application of the measure as a model of system complexity is given for {\textquotedblleft}upstream{\textquotedblright} processes (e.g. specification and design phases) where there is no source program to measure by other techniques.},
	keywords = {CASE tools, complexity, ENVIRONMENTS, measurement, Prime programs},
	isbn = {0096-0551},
	doi = {10.1016/0096-0551(88)90019-7},
	url = {http://www.sciencedirect.com/science/article/pii/0096055188900197},
	author = {Bail,William G and Zelkowitz, Marvin V}
}
@article {18422,
	title = {Resource utilization during software development},
	journal = {Journal of Systems and Software},
	volume = {8},
	year = {1988},
	month = {1988/09//},
	pages = {331 - 336},
	abstract = {This paper discusses resource utilization over the life cycle of software development and discusses the role that the current {\textquotedblleft}waterfall{\textquotedblright} model plays in the actual software life cycle. Software production in the NASA environment was analyzed to measure these differences. The data from 13 different projects were collected by the Software Engineering Laboratory at NASA Goddard Space Flight Center and analyzed for similarities and differences. The results indicate that the waterfall model is not very realistic in practice, and that as technology introduces further perturbations to this model with concepts like executable specifications, rapid prototyping, and wide-spectrum languages, we need to modify our model of this process.},
	isbn = {0164-1212},
	doi = {10.1016/0164-1212(88)90016-7},
	url = {http://www.sciencedirect.com/science/article/pii/0164121288900167},
	author = {Zelkowitz, Marvin V}
}
@book {18427,
	title = {Selected reprints in software},
	year = {1987},
	month = {1987///},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	author = {Zelkowitz, Marvin V}
}
@article {18446,
	title = {Two implementation models of abstract data types},
	journal = {Computer Languages},
	volume = {12},
	year = {1987},
	month = {1987///},
	pages = {21 - 25},
	abstract = {This paper compares two implementation models for abstract data types: direct and indirect implementations. Direct implementations offer relatively cheap execution and expensive compilation costs while indirect implementations result in relatively expensive implementations and cheap compilation costs. These two models are both accommodated by Ada, and a small experiment compares their costs for a particular data type.},
	keywords = {abstract data type, ada, run-time implementation},
	isbn = {0096-0551},
	doi = {10.1016/0096-0551(87)90009-9},
	url = {http://www.sciencedirect.com/science/article/pii/0096055187900099},
	author = {Gannon,John D. and Zelkowitz, Marvin V}
}
@conference {18439,
	title = {The Engineering of an Environment on Small Machines},
	booktitle = {Proceedings of the IEEE 1st International Conference on Computer Workstations},
	year = {1985},
	month = {1985///},
	pages = {61 - 69},
	author = {Zelkowitz, Marvin V and Elgot,J. and Itkin,D. and Kowalchack,B. and Maggio,M.}
}
@article {18420,
	title = {Research in Programming Languages and Software Engineering.},
	year = {1985},
	month = {1985/12/24/},
	institution = {Department of Computer Science, University of Maryland, College Park},
	abstract = {During the past year three research papers were written and two published conference presentations were given. Titles of the published research articles are: A Stochastic Analysis of a Modified Gain Extended Kalman Filter with Applications to Estimation with Bearings only Measurements; The Modified Gain Extended Kalman Kilter and Parameter Identification in Linear Systems and Maximum Information Guidance for Homing Missiles.},
	keywords = {*BEARINGS, *COMPUTER PROGRAMS, *ESTIMATES, *GUIDANCE, *KALMAN FILTERING, *LINEAR SYSTEMS, *STOCHASTIC PROCESSES, COMPUTER PROGRAMMING AND SOFTWARE, GAIN, identification, measurement, programming languages, STATISTICS AND PROBABILITY, SYSTEMS ENGINEERING., TARGET DIRECTION, RANGE AND POSITION FINDING},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA186269},
	author = {Gannon,John and Basili, Victor R. and Zelkowitz, Marvin V and Yeh,Raymond}
}
@article {18380,
	title = {Data collection and evaluation for experimental computer science research},
	journal = {Information Processing \& Management},
	volume = {20},
	year = {1984},
	month = {1984///},
	pages = {269 - 276},
	abstract = {The Software Engineering Laboratory has been monitoring software development at NASA Goddard Space Flight Center since 1976. This report describes the data collection activities of the Laboratory and some of the difficulties of obtaining reliable data. In addition, the application of this data collection process to a current prototyping experiment is reviewed.},
	isbn = {0306-4573},
	doi = {10.1016/0306-4573(84)90059-1},
	url = {http://www.sciencedirect.com/science/article/pii/0306457384900591},
	author = {Zelkowitz, Marvin V}
}
@article {18405,
	title = {Monitoring an Ada software development},
	journal = {ACM SIG Ada Letters},
	volume = {IV},
	year = {1984},
	month = {1984/07//},
	pages = {32 - 39},
	isbn = {1094-3641},
	doi = {10.1145/998401.998402},
	url = {http://doi.acm.org/10.1145/998401.998402},
	author = {Basili, Victor R. and Chang,Shih and Gannon,John and Katz,Elizabeth and Panlilio-Yap,N. Monina and Ramsey,Connie Loggia and Zelkowitz, Marvin V and Bailey,John and Kruesi,Elizabeth and Sheppard,Sylvia}
}
@book {18416,
	title = {Programming languages: design and implementation},
	year = {1984},
	month = {1984///},
	publisher = {Prentice-Hall},
	organization = {Prentice-Hall},
	author = {Pratt,T. W and Zelkowitz, Marvin V}
}
@article {18429,
	title = {Software Engineering Practices in the US and Japan},
	journal = {Computer},
	volume = {17},
	year = {1984},
	month = {1984/06//},
	pages = {57 - 66},
	isbn = {0018-9162},
	doi = {10.1109/MC.1984.1659162},
	author = {Zelkowitz, Marvin V and Yeh,R. T and Hamlet,R.G. and Gannon,J. D and Basili, Victor R.}
}
@article {18364,
	title = {A taxonomy of prototype designs},
	journal = {ACM SIGSOFT Software Engineering Notes},
	volume = {9},
	year = {1984},
	month = {1984///},
	pages = {11 - 12},
	author = {Zelkowitz, Marvin V}
}
@inbook {17199,
	title = {Human factors of interactive software},
	booktitle = {Enduser Systems and Their Human FactorsEnduser Systems and Their Human Factors},
	series = {Lecture Notes in Computer Science},
	volume = {150},
	year = {1983},
	month = {1983///},
	pages = {9 - 29},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {There is intense interest about human factors issues in interactive computer systems for life-critical applications, industrial/commercial uses, and personal computing in the office or home. Primary design goals include proper functionality, adequate reliability, suitable cost, and adherence to schedule. Measurable human factors issues include time to learn, speed of performance, rate of errors, subjective satisfaction, and retention over time. Specific human factors acceptance tests are described as a natural complement to hardware and software acceptance tests. Project management ideas, information resources, and potential research directions are presented.},
	isbn = {978-3-540-12273-9},
	url = {http://dx.doi.org/10.1007/3-540-12273-7_16},
	author = {Shneiderman, Ben},
	editor = {Blaser,Albrecht and Zoeppritz,Magdalena}
}
@article {18444,
	title = {The Software Industry: A State of the Art Survey},
	journal = {Foundations of Empirical Software Engineering: The Legacy of Victor R. Basili},
	volume = {1},
	year = {1983},
	month = {1983///},
	pages = {383 - 383},
	author = {Zelkowitz, Marvin V and Yeh,R. and Hamlet,R.G. and Gannon,J. D and Basili, Victor R.}
}
@article {16540,
	title = {Transferability of medical decision support systems based on Bayesian classification},
	journal = {Medical Decision Making},
	volume = {3},
	year = {1983},
	month = {1983///},
	pages = {501 - 501},
	author = {Zagoria,R. J and Reggia, James A.}
}
@conference {16635,
	title = {Bayesian classification in medicine: The transferability question},
	booktitle = {Proceedings of the Fifth Annual Symposium on Computer Applications in Medical Care},
	year = {1981},
	month = {1981///},
	pages = {250 - 252},
	author = {Zagoria,R. and Reggia, James A. and Price,T. and Banko,M.}
}
@article {18397,
	title = {Implementation of language enhancements},
	journal = {Computer Languages},
	volume = {6},
	year = {1981},
	month = {1981///},
	pages = {139 - 153},
	abstract = {Data abstractions have been proposed as a means to enhance program modularity. The implementation of such new features to an existing language is typically handled by either rewriting large portions of an existing compiler or by using a preprocessor to translate the extensions into the standard language. The first technique is expensive to implement while the latter is usually slow and clumsy to use. In this paper a data abstraction addition to PL 1 is described and a hybrid implementation is given. A minimal set of primitive features are added to the compiler and the other extensions are added via an internal macro processor that expands the new syntax into the existing language.},
	keywords = {Compiler design, Data abstraction, Language extensions, specifications},
	isbn = {0096-0551},
	doi = {10.1016/0096-0551(81)90026-6},
	url = {http://www.sciencedirect.com/science/article/pii/0096055181900266},
	author = {Zelkowitz, Marvin V and Lyle,James R.}
}
@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}
}
@article {18366,
	title = {Advances in software engineering resource estimation},
	journal = {Advances in computer programming management},
	volume = {1},
	year = {1980},
	month = {1980///},
	pages = {206 - 225},
	author = {Zelkowitz, Marvin V}
}
@book {18428,
	title = {Selected reprints in software: selected reprints from Computer},
	year = {1980},
	month = {1980///},
	publisher = {Computer Society Press},
	organization = {Computer Society Press},
	author = {Zelkowitz, Marvin V}
}
@article {18403,
	title = {Measuring software development characteristics in the local environment},
	journal = {Computers \& Structures},
	volume = {10},
	year = {1979},
	month = {1979/04//},
	pages = {39 - 43},
	abstract = {This paper discusses the characterization and analysis facilities being performed by the Software Engineering Laboratory which can be done with minimal effort on many projects. Some examples are given of the kinds of analyses that can be done to aid in managing, understanding and characterizing the development of software in a production environment.},
	isbn = {0045-7949},
	doi = {10.1016/0045-7949(79)90071-3},
	url = {http://www.sciencedirect.com/science/article/pii/0045794979900713},
	author = {Basili, Victor R. and Zelkowitz, Marvin V}
}
@book {18413,
	title = {Principles of software engineering and design},
	year = {1979},
	month = {1979///},
	publisher = {Prentice Hall Professional Technical Reference},
	organization = {Prentice Hall Professional Technical Reference},
	isbn = {013710202X},
	author = {Zelkowitz, Marvin V and Shaw,A. C and Gannon,J. D}
}
@conference {18421,
	title = {Resource estimation for medium-scale software projects},
	booktitle = {Twelfth Conference on the Interface of Statistics and Computer Science, by IEEE Computer Society},
	year = {1979},
	month = {1979///},
	pages = {267 - 272},
	author = {Zelkowitz, Marvin V}
}
@article {18436,
	title = {Surveyor{\textquoteright}s Forum: A Question of Transition},
	journal = {ACM Computing Surveys (CSUR)},
	volume = {11},
	year = {1979},
	month = {1979/12//},
	pages = {411 - 412},
	isbn = {0360-0300},
	doi = {10.1145/356789.356799},
	url = {http://doi.acm.org/10.1145/356789.356799},
	author = {Zelkowitz, Marvin V}
}
@conference {18375,
	title = {Analyzing medium-scale software development},
	booktitle = {Proceedings of the 3rd international conference on Software engineering},
	series = {ICSE {\textquoteright}78},
	year = {1978},
	month = {1978///},
	pages = {116 - 123},
	publisher = {IEEE Press},
	organization = {IEEE Press},
	address = {Piscataway, NJ, USA},
	abstract = {The collection and analysis of data from programming projects is necessary for the appropriate evaluation of software engineering methodologies. Towards this end, the Software Engineering Laboratory was organized between the University of Maryland and NASA Goddard Space Flight Center. This paper describes the structure of the Laboratory and provides some data on project evaluation from some of the early projects that have been monitored. The analysis relates to resource forecasting using a model of the project life cycle based upon the Rayleigh equation and to error rates applying ideas developed by Belady and Lehman.},
	url = {http://dl.acm.org/citation.cfm?id=800099.803200},
	author = {Basili, Victor R. and Zelkowitz, Marvin V}
}
@article {18396,
	title = {Implementation of a Capability-Based Data Abstraction},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {SE-4},
	year = {1978},
	month = {1978/01//},
	pages = {56 - 64},
	abstract = {One important feature in programming language design is an appropriate data definitional facility. Criteria now recognized as important are the concepts of information hiding and data abstraction. The problem, however, is to embed these ideas into languages. Although including these ideas has often led to the design of a new language, that is not always necessary. Such facilities may be added to languages like PL/1 or Pascal. This report discusses the inclusion of such facilities within one such PL/1 compiler. While the resulting system does not have the optimal set of protection features, it does have several advantages: the base language is known to a large class of programmers, there are many such compilers already written, and the system achieves almost as much protection as is needed.},
	keywords = {Data abstraction; Pascal, PL/1; infonnation hiding; pointer variables;},
	isbn = {0098-5589},
	doi = {10.1109/TSE.1978.231466},
	author = {Zelkowitz, Marvin V and Larsen,H.J.}
}
@conference {18407,
	title = {Operation of the Software Engineering Laboratory},
	booktitle = {Proceedings of the Second US Army/IEEE Software Life Cycle Management Workshop. New York: Computer Societies Press},
	year = {1978},
	month = {1978///},
	author = {Basili, Victor R. and Zelkowitz, Marvin V}
}
@article {18410,
	title = {Perspectives in Software Engineering},
	journal = {ACM Comput. Surv.},
	volume = {10},
	year = {1978},
	month = {1978/06//},
	pages = {197 - 216},
	isbn = {0360-0300},
	doi = {10.1145/356725.356731},
	url = {http://doi.acm.org/10.1145/356725.356731},
	author = {Zelkowitz, Marvin V}
}
@article {18414,
	title = {Productivity measurement on software engineering projects},
	journal = {SIGSOFT Softw. Eng. Notes},
	volume = {3},
	year = {1978},
	month = {1978/10//},
	pages = {30 - 31},
	abstract = {The milestone is often used as a measure of project progress on large scale software developments. In this report, a quantitative measure of the milestone is developed and shown to be consistent with existing estimating techniques.},
	isbn = {0163-5948},
	doi = {10.1145/1010741.1010748},
	url = {http://doi.acm.org/10.1145/1010741.1010748},
	author = {Zelkowitz, Marvin V}
}
@article {18383,
	title = {Effects of structured programming on PL/I programmers},
	journal = {Software: Practice and Experience},
	volume = {7},
	year = {1977},
	month = {1977///},
	pages = {793 - 795},
	abstract = {A PL/I system has been implemented which automatically collects and saves information on every program compiled and executed. This note describes some of the analysis that has been performed on approximately 9,000 of these collected programs.},
	doi = {10.1002/spe.4380070613},
	author = {Zelkowitz, Marvin V}
}
@conference {18443,
	title = {The software engineering laboratory: Objectives},
	booktitle = {Proceedings of the fifteenth annual SIGCPR conference},
	series = {SIGCPR {\textquoteright}77},
	year = {1977},
	month = {1977///},
	pages = {256 - 269},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {A great deal of time and money has been and will continue to be spent in developing software. Much effort has gone into the generation of various software development methodologies that are meant to improve both the process and the product ([MYER, 75], [BAKE, 74], [WOLV, 72]). Unfortunately, it has not always been clear what the underlying principles involved in the software development process are and what effect the methodologies have; it is not always clear what constitutes a better product. Thus progress in finding techniques that produce better, cheaper software depends on developing new deeper understandings of good software and the software development process through studying the underlying principles involved in software and the development process. At the same time we must continue to produce software. A better understanding of the factors that affect the development of software and their interrelationships is required in order to gain better insights into the underlying principles. The Software Engineering Laboratory has been established, in August 1976, at NASA Goddard Space Flight Center in cooperation with the University of Maryland to promote such understanding. The next section gives an overview of the research objectives and experiments being performed at the Laboratory. Section III contains the current list of factors that affect the software development process or product and are to be studied or neutralized. The data collection and data management activities are discussed in Section IV. The last section contains information on the current status and future plans for the Laboratory.},
	doi = {10.1145/800100.803251},
	url = {http://doi.acm.org/10.1145/800100.803251},
	author = {Basili, Victor R. and Zelkowitz, Marvin V}
}
@conference {18376,
	title = {Automatic program analysis and evaluation},
	booktitle = {Proceedings of the 2nd international conference on Software engineering},
	series = {ICSE {\textquoteright}76},
	year = {1976},
	month = {1976///},
	pages = {158 - 163},
	publisher = {IEEE Computer Society Press},
	organization = {IEEE Computer Society Press},
	address = {Los Alamitos, CA, USA},
	abstract = {There is currently considerable interest in the computing community in the evaluation of computer programming. However, in order to objectively evaluate such concepts, it is necessary to undertake a thorough evaluation of the programming process itself. Most previous studies of this type have analyzed, by hand usually, a few instances of programs. This has led to some general conjectures; however, the amount of information that must be processed precludes any large scale analysis. In order to avoid this problem, an automatic data collection facility has been implemented as part of a PL/1 compiler at the University of Maryland. This system automatically collects information on each program that has been compiled - at almost no additional cost to the user of the compiler. This paper will describe the system and will evaluate some of the characteristics of some of the 25,000 programs that have been run since July, 1975.},
	keywords = {ERRORS, Evaluation, Program complexity, Program measurement, Static and dynamic analysis},
	url = {http://dl.acm.org/citation.cfm?id=800253.807668},
	author = {Zelkowitz, Marvin V}
}
@conference {18387,
	title = {Error checking with pointer variables},
	booktitle = {Proceedings of the 1976 annual conference},
	series = {ACM {\textquoteright}76},
	year = {1976},
	month = {1976///},
	pages = {391 - 395},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {The use of pointer variables in a programming language often results in a difficult class of errors to detect. Pointers may point to storage that no longer is allocated, or storage may be allocated as one data type and accessed as another. This report describes the implementation of pointers in the PLUM PL/1 compiler such that all error conditions are detected. In addition, preliminary tests with PLUM seem to indicate that the total checking of pointers is not as expensive an operation as it first appears.},
	doi = {10.1145/800191.805623},
	url = {http://doi.acm.org/10.1145/800191.805623},
	author = {Zelkowitz, Marvin V and McMullin,Paul R. and Merkel,Keith R. and Larsen,Howard J.}
}
@book {18412,
	title = {PL/I Programming with PLUM},
	year = {1976},
	month = {1976///},
	publisher = {Paladin House, Publishers},
	organization = {Paladin House, Publishers},
	author = {Zelkowitz, Marvin V}
}
@conference {18445,
	title = {Third generation compiler design},
	booktitle = {Proceedings of the 1975 annual conference},
	series = {ACM {\textquoteright}75},
	year = {1975},
	month = {1975///},
	pages = {253 - 258},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Compilers, besides testing for errors in a particular implementation of an algorithm, can be implemented to analyze program structure. This information can be fed back to the programmer in order to improve the structure, reliability and efficiency of the resulting program. This paper surveys several techniques that are currently implementable in a compiler, describes several new techniques that can be applied to programs, and briefly describes one such implementation of many of these ideas.},
	doi = {10.1145/800181.810332},
	url = {http://doi.acm.org/10.1145/800181.810332},
	author = {Zelkowitz, Marvin V}
}
@article {18398,
	title = {Interactive PL/1},
	journal = {SIGPLAN Not.},
	volume = {9},
	year = {1974},
	month = {1974/09//},
	pages = {29 - 32},
	abstract = {An investigation of the PL/1 language in an interactive environment has lead to the discovery of several deficiencies in the language when used as a pedagogical tool. How these deficiencies were eliminated (or avoided) in one particular implementation is discussed.},
	isbn = {0362-1340},
	doi = {10.1145/953214.953218},
	url = {http://doi.acm.org/10.1145/953214.953218},
	author = {Zelkowitz, Marvin V}
}
@article {18399,
	title = {It is not time to define "structured programming"},
	journal = {SIGOPS Oper. Syst. Rev.},
	volume = {8},
	year = {1974},
	month = {1974/04//},
	pages = {7 - 8},
	isbn = {0163-5980},
	doi = {10.1145/775271.775272},
	url = {http://doi.acm.org/10.1145/775271.775272},
	author = {Zelkowitz, Marvin V}
}
@article {18423,
	title = {Reversible execution},
	journal = {Commun. ACM},
	volume = {16},
	year = {1973},
	month = {1973/09//},
	pages = {566{\textendash} - 566{\textendash}},
	abstract = {The ability to backtrack, or retrace, the execution of a computer program has gained wider acceptance recently as a desired feature within a programming language. This is particularly useful in two different applications: (1) In debugging systems where the trace output is saved and can be interrogated under programmer control [1, 3]; (2) In artificial intelligence applications where one is trying to prove a certain result. It is frequently necessary to backup the proof and try some alternative path [2].},
	keywords = {backtracking, Debugging, PL/I, reversible execution},
	isbn = {0001-0782},
	doi = {10.1145/362342.362360},
	url = {http://doi.acm.org/10.1145/362342.362360},
	author = {Zelkowitz, Marvin V}
}
