@article {19699, title = {Combining preference and absolute judgements in a crowd-sourced setting}, journal = {ics.uci.edu}, year = {Submitted}, abstract = {Abstract This paper addresses the problem of obtaining gold-standard labels of objects based on subjective judgements provided by humans. Assuming each object can be associated with an underlying score, the objective of this work is to predict the underlying ...}, url = {https://www.ics.uci.edu/~qliu1/MLcrowd_ICML_workshop/Papers/ActivePaper5.pdf}, author = {Ye, P and EDU, UMD and David Doermann} } @article {20289, title = {Environmental and hydroclimatic factors influencing Vibrio populations in the estuarine zone of the Bengal delta}, journal = {Environmental Monitoring and Assessment}, year = {2018}, month = {Jan-10-2018}, abstract = {The objective of this study was to determine environmental parameters driving Vibrio populations in the estuarine zone of the Bengal delta. Spatio-temporal data were collected at river estuary, mangrove, beach, pond, and canal sites. Effects of salinity, tidal amplitude, and a cyclone and tsunami were included in the study. Vibrio population shifts were found to be correlated with tide-driven salinity and suspended particulate matter (SPM). Increased abundance of Vibrio spp. in surface water was observed after a cyclone, attributed to re-suspension of benthic particulate organic carbon (POC), and increased availability of chitin and dissolved organic carbon (DOC). Approximately a two log10 increase in the (p < 0.05) number of Vibrio spp. was observed in < 20 μm particulates, compared with microphytoplankton (20{\textendash}60 μm) and zooplankton > 60 μm fractions. Benthic and suspended sediment comprised a major reservoir of Vibrio spp. Results of microcosm experiments showed enhanced growth of vibrios was related to concentration of organic matter in SPM. It is concluded that SPM, POC, chitin, and salinity significantly influence abundance and distribution of vibrios in the Bengal delta estuarine zone. Keywords Vibrio Salinity Cyclone Tide Chitin Sediment dynamics }, issn = {0167-6369}, doi = {10.1007/s10661-018-6925-7}, url = {https://link.springer.com/article/10.1007\%2Fs10661-018-6925-7}, author = {Neogi, Sucharit and Rubin, Lara and Alam, Munirul and Harder, Jens and Yamasaki, Shinji and Rita R Colwell} } @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 {20361, title = {Microbial Community Profiling of Human Saliva Using Shotgun Metagenomic Sequencing}, journal = {PLoS ONE}, year = {2014}, month = {Aug-05-2015}, pages = {e97699}, abstract = {Human saliva is clinically informative of both oral and general health. Since next generation shotgun sequencing (NGS) is now widely used to identify and quantify bacteria, we investigated the bacterial flora of saliva microbiomes of two healthy volunteers and five datasets from the Human Microbiome Project, along with a control dataset containing short NGS reads from bacterial species representative of the bacterial flora of human saliva. GENIUS, a system designed to identify and quantify bacterial species using unassembled short NGS reads was used to identify the bacterial species comprising the microbiomes of the saliva samples and datasets. Results, achieved within minutes and at greater than 90\% accuracy, showed more than 175 bacterial species comprised the bacterial flora of human saliva, including bacteria known to be commensal human flora but also Haemophilus influenzae, Neisseria meningitidis, Streptococcus pneumoniae, and Gamma proteobacteria. Basic Local Alignment Search Tool (BLASTn) analysis in parallel, reported ca. five times more species than those actually comprising the in silico sample. Both GENIUS and BLAST analyses of saliva samples identified major genera comprising the bacterial flora of saliva, but GENIUS provided a more precise description of species composition, identifying to strain in most cases and delivered results at least 10,000 times faster. Therefore, GENIUS offers a facile and accurate system for identification and quantification of bacterial species and/or strains in metagenomic samples.}, doi = {10.1371/journal.pone.0097699}, url = {https://dx.plos.org/10.1371/journal.pone.0097699}, author = {Hasan, Nur A. and Young, Brian A. and Minard-Smith, Angela T. and Saeed, Kelly and Li, Huai and Heizer, Esley M. and McMillan, Nancy J. and Isom, Richard and Abdullah, Abdul Shakur and Bornman, Daniel M. and Faith, Seth A. and Choi, Seon Young and Dickens, Michael L. and Cebula, Thomas A. and Rita R Colwell}, editor = {Ahmed, Niyaz} } @article {19685, title = {Binary to Bushy: Bayesian Hierarchical Clustering with the Beta Coalescent}, year = {2013}, month = {2013/00/01}, pages = {1079 - 1087}, abstract = {Abstract Discovering hierarchical regularities in data is a key problem in interacting with large datasets, modeling cognition, and encoding knowledge. A previous Bayesian solution-- -Kingman{\textquoteright}s coalescent---provides a convenient probabilistic model for data represented ...}, url = {http://papers.nips.cc/paper/5161-binary-to-bushy-bayesian-hierarchical-clustering-with-the-beta-coalescent}, author = {Hu, Yuening and Jordan Boyd-Graber and Daume III, Hal and Ying, Z Irene} } @article {19698, title = {A Dataset for Quality Assessment of Camera Captured Document Images}, year = {2013}, month = {0002/00/03}, abstract = {Abstract{\textemdash}With the proliferation of cameras on mobile devices there is an increased desire to image document pages as an alternative to scanning. However, the quality of captured document images is often lower than its scanned equivalent due to hardware limitations ...}, url = {http://lampsrv02.umiacs.umd.edu/pubs/Papers/kumar-data-13/kumar-data-13.pdf}, author = {Kumar, J and Ye, P and David Doermann} } @conference {19311, title = {Document Image Quality Assessment: A Brief Survey}, booktitle = {International Conference on Document Analysis and Recognition (ICDAR)}, year = {2013}, author = {Ye,Peng and David Doermann} } @conference {19308, title = {Real-time No-Reference Image Quality Assessment based on Filter Learning}, booktitle = {International Conference on Computer Vision and Pattern Recognition (CVPR)}, year = {2013}, author = {Ye,Peng and Kumar,Jayant and Kang,Le and David Doermann} } @article {19697, title = {Scene Text Detection via Integrated Discrimination of Component Appearance and Consensus}, year = {2013}, month = {0002/00/03}, abstract = {Abstract{\textemdash}In this paper, we propose an approach to scene text detection that leverages both the appearance and consensus of connected components. Component appearance is modeled with an SVM based dictionary classifier and the component consensus is ...}, url = {http://lampsrv02.umiacs.umd.edu/pubs/Papers/qixiangye-13/qixiangye-13.pdf}, author = {Ye, Q and David Doermann} } @inbook {19613, title = {Streaming Authenticated Data Structures}, booktitle = {Advances in Cryptology {\textendash} EUROCRYPT 2013}, series = {Lecture Notes in Computer Science}, year = {2013}, month = {2013/01/01/}, pages = {353 - 370}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We consider the problem of streaming verifiable computation, where both a verifier and a prover observe a stream of n elements x 1,x 2,{\textellipsis},x n and the verifier can later delegate some computation over the stream to the prover. The prover must return the output of the computation, along with a cryptographic proof to be used for verifying the correctness of the output. Due to the nature of the streaming setting, the verifier can only keep small local state (e.g., logarithmic) which must be updatable in a streaming manner and with no interaction with the prover. Such constraints make the problem particularly challenging and rule out applying existing verifiable computation schemes. We propose streaming authenticated data structures, a model that enables efficient verification of data structure queries on a stream. Compared to previous work, we achieve an exponential improvement in the prover{\textquoteright}s running time: While previous solutions have linear prover complexity (in the size of the stream), even for queries executing in sublinear time (e.g., set membership), we propose a scheme with O(logM logn)O(\log M\ log n) prover complexity, where n is the size of the stream and M is the size of the universe of elements. Our schemes support a series of expressive queries, such as (non-)membership, successor, range search and frequency queries, over an ordered universe and even in higher dimensions. The central idea of our construction is a new authentication tree, called generalized hash tree. We instantiate our generalized hash tree with a hash function based on lattices assumptions, showing that it enjoys suitable algebraic properties that traditional Merkle trees lack. We exploit such properties to achieve our results.}, keywords = {Algorithm Analysis and Problem Complexity, Data Encryption, Discrete Mathematics in Computer Science, Systems and Data Security}, isbn = {978-3-642-38347-2, 978-3-642-38348-9}, url = {http://link.springer.com/chapter/10.1007/978-3-642-38348-9_22}, author = {Charalampos Papamanthou and Shi, Elaine and Tamassia, Roberto and Yi, Ke}, editor = {Johansson, Thomas and Nguyen, Phong Q.} } @article {19694, title = {Structural similarity for document image classification and retrieval}, journal = {Pattern Recognition Letters}, year = {2013}, month = {2013/00/01}, abstract = {Abstract This paper presents a novel approach to defining document image structural similarity for the applications of classification and retrieval. We first build a codebook of SURF descriptors extracted from a set of representative training images. We then encode ...}, doi = {10.1016/j.patrec.2013.10.030}, url = {http://linkinghub.elsevier.com/retrieve/pii/S0167865513004224}, author = {Kumar, Jayant and Ye, Peng and David Doermann} } @inbook {19641, title = {On the Centrality of Off-Line E-Cash to Concrete Partial Information Games}, booktitle = {Security and Cryptography for Networks}, series = {Lecture Notes in Computer Science}, year = {2012}, month = {2012/01/01/}, pages = {264 - 280}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Cryptography has developed numerous protocols for solving {\textquotedblleft}partial information games{\textquotedblright} that are seemingly paradoxical. Some protocols are generic (e.g., secure multi-party computation) and others, due to the importance of the scenario they represent, are designed to solve a concrete problem directly. Designing efficient and secure protocols for (off-line) e-cash, e-voting, and e-auction are some of the most heavily researched concrete problems, representing various settings where privacy and correctness of the procedure is highly important. In this work, we initiate the exploration of the relationships among e-cash, e-voting and e-auction in the universal composability (UC) framework, by considering general variants of the three problems. In particular, we first define ideal functionalities for e-cash, e-voting, and e-auction, and then give a construction of a protocol that UC-realizes the e-voting (resp., e-auction) functionality in the e-cash hybrid model. This (black-box) reducibility demonstrates the centrality of off-line e-cash and implies that designing a solution to e-cash may bear fruits in other areas. Constructing a solution to one protocol problem based on a second protocol problem has been traditional in cryptography, but typically has concentrated on building complex protocols on simple primitives (e.g., secure multi-party computation from Oblivious Transfer, signature from one-way functions, etc.). The novelty here is reducibility among mature protocols and using the ideal functionality as a design tool in realizing other ideal functionalities. We suggest this new approach, and we only consider the very basic general properties from the various primitives to demonstrate its viability. Namely, we only consider the basic coin e-cash model, the e-voting that is correct and private and relies on trusted registration, and e-auction relying on a trusted auctioneer. Naturally, relationships among protocols with further properties (i.e., extended functionalities), using the approach advocated herein, are left as open questions.}, keywords = {Computer Appl. in Administrative Data Processing, Computer Communication Networks, Data Encryption, Management of Computing and Information Systems, Systems and Data Security}, isbn = {978-3-642-32927-2, 978-3-642-32928-9}, url = {http://link.springer.com/chapter/10.1007/978-3-642-32928-9_15}, author = {Choi, Seung Geol and Dana Dachman-Soled and Yung, Moti}, editor = {Visconti, Ivan and Prisco, Roberto De} } @conference {18334, title = {Co-designing an e-health tutorial for older adults}, booktitle = {Proceedings of the 2012 iConference}, series = {iConference {\textquoteright}12}, year = {2012}, month = {2012///}, pages = {240 - 247}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Older adults{\textquoteright} ability to access and use electronic health information is generally low, requiring innovative approaches for improvement. An integrated e-tutorial overlays instructions onto Websites. The literature suggests integrated e-tutorials are more effective than paper or video-based tutorials for younger people, but little is known about their effectiveness for older adults. This study explores the applicability of an integrated e-health tutorial for older adults. An integrated e-tutorial, the Online Tutorial Overlay Presenter (OnTOP), added an instructional overlay to the NIHSeniorHealth.gov Website. Overlay features were examined in seven participatory design sessions with seven older adults. Participatory design techniques were used to elicit participants{\textquoteright} preferences for tutorial features. Three themes emerged: 1) using contextual cues; 2) tailoring to the learner{\textquoteright}s literacy level; and 3) enhancing interfaces with multimedia cues. These findings improved the design features of OnTOP. They also generated empirical evidence about the effects of multimedia learning among older adults.}, keywords = {e-health literacy, health information seeking, integrated e-tutorial, participatory design}, isbn = {978-1-4503-0782-6}, doi = {10.1145/2132176.2132207}, url = {http://doi.acm.org/10.1145/2132176.2132207}, author = {Xie,Bo and Tom Yeh and Walsh,Greg and Watkins,Ivan and Huang,Man} } @article {19126, title = {Exploiting sparseness in de novo genome assembly}, journal = {BMC bioinformatics}, volume = {13}, year = {2012}, month = {2012}, abstract = {The very large memory requirements for the construction of assembly graphs for de novo genome assembly limit current algorithms to super-computing environments.In this paper, we demonstrate that constructing a sparse assembly graph which stores only a small fraction of the observed k-mers as nodes and the links between these nodes allows the de novo assembly of even moderately-sized genomes (~500 M) on a typical laptop computer. We implement this sparse graph concept in a proof-of-principle software package, SparseAssembler, utilizing a new sparse k-mer graph structure evolved from the de Bruijn graph. We test our SparseAssembler with both simulated and real data, achieving ~90\% memory savings and retaining high assembly accuracy, without sacrificing speed in comparison to existing de novo assemblers. }, author = {Ye, C. and Ma, Z.S. and Cannon, C.H. and Pop, Mihai and Yu, D.W.} } @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 {19718, title = {Genomic insights to SAR86, an abundant and uncultivated marine bacterial lineage.}, journal = {ISME J}, volume = {6}, year = {2012}, month = {2012 Jun}, pages = {1186-99}, abstract = {

Bacteria in the 16S rRNA clade SAR86 are among the most abundant uncultivated constituents of microbial assemblages in the surface ocean for which little genomic information is currently available. Bioinformatic techniques were used to assemble two nearly complete genomes from marine metagenomes and single-cell sequencing provided two more partial genomes. Recruitment of metagenomic data shows that these SAR86 genomes substantially increase our knowledge of non-photosynthetic bacteria in the surface ocean. Phylogenomic analyses establish SAR86 as a basal and divergent lineage of γ-proteobacteria, and the individual genomes display a temperature-dependent distribution. Modestly sized at 1.25-1.7 Mbp, the SAR86 genomes lack several pathways for amino-acid and vitamin synthesis as well as sulfate reduction, trends commonly observed in other abundant marine microbes. SAR86 appears to be an aerobic chemoheterotroph with the potential for proteorhodopsin-based ATP generation, though the apparent lack of a retinal biosynthesis pathway may require it to scavenge exogenously-derived pigments to utilize proteorhodopsin. The genomes contain an expanded capacity for the degradation of lipids and carbohydrates acquired using a wealth of tonB-dependent outer membrane receptors. Like the abundant planktonic marine bacterial clade SAR11, SAR86 exhibits metabolic streamlining, but also a distinct carbon compound specialization, possibly avoiding competition.

}, keywords = {Computational Biology, Gammaproteobacteria, Genome, Bacterial, Genomic Library, metagenomics, Oceans and Seas, Phylogeny, plankton, Rhodopsin, RNA, Ribosomal, 16S, Seawater}, issn = {1751-7370}, doi = {10.1038/ismej.2011.189}, author = {Dupont, Chris L and Rusch, Douglas B and Yooseph, Shibu and Lombardo, Mary-Jane and Richter, R Alexander and Valas, Ruben and Novotny, Mark and Yee-Greenbaum, Joyclyn and Jeremy D Selengut and Haft, Dan H and Halpern, Aaron L and Lasken, Roger S and Nealson, Kenneth and Friedman, Robert and Venter, J Craig} } @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} } @article {19721, title = {InterPro in 2011: new developments in the family and domain prediction database.}, journal = {Nucleic Acids Res}, volume = {40}, year = {2012}, month = {2012 Jan}, pages = {D306-12}, abstract = {

InterPro (http://www.ebi.ac.uk/interpro/) is a database that integrates diverse information about protein families, domains and functional sites, and makes it freely available to the public via Web-based interfaces and services. Central to the database are diagnostic models, known as signatures, against which protein sequences can be searched to determine their potential function. InterPro has utility in the large-scale analysis of whole genomes and meta-genomes, as well as in characterizing individual protein sequences. Herein we give an overview of new developments in the database and its associated software since 2009, including updates to database content, curation processes and Web and programmatic interfaces.

}, keywords = {Databases, Protein, Protein Structure, Tertiary, Proteins, Sequence Analysis, Protein, software, Terminology as Topic, User-Computer Interface}, issn = {1362-4962}, doi = {10.1093/nar/gkr948}, author = {Hunter, Sarah and Jones, Philip and Mitchell, Alex and Apweiler, Rolf and Attwood, Teresa K and Bateman, Alex and Bernard, Thomas and Binns, David and Bork, Peer and Burge, Sarah and de Castro, Edouard and Coggill, Penny and Corbett, Matthew and Das, Ujjwal and Daugherty, Louise and Duquenne, Lauranne and Finn, Robert D and Fraser, Matthew and Gough, Julian and Haft, Daniel and Hulo, Nicolas and Kahn, Daniel and Kelly, Elizabeth and Letunic, Ivica and Lonsdale, David and Lopez, Rodrigo and Madera, Martin and Maslen, John and McAnulla, Craig and McDowall, Jennifer and McMenamin, Conor and Mi, Huaiyu and Mutowo-Muellenet, Prudence and Mulder, Nicola and Natale, Darren and Orengo, Christine and Pesseat, Sebastien and Punta, Marco and Quinn, Antony F and Rivoire, Catherine and Sangrador-Vegas, Amaia and Jeremy D Selengut and Sigrist, Christian J A and Scheremetjew, Maxim and Tate, John and Thimmajanarthanan, Manjulapramila and Thomas, Paul D and Wu, Cathy H and Yeats, Corin and Yong, Siew-Yit} } @conference {19316, title = {Learning Document Structure for Retrieval and Classification}, booktitle = {International Conference on Pattern Recognition (ICPR 2012)}, year = {2012}, pages = {1558-1561}, abstract = {In this paper, we present a method for the retrieval of document images with chosen layout characteristics. The proposed method is based on statistics of patch codewords over different regions of image. We begin with a set of wanted and a random set of unwanted images representative of a large heterogeneous collection. We then use raw-image patches extracted from the unlabeled images to learn a codebook. To model the spatial relationships between patches, the image is recursively partitioned horizontally and vertically, and a histogram of patch-codewords is computed in each partition. The resulting set of features give a high precision and recall for the retrieval of hand-drawn and machine-print table-documents, and unconstrained mixed form-type documents, when trained using a random forest classifier. We compare our method to the spatial-pyramid method, and show that the proposed approach for learning layout characteristics is competitive for document images.}, author = {Kumar,Jayant and Ye,Peng and David Doermann} } @conference {19313, title = {Learning features for predicting OCR accuracy}, booktitle = {International Conference on Pattern Recognition (ICPR)}, year = {2012}, pages = {3204-3207}, abstract = {In this paper, we present a new method for assessing the quality of degraded document images using unsupervised feature learning. The goal is to build a computational model to automatically predict OCR accuracy of a degraded document image without a reference image. Current approaches for this problem typically rely on hand-crafted features whose design is based on heuristic rules that may not be generalizable. In contrast, we explore an unsupervised feature learning framework to learn effective and efficient features for predicting OCR accuracy. Our experimental results, on a set of historic newspaper images, show that the proposed method outperforms a baseline method which combines features from previous works.}, author = {Ye,Peng and David Doermann} } @conference {19319, title = {Learning Text-line Segmentation using Codebooks and Graph Partitioning}, booktitle = {International Conference on Frontiers in Handwriting Recognition (ICFHR)}, year = {2012}, pages = {63-68}, abstract = {In this paper, we present a codebook based method for handwritten text-line segmentation which uses image patches in the training data to learn a graph-based similarity for clustering. We first construct a codebook of image-patches using K-medoids, and obtain exemplars which encode local evidence. We then obtain the corresponding codewords for all patches extracted from a given image and construct a similarity graph using the learned evidence and partitioned to obtain textlines. Our learning based approach performs well on a field dataset containing degraded and un-constrained handwritten Arabic document images. Results on ICDAR 2009 segmentation contest dataset show that the method is competitive with previous approaches.}, author = {Kang,Le and Kumar,Jayant and Ye,Peng and David Doermann} } @article {13610, title = {No-Reference Image Quality Assessment using Visual Codebooks}, journal = {Image Processing, IEEE Transactions on}, volume = {PP}, year = {2012}, month = {2012///}, pages = {1 - 1}, abstract = {The goal of no-reference objective image quality assessment (NR-IQA) is to develop a computational model that can predict the human perceived quality of distorted images accurately and automatically without any prior knowledge of reference images. Most existing NR-IQA approaches are distortionspecific (DS) and are typically limited to one or two specific types of distortions. In most practical applications, however, information about the distortion type is not really available. In this paper, we propose a general-purpose NR-IQA approach based on visual codebooks. A visual codebook consisting of Gabor filter based local features extracted from local image patches is used to capture complex statistics of a natural image. The codebook encodes statistics by quantizing the feature space and accumulating histograms of patch appearances. This method does not assume any specific types of distortions, however, when evaluating images with a particular type of distortion, it does require examples with the same or similar distortion for training. Experimental results demonstrate that the predicted quality score using our method is consistent with human perceived image quality. The proposed method is comparable to state-ofthe- art general purpose NR-IQA methods and outperforms the full-reference image quality metrics, peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM) on the LIVE image quality assessment database.}, isbn = {1057-7149}, doi = {10.1109/TIP.2012.2190086}, author = {Ye,P. and David Doermann} } @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 {12855, title = {Role of Shrimp Chitin in the Ecology of Toxigenic Vibrio cholerae and Cholera Transmission}, journal = {Frontiers in Microbiology}, volume = {2:260}, year = {2012}, month = {01/2012}, abstract = {Seasonal plankton blooms correlate with occurrence of cholera in Bangladesh, although the mechanism of how dormant Vibrio cholerae, enduring interepidemic period in biofilms and plankton, initiates seasonal cholera is not fully understood. In this study, laboratory microcosms prepared with estuarine Mathbaria water (MW) samples supported active growth of toxigenic V. cholerae O1 up to 7 weeks as opposed to 6 months when microcosms were supplemented with dehydrated shrimp chitin chips (CC) as the single source of nutrient. Bacterial counting and detection of wbe and ctxA genes were done employing culture, direct fluorescent antibody (DFA) assay, and multiplex-polymerase chain reaction methods. In MW microcosm, the aqueous phase became clear as the non-culturable cells settled, whereas the aqueous phase of the MW{\textendash}CC microcosm became turbid from bacterial growth stimulated by chitin. Bacterial chitin degradation and biofilm formation proceeded from an initial steady state to a gradually declining bacterial culturable count. V. cholerae within the microenvironments of chitin and chitin-associated biofilms remained metabolically active even in a high acidic environment without losing either viability or virulence. It is concluded that the abundance of chitin that occurs during blooms plays an important role in the aquatic life cycle of V. cholerae and, ultimately, in the seasonal transmission of cholera.}, isbn = {1664-302X}, doi = {10.3389/fmicb.2011.00260}, author = {Nahar,Shamsun and Sultana,Marzia and Naser,M. Niamul and Nair,Gopinath B. and Watanabe,Haruo and Ohnishi,Makoto and Yamamoto,Shouji and Endtz,Hubert and Cravioto,Alejandro and Sack,R. Bradley and Hasan,Nur A. and Sadique,Abdus and Huq,Anwar and Rita R Colwell and Alam,Munirul} } @conference {19374, title = {Sub-cellular feature detection and automated extraction of collocalized actin and myosin regions}, booktitle = {the 2nd ACM SIGHIT symposiumProceedings of the 2nd ACM SIGHIT symposium on International health informatics - IHI {\textquoteright}12}, year = {2012}, pages = {399}, publisher = {ACM Press}, organization = {ACM Press}, address = {Miami, Florida, USANew York, New York, USA}, isbn = {9781450307819}, doi = {10.1145/211036310.1145/2110363.2110409}, author = {Martineau, Justin and Mokashi,Ronil and Chapman, David and Grasso, Michael and Brady,Mary and Yesha,Yelena and Yesha,Yaacov and Cardone, Antonio and Dima, Alden} } @conference {13684, title = {Unsupervised Feature Learning Framework for No-reference Image Quality Assessment}, booktitle = {CVPR}, year = {2012}, month = {2012///}, abstract = {In this paper, we present an efficient general-purpose objective no-reference (NR) image quality assessment (IQA) framework based on unsupervised feature learning. The goal is to build a computational model to automatically predict human perceived image quality without a reference image and without knowing the distortion present in the image. Previous approaches for this problem typically rely on hand-crafted features which are carefully designed based on prior knowledge. In contrast, we use raw-image-patches extracted from a set of unlabeled images to learn a dictionary in an unsupervised manner. We use soft-assignment coding with max pooling to obtain effective image representations for quality estimation. The proposed algorithm is very computationally appealing, using raw image patches as local descriptors and using soft-assignment for encoding. Furthermore, unlike previous methods, our unsupervised feature learning strategy enables our method to adapt to different domains. CORNIA (Codebook Representation for No-Reference Image Assessment) was tested on LIVE database and shown to perform statistically better than full-reference quality measure structural similarity index (SSIM) and was shown to be comparable to state-of-the-art general purpose NR-IQA algorithms.}, author = {Ye,Peng and Kumar,Jayant and Kang,Le and David Doermann} } @article {14592, title = {Accelerated evolution of 3{\textquoteright}avian FOXE1 genes, and thyroid and feather specific expression of chicken FoxE1}, journal = {BMC Evolutionary Biology}, volume = {11}, year = {2011}, month = {2011/10/15/}, pages = {302 - 302}, abstract = {The forkhead transcription factor gene E1 (FOXE1) plays an important role in regulation of thyroid development, palate formation and hair morphogenesis in mammals. However, avian FOXE1 genes have not been characterized and as such, codon evolution of FOXE1 orthologs in a broader evolutionary context of mammals and birds is not known.}, isbn = {1471-2148}, doi = {10.1186/1471-2148-11-302}, url = {http://www.biomedcentral.com/1471-2148/11/302}, author = {Yaklichkin,Sergey Yu and Darnell,Diana K and Pier,Maricela V and Antin,Parker B and Hannenhalli, Sridhar} } @conference {14431, title = {Active inference for retrieval in camera networks}, booktitle = {Person-Oriented Vision (POV), 2011 IEEE Workshop on}, year = {2011}, month = {2011/01//}, pages = {13 - 20}, abstract = {We address the problem of searching camera network videos to retrieve frames containing specified individuals. We show the benefit of utilizing a learned probabilistic model that captures dependencies among the cameras. In addition, we develop an active inference framework that can request human input at inference time, directing human attention to the portions of the videos whose correct annotation would provide the biggest performance improvements. Our primary contribution is to show that by mapping video frames in a camera network onto a graphical model, we can apply collective classification and active inference algorithms to significantly increase the performance of the retrieval system, while minimizing the number of human annotations required.}, keywords = {active, annotation;probabilistic, frame;cameras;inference, inference;camera, mechanisms;probability;search, model;human, model;retrieval, network;graphical, problem;video, problems;video, processing;, retrieval;video, signal, system;searching}, doi = {10.1109/POV.2011.5712363}, author = {Daozheng Chen and Bilgic,M. and Getoor, Lise and Jacobs, David W. and Mihalkova,L. and Tom Yeh} } @conference {18330, title = {Active inference for retrieval in camera networks}, booktitle = {Person-Oriented Vision (POV), 2011 IEEE Workshop on}, year = {2011}, month = {2011/01//}, pages = {13 - 20}, publisher = {IEEE}, organization = {IEEE}, abstract = {We address the problem of searching camera network videos to retrieve frames containing specified individuals. We show the benefit of utilizing a learned probabilistic model that captures dependencies among the cameras. In addition, we develop an active inference framework that can request human input at inference time, directing human attention to the portions of the videos whose correct annotation would provide the biggest performance improvements. Our primary contribution is to show that by mapping video frames in a camera network onto a graphical model, we can apply collective classification and active inference algorithms to significantly increase the performance of the retrieval system, while minimizing the number of human annotations required.}, isbn = {978-1-61284-036-9}, doi = {10.1109/POV.2011.5712363}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5712363\&tag=1}, author = {Daozheng Chen and Bilgic,Mustafa and Getoor, Lise and Jacobs, David W. and Mihalkova,Lilyana and Tom Yeh} } @conference {14192, title = {Active scene recognition with vision and language}, booktitle = {2011 IEEE International Conference on Computer Vision (ICCV)}, year = {2011}, month = {2011/11/06/13}, pages = {810 - 817}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper presents a novel approach to utilizing high level knowledge for the problem of scene recognition in an active vision framework, which we call active scene recognition. In traditional approaches, high level knowledge is used in the post-processing to combine the outputs of the object detectors to achieve better classification performance. In contrast, the proposed approach employs high level knowledge actively by implementing an interaction between a reasoning module and a sensory module (Figure 1). Following this paradigm, we implemented an active scene recognizer and evaluated it with a dataset of 20 scenes and 100+ objects. We also extended it to the analysis of dynamic scenes for activity recognition with attributes. Experiments demonstrate the effectiveness of the active paradigm in introducing attention and additional constraints into the sensing process.}, keywords = {accuracy, active scene recognition, classification performance, Cognition, Computer vision, Detectors, Equations, high level knowledge utilization, HUMANS, image classification, inference mechanisms, object detectors, Object recognition, reasoning module, sensing process, sensory module, support vector machines, Training}, isbn = {978-1-4577-1101-5}, doi = {10.1109/ICCV.2011.6126320}, author = {Yu,Xiaodong and Ferm{\"u}ller, Cornelia and Ching Lik Teo and Yezhou Yang and Aloimonos, J.} } @conference {18333, title = {Associating the visual representation of user interfaces with their internal structures and metadata}, booktitle = {Proceedings of the 24th annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {245 - 256}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Pixel-based methods are emerging as a new and promising way to develop new interaction techniques on top of existing user interfaces. However, in order to maintain platform independence, other available low-level information about GUI widgets, such as accessibility metadata, was neglected intentionally. In this paper, we present a hybrid framework, PAX, which associates the visual representation of user interfaces (i.e. the pixels) and their internal hierarchical metadata (i.e. the content, role, and value). We identify challenges to building such a framework. We also develop and evaluate two new algorithms for detecting text at arbitrary places on the screen, and for segmenting a text image into individual word blobs. Finally, we validate our framework in implementations of three applications. We enhance an existing pixel-based system, Sikuli Script, and preserve the readability of its script code at the same time. Further, we create two novel applications, Screen Search and Screen Copy, to demonstrate how PAX can be applied to development of desktop-level interactive systems.}, keywords = {accessibility api, Graphical user interfaces, Pixel, text detection, text segmentation}, isbn = {978-1-4503-0716-1}, doi = {10.1145/2047196.2047228}, url = {http://doi.acm.org/10.1145/2047196.2047228}, author = {Chang,Tsung-Hsiang and Tom Yeh and Miller,Rob} } @conference {13069, title = {AVSS 2011 demo session: A large-scale benchmark dataset for event recognition in surveillance video}, booktitle = {Advanced Video and Signal-Based Surveillance (AVSS), 2011 8th IEEE International Conference on}, year = {2011}, month = {2011/09/30/2}, pages = {527 - 528}, abstract = {We introduce to the surveillance community the VIRAT Video Dataset[1], which is a new large-scale surveillance video dataset designed to assess the performance of event recognition algorithms in realistic scenes1.}, doi = {10.1109/AVSS.2011.6027400}, author = {Oh,Sangmin and Hoogs,Anthony and Perera,Amitha and Cuntoor,Naresh and Chen,Chia-Chih and Lee,Jong Taek and Mukherjee,Saurajit and Aggarwal, JK and Lee,Hyungtae and Davis, Larry S. and Swears,Eran and Wang,Xiaoyang and Ji,Qiang and Reddy,Kishore and Shah,Mubarak and Vondrick,Carl and Pirsiavash,Hamed and Ramanan,Deva and Yuen,Jenny and Torralba,Antonio and Song,Bi and Fong,Anesco and Roy-Chowdhury,Amit and Desai,Mita} } @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 {18328, title = {A case for query by image and text content: searching computer help using screenshots and keywords}, booktitle = {Proceedings of the 20th international conference on World wide web}, series = {WWW {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {775 - 784}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The multimedia information retrieval community has dedicated extensive research effort to the problem of content-based image retrieval (CBIR). However, these systems find their main limitation in the difficulty of creating pictorial queries. As a result, few systems offer the option of querying by visual examples, and rely on automatic concept detection and tagging techniques to provide support for searching visual content using textual queries.This paper proposes and studies a practical multimodal web search scenario, where CBIR fits intuitively to improve the retrieval of rich information queries. Many online articles contain useful know-how knowledge about computer applications. These articles tend to be richly illustrated by screenshots. We present a system to search for such software know-how articles that leverages the visual correspondences between screenshots. Users can naturally create pictorial queries simply by taking a screenshot of the application to retrieve a list of articles containing a matching screenshot. We build a prototype comprising 150k articles that are classified into walkthrough, book, gallery, and general categories, and provide a comprehensive evaluation of this system, focusing on technical (accuracy of CBIR techniques) and usability (perceived system usefulness) aspects. We also consider the study of added value features of such a visual-supported search, including the ability to perform cross-lingual queries. We find that the system is able to retrieve matching screenshots for a wide variety of programs, across language boundaries, and provide subjectively more useful results than keyword-based web and image search engines. }, keywords = {content-based image retrieval, multimodal search, online help}, isbn = {978-1-4503-0632-4}, doi = {10.1145/1963405.1963513}, url = {http://doi.acm.org/10.1145/1963405.1963513}, author = {Tom Yeh and White,Brandyn and San Pedro,Jose and Katz,Boriz and Davis, Larry S.} } @conference {13080, title = {A case for query by image and text content: searching computer help using screenshots and keywords}, booktitle = {Proceedings of the 20th international conference on World wide web}, series = {WWW {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {775 - 784}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The multimedia information retrieval community has dedicated extensive research effort to the problem of content-based image retrieval (CBIR). However, these systems find their main limitation in the difficulty of creating pictorial queries. As a result, few systems offer the option of querying by visual examples, and rely on automatic concept detection and tagging techniques to provide support for searching visual content using textual queries. This paper proposes and studies a practical multimodal web search scenario, where CBIR fits intuitively to improve the retrieval of rich information queries. Many online articles contain useful know-how knowledge about computer applications. These articles tend to be richly illustrated by screenshots. We present a system to search for such software know-how articles that leverages the visual correspondences between screenshots. Users can naturally create pictorial queries simply by taking a screenshot of the application to retrieve a list of articles containing a matching screenshot. We build a prototype comprising 150k articles that are classified into walkthrough, book, gallery, and general categories, and provide a comprehensive evaluation of this system, focusing on technical (accuracy of CBIR techniques) and usability (perceived system usefulness) aspects. We also consider the study of added value features of such a visual-supported search, including the ability to perform cross-lingual queries. We find that the system is able to retrieve matching screenshots for a wide variety of programs, across language boundaries, and provide subjectively more useful results than keyword-based web and image search engines.}, keywords = {content-based image retrieval, multimodal search, online help}, isbn = {978-1-4503-0632-4}, doi = {10.1145/1963405.1963513}, url = {http://doi.acm.org/10.1145/1963405.1963513}, author = {Tom Yeh and White,Brandyn and San Pedro,Jose and Katz,Boriz and Davis, Larry S.} } @conference {14183, title = {A Corpus-Guided Framework for Robotic Visual Perception}, booktitle = {Workshops at the Twenty-Fifth AAAI Conference on Artificial Intelligence}, year = {2011}, month = {2011///}, author = {Teo,C.L. and Yang, Y. and Daum{\'e}, Hal and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {18335, title = {Co-designing contextual tutorials for older adults on searching health information on the internet}, journal = {Proceedings of the American Society for Information Science and Technology}, volume = {48}, year = {2011}, month = {2011/01/01/}, pages = {1 - 4}, abstract = {Evidence in the literature suggests an integrated e-tutorial is more effective than a paper- or video-based tutorial among younger people. Yet, relatively little is known about the effectiveness of an integrated e-tutorial on the older population. This study explored the applicability of an integrated e-tutorial to an older population, focusing on the content area of e-health literacy. A specific integrated e- tutorial, the Online Tutorial Overlay Presenter (OnTOP), was used to add an overlay to the NIHSeniorHealth.gov Website. Features of the overlay were examined thoroughly in seven 2-hour-long participatory design sessions with ten older adults. Several participatory design techniques were used to elicit participants{\textquoteright} preferences for design features of the OnTOP tutorial. These techniques included drawing on the board, voice recording and integration, and peer instruction. Three major themes emerged: 1) using contextual cues to facilitate learning; 2) tailoring to accommodate the learner{\textquoteright}s literacy level; and 3) enhancing existing interfaces with multimedia cues. These findings improved the design of OnTOP. They also contribute to the multimedia learning literature, generating empirical evidence about the effects of multimedia learning among the understudied older adult population.}, isbn = {1550-8390}, doi = {10.1002/meet.2011.14504801160}, url = {http://onlinelibrary.wiley.com/doi/10.1002/meet.2011.14504801160/abstract}, author = {Xie,Bo and Tom Yeh and Walsh,Greg and Watkins,Ivan and Huang,Man} } @conference {13081, title = {Creating contextual help for GUIs using screenshots}, booktitle = {Proceedings of the 24th annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {145 - 154}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Contextual help is effective for learning how to use GUIs by showing instructions and highlights on the actual interface rather than in a separate viewer. However, end-users and third-party tech support typically cannot create contextual help to assist other users because it requires programming skill and source code access. We present a creation tool for contextual help that allows users to apply common computer skills-taking screenshots and writing simple scripts. We perform pixel analysis on screenshots to make this tool applicable to a wide range of applications and platforms without source code access. We evaluated the tool{\textquoteright}s usability with three groups of participants: developers, in-structors, and tech support. We further validated the applicability of our tool with 60 real tasks supported by the tech support of a university campus.}, keywords = {contextual help, help, pixel analysis}, isbn = {978-1-4503-0716-1}, doi = {10.1145/2047196.2047214}, url = {http://doi.acm.org/10.1145/2047196.2047214}, author = {Tom Yeh and Chang,Tsung-Hsiang and Xie,Bo and Walsh,Greg and Watkins,Ivan and Wongsuphasawat,Krist and Huang,Man and Davis, Larry S. and Bederson, Benjamin B.} } @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} } @inbook {14676, title = {Directed Symbolic Execution}, booktitle = {Static AnalysisStatic Analysis}, series = {Lecture Notes in Computer Science}, volume = {6887}, year = {2011}, month = {2011///}, pages = {95 - 111}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In this paper, we study the problem of automatically finding program executions that reach a particular target line. This problem arises in many debugging scenarios; for example, a developer may want to confirm that a bug reported by a static analysis tool on a particular line is a true positive. We propose two new directed symbolic execution strategies that aim to solve this problem: shortest-distance symbolic execution (SDSE) uses a distance metric in an interprocedural control flow graph to guide symbolic execution toward a particular target; and call-chain-backward symbolic execution (CCBSE) iteratively runs forward symbolic execution, starting in the function containing the target line, and then jumping backward up the call chain until it finds a feasible path from the start of the program. We also propose a hybrid strategy, Mix-CCBSE, which alternates CCBSE with another (forward) search strategy. We compare these three with several existing strategies from the literature on a suite of six GNU Coreutils programs. We find that SDSE performs extremely well in many cases but may fail badly. CCBSE also performs quite well, but imposes additional overhead that sometimes makes it slower than SDSE. Considering all our benchmarks together, Mix-CCBSE performed best on average, combining to good effect the features of its constituent components.}, isbn = {978-3-642-23701-0}, url = {http://dx.doi.org/10.1007/978-3-642-23702-7_11}, author = {Ma,Kin-Keung and Yit Phang,Khoo and Foster, Jeffrey S. and Hicks, Michael W.}, editor = {Yahav,Eran} } @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 {17175, title = {From slacktivism to activism: participatory culture in the age of social media}, booktitle = {Proceedings of the 2011 annual conference extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}11}, year = {2011}, month = {2011///}, pages = {819 - 822}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Social networking sites (e.g. Facebook), microblogging services (e.g. Twitter), and content-sharing sites (e.g. YouTube and Flickr) have introduced the opportunity for wide-scale, online social participation. Visibility of national and international priorities such as public health, political unrest, disaster relief, and climate change has increased, yet we know little about the benefits - and possible costs - of engaging in social activism via social media. These powerful social issues introduce a need for scientific research into technology mediated social participation. What are the actual, tangible benefits of "greening" Twitter profile pictures in support of the Iranian elections? Does cartooning a Facebook profile picture really raise awareness of child abuse? Are there unintended negative effects through low-risk, low-cost technology-mediated participation? And, is there a difference - in both outcome and engagement level - between different types of online social activism? This SIG will investigate technology mediated social participation through a critical lens, discussing both the potential positive and negative outcomes of such participation. Approaches to designing for increased participation, evaluating effects of participation, and next steps in scientific research directions will be discussed.}, keywords = {activism, change, design, participation, slacktivism, social media}, isbn = {978-1-4503-0268-5}, doi = {10.1145/1979742.1979543}, url = {http://doi.acm.org/10.1145/1979742.1979543}, author = {Rotman,Dana and Vieweg,Sarah and Yardi,Sarita and Chi,Ed and Preece,Jenny and Shneiderman, Ben and Pirolli,Peter and Glaisyer,Tom} } @conference {13294, title = {GPU algorithms for diamond-based multiresolution terrain processing}, booktitle = {Eurographics Symposium on Parallel Graphics and Visualization}, year = {2011}, month = {2011///}, pages = {10 - 11}, abstract = {We present parallel algorithms for processing, extracting and rendering adaptively sampled regular terraindatasets represented as a multiresolution model defined by a super-square-based diamond hierarchy. This model represents a terrain as a nested triangle mesh generated through a series of longest edge bisections and encoded in an implicit hierarchical structure, which clusters triangles into diamonds and diamonds into super-squares. We decompose the problem into three parallel algorithms for performing: generation of the diamond hierarchy from a regularly distributed terrain dataset, selective refinement on the diamond hierarchy and generation of the corre- sponding crack-free triangle mesh for processing and rendering. We avoid the data transfer bottleneck common to previous approaches by processing all data entirely on the GPU. We demonstrate that this parallel approach can be successfully applied to interactive terrain visualization with a high tessellation quality on commodity GPUs. }, author = {Yal{\c c}{\i}n,M. A. and Weiss,K. and De Floriani, Leila} } @article {15477, title = {GUI Interaction Testing: Incorporating Event Context}, journal = {Software Engineering, IEEE Transactions on}, volume = {37}, year = {2011}, month = {2011/08//july}, pages = {559 - 574}, abstract = {Graphical user interfaces (GUIs), due to their event-driven nature, present an enormous and potentially unbounded way for users to interact with software. During testing, it is important to $\#$x201C;adequately cover $\#$x201D; this interaction space. In this paper, we develop a new family of coverage criteria for GUI testing grounded in combinatorial interaction testing. The key motivation of using combinatorial techniques is that they enable us to incorporate $\#$x201C;context $\#$x201D; into the criteria in terms of event combinations, sequence length, and by including all possible positions for each event. Our new criteria range in both efficiency (measured by the size of the test suite) and effectiveness (the ability of the test suites to detect faults). In a case study on eight applications, we automatically generate test cases and systematically explore the impact of context, as captured by our new criteria. Our study shows that by increasing the event combinations tested and by controlling the relative positions of events defined by the new criteria, we can detect a large number of faults that were undetectable by earlier techniques.}, keywords = {automatic test case generation, automatic test pattern generation, combinatorial interaction testing, event driven nature, graphical user interface, Graphical user interfaces, GUI interaction testing, program testing}, isbn = {0098-5589}, doi = {10.1109/TSE.2010.50}, author = {Xun Yuan and Cohen,M. B and Memon, Atif M.} } @article {15177, title = {Impossibility of blind signatures from one-way permutations}, journal = {Theory of Cryptography}, year = {2011}, month = {2011///}, pages = {615 - 629}, abstract = {A seminal result in cryptography is that signature schemes can be constructed (in a black-box fashion) from any one-way function. The minimal assumptions needed to construct blind signature schemes, however, have remained unclear. Here, we rule out black-box constructions of blind signature schemes from one-way functions. In fact, we rule out constructions even from a random permutation oracle, and our results hold even for blind signature schemes for 1-bit messages that achieve security only against honest-but-curious behavior.}, doi = {10.1007/978-3-642-19571-6_37}, author = {Katz, Jonathan and Schr{\"o}der,D. and Yerukhimovich,A.} } @conference {13074, title = {A large-scale benchmark dataset for event recognition in surveillance video}, booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on}, year = {2011}, month = {2011/06//}, pages = {3153 - 3160}, abstract = {We introduce a new large-scale video dataset designed to assess the performance of diverse visual event recognition algorithms with a focus on continuous visual event recognition (CVER) in outdoor areas with wide coverage. Previous datasets for action recognition are unrealistic for real-world surveillance because they consist of short clips showing one action by one individual [15, 8]. Datasets have been developed for movies [11] and sports [12], but, these actions and scene conditions do not apply effectively to surveillance videos. Our dataset consists of many outdoor scenes with actions occurring naturally by non-actors in continuously captured videos of the real world. The dataset includes large numbers of instances for 23 event types distributed throughout 29 hours of video. This data is accompanied by detailed annotations which include both moving object tracks and event examples, which will provide solid basis for large-scale evaluation. Additionally, we propose different types of evaluation modes for visual recognition tasks and evaluation metrics along with our preliminary experimental results. We believe that this dataset will stimulate diverse aspects of computer vision research and help us to advance the CVER tasks in the years ahead.}, keywords = {algorithm;evaluation, CVER, databases;, databases;video, dataset;moving, event, metrics;large-scale, object, recognition, recognition;diverse, recognition;video, scenes;surveillance, surveillance;visual, tasks;computer, tracks;outdoor, video, video;computer, vision;continuous, vision;image, visual}, doi = {10.1109/CVPR.2011.5995586}, author = {Oh,Sangmin and Hoogs, A. and Perera,A. and Cuntoor, N. and Chen,Chia-Chih and Lee,Jong Taek and Mukherjee,S. and Aggarwal, JK and Lee,Hyungtae and Davis, Larry S. and Swears,E. and Wang,Xioyang and Ji,Qiang and Reddy,K. and Shah,M. and Vondrick,C. and Pirsiavash,H. and Ramanan,D. and Yuen,J. and Torralba,A. and Song,Bi and Fong,A. and Roy-Chowdhury, A. and Desai,M.} } @article {15174, title = {Limits of computational differential privacy in the client/server setting}, journal = {Theory of Cryptography}, year = {2011}, month = {2011///}, pages = {417 - 431}, abstract = {Differential privacy is a well established definition guaranteeing that queries to a database do not reveal {\textquotedblleft}too much{\textquotedblright} information about specific individuals who have contributed to the database. The standard definition of differential privacy is information theoretic in nature, but it is natural to consider computational relaxations and to explore what can be achieved with respect to such notions. Mironov et al. (Crypto 2009) and McGregor et al. (FOCS 2010) recently introduced and studied several variants of computational differential privacy, and show that in the two-party setting (where data is split between two parties) these relaxations can offer significant advantages.Left open by prior work was the extent, if any, to which computational differential privacy can help in the usual client/server setting where the entire database resides at the server, and the client poses queries on this data. We show, for queries with output in ℝ n (for constant n) and with respect to a large class of utilities, that any computationally private mechanism can be converted to a statistically private mechanism that is equally efficient and achieves roughly the same utility. }, doi = {10.1007/978-3-642-19571-6_25}, author = {Groce,A. and Katz, Jonathan and Yerukhimovich,A.} } @article {15167, title = {Limits on the power of zero-knowledge proofs in cryptographic constructions}, journal = {Theory of Cryptography}, year = {2011}, month = {2011///}, pages = {559 - 578}, abstract = {For over 20 years, black-box impossibility results have been used to argue the infeasibility of constructing certain cryptographic primitives (e.g., key agreement) from others (e.g., one-way functions). A widely recognized limitation of such impossibility results, however, is that they say nothing about the usefulness of (known) nonblack-box techniques. This is unsatisfying, as we would at least like to rule out constructions using the set of techniques we have at our disposal.With this motivation in mind, we suggest a new framework for black-box constructions that encompasses constructions with a nonblack-box flavor: specifically, those that rely on zero-knowledge proofs relative to some oracle. We show that our framework is powerful enough to capture the Naor-Yung/Sahai paradigm for building a (shielding) CCA-secure public-key encryption scheme from a CPA-secure one, something ruled out by prior black-box separation results. On the other hand, we show that several black-box impossibility results still hold even in a setting that allows for zero-knowledge proofs. }, doi = {10.1007/978-3-642-19571-6_34}, author = {Brakerski,Z. and Katz, Jonathan and Segev,G. and Yerukhimovich,A.} } @conference {13609, title = {No-reference image quality assessment based on visual codebook}, booktitle = {Image Processing (ICIP), 2011 18th IEEE International Conference on}, year = {2011}, month = {2011/09//}, pages = {3089 - 3092}, abstract = {In this paper, we propose a new learning based No-Reference Image Quality Assessment (NR-IQA) algorithm, which uses a visual codebook consisting of robust appearance descriptors extracted from local image patches to capture complex statistics of natural image for quality estimation. We use Gabor filter based local features as appearance descriptors and the codebook method encodes the statistics of natural image classes by vector quantizing the feature space and accumulating histograms of patch appearances based on this coding. This method does not assume any specific types of distortion and experimental results on the LIVE image quality assessment database show that this method provides consistent and reliable performance in quality estimation that exceeds other state-of-the-art NR-IQA approaches and is competitive with the full reference measure PSNR.}, keywords = {assessment;quality, codebook;Gabor, descriptors;complex, estimation;visual, extraction;image, filter;appearance, filters;feature, gabor, image, image;no-reference, patches;natural, QUALITY, statistics;local, texture;}, doi = {10.1109/ICIP.2011.6116318}, author = {Ye,Peng and David Doermann} } @article {18349, title = {Photo-based mobile deixis system and related techniques}, volume = {10/762,941}, year = {2011}, month = {2011/01/18/}, abstract = {A mobile deixis device includes a camera to capture an image and a wireless handheld device, coupled to the camera and to a wireless network, to communicate the image with existing databases to find similar images. The mobile deixis device further includes a processor, coupled to the device, to process found database records related to similar images and a display to view found database records that include web pages including images. With such an arrangement, users can specify a location of interest by simply pointing a camera-equipped cellular phone at the object of interest and by searching an image database or relevant web resources, users can quickly identify good matches from several close ones to find an object of interest.}, url = {http://www.google.com/patents?id=jeXwAAAAEBAJ}, author = {Darrell,Trevor J and Tom Yeh and Tollmar,Konrad}, editor = {Massachusetts Institute of Technology} } @inbook {19643, title = {Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications}, booktitle = {Applied Cryptography and Network Security}, series = {Lecture Notes in Computer Science}, year = {2011}, month = {2011/01/01/}, pages = {130 - 146}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {We present a robust secure methodology for computing functions that are represented as multivariate polynomials where parties hold different variables as private inputs. Our generic efficient protocols are fully black-box and employ threshold additive homomorphic encryption; they do not assume honest majority, yet are robust in detecting any misbehavior. We achieve solutions that take advantage of the algebraic structure of the polynomials, and are polynomial-time in all parameters (security parameter, polynomial size, polynomial degree, number of parties). We further exploit a {\textquotedblleft}round table{\textquotedblright} communication paradigm to reduce the complexity in the number of parties. A large collection of problems are naturally and efficiently represented as multivariate polynomials over a field or a ring: problems from linear algebra, statistics, logic, as well as operations on sets represented as polynomials. In particular, we present a new efficient solution to the multi-party set intersection problem, and a solution to a multi-party variant of the polynomial reconstruction problem.}, keywords = {additive homomorphic encryption, Algorithm Analysis and Problem Complexity, Computer Communication Networks, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, multiparty set intersection, multivariate polynomial evaluation, secret sharing, secure multiparty computation, Systems and Data Security, threshold cryptosystems}, isbn = {978-3-642-21553-7, 978-3-642-21554-4}, url = {http://link.springer.com/chapter/10.1007/978-3-642-21554-4_8}, author = {Dana Dachman-Soled and Malkin, Tal and Raykova, Mariana and Yung, Moti}, editor = {Lopez, Javier and Tsudik, Gene} } @inbook {17378, title = {Speeding Up Network Layout and Centrality Measures for Social Computing Goals}, booktitle = {Social Computing, Behavioral-Cultural Modeling and PredictionSocial Computing, Behavioral-Cultural Modeling and Prediction}, series = {Lecture Notes in Computer Science}, volume = {6589}, year = {2011}, month = {2011///}, pages = {244 - 251}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper presents strategies for speeding up calculation of graph metrics and layout by exploiting the parallel architecture of modern day Graphics Processing Units (GPU), specifically Compute Unified Device Architecture ( CUDA ) by Nvidia . Graph centrality metrics like Eigenvector , Betweenness , Page Rank and layout algorithms like Fruchterman - Rheingold are essential components of Social Network Analysis ( SNA ). With the growth in adoption of SNA in different domains and increasing availability of huge networked datasets for analysis, social network analysts require faster tools that are also scalable. Our results, using NodeXL, show up to 802 times speedup for a Fruchterman-Rheingold graph layout and up to 17,972 times speedup for Eigenvector centrality metric calculations on a 240 core CUDA-capable GPU.}, isbn = {978-3-642-19655-3}, url = {http://dx.doi.org/10.1007/978-3-642-19656-0_35}, author = {Sharma,Puneet and Khurana,Udayan and Shneiderman, Ben and Scharrenbroich,Max and Locke,John}, editor = {Salerno,John and Yang,Shanchieh and Nau, Dana S. and Chai,Sun-Ki} } @article {18543, title = {A survey of virtual LAN usage in campus networks}, journal = {Communications Magazine, IEEE}, volume = {49}, year = {2011}, month = {2011/07//}, pages = {98 - 103}, abstract = {VLANs are widely used in today{\textquoteright}s enterprise networks to improve Ethernet scalability and support network policies. However, manuals and textbooks offer very little information about how VLANs are actually used in practice. Through discussions with network administrators and analysis of configuration data, we describe how three university campuses and one academic department use VLANs to achieve a variety of goals. We argue that VLANs are ill-suited to some of these goals (e.g., VLANs are often used to realize access control policies, but constrain the types of policies that can be expressed). Furthermore, the use of VLANs leads to significant complexity in the configuration of network devices.}, keywords = {academic department, campus network, educational computing, Educational institutions, Ethernet scalability, Local area networks, network policy support, university campus, virtual LAN usage, VLAN}, isbn = {0163-6804}, doi = {10.1109/MCOM.2011.5936161}, author = {Yu,Minlan and Rexford,J. and Sun,Xin and Rao,Sanjay and Feamster, Nick} } @inbook {16046, title = {Temporal Visualization of Social Network Dynamics: Prototypes for Nation of Neighbors}, booktitle = {Social Computing, Behavioral-Cultural Modeling and PredictionSocial Computing, Behavioral-Cultural Modeling and Prediction}, series = {Lecture Notes in Computer Science}, volume = {6589}, year = {2011}, month = {2011///}, pages = {309 - 316}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Information visualization is a powerful tool for analyzing the dynamic nature of social communities. Using Nation of Neighbors community network as a testbed, we propose five principles of implementing temporal visualizations for social networks and present two research prototypes: NodeXL and TempoVis. Three different states are defined in order to visualize the temporal changes of social networks. We designed the prototypes to show the benefits of the proposed ideas by letting users interactively explore temporal changes of social networks.}, isbn = {978-3-642-19655-3}, url = {http://dx.doi.org/10.1007/978-3-642-19656-0_43}, author = {Ahn,Jae-wook and Taieb-Maimon,Meirav and Sopan,Awalin and Plaisant, Catherine and Shneiderman, Ben}, editor = {Salerno,John and Yang,Shanchieh and Nau, Dana S. and Chai,Sun-Ki} } @article {15450, title = {Towards incremental component compatibility testing}, journal = {Proceedings of the 14th international ACM Sigsoft symposium on Component based software engineering, CBSE}, volume = {11}, year = {2011}, month = {2011///}, pages = {119 - 128}, abstract = {Software components are increasingly assembled from othercomponents. Each component may further depend on oth- ers, and each may have multiple active versions. The to- tal number of configurations{\textemdash}combinations of components and their versions{\textemdash}deployed by end users can be very large. Component developers, therefore, spend considerable time and effort doing compatibility testing {\textendash} determining whether their components can be built correctly for all deployed con- figurations. In previous work we developed Rachet to sup- port large-scale compatibility testing of components. In this paper, we describe and evaluate methods to enable Rachet to perform incremental compatibility testing. We de- scribe algorithms to compute differences in component com- patibilities between current and previous component builds, a formal test adequacy criterion based on covering the differ- ences, and cache-aware configuration sampling and testing methods that attempt to reuse effort from previous testing sessions. We evaluate our approach using the 5-year evo- lution history of a scientific middleware component. Our results show significant performance improvements over Ra- chet{\textquoteright}s previous retest-all approach, making the process of compatibility testing practical for evolving components. }, author = {Yoon,I. and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @article {17487, title = {Visual Exploration across Biomedical Databases}, journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {8}, year = {2011}, month = {2011/04//March}, pages = {536 - 550}, abstract = {Though biomedical research often draws on knowledge from a wide variety of fields, few visualization methods for biomedical data incorporate meaningful cross-database exploration. A new approach is offered for visualizing and exploring a query-based subset of multiple heterogeneous biomedical databases. Databases are modeled as an entity-relation graph containing nodes (database records) and links (relationships between records). Users specify a keyword search string to retrieve an initial set of nodes, and then explore intra- and interdatabase links. Results are visualized with user-defined semantic substrates to take advantage of the rich set of attributes usually present in biomedical data. Comments from domain experts indicate that this visualization method is potentially advantageous for biomedical knowledge exploration.}, keywords = {Bioinformatics, Biomedical computing, biomedical databases, cross-database exploration, Data exploration and discovery, Data visualization, database management systems, Databases, Factual, DNA, graph theory, Information Storage and Retrieval, information visualization., Keyword search, medical computing, natural language processing, Proteins, semantic networks, semantics, sequences, text mining, User-Computer Interface, user-defined semantics, visual databases}, isbn = {1545-5963}, doi = {10.1109/TCBB.2010.1}, author = {Lieberman,M.D. and Taheri, S. and Guo,Huimin and Mirrashed,F. and Yahav,I. and Aris,A. and Shneiderman, Ben} } @conference {14274, title = {Visual Scene Interpretation as a Dialogue between Vision and Language}, booktitle = {Workshops at the Twenty-Fifth AAAI Conference on Artificial Intelligence}, year = {2011}, month = {2011/08/24/}, abstract = {We present a framework for semantic visual scene interpretation in a system with vision and language. In this framework the system consists of two modules, a language module and a vision module that communicate with each other in a form of a dialogue to actively interpret the scene. The language module is responsible for obtaining domain knowledge from linguistic resources and reasoning on the basis of this knowledge and the visual input. It iteratively creates questions that amount to an attention mechanism for the vision module which in turn shifts its focus to selected parts of the scene and applies selective segmentation and feature extraction. As a formalism for optimizing this dialogue we use information theory. We demonstrate the framework on the problem of recognizing a static scene from its objects and show preliminary results for the problem of human activity recognition from video. Experiments demonstrate the effectiveness of the active paradigm in introducing attention and additional constraints into the sensing process.}, url = {http://www.aaai.org/ocs/index.php/WS/AAAIW11/paper/viewPaper/3989}, author = {Yu,Xiaodong and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {15164, title = {Authenticated broadcast with a partially compromised public-key infrastructure}, journal = {Stabilization, Safety, and Security of Distributed Systems}, year = {2010}, month = {2010///}, pages = {144 - 158}, abstract = {Given a public-key infrastructure (PKI) and digital signatures, it is possible to construct broadcast protocols tolerating any number of corrupted parties. Almost all existing protocols, however, do not distinguish between corrupted parties (who do not follow the protocol), and honest parties whose secret (signing) keys have been compromised (but who continue to behave honestly). We explore conditions under which it is possible to construct broadcast protocols that still provide the usual guarantees (i.e., validity/agreement) to the latter.Consider a network of n parties, where an adversary has compromised the secret keys of up to t c honest parties and, in addition, fully controls the behavior of up to t a other parties. We show that for any fixed t c > 0, and any fixed t a , there exists an efficient protocol for broadcast if and only if 2t a + min (t a , t c ) < n. (When t c = 0, standard results imply feasibility.) We also show that if t c , t a are not fixed, but are only guaranteed to satisfy the bound above, then broadcast is impossible to achieve except for a few specific values of n; for these {\textquotedblleft}exceptional{\textquotedblright} values of n, we demonstrate a broadcast protocol. Taken together, our results give a complete characterization of this problem. }, doi = {10.1007/978-3-642-16023-3_14}, author = {Gordon,S. and Katz, Jonathan and Kumaresan,R. and Yerukhimovich,A.} } @book {19351, title = {Digital Signatures}, year = {2010}, month = {2010}, pages = {192}, publisher = {Springer}, organization = {Springer}, abstract = {Digital Signatures is the first comprehensive account of the theoretical principles and techniques used in the design of provably secure signature schemes. In addition to providing the reader with a better understanding of the security guarantees provided by digital signatures, the book also contains full descriptions and detailed proofs for essentially all known secure signature schemes in the cryptographic literature. A valuable reference for students, professors, and researchers, Digital Signature Schemes can be used for self-study, as a supplement to a course on theoretical cryptography, or as a textbook in a graduate-level seminar.}, keywords = {Computers / Computer Science, Computers / Hardware / General, Computers / Information Theory, Computers / Networking / Hardware, Computers / Security / General, Technology \& Engineering / Telecommunications}, isbn = {9780387277110}, author = {Yung,Moti and Katz, Jonathan} } @article {15478, title = {Generating Event Sequence-Based Test Cases Using GUI Runtime State Feedback}, journal = {Software Engineering, IEEE Transactions on}, volume = {36}, year = {2010}, month = {2010/02//jan}, pages = {81 - 95}, abstract = {This paper presents a fully automatic model-driven technique to generate test cases for graphical user interfaces (GUIs)-based applications. The technique uses feedback from the execution of a ??seed test suite,?? which is generated automatically using an existing structural event interaction graph model of the GUI. During its execution, the runtime effect of each GUI event on all other events pinpoints event semantic interaction (ESI) relationships, which are used to automatically generate new test cases. Two studies on eight applications demonstrate that the feedback-based technique 1) is able to significantly improve existing techniques and helps identify serious problems in the software and 2) the ESI relationships captured via GUI state yield test suites that most often detect more faults than their code, event, and event-interaction-coverage equivalent counterparts.}, keywords = {automatic model driven technique, event interaction coverage equivalent counterparts, event semantic interaction relationships, event sequence based test cases, Graphical user interfaces, GUI runtime state feedback, program testing, Software quality}, isbn = {0098-5589}, doi = {10.1109/TSE.2009.68}, author = {Xun Yuan and Memon, Atif M.} } @conference {18341, title = {GUI testing using computer vision}, booktitle = {Proceedings of the 28th international conference on Human factors in computing systems}, series = {CHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {1535 - 1544}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Testing a GUI{\textquoteright}s visual behavior typically requires human testers to interact with the GUI and to observe whether the expected results of interaction are presented. This paper presents a new approach to GUI testing using computer vision for testers to automate their tasks. Testers can write a visual test script that uses images to specify which GUI components to interact with and what visual feedback to be observed. Testers can also generate visual test scripts by demonstration. By recording both input events and screen images, it is possible to extract the images of components interacted with and the visual feedback seen by the demonstrator, and generate a visual test script automatically. We show that a variety of GUI behavior can be tested using this approach. Also, we show how this approach can facilitate good testing practices such as unit testing, regression testing, and test-driven development.}, keywords = {gui automation, GUI testing, test by demonstration}, isbn = {978-1-60558-929-9}, doi = {10.1145/1753326.1753555}, url = {http://doi.acm.org/10.1145/1753326.1753555}, author = {Chang,Tsung-Hsiang and Tom Yeh and Miller,Robert C.} } @conference {12429, title = {Image classification of vascular smooth muscle cells}, booktitle = {Proceedings of the 1st ACM International Health Informatics Symposium}, series = {IHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {484 - 486}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {cell biology, digital image processing, machine learning}, isbn = {978-1-4503-0030-8}, doi = {10.1145/1882992.1883068}, url = {http://doi.acm.org/10.1145/1882992.1883068}, author = {Grasso,Michael A. and Mokashi,Ronil and Dalvi,Darshana and Cardone, Antonio and Dima,Alden A. and Bhadriraju,Kiran and Plant,Anne L. and Brady,Mary and Yesha,Yaacov and Yesha,Yelena} } @article {15440, title = {Iterative execution-feedback model-directed GUI testing}, journal = {Information and Software Technology}, volume = {52}, year = {2010}, month = {2010/05//}, pages = {559 - 575}, abstract = {Current fully automatic model-based test-case generation techniques for GUIs employ a static model. Therefore they are unable to leverage certain state-based relationships between GUI events (e.g., one enables the other, one alters the other{\textquoteright}s execution) that are revealed at run-time and non-trivial to infer statically. We present ALT {\textendash} a new technique to generate GUI test cases in batches. Because of its {\textquotedblleft}alternating{\textquotedblright} nature, ALT enhances the next batch by using GUI run-time information from the current batch. An empirical study on four fielded GUI-based applications demonstrated that ALT was able to detect new 4- and 5-way GUI interaction faults; in contrast, previous techniques, due to their requirement of too many test cases, were unable to even test 4- and 5-way GUI interactions.}, keywords = {event-driven software, event-flow graphs, GUI testing, model-based testing, test-case generation}, isbn = {0950-5849}, doi = {10.1016/j.infsof.2009.11.009}, url = {http://www.sciencedirect.com/science/article/pii/S0950584909002092}, author = {Xun Yuan and Memon, Atif M.} } @article {14421, title = {Learning algorithms for link prediction based on chance constraints}, journal = {Machine Learning and Knowledge Discovery in Databases}, year = {2010}, month = {2010///}, pages = {344 - 360}, abstract = {In this paper, we consider the link prediction problem, where we are given a partial snapshot of a network at some time and the goal is to predict the additional links formed at a later time. The accuracy of current prediction methods is quite low due to the extreme class skew and the large number of potential links. Here, we describe learning algorithms based on chance constrained programs and show that they exhibit all the properties needed for a good link predictor, namely, they allow preferential bias to positive or negative class; handle skewness in the data; and scale to large networks. Our experimental results on three real-world domains{\textemdash}co-authorship networks, biological networks and citation networks{\textemdash}show significant performance improvement over baseline algorithms. We conclude by briefly describing some promising future directions based on this work.}, doi = {10.1007/978-3-642-15880-3_28}, author = {Doppa,J. and Yu,J. and Tadepalli,P. and Getoor, Lise} } @article {18708, title = {Perturbing the Ubiquitin Pathway Reveals How Mitosis Is Hijacked to Denucleate and Regulate Cell Proliferation and Differentiation In Vivo}, journal = {PLoS ONEPLoS ONE}, volume = {5}, year = {2010}, month = {2010/10/20/}, pages = {e13331 - e13331}, abstract = {BackgroundThe eye lens presents a unique opportunity to explore roles for specific molecules in cell proliferation, differentiation and development because cells remain in place throughout life and, like red blood cells and keratinocytes, they go through the most extreme differentiation, including removal of nuclei and cessation of protein synthesis. Ubiquitination controls many critical cellular processes, most of which require specific lysines on ubiquitin (Ub). Of the 7 lysines (K) least is known about effects of modification of K6. Methodology and Principal Findings We replaced K6 with tryptophan (W) because K6 is the most readily modified K and W is the most structurally similar residue to biotin. The backbone of K6W-Ub is indistinguishable from that of Wt-Ub. K6W-Ub is effectively conjugated and deconjugated but the conjugates are not degraded via the ubiquitin proteasome pathways (UPP). Expression of K6W-ubiquitin in the lens and lens cells results in accumulation of intracellular aggregates and also slows cell proliferation and the differentiation program, including expression of lens specific proteins, differentiation of epithelial cells into fibers, achieving proper fiber cell morphology, and removal of nuclei. The latter is critical for transparency, but the mechanism by which cell nuclei are removed has remained an age old enigma. This was also solved by expressing K6W-Ub. p27kip, a UPP substrate accumulates in lenses which express K6W-Ub. This precludes phosphorylation of nuclear lamin by the mitotic kinase, a prerequisite for disassembly of the nuclear membrane. Thus the nucleus remains intact and DNAseIIβ neither gains entry to the nucleus nor degrades the DNA. These results could not be obtained using chemical proteasome inhibitors that cannot be directed to specific tissues. Conclusions and Significance K6W-Ub provides a novel, genetic means to study functions of the UPP because it can be targeted to specific cells and tissues. A fully functional UPP is required to execute most stages of lens differentiation, specifically removal of cell nuclei. In the absence of a functional UPP, small aggregate prone, cataractous lenses are formed. }, doi = {10.1371/journal.pone.0013331}, url = {http://dx.doi.org/10.1371/journal.pone.0013331}, author = {Caceres,Andrea and Shang,Fu and Wawrousek,Eric and Liu,Qing and Avidan,Orna and Cvekl,Ales and Yang,Ying and Haririnia,Aydin and Storaska,Andrew and Fushman, David and Kuszak,Jer and Dudek,Edward and Smith,Donald and Taylor,Allen} } @article {18711, title = {Reversible Post-Translational Carboxylation Modulates the Enzymatic Activity of N-Acetyl-l-ornithine Transcarbamylase}, journal = {Biochemistry}, volume = {49}, year = {2010}, month = {2010///}, pages = {6887 - 6895}, abstract = {N-Acetyl-l-ornithine transcarbamylase (AOTCase), rather than ornithine transcarbamylase (OTCase), is the essential carbamylase enzyme in the arginine biosynthesis of several plant and human pathogens. The specificity of this unique enzyme provides a potential target for controlling the spread of these pathogens. Recently, several crystal structures of AOTCase from Xanthomonas campestris (xc) have been determined. In these structures, an unexplained electron density at the tip of the Lys302 side chain was observed. Using 13C NMR spectroscopy, we show herein that Lys302 is post-translationally carboxylated. The structure of wild-type AOTCase in a complex with the bisubstrate analogue Nδ-(phosphonoacetyl)-Nα-acetyl-l-ornithine (PALAO) indicates that the carboxyl group on Lys302 forms a strong hydrogen bonding network with surrounding active site residues, Lys252, Ser253, His293, and Glu92 from the adjacent subunit either directly or via a water molecule. Furthermore, the carboxyl group is involved in binding N-acetyl-l-ornithine via a water molecule. Activity assays with the wild-type enzyme and several mutants demonstrate that the post-translational modification of lysine 302 has an important role in catalysis.N-Acetyl-l-ornithine transcarbamylase (AOTCase), rather than ornithine transcarbamylase (OTCase), is the essential carbamylase enzyme in the arginine biosynthesis of several plant and human pathogens. The specificity of this unique enzyme provides a potential target for controlling the spread of these pathogens. Recently, several crystal structures of AOTCase from Xanthomonas campestris (xc) have been determined. In these structures, an unexplained electron density at the tip of the Lys302 side chain was observed. Using 13C NMR spectroscopy, we show herein that Lys302 is post-translationally carboxylated. The structure of wild-type AOTCase in a complex with the bisubstrate analogue Nδ-(phosphonoacetyl)-Nα-acetyl-l-ornithine (PALAO) indicates that the carboxyl group on Lys302 forms a strong hydrogen bonding network with surrounding active site residues, Lys252, Ser253, His293, and Glu92 from the adjacent subunit either directly or via a water molecule. Furthermore, the carboxyl group is involved in binding N-acetyl-l-ornithine via a water molecule. Activity assays with the wild-type enzyme and several mutants demonstrate that the post-translational modification of lysine 302 has an important role in catalysis. }, isbn = {0006-2960}, doi = {10.1021/bi1007386}, url = {http://dx.doi.org/10.1021/bi1007386}, author = {Li,Yongdong and Yu,Xiaolin and Ho,Jeremy and Fushman, David and Allewell,Norma M. and Tuchman,Mendel and Shi,Dashuang} } @conference {18355, title = {VizWiz: nearly real-time answers to visual questions}, booktitle = {Proceedings of the 23nd annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {333 - 342}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The lack of access to visual information like text labels, icons, and colors can cause frustration and decrease independence for blind people. Current access technology uses automatic approaches to address some problems in this space, but the technology is error-prone, limited in scope, and quite expensive. In this paper, we introduce VizWiz, a talking application for mobile phones that offers a new alternative to answering visual questions in nearly real-time - asking multiple people on the web. To support answering questions quickly, we introduce a general approach for intelligently recruiting human workers in advance called quikTurkit so that workers are available when new questions arrive. A field deployment with 11 blind participants illustrates that blind people can effectively use VizWiz to cheaply answer questions in their everyday lives, highlighting issues that automatic approaches will need to address to be useful. Finally, we illustrate the potential of using VizWiz as part of the participatory design of advanced tools by using it to build and evaluate VizWiz::LocateIt, an interactive mobile tool that helps blind people solve general visual search problems.}, keywords = {blind users, non-visual interfaces, real-time human computation}, isbn = {978-1-4503-0271-5}, doi = {10.1145/1866029.1866080}, url = {http://doi.acm.org/10.1145/1866029.1866080}, author = {Bigham,Jeffrey P. and Jayant,Chandrika and Ji,Hanjie and Little,Greg and Miller,Andrew and Miller,Robert C. and Miller,Robin and Tatarowicz,Aubrey and White,Brandyn and White,Samual and Tom Yeh} } @conference {18356, title = {VizWiz::LocateIt - enabling blind people to locate objects in their environment}, booktitle = {Computer Vision and Pattern Recognition Workshops (CVPRW), 2010 IEEE Computer Society Conference on}, year = {2010}, month = {2010/06//}, pages = {65 - 72}, publisher = {IEEE}, organization = {IEEE}, abstract = {Blind people face a number of challenges when interacting with their environments because so much information is encoded visually. Text is pervasively used to label objects, colors carry special significance, and items can easily become lost in surroundings that cannot be quickly scanned. Many tools seek to help blind people solve these problems by enabling them to query for additional information, such as color or text shown on the object. In this paper we argue that many useful problems may be better solved by directly modeling them as search problems, and present a solution called VizWiz::LocateIt that directly supports this type of interaction. VizWiz::LocateIt enables blind people to take a picture and ask for assistance in finding a specific object. The request is first forwarded to remote workers who outline the object, enabling efficient and accurate automatic computer vision to guide users interactively from their existing cellphones. A two-stage algorithm is presented that uses this information to guide users to the appropriate object interactively from their phone.}, isbn = {978-1-4244-7029-7}, doi = {10.1109/CVPRW.2010.5543821}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5543821}, author = {Bigham,Jeffrey P. and Jayant,Chandrika and Miller,Andrew and White,Brandyn and Tom Yeh} } @conference {13086, title = {Web-scale computer vision using MapReduce for multimedia data mining}, booktitle = {Proceedings of the Tenth International Workshop on Multimedia Data Mining}, series = {MDMKDD {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {9:1{\textendash}9:10 - 9:1{\textendash}9:10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This work explores computer vision applications of the MapReduce framework that are relevant to the data mining community. An overview of MapReduce and common design patterns are provided for those with limited MapReduce background. We discuss both the high level theory and the low level implementation for several computer vision algorithms: classifier training, sliding windows, clustering, bag-of-features, background subtraction, and image registration. Experimental results for the k-means clustering and single Gaussian background subtraction algorithms are performed on a 410 node Hadoop cluster.}, keywords = {background subtraction, bag-of-features, Cloud computing, clustering, Computer vision, image registration, MapReduce}, isbn = {978-1-4503-0220-3}, doi = {10.1145/1814245.1814254}, url = {http://doi.acm.org/10.1145/1814245.1814254}, author = {White,Brandyn and Tom Yeh and Jimmy Lin and Davis, Larry S.} } @inbook {18357, title = {Why Did the Person Cross the Road (There)? Scene Understanding Using Probabilistic Logic Models and Common Sense Reasoning}, booktitle = {Computer Vision {\textendash} ECCV 2010}, series = {Lecture Notes in Computer Science}, volume = {6312}, year = {2010}, month = {2010///}, pages = {693 - 706}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We develop a video understanding system for scene elements, such as bus stops, crosswalks, and intersections, that are characterized more by qualitative activities and geometry than by intrinsic appearance. The domain models for scene elements are not learned from a corpus of video, but instead, naturally elicited by humans, and represented as probabilistic logic rules within a Markov Logic Network framework. Human elicited models, however, represent object interactions as they occur in the 3D world rather than describing their appearance projection in some specific 2D image plane. We bridge this gap by recovering qualitative scene geometry to analyze object interactions in the 3D world and then reasoning about scene geometry, occlusions and common sense domain knowledge using a set of meta-rules. The effectiveness of this approach is demonstrated on a set of videos of public spaces.}, isbn = {978-3-642-15551-2}, url = {http://dx.doi.org/10.1007/978-3-642-15552-9_50}, author = {Kembhavi,Aniruddha and Tom Yeh and Davis, Larry S.}, editor = {Daniilidis,Kostas and Maragos,Petros and Paragios,Nikos} } @conference {15855, title = {Arabic Cross-Document Coreference Resolution}, booktitle = {Proceedings of the ACL-IJCNLP 2009 Conference Short Papers$}$}, year = {2009}, month = {2009///}, pages = {357 - 360}, author = {Sayeed,A. and Elsayed,T. and Garera,N. and Alexander,D. and Xu,T. and Oard, Douglas and Yarowsky,D. and Piatko,C.} } @article {15084, title = {On black-box constructions of predicate encryption from trapdoor permutations}, journal = {Advances in Cryptology{\textendash}ASIACRYPT 2009}, year = {2009}, month = {2009///}, pages = {197 - 213}, abstract = {Predicate encryption is a recent generalization of identity-based encryption (IBE), broadcast encryption, attribute-based encryption, and more. A natural question is whether there exist black-box constructions of predicate encryption based on generic building blocks, e.g., trapdoor permutations. Boneh et al. (FOCS 2008) recently gave a negative answer for the specific case of IBE.We show both negative and positive results. First, we identify a combinatorial property on the sets of predicates/attributes and show that, for any sets having this property, no black-box construction of predicate encryption from trapdoor permutations (or even CCA-secure encryption) is possible. Our framework implies the result of Boneh et al. as a special case, and also rules out, e.g., black-box constructions of forward-secure encryption and broadcast encryption (with many excluded users). On the positive side, we identify conditions under which predicate encryption schemes can be constructed based on any CPA-secure (standard) encryption scheme. }, doi = {10.1007/978-3-642-10366-7_12}, author = {Katz, Jonathan and Yerukhimovich,A.} } @article {14480, title = {Chance-constrained programs for link prediction}, journal = {Proceedings of Workshop on Analyzing Networks and Learning with Graphs at NIPS Conference}, year = {2009}, month = {2009///}, abstract = {In this paper, we consider the link prediction problem, where we are given a par-tial snapshot of a network at some time and the goal is to predict additional links at a later time. The accuracy of the current prediction methods is quite low due to the extreme class skew and the large number of potential links. In this paper, we describe learning algorithms based on chance constrained programs and show that they exhibit all the properties needed for a good link predictor, namely, al- low preferential bias to positive or negative class; handle skewness in the data; and scale to large networks. Our experimental results on three real-world co- authorship networks show significant improvement in prediction accuracy over baseline algorithms. }, author = {Doppa,J.R. and Yu,J. and Tadepalli,P. and Getoor, Lise} } @article {15127, title = {Efficient and secure authenticated key exchange using weak passwords}, journal = {Journal of the ACM (JACM)}, volume = {57}, year = {2009}, month = {2009/11//}, pages = {3:1{\textendash}3:39 - 3:1{\textendash}3:39}, abstract = {Mutual authentication and authenticated key exchange are fundamental techniques for enabling secure communication over public, insecure networks. It is well known how to design secure protocols for achieving these goals when parties share high-entropy cryptographic keys in advance of the authentication stage. Unfortunately, it is much more common for users to share weak, low-entropy passwords which furthermore may be chosen from a known space of possibilities (say, a dictionary of English words). In this case, the problem becomes much more difficult as one must ensure that protocols are immune to off-line dictionary attacks in which an adversary exhaustively enumerates all possible passwords in an attempt to determine the correct one. We propose a 3-round protocol for password-only authenticated key exchange, and provide a rigorous proof of security for our protocol based on the decisional Diffie-Hellman assumption. The protocol assumes only public parameters{\textemdash}specifically, a {\textquotedblleft}common reference string{\textquotedblright}{\textemdash}which can be {\textquotedblleft}hard-coded{\textquotedblright} into an implementation of the protocol; in particular, and in contrast to some previous work, our protocol does not require either party to pre-share a public key. The protocol is also remarkably efficient, requiring computation only (roughly) 4 times greater than {\textquotedblleft}classical{\textquotedblright} Diffie-Hellman key exchange that provides no authentication at all. Ours is the first protocol for password-only authentication that is both practical and provably-secure using standard cryptographic assumptions.}, keywords = {Authentication, cryptography, passwords}, isbn = {0004-5411}, doi = {10.1145/1613676.1613679}, url = {http://doi.acm.org/10.1145/1613676.1613679}, author = {Katz, Jonathan and Ostrovsky,Rafail and Yung,Moti} } @inbook {19635, title = {Efficient Robust Private Set Intersection}, booktitle = {Applied Cryptography and Network Security}, series = {Lecture Notes in Computer Science}, year = {2009}, month = {2009/01/01/}, pages = {125 - 142}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustness, namely, coping with potentially arbitrarily misbehaving (i.e., malicious) parties, while retaining protocol efficiency (rather than employing costly generic techniques) is an open problem. In this work the first solution to this problem is presented.}, keywords = {Coding and Information Theory, Computer Communication Networks, Cryptographic protocols, Data Encryption, Data Structures, Cryptology and Information Theory, Information Systems Applications (incl.Internet), Privacy Preserving Data Mining, Secure Two-party Computation, Set Intersection, Systems and Data Security}, isbn = {978-3-642-01956-2, 978-3-642-01957-9}, url = {http://link.springer.com/chapter/10.1007/978-3-642-01957-9_8}, author = {Dana Dachman-Soled and Malkin, Tal and Raykova, Mariana and Yung, Moti}, editor = {Abdalla, Michel and Pointcheval, David and Fouque, Pierre-Alain and Vergnaud, Damien} } @article {18701, title = {Evidence for Bidentate Substrate Binding as the Basis for the K48 Linkage Specificity of Otubain 1}, journal = {Journal of Molecular Biology}, volume = {386}, year = {2009}, month = {2009/03/06/}, pages = {1011 - 1023}, abstract = {Otubain 1 belongs to the ovarian tumor (OTU) domain class of cysteine protease deubiquitinating enzymes. We show here that human otubain 1 (hOtu1) is highly linkage-specific, cleaving Lys48 (K48)-linked polyubiquitin but not K63-, K29-, K6-, or K11-linked polyubiquitin, or linear α-linked polyubiquitin. Cleavage is not limited to either end of a polyubiquitin chain, and both free and substrate-linked polyubiquitin are disassembled. Intriguingly, cleavage of K48-diubiquitin by hOtu1 can be inhibited by diubiquitins of various linkage types, as well as by monoubiquitin. NMR studies and activity assays suggest that both the proximal and distal units of K48-diubiquitin bind to hOtu1. Reaction of Cys23 with ubiquitin-vinylsulfone identified a ubiquitin binding site that is distinct from the active site, which includes Cys91. Occupancy of the active site is needed to enable tight binding to the second site. We propose that distinct binding sites for the ubiquitins on either side of the scissile bond allow hOtu1 to discriminate among different isopeptide linkages in polyubiquitin substrates. Bidentate binding may be a general strategy used to achieve linkage-specific deubiquitination.}, keywords = {deubiquitination, isopeptide, linkage specificity, otubain, polyubiquitin}, isbn = {0022-2836}, doi = {10.1016/j.jmb.2008.12.085}, url = {http://www.sciencedirect.com/science/article/pii/S0022283608016124}, author = {Wang,Tao and Yin,Luming and Cooper,Eric M. and Lai,Ming-Yih and Dickey,Seth and Pickart,Cecile M. and Fushman, David and Wilkinson,Keith D. and Cohen,Robert E. and Wolberger,Cynthia} } @conference {18339, title = {Fast concurrent object localization and recognition}, booktitle = {Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on}, year = {2009}, month = {2009/06//}, pages = {280 - 287}, publisher = {IEEE}, organization = {IEEE}, abstract = {Object localization and recognition are important problems in computer vision. However, in many applications, exhaustive search over all object models and image locations is computationally prohibitive. While several methods have been proposed to make either recognition or localization more efficient, few have dealt with both tasks simultaneously. This paper proposes an efficient method for concurrent object localization and recognition based on a data-dependent multi-class branch-and-bound formalism. Existing bag-of-features recognition techniques which can be expressed as weighted combinations of feature counts can be readily adapted to our method. We present experimental results that demonstrate the merit of our algorithm in terms of recognition accuracy, localization accuracy, and speed, compared to baseline approaches including exhaustive search, implicit-shape model (ISM), and efficient sub-window search (ESS). Moreover, we develop two extensions to consider non-rectangular bounding regions-composite boxes and polygons-and demonstrate their ability to achieve higher recognition scores compared to traditional rectangular bounding boxes.}, isbn = {978-1-4244-3992-8}, doi = {10.1109/CVPR.2009.5206805}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5206805}, author = {Tom Yeh and Lee,J.J. and Darrell,T.} } @article {19460, title = {The Ins and Outs of Home Networking: The Case for Useful and Usable Domestic Networking}, journal = {ACM Trans. Comput.-Hum. Interact.}, volume = {16}, year = {2009}, month = {2009/06//}, pages = {8:1 - 8:28}, abstract = {Householders are increasingly adopting home networking as a solution to the demands created by the presence of multiple computers, devices, and the desire to access the Internet. However, current network solutions are derived from the world of work (and initially the military) and provide poor support for the needs of the home. We present the key findings to emerge from empirical studies of home networks in the UK and US. The studies reveal two key kinds of work that effective home networking relies upon: one, the technical work of setting up and maintaining the home network, and the other, the collaborative and socially organized work of the home which the network is embedded in and supports. The two are thoroughly intertwined and rely upon one another for their realization, yet neither is adequately supported by current networking technologies and applications. Explication of the {\textquotedblleft}work to make the home network work{\textquotedblright} opens up the design space for the continued integration of the home network in domestic life and elaboration of future support. Key issues for development include the development of networking facilities that do not require advanced networking knowledge, that are flexible and support the local social order of the home and the evolution of its routines, and which ultimately make the home network visible and accountable to household members.}, keywords = {home networking, Human computer interaction}, isbn = {1073-0516}, url = {http://doi.acm.org/10.1145/1534903.1534905}, author = {Grinter, Rebecca E. and Edwards, W. Keith and Marshini Chetty and Poole, Erika S. and Sung, Ja-Young and Yang, Jeonghwa and Crabtree, Andy and Tolmie, Peter and Rodden, Tom and Greenhalgh, Chris and Benford, Steve} } @mastersthesis {18346, title = {Interacting with computers using images for search and automation}, year = {2009}, month = {2009///}, school = {Massachusetts Institute of Technology}, address = {Cambridge, MA, USA}, abstract = {A picture is worth a thousand words. Images have been used extensively by us to interact with other human beings to solve certain problems, for example, showing an image of a hind to a bird expert to identify its species or giving an image of a cosmetic product to a husband to help purchase the right product. However, images have been rarely used to support similar interactions with computers.In this thesis, I present a series of useful applications for users to interact with computers using images and develop several computer vision algorithms; necessary to support such interaction. On the application side, I examine two functional roles of images in human-computer interactions: search and automation. For search, I develop systems for users to obtain useful information about a location or a consumer product by taking its picture using a camera phone, to search online documentation about a GUI by taking its screenshot, and to ask general questions using pictures in a community-based QA service. For automation, I design a visual scripting system to allow end-users insert screenshots of GUI elements directly into program statements. On the computer vision side, I describe the Adaptive Vocabulary Tree algorithm for indexing and searching a large and dynamic collection of images, the Dynamic Visual Category Learning algorithm for training and updating a set of dynamically changing object categories, the Vocabulary Tree SVM algorithm for fast object recognition by approximating the margins of a set of SVM classifiers efficiently, and the Multiclass Brand-and-Bound Window Search algorithm for simultaneously estimating the optimal location and label of an object in a large input image. Finally, I demonstrate the usability of each proposed application with user studies and the technical performance of each algorithm with series of experiments with large datasets. }, author = {Tom Yeh} } @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} } @article {12524, title = {Moving Object Verification in Airborne Video Sequences}, journal = {Circuits and Systems for Video Technology, IEEE Transactions on}, volume = {19}, year = {2009}, month = {2009/01//}, pages = {77 - 89}, abstract = {This paper presents an end-to-end system for moving object verification in airborne video sequences. Using a sample selection module, the system first selects frames from a short sequence and stores them in an exemplar database. To handle appearance change due to potentially large aspect angle variations, a homography-based view synthesis method is then used to generate a novel view of each image in the exemplar database at the same pose as the testing object in each frame of a testing video segment. A rotationally invariant color matcher and a spatial-feature matcher based on distance transforms are combined using a weighted average rule to compare the novel view and the testing object. After looping over all testing frames, the set of match scores is passed to a temporal analysis module to examine the behavior of the testing object, and calculate a final likelihood. Very good verification performance is achieved over thousands of trials for both color and infrared video sequences using the proposed system.}, keywords = {airborne, database;homography-based, databases;, matcher;color, matcher;image, matching;image, method;infrared, object, sequences;color, sequences;distance, sequences;moving, sequences;video, synthesis, system;exemplar, transforms;end-to-end, verification;spatial-feature, video, view}, isbn = {1051-8215}, doi = {10.1109/TCSVT.2008.2009243}, author = {Yue,Zhanfeng and Guarino, D. and Chellapa, Rama} } @article {12887, title = {New records of phytoplankton for Bangladesh. 9. Some rare and a new species}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {16}, year = {2009}, month = {2009/06/25/}, abstract = {Ten taxa belonging to Chlorophyceae, Cyanophyceae, Bacillariophyceae and Euglenophyceae, and one with an uncertain taxonomic position have been described in this paper. Of these, 10 taxa have been found to be globally rare and new records for Bangladesh, whereas Strombomonas islamii Khondker sp. nov. has been described as new to science.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v16i1.2734}, url = {http://www.banglajol.info/bd/index.php/BJPT/article/viewArticle/2734}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @conference {15486, title = {Prioritizing component compatibility tests via user preferences}, booktitle = {Software Maintenance, 2009. ICSM 2009. IEEE International Conference on}, year = {2009}, month = {2009/09//}, pages = {29 - 38}, abstract = {Many software systems rely on third-party components during their build process. Because the components are constantly evolving, quality assurance demands that developers perform compatibility testing to ensure that their software systems build correctly over all deployable combinations of component versions, also called configurations. However, large software systems can have many configurations, and compatibility testing is often time and resource constrained. We present a prioritization mechanism that enhances compatibility testing by examining the ldquomost importantrdquo configurations first, while distributing the work over a cluster of computers. We evaluate our new approach on two large scientific middleware systems and examine tradeoffs between the new prioritization approach and a previously developed lowest-cost-configuration-first approach.}, keywords = {compatibility testing prioritization, component configurations, computer clusters, Middleware, Middleware systems, object-oriented programming, program testing, software engineering, Software systems, third-party components, user preferences}, doi = {10.1109/ICSM.2009.5306357}, author = {Yoon,Il-Chul and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @conference {18352, title = {Searching documentation using text, OCR, and image}, booktitle = {Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval}, series = {SIGIR {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {776 - 777}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We describe a mixed-modality method to index and search software documentation in three ways: plain text, OCR text of embedded figures, and visual features of these figures. Using a corpus of 102 computer books with a total of 62,943 pages and 75,800 figures, we empirically demonstrate that our method achieves better precision/recall than do alternatives based on single modalities.}, keywords = {Computer vision, content-based image retrieval, multimodal search}, isbn = {978-1-60558-483-6}, doi = {10.1145/1571941.1572123}, url = {http://doi.acm.org/10.1145/1571941.1572123}, author = {Tom Yeh and Katz,Boris} } @article {13111, title = {Segmentation using appearance of mesostructure roughness}, journal = {International journal of computer vision}, volume = {83}, year = {2009}, month = {2009///}, pages = {248 - 273}, abstract = {This paper introduces mesostructure roughness as an effective cue in image segmentation. Mesostructure roughness corresponds to small-scale bumps on the macrostructure (i.e., geometry) of objects. Specifically, the focus is on the texture that is created by the projection of the mesostructure roughness on the camera plane. Three intrinsic images are derived: reflectance, smooth-surface shading and mesostructure roughness shading (meta-texture images). A constructive approach is proposed for computing a meta-texture image by preserving, equalizing and enhancing the underlying surface-roughness across color, brightness and illumination variations. We evaluate the performance on sample images and illustrate quantitatively that different patches of the same material, in an image, are normalized in their statistics despite variations in color, brightness and illumination. We develop an algorithm for segmentation of an image into patches that share salient mesostructure roughness. Finally, segmentation by line-based boundary-detection is proposed and results are provided and compared to known algorithms.}, author = {Yacoob,Yaser and Davis, Larry S.} } @conference {18354, title = {Sikuli: using GUI screenshots for search and automation}, booktitle = {Proceedings of the 22nd annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {183 - 192}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present Sikuli, a visual approach to search and automation of graphical user interfaces using screenshots. Sikuli allows users to take a screenshot of a GUI element (such as a toolbar button, icon, or dialog box) and query a help system using the screenshot instead of the element{\textquoteright}s name. Sikuli also provides a visual scripting API for automating GUI interactions, using screenshot patterns to direct mouse and keyboard events. We report a web-based user study showing that searching by screenshot is easy to learn and faster to specify than keywords. We also demonstrate several automation tasks suitable for visual scripting, such as map navigation and bus tracking, and show how visual scripting can improve interactive help systems previously proposed in the literature.}, keywords = {Automation, image search, online help}, isbn = {978-1-60558-745-5}, doi = {10.1145/1622176.1622213}, url = {http://doi.acm.org/10.1145/1622176.1622213}, author = {Tom Yeh and Chang,Tsung-Hsiang and Miller,Robert C.} } @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 = {

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.

}, 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} } @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} } @conference {15495, title = {Towards Dynamic Adaptive Automated Test Generation for Graphical User Interfaces}, booktitle = {Software Testing, Verification and Validation Workshops, 2009. ICSTW {\textquoteright}09. International Conference on}, year = {2009}, month = {2009/04//}, pages = {263 - 266}, abstract = {Graphical user interfaces (GUIs) present an enormous number of potential event sequences to users. During testing it is necessary to cover this space, however the complexity of modern GUIs has made this an increasingly difficult task. Our past work has demonstrated that it is important to incorporate "context{\textquotedblright} into GUI test cases, in terms of event combinations, event sequence length, and by considering all possible starting and ending positions for each event. Despite the use of our most refined modeling techniques, many of the generated test cases remain unexecutable. In this paper, we posit that due to the dynamic state-based nature of GUIs, it is important to incorporate feedback from the execution of tests into test case generation algorithms. We propose the use of an evolutionary algorithm to generate test suites with fewer unexecutable test cases and higher event interaction coverage.}, keywords = {adaptive automated test generation, computational complexity, event sequence length, evolutionary algorithm, evolutionary computation, graphical user interface, Graphical user interfaces, GUI test case, program testing}, doi = {10.1109/ICSTW.2009.26}, author = {Xun Yuan and Cohen,M. B and Memon, Atif M.} } @article {15504, title = {Using GUI Run-Time State as Feedback for Test Automation}, year = {2009}, month = {2009/08/18/}, institution = {Computer Science Research Works, University of Maryland, College Park}, abstract = {Graphical user interfaces (GUIs) are the sole mode of interactionbetween end-users and back-end code for almost all of today{\textquoteright}s software applications. Because of this strategic role of GUIs, their quality has become important. During GUI testing, test cases---modeled as sequences of user events---sample the vast input space of all possible sequences with the goal of detecting faults; for effective testing, it is important to sample this space carefully. Existing techniques either sample manually or employ manually constructed abstract models---the abstraction and/or subsequent test-case generation algorithms enable sampling. This report presents an alternative approach to GUI testing -- it{\textquoteright}s focus is on developing a fully automatic model-driven technique to generate GUI test cases. The technique is novel in that it uses feedback from the execution of a {\textquoteleft}{\textquoteleft}seed test suite{\textquoteright}{\textquoteright} on a GUI. The seed suite is generated automatically using an existing structural event-interaction graph (EIG) model of the GUI. During its execution, the run-time effect of each GUI event on all other events pinpoints new important event-semantic interaction (ESI) relationships between them, which are used to automatically create an ESI graph (ESIG) model and generate new test cases. Together with a reverse-engineering algorithm used to obtain the EIG, seed suite, ESIG, and new test cases, the feedback-based technique yields a fully automatic, end-to-end GUI testing process. }, keywords = {GUI testing, Software testing, test automation, test-case generation}, url = {http://drum.lib.umd.edu//handle/1903/9416}, author = {Xun Yuan and Memon, Atif M.} } @article {12885, title = {Using Satellite Images of Environmental Changes to Predict Infectious Disease Outbreaks}, journal = {Emerging Infectious DiseasesEmerg Infect Dis}, volume = {15}, year = {2009}, month = {2009/09//}, pages = {1341 - 1346}, abstract = {A strong global satellite imaging system is essential for predicting outbreaks., Recent events clearly illustrate a continued vulnerability of large populations to infectious diseases, which is related to our changing human-constructed and natural environments. A single person with multidrug-resistant tuberculosis in 2007 provided a wake-up call to the United States and global public health infrastructure, as the health professionals and the public realized that today{\textquoteright}s ease of airline travel can potentially expose hundreds of persons to an untreatable disease associated with an infectious agent. Ease of travel, population increase, population displacement, pollution, agricultural activity, changing socioeconomic structures, and international conflicts worldwide have each contributed to infectious disease events. Today, however, nothing is larger in scale, has more potential for long-term effects, and is more uncertain than the effects of climate change on infectious disease outbreaks, epidemics, and pandemics. We discuss advances in our ability to predict these events and, in particular, the critical role that satellite imaging could play in mounting an effective response.}, isbn = {1080-6040}, doi = {10.3201/eid/1509.081334}, author = {Ford,Timothy E. and Rita R Colwell and Rose,Joan B. and Morse,Stephen S. and Rogers,David J. and Yates,Terry L.} } @article {12558, title = {Activity Modeling Using Event Probability Sequences}, journal = {Image Processing, IEEE Transactions on}, volume = {17}, year = {2008}, month = {2008/04//}, pages = {594 - 607}, abstract = {Changes in motion properties of trajectories provide useful cues for modeling and recognizing human activities. We associate an event with significant changes that are localized in time and space, and represent activities as a sequence of such events. The localized nature of events allows for detection of subtle changes or anomalies in activities. In this paper, we present a probabilistic approach for representing events using the hidden Markov model (HMM) framework. Using trained HMMs for activities, an event probability sequence is computed for every motion trajectory in the training set. It reflects the probability of an event occurring at every time instant. Though the parameters of the trained HMMs depend on viewing direction, the event probability sequences are robust to changes in viewing direction. We describe sufficient conditions for the existence of view invariance. The usefulness of the proposed event representation is illustrated using activity recognition and anomaly detection. Experiments using the indoor University of Central Florida human action dataset, the Carnegie Mellon University Credo Intelligence, Inc., Motion Capture dataset, and the outdoor Transportation Security Administration airport tarmac surveillance dataset show encouraging results.}, keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Video Recording;, Biological;Models, Carnegie Mellon University;Credo Intelligence, Computer-Assisted;Models, Inc.;Motion Capture dataset;Transportation Security Administration;University Central Florida;airport tarmac surveillance dataset;anomaly detection;event probability sequence;event representation;hidden Markov model;human action dataset;human activity rec, Statistical;Motor Activity;Movement;Pattern Recognition}, isbn = {1057-7149}, doi = {10.1109/TIP.2008.916991}, author = {Cuntoor, N.P. and Yegnanarayana,B. and Chellapa, Rama} } @conference {15447, title = {Alternating GUI Test Generation and Execution}, booktitle = {Practice and Research Techniques, 2008. TAIC PART {\textquoteright}08. Testing: Academic Industrial Conference}, year = {2008}, month = {2008///}, pages = {23 - 32}, abstract = {Users of today{\textquoteright}s software perform tasks by interacting with a graphical user interface (GUI) front-end via sequences of input events. Due to the flexibility offered by most GUIs, the number of event sequences grows exponentially with length. One ubiquitous challenge of GUI testing is to selectively generate those sequences that lead to potentially problematic states. This paper presents ALT, a new technique that generates GUI test cases in batches, by leveraging GUI run-time information from a previously run batch to obtain the next batch. Each successive batch consists of "longer" test cases that expand the state space to be explored, yet prune the "unimportant" states. The "alternating" nature of ALT allows it to enhance the next batch by leveraging certain relationships between GUI events (e.g., one enables the other, one alters the other{\textquoteright}s execution) that are revealed only at run-time and non-trivial to infer statically. An empirical study on four fielded GUI-based applications demonstrates that ALT is successful at identifying complex failure-causing interactions between GUI events.}, keywords = {ALT, complex failure-causing interactions, event sequences, graphical user interface, Graphical user interfaces, GUI test generation, Testing}, doi = {10.1109/TAIC-PART.2008.10}, author = {Xun Yuan and Memon, Atif M.} } @conference {14205, title = {Bilateral symmetry of object silhouettes under perspective projection}, booktitle = {19th International Conference on Pattern Recognition, 2008. ICPR 2008}, year = {2008}, month = {2008/12/08/11}, pages = {1 - 4}, publisher = {IEEE}, organization = {IEEE}, abstract = {Symmetry is an important property of objects and is exhibited in different forms e.g., bilateral, rotational, etc. This paper presents an algorithm for computing the bilateral symmetry of silhouettes of shallow objects under perspective distortion, exploiting the invariance of the cross ratio to projective transformations. The basic idea is to use the cross ratio to compute a number of midpoints of cross sections and then fit a straight line through them. The goodness-of-fit determines the likelihood of the line to be the axis of symmetry. We analytically estimate the midpointpsilas location as a function of the vanishing point for a given object silhouette. Hence finding the symmetry axis amounts to a 2D search in the space of vanishing points. We present experiments on two datasets as well as Internet images of symmetric objects that validate our approach.}, keywords = {Automation, bilateral symmetry, Computer vision, Frequency, Image analysis, Image coding, Image reconstruction, Internet, Internet images, Object detection, object silhouettes, perspective distortion, perspective projection, SHAPE, symmetric objects}, isbn = {978-1-4244-2174-9}, doi = {10.1109/ICPR.2008.4761501}, author = {Bitsakos,K. and Yi,H. and Yi,L. and Ferm{\"u}ller, Cornelia} } @book {15197, title = {Digital Signatures}, year = {2008}, month = {2008///}, publisher = {Springer Verlag}, organization = {Springer Verlag}, author = {Yung,M. and Katz, Jonathan} } @article {18961, title = {The draft genome of the transgenic tropical fruit tree papaya (Carica papaya Linnaeus)}, journal = {Nature}, volume = {452}, year = {2008}, month = {2008///}, pages = {991 - 996}, abstract = {Papaya, a fruit crop cultivated in tropical and subtropical regions, is known for its nutritional benefits and medicinal applications. Here we report a 3 draft genome sequence of {\textquoteright}SunUp{\textquoteright} papaya, the first commercial virus-resistant transgenic fruit tree to be sequenced. The papaya genome is three times the size of the Arabidopsis genome, but contains fewer genes, including significantly fewer disease-resistance gene analogues. Comparison of the five sequenced genomes suggests a minimal angiosperm gene set of 13,311. A lack of recent genome duplication, atypical of other angiosperm genomes sequenced so far, may account for the smaller papaya gene number in most functional groups. Nonetheless, striking amplifications in gene number within particular functional groups suggest roles in the evolution of tree-like habit, deposition and remobilization of starch reserves, attraction of seed dispersal agents, and adaptation to tropical daylengths. Transgenesis at three locations is closely associated with chloroplast insertions into the nuclear genome, and with topoisomerase I recognition sites. Papaya offers numerous advantages as a system for fruit-tree functional genomics, and this draft genome sequence provides the foundation for revealing the basis of Carica{\textquoteright}s distinguishing morpho-physiological, medicinal and nutritional properties.}, isbn = {0028-0836}, doi = {10.1038/nature06856}, url = {http://www.nature.com/nature/journal/v452/n7190/full/nature06856.html}, author = {Ming,R. and Hou,S. and Feng,Y. and Yu,Q. and Dionne-Laporte,A. and Saw,J.H. and Senin,P. and Wang,W. and Ly,B.V. and Lewis,K.L.T. and others} } @conference {18337, title = {Dynamic visual category learning}, booktitle = {Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on}, year = {2008}, month = {2008/06//}, pages = {1 - 8}, publisher = {IEEE}, organization = {IEEE}, abstract = {Dynamic visual category learning calls for efficient adaptation as new training images become available or new categories are defined, existing training images or categories become modified or obsolete, or when categories are divided into subcategories or merged together. We develop novel methods for efficient incremental learning of SVM-based visual category classifiers to handle such dynamic tasks. Our method exploits previous classifier estimates to more efficiently learn the optimal parameters for the current set of training images and categories. We show empirically that for dynamic visual category tasks, our incremental learning methods are significantly faster than batch retraining.}, isbn = {978-1-4244-2242-5}, doi = {10.1109/CVPR.2008.4587616}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4587616}, author = {Tom Yeh and Darrell,Trevor} } @conference {15452, title = {Effective and scalable software compatibility testing}, booktitle = {Proceedings of the 2008 international symposium on Software testing and analysis}, series = {ISSTA {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {63 - 74}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Today{\textquoteright}s software systems are typically composed of multiple components, each with different versions. Software compatibility testing is a quality assurance task aimed at ensuring that multi-component based systems build and/or execute correctly across all their versions{\textquoteright} combinations, or configurations. Because there are complex and changing interdependencies between components and their versions, and because there are such a large number of configurations, it is generally infeasible to test all potential configurations. Consequently, in practice, compatibility testing examines only a handful of default or popular configurations to detect problems; as a result costly errors can and do escape to the field. This paper presents a new approach to compatibility testing, called Rachet. We formally model the entire configuration space for software systems and use the model to generate test plans to sample a portion of the space. In this paper, we test all direct dependencies between components and execute the test plan efficiently in parallel. We present empirical results obtained by applying our approach to two large-scale scientific middleware systems. The results show that for these systems Rachet scaled well and discovered incompatibilities between components, and that testing only direct dependences did not compromise test quality.}, keywords = {component-based software system, software compatibility testing}, isbn = {978-1-60558-050-0}, doi = {10.1145/1390630.1390640}, url = {http://doi.acm.org/10.1145/1390630.1390640}, author = {Yoon,Il-Chul and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @article {12913, title = {Environmental signatures associated with cholera epidemics}, journal = {Proceedings of the National Academy of Sciences}, volume = {105}, year = {2008}, month = {2008///}, pages = {17676 - 17676}, abstract = {The causative agent of cholera, Vibrio cholerae, has been shown to be autochthonous to riverine, estuarine, and coastal waters along with its host, the copepod, a significant member of the zooplankton community. Temperature, salinity, rainfall and plankton have proven to be important factors in the ecology of V. cholerae, influencing the transmission of the disease in those regions of the world where the human population relies on untreated water as a source of drinking water. In this study, the pattern of cholera outbreaks during 1998{\textendash}2006 in Kolkata, India, and Matlab, Bangladesh, and the earth observation data were analyzed with the objective of developing a prediction model for cholera. Satellite sensors were used to measure chlorophyll a concentration (CHL) and sea surface temperature (SST). In addition, rainfall data were obtained from both satellite and in situ gauge measurements. From the analyses, a statistically significant relationship between the time series for cholera in Kolkata, India, and CHL and rainfall anomalies was determined. A statistically significant one month lag was observed between CHL anomaly and number of cholera cases in Matlab, Bangladesh. From the results of the study, it is concluded that ocean and climate patterns are useful predictors of cholera epidemics, with the dynamics of endemic cholera being related to climate and/or changes in the aquatic ecosystem. When the ecology of V. cholerae is considered in predictive models, a robust early warning system for cholera in endemic regions of the world can be developed for public health planning and decision making.ecology epidemiology microbiology remote sensing }, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0809654105}, url = {http://www.pnas.org/content/105/46/17676}, author = {Constantin de Magny,G. and Murtugudde,R. and Sapiano,M. R. P. and Nizam,A. and Brown,C. W. and Busalacchi,A. J. and Yunus,M. and Nair,G. B. and Gil,A. I. and Lanata,C. F. and Rita R Colwell} } @conference {18212, title = {Extended abstract: A hardware-assisted data hiding based approach in building high performance secure execution systems}, booktitle = {Hardware-Oriented Security and Trust, 2008. HOST 2008. IEEE International Workshop on}, year = {2008}, month = {2008/06//}, pages = {93 - 96}, abstract = {Recently, a novel data hiding technique was proposed to embed information into compiled binary codes in order to enhance system performance. Using this technique as a vehicle, we propose a framework to build high-performance secure execution systems by embedding data for security and trust purposes. We illustrate this approach in a mobile computing environment by an instruction-block level data hiding technique, which can be used to defend against malicious attacks (such as Trojan injection). This improves the trustworthiness of mobile codes. It also protects the code providerpsilas intellectual property because the code can be executed only on the designated device. When combined with the existing approach in [4], the proposed data hiding framework can provide trust and high-performance simultaneously. Finally, we conduct a proof-of-the-concept FPGA prototyping to validate the data hiding technique and evaluate the hardware cost in terms of gate count, power consumption, and gate delay.}, keywords = {arrays;invasive, attacks;mobile, codes;data, codes;mobile, computing;, computing;power, consumption;proof-of-the-concept, count;gate, data, delay;hardware-assisted, embedding;gate, embedding;instruction-block, encapsulation;distributed, execution, FPGA, gate, hiding;information, injection;binary, level;malicious, programmable, programming;field, prototyping;secure, software;mobile, systems;binary, Trojan}, doi = {10.1109/HST.2008.4559062}, author = {Taylor,M. and Yin,Chi-En and M. Wu and Gang Qu} } @article {18338, title = {Fast concurrent object classification and localization}, journal = {CSAIL Technical Reports (July 1, 2003 - present)}, year = {2008}, month = {2008/06/10/}, abstract = {Object localization and classification are important problems incomputer vision. However, in many applications, exhaustive searchover all class labels and image locations is computationallyprohibitive. While several methods have been proposed to makeeither classification or localization more efficient, few havedealt with both tasks simultaneously. This paper proposes anefficient method for concurrent object localization andclassification based on a data-dependent multi-classbranch-and-bound formalism. Existing bag-of-featuresclassification schemes, which can be expressed as weightedcombinations of feature counts can be readily adapted to ourmethod. We present experimental results that demonstrate the meritof our algorithm in terms of classification accuracy, localizationaccuracy, and speed, compared to baseline approaches includingexhaustive search, the ISM method, and single-class branch andbound.}, url = {http://dspace.mit.edu/handle/1721.1/41862}, author = {Tom Yeh and Lee,John J and Darrell,Trevor} } @article {16262, title = {Figaro: A Novel Statistical Method for Vector Sequence Removal}, journal = {Bioinformatics}, volume = {24}, year = {2008}, month = {2008/02/15/}, pages = {462 - 467}, abstract = {Motivation: Sequences produced by automated Sanger sequencing machines frequently contain fragments of the cloning vector on their ends. Software tools currently available for identifying and removing the vector sequence require knowledge of the vector sequence, specific splice sites and any adapter sequences used in the experiment{\textemdash}information often omitted from public databases. Furthermore, the clipping coordinates themselves are missing or incorrectly reported. As an example, within the \~{}1.24 billion shotgun sequences deposited in the NCBI Trace Archive, as many as \~{}735 million (\~{}60\%) lack vector clipping information. Correct clipping information is essential to scientists attempting to validate, improve and even finish the increasingly large number of genomes released at a {\textquoteleft}draft{\textquoteright} quality level.Results: We present here Figaro, a novel software tool for identifying and removing the vector from raw sequence data without prior knowledge of the vector sequence. The vector sequence is automatically inferred by analyzing the frequency of occurrence of short oligo-nucleotides using Poisson statistics. We show that Figaro achieves 99.98\% sensitivity when tested on \~{}1.5 million shotgun reads from Drosophila pseudoobscura. We further explore the impact of accurate vector trimming on the quality of whole-genome assemblies by re-assembling two bacterial genomes from shotgun sequences deposited in the Trace Archive. Designed as a module in large computational pipelines, Figaro is fast, lightweight and flexible. Availability: Figaro is released under an open-source license through the AMOS package (http://amos.sourceforge.net/Figaro). Contact: mpop@umiacs.umd.edu }, isbn = {1367-4803, 1460-2059}, doi = {10.1093/bioinformatics/btm632}, url = {http://bioinformatics.oxfordjournals.org/content/24/4/462}, author = {White,James Robert and Roberts,Michael and Yorke,James A. and Pop, Mihai} } @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 {14921, title = {The Maryland Large-Scale Integrated Neurocognitive Architecture}, year = {2008}, month = {2008/03//}, institution = {University of Maryland College Park}, abstract = {Recent progress in neural computation, high performance computing, neuroscience and cognitive science suggests that an effort to produce a general-purpose, adaptive machine intelligence is likely to yield a qualitatively more powerful system than those currently existing. Here we outline our progress in developing a framework for creating such a large-scale machine intelligence, or neurocognitive architecture that is based on the modularity, dynamics and plasticity of the human brain. We successfully implemented three intermediate-scale parts of such a system, and these are described. Based on this experience, we concluded that for the short term, optimal results would be obtained by using a hybrid design including neural, symbolic AI, and artificial life methods. We propose a three-tiered architecture that integrates these different methods, and describe a prototype mini-Roboscout that we implemented and evaluated based on this architecture. We also examined, via computational experiments, the effectiveness of genetic programming as a design tool for recurrent neural networks, and the speed-up obtained for adaptive neural networks when they are executed on a graphical processing unit. We conclude that the implementation of a large-scale neurocognitive architecture is feasible, and outline a roadmap for proceeding.}, keywords = {*COMPUTATIONS, *HYBRID SYSTEMS, *NEURAL NETS, *NEUROCOGNITIVE ARCHITECTURE, ADAPTIVE SYSTEMS, Artificial intelligence, BRAIN, Cognition, COMPUTER PROGRAMMING, COMPUTER PROGRAMMING AND SOFTWARE, HYBRID AI, Machine intelligence, MECHANICAL ORGANS, MODULAR CONSTRUCTION, NERVOUS SYSTEM, PE61101E, PLASTIC PROPERTIES, PROCESSING EQUIPMENT, RECURRENT NEURAL NETWORK}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA481261}, author = {Reggia, James A. and Tagamets,M. and Contreras-Vidal,J. and Jacobs, David W. and Weems,S. and Naqvi,W. and Yang,C.} } @conference {18347, title = {Multimodal question answering for mobile devices}, booktitle = {Proceedings of the 13th international conference on Intelligent user interfaces}, series = {IUI {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {405 - 408}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper introduces multimodal question answering, a new interface for community-based question answering services. By offering users an extra modality---photos---in addition to the text modality to formulate queries, multimodal question answering overcomes the limitations of text-only input methods when the users ask questions regarding visually distinctive objects. Such interface is especially useful when users become curious about an interesting object in the environment and want to know about it---simply by taking a photo and asking a question in a situated (from a mobile device) and intuitive (without describing the object in words) manner. We propose a system architecture for multimodal question answering, describe an algorithm for searching the database, and report on the findings of two prototype studies.}, keywords = {Information retrieval, mobile application, pattern matching, Question answering}, isbn = {978-1-59593-987-6}, doi = {10.1145/1378773.1378841}, url = {http://doi.acm.org/10.1145/1378773.1378841}, author = {Tom Yeh and Darrell,Trevor} } @conference {15060, title = {A New Approach of Dynamic Background Modeling for Surveillance Information}, booktitle = {Computer Science and Software Engineering, 2008 International Conference on}, volume = {1}, year = {2008}, month = {2008/12//}, pages = {850 - 855}, abstract = {This paper presents a new approach of best background modeling for surveillance information. The approach makes orthogonal non-separable wavelet transformation of information frames used for background modeling, extracts the approximate information to reconstruct information frames, filters out the disturbance, shadow and noise from the reconstructed frames, constructs basic background with the method of binary mask images, uses multi-frame combination of non-uniform noise to filter noise in basic background, applies mutual information to detect the situation of adjacent changes. If the background has a gradual change, weighted superposition of multi background modeling images with time will be applied to update the background. If the background has a major or sudden change, the background will remodel from this frame.}, keywords = {approximate information extraction, binary mask images, disturbance filtering, dynamic background modeling, Feature extraction, filtering theory, Image reconstruction, information frame reconstruction, NOISE, noise filtering, orthogonal nonseparable wavelet transformation, Surveillance, surveillance information, Wavelet transforms}, doi = {10.1109/CSSE.2008.601}, author = {Gao,Dongfa and Zhuolin Jiang and Ye,Ming} } @article {12900, title = {New records of phytoplankton for Bangladesh. 2. Cryptophyceae and Synurophyceae}, journal = {Bangladesh Journal of Botany}, volume = {36}, year = {2008}, month = {2008/11/05/}, abstract = {This study presents two species of Rhodomonas, four species of Chroomonas, six species of Cryptomonas and Cryptochrysis minor, Cyanomonas coeruleus, Chrysodidymus synuroideus and Mallomonas akrokomos. These species have been reported from some ponds of Mathbaria in Pirojpur and Bakerganj of Barisal district in Bangladesh.}, isbn = {0253-5416}, doi = {10.3329/bjb.v36i1.1549}, url = {http://www.banglajol.info/bd/index.php/BJB/article/viewArticle/1549}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12902, title = {New records of phytoplankton for Bangladesh. 5. Euglena, Euglenocapsa}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {15}, year = {2008}, month = {2008/06/16/}, abstract = {This study presents 20 taxa of the genus Euglena and one species of the rare euglenoid genus Euglenocapsa. All these taxa are reported for the first time from some pond ecosystems of Mathbaria in Pirojpur and Bakerganj of Barisal districts of Bangladesh.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v15i1.910}, url = {http://www.banglajol.info/index.php/BJPT/article/viewArticle/910}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12899, title = {New records of phytoplankton for Bangladesh. 7. Phacus spp.}, journal = {Bangladesh Journal of Botany}, volume = {37}, year = {2008}, month = {2008/11/05/}, abstract = {Thirteen species of Phacus hitherto not reported from Bangladesh have been described and illustrated. Freshwater ponds at southern districts of Pirojpur and Barisal revealed these presence of the species.}, isbn = {0253-5416}, doi = {10.3329/bjb.v37i1.1564}, url = {http://www.banglajol.info/bd/index.php/BJB/article/viewArticle/1564}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12897, title = {New records of phytoplankton for Bangladesh. 8. Trachelomonas Ehr. (Euglenophyceae)}, journal = {Bangladesh Journal of Botany}, volume = {37}, year = {2008}, month = {2008/12/19/}, abstract = {Investigation of pelagic plankton communities from some freshwater ponds of Pirojpur and Barisal districts revealed the presence of 17 species under the genus Trachelomonas Ehr. for the first time in Bangladesh.}, isbn = {0253-5416}, doi = {10.3329/bjb.v37i2.1719}, url = {http://www.banglajol.info/bd/index.php/BJB/article/viewArticle/1719}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @conference {18593, title = {Photo-based authentication using social networks}, booktitle = {Proceedings of the first workshop on Online social networks}, series = {WOSN {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {55 - 60}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present Lineup, a system that uses the social network graph in Facebook and auxiliary information (e.g., "tagged" user photos) to build a photo-based Web site authentication framework. Lineup{\textquoteright}s underlying mechanism leverages the concept of CAPTCHAs, programs that are designed to distinguish bots from human users. Lineup extends this functionality to help a Web site ascertain a user{\textquoteright}s identity or membership in a certain group (e.g., an interest group, invitees to a certain event) in order to infer some level of trust. Lineup works by presenting a user with photographs and asking the user to identify subjects in the photo whom a user with the appropriate identity or group membership should know. We present the design and implementation for Lineup, describe a preliminary prototype implementation, and discuss Lineup{\textquoteright}s security properties, including possible guarantees and threats.}, keywords = {social networks, trust}, isbn = {978-1-60558-182-8}, doi = {10.1145/1397735.1397748}, url = {http://doi.acm.org/10.1145/1397735.1397748}, author = {Yardi,Sarita and Feamster, Nick and Bruckman,Amy} } @conference {18350, title = {Photo-based question answering}, booktitle = {Proceedings of the 16th ACM international conference on Multimedia}, series = {MM {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {389 - 398}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Photo-based question answering is a useful way of finding information about physical objects. Current question answering (QA) systems are text-based and can be difficult to use when a question involves an object with distinct visual features. A photo-based QA system allows direct use of a photo to refer to the object. We develop a three-layer system architecture for photo-based QA that brings together recent technical achievements in question answering and image matching. The first, template-based QA layer matches a query photo to online images and extracts structured data from multimedia databases to answer questions about the photo. To simplify image matching, it exploits the question text to filter images based on categories and keywords. The second, information retrieval QA layer searches an internal repository of resolved photo-based questions to retrieve relevant answers. The third, human-computation QA layer leverages community experts to handle the most difficult cases. A series of experiments performed on a pilot dataset of 30,000 images of books, movie DVD covers, grocery items, and landmarks demonstrate the technical feasibility of this architecture. We present three prototypes to show how photo-based QA can be built into an online album, a text-based QA, and a mobile application.}, keywords = {Computer vision, Information retrieval, Question answering}, isbn = {978-1-60558-303-7}, doi = {10.1145/1459359.1459412}, url = {http://doi.acm.org/10.1145/1459359.1459412}, author = {Tom Yeh and Lee,John J and Darrell,Trevor} } @article {16338, title = {Pooled ANOVA}, journal = {Computational Statistics \& Data Analysis}, volume = {52}, year = {2008}, month = {2008/08/15/}, pages = {5215 - 5228}, abstract = {We introduce Pooled ANOVA, a greedy algorithm to sequentially select the rare important factors from a large set of factors. Problems such as computer simulations and software performance tuning involve a large number of factors, few of which have an important effect on the outcome or performance measure. We pool multiple factors together, and test the pool for significance. If the pool has a significant effect we retain the factors for deconfounding. If not, we either declare that none of the factors are important, or retain them for follow-up decoding, depending on our assumptions and stage of testing. The sparser important factors are, the bigger the savings. Pooled ANOVA requires fewer assumptions than other, similar methods (e.g.~sequential bifurcation), such as not requiring all important effects to have the same sign. We demonstrate savings of 25\%-35\% when compared to a conventional ANOVA, and also the ability to work in a setting where Sequential Bifurcation fails.}, isbn = {0167-9473}, doi = {16/j.csda.2008.04.024}, url = {http://www.sciencedirect.com/science/article/pii/S0167947308002168}, author = {Last,Michael and Luta,Gheorghe and Orso,Alex and Porter, Adam and Young,Stan} } @article {16390, title = {Reciprocity between the cerebellum and the cerebral cortex: Nonlinear dynamics in microscopic modules for generating voluntary motor commands}, journal = {Complexity}, volume = {14}, year = {2008}, month = {2008/11/01/}, pages = {29 - 45}, abstract = {The cerebellum and basal ganglia are reciprocally connected with the cerebral cortex, forming many loops that function as distributed processing modules. Here we present a detailed model of one microscopic loop between the motor cortex and the cerebellum, and we show how small arrays of these microscopic loops (CB modules) can be used to generate biologically plausible motor commands for controlling movement. A fundamental feature of CB modules is the presence of positive feedback loops between the cerebellar nucleus and the motor cortex. We use nonlinear dynamics to model one microscopic loop and to investigate its bistable properties. Simulations demonstrate an ability to program a motor command well in advance of command generation and an ability to vary command duration. However, control of command intensity is minimal, which could interfere with the control of movement velocity. To assess these hypotheses, we use a minimal nonlinear model of the neuromuscular (NM) system that translates motor commands into actual movements. Simulations of the combined CB-NM modular model indicate that movement duration is readily controlled, whereas velocity is poorly controlled. We then explore how an array of eight CB-NM modules can be used to control the direction and endpoint of a planar movement. In actuality, thousands of such microscopic loops function together as an array of adjustable pattern generators for programming and regulating the composite motor commands that control limb movements. We discuss the biological plausibility and limitations of the model. We also discuss ways in which an agent-based representation can take advantage of the modularity in order to model this complex system. {\textcopyright} 2008 Wiley Periodicals, Inc. Complexity, 2008}, keywords = {agent-based modeling, cerebellum, equilibrium point control, motor command, motor cortex, Movement, neural network, nonlinear dynamics}, isbn = {1099-0526}, doi = {10.1002/cplx.20241}, url = {http://onlinelibrary.wiley.com/doi/10.1002/cplx.20241/abstract}, author = {Wang,Jun and Dam,Gregory and Yildirim,Sule and Rand, William and Wilensky,Uri and Houk,James C.} } @conference {18351, title = {Scalable classifiers for Internet vision tasks}, booktitle = {Computer Vision and Pattern Recognition Workshops, 2008. CVPRW{\textquoteright}08. IEEE Computer Society Conference on}, year = {2008}, month = {2008/06//}, pages = {1 - 8}, publisher = {IEEE}, organization = {IEEE}, abstract = {Object recognition systems designed for Internet applications typically need to adapt to userspsila needs in a flexible fashion and scale up to very large data sets. In this paper, we analyze the complexity of several multiclass SVM-based algorithms and highlight the computational bottleneck they suffer at test time: comparing the input image to every training image. We propose an algorithm that overcomes this bottleneck; it offers not only the efficiency of a simple nearest-neighbor classifier, by voting on class labels based on the k nearest neighbors quickly determined by a vocabulary tree, but also the recognition accuracy comparable to that of a complex SVM classifier, by incorporating SVM parameters into the voting scores incrementally accumulated from individual image features. Empirical results demonstrate that adjusting votes by relevant support vector weights can improve the recognition accuracy of a nearest-neighbor classifier without sacrificing speed. Compared to existing methods, our algorithm achieves a ten-fold speed increase while incurring an acceptable accuracy loss that can be easily offset by showing about two more labels in the result. The speed, scalability, and adaptability of our algorithm makes it suitable for Internet vision applications.}, isbn = {978-1-4244-2339-2}, doi = {10.1109/CVPRW.2008.4562958}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4562958}, author = {Tom Yeh and Lee,John J and Darrell,Trevor} } @article {12241, title = {A scalable key management and clustering scheme for wireless ad hoc and sensor networks}, journal = {Future Generation Computer Systems}, volume = {24}, year = {2008}, month = {2008/10//}, pages = {860 - 869}, abstract = {This paper describes a scalable key management and clustering scheme for secure group communications in ad hoc and sensor networks. The scalability problem is solved by partitioning the communicating devices into subgroups, with a leader in each subgroup, and further organizing the subgroups into hierarchies. Each level of the hierarchy is called a tier or layer. Key generation, distribution, and actual data transmissions follow the hierarchy. The distributed, efficient clustering approach (DECA) provides robust clustering to form subgroups, and analytical and simulation results demonstrate that DECA is energy-efficient and resilient against node mobility. Comparing with most other schemes, our approach is extremely scalable and efficient, provides more security guarantees, and is selective, adaptive and robust.}, keywords = {ad hoc networks, clustering, Group communications, Key management, sensor networks}, isbn = {0167-739X}, doi = {10.1016/j.future.2008.03.007}, url = {http://www.sciencedirect.com/science/article/pii/S0167739X08000782}, author = {Li,Jason H. and Bhattacharjee, Bobby and Yu,Miao and Levy,Renato} } @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 {12540, title = {Synthesis of Silhouettes and Visual Hull Reconstruction for Articulated Humans}, journal = {Multimedia, IEEE Transactions on}, volume = {10}, year = {2008}, month = {2008/12//}, pages = {1565 - 1577}, abstract = {In this paper, we propose a complete framework for improved synthesis and understanding of the human pose from a limited number of silhouette images. It combines the active image-based visual hull (IBVH) algorithm and a contour-based body part segmentation technique. We derive a simple, approximate algorithm to decide the extrinsic parameters of a virtual camera, and synthesize the turntable image collection of the person using the IBVH algorithm by actively moving the virtual camera on a properly computed circular trajectory around the person. Using the turning function distance as the silhouette similarity measurement, this approach can be used to generate the desired pose-normalized images for recognition applications. In order to overcome the inability of the visual hull (VH) method to reconstruct concave regions, we propose a contour-based human body part localization algorithm to segment the silhouette images into convex body parts. The body parts observed from the virtual view are generated separately from the corresponding body parts observed from the input views and then assembled together for a more accurate VH reconstruction. Furthermore, the obtained turntable image collection helps to improve the body part segmentation and identification process. By using the inner distance shape context (IDSC) measurement, we are able to estimate the body part locations more accurately from a synthesized view where we can localize the body part more precisely. Experiments show that the proposed algorithm can greatly improve body part segmentation and hence shape reconstruction results.}, keywords = {active, algorithm;articulated, algorithm;inner, body, camera;visual, collection;virtual, computation;contour-based, Context, detection;image, distance, distance;turntable, estimation;shape, function, hull, human, image, image;approximate, localization, measurement;silhouette, measurement;turning, part, pose;circular, reality;, recognition;virtual, reconstruction;approximation, reconstruction;image, segmentation, segmentation;pose, SHAPE, similarity, synthesis;silhouette, technique;human, theory;cameras;edge, Trajectory}, isbn = {1520-9210}, doi = {10.1109/TMM.2008.2007321}, author = {Yue,Zhanfeng and Chellapa, Rama} } @conference {13683, title = {Unconstrained Language Identification Using AShape Codebook}, booktitle = {The 11th International Conference on Frontiers in Handwritting Recognition (ICFHR 2008)}, year = {2008}, month = {2008///}, pages = {13 - 18}, address = {Montreal, Canada}, abstract = {We propose a novel approach to language identification in document images containing handwriting and machine printed text using image descriptors constructed from a codebook of shape features. We encode local text structures using scale and rotation invariant codewords, each representing a characteristic shape feature that is generic enough to appear repeatably. We learn a concise, structurally indexed shape codebook from training data by clustering similar features and partitioning the feature space by graph cuts. Our approach is segmentation free and easily extensible. We quantitatively evaluate our approach using a large real-world document image collection, which consists of more than 1,500 documents in 8 languages (Arabic, Chinese, English, Hindi, Japanese, Korean, Russian, and Thai) and contains a complex mixture of handwritten and machine printed content. Experimental results demonstrate the robustness and flexibility of our approach, and show exceptional language identification performance that exceeds the state of art.}, author = {Zhu,Guangyu and Yu,Xiaodong and Li,Yi and David Doermann} } @conference {18331, title = {Adaptive Vocabulary Forests br Dynamic Indexing and Category Learning}, booktitle = {Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on}, year = {2007}, month = {2007/10/14/21}, pages = {1 - 8}, publisher = {IEEE}, organization = {IEEE}, abstract = {Histogram pyramid representations computed from a vocabulary tree of visual words have proven valuable for a range of image indexing and recognition tasks; however, they have only used a single, fixed partition of feature space. We present a new efficient algorithm to incrementally compute set-of-trees (forest) vocabulary representations, and show that they improve recognition and indexing performance in methods which use histogram pyramids. Our algorithm incrementally adapts a vocabulary forest with an Inverted file system at the leaf nodes and automatically keeps existing histogram pyramid database entries up-to-date in a forward filesystem. It is possible not only to apply vocabulary tree indexing algorithms directly, but also to compute pyramid match kernel values efficiently. On dynamic recognition tasks where categories or objects under consideration may change over time, we show that adaptive vocabularies offer significant performance advantages in comparison to a single, fixed vocabulary.}, isbn = {978-1-4244-1630-1}, doi = {10.1109/ICCV.2007.4409053}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4409053}, author = {Tom Yeh and Lee,John and Darrell,Trevor} } @book {15194, title = {Applied cryptography and network security: 5th international conference, ACNS 2007, Zhuhai, China, June 5-8, 2007: proceedings}, volume = {4521}, year = {2007}, month = {2007///}, publisher = {Springer-Verlag New York Inc}, organization = {Springer-Verlag New York Inc}, author = {Katz, Jonathan and Yung,M.} } @conference {16448, title = {Bid based scheduler with backfilling for a multiprocessor system}, booktitle = {Proceedings of the ninth international conference on Electronic commerce}, year = {2007}, month = {2007///}, pages = {459 - 468}, author = {Yahav,I. and Raschid, Louiqa and Andrade,H.} } @conference {14207, title = {Combining motion from texture and lines for visual navigation}, booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems, 2007. IROS 2007}, year = {2007}, month = {2007/11/29/Oct. }, pages = {232 - 239}, publisher = {IEEE}, organization = {IEEE}, abstract = {Two novel methods for computing 3D structure information from video for a piecewise planar scene are presented. The first method is based on a new line constraint, which clearly separates the estimation of distance from the estimation of slant. The second method exploits the concepts of phase correlation to compute from the change of image frequencies of a textured plane, distance and slant information. The two different estimates together with structure estimates from classical image motion are combined and integrated over time using an extended Kalman filter. The estimation of the scene structure is demonstrated experimentally in a motion control algorithm that allows the robot to move along a corridor. We demonstrate the efficacy of each individual method and their combination and show that the method allows for visual navigation in textured as well as un-textured environments.}, keywords = {3D structure information, CAMERAS, Computer vision, extended Kalman filter, Frequency, image frequencies, Image motion analysis, Image texture, Kalman filters, Layout, motion control, Motion estimation, Navigation, Optical computing, phase correlation, piecewise planar scene, Robustness, Simultaneous localization and mapping, Speech processing, textured plane, video signal processing, visual navigation}, isbn = {978-1-4244-0912-9}, doi = {10.1109/IROS.2007.4399568}, author = {Bitsakos,K. and Li Yi and Ferm{\"u}ller, Cornelia} } @conference {12351, title = {Compact, low power wireless sensor network system for line crossing recognition}, booktitle = {Circuits and Systems, 2007. ISCAS 2007. IEEE International Symposium on}, year = {2007}, month = {2007///}, pages = {2506 - 2509}, author = {Shen,C. C and Kupershtok,R. and Yang,B. and Vanin,F. M and Shao,X. and Sheth,D. and Goldsman,N. and Balzano,Q. and Bhattacharyya, Shuvra S.} } @article {15508, title = {COMPUTING PERFECT AND STABLE MODELS USING ORDERED MODEL TREES}, journal = {Computational Intelligence}, volume = {11}, year = {2007}, month = {2007/04/02/}, pages = {89 - 112}, abstract = {Ordered model trees were introduced as a normal form for disjunctive deductive databases. They were also used to facilitate the computation of minimal models for disjunctive theories by exploiting the order imposed on the Herbrand base of the theory. In this work we show how the order on the Herbrand base can be used to compute perfect models of a disjunctive stratified finite theory. We are able to compute the stable models of a general finite theory by combining the order on the elements of the Herbrand base with previous results that had shown that the stable models of a theory T can be computed as the perfect models of a corresponding disjunctive theory ɛT resulting from applying the so called evidential transformation to T. While other methods consider many models that are rejected at the end, the use of atom ordering allows us to guarantee that every model generated belongs to the class of models being computed. As for negation-free databases, the ordered tree serves as the canonical representation of the database.}, keywords = {disjunctive database, model tree, ordered model tree, perfect model, stable model}, isbn = {1467-8640}, doi = {10.1111/j.1467-8640.1995.tb00024.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8640.1995.tb00024.x/abstract}, author = {Fern{\'a}ndez1,Jos{\'e} Alberto and Minker, Jack and Yahya,Adnan} } @conference {15462, title = {Covering array sampling of input event sequences for automated gui testing}, booktitle = {Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering}, series = {ASE {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {405 - 408}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes a new automated technique to generate test cases for GUIs by using covering arrays (CAs). The key motivation is to generate long GUI event sequences that are systematically sampled at a particular coverage strength. CAs, to date, have not been effectively used in sampling event driven systems such as GUIs which maintain state. We leverage a "stateless" abstraction of GUIs that allows us to use CAs. Once the CAs have been generated, we reuse the abstractions to reinsert ordering relationships between GUI events, thereby creating executable test cases. A feasibility study on a well-studied GUI-based application shows that the new technique is able to detect a large number of previously undetected faults}, keywords = {covering arrays, event driven software, GUI testing}, isbn = {978-1-59593-882-4}, doi = {10.1145/1321631.1321695}, url = {http://doi.acm.org/10.1145/1321631.1321695}, author = {Xun Yuan and Cohen,Myra and Memon, Atif M.} } @article {18756, title = {Development of in-mold assembly process for realizing mesoscale revolute joints}, journal = {Transactions of North American Manufacturing Research Institution of SME}, volume = {35}, year = {2007}, month = {2007///}, abstract = {In-mold Assembly process at the mesoscalepresents several manufacturing challenges. Results reported in this paper demonstrate the technical feasibility of creating rigid body mesoscale revolute joints using In-Mold Assembly process. The following new results are reported in this paper. First, we describe a mold design with varying cavity shape to perform In-Mold Assembly. This mold design uses an accurate mold piece positioning method to avoid damage to delicate mesoscale parts during the cavity change step. Second, we describe a mold insert fabrication process for making mold inserts with the desired surface characteristics for mesoscale molding. Finally, we describe methods to limit the adhesion at the interfaces and hence create articulated revolute joint. Using the advances reported in this paper we have successfully molded a mesoscale revolute joint. To the best of our knowledge, this is the first demonstration of In-Mold Assembly process using a varying cavity shape mold to create a mesoscale revolute joint. }, url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/pub/Publication/NAMRC07_Ananthanarayanan_draft.pdf}, author = {Ananthanarayanan,A. and Gupta,S.K. and Bruck,H. A. and Yu,Z. and Rajurkar,K. P.} } @conference {15461, title = {Direct-dependency-based software compatibility testing}, booktitle = {Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering}, series = {ASE {\textquoteright}07}, year = {2007}, month = {2007///}, pages = {409 - 412}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Software compatibility testing is an important quality assurance task aimed at ensuring that component-based software systems build and/or execute properly across a broad range of user system configurations. Because each configuration can involve multiple components with different versions, and because there are complex and changing interdependencies between components and their versions, it is generally infeasible to test all potential configurations. Therefore, compatibility testing usually means examining only a handful of default or popular configurations to detect problems, and as a result costly errors can and do escape to the field This paper presents an improved approach to compatibility testing called RACHET. We formally model the configuration space for component-based systems and use the model to generate test plans covering user-specified portion of the space - the example in this paper is covering all it direct dependencies between components. The test plan is executed efficiently in parallel, by distributing work so as to best utilize test resources. We conducted experimentsand simulation studies applying our approach to a large-scale data management middleware system. The results showed that for this system RACHET discovered incompatibilities between components at a small fraction of the cost for exhaustive testing without compromising test quality}, keywords = {compatibility testing, component-based software system}, isbn = {978-1-59593-882-4}, doi = {10.1145/1321631.1321696}, url = {http://doi.acm.org/10.1145/1321631.1321696}, author = {Yoon,Il-Chul and Sussman, Alan and Memon, Atif M. and Porter, Adam} } @conference {14847, title = {Efficiently Determining Silhouette Consistency}, booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on}, year = {2007}, month = {2007/06//}, pages = {1 - 8}, abstract = {Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrated cameras. It is natural to develop an efficient algorithm to determine the consistency of a set of silhouettes before performing time-consuming reconstruction, so that inaccurate silhouettes can be omitted. In this paper we first present a fast algorithm to determine the consistency of three silhouettes from known (but arbitrary) viewing directions, assuming the projection is scaled orthographic. The temporal complexity of the algorithm is linear in the number of points of the silhouette boundaries. We further prove that a set of more than three convex silhouettes are consistent if and only if any three of them are consistent. Another possible application of our approach is to determine the miscalibrated cameras in a large camera system. A consistent subset of cameras can be determined on the fly and miscalibrated cameras can also be recalibrated at a coarse scale. Real and synthesized data are used to demonstrate our results.}, keywords = {camera;scaled, consistency;image, miscalibrated, orthographic, problem;silhouette, projection;shape-from-silhouette, reconstruction;}, doi = {10.1109/CVPR.2007.383161}, author = {Li Yi and Jacobs, David W.} } @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 {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} } @article {14618, title = {Genome-wide expression profiling and bioinformatics analysis of diurnally regulated genes in the mouse prefrontal cortex}, journal = {Genome Biology}, volume = {8}, year = {2007}, month = {2007/11/20/}, pages = {R247 - R247}, abstract = {The prefrontal cortex is important in regulating sleep and mood. Diurnally regulated genes in the prefrontal cortex may be controlled by the circadian system, by sleep:wake states, or by cellular metabolism or environmental responses. Bioinformatics analysis of these genes will provide insights into a wide-range of pathways that are involved in the pathophysiology of sleep disorders and psychiatric disorders with sleep disturbances.}, isbn = {1465-6906}, doi = {10.1186/gb-2007-8-11-r247}, url = {http://genomebiology.com/2007/8/11/R247}, author = {Yang,Shuzhang and Wang,Kai and Valladares,Otto and Hannenhalli, Sridhar and Bucan,Maja} } @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 {13149, title = {Human appearance modeling for matching across video sequences}, journal = {Machine Vision and Applications}, volume = {18}, year = {2007}, month = {2007///}, pages = {139 - 149}, abstract = {We present an appearance model for establishing correspondence between tracks of people which may be taken at different places, at different times or across different cameras. The appearance model is constructed by kernel density estimation. To incorporate structural information and to achieve invariance to motion and pose, besides color features, an additional feature of path-length is used. To achieve illumination invariance, two types of illumination insensitive color features are discussed: brightness color feature and RGB rank feature. The similarity between a test image and an appearance model is measured by the information gain or Kullback{\textendash}Leibler distance. To thoroughly represent the information contained in a video sequence with as little data as possible, a key frame selection and matching scheme is proposed. Experimental results demonstrate the important role of the path-length feature in the appearance model and the effectiveness of the proposed appearance model and matching method.}, author = {Yu,Y. and Harwood,D. and Yoon,K. and Davis, Larry S.} } @article {12918, title = {New records of phytoplankton for Bangladesh. 3. Volvocales}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {14}, year = {2007}, month = {2007/12/01/}, abstract = {This study presents 21 species of Chlamydomonas, four species of Carteria, two species of each of Nephroselmis, Pyramidomonas and Scherffelia, and Collodictyon triciliatum, Polytoma minus, Tetrachloridium ? allorgei and Tetraselmis cordiformis. These species have been reported from some ponds of Mathbaria of Pirojpur and Bakerganj of Barisal districts in Bangladesh.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v14i1.518}, url = {http://www.banglajol.info/bd/index.php/BJPT/article/viewArticle/518}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12917, title = {New records of phytoplankton for Bangladesh. 4. Chlorococcales}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {14}, year = {2007}, month = {2007/12/02/}, abstract = {This study presents three species from each of Schroederia, Monoraphidium and Ankistrodesmus, two species and one variety of Dictyosphaerium, two varieties of Pediastrum, and Tetraedron arthrodesmiforme var. contorta, Chlorotetraedron polymorphum, Myrmecia aquatica, Oocystis tainoensis, Nephrocytium spirale, Kirchneriella irregularis, Coelastrum indicum and Scenedesmus similagineus. These taxa have been reported from some ponds of Mathbaria of Pirojpur and Bakerganj of Barisal Districts in Bangladesh.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v14i2.528}, url = {http://www.banglajol.info/bd/index.php/BJPT/article/viewArticle/528}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasim,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {14238, title = {Object detection using a shape codebook}, journal = {British Machine Vision Conference}, volume = {4}, year = {2007}, month = {2007///}, abstract = {This paper presents a method for detecting categories of objects in real-worldimages. Given training images of an object category, our goal is to recognize and localize instances of those objects in a candidate image. The main contribution of this work is a novel structure of the shape code- book for object detection. A shape codebook entry consists of two compo- nents: a shape codeword and a group of associated vectors that specify the object centroids. Like their counterpart in language, the shape codewords are simple and generic such that they can be easily extracted from most object categories. The associated vectors store the geometrical relationships be- tween the shape codewords, which specify the characteristics of a particular object category. Thus they can be considered as the {\textquotedblleft}grammar{\textquotedblright} of the shape codebook. In this paper, we use Triple-Adjacent-Segments (TAS) extracted from im- age edges as the shape codewords. Object detection is performed in a prob- abilistic voting framework. Experimental results on public datasets show performance similiar to the state-of-the-art, yet our method has significantly lower complexity and requires considerably less supervision in the training (We only need bounding boxes for a few training samples, do not need fig- ure/ground segmentation and do not need a validation dataset). }, author = {Yu,X. and Yi,L. and Ferm{\"u}ller, Cornelia and David Doermann} } @conference {13611, title = {Object Detection Using Shape Codebook}, booktitle = {British Machine Vision Conference (BMVC{\textquoteright}07)}, year = {2007}, month = {2007/12//}, publisher = {BMVC07}, organization = {BMVC07}, abstract = {This paper presents a method for detecting categories of objects in real-world images. Given training images of an object category, our goal is to recognize and localize instances of those objects in a candidate image. The main contribution of this work is a novel structure of the shape codebook for object detection. A shape codebook entry consists of two components: a shape codeword and a group of associated vectors that specify the object centroids. Like their counterpart in language, the shape codewords are simple and generic such that they can be easily extracted from most object categories. The associated vectors store the geometrical relationships between the shape codewords, which specify the characteristics of a particular object category. Thus they can be considered as the {\textquotedblleft}grammar{\textquotedblright} of the shape codebook. In this paper, we use Triple-Adjacent-Segments (TAS) extracted from image edges as the shape codewords. Object detection is performed in a probabilistic voting framework. Experimental results on public datasets show performance similar to the state-of-the-art, yet our method has significantly lower complexity and requires considerably less supervision in the training (We only need bounding boxes for a few training samples, do not need figure/ground segmentation and do not need a validation dataset).}, author = {Yu,Xiaodong and Li,Yi and Ferm{\"u}ller, Cornelia and David Doermann} } @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} } @conference {18886, title = {Probabilistic go theories}, year = {2007}, month = {2007///}, abstract = {There are numerous cases where we need to rea- son about vehicles whose intentions and itineraries are not known in advance to us. For example, Coast Guard agents tracking boats don{\textquoteright}t always know where they are headed. Likewise, in drug en- forcement applications, it is not always clear where drug-carrying airplanes (which do often show up on radar) are headed, and how legitimate planes with an approved flight manifest can avoid them. Likewise, traffic planners may want to understand how many vehicles will be on a given road at a given time. Past work on reasoning about vehi- cles (such as the {\textquotedblleft}logic of motion{\textquotedblright} by Yaman et. al. [Yaman et al., 2004]) only deals with vehicles whose plans are known in advance and don{\textquoteright}t cap- ture such situations. In this paper, we develop a for- mal probabilistic extension of their work and show that it captures both vehicles whose itineraries are known, and those whose itineraries are not known. We show how to correctly answer certain queries against a set of statements about such vehicles. A prototype implementation shows our system to work efficiently in practice.}, url = {http://www.aaai.org/Papers/IJCAI/2007/IJCAI07-079.pdf}, author = {Parker,A. and Yaman,F. and Nau, Dana S. and V.S. Subrahmanian} } @article {15476, title = {Reliable Effects Screening: A Distributed Continuous Quality Assurance Process for Monitoring Performance Degradation in Evolving Software Systems}, journal = {Software Engineering, IEEE Transactions on}, volume = {33}, year = {2007}, month = {2007/02//}, pages = {124 - 141}, abstract = {Developers of highly configurable performance-intensive software systems often use in-house performance-oriented "regression testing" to ensure that their modifications do not adversely affect their software{\textquoteright}s performance across its large configuration space. Unfortunately, time and resource constraints can limit in-house testing to a relatively small number of possible configurations, followed by unreliable extrapolation from these results to the entire configuration space. As a result, many performance bottlenecks escape detection until systems are fielded. In our earlier work, we improved the situation outlined above by developing an initial quality assurance process called "main effects screening". This process 1) executes formally designed experiments to identify an appropriate subset of configurations on which to base the performance-oriented regression testing, 2) executes benchmarks on this subset whenever the software changes, and 3) provides tool support for executing these actions on in-the-field and in-house computing resources. Our initial process had several limitations, however, since it was manually configured (which was tedious and error-prone) and relied on strong and untested assumptions for its accuracy (which made its use unacceptably risky in practice). This paper presents a new quality assurance process called "reliable effects screening" that provides three significant improvements to our earlier work. First, it allows developers to economically verify key assumptions during process execution. Second, it integrates several model-driven engineering tools to make process configuration and execution much easier and less error prone. Third, we evaluate this process via several feasibility studies of three large, widely used performance-intensive software frameworks. Our results indicate that reliable effects screening can detect performance degradation in large-scale systems more reliably and with significantly less resources than conventional t- echniques}, keywords = {configuration subset, distributed continuous quality assurance process, evolving software systems, in house testing, main effects screening, performance bottlenecks, performance degradation monitoring, performance intensive software systems, process configuration, process execution, program testing, regression testing, reliable effects screening, software benchmarks, Software performance, software performance evaluation, Software quality, software reliability, tool support}, isbn = {0098-5589}, doi = {10.1109/TSE.2007.20}, author = {Yilmaz,C. and Porter, Adam and Krishna,A. S and Memon, Atif M. and Schmidt,D. C and Gokhale,A.S. and Natarajan,B.} } @article {13400, title = {Report on the Fourth International Workshop on Data Management for Sensor Networks (DMSN 2007)}, journal = {SIGMOD Rec.}, volume = {36}, year = {2007}, month = {2007/12//}, pages = {53 - 55}, abstract = {Sensor networks enable an unprecedented level of access to the physical world, and hold tremendous potential to revolutionize many application domains. Research on sensor networks spans many areas of computer science, and there are now major conferences, e.g., IPSN and SenSys, devoted to sensor networks. However, there is no focused forum for discussion of early and innovative work on data management in sensor networks. The International Workshop on Data Management for Sensor Networks (DMSN), inaugurated in 2004, aims to fill this significant gap in the database and sensor network communities.}, isbn = {0163-5808}, doi = {10.1145/1361348.1361362}, url = {http://doi.acm.org/10.1145/1361348.1361362}, author = {Balazinska,Magdalena and Deshpande, Amol and Labrinidis,Alexandros and Luo,Qiong and Madden,Samuel and Yang,Jun} } @article {15125, title = {Scalable protocols for authenticated group key exchange}, journal = {Journal of Cryptology}, volume = {20}, year = {2007}, month = {2007///}, pages = {85 - 113}, abstract = {We consider the problem of authenticated group key exchange among n parties communicating over an insecure public network. A number of solutions to this problem have been proposed; however, all prior provably secure solutions do not scale well and, in particular, require O(n) rounds. Our main contribution is the first scalable protocol for this problem along with a rigorous proof of security in the standard model under the DDH assumption; our protocol uses a constant number of rounds and requires only O(1) "full" modular exponentiations per user. Toward this goal (and adapting work of Bellare, Canetti, and Krawczyk), we first present an efficient compiler that transforms any group key-exchange protocol secure against a passive eavesdropper to an authenticated protocol which is secure against an active adversary who controls all communication in the network. This compiler adds only one round and O(1) communication (per user) to the original scheme. We then prove secure{\textemdash}against a passive adversary{\textemdash}a variant of the two-round group key-exchange protocol of Burmester and Desmedt. Applying our compiler to this protocol results in a provably secure three-round protocol for authenticated group key exchange which also achieves forward secrecy.}, doi = {10.1007/s00145-006-0361-5}, author = {Katz, Jonathan and Yung,M.} } @conference {13136, title = {Segmentation using Meta-texture Saliency}, booktitle = {Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on}, year = {2007}, month = {2007/10//}, pages = {1 - 8}, abstract = {We address segmentation of an image into patches that have an underlying salient surface-roughness. Three intrinsic images are derived: reflectance, shading and meta- texture images. A constructive approach is proposed for computing a meta-texture image by preserving, equalizing and enhancing the underlying surface-roughness across color, brightness and illumination variations. We evaluate the performance on sample images and illustrate quantitatively that different patches of the same material, in an image, are normalized in their statistics despite variations in color, brightness and illumination. Finally, segmentation by line-based boundary-detection is proposed and results are provided and compared to known algorithms.}, keywords = {analysis;image, colour, enhancement;image, image, image;salient, patches;image, segmentation;image, segmentation;meta-texture, surface-roughness;image, texture;}, doi = {10.1109/ICCV.2007.4408930}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {15475, title = {Skoll: A Process and Infrastructure for Distributed Continuous Quality Assurance}, journal = {Software Engineering, IEEE Transactions on}, volume = {33}, year = {2007}, month = {2007/08//}, pages = {510 - 525}, abstract = {Software engineers increasingly emphasize agility and flexibility in their designs and development approaches. They increasingly use distributed development teams, rely on component assembly and deployment rather than green field code writing, rapidly evolve the system through incremental development and frequent updating, and use flexible product designs supporting extensive end-user customization. While agility and flexibility have many benefits, they also create an enormous number of potential system configurations built from rapidly changing component implementations. Since today{\textquoteright}s quality assurance (QA) techniques do not scale to handle highly configurable systems, we are developing and validating novel software QA processes and tools that leverage the extensive computing resources of user and developer communities in a distributed, continuous manner to improve software quality significantly. This paper provides several contributions to the study of distributed, continuous QA (DCQA). First, it shows the structure and functionality of Skoll, which is an environment that defines a generic around-the-world, around-the-clock QA process and several sophisticated tools that support this process. Second, it describes several novel QA processes built using the Skoll environment. Third, it presents two studies using Skoll: one involving user testing of the Mozilla browser and another involving continuous build, integration, and testing of the ACE+TAO communication software package. The results of our studies suggest that the Skoll environment can manage and control distributed continuous QA processes more effectively than conventional QA processes. For example, our DCQA processes rapidly identified problems that had taken the ACE+TAO developers much longer to find and several of which they had not found. Moreover, the automatic analysis of QA results provided developers information that enabled them to quickly find the root causes of problems}, keywords = {ACE+TAO communication software package, component assembly, component deployment, distributed continuous quality assurance, distributed development teams, distributed processing, end-user customization, flexible product design, incremental development, object-oriented programming, Skoll, software engineering, Software quality, systems analysis}, isbn = {0098-5589}, doi = {10.1109/TSE.2007.70719}, author = {Porter, Adam and Yilmaz,C. and Memon, Atif M. and Schmidt,D. C and Natarajan,B.} } @conference {15469, title = {Using GUI Run-Time State as Feedback to Generate Test Cases}, booktitle = {Software Engineering, 2007. ICSE 2007. 29th International Conference on}, year = {2007}, month = {2007/05//}, pages = {396 - 405}, abstract = {This paper presents a new automated model-driven technique to generate test cases by using feedback from the execution of a "seed test suite" on an application under test (AUT). The test cases in the seed suite are designed to be generated automatically and executed very quickly. During their execution, feedback obtained from the AUT{\textquoteright}s run-time state is used to generate new, "improved" test cases. The new test cases subsequently become part of the seed suite. This "anytime technique" continues iteratively, generating and executing additional test cases until resources are exhausted or testing goals have been met. The feedback-based technique is demonstrated for automated testing of graphical user interfaces (GUIs). An existing abstract model of the GUI is used to automatically generate the seed test suite. It is executed; during its execution, state changes in the GUI pinpoint important relationships between GUI events, which evolve the model and help to generate new test cases. Together with a reverse- engineering algorithm used to obtain the initial model and seed suite, the feedback-based technique yields a fully automatic, end-to-end GUI testing process. A feasibility study on four large fielded open-source software (OSS) applications demonstrates that this process is able to significantly improve existing techniques and help identify/report serious problems in the OSS. In response, these problems have been fixed by the developers of the OSS in subsequent versions.}, keywords = {application under test, automated test case generation, Feedback, feedback-based technique, Graphical user interfaces, GUI run-time state, model-driven technique, open-source software, program testing, public domain software, reverse engineering, reverse-engineering algorithm, seed test suite}, doi = {10.1109/ICSE.2007.94}, author = {Xun Yuan and Memon, Atif M.} } @article {13170, title = {Appearance-based person recognition using color/path-length profile}, journal = {Journal of Visual Communication and Image Representation}, volume = {17}, year = {2006}, month = {2006///}, pages = {605 - 622}, author = {Yoon,K. and Harwood,D. and Davis, Larry S.} } @article {15124, title = {Characterization of security notions for probabilistic private-key encryption}, journal = {Journal of Cryptology}, volume = {19}, year = {2006}, month = {2006///}, pages = {67 - 95}, abstract = {The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptography. Here, we focus on the case of private-key encryption. Extending security notions from the public-key setting, we define security in the sense of both indistinguishability and non-malleability against chosen-plaintext and chosen-ciphertext attacks, considering both non-adaptive (i.e., {\textquoteleft}{\textquoteleft}lunchtime{\textquoteright}{\textquoteright}) and adaptive oracle access (adaptive here refers to an adversary{\textquoteright}s ability to interact with a given oracle even after viewing the challenge ciphertext). We then characterize the 18 resulting security notions in two ways. First, we construct a complete hierarchy of security notions; that is, for every pair of definitions we show whether one definition is stronger than the other, whether the definitions are equivalent, or whether they are incomparable. Second, we partition these notions of security into two classes (computational or information-theoretic) depending on whether one-way functions are necessary in order for encryption schemes satisfying the definition to exist. Perhaps our most surprising result is that security against adaptive chosen-plaintext attack is (polynomially) equivalent to security against non-adaptive chosen-plaintext attack. On the other hand, the ability of an adversary to mount a (non-adaptive) chosen-plaintext attack is the key feature distinguishing computational and information-theoretic notions of security. These results hold for all security notions considered here.}, doi = {10.1007/s00145-005-0310-8}, author = {Katz, Jonathan and Yung,M.} } @article {16315, title = {Covering arrays for efficient fault characterization in complex configuration spaces}, journal = {IEEE Transactions on Software Engineering}, year = {2006}, month = {2006///}, pages = {20 - 34}, author = {Yilmaz,C. and Cohen,M. B and Porter, Adam} } @article {13162, title = {Detection and analysis of hair}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {28}, year = {2006}, month = {2006/07//}, pages = {1164 - 1169}, abstract = {We develop computational models for measuring hair appearance for comparing different people. The models and methods developed have applications to person recognition and image indexing. An automatic hair detection algorithm is described and results reported. A multidimensional representation of hair appearance is presented and computational algorithms are described. Results on a data set of 524 subjects are reported. Identification of people using hair attributes is compared to eigenface-based recognition along with a joint, eigenface-hair-based identification}, keywords = {analysis;hair, appearance;image, AUTOMATIC, detection;, detection;hair, extraction;image, hair, indexing;multidimensional, recognition;face, recognition;feature, representation;object, representation;person}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2006.139}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {14920, title = {Development of a Large-Scale Integrated Neurocognitive Architecture - Part 2: Design and Architecture}, volume = {UMIACS-TR-2006-43}, year = {2006}, month = {2006/10//}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {In Part 1 of this report, we outlined a framework for creating an intelligent agentbased upon modeling the large-scale functionality of the human brain. Building on those results, we begin Part 2 by specifying the behavioral requirements of a large-scale neurocognitive architecture. The core of our long-term approach remains focused on creating a network of neuromorphic regions that provide the mechanisms needed to meet these requirements. However, for the short term of the next few years, it is likely that optimal results will be obtained by using a hybrid design that also includes symbolic methods from AI/cognitive science and control processes from the field of artificial life. We accordingly propose a three-tiered architecture that integrates these different methods, and describe an ongoing computational study of a prototype {\textquoteright}mini-Roboscout{\textquoteright} based on this architecture. We also examine the implications of some non-standard computational methods for developing a neurocognitive agent. This examination included computational experiments assessing the effectiveness of genetic programming as a design tool for recurrent neural networks for sequence processing, and experiments measuring the speed-up obtained for adaptive neural networks when they are executed on a graphical processing unit (GPU) rather than a conventional CPU. We conclude that the implementation of a large-scale neurocognitive architecture is feasible, and outline a roadmap for achieving this goal. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/3957}, author = {Reggia, James A. and Tagamets,M. and Contreras-Vidal,J. and Jacobs, David W. and Weems,S. and Naqvi,W. and Winder,R. and Chabuk,T. and Jung,J. and Yang,C.} } @article {13159, title = {Employing the Hand as an Interface Device}, journal = {Journal of Multimedia}, volume = {1}, year = {2006}, month = {2006/11/01/}, abstract = {We propose algorithms and applications for using the hand as an interface device in virtual and physical spaces. In virtual drawing, by tracking the hand in 3-D and estimating a virtual plane in space, the intended drawing of user is recognized. In a virtual marble game, the instantaneous orientation of the hand is simulated to render a graphical scene of the game board. Real-time visual feedback allows the user to navigate a virtual ball in a maze. In 3-D model construction, the system tracks the hand motion in space while the user is traversing edges of a physical object. The object is then rendered virtually by the computer. These applications involve estimating the 3-D absolute position and/or orientation of the hand in space. We propose parametric modelling of the central region of the hand to extract this information. A stereo camera is used to first build a preliminary disparity map of the hand. Then, the best fitting plane to the disparity points is computed using robust estimation. The 3-D hand plane is calculated based on the disparity plane and the position and orientation parameters of the hand. Tracking the hand region over a sequence of frames and coping with noise using robust modelling of the hand motion enables estimating the trajectory of the hand in space. The algorithms are real-time and experiments are presented to demonstrate the proposed applications of using the hand as an interface device.}, isbn = {1796-2048}, doi = {10.4304/jmm.1.7.18-29}, url = {http://www.ojs.academypublisher.com/index.php/jmm/article/viewArticle/01071829}, author = {Sepehri,Afshin and Yacoob,Yaser and Davis, Larry S.} } @article {18300, title = {Employing the hand as an interface device}, journal = {Journal of Multimedia}, volume = {1}, year = {2006}, month = {2006///}, pages = {18 - 29}, author = {Sepehri,A. and Yacoob,Yaser and Davis, Larry S.} } @inbook {14693, title = {Existential Label Flow Inference Via CFL Reachability}, booktitle = {Static AnalysisStatic Analysis}, series = {Lecture Notes in Computer Science}, volume = {4134}, year = {2006}, month = {2006///}, pages = {88 - 106}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {In programming languages, existential quantification is useful for describing relationships among members of a structured type. For example, we may have a list in which there exists some mutual exclusion lock l in each list element such that l protects the data stored in that element. With this information, a static analysis can reason about the relationship between locks and locations in the list even when the precise identity of the lock and/or location is unknown. To facilitate the construction of such static analyses, this paper presents a context-sensitive label flow analysis algorithm with support for existential quantification. Label flow analysis is a core part of many static analysis systems. Following Rehof et al, we use context-free language (CFL) reachability to develop an efficient O(n 3) label flow inference algorithm. We prove the algorithm sound by reducing its derivations to those in a system based on polymorphically-constrained types, in the style of Mossin. We have implemented a variant of our analysis as part of a data race detection tool for C programs.}, isbn = {978-3-540-37756-6}, url = {http://dx.doi.org/10.1007/11823230_7}, author = {Pratikakis,Polyvios and Foster, Jeffrey S. and Hicks, Michael W.}, editor = {Yi,Kwangkeun} } @conference {16087, title = {Exploring erotics in Emily Dickinson{\textquoteright}s correspondence with text mining and visual interfaces}, booktitle = {Proceedings of the 6th ACM/IEEE-CS joint conference on Digital libraries}, series = {JCDL {\textquoteright}06}, year = {2006}, month = {2006///}, pages = {141 - 150}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes a system to support humanities scholars in their interpretation of literary work. It presents a user interface and web architecture that integrates text mining, a graphical user interface and visualization, while attempting to remain easy to use by non specialists. Users can interactively read and rate documents found in a digital libraries collection, prepare training sets, review results of classification algorithms and explore possible indicators and explanations. Initial evaluation steps suggest that there is a rationale for "provocational" text mining in literary interpretation.}, keywords = {case studies, humanities, literary criticism, text mining, user interface, Visualization}, isbn = {1-59593-354-9}, doi = {10.1145/1141753.1141781}, url = {http://doi.acm.org/10.1145/1141753.1141781}, author = {Plaisant, Catherine and Rose,James and Yu,Bei and Auvil,Loretta and Kirschenbaum,Matthew G. and Smith,Martha Nell and Clement,Tanya and Lord,Greg} } @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 {15681, title = {Fuzzy svm ensembles for relevance feedback in image retrieval}, journal = {Image and Video Retrieval}, year = {2006}, month = {2006///}, pages = {350 - 359}, author = {Rao,Y. and Mundur, Padma and Yesha,Y.} } @article {18345, title = {IDiexis: Mobile image-based search on world wide web-a picture is worth a thousand keywords}, journal = {Proc. of Mobisys}, year = {2006}, month = {2006///}, abstract = {Images of objects as queries is a new approach to searchfor information on the web. Image-based information retrieval goes beyond only matching images, as information in other modalities also can be extracted from data collections using image search. We demonstrate a new system that uses images to search for web-based information. We introduce a point-by-photograph paradigm, where users can specify an object simply by taking pictures. Our technique uses content-based image retrieval methods to search the web or other databases for matching images and their source pages to find relevant location-based information. We have developed a prototype on a camera phone and conducted user studies to demonstrate the efficacy of our approach compared to other alternatives. }, author = {Tollmar,K. and Tom Yeh and Darrell,T.} } @article {14081, title = {Molecular Characterization of Serine-, Alanine-, and Proline-Rich Proteins of Trypanosoma cruzi and Their Possible Role in Host Cell Infection}, journal = {Infect. Immun.}, volume = {74}, year = {2006}, month = {2006/03/01/}, pages = {1537 - 1546}, abstract = {We previously reported the isolation of a novel protein gene family, termed SAP (serine-, alanine-, and proline-rich protein), from Trypanosoma cruzi. Aided by the availability of the completed genome sequence of T. cruzi, we have now identified 39 full-length sequences of SAP, six pseudogenes and four partial genes. SAPs share a central domain of about 55 amino acids and can be divided into four groups based on their amino (N)- and carboxy (C)-terminal sequences. Some SAPs have conserved N- and C-terminal domains encoding a signal peptide and a glycosylphosphatidylinositol anchor addition site, respectively. Analysis of the expression of SAPs in metacyclic trypomastigotes by two-dimensional electrophoresis and immunoblotting revealed that they are likely to be posttranslationally modified in vivo. We have also demonstrated that some SAPs are shed into the extracellular medium. The recombinant SAP exhibited an adhesive capacity toward mammalian cells, where binding was dose dependent and saturable, indicating a possible ligand-receptor interaction. SAP triggered the host cell Ca2+ response required for parasite internalization. A cell invasion assay performed in the presence of SAP showed inhibition of internalization of the metacyclic forms of the CL strain. Taken together, these results show that SAP is involved in the invasion of mammalian cells by metacyclic trypomastigotes, and they confirm the hypothesis that infective trypomastigotes exploit an arsenal of surface glycoproteins and shed proteins to induce signaling events required for their internalization.}, doi = {

10.1128/IAI.74.3.1537-1546.2006

}, url = {http://iai.asm.org/cgi/content/abstract/74/3/1537}, author = {Baida,Renata C. P. and Santos,Marcia R. M. and Carmo,Mirian S. and Yoshida,Nobuko and Ferreira,Danielle and Ferreira,Alice Teixeira and El Sayed,Najib M. and Andersson,Bjorn and da Silveira,Jose Franco} } @conference {12619, title = {Moving Object Verification from Airborne Video}, booktitle = {Computer Vision Systems, 2006 ICVS {\textquoteright}06. IEEE International Conference on}, year = {2006}, month = {2006/01//}, pages = {29 - 29}, abstract = {This paper presents an end-to-end verification system for moving objects in airborne video. Lacking prior training data, the object information is collected on the fly from a short real-time learning sequence. Using a sample selection module, the system selects samples from the learning sequence and stores them in an exemplar database. To handle appearance change due to potentially large aspect angle variations, a homography-based view synthesis method is used to generate a novel view of each image in the exemplar database at the same pose as the query object in each frame of a query sequence. A spatial match score is obtained using a Distance Transform to compare the novel view and query object. After looping over all query frames, the set of match scores is passed to a temporal analysis module to examine the behavior of the query object, and calculate a final likelihood. Very good verification performance is achieved over thousands of trials for both color and infrared video sequences using the proposed system.}, doi = {10.1109/ICVS.2006.42}, author = {Yue,Zhanfeng and Chellapa, Rama and Guarino, D.} } @conference {13168, title = {Parametric Hand Tracking for Recognition of Virtual Drawings}, booktitle = {Computer Vision Systems, 2006 ICVS {\textquoteright}06. IEEE International Conference on}, year = {2006}, month = {2006/01//}, pages = {6 - 6}, abstract = {A hand tracking system for recognition of virtual spatial drawings is presented. Using a stereo camera, the 3D position of the hand in space is estimated. Then, by tracking the central region of the hand in 3D and estimating a virtual plane in space, the intended drawing of the user is recognized. Experimental results demonstrate the accuracy and effectiveness of this technique. The system can be used to communicate drawings and alphabets to a computer where a classifier can transform the drawn alphabets into interpretable characters.}, doi = {10.1109/ICVS.2006.50}, author = {Sepehri,A. and Yacoob,Yaser and Davis, Larry S.} } @conference {13841, title = {PCFGs with syntactic and prosodic indicators of speech repairs}, booktitle = {Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics}, series = {ACL-44}, year = {2006}, month = {2006///}, pages = {161 - 168}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {A grammatical method of combining two kinds of speech repair cues is presented. One cue, prosodic disjuncture, is detected by a decision tree-based ensemble classifier that uses acoustic cues to identify where normal prosody seems to be interrupted (Lickley, 1996). The other cue, syntactic parallelism, codifies the expectation that repairs continue a syntactic category that was left unfinished in the reparandum (Levelt, 1983). The two cues are combined in a Treebank PCFG whose states are split using a few simple tree transformations. Parsing performance on the Switchboard and Fisher corpora suggests that these two cues help to locate speech repairs in a synergistic way.}, doi = {10.3115/1220175.1220196}, url = {http://dx.doi.org/10.3115/1220175.1220196}, author = {Hale,John and Shafran,Izhak and Yung,Lisa and Dorr, Bonnie J and Harper,Mary and Krasnyanskaya,Anna and Lease,Matthew and Liu,Yang and Roark,Brian and Snover,Matthew and Stewart,Robin} } @conference {13849, title = {Reranking for Sentence Boundary Detection in Conversational Speech}, booktitle = {2006 IEEE International Conference on Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings}, volume = {1}, year = {2006}, month = {2006/05/14/19}, pages = {I-I - I-I}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present a reranking approach to sentence-like unit (SU) boundary detection, one of the EARS metadata extraction tasks. Techniques for generating relatively small n-best lists with high oracle accuracy are presented. For each candidate, features are derived from a range of information sources, including the output of a number of parsers. Our approach yields significant improvements over the best performing system from the NIST RT-04F community evaluation}, keywords = {Automatic speech recognition, conversational speech, data mining, Ear, EARS metadata extraction tasks, Feature extraction, hidden Markov models, meta data, Model driven engineering, NIST, NIST RT-04F community evaluation, oracle accuracy, performance evaluation, reranking, sentence-like unit boundary detection, Speech processing, Speech recognition, Telephony}, isbn = {1-4244-0469-X}, doi = {10.1109/ICASSP.2006.1660078}, author = {Roark,B. and Liu,Yang and Harper,M. and Stewart,R. and Lease,M. and Snover,M. and Shafran,I. and Dorr, Bonnie J and Hale,J. and Krasnyanskaya,A. and Yung,L.} } @article {14641, title = {Retroviral DNA Integration: Viral and Cellular Determinants of Target-Site Selection}, journal = {PLoS PathogPLoS Pathog}, volume = {2}, year = {2006}, month = {2006/06/23/}, pages = {e60 - e60}, abstract = {Retroviruses differ in their preferences for sites for viral DNA integration in the chromosomes of infected cells. Human immunodeficiency virus (HIV) integrates preferentially within active transcription units, whereas murine leukemia virus (MLV) integrates preferentially near transcription start sites and CpG islands. We investigated the viral determinants of integration-site selection using HIV chimeras with MLV genes substituted for their HIV counterparts. We found that transferring the MLV integrase (IN) coding region into HIV (to make HIVmIN) caused the hybrid to integrate with a specificity close to that of MLV. Addition of MLV gag (to make HIVmGagmIN) further increased the similarity of target-site selection to that of MLV. A chimeric virus with MLV Gag only (HIVmGag) displayed targeting preferences different from that of both HIV and MLV, further implicating Gag proteins in targeting as well as IN. We also report a genome-wide analysis indicating that MLV, but not HIV, favors integration near DNase I{\textendash}hypersensitive sites (i.e., +/- 1 kb), and that HIVmIN and HIVmGagmIN also favored integration near these features. These findings reveal that IN is the principal viral determinant of integration specificity; they also reveal a new role for Gag-derived proteins, and strengthen models for integration targeting based on tethering of viral IN proteins to host proteins.}, doi = {10.1371/journal.ppat.0020060}, url = {UR - http://dx.plos.org/10.1371/journal.ppat.0020060,http://dx.plos.org/10.1371/journal.ppat.0020060}, author = {Lewinski,Mary K and Yamashita,Masahiro and Emerman,Michael and Ciuffi,Angela and Marshall,Heather and Crawford,Gregory and Collins,Francis and Shinn,Paul and Leipzig,Jeremy and Hannenhalli, Sridhar and Berry,Charles C and Ecker,Joseph R and Bushman,Frederic D.} } @conference {12272, title = {A scalable key management and clustering scheme for ad hoc networks}, booktitle = {Proceedings of the 1st international conference on Scalable information systems}, series = {InfoScale {\textquoteright}06}, year = {2006}, month = {2006///}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper describes a scalable key management and clustering scheme for secure group communications in ad hoc and sensor networks. The scalability problem is solved by partitioning the communicating devices into subgroups, with a leader in each subgroup, and further organizing the subgroups into hierarchies. Each level of the hierarchy is called a tier or layer. Key generation, distribution, and actual data transmissions follow the hierarchy. The Distributed, Efficient Clustering Approach (DECA) provides robust clustering to form subgroups, and analytical and simulation results demonstrate that DECA is energy-efficient and resilient against node mobility. Comparing with most other schemes, our approach is extremely scalable and efficient, provides more security guarantees, and is selective, adaptive and robust.}, isbn = {1-59593-428-6}, doi = {10.1145/1146847.1146875}, url = {http://doi.acm.org/10.1145/1146847.1146875}, author = {Li,Jason H. and Levy,Renato and Yu,Miao and Bhattacharjee, Bobby} } @article {13171, title = {Segmentation of planar objects and their shadows in motion sequences}, journal = {International journal of computer vision}, volume = {67}, year = {2006}, month = {2006///}, pages = {53 - 69}, abstract = {We investigate segmentation of planar objects and their cast shadows in image sequences. Given two moving image regions in an image sequence we present an algorithm for determining if the two moving regions can be interpreted as a planar object and its cast shadow. Projective geometry and motion properties are employed to directly recover a homology that constrains point correspondences of the outlines of the image regions and determine if they obey an object/shadow relationship. This homology is derived directly from the motions of the regions and therefore is easier to accomplish than determining point-to-point correspondences between candidate object-shadow pairs. Several experiments under approximate point light source illumination are presented.}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {13648, title = {SOFTCBIR: Object Searching in Videos Combining Keypoint Matching and Graduated Assignment}, volume = {LAMP-TR-132,CAR-TR-1013,CS-TR-4804,UMIACS-TR-2006-25}, year = {2006}, month = {2006/05//}, institution = {University of Maryland, College Park}, abstract = {This paper proposes a new approach to object searching in video databases, SoftCBIR, which combines a keypoint matching algorithm and a graduated assignment algorithm based on softassign. Compared with previous approaches, SoftCBIR is an innovative combination of two powerful techniques: 1) An energy minimization algorithm is applied to match two groups of keypoints while accounting for both their similarity in descriptor space and the consistency of their geometric configuration. The algorithm computes correspondence and pose transformation between two groups of keypoints iteratively and alternately toward an optimal result. The objective energy function combines normalized distance errors in descriptor space and in the spatial domain. 2) Initial individual keypoint matching relies on Approximate K-Nearest Neighbor (ANN) search. ANN achieves much more accurate initial keypoint matching results in the descriptor space than K-means labeling. Experiments prove the effectiveness of our approach, and demonstrate the performance improvements rising from the combination of the two proposed techniques in the SoftCBIR algorithm. The support of this research by the Department of Defense under contract MDA-9040-2C-0406 is gratefully acknowledged.}, author = {Luo,Ming and DeMenthon,Daniel and Yu,Xiaodong and David Doermann} } @article {15487, title = {Techniques and processes for improving the quality and performance of open-source software}, journal = {Software Process: Improvement and Practice}, volume = {11}, year = {2006}, month = {2006///}, pages = {163 - 176}, abstract = {Open-source development processes have emerged as an effective approach to reduce cycle-time and decrease design, implementation, and quality assurance (QA) costs for certain types of software, particularly systems infrastructure software, such as operating systems (OS), compilers and language processing tools, text and drawing editors, and middleware. This article presents two contributions to the study of open-source software processes. First, we describe key challenges of open-source software and illustrate how QA processes{\textemdash}specifically those tailored to open-source development{\textemdash}help mitigate these challenges better than traditional closed-source processes do. Second, we summarize results of empirical studies that evaluate how our Skoll distributed continuous quality assurance (DCQA) techniques and processes help to resolve key challenges in developing and validating open-source software. Our results show that: (a) using models to configure and guide the DCQA process improves developer understanding of open-source software, (b) improving the diversity of platform configurations helps QA engineers find defects missed during conventional testing, and (c) centralizing control of QA activities helps to eliminate redundant work. Copyright {\textcopyright} 2006 John Wiley \& Sons, Ltd.}, keywords = {distributed continuous quality assurance, open-source software development and testing}, isbn = {1099-1670}, doi = {10.1002/spip.260}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spip.260/abstract}, author = {Porter, Adam and Yilmaz,Cemal and Memon, Atif M. and Krishna,Arvind S. and Schmidt,Douglas C. and Gokhale,Aniruddha} } @conference {17895, title = {And away we go: understanding the complexity of launching complex HPC applications}, 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 = {45 - 49}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Although not well-studied, launching HPC applications is extremely complex. To better understand the launching process, we conducted a simple case study. Based in part on this study and an examination of existing toolkits, we have begun to develop a prototype environment to support HPC application launching.}, keywords = {development, high-performance, Productivity, software}, isbn = {1-59593-117-1}, doi = {10.1145/1145319.1145333}, url = {http://doi.acm.org/10.1145/1145319.1145333}, author = {Yoon,Il-Chul and Sussman, Alan and Porter, Adam} } @article {18893, title = {Applications of SHOP and SHOP2}, journal = {Intelligent Systems, IEEE}, volume = {20}, year = {2005}, month = {2005/04//march}, pages = {34 - 41}, abstract = {We design the simple hierarchical ordered planner (SHOP) and its successor, SHOP2, with two goals in mind: to investigate research issues in automated planning and to provide some simple, practical planning tools. SHOP and SHOP2 are based on a planning formalism called hierarchical task network planning. SHOP and SHOP2 use a search-control strategy called ordered task decomposition, which breaks tasks into subtasks and generates the plan{\textquoteright}s actions in the same order that the plan executor executes them. So, throughout the planning process, the planner can tell what the state of the world at each step of the plan.}, keywords = {automated planning, hierarchical task network planning, ordered task decomposition, planning (artificial intelligence), problem solving, search-control strategy, simple hierarchical ordered planner, trees (mathematics), uncertainty handling}, isbn = {1541-1672}, doi = {10.1109/MIS.2005.20}, author = {Nau, Dana S. and Au,T.-C. and Ilghami,O. and Kuter,U. and Wu,D. and Yaman,F. and Munoz-Avila,H. and Murdock,J. W.} } @article {14029, title = {Bayesian filtering and integral image for visual tracking}, journal = {Proceedings of the Worshop on Image Analysis for Multimedia Interactive Services (WIAMIS{\textquoteright}05)}, year = {2005}, month = {2005///}, abstract = {This paper describes contributions to two problems related tovisual tracking: control model design and observation process design. We describe the use of kernel-based Bayesian filtering for the tracking control procedure, and feature-based tracking to improve the observation process of tracking. In the kernel- based Bayesian filtering framework, the analytical represen- tation of density functions by density interpolation and density approximation for the likelihood and the posterior contributes to efficient sampling. Feature-based tracking combines rec- tangular features with edge oriented histogram so that the combined features are robust to illumination changes, partial occlusion, and clutter while capturing the spatial information of the target. The use of integral image allows the features to be efficiently evaluated. The effectiveness of both algorithms are demonstrated by object tracking results on real videos. }, author = {Han,B. and Yang,C. and Duraiswami, Ramani and Davis, Larry S.} } @article {16920, title = {A Comparison of Voice Controlled and Mouse Controlled Web Browsing (2000)}, journal = {Institute for Systems Research Technical Reports}, year = {2005}, month = {2005///}, abstract = {Voice controlled web browsers allow users to navigate by speaking the text of a link or an associated number instead of clicking with a mouse. One such browser is Conversa, by Conversational Computing. This within subjects study with 18 subjects compared voice browsing with traditional mouse-based browsing. It attempted to identify which of three common hypertext forms (linear slide show, grid/tiled map, and hierarchical menu) are well suited to voice navigation, and whether voice navigation is helped by numbering links. The study shows that voice control adds approximately 50 percent to the performance time for certain types of tasks. Subjective satisfaction measures indicate that for voice browsing, textual links are preferable to numbered links.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6475}, author = {Christian,Kevin and Kules,Bill and Shneiderman, Ben and Youssef,Adel} } @article {12931, title = {Critical Factors Influencing the Occurrence of Vibrio Cholerae in the Environment of Bangladesh}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {71}, year = {2005}, month = {2005/08/01/}, pages = {4645 - 4654}, abstract = {The occurrence of outbreaks of cholera in Africa in 1970 and in Latin America in 1991, mainly in coastal communities, and the appearance of the new serotype Vibrio cholerae O139 in India and subsequently in Bangladesh have stimulated efforts to understand environmental factors influencing the growth and geographic distribution of epidemic Vibrio cholerae serotypes. Because of the severity of recent epidemics, cholera is now being considered by some infectious disease investigators as a {\textquotedblleft}reemerging{\textquotedblright} disease, prompting new work on the ecology of vibrios. Epidemiological and ecological surveillance for cholera has been under way in four rural, geographically separated locations in Bangladesh for the past 4 years, during which both clinical and environmental samples were collected at biweekly intervals. The clinical epidemiology portion of the research has been published (Sack et al., J. Infect. Dis. 187:96-101, 2003). The results of environmental sampling and analysis of the environmental and clinical data have revealed significant correlations of water temperature, water depth, rainfall, conductivity, and copepod counts with the occurrence of cholera toxin-producing bacteria (presumably V. cholerae). The lag periods between increases or decreases in units of factors, such as temperature and salinity, and occurrence of cholera correlate with biological parameters, e.g., plankton population blooms. The new information on the ecology of V. cholerae is proving useful in developing environmental models for the prediction of cholera epidemics.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.71.8.4645-4654.2005}, url = {http://aem.asm.org/content/71/8/4645}, author = {Huq,Anwar and Sack,R. Bradley and Nizam,Azhar and Longini,Ira M. and Nair,G. Balakrish and Ali,Afsar and Morris,J. Glenn and Khan,M. N. Huda and Siddique,A. Kasem and Yunus,Mohammed and Albert,M. John and Sack,David A. and Rita R Colwell} } @conference {18327, title = {Detection, analysis and matching of hair}, booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on}, volume = {1}, year = {2005}, month = {2005/10//}, pages = {741 - 748 Vol. 1 - 741 - 748 Vol. 1}, abstract = {We develop computational models for measuring hair appearance for comparing different people. The models and methods developed have applications to person recognition and face image indexing. An automatic hair detection algorithm is described and results reported. A multidimensional representation of hair appearance is presented and computational algorithms are described. Results on a dataset of 524 subjects are reported. Identification of people using hair attributes is compared to eigenface-based recognition along with a joint, eigenface-hair based identification.}, keywords = {automatic hair detection, eigenface-based recognition, eigenface-hair based identification, Eigenvalues and eigenfunctions, face image indexing, face recognition, Feature extraction, hair analysis, hair appearance, hair attributes, hair matching, Image matching, image representation, multidimensional representation, person recognition}, doi = {10.1109/ICCV.2005.75}, author = {Yacoob,Yaser and Davis, Larry S.} } @conference {18336, title = {Doubleshot: an interactive user-aided segmentation tool}, booktitle = {Proceedings of the 10th international conference on Intelligent user interfaces}, series = {IUI {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {287 - 289}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {In this paper, we describe an intelligent user interface designed for camera phones to allow mobile users to specify the object of interest in the scene simply by taking two pictures: one with the object and one without the object. By comparing these two images, the system can reliably extract the visual appearance of the object, which can be useful to a wide-range of applications such as content-based image retrieval and object recognition.}, keywords = {Computer vision, mobile application, Object recognition}, isbn = {1-58113-894-6}, doi = {10.1145/1040830.1040901}, url = {http://doi.acm.org/10.1145/1040830.1040901}, author = {Tom Yeh and Darrell,Trevor} } @conference {12342, title = {DSP address optimization using evolutionary algorithms}, booktitle = {Proceedings of the 2005 workshop on Software and compilers for embedded systems}, year = {2005}, month = {2005///}, pages = {91 - 98}, author = {Leventhal,S. and Yuan,L. and Bambha,N. K and Bhattacharyya, Shuvra S. and Qu,G.} } @article {13202, title = {Efficient kernel machines using the improved fast Gauss transform}, journal = {Advances in neural information processing systems}, volume = {17}, year = {2005}, month = {2005///}, pages = {1561 - 1568}, abstract = {The computation and memory required for kernel machines with N train- ing samples is at least O(N 2). Such a complexity is significant even for moderate size problems and is prohibitive for large datasets. We present an approximation technique based on the improved fast Gauss transform to reduce the computation to O(N ). We also give an error bound for the approximation, and provide experimental results on the UCI datasets. }, author = {Yang,C. and Duraiswami, Ramani and Davis, Larry S.} } @conference {13196, title = {Efficient mean-shift tracking via a new similarity measure}, booktitle = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on}, volume = {1}, year = {2005}, month = {2005/06//}, pages = {176 - 183 vol. 1 - 176 - 183 vol. 1}, abstract = {The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color histograms or kernel density estimates of the model and target image. The most typically used similarity measures are the Bhattacharyya coefficient or the Kullback-Leibler divergence. In practice, these approaches face three difficulties. First, the spatial information of the target is lost when the color histogram is employed, which precludes the application of more elaborate motion models. Second, the classical similarity measures are not very discriminative. Third, the sample-based classical similarity measures require a calculation that is quadratic in the number of samples, making real-time performance difficult. To deal with these difficulties we propose a new, simple-to-compute and more discriminative similarity measure in spatial-feature spaces. The new similarity measure allows the mean shift algorithm to track more general motion models in an integrated way. To reduce the complexity of the computation to linear order we employ the recently proposed improved fast Gauss transform. This leads to a very efficient and robust nonparametric spatial-feature tracking algorithm. The algorithm is tested on several image sequences and shown to achieve robust and reliable frame-rate tracking.}, keywords = {algorithm;, analysis;, Bhattacharyya, coefficient;, Color, colour, density, divergence;, estimates;, extraction;, fast, feature, frame-rate, Gauss, Gaussian, histograms;, image, Kernel, Kullback-Leibler, matching;, Mean-shift, measures;, nonparametric, processes;, sample-based, sequences;, similarity, spaces;, spatial-feature, tracking, tracking;, transform;}, doi = {10.1109/CVPR.2005.139}, author = {Yang,Changjiang and Duraiswami, Ramani and Davis, Larry S.} } @article {14028, title = {Extracting the frequencies of the pinna spectral notches in measured head related impulse responses}, journal = {The Journal of the Acoustical Society of America}, volume = {118}, year = {2005}, month = {2005///}, pages = {364 - 374}, abstract = {The head related impulse response (HRIR) characterizes the auditory cues created by scattering of sound off a person{\textquoteright}s anatomy. The experimentally measured HRIR depends on several factors such as reflections from body parts (torso, shoulder, and knees), head diffraction, and reflection/diffraction effects due to the pinna. Structural models (Algazi et al., 2002; Brown and Duda, 1998) seek to establish direct relationships between the features in the HRIR and the anatomy. While there is evidence that particular features in the HRIR can be explained by anthropometry, the creation of such models from experimental data is hampered by the fact that the extraction of the features in the HRIR is not automatic. One of the prominent features observed in the HRIR, and one that has been shown to be important for elevation perception, are the deep spectral notches attributed to the pinna. In this paper we propose a method to robustly extract the frequencies of the pinna spectral notches from the measured HRIR, distinguishing them from other confounding features. The method also extracts the resonances described by Shaw (1997). The techniques are applied to the publicly available CIPIC HRIR database (Algazi et al., 2001c). The extracted notch frequencies are related to the physical dimensions and shape of the pinna.}, keywords = {acoustic wave reflection, acoustic wave scattering, anthropometry, Ear, hearing, physiological models}, doi = {10.1121/1.1923368}, url = {http://link.aip.org/link/?JAS/118/364/1}, author = {Raykar,Vikas C. and Duraiswami, Ramani and Yegnanarayana,B.} } @article {14018, title = {Fast Computation of Sums of Gaussians in High Dimensions}, journal = {Technical Reports from UMIACS UMIACS-TR-2005-69}, year = {2005}, month = {2005/11/15/T19:2}, abstract = {Evaluating sums of multivariate Gaussian kernels is a key computational task in many problems in computational statistics andmachine learning. The computational cost of the direct evaluation of such sums scales as the product of the number of kernel functions and the evaluation points. The fast Gauss transform proposed by Greengard and Strain (1991) is a $\epsilon$-exact approximation algorithm that reduces the computational complexity of the evaluation of the sum of $N$ Gaussians at $M$ points in $d$ dimensions from $\mathcal{O}(MN)$ to $\mathcal{O}(M+N)$. However, the constant factor in $\mathcal{O}(M+N)$ grows exponentially with increasing dimensionality $d$, which makes the algorithm impractical for dimensions greater than three. In this paper we present a new algorithm where the constant factor is reduced to asymptotically polynomial order. The reduction is based on a new multivariate Taylor{\textquoteright}s series expansion (which can act both as a local as well as a far field expansion) scheme combined with the efficient space subdivision using the $k$-center algorithm. The proposed method differs from the original fast Gauss transform in terms of a different factorization, efficient space subdivision, and the use of point-wise error bounds. Algorithm details, error bounds, procedure to choose the parameters and numerical experiments are presented. As an example we shows how the proposed method can be used for very fast $\epsilon$-exact multivariate kernel density estimation. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3020}, author = {Raykar,Vikas Chandrakant and Yang,Changjaing and Duraiswami, Ramani and Gumerov, Nail A.} } @conference {13186, title = {Fast multiple object tracking via a hierarchical particle filter}, booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on}, volume = {1}, year = {2005}, month = {2005/10//}, pages = {212 - 219 Vol. 1 - 212 - 219 Vol. 1}, abstract = {A very efficient and robust visual object tracking algorithm based on the particle filter is presented. The method characterizes the tracked objects using color and edge orientation histogram features. While the use of more features and samples can improve the robustness, the computational load required by the particle filter increases. To accelerate the algorithm while retaining robustness we adopt several enhancements in the algorithm. The first is the use of integral images for efficiently computing the color features and edge orientation histograms, which allows a large amount of particles and a better description of the targets. Next, the observation likelihood based on multiple features is computed in a coarse-to-fine manner, which allows the computation to quickly focus on the more promising regions. Quasi-random sampling of the particles allows the filter to achieve a higher convergence rate. The resulting tracking algorithm maintains multiple hypotheses and offers robustness against clutter or short period occlusions. Experimental results demonstrate the efficiency and effectiveness of the algorithm for single and multiple object tracking.}, keywords = {(numerical, algorithm;, analysis;, Color, colour, Computer, Convergence, detection;, edge, fast, filter;, Filtering, hierarchical, histogram;, image, images;, integral, likelihood;, methods);, methods;, multiple, numerical, object, observation, of, orientation, particle, processes;, quasirandom, random, sampling;, tracking, tracking;, vision;, visual}, doi = {10.1109/ICCV.2005.95}, author = {Yang,Changjiang and Duraiswami, Ramani and Davis, Larry S.} } @article {12674, title = {Gait-based human identification using appearance matching}, journal = {Optical and Digital Techniques for Information Security}, year = {2005}, month = {2005///}, pages = {271 - 295}, abstract = {In this chapter, we present an appearance-based approach for recognizing human gait. Given the gait video of an individual, the images are binarized and the width of the outer contour of the silhouette of that individual is obtained for each image frame. Several gait features are derived from this basic width vector. Temporally ordered sequences of the feature vectors are then used to represent the gait of a person. While matching the feature templates for recognition, dynamic time-warping (DTW), which is a nonlinear time-normalization technique, is used to deal with naturally occurring changes in the walking speeds of individuals. The performance of the proposed method is tested on indoor as well as outdoor gait databases, and the efficacy of different gait features and their noise resilience is studied. The experiments also demonstrate the effect of change in the viewing angle and frame rate of data capture on the accuracy of gait recognition.}, author = {Kale, A. and Cuntoor, N. and Yegnanarayana,B. and Rajagopalan, A. and Chellapa, Rama} } @article {18845, title = {Geometric algorithms for computing cutter engagement functions in 2.5D milling operations}, journal = {Computer-Aided Design}, volume = {37}, year = {2005}, month = {2005/12//}, pages = {1469 - 1480}, abstract = {Cutter engagement is a measure that describes what portion of the cutter is involved in machining at a given instant of time. During profile milling of complex geometries, cutter engagement varies significantly along the cutter path. Cutter engagement information helps in determining the efficiency of the cutter path and also helps in improving it by adjusting the feed rate. This paper describes geometric algorithms for computing piece-wise continuous closed-form cutter engagement functions for 2.5D milling operations. The results produced by our algorithm are compared with the results obtained by discrete simulations of the cutting process and appear to match very well.}, keywords = {Cutter engagement, Cutter path planning, Feed rate adjustments}, isbn = {0010-4485}, doi = {10.1016/j.cad.2005.03.001}, url = {http://www.sciencedirect.com/science/article/pii/S0010448505000801}, author = {Gupta, Satyandra K. and Saini,Sunil K. and Spranklin,Brent W. and Yao,Zhiyang} } @conference {18882, title = {Going far, logically}, volume = {19}, year = {2005}, month = {2005///}, pages = {615 - 615}, abstract = {There are numerous applications where we need toensure that multiple moving objects are sufficiently far apart. Furthermore, in many moving object do- mains, there is positional indeterminacy {\textemdash} we are not 100\% sure exactly when a given moving object will be at a given location. [Yaman et al., 2004] provided a logic of motion but did not provide algo- rithms to ensure that moving objects are kept suf- ficiently far apart. In this paper, we extend their logic to include a {\textquotedblleft}far{\textquotedblright} predicate. We develop the CheckFar algorithm that checks if any given two objects will always be sufficiently far apart at dur- ing a time interval. We have run a set of experi- ments showing that our CheckFar algorithm scales very well. }, url = {http://www.cs.umd.edu/~nau/papers/yaman2005going.pdf}, author = {Yaman,F. and Nau, Dana S. and V.S. Subrahmanian} } @article {12675, title = {Interpretation of state sequences in HMM for activity representation}, journal = {Proc. IEEE Conf. Acoustic Speech and Signal Processing}, volume = {2}, year = {2005}, month = {2005///}, pages = {709 - 712}, abstract = {We propose a method for activity representation based on seman-tic events, using the HMM framework. For every time instant, the probability of event occurrence is computed by exploring a subset of state sequences. The idea is that while activity trajectories may have large variations at the data or the state levels, they may ex- hibit similarities at the event level. Our experiments show the ap- plication of these events to activity recognition in an office envi- ronment and to anomalous trajectory detection using surveillance video data. }, author = {Cuntoor, N.P. and Yegnanarayana,B. and Chellapa, Rama} } @article {13806, title = {Johns Hopkins summer workshop final report on parsing and spoken structural event detection}, journal = {Johns Hopkins University, Tech. Rep}, year = {2005}, month = {2005///}, abstract = {This report describes research conducted by the Parsing and Spoken Structural Event Detection(PaSSED) team as part of the 2005 Johns Hopkins Summer Workshop on Language Engineering. This project investigated the interaction between parsing and the detection of structural metadata in conversational speech, including sentence boundaries, edits (the reparandum portion of speech repairs), and fillers. In terms of parsing, we explored alternative methods of exploiting metadata information in parsing models and measured how varying accuracy in transcription and metadata information affects parsing accuracy. In the other direction, we similarly considered how syntactic and prosodic knowledge could be leveraged in metadata detection, measuring how this knowledge impacts metadata detection accuracy. As part of this work, we investigated metrics for evaluating parse accuracy in the presence of tran- scription and metadata detection errors, and we report on our experience using these metrics with several parsers and across varying experimental conditions. A range of methods for handling edits during pars- ing were evaluated in this research (excision, addition of markups to the input string, and grammar modification). We also developed a ToBI (a prosodic structure annotation scheme [SBP+92]) prosodic event classifier and describe its evaluation. Finally, we present methods for effective n-best sentence boundary candidate generation and reranking using syntactic, prosodic, and other features. These stud- ies are complemented by a second set of reranking investigations wherein we optimize sentence boundary detection explicitly to improve parse accuracy. The PaSSED project has: {\textbullet} investigated various techniques to enhance parsing of speech given metadata detection on conver- sational speech; {\textbullet} defined metrics for evaluating speech parsing accuracy, implemented them in the publically avail- able SParseval software package, and evaluated them under a wide variety of conditions; {\textbullet} recast SU detection as an n-best reranking problem with a relatively small n. Using this approach, we demonstrated significant improvements over a very strong baseline SU detection system. {\textbullet} reported on the interaction between parsing and metadata detection and their synergy; {\textbullet} fostered new collaborations and identified a number of interesting avenues for future work. }, author = {Harper,MP and Dorr, Bonnie J and Hale,J. and Roark,B. and Shafran,I. and Lease,M. and Liu,Y. and Snover,M. and Yung,L. and Krasnyanskaya,A.} } @conference {16298, title = {Main effects screening}, booktitle = {Proceedings of the 27th international conference on Software engineering - ICSE {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {293 - 293}, address = {St. Louis, MO, USA}, doi = {10.1145/1062455.1062515}, url = {http://dl.acm.org/citation.cfm?id=1062515}, author = {Yilmaz,Cemal and Krishna,Arvind S. and Memon, Atif M. and Porter, Adam and Schmidt,Douglas C. and Gokhale,Aniruddha and Natarajan,Balachandran} } @conference {15453, title = {Main effects screening: a distributed continuous quality assurance process for monitoring performance degradation in evolving software systems}, booktitle = {Proceedings of the 27th international conference on Software engineering}, series = {ICSE {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {293 - 302}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Developers of highly configurable performance-intensive software systems often use a type of in-house performance-oriented "regression testing" to ensure that their modifications have not adversely affected their software{\textquoteright}s performance across its large configuration space. Unfortunately, time and resource constraints often limit developers to in-house testing of a small number of configurations and unreliable extrapolation from these results to the entire configuration space, which allows many performance bottlenecks and sources of QoS degradation to escape detection until systems are fielded. To improve performance assessment of evolving systems across large configuration spaces, we have developed a distributed continuous quality assurance (DCQA) process called main effects screening that uses in-the-field resources to execute formally designed experiments to help reduce the configuration space, thereby allowing developers to perform more targeted in-house QA. We have evaluated this process via several feasibility studies on several large, widely-used performance-intensive software systems. Our results indicate that main effects screening can detect key sources of performance degradation in large-scale systems with significantly less effort than conventional techniques.}, keywords = {design of experiment theory, distributed continuous quality assurance, performance-oriented regression testing}, isbn = {1-58113-963-2}, doi = {10.1145/1062455.1062515}, url = {http://doi.acm.org/10.1145/1062455.1062515}, author = {Yilmaz,Cemal and Krishna,Arvind S. and Memon, Atif M. and Porter, Adam and Schmidt,Douglas C. and Gokhale,Aniruddha and Natarajan,Balachandran} } @article {11910, title = {Method and system for providing physical security in an area of interest}, volume = {10/916,545}, year = {2005}, month = {2005/03/10/}, abstract = {A system for detecting the presence of an intruder in a protected area utilizes a received signal strength indicator (RSSI) value of signals broadcast from transmitting stations deployed in the protected area. The system includes monitoring points for receiving broadcast signals, measuring the RSSI values of the received signals, and transmitting the measured RSSI values to a security system server. The security system server analyzes the RSSI values, and initiates security measures when the physical security of the protected area is violated which is detected when the measured RSSI values deviate from a predetermined strength of the broadcast signals. The security system also has the ability to track objects in the protected area and keep track of their movement in real time and report such movement. The system may be based on a Wi-Fi infrastructure in the protected area.}, url = {http://www.google.com/patents?id=VIaWAAAAEBAJ}, author = {Agrawala, Ashok K. and Youssef,Moustafa Amin and Shahamat,Layla} } @conference {13602, title = {Model of Object-Based Coding for Surveillance Video}, booktitle = {Proceedings in the ICASSP{\textquoteright}04 IEEE International Conference on Computer Vision}, year = {2005}, month = {2005/03//}, pages = {693 - 696}, abstract = {In this paper, we explore the model of potential savingsof object-based coding for surveillance video. Moving foreground objects in stationary camera surveillance video are detected by a background subtraction technique [3] and encoded with MPEG-4 object-based coding. Experiment results show that compared with frame-based coding, object-based coding can achieve significant savings which are dependent on the video content. We further model the relationship of compression efficiency and the number and size of video objects using statistical learning method. Simulations show that the model is representative. The model can be used to predict the savings of object-based coding and select the coding methods for surveillance video. }, author = {Yu,Yang and David Doermann} } @conference {18887, title = {A motion closed world asumption}, volume = {19}, year = {2005}, month = {2005///}, pages = {621 - 621}, abstract = {Yaman et. al. [Yaman et al., 2004] introduce {\textquotedblleft}gotheories{\textquotedblright} to reason about moving objects. In this paper, we show that this logic often does not allow us to infer that an object is not present at a given place or region, even though common sense would dictate that this is a reasonable inference to make. We define a class of models of go-theories called coherent models. We use this concept to define a motion closed world assumption (MCWA) and de- velop a notion of MCWA-entailment. We show that checking if a go-theory has a coherent model is NP-complete. An in atom checks if a given ob- ject is present in a given region sometime in a given time interval. We provide sound and complete al- gorithms to check if a ground in literal (positive or negative in atom) can be inferred from a go- theory using the MCWA. In our experiments our algorithms answer such queries in less than 1 sec- ond when there are up to 1,000 go-atoms per object. }, url = {http://ijcai.org/papers/1227.pdf}, author = {Yaman,F. and Nau, Dana S. and V.S. Subrahmanian} } @conference {18329, title = {A picture is worth a thousand keywords: image-based object search on a mobile platform}, booktitle = {CHI {\textquoteright}05 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {2025 - 2028}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Finding information based on an object{\textquoteright}s visual appearance is useful when specific keywords for the object are not known. We have developed a mobile image-based search system that takes images of objects as queries and finds relevant web pages by matching them to similar images on the web. Image-based search works well when matching full scenes, such as images of buildings or landmarks, and for matching objects when the boundary of the object in the image is available. We demonstrate the effectiveness of a simple interactive paradigm for obtaining a segmented object boundary, and show how a shape-based image matching algorithm can use the object outline to find similar images on the web.}, keywords = {content-based image retrieval, interactive segmentation, mobile interface, Object recognition}, isbn = {1-59593-002-7}, doi = {10.1145/1056808.1057083}, url = {http://doi.acm.org/10.1145/1056808.1057083}, author = {Tom Yeh and Grauman,Kristen and Tollmar,Konrad and Darrell,Trevor} } @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 {12667, title = {Pose-normalized view synthesis from silhouettes}, journal = {IEEE Intl. Conf. on Acoustics, Speech, and Signal Processing (ICASSP)}, year = {2005}, month = {2005///}, abstract = {In this paper, we introduce an active view synthesis approachfrom silhouettes. With the virtual camera moving on a properly se- lected circular trajectory around an object of interest, we achieve a collection of virtual views of the object, which is equivalent to the case that the object is on a rotating turntable and captured by a static camera whose optical axis is parallel to the turntable. We show how to derive the virtual camera{\textquoteright}s extrinsic parameters at each position on the trajectory. Using the turning function dis- tance as the silhouette similarity measurement, this approach can be used to generate the desired pose-normalized images for recog- nition applications. }, author = {Yue, Z. and Chellapa, Rama} } @inbook {17793, title = {Probabilistic Ontologies and Relational Databases}, booktitle = {On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASEOn the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE}, series = {Lecture Notes in Computer Science}, volume = {3760}, year = {2005}, month = {2005///}, pages = {1 - 17}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The relational algebra and calculus do not take the semantics of terms into account when answering queries. As a consequence, not all tuples that should be returned in response to a query are always returned, leading to low recall. In this paper, we propose the novel notion of a constrained probabilistic ontology (CPO). We developed the concept of a CPO-enhanced relation in which each attribute of a relation has an associated CPO. These CPOs describe relationships between terms occurring in the domain of that attribute. We show that the relational algebra can be extended to handle CPO-enhanced relations. This allows queries to yield sets of tuples, each of which has a probability of being correct.}, keywords = {Computer, Science}, isbn = {978-3-540-29736-9}, url = {http://dx.doi.org/10.1007/11575771_1}, author = {Udrea,Octavian and Yu,Deng and Hung,Edward and Subrahmanian,V.}, editor = {Meersman,Robert and Tari,Zahir} } @article {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} } @article {12082, title = {Robust routing in malicious environment for ad hoc networks}, journal = {Information Security Practice and Experience}, year = {2005}, month = {2005///}, pages = {36 - 47}, author = {Yu,Z. and Seng,C. Y and Jiang,T. and Wu,X. and Arbaugh, William A.} } @article {12104, title = {ROMER: resilient opportunistic mesh routing for wireless mesh networks}, journal = {Proc. of IEEE WiMesh}, volume = {166}, year = {2005}, month = {2005///}, author = {Yuan,Y. and Yang,H. and Wong,S. H.Y and Lu,S. and Arbaugh, William A.} } @article {14023, title = {Speaker Localization Using Excitation Source Information in Speech}, journal = {Speech and Audio Processing, IEEE Transactions on}, volume = {13}, year = {2005}, month = {2005/09//}, pages = {751 - 761}, abstract = {This paper presents the results of simulation and real room studies for localization of a moving speaker using information about the excitation source of speech production. The first step in localization is the estimation of time-delay from speech collected by a pair of microphones. Methods for time-delay estimation generally use spectral features that correspond mostly to the shape of vocal tract during speech production. Spectral features are affected by degradations due to noise and reverberation. This paper proposes a method for localizing a speaker using features that arise from the excitation source during speech production. Experiments were conducted by simulating different noise and reverberation conditions to compare the performance of the time-delay estimation and source localization using the proposed method with the results obtained using the spectrum-based generalized cross correlation (GCC) methods. The results show that the proposed method shows lower number of discrepancies in the estimated time-delays. The bias, variance and the root mean square error (RMSE) of the proposed method is consistently equal or less than the GCC methods. The location of a moving speaker estimated using the time-delays obtained by the proposed method are closer to the actual values, than those obtained by the GCC method.}, keywords = {correlation, correlation;, cross, Delay, error, error;, estimation;, excitation, generalized, information;, localization;, mean, methods;, processing;, production;, root, source, speaker, speech, square, TIME}, isbn = {1063-6676}, doi = {10.1109/TSA.2005.851907}, author = {Raykar,V.C. and Yegnanarayana,B. and Prasanna,S. R.M and Duraiswami, Ramani} } @article {13865, title = {Structural metadata and parsing speech}, year = {2005}, month = {2005///}, institution = {JHU Language Engineering Workshop}, author = {Harper,M. and Dorr, Bonnie J and Hale,J. and Roark,B. and Shafran,I. and Lease,M. and Liu,Y. and Snover,M. and Yung,L. and Krasnyanskaya,A. and others} } @article {12668, title = {Synthesis of novel views of moving objects in airborne video}, journal = {Proc. British Machine Vision Conference}, year = {2005}, month = {2005///}, pages = {290 - 299}, abstract = {This paper presents a method for synthesizing novel views of movingobjects in airborne video. The object of interest is tracked using an appear- ance based visual tracking method. The on-object point correspondence is then built and used to estimate the homography induced by the ground plane. With known camera focal length, the surface normal to the ground plane and the camera motion between two views are factored out from the homography. In order to assure robustness of surface normal estimation, a rank one con- straint is applied to decompose a matrix which contains the homographies from multiple frame pairs. Given a desired viewing direction, the novel im- age of the object is generated by warping the reference frame using the new homography between the desired viewpoint and the reference frame. Exper- imental results show that the method is robust and errors due to small depth variations of the object is negligible. }, author = {Yue, Z. and Chellapa, Rama} } @conference {12099, title = {Toward resilient security in wireless sensor networks}, booktitle = {Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing}, year = {2005}, month = {2005///}, pages = {34 - 45}, author = {Yang,H. and Ye,F. and Yuan,Y. and Lu,S. and Arbaugh, William A.} } @article {16475, title = {Using Non-random Associations for Predicting Latency in WANs}, journal = {Web Information Systems Engineering {\textendash} WISE 2005}, year = {2005}, month = {2005///}, abstract = {In this paper, we propose a scalable performance management tool for Wide Area Applications. Our objective is to scalably identify non-random associations between pairs of individual Latency Profiles (iLPs) (i.e., latency distributions experienced by clients when connecting to a server) and exploit them in latency prediction. Our approach utilizes Relevance Networks (RNs) to manage tens of thousands of iLPs. Non-random associations between iLPs can be identified by topology-independent measures such as correlation and mutual information. We demonstrate that these non-random associations do indeed have a significant impact in improving the error of latency prediction.}, doi = {10.1007/11581062_48}, author = {Raschid, Louiqa and Ye,Q. and Zadorozhny,V. and Gal,A. and Murthy,H.} } @conference {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} } @article {15439, title = {Applying Model-based Distributed Continuous Quality Assurance Processes to Enhance Persistent Software Attributes}, journal = {IEEE Software}, volume = {21}, year = {2004}, month = {2004///}, pages = {32 - 40}, abstract = {Time and resource constraints often force developers of highlyconfigurable quality of service (QoS)-intensive software sys- tems to guarantee their system{\textquoteright}s persistent software attributes (PSAs) (e.g., functional correctness, portability, efficiency, and QoS) on very few platform configurations and to extrapolate from these configurations to the entire configuration space, which allows many sources of degradation to escape detec- tion until systems are fielded. This article illustrates how distributed continuous quality assurance (DCQA) processes help improve the assessment of these PSAs across large QoS- intensive software system configuration spaces. We also il- lustrate how model-based DCQA processes enable developers to run formally-designed screening experiments that isolate the most significant configuration options, such as different workload parameters, operating system, compiler flags, fea- ture sets, and/or run-time optimization controls. Our empir- ical results show that DCQA processes can be used monitor, safeguard, and enforce PSAs at an acceptable level of cost and effort. }, author = {Krishna,A. S and Yilmaz,C. and Memon, Atif M. and Porter, Adam and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @conference {15690, title = {Automatic video summarization for wireless and mobile environments}, booktitle = {2004 IEEE International Conference on Communications}, volume = {3}, year = {2004}, month = {2004/06/20/24}, pages = {1532- 1536 Vol.3 - 1532- 1536 Vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we propose a novel video summarization technique using which we can automatically generate high quality video summaries suitable for wireless and mobile environments. The significant contribution of this paper lies in the proposed clustering scheme. We use Delaunay diagrams to cluster multidimensional point data corresponding to the frame contents of the video. In contrast to the existing clustering techniques used for summarization, our clustering algorithm is fully automatic and well suited for batch processing. We illustrate the quality of our clustering and summarization scheme in an experiment using several video clips.}, keywords = {automatic video summarization, batch processing, batch processing (computers), Clustering algorithms, Clustering methods, clustering scheme, Computer science, Delaunay diagram, graph theory, Gunshot detection systems, Image sequences, mesh generation, Mobile computing, mobile radio, multidimensional point data cluster, Multidimensional systems, Multimedia communication, video clip, video frame content, Video sequences, video signal processing, wireless mobile environment}, isbn = {0-7803-8533-0}, doi = {10.1109/ICC.2004.1312767}, author = {Yong Rao and Mundur, Padma and Yesha,Y.} } @conference {16311, title = {Covering arrays for efficient fault characterization in complex configuration spaces}, booktitle = {ACM SIGSOFT Software Engineering Notes}, volume = {29}, year = {2004}, month = {2004///}, pages = {45 - 54}, author = {Yilmaz,C. and Cohen,M. B and Porter, Adam} } @article {18825, title = {Cutter path generation for 2.5D milling by combining multiple different cutter path patterns}, journal = {International Journal of Production Research}, volume = {42}, year = {2004}, month = {2004///}, pages = {2141 - 2161}, abstract = {Different cutter path patterns have been shown to be efficient for different types of pocket geometries. However, for certain types of complex pockets, no single type of pattern produces efficient cutter paths throughout the pocket. In this paper, different cutter path patterns are systematically analysed, and several existing heuristics for selecting cutter path patterns are discussed. Based on observations, a new cutter path generation algorithm is described in this paper. This algorithm generates a cutter path by using different patterns in different regions of the geometry and seamlessly morphing them together. In case of complex pockets, it produces solutions superior to those generated by any single pattern.}, isbn = {0020-7543}, doi = {10.1080/00207540310001652879}, url = {http://www.tandfonline.com/doi/abs/10.1080/00207540310001652879}, author = {Yao,Zhiyang and Gupta, Satyandra K.} } @conference {16302, title = {A distributed continuous quality assurance process to manage variability in performance-intensive software}, booktitle = {19th ACM OOPSLA Workshop on Component and Middleware Performance}, year = {2004}, month = {2004///}, author = {Krishna,A. and Yilmaz,C. and Memon, Atif M. and Porter, Adam and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @article {14041, title = {Extracting the frequencies of the pinna spectral notches from measured head-related impulse responses}, journal = {The Journal of the Acoustical Society of America}, volume = {116}, year = {2004}, month = {2004///}, pages = {2625 - 2625}, abstract = {Experimental data are available for the Head-related impulse response (HRIR) for several azimuth and elevation angles, and for several subjects. The measured HRIR depends on several factors such as reflections from body parts (torso, shoulder, and knees), head diffraction, and reflection/diffraction effects due to the external ear (pinna). Due to the combined influence of these factors on the HRIR, it is difficult to isolate features thought to be perceptually important (such as the frequencies of pinna spectral notches) using standard signal-processing techniques. Signal-processing methods to extract the frequencies of the pinna spectral notches from the HRIR are presented. The techniques are applied to extracting the frequencies of the pinna spectral notches from the publicly available HRIR databases. A brief discussion relating the notch frequencies to the physical dimensions and the shape of the pinna is given. [The support of NSF Award ITR-0086075 is gratefully acknowledged.]}, url = {http://link.aip.org/link/?JAS/116/2625/2}, author = {Raykar,Vikas C. and Duraiswami, Ramani and Yegnanarayana,B.} } @conference {18778, title = {A Framework for Conceptual Design of Multiple Interaction-State Mechatronic Systems}, year = {2004}, month = {2004///}, address = {Lausanne, Switzerland}, abstract = {Increasingly, complex mechatronic systems are beingdesigned to have higher levels of autonomy and intelligence. This requires them to operate in multiple interaction-states. To facilitate computer- aided conceptual design of complex mechatronic systems, this paper provides a framework for modeling design concepts behind mechatronic systems with multiple interaction-states. We introduce the primitives and operators used in the modeling framework, and illustrate the modeling process by an example. }, url = {http://www.glue.umd.edu/~skgupta/Publication/TMCE04_Xu.pdf}, author = {Gupta,S.K. and Xu,C. and Yao,Z.} } @article {15179, title = {A generic construction for intrusion-resilient public-key encryption}, journal = {Topics in Cryptology{\textendash}CT-RSA 2004}, year = {2004}, month = {2004///}, pages = {1997 - 1997}, abstract = {In an intrusion-resilient cryptosystem [10], two entities (a user and a base) jointly evolve a secret decryption key; this provides very strong protection against an active attacker who can break into the user and base repeatedly and even simultaneously. Recently, a construction of an intrusion-resilient public-key encryption scheme based on specific algebraic assumptions has been shown [6]. We generalize this previous work and present a more generic construction for intrusion-resilient public-key encryption from any forward-secure public-key encryption scheme satisfying a certain homomorphic property.}, doi = {10.1007/978-3-540-24660-2_7}, author = {Dodis,Y. and Franklin,M. and Katz, Jonathan and Miyaji,A. and Yung,M.} } @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} } @conference {18344, title = {IDeixis: image-based Deixis for finding location-based information}, booktitle = {CHI {\textquoteright}04 extended abstracts on Human factors in computing systems}, series = {CHI EA {\textquoteright}04}, year = {2004}, month = {2004///}, pages = {781 - 782}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We demonstrate an image-based approach to specifying location and finding location-based information from camera-equipped mobile devices. We introduce a point-by-photograph paradigm, where users can specify a location simply by taking pictures. Our technique uses content-based image retrieval methods to search the web or other databases for matching images and their source pages to find relevant location-based information. In contrast to conventional approaches to location detection, our method can refer to distant locations and does not require any physical infrastructure beyond mobile internet service. We have developed a prototype on a camera phone and conducted user studies to demonstrate the efficacy of our approach compared to other alternatives.}, keywords = {content-based image retrieval, context-aware computing, location-awareness, Mobile computing}, isbn = {1-58113-703-6}, doi = {10.1145/985921.985933}, url = {http://doi.acm.org/10.1145/985921.985933}, author = {Tom Yeh and Tollmar,Konrad and Darrell,Trevor} } @article {18342, title = {Ideixis-image-based deixis for finding location-based information}, journal = {Mobile HCI, Vienna, Austria, Pages}, year = {2004}, month = {2004///}, pages = {781 - 782}, author = {Tollmar,K. and Tom Yeh and Darrell,T.} } @article {18343, title = {IDeixis{\textendash}Searching the Web with Mobile Images for Location-Based Information}, journal = {Mobile Human-Computer Interaction{\textendash}MobileHCI 2004}, year = {2004}, month = {2004///}, pages = {61 - 125}, author = {Tollmar,K. and Tom Yeh and Darrell,T.} } @article {13227, title = {Improved Multiuser Detectors Employing Genetic Algorithms in a Space-Time Block Coded System, Yinggang Du and Kam Tai Chan}, journal = {Signal}, volume = {2004}, year = {2004}, month = {2004///}, pages = {640 - 648}, author = {Self-Similarity,G.R.U.I. and BenAbdelkader,C. and Cutler,R.G. and Davis, Larry S. and Local,F.R.U. and Global Features,J.H. and Yuen, P.C. and Lai,JH and Li,C.} } @conference {18881, title = {A logic of motion}, year = {2004}, month = {2004///}, pages = {85 - 94}, abstract = {There are numerous applications such as air traffic manage- ment, cellular phone location tracking, and vehicle protection systems where there is a critical need to reason about moving objects. In this paper, we propose a formal logic of motion (LOM for short). We provide a formal syntax for LOM, as well as a model theory for LOM. In addition, we develop al- gorithms to check consistency of LOM theories, as well as to answer certain kinds of queries posed to LOM theories. We have implemented these algorithms in a prototype LOM sys- tem - we describe experiments showing that such queries can be efficiently executed in practice.}, url = {http://www.aaai.org/Papers/KR/2004/KR04-011.pdf}, author = {Yaman,F. and Nau, Dana S. and V.S. Subrahmanian} } @article {15454, title = {A Model-based Distributed Continuous Quality Assurance Process to Enhance the Quality of Service of Evolving Performance-intensive Software Systems}, journal = {Proceedings of the 2nd ICSE Workshop on Remote Analysis and Measurement of Software Systems (RAMSS), Edinburgh, Scotland, UK}, year = {2004}, month = {2004///}, abstract = {Performance-intensive software, such as that found in high-perfo-rmance computing systems and distributed real-time and embedded systems, increasingly executes on a multitude of platforms and user contexts. To ensure that performance-intensive software meets its quality of service (QoS) requirements, it must often be fine-tuned to specific platforms/contexts by adjusting many (in some cases hun- dreds of) configuration options. Developers who write these types of systems must therefore try to ensure that their additions and mod- ifications work across this large configuration space. In practice, however, time and resource constraints often force developers to assess performance on very few configurations and to extrapolate from these to the entire configuration space, which allows many performance bottlenecks and sources of QoS degradation to escape detection until systems are fielded. To improve the assessment of performance across large config- uration spaces, we present a model-based approach to develop- ing and deploying a new distributed continuous quality assurance (DCQA) process. Our approach builds upon and extends the Skoll environment, which is developing and validating novel software QA processes and tools that leverage the extensive computing resources of worldwide user communities in a distributed, continuous man- ner to significantly and rapidly improve software quality. This pa- per describes how our new DCQA performance assessment process enables developers to run formally-designed screening experiments that isolate the most significant options. After that, exhaustive ex- periments (on the now much smaller configuration space) are con- ducted. We implemented this process using model-based software tools and executed it in the Skoll environment to demonstrate its ef- fectiveness via two experiments on widely used QoS-enabled mid- dleware. Our results show that model-based DCQA processes im- proves developer insight into the effect of system changes on per- formance at an acceptable cost. }, author = {Yilmaz,C. and Krishna,A. S and Memon, Atif M. and Porter, Adam and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @article {13226, title = {Multi-cue exemplar-based nonparametric model for gesture recognition}, journal = {Indian Conference on Computer Vision, Graphics and Image Processing}, year = {2004}, month = {2004///}, pages = {16 - 18}, abstract = {This paper presents an approach for a multi-cue, view-based recognition of gestures. We describe an exemplar- based technique that combines two different forms of exem- plars - shape exemplars and motion exemplars - in a uni- fied probabilistic framework. Each gesture is represented as a sequence of learned body poses as well as a sequence of learned motion parameters. The shape exemplars are comprised of pose contours, and the motion exemplars are represented as affine motion parameters extracted using a robust estimation approach. The probabilistic framework learns by employing a nonparametric estimation technique to model the exemplar distributions. It imposes temporal constraints between different exemplars through a learned Hidden Markov Model (HMM) for each gesture. We use the proposed multi-cue approach to recognize a set of four- teen gestures and contrast it against a shape only, single- cue based system. }, author = {Shet,V. D and Prasad,V. S.N and Elgammal,A. and Yacoob,Yaser and Davis, Larry S.} } @article {14590, title = {A Note on Efficient Computation of Haplotypes via Perfect Phylogeny}, journal = {Journal of Computational Biology}, volume = {11}, year = {2004}, month = {2004/10//}, pages = {858 - 866}, abstract = {The problem of inferring haplotype phase from a population of genotypes has received a lot of attention recently. This is partly due to the observation that there are many regions on human genomic DNA where genetic recombination is rare (Helmuth, 2001; Daly et al., 2001; Stephens et al., 2001; Friss et al., 2001). A Haplotype Map project has been announced by NIH to identify and characterize populations in terms of these haplotypes. Recently, Gusfield introduced the perfect phylogeny haplotyping problem, as an algorithmic implication of the no-recombination in long blocks observation, together with the standard population-genetic assumption of infinite sites. Gusfield{\textquoteright}s solution based on matroid theory was followed by direct θ(nm2 ) solutions that use simpler techniques (Bafna et al., 2003; Eskin et al., 2003), and also bound the number of solutions to the PPH problem. In this short note, we address two questions that were left open. First, can the algorithms of Bafna et al. (2003) and Eskin et al. (2003) be sped-up to O(nm + m2 ) time, which would imply an O(nm) time-bound for the PPH problem? Second, if there are multiple solutions, can we find one that is most parsimonious in terms of the number of distinct haplotypes.We give reductions that suggests that the answer to both questions is "no." For the first problem, we show that computing the output of the first step (in either method) is equivalent to Boolean matrix multiplication. Therefore, the best bound we can presently achieve is O(nmω{\textendash}1), where ω <= 2.52 is the exponent of matrix multiplication. Thus, any linear time solution to the PPH problem likely requires a different approach. For the second problem of computing a PPH solution that minimizes the number of distinct haplotypes, we show that the problem is NP-hard using a reduction from Vertex Cover (Garey and Johnson, 1979).}, isbn = {1066-5277, 1557-8666}, doi = {10.1089/cmb.2004.11.858}, url = {http://www.liebertonline.com/doi/abs/10.1089/cmb.2004.11.858}, author = {Bafna,Vineet and Gusfield,Dan and Hannenhalli, Sridhar and Yooseph,Shibu} } @article {14039, title = {On-Line Kernel-Based Tracking in Joint Feature-Spatial Spaces}, journal = {IEEE, 0-7695-2158-2164}, year = {2004}, month = {2004///}, abstract = {We will demonstrate an object tracking algorithm thatuses a novel simple symmetric similarity function between spatially-smoothed kernel-density estimates of the model and target distributions. The similarity measure is based on the expectation of the density estimates over the model or target images. The density is estimated using radial-basis kernel functions which measure the affinity between points and provide a better outlier rejection property. The mean- shift algorithm is used to track objects by iteratively max- imizing this similarity function. To alleviate the quadratic complexity of the density estimation, we employ Gaussian kernels and the fast Gauss transform to reduce the compu- tations to linear order. This leads to a very efficient and robust nonparametric tracking algorithm. More details can be found in [2]. The system processes online video stream on a P4 1.4GHz and achieves 30 frames per second using an ordinary webcam. }, author = {Yang,C. and Duraiswami, Ramani and Elgammal,A. and Davis, Larry S.} } @inbook {18915, title = {Plan Databases: Model and Algebra}, booktitle = {Foundations of Information and Knowledge Systems}, series = {Lecture Notes in Computer Science}, volume = {2942}, year = {2004}, month = {2004///}, pages = {302 - 319}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Despite the fact that thousands of applications manipulate plans, there has been no work to date on managing large databases of plans. In this paper, we first propose a formal model of plan databases. We describe important notions of consistency and coherence for such databases. We then propose a set of operators similar to the relational algebra to query such databases of plans.}, keywords = {Computer science}, isbn = {978-3-540-20965-2}, url = {http://www.springerlink.com/content/yqhlqtu4te18q2e1/abstract/}, author = {Yaman,Fusun and Adali,Sibel and Nau, Dana S. and Sapino,Maria and Subrahmanian,V.}, editor = {Seipel,Dietmar and Turull-Torres,Jos{\'e}} } @article {12712, title = {Pose-normailzed view synthesis of a symmetric object using a single image}, journal = {Proceedings of the 6th Asian Conference on Computer Vision (ACCV{\textquoteright}04)}, year = {2004}, month = {2004///}, pages = {915 - 920}, abstract = {Object recognition under varying pose is a challenging prob-lem, especially when illumination variations are also present. In this paper, we propose a pose-normalized view synthe- sis method under varying illuminations for symmetric ob- jects. For a given non-frontal view of a symmetric object under non-frontal illumination, the mirror image of the orig- inal view is equivalent to the view when the object rotates around the Y -axis by the same angle as the original view but in the opposite direction, and under opposite illumina- tion condition in the X direction. Exploiting the bilateral symmetry of the object, we generate the mirror view of the object under the same illumination condition as the original view on a pixel-by-pixel basis. The frontal view under the same illumination is then easily obtained using view mor- phing techniques. }, author = {Yue, Z. and Chellapa, Rama} } @article {15498, title = {Preserving distributed systems critical properties: a model-driven approach}, journal = {Software, IEEE}, volume = {21}, year = {2004}, month = {2004///}, pages = {32 - 40}, abstract = {The need for creating predictability in distributed systems is most often specified in terms of quality-of-service (QoS) requirements, which help define the acceptable levels of dependability with which capabilities such as processing capacity, data throughput, or service availability reach users. For longer-term properties such as scalability, maintainability, adaptability, and system security, we can similarly use persistent software attributes (PSAs) to specify how and to what degree such properties must remain intact as a network expands and evolves over time. The Skoll distributed continuous software quality assurance process helps to identify viable system and software configurations for meeting stringent QOS and PSA requirements by coordinating the use of distributed computing resources. The authors tested their process using the large, rapidly evolving ACE+TAO middleware suite.}, keywords = {configuration management, formal verification, Middleware, middleware suite, model-driven approach, persistent software attributes, QoS requirements, Quality assurance, quality of service, quality-of-service, Skoll distributed computing resources, software configuration, Software maintenance, Software quality, software quality assurance process, system dependability}, isbn = {0740-7459}, doi = {10.1109/MS.2004.50}, author = {Yilmaz,C. and Memon, Atif M. and Porter, Adam and Krishna,A. S and Schmidt,D. C and Gokhale,A. and Natarajan,B.} } @article {13221, title = {Real-Time Kernel-Based Tracking in Joint Feature-Spatial Spaces}, year = {2004}, month = {2004/04/19/}, abstract = {An object tracking algorithm that uses a novel simple symmetric similarityfunction between spatially-smoothed kernel-density estimates of the model and target distributions is proposed and tested. The similarity measure is based on the expectation of the density estimates over the model or target images. The density is estimated using radial-basis kernel functions which measure the affinity between points and provide a better outlier rejection property. The mean-shift algorithm is used to track objects by iteratively maximizing this similarity function. To alleviate the quadratic complexity of the density estimation, we employ Gaussian kernels and the fast Gauss transform to reduce the computations to linear order. This leads to a very efficient and robust nonparametric tracking algorithm. The proposed algorithm is tested with several image sequences and shown to achieve robust and reliable real-time tracking. (UMIACS-TR-2004-12) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1341}, author = {Yang,Changjiang and Duraiswami, Ramani and Elgammal,Ahmed and Davis, Larry S.} } @article {18989, title = {Reducing storage requirements for biological sequence comparison}, journal = {BioinformaticsBioinformatics}, volume = {20}, year = {2004}, month = {2004/12/12/}, pages = {3363 - 3369}, abstract = {Motivation: Comparison of nucleic acid and protein sequences is a fundamental tool of modern bioinformatics. A dominant method of such string matching is the {\textquoteleft}seed-and-extend{\textquoteright} approach, in which occurrences of short subsequences called {\textquoteleft}seeds{\textquoteright} are used to search for potentially longer matches in a large database of sequences. Each such potential match is then checked to see if it extends beyond the seed. To be effective, the seed-and-extend approach needs to catalogue seeds from virtually every substring in the database of search strings. Projects such as mammalian genome assemblies and large-scale protein matching, however, have such large sequence databases that the resulting list of seeds cannot be stored in RAM on a single computer. This significantly slows the matching process.Results: We present a simple and elegant method in which only a small fraction of seeds, called {\textquoteleft}minimizers{\textquoteright}, needs to be stored. Using minimizers can speed up string-matching computations by a large factor while missing only a small fraction of the matches found using all seeds. }, isbn = {1367-4803, 1460-2059}, doi = {10.1093/bioinformatics/bth408}, url = {http://bioinformatics.oxfordjournals.org/content/20/18/3363}, author = {Roberts,Michael and Hayes,Wayne and Hunt,Brian R. and Mount, Stephen M. and Yorke,James A.} } @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} } @conference {18353, title = {Searching the web with mobile images for location 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///}, pages = {76 - 81}, publisher = {IEEE}, organization = {IEEE}, abstract = {We describe an approach to recognizing location from mobile devices using image-based Web search. We demonstrate the usefulness of common image search metrics applied on images captured with a camera-equipped mobile device to find matching images on the World Wide Web or other general-purpose databases. Searching the entire Web can be computationally overwhelming, so we devise a hybrid image-and-keyword searching technique. First, image-search is performed over images and links to their source Web pages in a database that indexes only a small fraction of the Web. Then, relevant keywords on these Web pages are automatically identified and submitted to an existing text-based search engine (e.g. Google) that indexes a much larger portion of the Web. Finally, the resulting image set is filtered to retain images close to the original query. It is thus possible to efficiently search hundreds of millions of images that are not only textually related but also visually relevant. We demonstrate our approach on an application allowing users to browse Web pages matching the image of a nearby location.}, isbn = {0-7695-2158-4}, doi = {10.1109/CVPR.2004.1315147}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1315147}, author = {Tom Yeh and Tollmar,K. and Darrell,T.} } @article {13225, title = {Similarity measure for nonparametric kernel density based object tracking}, journal = {Eighteenth Annual Conference on Neural Information Processing Systems, Vancouver}, year = {2004}, month = {2004///}, abstract = {An object tracking algorithm using a novel simple symmetric similar-ity function between spatially-smoothed kernel-density estimates of the model and target distributions is proposed and tested. The similarity measure is based on the expectation of the density estimates over the model or target images. The density is estimated using radial-basis ker- nel functions that measure the affinity between points and provide a bet- ter outlier rejection property. The mean-shift algorithm is used to track objects by iteratively maximizing this similarity function. To alleviate the quadratic complexity of the density estimation, we employ Gaussian kernels and the fast Gauss transform to reduce the computations to linear order. This leads to a very efficient and robust nonparametric tracking al- gorithm. The proposed algorithm is tested with several image sequences and shown to achieve robust and reliable real-time tracking. Several se- quences are placed at http://www.cs.umd.edu/users/yangcj/node3.html. }, author = {Yang,C. and Duraiswami, Ramani and Davis, Larry S.} } @conference {15468, title = {Skoll: distributed continuous quality assurance}, booktitle = {Software Engineering, 2004. ICSE 2004. Proceedings. 26th International Conference on}, year = {2004}, month = {2004/05//}, pages = {459 - 468}, abstract = {Quality assurance (QA) tasks, such as testing, profiling, and performance evaluation, have historically been done in-house on developer-generated workloads and regression suites. Since this approach is inadequate for many systems, tools and processes are being developed to improve software quality by increasing user participation in the QA process. A limitation of these approaches is that they focus on isolated mechanisms, not on the coordination and control policies and tools needed to make the global QA process efficient, effective, and scalable. To address these issues, we have initiated the Skoll project, which is developing and validating novel software QA processes and tools that leverage the extensive computing resources of worldwide user communities in a distributed, continuous manner to significantly and rapidly improve software quality. This paper provides several contributions to the study of distributed continuous QA. First, it illustrates the structure and functionality of a generic around-the-world, around-the-clock QA process and describes several sophisticated tools that support this process. Second, it describes several QA scenarios built using these tools and process. Finally, it presents a feasibility study applying these scenarios to a 1MLOC+ software package called ACE+TAO. While much work remains to be done, the study suggests that the Skoll process and tools effectively manage and control distributed, continuous QA processes. Using Skoll we rapidly identified problems that had taken the ACE+TAO developers substantially longer to find and several of which had previously not been found. Moreover, automatic analysis of QA task results often provided developers information that quickly led them to the root cause of the problems.}, keywords = {1MLOC+ software package, ACE+TAO, around-the-clock QA process, around-the-world QA process, distributed continuous QA, distributed continuous quality assurance, distributed programming, program verification, Quality assurance, Skoll, software performance evaluation, software profiling, Software quality, Software testing}, doi = {10.1109/ICSE.2004.1317468}, author = {Memon, Atif M. and Porter, Adam and Yilmaz,C. and Nagarajan,A. and Schmidt,D. and Natarajan,B.} } @article {14042, title = {A study of the pinna anthropometry and the spectral notch frequencies}, journal = {The Journal of the Acoustical Society of America}, volume = {116}, year = {2004}, month = {2004///}, pages = {2625 - 2625}, abstract = {The head-related transfer function (HRTF) varies significantly between individuals due to the different sizes and shapes of different anatomical parts like the pinnae, head, and torso. Applications in the creation of virtual auditory displays require individual HRTFs for perceptual fidelity. A generic HRTF would not work satisfactorily, since it has been shown that nonindividual HRTFs result in poor elevation perception. While good geometrical models exist for the effects of head, torso, and shoulders, a simple model for the pinna that connects the anthropometry to the features in the HRTF does not exist. One of the prominent cues contributed by the pinna are the sharp spectral notches, which encode the elevation of the sound source. Recently, we proposed a method to extract the frequencies of the pinna spectral notches from the HRTF. In this paper we study the relationship between the extracted notch frequency and pinna anthropometry. Based on these observations new approaches for HRTF customization can be developed. [The support of NSF Award ITR-0086075 is gratefully acknowledged.]}, url = {http://link.aip.org/link/?JAS/116/2625/3}, author = {Raykar,Vikas C. and Duraiswami, Ramani and Yegnanarayana,B.} } @article {12942, title = {Variation of toxigenic Vibrio cholerae O1 in the aquatic environment of Bangladesh and its correlation with the clinical strains}, journal = {Microbiology and immunology}, volume = {48}, year = {2004}, month = {2004///}, pages = {773 - 777}, author = {Islam,M. S. and Talukder,K. A. and Khan,N. H. and Mahmud,Z. H. and Rahman,M. Z. and Nair,G. B. and Siddique,A. K. M. and Yunus,M. and Sack,D. A. and Sack,R. B. and Rita R Colwell} } @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.} } @article {12955, title = {A 4-Year Study of the Epidemiology of Vibrio Cholerae in Four Rural Areas of Bangladesh}, journal = {Journal of Infectious DiseasesJ Infect Dis.}, volume = {187}, year = {2003}, month = {2003/01/01/}, pages = {96 - 101}, abstract = {How Vibrio cholerae spreads around the world and what determines its seasonal peaks in endemic areas are not known. These features of cholera have been hypothesized to be primarily the result of environmental factors associated with aquatic habitats that can now be identified. Since 1997, fortnightly surveillance in 4 widely separated geographic locations in Bangladesh has been performed to identify patients with cholera and to collect environmental data. A total of 5670 patients (53\% <5 years of age) have been studied; 14.3\% had cholera (10.4\% due to V. cholerae O1 El Tor, 3.8\% due to O139). Both serogroups were found in all locations; outbreaks were seasonal and often occurred simultaneously. Water-use patterns showed that bathing and washing clothes in tube-well water was significantly protective in two of the sites. These data will be correlated with environmental factors, to develop a model for prediction of cholera outbreaks}, isbn = {0022-1899, 1537-6613}, doi = {10.1086/345865}, url = {http://jid.oxfordjournals.org/content/187/1/96}, author = {Sack,R. Bradley and Siddique,A. Kasem and Longini,Ira M. and Nizam,Azhar and Yunus,Md and M. Sirajul Islam and Morris,Jr and Ali,Afsar and Huq,Anwar and Nair,G. Balakrish and Qadri,Firdausi and Faruque,Shah M. and Sack,David A. and Rita R Colwell} } @article {18812, title = {Algorithms for selecting cutters in multi-part milling problems}, journal = {Computer-Aided Design}, volume = {35}, year = {2003}, month = {2003/08//}, pages = {825 - 839}, abstract = {This paper describes geometric algorithms for automatically selecting an optimal sequence of cutters for machining a set of 2.5-D parts. In milling operations, cutter size affects the machining time significantly. Meanwhile, if the batch size is small, it is also important to shorten the time spent on loading tools into the tool magazine and establishing z-length compensation values. Therefore, in small-batch manufacturing, if we can select a set of milling tools that will produce good machining time on more than one type of parts, then several unnecessary machine-tool reconfiguration operations can be eliminated. In selecting milling cutters we consider both the tool loading time and the machining time and generate solutions that allow us to minimize the total machining time. In this paper we first present algorithms for finding the area that can be cut by a given cutter. Then we describe a graph search formulation for the tool selection problem. Finally, the optimal sequence of cutters is selected by using Dijkstra{\textquoteright}s shortest path planning algorithm.}, keywords = {2.5-D Milling, cutter selection, Geometric Algorithms}, isbn = {0010-4485}, doi = {10.1016/S0010-4485(02)00110-0}, url = {http://www.sciencedirect.com/science/article/pii/S0010448502001100}, author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.} } @article {18194, title = {Data hiding in image and video .II. Designs and applications}, journal = {Image Processing, IEEE Transactions on}, volume = {12}, year = {2003}, month = {2003/06//}, pages = {696 - 705}, abstract = {For pt. I see ibid., vol.12, no.6, p.685-95 (2003). This paper applies the solutions to the fundamental issues addressed in Part I to specific design problems of embedding data in image and video. We apply multilevel embedding to allow the amount of embedded information that can be reliably extracted to be adaptive with respect to the actual noise conditions. When extending the multilevel embedding to video, we propose strategies for handling uneven embedding capacity from region to region within a frame as well as from frame to frame. We also embed control information to facilitate the accurate extraction of the user data payload and to combat such distortions as frame jitter. The proposed algorithm can be used for a variety of applications such as copy control, access control, robust annotation, and content-based authentication.}, keywords = {access, annotation;, authentication;, capacity;, conditions;, content-based, CONTROL, control;, copy, data, distortions;, EMBEDDING, embedding;, encapsulation;, extraction;, frame, hiding;, image, information;, jitter;, message, multilevel, NOISE, noise;, payload, processing;, robust, signal, uneven, user, video}, isbn = {1057-7149}, doi = {10.1109/TIP.2003.810589}, author = {M. Wu and Yu,H. and Liu,Bede} } @article {13754, title = {Desparately seeking cebuano}, journal = {Third Conference on Human Language Technologies}, year = {2003}, month = {2003///}, abstract = {This paper describes an effort to rapidly de-velop language resources and component tech- nology to support searching Cebuano news sto- ries using English queries. Results from the first 60 hours of the exercise are presented. }, author = {Oard, Douglas and David Doermann and Dorr, Bonnie J and He,D. and Resnik, Philip and Weinberg, Amy and Byrne,W. and Khudanpur,S. and Yarowsky,D. and Leuski,A. and others} } @conference {16294, title = {Distributed continuous quality assurance: The Skoll project}, booktitle = {Workshop on Remote Analysis and Measurement of Software Systems (RAMSS)}, year = {2003}, month = {2003///}, author = {Yilmaz,C. and Porter, Adam and Schmidt,D. C} } @conference {11911, title = {Energy-efficient broadcast and multicast trees for reliable wireless communication}, booktitle = {Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE}, volume = {1}, year = {2003}, month = {2003/03//}, pages = {660 -667 vol.1 - 660 -667 vol.1}, abstract = {We define energy-efficient broadband and multicast schemes for reliable communication in multi-hop wireless networks. Unlike previous techniques, the choice of neighbors in the broadband and multicast trees in these schemes, are based not only on the link distance, but also on the error rates associated with the link. Our schemes can be implemented using both positive and negative acknowledgement based reliable broadcast techniques in the link layer. Through simulations, we show that our scheme achieves up to 45\% improvement over previous schemes on realistic 100-node network topologies. A positive acknowledgment based implementation is preferred. Our simulations show that the additional benefits of a positive acknowledgement based implementation is marginal (1-2\%). Therefore a negative acknowledgement based implementation of our schemes is equally applicable in constructing energy-efficient reliable and multicast data delivery paths.}, keywords = {broadcast, channels;multicast, communication;broadcast, communication;network, data, delivery, energy-efficient, layer;multicast, network, networks;network, networks;telecommunication, paths;multicast, rates;link, reliability;, topologies;wireless, topology;radio, trees;error, trees;multihop, wireless}, doi = {10.1109/WCNC.2003.1200429}, author = {Banerjee,S. and Misra,A. and Yeo,Jihwang and Agrawala, Ashok K.} } @conference {13240, title = {Exemplar-based tracking and recognition of arm gestures}, booktitle = {Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the 3rd International Symposium on}, volume = {2}, year = {2003}, month = {2003/09//}, pages = {656 - 661 Vol.2 - 656 - 661 Vol.2}, abstract = {This paper presents a probabilistic exemplar-based framework for recognizing gestures. The approach is based on representing each gesture as a sequence of learned body poses. The gestures are recognized through a probabilistic framework for matching these body poses and for imposing temporal constrains between different poses. Matching individual poses to image data is performed using a probabilistic formulation for edge matching to obtain a likelihood measurement for each individual pose. The paper introduces a correspondence-free weighted matching scheme for edge templates that emphasize discriminating features in the matching. The weighting does not require establishing correspondences between the different pose models. The probabilistic framework also imposes temporal constrains between different pose through a learned hidden Markov model (HMM) of each gesture.}, keywords = {arm, constrains;, correspondence-free, edge, exemplar-based, framework;, gesture, hidden, HMM;, image, logic;, Markov, MATCHING, matching;, model;, models;, probabilistic, recognition;, scheme;, segmentation;, temporal, tracking;, weighted}, doi = {10.1109/ISPA.2003.1296358}, author = {Elgammal,A. and Shet,V. and Yacoob,Yaser and Davis, Larry S.} } @article {14060, title = {Extracting significant features from the HRTF}, journal = {Proceedings of the 2003 International Conference on Auditory Display}, year = {2003}, month = {2003///}, abstract = {The Head Related Transfer Function (HRTF) characterizes the au-ditory cues created by scattering of sound off a person{\textquoteright}s anatomy. While it is known that features in the HRTF can be associated with various phenomena, such as head diffraction, head and torso re- flection, knee reflection and pinna resonances and anti resonances, identification of these phenomena are usually qualitative and/or heuristic. The objective of this paper is to attempt to decompose the HRTF and extract significant features that are perceptually im- portant for source localization. Some of the significant features that have been identified are the pinna resonances and the notches in the spectrum caused by various parts of the body. We develop signal processing algorithms to decompose the HRTF into compo- nents, and extract the features corresponding to each component. The support of NSF award ITR-0086075 is gratefully acknowl- edged }, author = {Raykar,V.C. and Duraiswami, Ramani and Davis, Larry S. and Yegnanarayana,B.} } @article {13251, title = {Extracting significant features from the hrtf}, journal = {Proceedings of the 2003 International Conference on Auditory Display}, year = {2003}, month = {2003///}, abstract = {The Head Related Transfer Function (HRTF) characterizes the au-ditory cues created by scattering of sound off a person{\textquoteright}s anatomy. While it is known that features in the HRTF can be associated with various phenomena, such as head diffraction, head and torso re- flection, knee reflection and pinna resonances and anti resonances, identification of these phenomena are usually qualitative and/or heuristic. The objective of this paper is to attempt to decompose the HRTF and extract significant features that are perceptually im- portant for source localization. Some of the significant features that have been identified are the pinna resonances and the notches in the spectrum caused by various parts of the body. We develop signal processing algorithms to decompose the HRTF into compo- nents, and extract the features corresponding to each component. The support of NSF award ITR-0086075 is gratefully acknowl- edged }, author = {Raykar,V.C. and Duraiswami, Ramani and Davis, Larry S. and Yegnanarayana,B.} } @conference {18340, title = {Footloose: a case for physical eventual consistency and selective conflict resolution}, booktitle = {Mobile Computing Systems and Applications, 2003. Proceedings. Fifth IEEE Workshop on}, year = {2003}, month = {2003///}, pages = {170 - 179}, publisher = {IEEE}, organization = {IEEE}, abstract = {Users are increasingly inundated with small devices with communication and storage capabilities. Unfortunately, the user is still responsible for reconciling all of the devices whenever a change is made. We present Footloose, a user-centered data store that can share data and reconcile conflicts across diverse devices. Footloose is an optimistic system based on physical eventual consistency: consistency based on the movement of devices, and selective conflict resolution, which allows conflicts to flow through devices that cannot resolve the conflict to devices that can. Using these techniques, Footloose can present consistent views of data on the devices closest to the user without user interaction.}, isbn = {0-7695-1995-4}, doi = {10.1109/MCSA.2003.1240778}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1240778}, author = {Paluska and Saff and Yeh and Chen} } @conference {15143, title = {Forward secrecy in password-only key exchange protocols}, booktitle = {Proceedings of the 3rd international conference on Security in communication networks}, series = {SCN{\textquoteright}02}, year = {2003}, month = {2003///}, pages = {29 - 44}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {Password-only authenticated key exchange (PAKE) protocols are designed to be secure even when users choose short, easily-guessed passwords. Security requires, in particular, that the protocol cannot be broken by an off-line dictionary attack in which an adversary enumerates all possible passwords in an attempt to determine the correct one based on previously-viewed transcripts. Recently, provably-secure protocols for PAKE were given in the idealized random oracle/ideal cipher models [2,8,19] and in the standard model based on general assumptions [11] or the DDH assumption [14]. The latter protocol (the KOY protocol) is currently the only known practical solution based on standard assumptions. However, only a proof of basic security for this protocol has appeared. In the basic setting the adversary is assumed not to corrupt clients (thereby learning their passwords) or servers (thereby modifying the value of stored passwords). Simplifying and unifying previous work, we present a natural definition of security which incorporates the more challenging requirement of forward secrecy. We then demonstrate via an explicit attack that the KOY protocol as originally presented is not secure under this definition. This provides the first natural example showing that forward secrecy is a strictly stronger requirement for PAKE protocols. Finally, we present a slight modification of the KOY protocol which prevents the attack and - as the main technical contribution of this paper - rigorously prove that the modified protocol achieves forward secrecy.}, isbn = {3-540-00420-3}, url = {http://dl.acm.org/citation.cfm?id=1766811.1766816}, author = {Katz, Jonathan and Ostrovsky,Rafail and Yung,Moti} } @inbook {12741, title = {Gait Analysis for Human Identification}, booktitle = {Audio- and Video-Based Biometric Person AuthenticationAudio- and Video-Based Biometric Person Authentication}, series = {Lecture Notes in Computer Science}, volume = {2688}, year = {2003}, month = {2003///}, pages = {1058 - 1058}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Human gait is an attractive modality for recognizing people at a distance. In this paper we adopt an appearance-based approach to the problem of gait recognition. The width of the outer contour of the binarized silhouette of a walking person is chosen as the basic image feature. Different gait features are extracted from the width vector such as the dowsampled, smoothed width vectors, the velocity profile etc. and sequences of such temporally ordered feature vectors are used for representing a person{\textquoteright}s gait. We use the dynamic time-warping (DTW) approach for matching so that non-linear time normalization may be used to deal with the naturally-occuring changes in walking speed. The performance of the proposed method is tested using different gait databases.}, isbn = {978-3-540-40302-9}, url = {http://dx.doi.org/10.1007/3-540-44887-X_82}, author = {Kale, A. and Cuntoor, N. and Yegnanarayana,B. and Rajagopalan, AN and Chellapa, Rama}, editor = {Kittler,Josef and Nixon,Mark} } @article {18223, title = {Human visual model for data hiding}, volume = {:~09/691,544}, year = {2003}, month = {2003/08/26/}, abstract = {A method and apparatus of hiding identification data in visual media. When image or video data is received, frequency masking is performed to divide the image or video data into blocks of smooth regions and blocks of non-smooth regions and to obtain preliminary just-noticeable-difference. Edge detection is performed to divide the non-smooth region of the image or video data into texture blocks and edge blocks. Then blocks of regions that are substantially proximate to blocks of smooth regions of the image or video data are determined. The image or video data is then adjusted by applying different strength of watermark in association with the type of each block.}, url = {http://www.google.com/patents?id=aNgOAAAAEBAJ}, author = {M. Wu and Yu,Hong Heather}, editor = {Matsushita Electric Industrial Co., Ltd.} } @conference {13237, title = {Improved fast gauss transform and efficient kernel density estimation}, booktitle = {Computer Vision, 2003. Proceedings. Ninth IEEE International Conference on}, year = {2003}, month = {2003/10//}, pages = {664 -671 vol.1 - 664 -671 vol.1}, abstract = {Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimation technique. The quadratic computational complexity of the summation is a significant barrier to the scalability of this algorithm to practical applications. The fast Gauss transform (FGT) has successfully accelerated the kernel density estimation to linear running time for low-dimensional problems. Unfortunately, the cost of a direct extension of the FGT to higher-dimensional problems grows exponentially with dimension, making it impractical for dimensions above 3. We develop an improved fast Gauss transform to efficiently estimate sums of Gaussians in higher dimensions, where a new multivariate expansion scheme and an adaptive space subdivision technique dramatically improve the performance. The improved FGT has been applied to the mean shift algorithm achieving linear computational complexity. Experimental results demonstrate the efficiency and effectiveness of our algorithm.}, keywords = {adaptive, algorithm;multivariate, complexity;computer, complexity;Gaussian, computational, density, estimation;mean, expansion, Gauss, processes;computational, recognition;quadratic, scheme;pattern, shift, space, subdivision, technique;computer, theory;, transform;kernel, vision;estimation, vision;fast}, doi = {10.1109/ICCV.2003.1238383}, author = {Yang,C. and Duraiswami, Ramani and Gumerov, Nail A. and Davis, Larry S.} } @article {15183, title = {Intrusion-resilient public-key encryption}, journal = {Topics in Cryptology{\textemdash}CT-RSA 2003}, year = {2003}, month = {2003///}, pages = {19 - 32}, abstract = {Exposure of secret keys seems to be inevitable, and may in practice represent the most likely point of failure in a cryptographic system. Recently, the notion of intrusion-resilience [17] (which extends both the notions of forward security [3], [5] and key insulation [11]) was proposed as a means of mitigating the harmful effects that key exposure can have. In this model, time is divided into distinct periods; the public key remains fixed throughout the lifetime of the protocol but the secret key is periodically updated. Secret information is stored by both a user and a base; the user performs all cryptographic operations during a given time period, while the base helps the user periodically update his key. Intrusion-resilient schemes remain secure in the face of multiple compromises of both the user and the base, as long as they are not both compromised simultaneously. Furthermore, in case the user and base are compromised simultaneously, prior time periods remain secure (as in forward-secure schemes). Intrusion-resilient signature schemes have been previously constructed [17], [15]. Here, we give the first construction of an intrusion-resilient publickey encryption scheme, based on the recently-constructed forwardsecure encryption scheme of [8]. We also consider generic transformations for securing intrusion-resilient encryption schemes against chosenciphertext attacks.}, doi = {10.1007/3-540-36563-X_2}, author = {Dodis,Y. and Franklin,M. and Katz, Jonathan and Miyaji,A. and Yung,M.} } @conference {13247, title = {Learning dynamics for exemplar-based gesture recognition}, booktitle = {Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on}, volume = {1}, year = {2003}, month = {2003/06//}, pages = {I-571 - I-578 vol.1 - I-571 - I-578 vol.1}, abstract = {This paper addresses the problem of capturing the dynamics for exemplar-based recognition systems. Traditional HMM provides a probabilistic tool to capture system dynamics and in exemplar paradigm, HMM states are typically coupled with the exemplars. Alternatively, we propose a non-parametric HMM approach that uses a discrete HMM with arbitrary states (decoupled from exemplars) to capture the dynamics over a large exemplar space where a nonparametric estimation approach is used to model the exemplar distribution. This reduces the need for lengthy and non-optimal training of the HMM observation model. We used the proposed approach for view-based recognition of gestures. The approach is based on representing each gesture as a sequence of learned body poses (exemplars). The gestures are recognized through a probabilistic framework for matching these body poses and for imposing temporal constraints between different poses using the proposed non-parametric HMM.}, keywords = {arbitrary, body, by, Computer, constraint;, detection;, discrete, distribution, dynamics;, edge, estimation;, example;, exemplar, exemplar-based, extraction;, feature, framework;, gesture, gesture;, hidden, HMM;, human, image, learning, Markov, matching;, model;, models;, motion;, nonparametric, pose, probabilistic, recognition;, sequence;, space;, state;, statistics;, system, temporal, tool;, view-based, vision;}, doi = {10.1109/CVPR.2003.1211405}, author = {Elgammal,A. and Shet,V. and Yacoob,Yaser and Davis, Larry S.} } @conference {13239, title = {Mean-shift analysis using quasiNewton methods}, booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on}, volume = {2}, year = {2003}, month = {2003/09//}, pages = {II - 447-50 vol.3 - II - 447-50 vol.3}, abstract = {Mean-shift analysis is a general nonparametric clustering technique based on density estimation for the analysis of complex feature spaces. The algorithm consists of a simple iterative procedure that shifts each of the feature points to the nearest stationary point along the gradient directions of the estimated density function. It has been successfully applied to many applications such as segmentation and tracking. However, despite its promising performance, there are applications for which the algorithm converges too slowly to be practical. We propose and implement an improved version of the mean-shift algorithm using quasiNewton methods to achieve higher convergence rates. Another benefit of our algorithm is its ability to achieve clustering even for very complex and irregular feature-space topography. Experimental results demonstrate the efficiency and effectiveness of our algorithm.}, keywords = {analysis;, classification;, clustering, clustering;, Convergence, density, estimation;, feature-space, image, irregular, iterative, Mean-shift, method;, methods;, Newton, nonparametric, pattern, procedure;, quasiNewton, rates;, segmentation;, technique;, topography;}, doi = {10.1109/ICIP.2003.1246713}, author = {Yang,C. and Duraiswami, Ramani and DeMenthon,D. and Davis, Larry S.} } @article {12953, title = {Reduction of Cholera in Bangladeshi Villages by Simple Filtration}, journal = {Proceedings of the National Academy of SciencesPNAS}, volume = {100}, year = {2003}, month = {2003/02/04/}, pages = {1051 - 1055}, abstract = {Based on results of ecological studies demonstrating that Vibrio cholerae, the etiological agent of epidemic cholera, is commensal to zooplankton, notably copepods, a simple filtration procedure was developed whereby zooplankton, most phytoplankton, and particulates >20 μm were removed from water before use. Effective deployment of this filtration procedure, from September 1999 through July 2002 in 65 villages of rural Bangladesh, of which the total population for the entire study comprised ≈133,000 individuals, yielded a 48\% reduction in cholera (P < 0.005) compared with the control.}, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0237386100}, url = {http://www.pnas.org/content/100/3/1051}, author = {Rita R Colwell and Huq,Anwar and M. Sirajul Islam and K. M. A. Aziz and Yunus,M. and N. Huda Khan and A. Mahmud and Sack,R. Bradley and Nair,G. B. and J. Chakraborty and Sack,David A. and E. Russek-Cohen} } @article {15074, title = {Scalable protocols for authenticated group key exchange}, journal = {Advances in Cryptology-CRYPTO 2003}, year = {2003}, month = {2003///}, pages = {110 - 125}, abstract = {We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have been proposed; however, all provably-secure solutions thus far are not scalable and, in particular, require n rounds. Our main contribution is the first scalable protocol for this problem along with a rigorous proof of security in the standard model under the DDH assumption; our protocol uses a constant number of rounds and requires only O(1) modular exponentiations per user (for key derivation). Toward this goal and of independent interest, we first present a scalable compiler that transforms any group key-exchange protocol secure against a passive eavesdropper to an authenticated protocol which is secure against an active adversary who controls all communication in the network. This compiler adds only one round and O(1) communication (per user) to the original scheme. We then prove secure {\textemdash} against a passive adversary {\textemdash} a variant of the two-round group key-exchange protocol of Burmester and Desmedt. Applying our compiler to this protocol results in a provably-secure three-round protocol for authenticated group key exchange which also achieves forward secrecy.}, doi = {10.1007/978-3-540-45146-4_7}, author = {Katz, Jonathan and Yung,M.} } @conference {12078, title = {A secure service discovery protocol for MANET}, booktitle = {14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003}, volume = {1}, year = {2003}, month = {2003/09/07/10}, pages = {502- 506 Vol.1 - 502- 506 Vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {Service discovery technologies are exploited to enable services to advertise their existence in a dynamic way, and can be discovered, configured and used by other devices with minimum manual efforts. It plays an essential role in future network scenarios especially with development of mobile ad hoc network (MANET) and emergence of pervasive computing. Because MANET allows these devices to communicate dynamically without fixed infrastructure and centralized administration, it gives rise to the challenges of the service discovery techniques. In this paper, we present a dynamic service discovery infrastructure that uses XML to describe services and match using the semantic content of service descriptions for MANET. We believe that the architecture we have designed is a necessary component of service discovery in non-infrastructure network by further exploring the secure and performance issues of this infrastructure.}, keywords = {ad hoc networks, centralized administration, Computer architecture, Computer science, dynamic service discovery infrastructure, Educational institutions, MANET, Manuals, mobile ad hoc network, Mobile ad hoc networks, Mobile computing, mobile radio, noninfrastructure network, Pervasive computing, Protocols, routing protocols, secure service discovery protocol, Security, service discovery techniques, service discovery technologies, telecommunication computing, telecommunication services, XML}, isbn = {0-7803-7822-9}, doi = {10.1109/PIMRC.2003.1264322}, author = {Yuan Yuan and Arbaugh, William A.} } @conference {12725, title = {Shape and motion driven particle filtering for human body tracking}, booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on}, volume = {3}, year = {2003}, month = {2003/07//}, pages = {III - 61-4 vol.3 - III - 61-4 vol.3}, abstract = {In this paper, we propose a method to recover 3D human body motion from a video acquired by a single static camera. In order to estimate the complex state distribution of a human body, we adopt the particle filtering framework. We present the human body using several layers of representation and compose the whole body step by step. In this way, more effective particles are generated and ineffective particles are removed as we process each layer. In order to deal with the rotational motion, the frequency of rotation is obtained using a preprocessing operation. In the preprocessing step, the variance of the motion field at each image is computed, and the frequency of rotation is estimated. The estimated frequency is used for the state update in the algorithm. We successfully track the movement of figure skaters in TV broadcast image sequence, and recover the 3D shape and motion of the skater.}, keywords = {3D, body, broadcast, camera;, cameras;, estimation;, Filtering, framework;, human, image, MOTION, motion;, particle, processing;, rotational, sequence;, sequences;, signal, single, static, theory;, tracking;, TV, video}, doi = {10.1109/ICME.2003.1221248}, author = {Yamamoto, T. and Chellapa, Rama} } @article {18870, title = {SHOP2: An HTN planning system}, journal = {J. Artif. Intell. Res. (JAIR)}, volume = {20}, year = {2003}, month = {2003///}, pages = {379 - 404}, abstract = {The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel in the competition, especially those aspects of SHOP2 that deal with temporal and metric planning domains.}, url = {https://www.aaai.org/Papers/JAIR/Vol20/JAIR-2013.pdf}, author = {Nau, Dana S. and Au,T. C and Ilghami,O. and Kuter,U. and Murdock,J. W. and Wu,D. and Yaman,F.} } @conference {14059, title = {Tracking a moving speaker using excitation source information}, booktitle = {Eighth European Conference on Speech Communication and Technology}, year = {2003}, month = {2003///}, abstract = {Microphone arrays are widely used to detect, locate, and track a stationary or moving speaker. The first step is to estimate the time delay, between the speech signals received by a pair of microphones. Conventional methods like generalized cross-correlation are based on the spectral content of the vocal tract system in the speech signal. The spectral content of the speech signal is affected due to degradations in the speech signal caused by noise and reverberation. However, features corresponding to the excitation source of speech are less affected by such degradations. This paper proposes a novel method to estimate the time delays using the excitation source information in speech. The estimated delays are used to get the position of the moving speaker. The proposed method is compared with the spectrum-based approach using real data from a microphone array setup.}, author = {Raykar,V.C. and Duraiswami, Ramani and Yegnanarayana,B. and Prasanna,S. R.M} } @conference {16906, title = {VASCO: visualizing and animating spatial constructs and operations}, booktitle = {Proceedings of the nineteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {374 - 375}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A video is used to demonstrate a set of spatial index JAVA applets that enable users on the worldwide web to experiment with a number of variants of the quadtree spatial data structure for different spatial data types, and, most importantly, enable them to see in an animated manner how a number of basic search operations are executed for them. The spatial data types are points, line segments, rectangles, and regions. The search operations are the window query (i.e., a spatial range query) and a nearest neighbor query that enables ranking spatial objects in the order of their distance from a given query object. The representations and algorithms are visualized and animated in a consistent manner using the same primitives and colors so that the differences between the effects of the representations can be easily understood. The video demonstrates the PR quadtree, PM1 quadtree, and R-tree. The applets can be found at: www.cs.umd.edu/~hjs/quadtree/.}, keywords = {k-d trees, Nearest neighbor algorithms, quadtrees, R-trees, Visualization}, isbn = {1-58113-663-3}, doi = {10.1145/777792.777849}, url = {http://doi.acm.org/10.1145/777792.777849}, author = {Brabec,Frantivsek and Samet, Hanan and Yilmaz,Cemal} } @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 {18326, title = {Embedded grammar tags: advancing natural language interaction on the Web}, journal = {Intelligent Systems, IEEE}, volume = {17}, year = {2002}, month = {2002///}, pages = {48 - 53}, abstract = {Embedded grammar tags (EGTs) reflect Web page content by anticipating queries users might launch to retrieve that content. The grammars provide a unifying component for speech recognition engines, semantic Web page representation, and speech output generation. We propose a new framework that lets intelligent agents discover accurate, concise responses to natural language queries. This framework{\textquoteright}s backbone consists of embedded grammar tags that capture natural language queries. EGTs reflect information content in Web pages by anticipating the queries that users might launch to retrieve particular content.}, keywords = {embedded grammar tags, grammars, information content, information resources, intelligent agents, Internet, natural language interaction, natural language queries, natural languages, Search engines, semantic Web page representation, software agents, speech output generation, Speech recognition, speech recognition engines, Web page content}, isbn = {1541-1672}, doi = {10.1109/5254.988450}, author = {Dorai,G. K and Yacoob,Yaser} } @article {16270, title = {Genome sequence and comparative analysis of the model rodent malaria parasite Plasmodium yoelii yoelii}, journal = {Nature}, volume = {419}, year = {2002}, month = {2002/10/03/}, pages = {512 - 519}, abstract = {Species of malaria parasite that infect rodents have long been used as models for malaria disease research. Here we report the whole-genome shotgun sequence of one species, Plasmodium yoelii yoelii, and comparative studies with the genome of the human malaria parasite Plasmodium falciparum clone 3D7. A synteny map of 2,212 P. y. yoelii contiguous DNA sequences (contigs) aligned to 14 P. falciparum chromosomes reveals marked conservation of gene synteny within the body of each chromosome. Of about 5,300 P. falciparum genes, more than 3,300 P. y. yoelii orthologues of predominantly metabolic function were identified. Over 800 copies of a variant antigen gene located in subtelomeric regions were found. This is the first genome sequence of a model eukaryotic parasite, and it provides insight into the use of such systems in the modelling of Plasmodium biology and disease.}, isbn = {0028-0836}, doi = {10.1038/nature01099}, url = {http://www.nature.com/nature/journal/v419/n6906/full/nature01099.html}, author = {Carlton,Jane M. and Angiuoli,Samuel V and Suh,Bernard B. and Kooij,Taco W. and Pertea,Mihaela and Silva,Joana C. and Ermolaeva,Maria D. and Allen,Jonathan E and Jeremy D Selengut and Koo,Hean L. and Peterson,Jeremy D. and Pop, Mihai and Kosack,Daniel S. and Shumway,Martin F. and Bidwell,Shelby L. and Shallom,Shamira J. and Aken,Susan E. van and Riedmuller,Steven B. and Feldblyum,Tamara V. and Cho,Jennifer K. and Quackenbush,John and Sedegah,Martha and Shoaibi,Azadeh and Cummings,Leda M. and Florens,Laurence and Yates,John R. and Raine,J. Dale and Sinden,Robert E. and Harris,Michael A. and Cunningham,Deirdre A. and Preiser,Peter R. and Bergman,Lawrence W. and Vaidya,Akhil B. and Lin,Leo H. van and Janse,Chris J. and Waters,Andrew P. and Smith,Hamilton O. and White,Owen R. and Salzberg,Steven L. and Venter,J. Craig and Fraser,Claire M. and Hoffman,Stephen L. and Gardner,Malcolm J. and Carucci,Daniel J.} } @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} } @conference {13053, title = {The importance of lexicalized syntax models for natural language generation tasks}, booktitle = {Proc. of INLG}, year = {2002}, month = {2002///}, pages = {9 - 16}, author = {Daum{\'e}, Hal and Knight,K. and Langkilde-Geary,I. and Marcu,D. and Yamada,K.} } @article {15101, title = {Incremental unforgeable encryption}, journal = {Fast Software Encryption}, year = {2002}, month = {2002///}, pages = {317 - 325}, abstract = {The recent selection of the AES block cipher to replace DES has generated interest in developing new modes of operation to supplement the modes defined as part of the DES standard [1,16,23]. We initiate the study of modes of encryption which are both incremental and unforgeable, and point out a number of applications for modes meeting these requirements. We also propose three specific modes achieving these goals, and discuss the strengths and weaknesses of each.}, doi = {10.1007/3-540-45473-X_9}, author = {Buonanno,E. and Katz, Jonathan and Yung,M.} } @article {15094, title = {Key-insulated public key cryptosystems}, journal = {Advances in Cryptology{\textemdash}Eurocrypt 2002}, year = {2002}, month = {2002///}, pages = {65 - 82}, abstract = {Cryptographic computations (decryption, signature generation, etc.) are often performed on a relatively insecure device (e.g., a mobile device or an Internet-connected host) which cannot be trusted to maintain secrecy of the private key. We propose and investigate the notion of key-insulated security whose goal is to minimize the damage caused by secret-key exposures. In our model, the secret key(s) stored on the insecure device are refreshed at discrete time periods via inter-action with a physically-secure - but computationally-limited - device which stores a {\textquotedblleft}master key{\textquotedblright}. All cryptographic computations are still done on the insecure device, and the public key remains unchanged. In a (t, N)-key-insulated scheme, an adversary who compromises the insecure device and obtains secret keys for up to t periods of his choice is unable to violate the security of the cryptosystem for any of the remaining N - t periods. Furthermore, the scheme remains secure (for all time periods) against an adversary who compromises only the physically-secure device. We focus primarily on key-insulated public-key encryption. We construct a (t, N)-key-insulated encryption scheme based on any (standard) public-key encryption scheme, and give a more efficient construction based on the DDH assumption. The latter construction is then extended to achieve chosen-ciphertext security.}, doi = {10.1007/3-540-46035-7_5}, author = {Dodis,Y. and Katz, Jonathan and Xu,S. and Yung,M.} } @article {17290, title = {Media Conversion from Visual to Audio: Voice Browsers}, journal = {Technical Reports of the Computer Science Department}, year = {2002}, month = {2002/12/19/}, abstract = {There is a large amount of information on the World Wide Web that is atthe fingertips of anyone with access to the internet. However, so far this information has primarily been used by people who connect to the web via traditional computer. This is about to change. Recent advances in wireless communication, speech recognition, and speech synthesis technologies have made it possible to access this information from any place, and at any time. In this paper, we discuss voice browsers as compared to current web browsers. Some of the primary techniques of universal accessible design are listed with their relation to voice browsers and some ideas are offered to help authors implementing these considerations when designing web pages. The new voice markup language is briefly discussed. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/534}, author = {Youssef,Adel and Shneiderman, Ben} } @article {18240, title = {Methods and apparatus for multi-layer data hiding}, volume = {:~09/427,321}, year = {2002}, month = {2002/09/24/}, abstract = {A data hiding system and method for providing a method of embedding multiple layers of hidden data into multimedia data. First, a media unit of the multimedia data is evaluated to determine an appropriate embedding procedure. Next during a first embedding pass, a ruling layer of primary hidden data is embedded into the media unit. In another embedding pass, a governing layer of secondary hidden data is embedded on top of the ruling layer. The secondary hidden data provides control information for controlling the primary hidden data and the host data. Control information such as error correction data, synchronization data, decoding data, and authentication data is embedded in the governing layer. Embedding schemes such as base domain and spectrum domain embedding are employed.}, url = {http://www.google.com/patents?id=1KYLAAAAEBAJ}, author = {Yu,Hong Heather and M. Wu and Li,Xin and Gelman,Alexander D.}, editor = {Matsushita Electric Industrial Co., Ltd.} } @article {15299, title = {Omnibase: Uniform access to heterogeneous data for question answering}, journal = {Natural Language Processing and Information Systems}, year = {2002}, month = {2002///}, pages = {230 - 234}, abstract = {Although the World Wide Web contains a tremendous amount of information, the lack of uniform structure makes finding the right knowledge difficult. A solution is to turn the Web into a {\textquotedblleft}virtual database{\textquotedblright} and to access it through natural language.We built Omnibase, a system that integrates heterogeneous data sources using an object- property-value model. With the help of Omnibase, our Start natural language system can now access numerous heterogeneous data sources on the Web in a uniform manner, and answers millions of user questions with high precision.}, doi = {10.1007/3-540-36271-1_23}, author = {Katz,B. and Felshin,S. and Yuret,D. and Ibrahim,A. and Jimmy Lin and Marton,G. and Jerome McFarland,A. and Temelkuran,B.} } @article {11914, title = {A Probabilistic Clustering-Based Indoor Location Determination System}, journal = {Technical Reports from UMIACS, UMIACS-TR-2002-30}, year = {2002}, month = {2002/04/04/}, abstract = {We present an indoor location determination system based on signalstrength probability distributions for tackling the noisy wireless channel and clustering to reduce computation requirements. We provide two implementation techniques, namely, Joint Clustering and Incremental Triangulation and describe their tradeoffs in terms of location determination accuracy and computation requirement. Both techniques have been incorporated in two implemented context-aware systems: User Positioning System and the Rover System, both running on Compaq iPAQ Pocket PC{\textquoteright}s with Familiar distribution of Linux for PDA{\textquoteright}s. The results obtained show that both techniques give the user location with over 90\% accuracy to within 7 feet with very low computation requirements, hence enabling a set of context-aware applications. Also UMIACS-TR-2002-30 }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1192}, author = {Youssef,Moustafa A and Agrawala, Ashok K. and A. Udaya Shankar and Noh,Sam H} } @article {18157, title = {A robust error resilient approach for MPEG video transmission over internet}, journal = {Visual Communication and Image Processing, SPIE}, volume = {4671}, year = {2002}, month = {2002///}, pages = {103 - 111}, abstract = {In network delivery of compressed video, packets may be lost if the channel is unreliable. Such losses tend to occur inburst. In this paper, we develop an error resilient video encoding approach to help error concealment at the decoder. We introduce a new block shuffling scheme to isolate erroneous blocks caused by packet losses. And we apply data hiding to add additional protection for motion vectors. The incorporation of these scheme adds little complexity to the standard encoder. Experimental results suggest that our approach can achieve a reasonable quality for packet loss up to 30\% over a wide range of video materials. }, author = {Yin,P. and Wu,M. and Liu,B.} } @article {11913, title = {Rover: scalable location-aware computing}, journal = {Computer}, volume = {35}, year = {2002}, month = {2002/10//}, pages = {46 - 53}, abstract = {All the components necessary for realizing location-aware computing are available in the marketplace today. What has hindered the widespread deployment of location-based systems is the lack of an integration architecture that scales with user populations. The authors have completed the initial implementation of Rover, a system designed to achieve this sort of integration and to automatically tailor information and services to a mobile user{\textquoteright}s location. Their studies have validated Rover{\textquoteright}s underlying software architecture, which achieves system scalability through high-resolution, application-specific resource scheduling at the servers and network. The authors believe that this technology will greatly enhance the user experience in many places, including museums, amusement and theme parks, shopping malls, game fields, offices, and business centers. They designed the system specifically to scale to large user populations and expect its benefits to increase with them.}, keywords = {amusement, application-specific, architecture;, automation;, business, business;, computing;, data, entertainment;, handheld, humanities;, integration, LAN;, location-aware, malls;, mobile, museums;, office, parks;, processing;, resource, Rover;, scalability;, scalable, scheduling;, shopping, software, system, theme, units;, user;, wireless}, isbn = {0018-9162}, doi = {10.1109/MC.2002.1039517}, author = {Banerjee,S. and Agarwal,S. and Kamel,K. and Kochut, A. and Kommareddy,C. and Nadeem,T. and Thakkar,P. and Trinh,Bao and Youssef,A. and Youssef, M. and Larsen,R.L. and Udaya Shankar,A. and Agrawala, Ashok K.} } @conference {18302, title = {Smiling faces are better for face recognition}, booktitle = {Fifth IEEE International Conference on Automatic Face and Gesture Recognition, 2002. Proceedings}, year = {2002}, month = {2002/05//}, pages = {52 - 57}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper investigates face recognition during facial expressions. While face expressions have been treated as an adverse factor in standard face recognition approaches, our research suggests that, if a system has a choice in the selection of faces to use in training and recognition, its best performance would be obtained on faces displaying expressions. Naturally, smiling faces are the most prevalent (among expressive faces) for both training and recognition in dynamic scenarios. We employ a measure of discrimination power that is computed from between-class and within-class scatter matrices. Two databases are used to show the performance differences on different sets of faces}, keywords = {between-class scatter matrices, Databases, discrimination power measure, dynamic scenarios, expressive faces, face recognition, facial expressions, performance, performance differences, smiling faces, software performance evaluation, Training, visual databases, within-class scatter matrices}, isbn = {0-7695-1602-5}, doi = {10.1109/AFGR.2002.1004132}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {15153, title = {Strong key-insulated signature schemes}, journal = {Public Key Cryptography{\textemdash}PKC 2003}, year = {2002}, month = {2002///}, pages = {130 - 144}, abstract = {Signature computation is frequently performed on insecure devices{\textemdash}e.g., mobile phones {\textemdash} operating in an environment where the private (signing)k ey is likely to be exposed. Strong key-insulated signature schemes are one way to mitigate the damage done when this occurs. In the key-insulated model [6], the secret key stored on an insecure device is refreshed at discrete time periods via interaction with a physically-secure device which stores a {\textquotedblleft}master key{\textquotedblright}. All signing is still done by the insecure device, and the public key remains fixed throughout the lifetime of the protocol. In a strong (t,N)-key-insulated scheme, an adversary who compromises the insecure device and obtains secret keys for up to t periods is unable to forge signatures for any of the remaining N-t periods. Furthermore, the physically-secure device (or an adversary who compromises only this device)is unable to forge signatures for any time period.We present here constructions of strong key-insulated signature schemes based on a variety of assumptions. First, we demonstrate a generic construction of a strong (N{\textemdash} 1,N)-key-insulated signature scheme using any standard signature scheme. We then give a construction of a strong (t,N)-signature scheme whose security may be based on the discrete logarithm assumption in the random oracle model. This construction offers faster signing and verification than the generic construction, at the expense of O(t)k ey update time and key length. Finally, we construct strong (N {\textemdash}1,N)-key-insulated schemes based on any {\textquotedblleft}trapdoor signature scheme{\textquotedblright} (a notion we introduce here); our resulting construction in fact serves as an identity-based signature scheme as well. This leads to very efficient solutions based on, e.g., the RSA assumption in the random oracle model. Work done in part while at DIMACS. }, doi = {10.1007/3-540-36288-6_10}, author = {Dodis,Y. and Katz, Jonathan and Xu,S. and Yung,M.} } @article {17973, title = {System and method for entering text in a virtual environment}, volume = {:~09/364,433}, year = {2002}, month = {2002/06/18/}, abstract = {A system and method for entering text in a virtual environment by sensory gloves. The user enters a key that represents one or more letters by simulating a press of a keyboard in the gloves. The user calibrates the gloves by entering text, during which time the system establishes threshold values that represent simulated presses for each finger. After the initial calibration of the sensory gloves, the user enters text with simulated finger presses. The system distinguishes which movements are intended as simulated finger presses by examining the relative motions of fingers and maintaining dynamic thresholds. Errors are alleviated by providing feedback to the user, such as beeps and a visual display of the fingers and the current text. Because keys may represent more than one character, the system determines the intended text by probabilistic analysis and the Viterbi algorithm.}, url = {http://www.google.com/patents?id=w0QJAAAAEBAJ}, author = {Evans,Francine and Skiena,Steven and Varshney, Amitabh}, editor = {The Research Foundation of the State University of New York} } @article {15091, title = {Threshold cryptosystems based on factoring}, journal = {Advances in Cryptology{\textemdash}ASIACRYPT 2002}, year = {2002}, month = {2002///}, pages = {139 - 147}, abstract = {We consider threshold cryptosystems over a composite modulus N where the factors of N are shared among the participants as the secret key. This is a new paradigm for threshold cryptosystems based on a composite modulus, differing from the typical treatment of RSA-based systems where a {\textquotedblleft}decryption exponent{\textquotedblright} is shared among the participants. Our approach yields solutions to some open problems in threshold cryptography; in particular, we obtain the following:1 Threshold Homomorphic Encryption. A number of applications (e.g., electronic voting or efficient multi-party computation) require threshold homomorphic encryption schemes. We present a protocol for threshold decryption of the homomorphic Goldwasser-Micali encryption scheme [34], answering an open question of [21]. 2 Threshold Cryptosystems as Secure as Factoring. We describe a threshold version of a variant of the signature standards ISO 9796-2 and PKCS$\#$1 v1.5 (cf. [39, Section 11.3.4]), thus giving the first threshold signature scheme whose security (in the random oracle model) is equivalent to the hardness of factoring [12]. Our techniques may be adapted to distribute the Rabin encryption scheme [44] whose semantic security may be reduced to the hardness of factoring. 3 Efficient Threshold Schemes without a Trusted Dealer. Because our schemes only require sharing of N - which furthermore need not be a product of strong primes - our schemes are very efficient (compared to previous schemes) when a trusted dealer is not assumed and key generation is done in a distributed manner. Extensions to achieve robustness and proactivation are also possible with our schemes. Work done while at Columbia University and Telcordia Technologies }, doi = {10.1007/3-540-36178-2_12}, author = {Katz, Jonathan and Yung,M.} } @article {13479, title = {Virtual Telescopes in Education}, journal = {Journal of Digital Information}, volume = {2}, year = {2002}, month = {2002///}, abstract = {Virtual Telescopes in Education is providing the services required to operate a virtual observatory comprising distributed telescopes, including an interactive, constraint-based scheduling service, data and resource archive, proposal preparation and review environment, and a VTIE Journal. A major goal of VTIE is to elicit from learners questions about the nature of celestial objects and the physical processes that give rise to the spectacular imagery that catches their imaginations. Generation of constrained science questions will assist learners in the science process. To achieve interoperability with other NSDL resources, our approach follows the Open Archives Initiative and the W3C Semantic Web activity.}, author = {Hoban,S. and desJardins, Marie and Farrell,N. and Rathod,P. and Sachs,J. and Sansare,S. and Yesha,Y. and Keating,J. and Busschots,B. and Means,J. and others} } @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 {15093, title = {Efficient password-authenticated key exchange using human-memorable passwords}, journal = {Advances in Cryptology{\textemdash}EUROCRYPT 2001}, year = {2001}, month = {2001///}, pages = {475 - 494}, abstract = {There has been much interest in password-authenticated keyexchange protocols which remain secure even when users choose passwords from a very small space of possible passwords (say, a dictionary of English words). Under this assumption, one must be careful to design protocols which cannot be broken using off-line dictionary attacks in which an adversary enumerates all possible passwords in an attempt to determine the correct one. Many heuristic protocols have been proposed to solve this important problem. Only recently have formal validations of security (namely, proofs in the idealized random oracle and ideal cipher models) been given for specific constructions [3,10,22].Very recently, a construction based on general assumptions, secure in the standard model with human-memorable passwords, has been proposed by Goldreich and Lindell [17]. Their protocol requires no public parameters; unfortunately, it requires techniques from general multi-party computation which make it impractical. Thus, [17] only proves that solutions are possible {\textquotedblleft}in principal{\textquotedblright}. The main question left open by their work was finding an efficient solution to this fundamental problem. We showan efficient, 3-round, password-authenticated key exchange protocol with human-memorable passwords which is provably secure under the Decisional Diffie-Hellman assumption, yet requires only (roughly) 8 times more computation than {\textquotedblleft}standard{\textquotedblright} Diffie-Hellman key exchange [14] (which provides no authentication at all). We assume public parameters available to all parties. We stress that we work in the standard model only, and do not require a {\textquotedblleft}random oracle{\textquotedblright} assumption. }, doi = {10.1007/3-540-44987-6_29}, author = {Katz, Jonathan and Ostrovsky,R. and Yung,M.} } @conference {18293, title = {Facilitating semantic web search with embedded grammar tags}, booktitle = {IJCAI Workshop on E-Business and Intelligent Web}, year = {2001}, month = {2001///}, author = {Dorai,G. K and Yacoob,Yaser} } @conference {18802, title = {A geometric algorithm for selecting optimal set of cutters for multi-part milling}, series = {SMA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {130 - 139}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {For the manufacture of milled parts, it is well known that the size of the cutter significantly affects the machining time. However, for small-batch manufacturing, the time spent on loading tools into the tool magazine and establishing z-length compensation values is just as important. If we can select a set of milling tools that will produce good machining time on more than one type of parts, then several unnecessary machine-tool reconfiguration operations can be eliminated. This paper describes a geometric algorithm for finding an optimal set of cutters for machining a set of 2{\textonehalf}D parts. In selecting milling cutters we consider both the tool loading time and the machining time and generate solutions that allow us to minimize the total machining time. Our problem formulation addresses the general problem of how to cover a target region to be milled with a cylindrical cutter without intersecting with the obstruction region; this definition allows us to handle both open and closed edges in the target region. Our algorithm improves upon previous work in the tool selection area in following ways: (1) in selecting cutters, it accounts for the tool loading time, and (2) it can simultaneously consider multiple different parts and select the optimal set of cutters to minimize the total manufacturing time.}, keywords = {computer-aided process planning, milling cutter selection}, isbn = {1-58113-366-9}, doi = {10.1145/376957.376973}, url = {http://doi.acm.org/10.1145/376957.376973}, author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.} } @article {18312, title = {Gesture-Driven Control of Spaces and Objects in Collaborative Augmented Reality}, journal = {GMD{\textendash}Forschungszentrum Informationstechnik GmbH}, year = {2001}, month = {2001///}, pages = {49 - 49}, author = {Yacoob,Yaser and Davis, Larry S.} } @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.} } @article {15103, title = {Unforgeable encryption and chosen ciphertext secure modes of operation}, journal = {Fast Software Encryption}, year = {2001}, month = {2001///}, pages = {25 - 36}, abstract = {We find certain neglected issues in the study of private-key encryption schemes. For one, private-key encryption is generally held to the same standard of security as public-key encryption (i.e., indistinguishability) even though usage of the two is very different. Secondly, though the importance of secure encryption of single blocks is well known, the security of modes of encryption (used to encrypt multiple blocks) is often ignored. With this in mind, we present definitions of a new notion of security for private-key encryption called encryption unforgeability which captures an adversary{\textquoteright}s inability to generate valid ciphertexts. We show applications of this definition to authentication protocols and adaptive chosen ciphertext security.Additionally, we present and analyze a new mode of encryption, RPC (for Related Plaintext Chaining), which is unforgeable in the strongest sense of the above definition. This gives the first mode provably secure against chosen ciphertext attacks. Although RPC is slightly less efficient than, say, CBC mode (requiring about 33\% more block cipher applications and having ciphertext expansion of the same amount when using a block cipher with 128-bit blocksize), it has highly parallelizable encryption and decryption operations. }, doi = {10.1007/3-540-44706-7_20}, author = {Katz, Jonathan and Yung,M.} } @inbook {14659, title = {Active Networking Means Evolution (or Enhanced Extensibility Required)}, booktitle = {Active NetworksActive Networks}, series = {Lecture Notes in Computer Science}, volume = {1942}, year = {2000}, month = {2000///}, pages = {16 - 32}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {A primary goal of active networking is to increase the pace of network evolution. Evolution is typically achieved via extensibility; that is, typical active network implementations provide an interface to extend network nodes withdyna mically loaded code. Most implementations employ plug-in extensibility , a technique for loading code characterized by a concrete, pre-defined abstraction of future change. While flexible and convenient, we argue that plug-in extensibility alone is not sufficient for true network evolution. Instead, we propose dynamic software updating , a technique that reduces the a priori assumptions of plug-in extensibility, improving flexibility and eliminating the need to pre-plan extensions. However, this additional flexibility creates issues involving validity and security. We discuss these issues, and describe the state-of-the-art in systems that support dynamic software updating, thus framing the problem for researchers developing next-generation active networks.}, isbn = {978-3-540-41179-6}, url = {http://dx.doi.org/10.1007/3-540-40057-5_2}, author = {Hicks, Michael W. and Nettles,Scott}, editor = {Yasuda,Hiroshi} } @conference {18332, title = {An assumptive logic programming methodology for parsing}, booktitle = {Tools with Artificial Intelligence, 2000. ICTAI 2000. Proceedings. 12th IEEE International Conference on}, year = {2000}, month = {2000///}, pages = {11 - 18}, publisher = {IEEE Comput. Soc}, organization = {IEEE Comput. Soc}, abstract = {We show how several novel tools in logic programming for AI (namely, continuation based linear and timeless assumptions, and datalog grammars) can assist us in producing terse treatments of difficult language processing phenomena. As a proof of concept, we present a concise parser for datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words), that uses assumptions and a combination of left-corner parsing and charting. We then study two test cases of this parser{\textquoteright}s application: complete constituent coordination, and error diagnosis and correction}, isbn = {0-7695-0909-6}, doi = {10.1109/TAI.2000.889840}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=889840}, author = {Voll,K. and Tom Yeh and Dahl,V.} } @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.} } @conference {16919, title = {A comparison of voice controlled and mouse controlled web browsing}, booktitle = {Proceedings of the fourth international ACM conference on Assistive technologies}, series = {Assets {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {72 - 79}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {human-computer, interaction, User interfaces, voice browsers, voice recognition, web browsing}, isbn = {1-58113-313-8}, doi = {10.1145/354324.354345}, url = {http://doi.acm.org/10.1145/354324.354345}, author = {Christian,Kevin and Kules,Bill and Shneiderman, Ben and Youssef,Adel} } @conference {15149, title = {Complete characterization of security notions for probabilistic private-key encryption}, booktitle = {Proceedings of the thirty-second annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {245 - 254}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {1-58113-184-4}, doi = {10.1145/335305.335335}, url = {http://doi.acm.org/10.1145/335305.335335}, author = {Katz, Jonathan and Yung,Moti} } @article {18296, title = {Design and use of linear models for image motion analysis}, journal = {International Journal of Computer Vision}, volume = {36}, year = {2000}, month = {2000///}, pages = {171 - 193}, author = {Fleet,D. J and Black,M. J and Yacoob,Yaser and Jepson,A. D} } @conference {13551, title = {Event Detection from MPEGVideo in the Compressed Domain}, booktitle = {ICPR}, year = {2000}, month = {2000///}, pages = {819 - 822}, abstract = {The use of information in the compressed domain allows for the rapid analysis of video content using standard hardware. This paper describes two techniques for detecting dynamic events using the motion vectors obtained from the MPEG video encoding. In the first technique, feature vectors from motion information form a high dimensional curve for a video clip and curve simplication allows us to browse the clip along portions where interesting events are likely to happen. In the second technique, the camera motion, pan, tilt, and zoom are computed from the motion vectors, and the residual vectors which are not explained by the camera motion are regarded as generated by moving blobs. Events are detected from these moving blobs.}, author = {Yoon,K. and DeMenthon,D. and David Doermann} } @conference {18769, title = {Finding the maximal cutter for 2-D milling operations}, year = {2000}, month = {2000///}, pages = {10 - 13}, abstract = {In this paper, we describe a new geometricalgorithm to determine the biggest feasible cutter size for 2-D milling operations to be performed using a single cutter. In particular: {\textbullet} We give a general definition of the problem as the task of covering a target region without interfering with an obstruction region. This definition encompasses the task of milling a general 2-D profile that includes both open and closed edges. {\textbullet} We discuss three alternative definitions of what it means for a cutter to be feasible, and explain which of these definitions is most appropriate for the above problem. {\textbullet} We present a geometric algorithm for finding the maximal cutter for 2-D milling operations, and we give an outline of a proof that our algorithm is correct. }, url = {http://www.cs.umd.edu/~nau/papers/yao2000finding.pdf}, author = {Yao,Z. and Gupta,S.K. and Nau, Dana S.} } @article {18800, title = {A Geometric Algorithm for Finding the Largest Milling Cutter}, volume = {ISR; TR 2000-40}, year = {2000}, month = {2000///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for2-D milling operations to be performed using a single cutter. In particular:

1. We give a general definition of the problem as the task of covering a target region without interfering with anobstruction region. This definition encompasses the task of milling a general 2-D profile that includes bothopen and closed edges.

2. We discuss three alternative definitions of what it means for a cutter to be feasible, and explain which of thesedefinitions is most appropriate for the above problem.

3. We present a geometric algorithm for finding the maximal cutter for 2-D milling operations, and we show thatour algorithm is correct.}, keywords = {algorithms, computational geometry, computer aided manufacturing CAM, cutter selection, Manufacturing, Next-Generation Product Realization Systems, path planning}, url = {http://drum.lib.umd.edu//handle/1903/6137}, author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.} } @conference {18770, title = {A geometric algorithm for finding the maximal cutter for 2-D milling operations}, year = {2000}, month = {2000///}, pages = {26 - 28}, abstract = {In this paper, we present a geometric algorithm of finding the maximal cutter for 2-Dmilling operations. Our algorithm works not only for the common closed pocket problem, but also for the general 2-D milling problems with open edges. We define the general 2-D milling process in terms of a {\textquotedblleft}target region{\textquotedblright} to be machined and an {\textquotedblleft}obstruction region{\textquotedblright} that should not intersect with the cutter during machining. Our algorithm finds the largest cutter that can cover the target region without interfering with the obstruction region. Finding the biggest cutter is expected to help in the selection of the right sets of tools and the right type of cutter trajectories, and thereby ensure high production rate and meet the required quality level. }, url = {http://www.cs.umd.edu/~nau/papers/yao2000geometric.pdf}, author = {Yao,Z. and Gupta,S.K. and Nau, Dana S.} } @article {18801, title = {A Geometric Algorithm for Multi-Part Milling Cutter Selection}, volume = {ISR; TR 2000-42}, year = {2000}, month = {2000///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {Mass customization results in smaller batch sizes in manufacturing that require large numbers of setup and tool changes. The traditional process planning that generates plans for one part at a time is no longer applicable.

In this paper, we propose the idea of process planning for small batch manufacturing, i.e., we simultaneously consider multiple parts and exploit opportunities for sharing manufacturing resources such that the process plan will be optimized over the entire set of parts. In particular, we discuss a geometric algorithm for multiple part cutter selection in 2-1/2D milling operations.

We define the 2-1/2D milling operations as covering the target region without intersecting with the obstruction region. This definition allows us to handle the open edge problem. Based on this definition, we first discuss the lower and upper bond of cutter sizes that are feasible for given parts. Then we introduce the geometric algorithm to find the coverable area for a given cutter. Following that, we discuss the approach of considering cutter loading time and changing time in multiple cutter selection for multiple parts. We represent the cutter selection problem as shortest path problem and use Dijkstra{\textquoteright}s algorithm to solve it. By using this algorithm, a set of cutters is selected to achieve the optimum machining cost for multiple parts.

Our research illustrates the multiple parts process planning approach that is suitable for small batch manufacturing. At the same time, the algorithm given in this paper clarifies the 2-1/2D milling problem and can also help in cutter path planning problem.}, keywords = {algorithms, computer aided manufacturing CAM, cutter selection, Manufacturing, multi-part process planning, Next-Generation Product Realization Systems, OPTIMIZATION}, url = {http://drum.lib.umd.edu//handle/1903/6139}, author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.} } @article {18295, title = {Learned models for estimation of rigid and articulated human motion from stationary or moving camera}, journal = {International Journal of Computer Vision}, volume = {36}, year = {2000}, month = {2000///}, pages = {5 - 30}, author = {Yacoob,Yaser and Davis, Larry S.} } @conference {18313, title = {A probabilistic framework for rigid and non-rigid appearance based tracking and recognition}, booktitle = {Automatic Face and Gesture Recognition, 2000. Proceedings. Fourth IEEE International Conference on}, year = {2000}, month = {2000///}, pages = {491 - 498}, author = {De la Torre,F. and Yacoob,Yaser and Davis, Larry S.} } @article {18314, title = {Robustly estimating changes in image appearance}, journal = {Computer Vision and Image Understanding}, volume = {78}, year = {2000}, month = {2000///}, pages = {8 - 31}, author = {Black,M. J and Fleet,D. J and Yacoob,Yaser} } @inbook {14732, title = {Scalable Resource Control in Active Networks}, booktitle = {Active NetworksActive Networks}, series = {Lecture Notes in Computer Science}, volume = {1942}, year = {2000}, month = {2000///}, pages = {343 - 357}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {The increased complexity of the service model relative to store-and-forward routers has made resource management one of the paramount concerns in active networking research and engineering. In this paper,we address two major challenges in scaling resource management-to-many-node active networks. The first is the use of market mechanisms and trading amongst nodes and programs with varying degrees of competition and cooperation to provide a scalable approach to managing active network resources. The second is the use of a trust-management architecture to ensure that the participants in the resource management marketplace have a policy-driven {\textquotedblleft}rule of law{\textquotedblright} in which marketplace decisions can be made and relied upon. We have used lottery scheduling and the Keynote trust-management system for our implementation, for which we provide some initial performance indications.}, isbn = {978-3-540-41179-6}, url = {http://dx.doi.org/10.1007/3-540-40057-5_25}, author = {Anagnostakis,Kostas and Hicks, Michael W. and Ioannidis,Sotiris and Keromytis,Angelos and Smith,Jonathan}, editor = {Yasuda,Hiroshi} } @article {18863, title = {Selecting Flat End Mills for 2-1/2D Milling Operations}, volume = {ISR; TR 2000-41}, year = {2000}, month = {2000///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {The size of milling cutter significantly affects the machining time. Therefore, in order to perform milling operations efficiently, we need to select a set of milling cutters with optimal sizes. It is difficult for human process planners to select the optimal or near optimal set of milling cutters due to complex geometric interactions among tools size, part shapes, and tool trajectories.

In this paper, we give a geometric algorithm to find the optimal cutters for 2-1/2D milling operations. We define the 2-1/2D milling operations as covering the target region without intersecting with the obstruction region. This definition allows us to handle the open edge problem. Based on this definition, we introduced the offsetting and inverse-offsetting algorithm to find the coverable area for a given cutter. Following that, we represent the cutter selection problem as shortest path problem and discuss the lower and upper bond of cutter sizes that are feasible for given parts. The Dijkstra{\textquoteright}s algorithm is used to solve the problem and thus a set of cutters is selected in order to achieve the optimum machining cost.

We believe the selection of optimum cutter combination can not only save manufacturing time but also help automatic process planning.}, keywords = {algorithms, computer aided manufacturing CAM, cutter selection, Manufacturing, Next-Generation Product Realization Systems}, url = {http://drum.lib.umd.edu//handle/1903/6138}, author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.} } @conference {18288, title = {Video access control via multi-level data hiding}, booktitle = {Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on}, volume = {1}, year = {2000}, month = {2000///}, pages = {381 -384 vol.1 - 381 -384 vol.1}, abstract = {The paper proposes novel data hiding algorithms and system design for high quality digital video. Instead of targeting on a single degree of robustness, which results in overestimation and/or underestimation of the noise conditions, we apply multi-level embedding to digital video to achieve more than one level of robustness-capacity tradeoff. In addition, an adaptive technique is proposed to determine how many bits are embedded in each part of the video. Besides user data, control information such as synchronization and the number of hidden user bits are embedded as well. The algorithm can be used for applications such as access control}, keywords = {access, adaptive, algorithms;hidden, bits;high, conditions;robustness;robustness-capacity, control;adaptive, data, data;video, design;user, digital, embedding;noise, encapsulation;multimedia, hiding, hiding;multi-level, information;data, processing;, QUALITY, signal, systems;authorisation;data, systems;video, technique;control, tradeoff;system, user, video;multi-level}, doi = {10.1109/ICME.2000.869620}, author = {M. Wu and Yu,Hong Heather} } @conference {18289, title = {Video transcoding by reducing spatial resolution}, booktitle = {Image Processing, 2000. Proceedings. 2000 International Conference on}, volume = {1}, year = {2000}, month = {2000///}, pages = {972 -975 vol.1 - 972 -975 vol.1}, abstract = {In network delivery of digital video, if the bandwidth required for a video is not available, the video has to be recoded at a reduced bit rate. It is highly desirable that the transcoding is carried out in real time while maintaining reasonable image quality. In this paper, we propose a fast approach to derive from an MPEG stream a new MPEG stream with half the spatial resolution. For the downsized video, we first generate from the original compressed video an improved estimate of the motion vectors. We then propose a compressed domain approach with data hiding to produce DCT residues by an open-loop method. The computational complexity is significantly lower than a number of previous approaches. Simulation suggests that our approach produces reasonable image quality}, keywords = {approach;computational, coding;, coding;video, complexity;data, compression;data, cosine, DCT, delivery;open-loop, domain, encapsulation;discrete, estimation;network, estimation;transform, hiding;digital, method;spatial, quality;motion, reduction;video, residues;MPEG, resolution, resolution;motion, stream;compressed, transcoding;computational, transforms;image, vectors, video;downsized, video;image}, doi = {10.1109/ICIP.2000.901123}, author = {Yin,Peng and M. Wu and Liu,Bede} } @article {16658, title = {Distinguishing systems and distinguishing senses: New evaluation methods for word sense disambiguation}, journal = {Natural language engineering}, volume = {5}, year = {1999}, month = {1999///}, pages = {113 - 133}, author = {Resnik, Philip and Yarowsky,D.} } @conference {18311, title = {Estimation of composite object and camera image motion}, booktitle = {The Proceedings of the Seventh IEEE International Conference on Computer Vision, 1999}, volume = {1}, year = {1999}, month = {1999///}, pages = {190-197 vol.1 - 190-197 vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {An approach for estimating composite independent object and camera image motions is proposed. The approach employs spatio-temporal flow models learned through observing typical movements of the object, to decompose image motion into independent object and camera motions. The spatio-temporal flow models of the object motion are represented as a set of orthogonal flow bases that are learned using principal component analysis of instantaneous flow measurements from a stationary camera. These models are then employed in scenes with a moving camera to extract motion trajectories relative to those learned. The performance of the algorithm is demonstrated on several image sequences of rigid and articulated bodies in motion}, keywords = {articulated bodies, camera image motion, camera image motions, CAMERAS, composite independent object, composite object estimation, Computer vision, Educational institutions, Image sequences, instantaneous flow measurements, Laboratories, Layout, Motion analysis, Motion estimation, motion trajectories, orthogonal flow bases, Principal component analysis, spatio-temporal flow models, tracking, Vehicles}, isbn = {0-7695-0164-8}, doi = {10.1109/ICCV.1999.791217}, author = {Yacoob,Yaser and Davis, Larry S.} } @conference {15386, title = {Gate leakage current simulation by Boltzmann transport equation and its dependence on the gate oxide thickness}, booktitle = {Simulation of Semiconductor Processes and Devices, 1999. SISPAD {\textquoteright}99. 1999 International Conference on}, year = {1999}, month = {1999///}, pages = {247 - 250}, abstract = {As device dimensions shrink toward 0.1 mu;m, gate oxides are becoming so thin that MOSFET gate leakage current and oxide degradation are becoming limiting issues. We provide a more rigorous way to calculate gate leakage current. To achieve this we build upon the Spherical Harmonic Method of modeling, which deterministically solves the Boltzmann equation for an entire device. The method gives the distribution function and is 1000 times faster than MC. Once the distribution function is calculated, the tunneling probability is derived from the first principle WKB method. The barrier lowering effect is accounted for by the method of image charges. We calculate gate leakage current as a function of DC bias. The thermionic and tunneling components are compared at different DC bias points. The dependence of gate leakage current on gate oxide thickness is simulated}, keywords = {30, angstrom;60, angstrom;Boltzmann, Bias, calculations;leakage, charges;spherical, component;tunneling, current, currents;semiconductor, dependence;method, dependence;MOSFET;barrier, device, effect;distribution, equation;DC, equation;MOSFET;WKB, function;first, harmonic, image, leakage, lowering, method, method;gate, model;thermionic, models;tunnelling;, of, oxide, principle, probability;Boltzmann, simulation;gate, thickness, transport, WKB}, doi = {10.1109/SISPAD.1999.799307}, author = {Han,Zhiyi and Lin,Chung-Kai and Goldsman,N. and Mayergoyz, Issak D and Yu,S. and Stettler,M.} } @article {18248, title = {Multi-level data hiding for digital image and video}, journal = {SPIE Photonics East{\textquoteright}99}, year = {1999}, month = {1999///}, abstract = {Previous works on data hiding generally targeted on a specific tradeoff between capacity and robustness. This results inoverestimation of the processing noise under some situations and/or underestimation under some other situations, hence limits the overall performance. In this paper, we propose a multi-level data hiding scheme which is able to convey secondary data in high rate when noise is not severe and can also convey some data reliably under heavy distortion. The proposed scheme is motivated by a two-category classification of embedding schemes and by a study on detection performance of spread spectrum watermarking. The multi-level data hiding has been successfully applied to both digital image and video, and can be used for applications such as copy control. }, author = {Wu,M. and Yu,H. and Gelman,A.} } @article {18303, title = {Temporal multi-scale models for flow and acceleration}, journal = {International Journal of Computer Vision}, volume = {32}, year = {1999}, month = {1999///}, pages = {147 - 163}, author = {Yacoob,Yaser and Davis, Larry S.} } @conference {18323, title = {Tracking rigid motion using a compact-structure constraint}, booktitle = {Computer Vision, 1999. The Proceedings of the Seventh IEEE International Conference on}, volume = {1}, year = {1999}, month = {1999///}, pages = {198 -205 vol.1 - 198 -205 vol.1}, abstract = {An approach for tracking the motion of a rigid object using parameterized flow models and a compact-structure constraint is proposed. While polynomial parameterized flow models have been shown to be effective in tracking the rigid motion of planar objects, these models are inappropriate for tracking moving objects that change appearance revealing their 3D structure. We extend these models by adding a structure-compactness constraint that accounts for image motion that deviates from a planar structure. The constraint is based on the assumption that object structure variations are limited with respect to planar object projection onto the image plane and therefore can be expressed as a direct constraint on the image motion. The performance of the algorithm is demonstrated on several long image sequences of rigidly moving objects}, keywords = {compact-structure constraint, image motion, Image sequences, Motion estimation, parameterized flow models, polynomial parameterized flow models, Polynomials, rigid motion tracking, rigid object, rigidly moving objects, structure-compactness constraint, tracking}, doi = {10.1109/ICCV.1999.791218}, author = {Yacoob,Yaser and Davis, Larry S.} } @conference {18324, title = {A framework for modeling appearance change in image sequences}, booktitle = {Computer Vision, 1998. Sixth International Conference on}, year = {1998}, month = {1998/01//}, pages = {660 - 667}, abstract = {Image ldquo;appearance rdquo; may change over time due to a variety of causes such as: 1) object or camera motion; 2) generic photometric events including variations in illumination (e.g. shadows) and specular reflections; and 3) ldquo;iconic changes rdquo; which are specific to the objects being viewed and include complex occlusion events and changes in the material properties of the objects. We propose a general framework for representing and recovering these ldquo;appearance changes rdquo; in an image sequence as a ldquo;mixture rdquo; of different causes. The approach generalizes previous work on optical flow to provide a richer description of image events and more reliable estimates of image motion}, keywords = {appearance change, camera motion, complex occlusion events, generic photometric events, iconic changes, illumination, image motion, Image sequences, Motion estimation, optical flow}, doi = {10.1109/ICCV.1998.710788}, author = {Black,M. J and Fleet,D. J and Yacoob,Yaser} } @article {15227, title = {Low Degree Spanning Trees of Small Weight}, volume = {UMIACS-TR-94-1}, year = {1998}, month = {1998/10/15/}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Given n points in the plane, the degree-K spanning tree problemasks for a spanning tree of minimum weight in which the degree of each vertex is at most K. This paper addresses the problem of computing low-weight degree-K spanning trees for K>2. It is shown that for an arbitrary collection of n points in the plane, there exists a spanning tree of degree three whose weight is at most 1.5 times the weight of a minimum spanning tree. It is shown that there exists a spanning tree of degree four whose weight is at most 1.25 times the weight of a minimum spanning tree. These results solve open problems posed by Papadimitriou and Vazirani. Moreover, if a minimum spanning tree is given as part of the input, the trees can be computed in O(n) time. The results are generalized to points in higher dimensions. It is shown that for any d [greater than or equal to] 3, an arbitrary collection of points in DimD contains a spanning tree of degree three, whose weight is at most 5/3 times the weight of a minimum spanning tree. This is the first paper that achieves factors better than two for these problems. (Also cross-referenced as UMIACS-TR-94-1) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu//handle/1903/611}, author = {Khuller, Samir and Raghavachari,Balaji and Young,Neal} } @conference {18325, title = {Parameterized modeling and recognition of activities}, booktitle = {Computer Vision, 1998. Sixth International Conference on}, year = {1998}, month = {1998/01//}, pages = {120 - 127}, abstract = {A framework for modeling and recognition of temporal activities is proposed. The modeling of sets of exemplar activities is achieved by parameterizing their representation in the form of principal components. Recognition of spatio-temporal variants of modeled activities is achieved by parameterizing the search in the space of admissible transformations that the activities can undergo. Experiments on recognition of articulated and deformable object motion from image motion parameters are presented}, keywords = {activities recognition, admissible transformations, articulated object motion, deformable object motion, exemplar activities, image motion parameters, Image sequences, Motion estimation, parameterized modeling, recognition, spatio-temporal variants}, doi = {10.1109/ICCV.1998.710709}, author = {Yacoob,Yaser and Black,M. J} } @conference {18321, title = {Learning parameterized models of image motion}, booktitle = {Computer Vision and Pattern Recognition, 1997. Proceedings., 1997 IEEE Computer Society Conference on}, year = {1997}, month = {1997/06//}, pages = {561 - 567}, abstract = {A framework for learning parameterized models of optical flow from image sequences is presented. A class of motions is represented by a set of orthogonal basis flow fields that are computed from a training set using principal component analysis. Many complex image motions can be represented by a linear combination of a small number of these basis flows. The learned motion models may be used for optical flow estimation and for model-based recognition. For optical flow estimation we describe a robust, multi-resolution scheme for directly computing the parameters of the learned flow models from image derivatives. As examples we consider learning motion discontinuities, non-rigid motion of human mouths, and articulated human motion}, keywords = {image motion, Image sequences, learning, learning (artificial intelligence), model-based recognition, Motion estimation, multi-resolution scheme, non-rigid motion, optical flow, optical flow estimation, parameterized models, Principal component analysis, training set}, doi = {10.1109/CVPR.1997.609381}, author = {Black,M. J and Yacoob,Yaser and Jepson,A. D and Fleet,D. J} } @article {15223, title = {A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees}, journal = {Journal of Algorithms}, volume = {24}, year = {1997}, month = {1997/08//}, pages = {310 - 324}, abstract = {Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vertex, the problem of computing a low-weight spanning tree such that the degree of each vertex is at most its specified bound is considered. In particular, modifying a given spanning treeTusingadoptionsto meet the degree constraints is considered. A novel network-flow-based algorithm for finding a good sequence of adoptions is introduced. The method yields a better performance guarantee than any previous algorithm. If the degree constraintd(v) for eachvis at least 2, the algorithm is guaranteed to find a tree whose weight is at most the weight of the given tree times 2\&$\#$xa0;-\&$\#$xa0;min{(d(v)\&$\#$xa0;-\&$\#$xa0;2)/(degT(v)\&$\#$xa0;-\&$\#$xa0;2)\&$\#$xa0;:\&$\#$xa0;degT(v)\&$\#$xa0;\>\&$\#$xa0;2}, where degT(v) is the initial degree ofv. Equally importantly, it takes this approach to the limit in the following sense: if any performance guarantee that is solely a function of the topology and edge weights of a given tree holds foranyalgorithm at all, then it also holds for the given algorithm. Examples are provided in which no lighter tree meeting the degree constraint exists. Linear-time algorithms are provided with the same worst-case performance guarantee. ChoosingTto be a minimum spanning tree yields approximation algorithms with factors less than 2 for the general problem on geometric graphs with distances induced by variousLpnorms. Finally, examples of Euclidean graphs are provided in which the ratio of the lengths of an optimal Traveling Salesman path and a minimum spanning tree can be arbitrarily close to 2.}, isbn = {0196-6774}, doi = {10.1006/jagm.1997.0862}, url = {http://www.sciencedirect.com/science/article/pii/S0196677497908622}, author = {Fekete,S{\'a}ndor P and Khuller, Samir and Klemmstein,Monika and Raghavachari,Balaji and Young,Neal} } @conference {16663, title = {A perspective on word sense disambiguation methods and their evaluation}, booktitle = {Proceedings of the ACL SIGLEX workshop on tagging text with lexical semantics: Why, what, and how}, volume = {86}, year = {1997}, month = {1997///}, author = {Resnik, Philip and Yarowsky,D.} } @conference {18315, title = {Temporal Multi-scale Models for Image Motion Estimation}, booktitle = {Image Understanding Workshop: proceedings of a workshop held in New Orleans, Louisiana, May 11-14, 1997}, volume = {1}, year = {1997}, month = {1997///}, pages = {135 - 135}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {18305, title = {Visual surveillance of human activity}, journal = {Computer Vision{\textemdash}ACCV{\textquoteright}98}, year = {1997}, month = {1997///}, pages = {267 - 274}, author = {Davis, Larry S. and Fejes,S. and Harwood,D. and Yacoob,Yaser and Hariatoglu,I. and Black,M.} } @conference {18322, title = {Computing 3-D head orientation from a monocular image sequence}, booktitle = {Automatic Face and Gesture Recognition, 1996., Proceedings of the Second International Conference on}, year = {1996}, month = {1996/10//}, pages = {242 - 247}, abstract = {An approach for estimating 3D head orientation in a monocular image sequence is proposed. The approach employs recently developed image-based parameterized tracking for face and face features to locate the area in which a sub-pixel parameterized shape estimation of the eye{\textquoteright}s boundary is performed. This involves tracking of five points (four at the eye corners and the fifth is the lip of the nose). The authors describe an approach that relies on the coarse structure of the face to compute orientation relative to the camera plane. Our approach employs projective invariance of the cross-ratios of the eye corners and anthropometric statistics to estimate the head yaw, roll and pitch. Analytical and experimental results are reported}, keywords = {3D head orientation computation, anthropometric statistics, camera plane, coarse structure, eye, eye boundary, eye corners, face features, face recognition, Feature extraction, head pitch, head roll, head yaw, Image sequences, image-based parameterized tracking, monocular image sequence, projective cross-ratio invariance, sub-pixel parameterized shape estimation, tracking}, doi = {10.1109/AFGR.1996.557271}, author = {Horprasert,T. and Yacoob,Yaser and Davis, Larry S.} } @article {16656, title = {Feature discovery and classification of Doppler umbilical artery blood flow velocity waveforms}, journal = {Computers in Biology and Medicine}, volume = {26}, year = {1996}, month = {1996/11//}, pages = {451 - 462}, abstract = {Doppler umbilical artery blood flow velocity waveform measurements are used in perinatal surveillance for the evaluation of fetal condition. There is an ongoing debate on the predictive value of Doppler measurements concerning the critical effect of the selection of parameters for the interpretation of Doppler waveforms. In this paper, we describe how neural network methods can be used both to discover relevant classification features and subsequently to classify Doppler umbilical artery blood flow velocity waveforms. Results obtained from 199 normal and high risk patients{\textquoteright} umbilical artery waveforms highlighted a classification concordance varying from 90 to 98\% accuracy.}, keywords = {Doppler umbilical artery blood flow velocity waveforms, Feature extraction, IMAGE PROCESSING, Pattern classification}, isbn = {0010-4825}, doi = {10.1016/S0010-4825(96)00018-2}, url = {http://www.sciencedirect.com/science/article/pii/S0010482596000182}, author = {Baykal,Nazife and Reogia,James A. and Yalabik,Nese and Erkmen,Aydan and Beksac,M.Sinan} } @conference {18306, title = {Recognition of head gestures using hidden markov models}, booktitle = {Pattern Recognition, 1996., Proceedings of the 13th International Conference on}, volume = {3}, year = {1996}, month = {1996///}, pages = {461 - 465}, author = {Morimoto,C. and Yacoob,Yaser and Davis, Larry S.} } @article {18317, title = {Recognizing human facial expressions from long image sequences using optical flow}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {18}, year = {1996}, month = {1996/06//}, pages = {636 - 642}, abstract = {An approach to the analysis and representation of facial dynamics for recognition of facial expressions from image sequences is presented. The algorithms utilize optical flow computation to identify the direction of rigid and nonrigid motions that are caused by human facial expressions. A mid-level symbolic representation motivated by psychological considerations is developed. Recognition of six facial expressions, as well as eye blinking, is demonstrated on a large set of image sequences}, keywords = {Computer vision, Eyebrows, face recognition, facial dynamics, Facial features, human facial expression recognition, HUMANS, Image motion analysis, image recognition, image representation, Image sequences, Motion analysis, Motion estimation, Optical computing, optical flow, symbolic representation, tracking}, isbn = {0162-8828}, doi = {10.1109/34.506414}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {15221, title = {On strongly connected digraphs with bounded cycle length}, journal = {Discrete Applied Mathematics}, volume = {69}, year = {1996}, month = {1996/08/27/}, pages = {281 - 289}, abstract = {Given a directed graph G = (V, E), a natural problem is to choose a minimum number of the edges in E such that, for any two vertices u and v, if there is a path from u to v in E, then there is a path from u to v among the chosen edges. We show that in graphs having no directed cycle with more than three edges, this problem is equivalent to Maximum Bipartite Matching. This leads to a small improvement in the performance guarantee of the previous best approximation algorithm for the general problem.}, isbn = {0166-218X}, doi = {10.1016/0166-218X(95)00105-Z}, url = {http://www.sciencedirect.com/science/article/pii/0166218X9500105Z}, author = {Khuller, Samir and Raghavachari,Balaji and Young,Neal} } @article {15216, title = {Approximating the minimum equivalent digraph}, journal = {SIAM Journal on Computing (SICOMP)}, volume = {24}, year = {1995}, month = {1995///}, pages = {859 - 872}, author = {Khuller, Samir and Raghavachari,B. and Young,N.} } @article {15217, title = {Balancing minimum spanning trees and shortest-path trees}, journal = {Algorithmica}, volume = {14}, year = {1995}, month = {1995///}, pages = {305 - 321}, abstract = {We give a simple algorithm to find a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous tradeoff: given the two trees and agamma>0, the algorithm returns a spanning tree in which the distance between any vertex and the root of the shortest-path tree is at most 1+radic2gamma times the shortest-path distance, and yet the total weight of the tree is at most 1+radic2/gamma times the weight of a minimum spanning tree. Our algorithm runs in linear time and obtains the best-possible tradeoff. It can be implemented on a CREW PRAM to run a logarithmic time using one processor per vertex.}, doi = {10.1007/BF01294129}, author = {Khuller, Samir and Raghavachari,B. and Young,N.} } @conference {13560, title = {Generating Synthetic Data for Text Analysis Systems}, booktitle = {SDAIR}, year = {1995}, month = {1995///}, pages = {449 - 467}, abstract = {In this paper we describe work on a sys-tem for modeling errors in the output of OCR systems. The project is motivated by the desire to evaluate the performance of various text analysis systems under varying, yet controlled conditions. We describe a set of symbol and page models which are used to degrade an ideal text by introducing er- rors which typically occur during scanning, decomposition and recognition of document images. A rst generation of the software is described which implements the page mod- els and allows the use of transition proba- bilities, either extracted from real data or generated synthetically, to corrupt text. }, author = {David Doermann and Yao,S.} } @article {12768, title = {Optimality in abstractions of model checking}, journal = {Static Analysis}, year = {1995}, month = {1995///}, pages = {51 - 63}, author = {Cleaveland, Rance and Iyer,P. and Yankelevich,D.} } @conference {18316, title = {Tracking and recognizing rigid and non-rigid facial motions using local parametric models of image motion}, booktitle = {Computer Vision, 1995. Proceedings., Fifth International Conference on}, year = {1995}, month = {1995///}, pages = {374 - 381}, author = {Black,M. J and Yacoob,Yaser} } @article {12816, title = {Fully abstract characterizations of testing preorders for probabilistic processes}, journal = {CONCUR{\textquoteright}94: Concurrency Theory}, year = {1994}, month = {1994///}, pages = {497 - 512}, author = {Yuen,S. and Cleaveland, Rance and Dayar,Z. and Smolka,S.} } @article {18319, title = {Human Emotion Recognition From Motion Using A Radial Basis Function Network Architecture}, journal = {University Of Maryland}, year = {1994}, month = {1994///}, author = {Mark,R. and Yaser,Y. and Larry,D.} } @conference {16629, title = {Interpretation of Doppler blood flow velocity waveforms using neural networks.}, booktitle = {Proceedings of the Annual Symposium on Computer Application in Medical Care}, year = {1994}, month = {1994///}, pages = {865 - 865}, author = {Baykal,N. and Reggia, James A. and Yalabik,N. and Erkmen,A. and Beksac,M. S.} } @article {18304, title = {Labeling of Human Face Components from Range Data}, journal = {CVGIP: Image Understanding}, volume = {60}, year = {1994}, month = {1994/09//}, pages = {168 - 178}, abstract = {An approach to labeling the components of human faces from range images is proposed. The components of interest are those humans usually find significant for recognition. To cope with the nonrigidity of faces, an entirely qualitative approach is used. The preprocessing stage employs a multistage diffusion process to identify convexity and concavity points. These points are grouped into components and qualitative reasoning about possible interpretations of the components is performed. Consistency of hypothesized interpretations is carried out using context-based reasoning. Experimental results on real range images of several faces are provided.}, isbn = {1049-9660}, doi = {10.1006/ciun.1994.1045}, url = {http://www.sciencedirect.com/science/article/pii/S104996608471045X}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {15820, title = {The linear algebra of block quasi-newton algorithms}, journal = {Linear Algebra and its Applications}, volume = {212{\textendash}213}, year = {1994}, month = {1994/11/15/}, pages = {153 - 168}, abstract = {The quasi-Newton family of algorithms for minimizing functions and solving systems of nonlinear equations has achieved a great deal of computational success and forms the core of many software libraries for solving these problems. In this work we extend the theory of the quasi-Newton algorithms to the block case, in which we minimize a collection of functions having a common Hessian matrix, or we solve a collection of nonlinear equations having a common Jacobian matrix. This paper focuses on the linear algebra: update formulas, positive definiteness, least-change secant properties, relation to block conjugate gradient algorithms, finite termination for quadratic function minimization or solving linear systems, and the use of the quasi-Newton matrices as preconditioners.}, isbn = {0024-3795}, doi = {10.1016/0024-3795(94)90401-4}, url = {http://www.sciencedirect.com/science/article/pii/0024379594904014}, author = {O{\textquoteright}Leary, Dianne P. and Yeremin,A.} } @conference {12850, title = {An operational framework for value-passing processes}, booktitle = {Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages}, series = {POPL {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {326 - 338}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper develops a semantic framework for concurrent languages with value passing. An operation analogous to substitution in the \&lgr;-calculus is given, and a semantics is given for a value-passing version of Milner{\textquoteright}s Calculus of Communicating Systems (CCS). An operational equivalence is then defined and shown to coincide with Milner{\textquoteright}s (early) bisimulation equivalence. We also show how semantics maybe given for languages with asynchronous communication primitives. In contrast with existing approaches to value passing, this semantics does not reduce data exchange to pure synchronization over (potentially infinite) families of ports indexed by data, and it avoids variable renamings that are not local to processes engaged in communication.}, isbn = {0-89791-636-0}, doi = {10.1145/174675.177941}, url = {http://doi.acm.org/10.1145/174675.177941}, author = {Cleaveland, Rance and Yankelevich,Daniel} } @article {15212, title = {A primal-dual parallel approximation technique applied to weighted set and vertex covers}, journal = {Journal Algorithms}, volume = {17}, year = {1994}, month = {1994///}, pages = {280 - 289}, author = {Khuller, Samir and Vishkin, Uzi and Young,N.} } @conference {18297, title = {Early vision processing using a multi-stage diffusion process}, booktitle = {1993 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1993. Proceedings CVPR {\textquoteright}93}, year = {1993}, month = {1993/06//}, pages = {41 - 46}, publisher = {IEEE}, organization = {IEEE}, abstract = {The use of a multistage diffusion process in the early processing of range data is examined. The input range data are interpreted as occupying a volume in 3-D space. Each diffusion stage simulates the process of diffusing part of the boundary of the volume into the volume. The outcome of the process can be used for both discontinuity detection and segmentation into shape homogeneous regions. The process is applied to synthetic noise-free and noisy step, roof, and valley edges as well as to real range images}, keywords = {3-D space, Computational modeling, Computer vision, Diffusion processes, discontinuity detection, early vision processing, Educational institutions, Image edge detection, Image segmentation, Laboratories, multistage diffusion process, Noise shaping, noise-free edges, noisy edges, Performance analysis, roof edges, segmentation, SHAPE, shape homogeneous regions, step edges, valley edges}, isbn = {0-8186-3880-X}, doi = {10.1109/CVPR.1993.341003}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {16471, title = {An Experimental Study of Three Dataflow Paradigms in Multithreaded Database Transitive Closure Algorithms on Shared Memory Multiprocessors}, journal = {Journal of Parallel and Distributed Computing}, volume = {18}, year = {1993}, month = {1993/07//}, pages = {371 - 389}, abstract = {This paper describes an experimental study of three dataflow paradigms, namely, no dataflow, pipelined dataflow, and network dataflow, in multithreaded database transitive closure algorithms on shared memory multiprocessors. This study shows that dataflow paradigm directly influences performance parameters such as the amount of interthread communication, how data are partitioned among the threads, whether access to each page of data is exclusive or shared, whether locks are needed for concurrency control, and how calculation termination is detected. The algorithm designed with no dataflow outperforms the algorithms with dataflow. Approximately linear speedup is achieved by the no dataflow algorithm with sufficient workload and primary memory. An exclusive access working set model and a shared access working set model describe the interactions between two or more threads' working sets when access to each page of data is exclusive or shared among the threads, respectively. These models are experimentally verified.}, isbn = {0743-7315}, doi = {10.1006/jpdc.1993.1071}, url = {http://www.sciencedirect.com/science/article/pii/S0743731583710713}, author = {Youngmyers,H. and Raschid, Louiqa} } @article {16929, title = {A graphical filter/flow representation of Boolean queries: A prototype implementation and evaluation}, journal = {Journal of the American Society for Information Science}, volume = {44}, year = {1993}, month = {1993/07/01/}, pages = {327 - 339}, abstract = {One of the powerful applications of Boolean expression is to allow users to extract relevant information from a database. Unfortunately, previous research has shown that users have difficulty specifying Boolean queries. In an attempt to overcome this limitation, a graphical Filter/Flow representation of Boolean queries was designed to provide users with an interface that visually conveys the meaning of the Boolean operators (AND, OR, and NOT). This was accomplished by implementing a graphical interface prototype that uses the metaphor of water flowing through filters. Twenty subjects having no experience with Boolean logic participated in an experiment comparing the Boolean operations represented in the Filter/Flow interface with a text-only SQL interface. The subjects independently performed five comprehension tasks and five composition tasks in each of the interfaces. A significant difference (p < 0.05) in the total number of correct queries in each of the comprehension and composition tasks was found favoring Filter/Flow. {\textcopyright} 1993 John Wiley \& Sons, Inc.}, isbn = {1097-4571}, doi = {10.1002/(SICI)1097-4571(199307)44:6<327::AID-ASI3>3.0.CO;2-J}, url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1097-4571(199307)44:6\%3C327::AID-ASI3\%3E3.0.CO;2-J/abstract;jsessionid=76B714851135D8044D4E03335B4D39A0.d01t04}, author = {Young,Degi and Shneiderman, Ben} } @article {15032, title = {Systolic architectures for finite-state vector quantization}, journal = {The Journal of VLSI Signal Processing}, volume = {5}, year = {1993}, month = {1993///}, pages = {249 - 259}, abstract = {We present a new systolic architecture for implementing Finite State Vector Quantization in real-time for both speech and image data. This architecture is modular and has a very simple control flow. Only one processor is needed for speech compression. A linear array of processors is used for image compression; the number of processors needed is independent of the size of the image. We also present a simple architecture for converting line-scanned image data into the format required by this systolic architecture. Image data is processed at a rate of 1 pixel per clock cycle. An implementation at 31.5 MHz can quantize 1024{\texttimes}1024 pixel images at 30 frames/sec in real-time. We describe a VLSI implementation of these processors.}, doi = {10.1007/BF01581299}, author = {Kolagotla,R. K. and Yu,S. S. and JaJa, Joseph F.} } @conference {16491, title = {Transitive closure: an experimental case study of three multithreaded database algorithms on a shared memory multiprocessor}, booktitle = {Parallel and Distributed Information Systems, 1993., Proceedings of the Second International Conference on}, year = {1993}, month = {1993///}, pages = {255 - 259}, author = {Young-Myers,H. and Raschid, Louiqa} } @article {15049, title = {VLSI implementation of a tree searched vector quantizer}, journal = {Signal Processing, IEEE Transactions on}, volume = {41}, year = {1993}, month = {1993/02//}, pages = {901 - 905}, abstract = {The VLSI design and implementation of a tree-searched vector quantizer is presented. The number of processors needed is equal to the depth of the tree. All processors are identical, and data flow between processors is regular. No global control signals are needed. The processors have been fabricated using 2 mu;m N-well process on a 7.9 times;9.2 mm die. Each processor chip contains 25000 transistors and has 84 pins. The processors have been thoroughly tested at a clock frequency of 20 MHz}, keywords = {(mathematics);, 2, 20, chips;, coding;, compression;, data, design;, digital, image, implementation;, MHz;, micron;, PROCESSING, quantisation;, quantizer;, searched, signal, tree, TREES, vector, VLSI, VLSI;}, isbn = {1053-587X}, doi = {10.1109/78.193225}, author = {Kolagotla,R. K. and Yu,S.-S. and JaJa, Joseph F.} } @book {16928, title = {A Graphical Filter/flow Representation of Boolean Queries: A Prototype Implementation}, year = {1992}, month = {1992///}, publisher = {University of Maryland, Center for Automation Research, Computer Vision Laboratory}, organization = {University of Maryland, Center for Automation Research, Computer Vision Laboratory}, author = {Young,D. and Shneiderman, Ben} } @conference {18294, title = {Ground and airborne localization over rough terrain using random environmental range-measurements}, booktitle = {Pattern Recognition, 1992. Vol. I. Conference A: Computer Vision and Applications, Proceedings., 11th IAPR International Conference on}, year = {1992}, month = {1992///}, pages = {403 - 406}, author = {Yacoob,Yaser and Davis, Larry S.} } @article {17971, title = {Six Generations of Building Walkthrough: Final Technical Report to the National Science Foundation}, year = {1992}, month = {1992///}, institution = {University of North Carolina at Chapel Hill}, address = {Chapel Hill, NC, USA}, author = {Brooks,Frederick P. and Airey,John and Alspaugh,John and Bell,Andrew and Brown,Randolph and Hill,Curtis and Nimscheck,Uwe and Rheingans,Penny and Rohlf,John and Smith,Dana and Turner,Douglass and Varshney, Amitabh and Wang,Yulan and Weber,Hans and Yuan,Xialin} } @article {15045, title = {VLSI Architectures and Implementation of Predictive Tree- Searched Vector Quantizers for Real-Time Video Compression}, volume = {ISR-TR-1992-48}, year = {1992}, month = {1992///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {We describe a pipelined systolic architecture for implementing predictive Tree-Searched Vector Quantization (PTSVQ) for real- time image and speech coding applications. This architecture uses identical processors for both the encoding and decoding processes. the overall design is regular and the control is simple. Input data is processed at a rate of 1 pixel per clock cycle, which allows real-time processing of images at video rates. We implemented these processors using 1.2um CMOS technology. Spice simulations indicate correct operation at 40 MHz. Prototype version of these chips fabricated using 2um CMOS technology work at 20 MHz.}, keywords = {data compression, IMAGE PROCESSING, Signal processing, Speech processing, Systems Integration, systolic architecture, Vector quantization, VLSI architectures}, url = {http://drum.lib.umd.edu/handle/1903/5230}, author = {Yu,S.-S. and Kolagotla,Ravi K. and JaJa, Joseph F.} } @book {16577, title = {Abductive Inference Models for Diagnostic Problem-Solving}, year = {1990}, month = {1990///}, publisher = {Springer-Verlag, New York}, organization = {Springer-Verlag, New York}, author = {Yun,P. and Reggia, James A.} } @conference {18301, title = {Displaying voxel-based objects according to their qualitative shape synthesis}, booktitle = {Proceedings of the 1st conference on Visualization{\textquoteright}90}, year = {1990}, month = {1990///}, pages = {51 - 58}, author = {Yacoob,Yaser} } @conference {18307, title = {3D object recognition via simulated particles diffusion}, booktitle = {IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1989. Proceedings CVPR {\textquoteright}89}, year = {1989}, month = {1989/06//}, pages = {442 - 449}, publisher = {IEEE}, organization = {IEEE}, abstract = {A novel approach for 3D object recognition is presented. This approach is model-based, and assumes either 3D or 21/2 D scene acquisition. Transformation detection is accomplished along with an object identification (six degrees of freedom, three rotational and three translational, are assumed). The diffusion-like simulation recently introduced as a means for characterization of shape is used in the extraction of point features. The point features represent regions on the object{\textquoteright}s surface that are extreme in curvature (i.e. concavities and convexities). Object matching is carried out by examining the correspondence between the object{\textquoteright}s set of point features and the model{\textquoteright}s set of point features, using an alignment strategy. Triangles are constructed between all possible triples of object{\textquoteright}s point features, and then are aligned to candidate corresponding triangles of the model{\textquoteright}s point features. 21/2 range images are transformed into a volumetric representation through a parallel projection onto the 3-D space. The resultant volume is suitable for processing by the diffusion-like simulation}, keywords = {3D object recognition, alignment strategy, Computational modeling, Computer science, data mining, Gold, Layout, Noise shaping, Object detection, Object recognition, parallel projection, pattern recognition, point features, radio access networks, scene acquisition, shape characterisation, Shape measurement, simulated particles diffusion, transformation detection}, isbn = {0-8186-1952-x}, doi = {10.1109/CVPR.1989.37886}, author = {Yacoob,Yaser and Gold,Y. I} } @article {16648, title = {Functional and psychosocial effects of multimodality limb-sparing therapy in patients with soft tissue sarcomas}, journal = {Journal of Clinical Oncology}, volume = {7}, year = {1989}, month = {1989///}, pages = {1217 - 1217}, author = {Chang,A. E and Steinberg,S. M and Culnane,M. and Lampert,M. H and Reggia, James A. and Simpson,C. G and Hicks,J. E and White,D. E and Yang,J. J and Glatstein,E.} } @conference {17278, title = {Lessons learned from the ACM hypertext on hypertext project}, booktitle = {Proceedings of the second annual ACM conference on Hypertext}, series = {HYPERTEXT {\textquoteright}89}, year = {1989}, month = {1989///}, pages = {385 - 386}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-339-6}, doi = {10.1145/74224.74255}, url = {http://doi.acm.org/10.1145/74224.74255}, author = {Rous,B. and Shneiderman, Ben and Yankelovich,N. and Yoder,E.} } @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 {16751, title = {SEES{\textemdash}A Software testing Environment Support System}, journal = {IEEE Transactions on Software Engineering}, volume = {SE-11}, year = {1985}, month = {1985/04//}, pages = {355 - 366}, abstract = {SEES is a database system to support program testing. The program database is automatically created during the compilation of the program by a compiler built using the YACC compiler-compiler.}, keywords = {Computer architecture, Database systems, Error correction, Program processors, Programming profession, Relational databases, Software testing, software tools, Workstations, Writing}, isbn = {0098-5589}, doi = {10.1109/TSE.1985.232225}, author = {Roussopoulos, Nick and Yeh,R. T} } @conference {16813, title = {A Programming Environment Framework Based on Reusability}, booktitle = {Proceedings of the First International Conference on Data Engineering}, year = {1984}, month = {1984///}, pages = {277 - 280}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, isbn = {0-8186-0533-2}, url = {http://dl.acm.org/citation.cfm?id=645470.655219}, author = {Yeh,Raymond T. and Mittermeir,Roland and Roussopoulos, Nick and Reed,Joylyn} } @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 {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.} } @conference {16770, title = {Systematic Derivation of Software Requirements}, booktitle = {Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design}, year = {1980}, month = {1980///}, pages = {403 - 404}, author = {Yeh,R. Y and Roussopoulos, Nick and Chang,P.} } @article {15748, title = {Elastoplastic torsion by quadratic programming}, journal = {Computer Methods in Applied Mechanics and Engineering}, volume = {16}, year = {1978}, month = {1978/12//}, pages = {361 - 368}, abstract = {A finite element scheme (together with a conjugate gradient algorithm) is demonstrated to be a very effective method for analyzing general elastoplastic torsion of prismatic bars posed as quadratic programming problems. Solutions for bars with elliptical and Sokolovsky{\textquoteright}s oval cross-sections are presented. The solutions for the elliptical bars agree with the existing elastic and limit plastic solutions at the two extremes of the elastic-plastic range. The algorithm also reproduces accurately the Sokolovsky solution and extends it beyond its limitations.}, isbn = {0045-7825}, doi = {10.1016/0045-7825(78)90107-X}, url = {http://www.sciencedirect.com/science/article/pii/004578257890107X}, author = {O{\textquoteright}Leary, Dianne P. and Yang,Wei H.} }